{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:KZPABPLUHYGCJIRMSKQFE3BCGZ","short_pith_number":"pith:KZPABPLU","canonical_record":{"source":{"id":"1102.0481","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-02T16:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"cbdb5370d57229259187f4f654ba385019b0b007690afd7cccfba8af40bd5090","abstract_canon_sha256":"88c8b94d0c96102861b1cab1e4f20974d5e2ef9f40213ddf2f88ba6d4e74b32a"},"schema_version":"1.0"},"canonical_sha256":"565e00bd743e0c24a22c92a0526c2236797a1187492fc4847e09a7095a182ffc","source":{"kind":"arxiv","id":"1102.0481","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0481","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0481v3","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0481","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"KZPABPLUHYGC","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KZPABPLUHYGCJIRM","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KZPABPLU","created_at":"2026-05-18T12:26:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:KZPABPLUHYGCJIRMSKQFE3BCGZ","target":"record","payload":{"canonical_record":{"source":{"id":"1102.0481","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-02T16:37:44Z","cross_cats_sorted":[],"title_canon_sha256":"cbdb5370d57229259187f4f654ba385019b0b007690afd7cccfba8af40bd5090","abstract_canon_sha256":"88c8b94d0c96102861b1cab1e4f20974d5e2ef9f40213ddf2f88ba6d4e74b32a"},"schema_version":"1.0"},"canonical_sha256":"565e00bd743e0c24a22c92a0526c2236797a1187492fc4847e09a7095a182ffc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:55.846055Z","signature_b64":"00tZhbsHLuGTilFAzvI0yqUIb+iBudUxb3GGcUOVV9R5FIgazq4cn+cH96HuOrfVVMOQMJ1Zeo+rUxjPK0I+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"565e00bd743e0c24a22c92a0526c2236797a1187492fc4847e09a7095a182ffc","last_reissued_at":"2026-05-18T00:17:55.845447Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:55.845447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.0481","source_version":3,"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-18T00:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q8EG5XAmIUVOGMpPxjCRzUdFrfkb5kcKbOxnXxZSIN96KCtW6mx4KDMxSxWlHWS3kEYXxoJJrIFfXfZVFFOfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:52:30.853932Z"},"content_sha256":"1485eccd59130914068ab5f1787f84bdd69b6681c5cf9eb58282285c7177bd64","schema_version":"1.0","event_id":"sha256:1485eccd59130914068ab5f1787f84bdd69b6681c5cf9eb58282285c7177bd64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:KZPABPLUHYGCJIRMSKQFE3BCGZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some heuristics on the gaps between consecutive primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Marek Wolf","submitted_at":"2011-02-02T16:37:44Z","abstract_excerpt":"We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\\pi(x)$. As the application of this formula we formulate 7 conjectures, among others for the maximal gap between two consecutive primes smaller than $x$, for the generalized Brun's constants and the first occurrence of a given gap $d$. Also the leading term $\\log \\log(x)$ in the prime harmonic sum is reproduced from our guesses correctly. These conjectures are supported by the computer data."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0481","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":""},"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-18T00:17:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDkmev4oK9S3hTRye1Xkb119i1jCVb/jds+URkGNfAo7SIng8HU2N2xflBwiD8Z6XSE+E5pBtxvj4tNewWw5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:52:30.854282Z"},"content_sha256":"b8cd85bce38827c56b2a38fafbf86147504865a88ee1ebae02d5f3a2ae03422e","schema_version":"1.0","event_id":"sha256:b8cd85bce38827c56b2a38fafbf86147504865a88ee1ebae02d5f3a2ae03422e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KZPABPLUHYGCJIRMSKQFE3BCGZ/bundle.json","state_url":"https://pith.science/pith/KZPABPLUHYGCJIRMSKQFE3BCGZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KZPABPLUHYGCJIRMSKQFE3BCGZ/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-05-30T11:52:30Z","links":{"resolver":"https://pith.science/pith/KZPABPLUHYGCJIRMSKQFE3BCGZ","bundle":"https://pith.science/pith/KZPABPLUHYGCJIRMSKQFE3BCGZ/bundle.json","state":"https://pith.science/pith/KZPABPLUHYGCJIRMSKQFE3BCGZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KZPABPLUHYGCJIRMSKQFE3BCGZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:KZPABPLUHYGCJIRMSKQFE3BCGZ","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":"88c8b94d0c96102861b1cab1e4f20974d5e2ef9f40213ddf2f88ba6d4e74b32a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-02T16:37:44Z","title_canon_sha256":"cbdb5370d57229259187f4f654ba385019b0b007690afd7cccfba8af40bd5090"},"schema_version":"1.0","source":{"id":"1102.0481","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.0481","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"arxiv_version","alias_value":"1102.0481v3","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.0481","created_at":"2026-05-18T00:17:55Z"},{"alias_kind":"pith_short_12","alias_value":"KZPABPLUHYGC","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_16","alias_value":"KZPABPLUHYGCJIRM","created_at":"2026-05-18T12:26:34Z"},{"alias_kind":"pith_short_8","alias_value":"KZPABPLU","created_at":"2026-05-18T12:26:34Z"}],"graph_snapshots":[{"event_id":"sha256:b8cd85bce38827c56b2a38fafbf86147504865a88ee1ebae02d5f3a2ae03422e","target":"graph","created_at":"2026-05-18T00:17:55Z","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":"We propose the formula for the number of pairs of consecutive primes $p_n, p_{n+1}<x$ separated by gap $d=p_{n+1}-p_n$ expressed directly by the number of all primes $<x$, i.e. by $\\pi(x)$. As the application of this formula we formulate 7 conjectures, among others for the maximal gap between two consecutive primes smaller than $x$, for the generalized Brun's constants and the first occurrence of a given gap $d$. Also the leading term $\\log \\log(x)$ in the prime harmonic sum is reproduced from our guesses correctly. These conjectures are supported by the computer data.","authors_text":"Marek Wolf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-02T16:37:44Z","title":"Some heuristics on the gaps between consecutive primes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.0481","kind":"arxiv","version":3},"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:1485eccd59130914068ab5f1787f84bdd69b6681c5cf9eb58282285c7177bd64","target":"record","created_at":"2026-05-18T00:17:55Z","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":"88c8b94d0c96102861b1cab1e4f20974d5e2ef9f40213ddf2f88ba6d4e74b32a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-02-02T16:37:44Z","title_canon_sha256":"cbdb5370d57229259187f4f654ba385019b0b007690afd7cccfba8af40bd5090"},"schema_version":"1.0","source":{"id":"1102.0481","kind":"arxiv","version":3}},"canonical_sha256":"565e00bd743e0c24a22c92a0526c2236797a1187492fc4847e09a7095a182ffc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"565e00bd743e0c24a22c92a0526c2236797a1187492fc4847e09a7095a182ffc","first_computed_at":"2026-05-18T00:17:55.845447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:55.845447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"00tZhbsHLuGTilFAzvI0yqUIb+iBudUxb3GGcUOVV9R5FIgazq4cn+cH96HuOrfVVMOQMJ1Zeo+rUxjPK0I+Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:55.846055Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.0481","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1485eccd59130914068ab5f1787f84bdd69b6681c5cf9eb58282285c7177bd64","sha256:b8cd85bce38827c56b2a38fafbf86147504865a88ee1ebae02d5f3a2ae03422e"],"state_sha256":"3cb1537694006134d00ce186f46b631fa6af913610103098224ac0fb2055773f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1mUkfYEESt12YFkMIAAW/CEcpXJA+Qa7ZDQzdEyunNGb1bFKxKWZIq81jG4R8QJ8oDWmpsDAp4q1s4YNqkPlBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:52:30.856326Z","bundle_sha256":"44ac9a8401fd5a125adb17741e7bfa5e842ed342a2e42d3140e6bbbc724fb8a8"}}