{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GBOELXWBIMAKY56AHJ7PLFBMKS","short_pith_number":"pith:GBOELXWB","canonical_record":{"source":{"id":"2605.12504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-01-23T04:44:41Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3524c3cdece81481d0911eaa8bb23a613eb8ca3acda8e72a8132d37325b86ef2","abstract_canon_sha256":"e9e92356e9d892e0f9014f5024209d87048caa87be6879811d0502845b85ccf1"},"schema_version":"1.0"},"canonical_sha256":"305c45dec14300ac77c03a7ef5942c54aca87fa3f01bba1cfd1af3c61b0f8aab","source":{"kind":"arxiv","id":"2605.12504","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12504","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12504v1","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12504","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"GBOELXWBIMAK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GBOELXWBIMAKY56A","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GBOELXWB","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GBOELXWBIMAKY56AHJ7PLFBMKS","target":"record","payload":{"canonical_record":{"source":{"id":"2605.12504","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-01-23T04:44:41Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"3524c3cdece81481d0911eaa8bb23a613eb8ca3acda8e72a8132d37325b86ef2","abstract_canon_sha256":"e9e92356e9d892e0f9014f5024209d87048caa87be6879811d0502845b85ccf1"},"schema_version":"1.0"},"canonical_sha256":"305c45dec14300ac77c03a7ef5942c54aca87fa3f01bba1cfd1af3c61b0f8aab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:03.153647Z","signature_b64":"By6Pv6Kf6z7LhP/QdigDacpIv77QefMexUR5IL43eBCirm7Rv22JgAOT2ZntLr6NxzBfsK9zVp+mb6Y0cKynCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"305c45dec14300ac77c03a7ef5942c54aca87fa3f01bba1cfd1af3c61b0f8aab","last_reissued_at":"2026-05-18T03:10:03.153025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:03.153025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.12504","source_version":1,"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-18T03:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sSG0vzAqoLuCr9CRjAu6eM1wPnMTtdA8DqETwf9sRh7Id3Rcw2TvigcuWDVB7syTeYI/YVFFibQDlyfxp31PAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:46:48.302797Z"},"content_sha256":"129fc79333dfa26e34152bbf6aaebf295963c4d2fcb723084ca8bebb08cbf0e0","schema_version":"1.0","event_id":"sha256:129fc79333dfa26e34152bbf6aaebf295963c4d2fcb723084ca8bebb08cbf0e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GBOELXWBIMAKY56AHJ7PLFBMKS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"No general algorithm finds the next prime substantially faster than sequential candidate testing, except on sparse input sets.","cross_cats":["cs.AI"],"primary_cat":"cs.CC","authors_text":"Ben Goertzel, Bill Lauritzen","submitted_at":"2026-01-23T04:44:41Z","abstract_excerpt":"We develop conjectures and theorems expressing the idea that the prime sequence exhibits computational irreducibility in the transition from one prime to its successor. Informally, given a prime pp p, no general algorithm can compute the least prime greater than pp p substantially faster than sequentially testing candidates for primality, except possibly on sparse input sets.\n  Our framework proceeds along complementary lines. First, we formalize Prime Successor Irreducibility in a Turing-machine complexity model (PSI-T), asserting lower bounds on running time relative to a sequential baseline"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"no general algorithm can compute the least prime greater than p substantially faster than sequentially testing candidates for primality, except possibly on sparse input sets","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"that standard sieve bounds suffice to establish algorithmic incompressibility of typical prime gaps at their natural scale without hidden exceptions or sparse-set pathologies that would invalidate the lower bounds","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Prime successor irreducibility conjectures that next-prime computation is irreducible to sequential testing in general, with unconditional Kolmogorov-complexity lower bounds derived from sieve theory and extensions to gap entropy and constellations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"No general algorithm finds the next prime substantially faster than sequential candidate testing, except on sparse input sets.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"3d549140f75d561bbd4be021c9c94511afb92304a8cbbbfeaceba206c892080f"},"source":{"id":"2605.12504","kind":"arxiv","version":1},"verdict":{"id":"9704abcc-67e9-4ae4-80dc-a5849d93bf4a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T12:21:00.550746Z","strongest_claim":"no general algorithm can compute the least prime greater than p substantially faster than sequentially testing candidates for primality, except possibly on sparse input sets","one_line_summary":"Prime successor irreducibility conjectures that next-prime computation is irreducible to sequential testing in general, with unconditional Kolmogorov-complexity lower bounds derived from sieve theory and extensions to gap entropy and constellations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"that standard sieve bounds suffice to establish algorithmic incompressibility of typical prime gaps at their natural scale without hidden exceptions or sparse-set pathologies that would invalidate the lower bounds","pith_extraction_headline":"No general algorithm finds the next prime substantially faster than sequential candidate testing, except on sparse input sets."},"references":{"count":6,"sample":[{"doi":"","year":1974,"title":"H. Halberstam and H.-E. Richert,Sieve Methods, Academic Press, 1974","work_id":"b0e033ac-2f3d-4869-be61-9cde2c42d809","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"H. Iwaniec and E. Kowalski,Analytic Number Theory, American Mathematical Society, 2004","work_id":"7baed630-c5e8-483c-8427-bc1124d7c76f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"H. L. Montgomery and R. C. Vaughan,Multiplicative Number Theory I: Classical Theory, Cambridge University Press, 2006","work_id":"bbb202a6-6263-4b8f-868d-d216641ef785","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Lauritzen,Prime Successor Irreducibility, https://earth360.com/ prime-successor-irreducibility.html","work_id":"a6442689-748a-4345-bcc1-d427c16dd3db","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2021,"title":"PhD thesis, Australian National University, 2021","work_id":"e84076dc-7fa5-4a68-90f4-2abced54be76","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":6,"snapshot_sha256":"5032fba72dd1527dc9a472551037071c3c990a8dd9de9c9f3c974e96b6cdb086","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b67116e3a49f46f38d15face9612716ddbf9ea15af16bd0c10045d881703adce"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"9704abcc-67e9-4ae4-80dc-a5849d93bf4a"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xB5RiEyygIQo3TrEKBHShkMkNbeHLJD8Ic+/y1WSTwBHSnCcyZato7UA9r9XpDEN3V4alx75r9CQb+bb62GaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:46:48.303860Z"},"content_sha256":"862d5207e4e140e3c8c8b1f9eaa750dd58feafe52bb9a33850602342e7a44ef2","schema_version":"1.0","event_id":"sha256:862d5207e4e140e3c8c8b1f9eaa750dd58feafe52bb9a33850602342e7a44ef2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBOELXWBIMAKY56AHJ7PLFBMKS/bundle.json","state_url":"https://pith.science/pith/GBOELXWBIMAKY56AHJ7PLFBMKS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBOELXWBIMAKY56AHJ7PLFBMKS/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-10T12:46:48Z","links":{"resolver":"https://pith.science/pith/GBOELXWBIMAKY56AHJ7PLFBMKS","bundle":"https://pith.science/pith/GBOELXWBIMAKY56AHJ7PLFBMKS/bundle.json","state":"https://pith.science/pith/GBOELXWBIMAKY56AHJ7PLFBMKS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBOELXWBIMAKY56AHJ7PLFBMKS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GBOELXWBIMAKY56AHJ7PLFBMKS","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":"e9e92356e9d892e0f9014f5024209d87048caa87be6879811d0502845b85ccf1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-01-23T04:44:41Z","title_canon_sha256":"3524c3cdece81481d0911eaa8bb23a613eb8ca3acda8e72a8132d37325b86ef2"},"schema_version":"1.0","source":{"id":"2605.12504","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.12504","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"arxiv_version","alias_value":"2605.12504v1","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.12504","created_at":"2026-05-18T03:10:03Z"},{"alias_kind":"pith_short_12","alias_value":"GBOELXWBIMAK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"GBOELXWBIMAKY56A","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"GBOELXWB","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:862d5207e4e140e3c8c8b1f9eaa750dd58feafe52bb9a33850602342e7a44ef2","target":"graph","created_at":"2026-05-18T03:10:03Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"no general algorithm can compute the least prime greater than p substantially faster than sequentially testing candidates for primality, except possibly on sparse input sets"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"that standard sieve bounds suffice to establish algorithmic incompressibility of typical prime gaps at their natural scale without hidden exceptions or sparse-set pathologies that would invalidate the lower bounds"},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Prime successor irreducibility conjectures that next-prime computation is irreducible to sequential testing in general, with unconditional Kolmogorov-complexity lower bounds derived from sieve theory and extensions to gap entropy and constellations."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"No general algorithm finds the next prime substantially faster than sequential candidate testing, except on sparse input sets."}],"snapshot_sha256":"3d549140f75d561bbd4be021c9c94511afb92304a8cbbbfeaceba206c892080f"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b67116e3a49f46f38d15face9612716ddbf9ea15af16bd0c10045d881703adce"},"paper":{"abstract_excerpt":"We develop conjectures and theorems expressing the idea that the prime sequence exhibits computational irreducibility in the transition from one prime to its successor. Informally, given a prime pp p, no general algorithm can compute the least prime greater than pp p substantially faster than sequentially testing candidates for primality, except possibly on sparse input sets.\n  Our framework proceeds along complementary lines. First, we formalize Prime Successor Irreducibility in a Turing-machine complexity model (PSI-T), asserting lower bounds on running time relative to a sequential baseline","authors_text":"Ben Goertzel, Bill Lauritzen","cross_cats":["cs.AI"],"headline":"No general algorithm finds the next prime substantially faster than sequential candidate testing, except on sparse input sets.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-01-23T04:44:41Z","title":"Prime Successor Irreducibility: Turing Machine Complexity, Kolmogorov Complexity, and Weakness-Based Formulations"},"references":{"count":6,"internal_anchors":0,"resolved_work":6,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"H. Halberstam and H.-E. Richert,Sieve Methods, Academic Press, 1974","work_id":"b0e033ac-2f3d-4869-be61-9cde2c42d809","year":1974},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"H. Iwaniec and E. Kowalski,Analytic Number Theory, American Mathematical Society, 2004","work_id":"7baed630-c5e8-483c-8427-bc1124d7c76f","year":2004},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"H. L. Montgomery and R. C. Vaughan,Multiplicative Number Theory I: Classical Theory, Cambridge University Press, 2006","work_id":"bbb202a6-6263-4b8f-868d-d216641ef785","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Lauritzen,Prime Successor Irreducibility, https://earth360.com/ prime-successor-irreducibility.html","work_id":"a6442689-748a-4345-bcc1-d427c16dd3db","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"PhD thesis, Australian National University, 2021","work_id":"e84076dc-7fa5-4a68-90f4-2abced54be76","year":2021}],"snapshot_sha256":"5032fba72dd1527dc9a472551037071c3c990a8dd9de9c9f3c974e96b6cdb086"},"source":{"id":"2605.12504","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-16T12:21:00.550746Z","id":"9704abcc-67e9-4ae4-80dc-a5849d93bf4a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Prime successor irreducibility conjectures that next-prime computation is irreducible to sequential testing in general, with unconditional Kolmogorov-complexity lower bounds derived from sieve theory and extensions to gap entropy and constellations.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"No general algorithm finds the next prime substantially faster than sequential candidate testing, except on sparse input sets.","strongest_claim":"no general algorithm can compute the least prime greater than p substantially faster than sequentially testing candidates for primality, except possibly on sparse input sets","weakest_assumption":"that standard sieve bounds suffice to establish algorithmic incompressibility of typical prime gaps at their natural scale without hidden exceptions or sparse-set pathologies that would invalidate the lower bounds"}},"verdict_id":"9704abcc-67e9-4ae4-80dc-a5849d93bf4a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:129fc79333dfa26e34152bbf6aaebf295963c4d2fcb723084ca8bebb08cbf0e0","target":"record","created_at":"2026-05-18T03:10:03Z","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":"e9e92356e9d892e0f9014f5024209d87048caa87be6879811d0502845b85ccf1","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2026-01-23T04:44:41Z","title_canon_sha256":"3524c3cdece81481d0911eaa8bb23a613eb8ca3acda8e72a8132d37325b86ef2"},"schema_version":"1.0","source":{"id":"2605.12504","kind":"arxiv","version":1}},"canonical_sha256":"305c45dec14300ac77c03a7ef5942c54aca87fa3f01bba1cfd1af3c61b0f8aab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"305c45dec14300ac77c03a7ef5942c54aca87fa3f01bba1cfd1af3c61b0f8aab","first_computed_at":"2026-05-18T03:10:03.153025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:03.153025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"By6Pv6Kf6z7LhP/QdigDacpIv77QefMexUR5IL43eBCirm7Rv22JgAOT2ZntLr6NxzBfsK9zVp+mb6Y0cKynCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:03.153647Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.12504","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:129fc79333dfa26e34152bbf6aaebf295963c4d2fcb723084ca8bebb08cbf0e0","sha256:862d5207e4e140e3c8c8b1f9eaa750dd58feafe52bb9a33850602342e7a44ef2"],"state_sha256":"f42ddd9cb7fe5acbc27079cae32335c8c7fdb62946444bb1c76a95a971e41412"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmv3SABmvTrDBmygf9GcYsdDGK7AWsxFkoVsgQW4/HsNeKcc0KY2kgqgiMh3/TLRFrd5cxRU7fQ0s//b2fBwBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:46:48.308777Z","bundle_sha256":"f34da190fa3258956655cb77ab4b2a33bfbb5e0a83f5476b9758d7b47ab39c8a"}}