[#R1798] Dated status and exact unresolved remainder
claim. Unresolved in this packet after the dated source check. Strongest checked result: The 2-to-2 Games Theorem gives NP-hardness at completeness about 1/2 and arbitrarily small soundness. A 2025 route toward 2-to-1 Games remains conditional. Exact unresolved remainder: Prove the near-1 versus near-0 NP-hardness gap for every epsilon, or refute it by an algorithm or complexity argument.
1Summary
The packet's cited sources and equivalent formulations were checked in the dated review recorded below.
Strongest checked result: The 2-to-2 Games Theorem gives NP-hardness at completeness about 1/2 and arbitrarily small soundness. A 2025 route toward 2-to-1 Games remains conditional.
Supported evidence. Replay readiness: source only.
2Evidence
A verification source is cited. This record has no executable replay attached.
Verification source: theoryofcomputing.org ↗, Abstract and introduction
3Overview
Exact unresolved remainder: Prove the near-1 versus near-0 NP-hardness gap for every epsilon, or refute it by an algorithm or complexity argument.
4What was measured
- As of
- 2026-08-01
- Strongest known result
- The 2-to-2 Games Theorem gives NP-hardness at completeness about 1/2 and arbitrarily small soundness. A 2025 route toward 2-to-1 Games remains conditional.
- Exact open remainder
- Prove the near-1 versus near-0 NP-hardness gap for every epsilon, or refute it by an algorithm or complexity argument.
5How it connects
Supersedes
- claim
Recorded for
- problem
6Agent packet
A compact handoff with the evidence boundary, replay manifest, and relation pointers.
View structured packet
{
"schema": "theoremdb-agent-record-v1",
"ref": "R1798",
"content_hash": null,
"slug": "unique-games-conjecture-status-packet-quality-20260801",
"type": "claim",
"title": "Dated status and exact unresolved remainder",
"summary": "Unresolved in this packet after the dated source check. Strongest checked result: The 2-to-2 Games Theorem gives NP-hardness at completeness about 1/2 and arbitrarily small soundness. A 2025 route toward 2-to-1 Games remains conditional. Exact unresolved remainder: Prove the near-1 versus near-0 NP-hardness gap for every epsilon, or refute it by an algorithm or complexity argument.",
"relevance": "For Unique Games conjecture, this successor gives readable dated status prose and the exact remaining research boundary.",
"relevance_source": "recorded",
"body": "The packet's cited sources and equivalent formulations were checked in the dated review recorded below.\n\nStrongest checked result: The 2-to-2 Games Theorem gives NP-hardness at completeness about 1/2 and arbitrarily small soundness. A 2025 route toward 2-to-1 Games remains conditional.\n\nExact unresolved remainder: Prove the near-1 versus near-0 NP-hardness gap for every epsilon, or refute it by an algorithm or complexity argument.",
"status": "reported",
"evidence_grade": "sourced",
"scope": null,
"reproduction": {
"schema": "theoremdb-reproduction-v1",
"readiness": "source_only",
"kind": "claim",
"citation": {
"url": "https://theoryofcomputing.org/articles/v018a005/",
"locator": "Abstract and introduction"
},
"missing": [
"source",
"command",
"runtime",
"expected_output"
]
},
"formal_statement": null,
"source": {
"url": "https://theoryofcomputing.org/articles/v018a005/",
"locator": "Abstract and introduction"
},
"relations": [
{
"slug": "R1172",
"title": "Current status and unresolved remainder",
"object_type": "claim",
"relation": "supersedes",
"direction": "outgoing"
},
{
"slug": "unique-games-conjecture",
"title": "unique games conjecture",
"object_type": "problem",
"relation": "recorded_for",
"direction": "outgoing"
}
]
}7Provenance
View source, identifiers, and projection details
- Project
- unique-games-conjecture-source-review
- Locator
- Abstract and introduction
- License
- CC0-1.0
- Contributors
- TheoremDB maintainers
- Source
- theoryofcomputing.org ↗
- Public record
- R1798
- Stable alias
- unique-games-conjecture-status-packet-quality-20260801
- Projection
- Reproduction fields are derived from the immutable record.
A statement this project treats as settled at the recorded evidence grade, with the work that backs it.