{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BYK7UBACVXUCWG7JVNIPTITFT7","short_pith_number":"pith:BYK7UBAC","schema_version":"1.0","canonical_sha256":"0e15fa0402ade82b1be9ab50f9a2659fe9c88a0c607ca2c0c01f33cdb4089439","source":{"kind":"arxiv","id":"1908.08613","version":3},"attestation_state":"computed","paper":{"title":"Large prime gaps and probabilistic models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Kevin Ford, Terence Tao, William Banks","submitted_at":"2019-08-22T22:33:17Z","abstract_excerpt":"We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we obtain heuristic upper and lower bounds for the size of the largest prime gap in the interval $[1,x]$. Our results are stated in terms of the extremal bounds in the interval sieve problem. The same methods also allow us to rigorously relate the validity of the Hardy-Littlewood conjectures for an arbitrary set (such as the actual primes) to lower bounds for t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1908.08613","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-22T22:33:17Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"787e9bbf07aeddd555dbf097a242c90c2457031e9ae3897d93b2484156046aea","abstract_canon_sha256":"f4039df26e3dd2ffd8b3f5f2195c5cc5d4fb39ecb72ef6e743b70143e23255ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:10.632146Z","signature_b64":"srmN094nXqEIhq7FuFnD9sjCo8spsI20ugQOziS5J0VNAU95gTXHP54gdZcdjNK9gXnX08vlWBfQbDoo7SzmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e15fa0402ade82b1be9ab50f9a2659fe9c88a0c607ca2c0c01f33cdb4089439","last_reissued_at":"2026-07-05T11:52:10.631637Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:10.631637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large prime gaps and probabilistic models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.NT","authors_text":"Kevin Ford, Terence Tao, William Banks","submitted_at":"2019-08-22T22:33:17Z","abstract_excerpt":"We introduce a new probabilistic model of the primes consisting of integers that survive the sieving process when a random residue class is selected for every prime modulus below a specific bound. From a rigorous analysis of this model, we obtain heuristic upper and lower bounds for the size of the largest prime gap in the interval $[1,x]$. Our results are stated in terms of the extremal bounds in the interval sieve problem. The same methods also allow us to rigorously relate the validity of the Hardy-Littlewood conjectures for an arbitrary set (such as the actual primes) to lower bounds for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.08613","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.08613/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1908.08613","created_at":"2026-07-05T11:52:10.631704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.08613v3","created_at":"2026-07-05T11:52:10.631704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.08613","created_at":"2026-07-05T11:52:10.631704+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYK7UBACVXUC","created_at":"2026-07-05T11:52:10.631704+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYK7UBACVXUCWG7J","created_at":"2026-07-05T11:52:10.631704+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYK7UBAC","created_at":"2026-07-05T11:52:10.631704+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23014","citing_title":"The Poisson Tail Conjecture for Primes in Short Intervals","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYK7UBACVXUCWG7JVNIPTITFT7","json":"https://pith.science/pith/BYK7UBACVXUCWG7JVNIPTITFT7.json","graph_json":"https://pith.science/api/pith-number/BYK7UBACVXUCWG7JVNIPTITFT7/graph.json","events_json":"https://pith.science/api/pith-number/BYK7UBACVXUCWG7JVNIPTITFT7/events.json","paper":"https://pith.science/paper/BYK7UBAC"},"agent_actions":{"view_html":"https://pith.science/pith/BYK7UBACVXUCWG7JVNIPTITFT7","download_json":"https://pith.science/pith/BYK7UBACVXUCWG7JVNIPTITFT7.json","view_paper":"https://pith.science/paper/BYK7UBAC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.08613&json=true","fetch_graph":"https://pith.science/api/pith-number/BYK7UBACVXUCWG7JVNIPTITFT7/graph.json","fetch_events":"https://pith.science/api/pith-number/BYK7UBACVXUCWG7JVNIPTITFT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYK7UBACVXUCWG7JVNIPTITFT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYK7UBACVXUCWG7JVNIPTITFT7/action/storage_attestation","attest_author":"https://pith.science/pith/BYK7UBACVXUCWG7JVNIPTITFT7/action/author_attestation","sign_citation":"https://pith.science/pith/BYK7UBACVXUCWG7JVNIPTITFT7/action/citation_signature","submit_replication":"https://pith.science/pith/BYK7UBACVXUCWG7JVNIPTITFT7/action/replication_record"}},"created_at":"2026-07-05T11:52:10.631704+00:00","updated_at":"2026-07-05T11:52:10.631704+00:00"}