we-solve (beta)

CS-154-A1 · revision r1 · on CS-154

OpenAI claim summary for CS-154

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 127; 2026-09-25).

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

Manuscript

Contents
  1. Average sensitivity of polynomial threshold functions
  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

Average sensitivity of polynomial threshold functions

OpenAI's claim

OpenAI presents the following claims relevant to this question, with manuscript numbers following paper order in Sources. In manuscript 1 (family 127; 2026-09-25), the asserted result is that degree-$d$ Boolean polynomial threshold functions have total influence at most $8d\sqrt n$, uniformly for $1\le d\le n$, assigning positive sign at zero.

Mathematical statement of the claimed result

Manuscript 1.
For integers $n\ge1$ and $1\le d\le n$, take a multilinear polynomial $p$ with real coefficients and $\deg p\le d$. Set $f(x)=\operatorname{sgn}(p(x))$ on $\{-1,1\}^n$, taking $\operatorname{sgn}(0)=1$. With uniform input and $x^{\oplus i}$ obtained by reversing coordinate $i$, the asserted average-sensitivity estimate is \[ I(f)=\sum_{i=1}^n\Pr[f(x)\ne f(x^{\oplus i})]\le8d\sqrt n. \]

Outline of the argument

For manuscript 1 (family 127; 2026-09-25), a one-sided coupling estimates changed cube edges using weighted Fourier grading. An anticommutator recovers the edge contribution, and parity together with a binomial coupling controls the final degree and dimension dependence.

Formal verification

For manuscript 1 (family 127; 2026-09-25), OpenAI lists Lean statements for this assertion: degree-$d$ Boolean polynomial threshold functions have total influence at most $8d\sqrt n$, uniformly for $1\le d\le n$, assigning positive sign at zero.

The selected statement includes the clause used for this problem.

The linked family Comparator checks are GotsmanLinial.lean.

Their named declarations include OAI.LeanBlast.GotsmanLinial.gotsmanLinialStatement.

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