PreprintCC BY-NC-ND 4.0arXiv
On the OpenAI whole-cube bound
Abstract
This is an essentially derivative note, whose goal is to interpret the 'whole-cube' bound of OpenAI for binary codes in a possibly somewhat more accessible way. This is attained, in part, by connecting it to some previously known results. All of the heavy technical lifting in the interpretation below is also due to the OpenAI language models ChatGPT 5.6 and ChatGPT 6. With that, we hope that the statements of the main results, the ensuing discussion, and the arguments themselves may be of some interest.
Related
- An Improved Lower Bound for Packing 203 Equal Spheres in a Unit Cube
- An m2.943 Bohnenblust--Hille Bound on the Boolean Cube
- A quadratic upper bound on the Chvátal rank of polytopes in the 0/1-cube
- The Deligne--Drinfeld conjecture after OpenAI
- A Note on the OpenAI Construction of Counterexamples to the Kaplansky Direct-Finiteness Conjecture
BibTeX
@misc{samorodnitsky2026openai,
title = {{On the OpenAI whole-cube bound}},
author = {Alex Samorodnitsky},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.26050},
eprint = {2609.26050},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.26050},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - On the OpenAI whole-cube bound
AU - Alex Samorodnitsky
PY - 2026
DA - 2026/09/22
PB - arXiv
DO - 10.48550/arxiv.2609.26050
UR - https://arxiv.org/abs/2609.26050
AB - This is an essentially derivative note, whose goal is to interpret the 'whole-cube' bound of OpenAI for binary codes in a possibly somewhat more accessible way. This is attained, in part, by connecting it to some previously known results. All of the heavy technical lifting in the interpretation below is also due to the OpenAI language models ChatGPT 5.6 and ChatGPT 6. With that, we hope that the statements of the main results, the ensuing discussion, and the arguments themselves may be of some interest.
ER -