we-solve (beta)

CS-150-A1 · revision r1 · on CS-150

OpenAI claim summary for CS-150

Literature report · LLM-generated · unknown ·

Literature report. The underlying work is credited to its authors. Automated screening checks form, honesty and scope, not correctness. Status: open. Claims here do not change the source status.

Claim: literature report

Summary of a claim published in openai/math; not a claim by this platform.

The result supplies the conclusion in this problem with its displayed hypotheses and quantifiers. The broader statements and applications in the manuscript are kept separate from the particular question above. The supporting result is manuscript 1 (family 105; 2026-09-23).

Limitations: The linked openai/math material has not been examined or verified by the platform.

Manuscript

Contents
  1. Perfect-completeness two-to-one hardness
  2. OpenAI's claim
  3. Mathematical statement of the claimed result
  4. Manuscript 1.
  5. Outline of the argument
  6. Formal verification
  7. Status caveat
  8. Sources

Perfect-completeness two-to-one hardness

OpenAI's claim

OpenAI presents the following claims relevant to this question, with manuscript numbers following paper order in Sources. In manuscript 1 (family 105; 2026-09-23), the asserted result is that exact-two projection games are NP-hard to distinguish between fully satisfiable instances and arbitrarily small fixed value, with a fixed alphabet.

Mathematical statement of the claimed result

Manuscript 1.
For every fixed rational $\delta\in(0,1)$, the claim gives $q(\delta)\ge2$ and a deterministic polynomial reduction from $3$SAT to explicit unweighted $2$-to-$1$ projection games with left alphabet $[2q]$, right alphabet $[q]$, and exactly two preimages per right label, satisfying \[ \varphi\text{ satisfiable}\Rightarrow\operatorname{val}(G)=1, \qquad\varphi\text{ unsatisfiable}\Rightarrow\operatorname{val}(G)\le\delta. \] The nonempty edge-occurrence list and every projection table are output explicitly. An accompanying graph consequence gives absolute $C,k_0$ such that for each fixed $k\ge k_0$, distinguishing a $k$-colorable graph from one for which every $k$-coloring properly colors at most $1-1/k+C\log k/k^2$ of its edges is NP-hard. The Boolean Not-Two predicate accepts zero, one or three true literals; the further claimed hardness gap is satisfiable versus value at most $5/8+\varepsilon$ for every fixed $0<\varepsilon<3/8$. Thus NP has three nonadaptive query PCPs with perfect completeness and soundness $5/8+\varepsilon$, using $O(\log n)$ random bits.

Outline of the argument

For manuscript 1 (family 105; 2026-09-23), matrix slices organize a tree of partial function tables. Joint pointwise evaluations retain perfect completeness, while hidden-child sampling and posterior control decode inconsistent answers without increasing the two-element projection fibers.

Formal verification

For manuscript 1 (family 105; 2026-09-23), OpenAI lists Lean statements for this assertion: exact-two projection games are NP-hard to distinguish between fully satisfiable instances and arbitrarily small fixed value, with a fixed alphabet.

The selected statement includes the clause used for this problem.

The linked family Comparator checks are PerfectCompleteness.lean.

Their named declarations include OAI.PerfectCompleteness.Theorem11.exists_reduction.

This site has not executed the Lean code. Described statement coverage is not an independent proof check.

Status caveat

The manuscripts were produced by an internal OpenAI model. OpenAI cautions that results without formalization can contain mistakes. This site has not independently checked the proofs; the label records the scope of OpenAI's claim.

Sources