{"schema_version":"source-reader-v1","record":{"source_id":"prime-gaps-212","versions":[{"work":{"authors":["François Charton","Letong Hong","Kenny Lau","Ken Ono","Guillaume Remy","Ho Chung Siu","Ashvin A. Swaminathan","Jesse Thorner","Yunzhou Xie"],"kind":"research_paper","publication":"preprint","publication_note":"Public manuscript or exposition; publication does not imply independent OpenMath review.","ai_role":"self_reported","ai_note":"The nine authors supply the mathematics, building on Julia Stadlmann and earlier sieve work. AxiomProver is credited with generating a formal deduction; this is not a claim that the model independently discovered the mathematical bound.","artifacts":[],"published":{"value":"2026-09-03"}},"id":"prime-gaps:source:212:v2","source_id":"prime-gaps-212","title":"A new bound for small gaps between primes","owner":"François Charton, Letong Hong, Kenny Lau, Ken Ono, Guillaume Remy, Ho Chung Siu, Ashvin A. Swaminathan, Jesse Thorner, Yunzhou Xie","url":"https://primegaps.axiommath.ai/bgp212.pdf","subject_scope":"The preliminary draft states H₁ ≤ 212 and explains the analytic and exact rational calculations. Its appendix reports a formal deduction with analytic and variational hypotheses.","revision":"2026-09-03","content_sha256":"2b307ae26046dffd2153fe7466e5a9a302976dc3ba5142151a8a8104a37b3d80","update_method":"Source comparison followed by a new immutable curation revision.","identifier_policy":"Stable source and entry identities; changed wording receives a new version.","observed_on":"2026-10-13","source_updated_on":"2026-09-03","rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://primegaps.axiommath.ai/bgp212.pdf","attribution":"François Charton, Letong Hong, Kenny Lau, Ken Ono, Guillaume Remy, Ho Chung Siu, Ashvin A. Swaminathan, Jesse Thorner, Yunzhou Xie","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}],"entries":[{"id":"prime-gaps:entry:212:v2","source_version_id":"prime-gaps:source:212:v2","item_id":"212","url":"https://primegaps.axiommath.ai/bgp212.pdf","wording":"The preliminary draft states H₁ ≤ 212 and explains the analytic and exact rational calculations. Its appendix reports a formal deduction with analytic and variational hypotheses.","wording_kind":"paraphrase","locator":"Theorem 1.1; introduction’s prior bounds; Appendix A, Formal certificate by AxiomProver","supersedes":"prime-gaps:entry:212:v1"}],"problems":[{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7}],"selected_version_id":"prime-gaps:source:212:v2","available_versions":[{"id":"prime-gaps:source:212:v2","revision":"2026-09-03","observed_on":"2026-10-13","title":"A new bound for small gaps between primes","publication":"preprint","content_sha256":"2b307ae26046dffd2153fe7466e5a9a302976dc3ba5142151a8a8104a37b3d80","used_in_current_publications":true},{"id":"prime-gaps:source:212:v1","revision":"2026-09-03","observed_on":"2026-10-13","title":"Bounded gaps between primes: the 212 bound","publication":"preprint","content_sha256":"2b307ae26046dffd2153fe7466e5a9a302976dc3ba5142151a8a8104a37b3d80","used_in_current_publications":false}],"usages":[{"id":"source-use-ccae51825778e56dd78d","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"activity","title":"The 212 certificate is reported in the paper","claim":null,"fragment":"activity","assessment":null,"superseded":false,"formalization":null,"update":{"id":"prime-gaps-212-certificate","title":"The 212 certificate is reported in the paper","kind":"formalization","source_entry_ids":["prime-gaps:entry:212:v2"],"summary":"The appendix credits AxiomProver with a Lean deduction that assumes five equidistribution estimates, bilinear Bombieri–Vinogradov, Harman decomposition and the variational certificate.","limitation":"No exact public commit or declaration for that 212 certificate was established by this source check; it is shown as a paper-reported artifact, not a fabricated formal-code link.","related_claim_ids":["claim-prime-gaps-bound-212"]}},{"id":"source-use-0fe6f8f4f796359eea9f","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"assessment","title":"Historical bounds recorded in the paper","claim":{"id":"claim-prime-gaps-bound-240","version":2,"slug":"prime-gaps-bound-240","title":"Gaps at most 240, infinitely often"},"fragment":"claim-prime-gaps-bound-240","assessment":{"id":"prime-gaps:report:earlier:v2","entry_id":"prime-gaps:entry:212:v2","state":"resolved","source_label":"Historical bounds recorded in the paper","scope":"Zhang, Maynard and Stadlmann bounded-gap results.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://primegaps.axiommath.ai/bgp212.pdf","supersedes":"prime-gaps:report:earlier:v1"},"superseded":false,"formalization":null,"update":null},{"id":"source-use-78bc8854c9c5187b137e","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"assessment","title":"The preliminary draft proves H₁ ≤ 212","claim":{"id":"claim-prime-gaps-bound-212","version":2,"slug":"prime-gaps-bound-212","title":"Gaps at most 212, infinitely often"},"fragment":"claim-prime-gaps-bound-212","assessment":{"id":"prime-gaps:report:212:v2","entry_id":"prime-gaps:entry:212:v2","state":"resolved","source_label":"The preliminary draft proves H₁ ≤ 212","scope":"The paper’s unconditional assertion; formalization assumes analytic and variational inputs.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://primegaps.axiommath.ai/bgp212.pdf","supersedes":"prime-gaps:report:212:v1"},"superseded":false,"formalization":null,"update":null},{"id":"source-use-8160943de2d0e68d9f6b","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"assessment","title":"Historical bounds recorded in the paper","claim":{"id":"claim-prime-gaps-bound-600","version":3,"slug":"prime-gaps-bound-600","title":"Gaps at most 600, infinitely often"},"fragment":"claim-prime-gaps-bound-600","assessment":{"id":"prime-gaps:report:earlier:v2","entry_id":"prime-gaps:entry:212:v2","state":"resolved","source_label":"Historical bounds recorded in the paper","scope":"Zhang, Maynard and Stadlmann bounded-gap results.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://primegaps.axiommath.ai/bgp212.pdf","supersedes":"prime-gaps:report:earlier:v1"},"superseded":false,"formalization":null,"update":null},{"id":"source-use-dcd4190afff21c1955b0","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"assessment","title":"Historical bounds recorded in the paper","claim":{"id":"claim-prime-gaps-bound-70000000","version":3,"slug":"prime-gaps-bound-70000000","title":"Gaps at most 70,000,000, infinitely often"},"fragment":"claim-prime-gaps-bound-70000000","assessment":{"id":"prime-gaps:report:earlier:v2","entry_id":"prime-gaps:entry:212:v2","state":"resolved","source_label":"Historical bounds recorded in the paper","scope":"Zhang, Maynard and Stadlmann bounded-gap results.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://primegaps.axiommath.ai/bgp212.pdf","supersedes":"prime-gaps:report:earlier:v1"},"superseded":false,"formalization":null,"update":null},{"id":"source-use-0a5aaba8f9285d19aeff","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"bound","title":"H₁","claim":{"id":"claim-prime-gaps-bound-70000000","version":3,"slug":"prime-gaps-bound-70000000","title":"Gaps at most 70,000,000, infinitely often"},"fragment":"claim-prime-gaps-bound-70000000","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-0c7cf20eb4dd4445fa17","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"bound","title":"H₁","claim":{"id":"claim-prime-gaps-bound-600","version":3,"slug":"prime-gaps-bound-600","title":"Gaps at most 600, infinitely often"},"fragment":"claim-prime-gaps-bound-600","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-1ea80858f9dfff2410ea","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"bound","title":"H₁","claim":{"id":"claim-prime-gaps-twin-primes","version":2,"slug":"prime-gaps-twin-primes","title":"Gaps of two infinitely often"},"fragment":"claim-prime-gaps-twin-primes","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-ac8e79e7f1901823fb55","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"bound","title":"H₁","claim":{"id":"claim-prime-gaps-bound-240","version":2,"slug":"prime-gaps-bound-240","title":"Gaps at most 240, infinitely often"},"fragment":"claim-prime-gaps-bound-240","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-ffcf31fd8a9fc97e0cfb","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"bound","title":"H₁","claim":{"id":"claim-prime-gaps-bound-212","version":2,"slug":"prime-gaps-bound-212","title":"Gaps at most 212, infinitely often"},"fragment":"claim-prime-gaps-bound-212","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-11a90569d57a83a0b845","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"milestone","title":"Maynard introduces a multidimensional sieve","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-262fa92f43badb80162a","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"milestone","title":"Stadlmann lowers the mathematical bound to 240","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-387aab5cfc5b1f7cc9b3","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"milestone","title":"A preliminary draft reaches 212","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-cbda66566033421e8ee2","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"milestone","title":"Zhang establishes bounded gaps","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-ed5ecbd73dc85147f8c4","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"question","title":"How small can prime gaps be?","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-06195fcee2b74638e520","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"reading","title":"Read the mathematical argument; inspect its Claim for assessment and scope.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-3e184180dd044f2a9108","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"statement","title":"Gaps of two infinitely often","claim":{"id":"claim-prime-gaps-twin-primes","version":2,"slug":"prime-gaps-twin-primes","title":"Gaps of two infinitely often"},"fragment":"claim-prime-gaps-twin-primes","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-4b4ec4eb0e0f8cdac098","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"statement","title":"Gaps at most 70,000,000, infinitely often","claim":{"id":"claim-prime-gaps-bound-70000000","version":3,"slug":"prime-gaps-bound-70000000","title":"Gaps at most 70,000,000, infinitely often"},"fragment":"claim-prime-gaps-bound-70000000","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-a920e5a89982ab2bba89","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"statement","title":"Gaps at most 212, infinitely often","claim":{"id":"claim-prime-gaps-bound-212","version":2,"slug":"prime-gaps-bound-212","title":"Gaps at most 212, infinitely often"},"fragment":"claim-prime-gaps-bound-212","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-ce1de4ecdde46d849aac","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"statement","title":"Gaps at most 600, infinitely often","claim":{"id":"claim-prime-gaps-bound-600","version":3,"slug":"prime-gaps-bound-600","title":"Gaps at most 600, infinitely often"},"fragment":"claim-prime-gaps-bound-600","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-e27a7b724e1be4e73934","entry_id":"prime-gaps:entry:212:v2","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"statement","title":"Gaps at most 240, infinitely often","claim":{"id":"claim-prime-gaps-bound-240","version":2,"slug":"prime-gaps-bound-240","title":"Gaps at most 240, infinitely often"},"fragment":"claim-prime-gaps-bound-240","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}