{"schema_version":"source-reader-v1","record":{"source_id":"pnp-claude","versions":[{"work":{"authors":["Josh Alman","Virginia Vassilevska Williams"],"kind":"research_paper","publication":"preprint","publication_note":"Source-reported preprint/project; independent mathematical assessment pending.","ai_role":"self_reported","ai_note":"The authors credit an internal Anthropic Claude model with algorithm discovery and later Lean formalization. They describe their simplification, strengthening, extensions and mathematical responsibility.","artifacts":[{"kind":"pdf","title":"Alman–Vassilevska Williams · Truly subquadratic 3SUM and subcubic APSP — proof text","url":"https://arxiv.org/pdf/2610.06783v1","version":"arXiv-2610.06783v1","assessment":"paper_proof","note":"External source text. Its mathematical claims and independent OpenMath review are assessed separately.","sha256":"d91a79c5dbf1fc662f0c5c1bb2b690ac3d83d9ef5bf872bde4cdaf7cc9e76005"},{"kind":"formal_code","title":"Reported Lean formalization of the main algorithmic results","url":"https://github.com/anthropics/formal-math/tree/e1a4e6508154ea59f030480661590a9fe3018011/3sum-apsp","version":"e1a4e6508154ea59f030480661590a9fe3018011","assessment":"external_report","note":"The authors report Lean certification. The linked snapshot is pinned to the latest path commit observed by 10 October 2026. No local compilation, statement-alignment audit or independent reproduction is asserted by OpenMath."}],"published":{"value":"2026-10-05"}},"id":"pnp-claude@arXiv-2610.06783v1","source_id":"pnp-claude","title":"Alman–Vassilevska Williams · Truly subquadratic 3SUM and subcubic APSP","owner":"Josh Alman; Virginia Vassilevska Williams","url":"https://arxiv.org/pdf/2610.06783v1","subject_scope":"The precise statements and locators cited in this P versus NP research record.","revision":"arXiv-2610.06783v1","content_sha256":"d91a79c5dbf1fc662f0c5c1bb2b690ac3d83d9ef5bf872bde4cdaf7cc9e76005","update_method":"Manual primary-source check; changes require a new source version and staff publication.","identifier_policy":"Source URL and exact theorem/section locator; no inferred identity merge.","observed_on":"2026-10-10","source_updated_on":null,"rights":"metadata-link","license":"Full-text redistribution rights not asserted","terms_url":"https://arxiv.org/pdf/2610.06783v1","attribution":"Josh Alman; Virginia Vassilevska Williams","rights_note":"Only metadata and original OpenMath paraphrases are published; proof PDFs remain at their source.","check_interval_days":30}],"entries":[{"id":"pnp-entry-apsp-2026:v1","source_version_id":"pnp-claude@arXiv-2610.06783v1","item_id":"apsp-2026","url":"https://arxiv.org/pdf/2610.06783v1","wording":"For every fixed ν, all-pairs shortest paths on directed n-vertex graphs with integer edge weights of absolute value at most n^ν and no negative cycles can be computed deterministically in O(n^{2.9995}) time.","wording_kind":"paraphrase","locator":"Theorem 22; abstract; §1.2; Acknowledgments and Methodology","supersedes":null},{"id":"pnp-entry-three-sum-2026:v1","source_version_id":"pnp-claude@arXiv-2610.06783v1","item_id":"three-sum-2026","url":"https://arxiv.org/pdf/2610.06783v1","wording":"For every fixed ν, 3SUM on n integers with absolute value at most n^ν has a deterministic O(n^{1.9992})-time algorithm in the paper’s integer-operation model.","wording_kind":"paraphrase","locator":"Theorem 22 using Corollary 26; §1, numeric bounds; Acknowledgments and Methodology","supersedes":null}],"problems":[{"slug":"p-vs-np","title":"P versus NP","publication_version":14}],"selected_version_id":"pnp-claude@arXiv-2610.06783v1","available_versions":[{"id":"pnp-claude@arXiv-2610.06783v1","revision":"arXiv-2610.06783v1","observed_on":"2026-10-10","title":"Alman–Vassilevska Williams · Truly subquadratic 3SUM and subcubic APSP","publication":"preprint","content_sha256":"d91a79c5dbf1fc662f0c5c1bb2b690ac3d83d9ef5bf872bde4cdaf7cc9e76005","used_in_current_publications":true}],"usages":[{"id":"source-use-9e53734ffceb7bf6fb73","entry_id":"pnp-entry-apsp-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-apsp-2026","version":2,"slug":"pnp-apsp-2026","title":"A truly subcubic deterministic APSP algorithm"},"fragment":"claim-pnp-apsp-2026","assessment":{"id":"pnp-report-apsp-2026:v1","entry_id":"pnp-entry-apsp-2026:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"A fine-grained algorithmic improvement within polynomial time; real-weight and randomized variants have separate guarantees.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://arxiv.org/pdf/2610.06783v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-a7dae8b8f9ea781530de","entry_id":"pnp-entry-apsp-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"AI-assisted algorithms improve 3SUM and APSP","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e6cff643990cbdf71a6e","entry_id":"pnp-entry-apsp-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-9a5ee5f823bfe6a9c0be","entry_id":"pnp-entry-apsp-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"A truly subcubic deterministic APSP algorithm","claim":{"id":"claim-pnp-apsp-2026","version":2,"slug":"pnp-apsp-2026","title":"A truly subcubic deterministic APSP algorithm"},"fragment":"claim-pnp-apsp-2026","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-44516f5731d5f589b2a4","entry_id":"pnp-entry-three-sum-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"assessment","title":"Established implication or scoped theorem in cited mathematics","claim":{"id":"claim-pnp-three-sum-2026","version":2,"slug":"pnp-three-sum-2026","title":"A truly subquadratic deterministic 3SUM algorithm"},"fragment":"claim-pnp-three-sum-2026","assessment":{"id":"pnp-report-three-sum-2026:v1","entry_id":"pnp-entry-three-sum-2026:v1","state":"resolved","source_label":"Established implication or scoped theorem in cited mathematics","scope":"A fine-grained improvement for a problem already solvable in polynomial time; no SAT speedup or P versus NP resolution is claimed.","source_date":null,"observed_on":"2026-10-10","evidence_url":"https://arxiv.org/pdf/2610.06783v1","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-64e006225f293ccc2c50","entry_id":"pnp-entry-three-sum-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"milestone","title":"AI-assisted algorithms improve 3SUM and APSP","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-6137f92758f180d8b911","entry_id":"pnp-entry-three-sum-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"question","title":"P versus NP","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-03fc06d576062cba5c06","entry_id":"pnp-entry-three-sum-2026:v1","problem":{"slug":"p-vs-np","title":"P versus NP","publication_version":14},"kind":"statement","title":"A truly subquadratic deterministic 3SUM algorithm","claim":{"id":"claim-pnp-three-sum-2026","version":2,"slug":"pnp-three-sum-2026","title":"A truly subquadratic deterministic 3SUM algorithm"},"fragment":"claim-pnp-three-sum-2026","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}