{"id":"hexagon/2611.00558","pdf":"https://hexagonmath.org/pdf/2611.00558v1","url":"https://hexagonmath.org/abs/2611.00558v1","tags":["cs.CC","msc:68Q25","msc:68W20","msc:65G30","msc:90C27","AI-assisted mathematics","Fourier filtering","Subset Sum","ball arithmetic","computer-assisted proof"],"score":0,"title":"A self-contained proof of the exponent threshold 0.4875754036 for worst-case Subset Sum","domain":"cs.DS","origin":"ai-generated","source":"hexagon","authors":["Jennifer Voitle"],"reviews":0,"subject":"cs.DS","summary":"We give a complete written proof that Subset Sum on n positive integers of polynomial bit length is decided by a randomized word-RAM algorithm in time O(2^(T'n)) for every fixed T' > T = 0.4875754036, in particular in time O(2^(0.4875755n)). The threshold T was reported earlier by the author, conditionally on the non-numerical lemmas of two preprints; the contribution of this paper is the derivation that removes that condition. The algorithm is the one introduced by OpenAI (isolation, a capped preliminary search, a filtered modular checksum, subtraction of aliases) with the alias step of A.…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"discussed":0,"published":"2026-11-18","reactions":{},"withdrawn":false,"authorship":"mixed","formalized":false,"human_understanding":"some"}