WRSWorld Research StateContribute
WORLD RESEARCH STATE

OpenAI: The Unique Games Conjecture

Reported result · significance if the exact claim is established

If verified · conditional significanceClaim scope and evidenceReported result · not independently verified.
If verified · reference score650,000Editorial revision range 400,000–900,000. Not a statistical interval. Included in rankings as an unverified reported result; excluded from achieved-science progress totals.

Provisional assessment of the stated contribution scope. Scientific evidence and contributor attribution are separate.

Scientific record data (JSON) · Challenge or correct a rating

What is claimed?

The paper claims a deterministic polynomial-time reduction from 3SAT to Unique Games for every fixed completeness and soundness error in (0,1/2), over an alphabet depending only on those errors.

Scientific scope

The reduction does not prove P!=NP. Earlier conditional approximation results and their authors retain their contribution credit; the conjecture and direct companion reductions are not all one new theorem. WRS inspected the selected opening statement and available scope note, not the full proof; independent formal replay was not run.

Evidence state

The manuscript reports a proof. WRS has not independently audited the complete argument or replayed the reported formalization. The grade and score here express conditional significance; they do not certify correctness. The provisional value enters the main reference rankings with an unverified label, but not achieved-science progress totals.

Full scientific record · Challenge or correct this assessment