What was already known
Prior Kane–Meka gaps and the Arora–Rao–Vazirani upper bound are distinct. This is a relaxation gap, not the cataloged NP-hardness of approximation.
AI involvement
The manuscript credits OpenAI as author, and the pinned release attributes its manuscripts to the internal model. Individual session details are undocumented.
- Near-square-root logarithmic integrality gaps for uniform sparsest cutNear-square-root logarithmic integrality gaps for uniform sparsest cut
- OpenAI mathematics releaseOpenAI mathematics release
Importance
Matches the square-root logarithmic exponent of the earlier upper bound up to iterated logarithmic factors.
Technical verification
OpenAI’s Lean scope identifies the stated ratio with unit pair demands, nonnegative capacities and positive relaxation optimum.
Formal checking
OpenAI’s Lean scope identifies the stated ratio with unit pair demands, nonnegative capacities and positive relaxation optimum.
- Checker
- OpenAI’s reported Lean formalization
- Scope
- OpenAI’s Lean scope identifies the stated ratio with unit pair demands, nonnegative capacities and positive relaxation optimum.
- Basis
- Reported by the linked checker
- OpenAI’s Lean scope for this manuscriptOpenAI’s Lean scope for this manuscript
Human understanding
The reviewed sources do not document a human explanation of the assessed contribution.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision