{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:MKZZEE4PZ4FT46IILNORU63XLD","short_pith_number":"pith:MKZZEE4P","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"},"canonical_sha256":"62b392138fcf0b3e79085b5d1a7b7758e9ff5285f9f8fbf5a17617dcdc1c521a","source":{"kind":"arxiv","id":"1102.4879","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4879","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4879v2","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4879","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"MKZZEE4PZ4FT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MKZZEE4PZ4FT46II","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MKZZEE4P","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:MKZZEE4PZ4FT46IILNORU63XLD","target":"record","payload":{"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"},"canonical_sha256":"62b392138fcf0b3e79085b5d1a7b7758e9ff5285f9f8fbf5a17617dcdc1c521a","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"},"source_kind":"arxiv","source_id":"1102.4879","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bGf9atyxbd4CI91lcihWTRu4w2vsBQugppDbxTZm1vmadZEGRpsKtILD5kY/OR6cWqSTdfQsX+x+KaywGX7sDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:40:30.849995Z"},"content_sha256":"6a708040007589770ca19b1ddc5a0c9ee195a9e7bccad14a4d3537fab510587d","schema_version":"1.0","event_id":"sha256:6a708040007589770ca19b1ddc5a0c9ee195a9e7bccad14a4d3537fab510587d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:MKZZEE4PZ4FT46IILNORU63XLD","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZcE564X5F+1ThvUho/V7V25vax56I5fctar8AI/XHW8K8fM2jyCk/tKMi+wyKzklBkQgB67dOz9X47s6gUV5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T02:40:30.850625Z"},"content_sha256":"88d05eac42bd06874a11be380387413118e5e125d7a12a1726918034ba2f5734","schema_version":"1.0","event_id":"sha256:88d05eac42bd06874a11be380387413118e5e125d7a12a1726918034ba2f5734"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD/bundle.json","state_url":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKZZEE4PZ4FT46IILNORU63XLD/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T02:40:30Z","links":{"resolver":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD","bundle":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD/bundle.json","state":"https://pith.science/pith/MKZZEE4PZ4FT46IILNORU63XLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKZZEE4PZ4FT46IILNORU63XLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:MKZZEE4PZ4FT46IILNORU63XLD","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"016cbd371cd64ed65855216abd01c2924a754703a07e7a5b11c84b583d7e0fa1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-23T23:44:33Z","title_canon_sha256":"d4f3dc07769e2e52a7a56b1f078252c483e3cb7e917b1889039237c247ba14bd"},"schema_version":"1.0","source":{"id":"1102.4879","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.4879","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"arxiv_version","alias_value":"1102.4879v2","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.4879","created_at":"2026-05-18T01:32:35Z"},{"alias_kind":"pith_short_12","alias_value":"MKZZEE4PZ4FT","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"MKZZEE4PZ4FT46II","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"MKZZEE4P","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:88d05eac42bd06874a11be380387413118e5e125d7a12a1726918034ba2f5734","target":"graph","created_at":"2026-05-18T01:32:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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}, ","authors_text":"A. H. Ledoan, D. A. Goldston","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-23T23:44:33Z","title":"The jumping champion conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.4879","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6a708040007589770ca19b1ddc5a0c9ee195a9e7bccad14a4d3537fab510587d","target":"record","created_at":"2026-05-18T01:32:35Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"016cbd371cd64ed65855216abd01c2924a754703a07e7a5b11c84b583d7e0fa1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-23T23:44:33Z","title_canon_sha256":"d4f3dc07769e2e52a7a56b1f078252c483e3cb7e917b1889039237c247ba14bd"},"schema_version":"1.0","source":{"id":"1102.4879","kind":"arxiv","version":2}},"canonical_sha256":"62b392138fcf0b3e79085b5d1a7b7758e9ff5285f9f8fbf5a17617dcdc1c521a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62b392138fcf0b3e79085b5d1a7b7758e9ff5285f9f8fbf5a17617dcdc1c521a","first_computed_at":"2026-05-18T01:32:35.261181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:35.261181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wZHRb2iro/xERJvd2+obYHSP10+wG4K8rWpR3eZFoZZYwC4BIheYbeFY2dqEB9HXpu3Xxd+VDZlpBdzBWTk5Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:35.261712Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.4879","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a708040007589770ca19b1ddc5a0c9ee195a9e7bccad14a4d3537fab510587d","sha256:88d05eac42bd06874a11be380387413118e5e125d7a12a1726918034ba2f5734"],"state_sha256":"91f97adadec17e628baea749f10aa63374d26992ec13a8bc35632bc51909f98d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIaF6xUzUUNIqOxJs7c0mWQsLduLux1eMfQJI7sffcxbBlr0s+J1pknFDD3hqwnF1qoyTBUo8Ci2vE+bZf32Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T02:40:30.853058Z","bundle_sha256":"d94332d0c44728511ef5c2d98ab693f5da4d79f98d52479c27ac80c8b50bce69"}}