What was already known
Zak conjectured a gap below two for the ordinary pattern relaxation. Martinovic and Scheithauer proved that bound for divisible sizes. The earlier OpenAI manuscript supplies hard bin-packing instances and hardness, while Winnington’s paper transfers them to the distinct bin-covering objective.
AI involvement
Winnington’s repository credits Claude Fable 5.1 and GPT-5.6 Sol Pro with generating the proof. His announcement credits Fable with helping identify the problem, which Winnington selected. The paper separately credits ChatGPT for drafting, literature organization and proof analysis.
- Unbounded Integrality Gaps and Additive Hardness for the Skiving Stock ProblemUnbounded Integrality Gaps and Additive Hardness for the Skiving Stock Problem
Importance
The result would refute a longstanding conjecture on the standard relaxation and extend the obstruction to the proper relaxation, with the stated dependence on the source result.
Technical verification
The paper supplies a proof of the transfer. Its discussion of Lean concerns the earlier packing result. A completed check of the covering transfer is undocumented.
- Winnington’s proof-generation disclosureWinnington’s proof-generation disclosure
- Winnington’s announcementWinnington’s announcement
- Additive hardness and unbounded configuration gaps in bin packingAdditive hardness and unbounded configuration gaps in bin packing
Human understanding
The sources document the author’s problem selection and give the argument, but do not identify a human account of the transfer proof independent of the AI-generated exposition.
Correction and publication history
Historical curation based on the cited claim, AI attribution and checking scope.
Read this published revision