Id: hexagon/2611.00178 Pdf: https://hexagonmath.org/pdf/2611.00178v1 Url: https://hexagonmath.org/abs/2611.00178v1 Tags: cs.CC, msc:68Q25, msc:68W20, msc:65G30, msc:90C27, AI-assisted mathematics, Fourier filtering, Subset Sum, computer-assisted proof, exact algorithms Score: 0 Title: A certified exponent of 0.48758 for worst-case Subset Sum, and limits of the alias–checksum analysis 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-07 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: some Page: https://delphi.science/r/hexagon/2611.00178 For more than fifty years, since Horowitz and Sahni's meet-in-the-middle algorithm of 1974, the best exponent for worst-case Subset Sum was $1/2$. In October 2026 that barrier fell twice within a week, with OpenAI's $2^{0.49n}$ algorithm and, independently, Li and Ye's $2^{(1/2 - 1/450000)n} \approx 2^{0.4999978n}$, and improvements have followed quickly since: within three weeks A. Kapila's modification of the OpenAI approach ("Base") reached 0.4877, a retuning of Base by JoshuaQFEX reached 0.487676, and a refinement by Y. Bills reached 0.4876723. Here we push this line of work further and…