What was already known
Rubinstein, Virza, and Ambainis–Sun had constructed quadratic separations, while the proposed universal quadratic upper bound remained open in the manuscript’s account.
AI involvement
OpenAI credits itself as manuscript author and states that its internal frontier model produced the results in this release. Individual human input is not detailed enough to establish task-only autonomy.
OpenAI is named as author on the manuscript, and its release attributes the results to an internal frontier model. The individual human input is not detailed enough to establish autonomy.
Importance
Disproves the quadratic strengthening of the Sensitivity Conjecture for total Boolean functions.
Limitations
The construction concerns total Boolean functions and does not quantify an optimal exponent relating the two measures.
Technical verification
OpenAI reports a Lean proof matching the selected claim.
Formal checking
The pinned OpenAI Lean scope note identifies this selected claim.
- Checker
- OpenAI-reported Lean 4 / Comparator
- Scope
- There are total Boolean functions with unbounded block sensitivity divided by sensitivity squared; in particular, a fixed exponent α>2 holds along a sequence with unbounded block sensitivity.
- Basis
- Reported by the linked checker
Checking a formal statement does not establish that it matches the original problem.
Human understanding
Few is the default when evidence for a higher level is insufficient. No named person is documented as explaining the central argument for this assessed contribution.
Correction and publication history
Primary manuscript, attribution, prior-work, and scoped checking review for non-notifying local inclusion.
Read this published revision