{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:YDQ2TZGKJUTJKZ3BHE2UKU5MY4","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":"81b7cd82f054926996b36c9a2810a487e4122a0015e51af2e448d84dc6120d32","cross_cats_sorted":[],"license":"","primary_cat":"math.NT","submitted_at":"2006-02-22T04:17:01Z","title_canon_sha256":"b6fd1613a7d0a5b1fab03d22540ea936a58d679cdfb6447310accbab7cd9cf1f"},"schema_version":"1.0","source":{"id":"math/0602485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0602485","created_at":"2026-07-04T17:02:08Z"},{"alias_kind":"arxiv_version","alias_value":"math/0602485v1","created_at":"2026-07-04T17:02:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0602485","created_at":"2026-07-04T17:02:08Z"},{"alias_kind":"pith_short_12","alias_value":"YDQ2TZGKJUTJ","created_at":"2026-07-04T17:02:08Z"},{"alias_kind":"pith_short_16","alias_value":"YDQ2TZGKJUTJKZ3B","created_at":"2026-07-04T17:02:08Z"},{"alias_kind":"pith_short_8","alias_value":"YDQ2TZGK","created_at":"2026-07-04T17:02:08Z"}],"graph_snapshots":[{"event_id":"sha256:b143ee77dbee14b0c5b9550a6f015d915247c2f74cc0281178a8733fb4d10b37","target":"graph","created_at":"2026-07-04T17:02:08Z","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/math/0602485/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An odd perfect number, N, is shown to have at least nine distinct prime factors. If 3 does not divide N, then N must have at least twelve distinct prime divisors. The proof ultimately avoids previous computational results for odd perfect numbers.","authors_text":"Pace P. Nielsen","cross_cats":[],"headline":"","license":"","primary_cat":"math.NT","submitted_at":"2006-02-22T04:17:01Z","title":"Odd Perfect Numbers Have At Least Nine Distinct Prime Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0602485","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:012196d9f56e68495bd211e1041a62d2b7671e8c6bc5d38d637e382cb1572da0","target":"record","created_at":"2026-07-04T17:02:08Z","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":"81b7cd82f054926996b36c9a2810a487e4122a0015e51af2e448d84dc6120d32","cross_cats_sorted":[],"license":"","primary_cat":"math.NT","submitted_at":"2006-02-22T04:17:01Z","title_canon_sha256":"b6fd1613a7d0a5b1fab03d22540ea936a58d679cdfb6447310accbab7cd9cf1f"},"schema_version":"1.0","source":{"id":"math/0602485","kind":"arxiv","version":1}},"canonical_sha256":"c0e1a9e4ca4d2695676139354553acc7129d867dbd10c0ae2932d0e07a4bf0d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0e1a9e4ca4d2695676139354553acc7129d867dbd10c0ae2932d0e07a4bf0d8","first_computed_at":"2026-07-04T17:02:08.500471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:02:08.500471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QyFfwomDHs198zAAuwoghg0O/z152N/mqyO/RwlMUUEvzg4VjbfIfefMq/Q7rkccv/T3O/kPrkLG1U/05wx7Bw==","signature_status":"signed_v1","signed_at":"2026-07-04T17:02:08.500804Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0602485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:012196d9f56e68495bd211e1041a62d2b7671e8c6bc5d38d637e382cb1572da0","sha256:b143ee77dbee14b0c5b9550a6f015d915247c2f74cc0281178a8733fb4d10b37"],"state_sha256":"6c52b1f61c5d932048f871f53d4568cf7848ae01fddc8b7736769e7a2d959cdd"}