{"schema_version":"source-reader-v1","record":{"source_id":"prime-gaps-polymath","versions":[{"work":{"authors":["D. H. J. Polymath"],"kind":"research_paper","publication":"published","publication_note":"Peer-reviewed historical result.","ai_role":"not_reported","ai_note":"No AI contribution is asserted by this source record.","artifacts":[],"published":{"value":"2014"}},"id":"prime-gaps:source:polymath:v1","source_id":"prime-gaps-polymath","title":"Variants of the Selberg sieve, and bounded intervals containing many primes","owner":"D. H. J. Polymath","url":"https://arxiv.org/abs/1407.4897v2","subject_scope":"The published Polymath8b argument establishes an unconditional recurring prime gap at most 246; the twin-prime target remains out of reach.","revision":"2014","content_sha256":null,"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":null,"rights":"metadata-link","license":"Original document rights remain with its authors.","terms_url":"https://arxiv.org/abs/1407.4897v2","attribution":"D. H. J. Polymath","rights_note":"OpenMath supplies original paraphrases and links; no proof text is republished.","check_interval_days":90}],"entries":[{"id":"prime-gaps:entry:polymath:v1","source_version_id":"prime-gaps:source:polymath:v1","item_id":"polymath","url":"https://arxiv.org/abs/1407.4897v2","wording":"The published Polymath8b argument establishes an unconditional recurring prime gap at most 246; the twin-prime target remains out of reach.","wording_kind":"paraphrase","locator":"Main bounded-gap results and introduction","supersedes":null}],"problems":[{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7}],"selected_version_id":"prime-gaps:source:polymath:v1","available_versions":[{"id":"prime-gaps:source:polymath:v1","revision":"2014","observed_on":"2026-10-13","title":"Variants of the Selberg sieve, and bounded intervals containing many primes","publication":"published","content_sha256":null,"used_in_current_publications":true}],"usages":[{"id":"source-use-5359a973cfb0a61c6656","entry_id":"prime-gaps:entry:polymath:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"assessment","title":"Bounded gaps established; twin primes remain unresolved","claim":null,"fragment":"research-state","assessment":{"id":"prime-gaps:report:target-open:v1","entry_id":"prime-gaps:entry:polymath:v1","state":"partly_resolved","source_label":"Bounded gaps established; twin primes remain unresolved","scope":"H₁ = 2 remains unresolved despite finite upper bounds.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://arxiv.org/abs/1407.4897v2","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-b4c26b226b2ba9ed77a7","entry_id":"prime-gaps:entry:polymath:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"assessment","title":"Twin primes remain unresolved","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":{"id":"prime-gaps:report:twin-target-open:v1","entry_id":"prime-gaps:entry:polymath:v1","state":"reported_open","source_label":"Twin primes remain unresolved","scope":"H₁ = 2 remains unresolved despite finite upper bounds.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://arxiv.org/abs/1407.4897v2","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-c771452f87ed62657dd8","entry_id":"prime-gaps:entry:polymath:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"assessment","title":"Unconditional H₁ ≤ 246","claim":{"id":"claim-prime-gaps-bound-246","version":2,"slug":"prime-gaps-bound-246","title":"Gaps at most 246, infinitely often"},"fragment":"claim-prime-gaps-bound-246","assessment":{"id":"prime-gaps:report:246:v1","entry_id":"prime-gaps:entry:polymath:v1","state":"resolved","source_label":"Unconditional H₁ ≤ 246","scope":"Published Polymath8b bound.","source_date":null,"observed_on":"2026-10-13","evidence_url":"https://arxiv.org/abs/1407.4897v2","supersedes":null},"superseded":false,"formalization":null,"update":null},{"id":"source-use-23877ccc3acc6fb5577e","entry_id":"prime-gaps:entry:polymath:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"bound","title":"H₁","claim":{"id":"claim-prime-gaps-bound-246","version":2,"slug":"prime-gaps-bound-246","title":"Gaps at most 246, infinitely often"},"fragment":"claim-prime-gaps-bound-246","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-be8535d624248e994cf5","entry_id":"prime-gaps:entry:polymath:v1","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-ba7bfdf892989c8eb51b","entry_id":"prime-gaps:entry:polymath:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"definition","title":"Limit inferior H₁","claim":null,"fragment":"question","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-afbf549288f886c7b694","entry_id":"prime-gaps:entry:polymath:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"milestone","title":"Polymath8b reaches 246","claim":null,"fragment":"history","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-0b85cc775ae4cad319e4","entry_id":"prime-gaps:entry:polymath:v1","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-1eac9fa6090ef8918c24","entry_id":"prime-gaps:entry:polymath:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"reading","title":"Read the setting and notation before comparing the results.","claim":null,"fragment":"provenance","assessment":null,"superseded":false,"formalization":null,"update":null},{"id":"source-use-983ef723908e8e7fd7d0","entry_id":"prime-gaps:entry:polymath:v1","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-ffb001f50b7f480dacf7","entry_id":"prime-gaps:entry:polymath:v1","problem":{"slug":"prime-gaps","title":"How small can prime gaps be?","publication_version":7},"kind":"statement","title":"Gaps at most 246, infinitely often","claim":{"id":"claim-prime-gaps-bound-246","version":2,"slug":"prime-gaps-bound-246","title":"Gaps at most 246, infinitely often"},"fragment":"claim-prime-gaps-bound-246","assessment":null,"superseded":false,"formalization":null,"update":null}],"linked_entries":[],"linked_sources":[]}}