What was already known
The conjecture requires simultaneously near-perfect completeness and arbitrarily small soundness with an alphabet fixed for those errors. A weaker gap theorem does not establish that quantifier pattern.
What changed and why it matters
Establishes the full stated Unique Games hardness target underlying many approximation thresholds.
The AI contribution
OpenAI attributes these manuscripts to its internal model. The entry does not infer individual human contributions beyond that publisher attribution.
Limitations
The alphabet and reduction constants depend on the fixed errors. NP-hardness does not prove P≠NP, and companion approximation consequences are not separate discoveries in this record. Preprint. This is a source-statement and significance assessment, not a proof audit. No independent checking or successful formal compilation is asserted by this entry.
Verification evidence
Evidence labels show what supports the claim. Importance rates its impact if correct.
Author claim
The publisher reports the scoped result. AIProofWatch has not independently validated its correctness.
Accessible artifact / proof
The original written argument is accessible. Availability does not establish a successful proof check or Lean verification.
Correction and publication history
Historical report added after statement, scope, and importance review. No proof audit or formal checking asserted; subscriber alerts disabled.
Read this published revision