{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CRO2G4MTNLJUOLVEJWGAZRIQPT","short_pith_number":"pith:CRO2G4MT","schema_version":"1.0","canonical_sha256":"145da371936ad3472ea44d8c0cc5107cf5c5326cf98c8cea3ea8ff9cb83af502","source":{"kind":"arxiv","id":"2605.14871","version":1},"attestation_state":"computed","paper":{"title":"On Maximal Prime Gaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Cheng-TIng Wang","submitted_at":"2026-05-14T14:18:31Z","abstract_excerpt":"In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than $4\\log^2{p_n}$. We also show that the result implies the existence of a prime number in a certain type of interval for large enough numbers as a consequence."},"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":"2605.14871","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-05-14T14:18:31Z","cross_cats_sorted":[],"title_canon_sha256":"8583bc18905fe4939847c183727af7f817ef415a1866721fc23a4f6eb5d04993","abstract_canon_sha256":"9c8a445d9989f37282e1c6e6a5c967681d7692abd0cb1150919936d7fcca0ae8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:56.140333Z","signature_b64":"2lvp1wC/m997naQ/7qfSeJwc8hwcb1Jq0CFloNLzN3LUSDI1TXX+tWXt22XAVy2TgR0GR7li+09TMJFFHfAyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"145da371936ad3472ea44d8c0cc5107cf5c5326cf98c8cea3ea8ff9cb83af502","last_reissued_at":"2026-05-17T23:38:56.139660Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:56.139660Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Maximal Prime Gaps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Cheng-TIng Wang","submitted_at":"2026-05-14T14:18:31Z","abstract_excerpt":"In this paper, we show a new upper bound of prime gaps, that is the gap between a prime number and its consecutive prime number. We show that the gap between a prime number $p_n$ and its consecutive prime number is not larger than $4\\log^2{p_n}$. We also show that the result implies the existence of a prime number in a certain type of interval for large enough numbers as a consequence."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.14871","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"2605.14871","created_at":"2026-05-17T23:38:56.139766+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14871v1","created_at":"2026-05-17T23:38:56.139766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14871","created_at":"2026-05-17T23:38:56.139766+00:00"},{"alias_kind":"pith_short_12","alias_value":"CRO2G4MTNLJU","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"CRO2G4MTNLJUOLVE","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"CRO2G4MT","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CRO2G4MTNLJUOLVEJWGAZRIQPT","json":"https://pith.science/pith/CRO2G4MTNLJUOLVEJWGAZRIQPT.json","graph_json":"https://pith.science/api/pith-number/CRO2G4MTNLJUOLVEJWGAZRIQPT/graph.json","events_json":"https://pith.science/api/pith-number/CRO2G4MTNLJUOLVEJWGAZRIQPT/events.json","paper":"https://pith.science/paper/CRO2G4MT"},"agent_actions":{"view_html":"https://pith.science/pith/CRO2G4MTNLJUOLVEJWGAZRIQPT","download_json":"https://pith.science/pith/CRO2G4MTNLJUOLVEJWGAZRIQPT.json","view_paper":"https://pith.science/paper/CRO2G4MT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14871&json=true","fetch_graph":"https://pith.science/api/pith-number/CRO2G4MTNLJUOLVEJWGAZRIQPT/graph.json","fetch_events":"https://pith.science/api/pith-number/CRO2G4MTNLJUOLVEJWGAZRIQPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CRO2G4MTNLJUOLVEJWGAZRIQPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CRO2G4MTNLJUOLVEJWGAZRIQPT/action/storage_attestation","attest_author":"https://pith.science/pith/CRO2G4MTNLJUOLVEJWGAZRIQPT/action/author_attestation","sign_citation":"https://pith.science/pith/CRO2G4MTNLJUOLVEJWGAZRIQPT/action/citation_signature","submit_replication":"https://pith.science/pith/CRO2G4MTNLJUOLVEJWGAZRIQPT/action/replication_record"}},"created_at":"2026-05-17T23:38:56.139766+00:00","updated_at":"2026-05-17T23:38:56.139766+00:00"}