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 Category: research Comments: 0 Disputed: false Division: cs Mentions: 0 Discussed: 0 Published: 2026-11-18 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00558 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.…