{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KXGYIVPLLBWIPFKVASMIHJAJLO","short_pith_number":"pith:KXGYIVPL","canonical_record":{"source":{"id":"2607.04365","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-07-05T15:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"6fa600d09cf6904d32f617106dc2a8e9e43ee19f40520efcb6c77e80e12cb565","abstract_canon_sha256":"447f19057050456851c9e5a5ab1dc5dd0a759f153c40d3c26e298c6d34f1183f"},"schema_version":"1.0"},"canonical_sha256":"55cd8455eb586c879555049883a4095bb602102395674e8530e8cd94a20dc96f","source":{"kind":"arxiv","id":"2607.04365","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04365","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04365v1","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04365","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"KXGYIVPLLBWI","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"pith_short_16","alias_value":"KXGYIVPLLBWIPFKV","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"pith_short_8","alias_value":"KXGYIVPL","created_at":"2026-07-07T02:19:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KXGYIVPLLBWIPFKVASMIHJAJLO","target":"record","payload":{"canonical_record":{"source":{"id":"2607.04365","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-07-05T15:47:30Z","cross_cats_sorted":[],"title_canon_sha256":"6fa600d09cf6904d32f617106dc2a8e9e43ee19f40520efcb6c77e80e12cb565","abstract_canon_sha256":"447f19057050456851c9e5a5ab1dc5dd0a759f153c40d3c26e298c6d34f1183f"},"schema_version":"1.0"},"canonical_sha256":"55cd8455eb586c879555049883a4095bb602102395674e8530e8cd94a20dc96f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:10.943592Z","signature_b64":"KSyGccn1uKhPKXdWlKixBBzXyYz6rAzuYwpgOWHXJ2g5w9TH3LaLbaPWaK0i9ySaGhSr8NXp2NkWO32XtmnsCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"55cd8455eb586c879555049883a4095bb602102395674e8530e8cd94a20dc96f","last_reissued_at":"2026-07-07T02:19:10.942900Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:10.942900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.04365","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-07-07T02:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fc9Dl/mYPLP0XCrPmg1c4rdZ3EIR5lIPRAxl6Fj6kkfiCsH3mP0yDCN3nhdcUbAAmy8A7tKXgJAMZ3o2TvGyDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:40:17.012590Z"},"content_sha256":"e47b7e9d36a5dfaaaec1d475603e7013c2fa1c9e843eaeb78c2c58eb3929bef4","schema_version":"1.0","event_id":"sha256:e47b7e9d36a5dfaaaec1d475603e7013c2fa1c9e843eaeb78c2c58eb3929bef4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KXGYIVPLLBWIPFKVASMIHJAJLO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Certified Minimal-Prime Branch Closures for Odd Perfect Numbers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Marco Mantovanelli","submitted_at":"2026-07-05T15:47:30Z","abstract_excerpt":"For an odd perfect number $N$, write $q=\\min\\{p:p\\mid N\\}$ for its smallest prime divisor. This paper proves a certified branch-closure theorem for the five minimal-prime branches $q=5,7,11,13,17$. The proof combines the exact $q$-adic valuation balance for $\\sigma(N)=2N$ with lower-prime avoidance: primes below $q$ cannot occur in the support and therefore cannot divide any divisor-sum factor. These constraints reduce each branch to a finite first-input coverage split and then to terminal forced-or-pure cofactor records. The terminal records are checked by the frozen certificate release C-sma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04365","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.04365/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-07T02:19:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wAXPI5KmSXI+hkBnVaa3iGaMMV+leOrgPPywYPBgPR35GV4KdkQNt1qQOiCVsXBfQyN3wGAbB3FPe767N2pbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T17:40:17.013202Z"},"content_sha256":"f0728132a3aa9c704d8e5159b11e2d55b9717ae1c7c5d6843347519e8ac60e37","schema_version":"1.0","event_id":"sha256:f0728132a3aa9c704d8e5159b11e2d55b9717ae1c7c5d6843347519e8ac60e37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KXGYIVPLLBWIPFKVASMIHJAJLO/bundle.json","state_url":"https://pith.science/pith/KXGYIVPLLBWIPFKVASMIHJAJLO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KXGYIVPLLBWIPFKVASMIHJAJLO/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-08-16T17:40:17Z","links":{"resolver":"https://pith.science/pith/KXGYIVPLLBWIPFKVASMIHJAJLO","bundle":"https://pith.science/pith/KXGYIVPLLBWIPFKVASMIHJAJLO/bundle.json","state":"https://pith.science/pith/KXGYIVPLLBWIPFKVASMIHJAJLO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KXGYIVPLLBWIPFKVASMIHJAJLO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KXGYIVPLLBWIPFKVASMIHJAJLO","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":"447f19057050456851c9e5a5ab1dc5dd0a759f153c40d3c26e298c6d34f1183f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-07-05T15:47:30Z","title_canon_sha256":"6fa600d09cf6904d32f617106dc2a8e9e43ee19f40520efcb6c77e80e12cb565"},"schema_version":"1.0","source":{"id":"2607.04365","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.04365","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"arxiv_version","alias_value":"2607.04365v1","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04365","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"pith_short_12","alias_value":"KXGYIVPLLBWI","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"pith_short_16","alias_value":"KXGYIVPLLBWIPFKV","created_at":"2026-07-07T02:19:10Z"},{"alias_kind":"pith_short_8","alias_value":"KXGYIVPL","created_at":"2026-07-07T02:19:10Z"}],"graph_snapshots":[{"event_id":"sha256:f0728132a3aa9c704d8e5159b11e2d55b9717ae1c7c5d6843347519e8ac60e37","target":"graph","created_at":"2026-07-07T02:19:10Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.04365/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For an odd perfect number $N$, write $q=\\min\\{p:p\\mid N\\}$ for its smallest prime divisor. This paper proves a certified branch-closure theorem for the five minimal-prime branches $q=5,7,11,13,17$. The proof combines the exact $q$-adic valuation balance for $\\sigma(N)=2N$ with lower-prime avoidance: primes below $q$ cannot occur in the support and therefore cannot divide any divisor-sum factor. These constraints reduce each branch to a finite first-input coverage split and then to terminal forced-or-pure cofactor records. The terminal records are checked by the frozen certificate release C-sma","authors_text":"Marco Mantovanelli","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-07-05T15:47:30Z","title":"Certified Minimal-Prime Branch Closures for Odd Perfect Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04365","kind":"arxiv","version":1},"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:e47b7e9d36a5dfaaaec1d475603e7013c2fa1c9e843eaeb78c2c58eb3929bef4","target":"record","created_at":"2026-07-07T02:19:10Z","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":"447f19057050456851c9e5a5ab1dc5dd0a759f153c40d3c26e298c6d34f1183f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.GM","submitted_at":"2026-07-05T15:47:30Z","title_canon_sha256":"6fa600d09cf6904d32f617106dc2a8e9e43ee19f40520efcb6c77e80e12cb565"},"schema_version":"1.0","source":{"id":"2607.04365","kind":"arxiv","version":1}},"canonical_sha256":"55cd8455eb586c879555049883a4095bb602102395674e8530e8cd94a20dc96f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"55cd8455eb586c879555049883a4095bb602102395674e8530e8cd94a20dc96f","first_computed_at":"2026-07-07T02:19:10.942900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-07T02:19:10.942900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KSyGccn1uKhPKXdWlKixBBzXyYz6rAzuYwpgOWHXJ2g5w9TH3LaLbaPWaK0i9ySaGhSr8NXp2NkWO32XtmnsCg==","signature_status":"signed_v1","signed_at":"2026-07-07T02:19:10.943592Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.04365","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e47b7e9d36a5dfaaaec1d475603e7013c2fa1c9e843eaeb78c2c58eb3929bef4","sha256:f0728132a3aa9c704d8e5159b11e2d55b9717ae1c7c5d6843347519e8ac60e37"],"state_sha256":"2feb97dd0e8ac72549681fa283fc64da4fb1871c2ee2b7d4f3983e55ecccbbc7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRpso6KRI+bXnu95HvuHehLnm6LnPEH1iDnI0EIJ3sxg2TevhmLqeXQANiHWYnfxwLeq4G6xebSjzlmggpWGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T17:40:17.016959Z","bundle_sha256":"ccc78f2fb5da1d2f087c52cdf100720d99b44bb4e2501c87797148d0645dabe8"}}