What was already known
Prior approximate counting covers fixed row count or restricted margins. The cataloged exact sampler has no individual cell bounds and is a distinct companion.
AI involvement
The manuscript credits OpenAI as author, and the pinned release attributes its manuscripts to the internal model. Individual session details are undocumented.
- An FPRAS for Cell-Bounded Contingency TablesAn FPRAS for Cell-Bounded Contingency Tables
- OpenAI mathematics releaseOpenAI mathematics release
Importance
A fully polynomial approximate counter for varying dimensions with arbitrary binary-encoded bounds.
Technical verification
OpenAI’s selected Lean scope explicitly includes the cell-bounded FPRAS and zero-count guarantee in addition to the separate sampling theorem.
Formal checking
OpenAI’s selected Lean scope explicitly includes the cell-bounded FPRAS and zero-count guarantee in addition to the separate sampling theorem.
- Checker
- OpenAI’s reported Lean formalization
- Scope
- OpenAI’s selected Lean scope explicitly includes the cell-bounded FPRAS and zero-count guarantee in addition to the separate sampling theorem.
- 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