What was already known
Prior general algorithms saved subpolynomial factors; the 3SUM and APSP hypotheses asserted no fixed polynomial improvement.
What changed and why it matters
Changes the fine-grained algorithmic baseline and the conditional-hardness hypotheses built on these problems.
The AI contribution
The paper explicitly credits Claude with discovering the core algorithm; the named authors understood, simplified, strengthened and extended it and take responsibility for the paper.
Limitations
Preprint; enormous constants prevent a practical-speedup conclusion. The formal project states a sharper APSP exponent (2.99942), which is not substituted for the paper’s 2.9995 claim. AIProofWatch has not checked the algorithms or compiled the formalization. SETH and Orthogonal Vectors are not resolved.
Verification evidence
Evidence labels show what supports the claim. Importance rates its impact if correct.
Author claim
Abstract and methodology state both the algorithms and Claude’s discovery role.
Accessible artifact / proof
Formal project is available; no AIProofWatch recompilation claimed.
Correction and publication history
The original paper now establishes the AI discovery attribution left unassessed by the earlier artifact-only record. Correct original report date and distinguish the paper’s numerical bound from the formal project. Full update; no subscriber alerts.
Read this published revisionHistorical seed, researched for the initial catalog. Initial alerting disabled.
Read this published revision