{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MKZZEE4PZ4FT46IILNORU63XLD","short_pith_number":"pith:MKZZEE4P","schema_version":"1.0","canonical_sha256":"62b392138fcf0b3e79085b5d1a7b7758e9ff5285f9f8fbf5a17617dcdc1c521a","source":{"kind":"arxiv","id":"1102.4879","version":2},"attestation_state":"computed","paper":{"title":"The jumping champion conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"A. H. Ledoan, D. A. Goldston","submitted_at":"2011-02-23T23:44:33Z","abstract_excerpt":"An integer $d$ is called a jumping champion for a given $x$ if $d$ is the most common gap between consecutive primes up to $x$. Occasionally several gaps are equally common. Hence, there can be more than one jumping champion for the same $x$. For the $n$th prime $p_{n}$, the $n$th primorial $p_{n}^{\\sharp}$ is defined as the product of the first $n$ primes. In 1999, Odlyzko, Rubinstein and Wolf provided convincing heuristics and empirical evidence for the truth of the hypothesis that the jumping champions greater than 1 are 4 and the primorials $p_{1}^{\\sharp}, p_{2}^{\\sharp}, p_{3}^{\\sharp}, "},"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":"1102.4879","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-23T23:44:33Z","cross_cats_sorted":[],"title_canon_sha256":"d4f3dc07769e2e52a7a56b1f078252c483e3cb7e917b1889039237c247ba14bd","abstract_canon_sha256":"016cbd371cd64ed65855216abd01c2924a754703a07e7a5b11c84b583d7e0fa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:35.261712Z","signature_b64":"wZHRb2iro/xERJvd2+obYHSP10+wG4K8rWpR3eZFoZZYwC4BIheYbeFY2dqEB9HXpu3Xxd+VDZlpBdzBWTk5Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62b392138fcf0b3e79085b5d1a7b7758e9ff5285f9f8fbf5a17617dcdc1c521a","last_reissued_at":"2026-05-18T01:32:35.261181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:35.261181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The jumping champion conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"A. H. Ledoan, D. A. Goldston","submitted_at":"2011-02-23T23:44:33Z","abstract_excerpt":"An integer $d$ is called a jumping champion for a given $x$ if $d$ is the most common gap between consecutive primes up to $x$. Occasionally several gaps are equally common. Hence, there can be more than one jumping champion for the same $x$. For the $n$th prime $p_{n}$, the $n$th primorial $p_{n}^{\\sharp}$ is defined as the product of the first $n$ primes. In 1999, Odlyzko, Rubinstein and Wolf provided convincing heuristics and empirical evidence for the truth of the hypothesis that the jumping champions greater than 1 are 4 and the primorials $p_{1}^{\\sharp}, p_{2}^{\\sharp}, p_{3}^{\\sharp}, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4879","kind":"arxiv","version":2},"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":"1102.4879","created_at":"2026-05-18T01:32:35.261265+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.4879v2","created_at":"2026-05-18T01:32:35.261265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4879","created_at":"2026-05-18T01:32:35.261265+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKZZEE4PZ4FT","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKZZEE4PZ4FT46II","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKZZEE4P","created_at":"2026-05-18T12:26:34.985390+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/MKZZEE4PZ4FT46IILNORU63XLD","json":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD.json","graph_json":"https://pith.science/api/pith-number/MKZZEE4PZ4FT46IILNORU63XLD/graph.json","events_json":"https://pith.science/api/pith-number/MKZZEE4PZ4FT46IILNORU63XLD/events.json","paper":"https://pith.science/paper/MKZZEE4P"},"agent_actions":{"view_html":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD","download_json":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD.json","view_paper":"https://pith.science/paper/MKZZEE4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.4879&json=true","fetch_graph":"https://pith.science/api/pith-number/MKZZEE4PZ4FT46IILNORU63XLD/graph.json","fetch_events":"https://pith.science/api/pith-number/MKZZEE4PZ4FT46IILNORU63XLD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD/action/storage_attestation","attest_author":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD/action/author_attestation","sign_citation":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD/action/citation_signature","submit_replication":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD/action/replication_record"}},"created_at":"2026-05-18T01:32:35.261265+00:00","updated_at":"2026-05-18T01:32:35.261265+00:00"}