Unbounded Integrality Gaps and Additive Hardness for the Skiving Stock Problem

Eric Winnington

Assuming the cited OpenAI bin-packing results, for every integer c≥0c\ge 0 there is a rational one-dimensional bin-covering instance with 5B items and integer B, for which both pattern LP relaxations have value B but at most B−c−1B-c-1 disjoint groups reach the covering threshold. The transfer also makes every fixed additive allowance NP-hard.

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 AI-led

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.

Importance Notable

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 Reported

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.

Human understanding Few

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