{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IF4XMGLQBZAHH2SNKBVNS6H5DG","short_pith_number":"pith:IF4XMGLQ","canonical_record":{"source":{"id":"2604.26429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-29T08:39:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ef5ba2200b67d71cda266fb96bebabfd0c7b04ff69b256b851862ee554a67ae4","abstract_canon_sha256":"d800140b95b97bde6ed5233df37a02b2e01dda97b264197493ef3d5d370713d7"},"schema_version":"1.0"},"canonical_sha256":"41797619700e4073ea4d506ad978fd19b5bf0ca29be00d2c196a3e31e8466e2a","source":{"kind":"arxiv","id":"2604.26429","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26429","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26429v3","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26429","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"IF4XMGLQBZAH","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"IF4XMGLQBZAHH2SN","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"IF4XMGLQ","created_at":"2026-05-28T01:04:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IF4XMGLQBZAHH2SNKBVNS6H5DG","target":"record","payload":{"canonical_record":{"source":{"id":"2604.26429","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-29T08:39:51Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"ef5ba2200b67d71cda266fb96bebabfd0c7b04ff69b256b851862ee554a67ae4","abstract_canon_sha256":"d800140b95b97bde6ed5233df37a02b2e01dda97b264197493ef3d5d370713d7"},"schema_version":"1.0"},"canonical_sha256":"41797619700e4073ea4d506ad978fd19b5bf0ca29be00d2c196a3e31e8466e2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:41.007895Z","signature_b64":"qNYU2UKYmrcQmU7kxGJWAiHvu6nusQGvL3RiAXhGunPYS7nQB+TBsov1V59f0rPbvh+XkF0r4qY0U/glKoIkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41797619700e4073ea4d506ad978fd19b5bf0ca29be00d2c196a3e31e8466e2a","last_reissued_at":"2026-05-28T01:04:41.007472Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:41.007472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.26429","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-28T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xb7ZZTutBsjl/jRW5iTyKNw/S0hkNdrm1E/z3B7Q6H/YdsPSmlprc4jybRL7hEhNnGPqr5TV8/+nT+mfwhHpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:02:44.718760Z"},"content_sha256":"b8ffb0306ab9467a2ace74ec99cdae8336012439ef007fdf12e663373918d783","schema_version":"1.0","event_id":"sha256:b8ffb0306ab9467a2ace74ec99cdae8336012439ef007fdf12e663373918d783"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IF4XMGLQBZAHH2SNKBVNS6H5DG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solution to the Erdos problem on distinct residues of factorials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"There is no prime number p > 5 such that the residues of 2!, 3!, …, (p-1)! modulo p are all distinct.","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Vyacheslav M. Abramov","submitted_at":"2026-04-29T08:39:51Z","abstract_excerpt":"Paul Erdos posed the following question: Is there a prime number $p>5$ such that the residues of $2!$, $3!$,\\ldots, $(p-1)!$ modulo $p$ all are distinct. In this short note, we give the negative answer on this question in an elementary way."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"There is no prime number p>5 such that the residues of 2!, 3!,…, (p-1)! modulo p all are distinct.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The elementary proof applies to every prime p>5 with no exceptions arising from special cases or additional modular constraints.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"No prime p>5 exists such that the residues of 2!, 3!, ..., (p-1)! modulo p are all distinct.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"There is no prime number p > 5 such that the residues of 2!, 3!, …, (p-1)! modulo p are all distinct.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"796e1428ae53c121bcb33bde6ccbe306a425246485f6b924399785538ff1a2bd"},"source":{"id":"2604.26429","kind":"arxiv","version":3},"verdict":{"id":"48459c9c-a3dd-4eaf-8eef-e251cfcf4f44","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T03:17:37.183518Z","strongest_claim":"There is no prime number p>5 such that the residues of 2!, 3!,…, (p-1)! modulo p all are distinct.","one_line_summary":"No prime p>5 exists such that the residues of 2!, 3!, ..., (p-1)! modulo p are all distinct.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The elementary proof applies to every prime p>5 with no exceptions arising from special cases or additional modular constraints.","pith_extraction_headline":"There is no prime number p > 5 such that the residues of 2!, 3!, …, (p-1)! modulo p are all distinct."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.26429/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T00:37:01.465827Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:11:20.202705Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"23ce1c029e3d2cd05ce7de3cd4ff7f682c6efed4952b21a1df21647df2a8a89d"},"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":"48459c9c-a3dd-4eaf-8eef-e251cfcf4f44"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-28T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0zKWnA1UcbHorH3NnJgbYgM4VJ7D7YaMa5mqonLNBF2RtGkgbrn7IoQKN+i+qIVPkxn3PX4UoVz6RBQP8DxHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:02:44.719299Z"},"content_sha256":"bf0a91ef6a976a64ed5b94dfb9d99d5e848b9328873af7eae150b2170414c686","schema_version":"1.0","event_id":"sha256:bf0a91ef6a976a64ed5b94dfb9d99d5e848b9328873af7eae150b2170414c686"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/bundle.json","state_url":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/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-10T19:02:44Z","links":{"resolver":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG","bundle":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/bundle.json","state":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IF4XMGLQBZAHH2SNKBVNS6H5DG","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":"d800140b95b97bde6ed5233df37a02b2e01dda97b264197493ef3d5d370713d7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-29T08:39:51Z","title_canon_sha256":"ef5ba2200b67d71cda266fb96bebabfd0c7b04ff69b256b851862ee554a67ae4"},"schema_version":"1.0","source":{"id":"2604.26429","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.26429","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2604.26429v3","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26429","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"IF4XMGLQBZAH","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"IF4XMGLQBZAHH2SN","created_at":"2026-05-28T01:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"IF4XMGLQ","created_at":"2026-05-28T01:04:41Z"}],"graph_snapshots":[{"event_id":"sha256:bf0a91ef6a976a64ed5b94dfb9d99d5e848b9328873af7eae150b2170414c686","target":"graph","created_at":"2026-05-28T01:04:41Z","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":"There is no prime number p>5 such that the residues of 2!, 3!,…, (p-1)! modulo p all are distinct."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The elementary proof applies to every prime p>5 with no exceptions arising from special cases or additional modular constraints."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"No prime p>5 exists such that the residues of 2!, 3!, ..., (p-1)! modulo p are all distinct."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"There is no prime number p > 5 such that the residues of 2!, 3!, …, (p-1)! modulo p are all distinct."}],"snapshot_sha256":"796e1428ae53c121bcb33bde6ccbe306a425246485f6b924399785538ff1a2bd"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T00:37:01.465827Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:11:20.202705Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.26429/integrity.json","findings":[],"snapshot_sha256":"23ce1c029e3d2cd05ce7de3cd4ff7f682c6efed4952b21a1df21647df2a8a89d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Paul Erdos posed the following question: Is there a prime number $p>5$ such that the residues of $2!$, $3!$,\\ldots, $(p-1)!$ modulo $p$ all are distinct. In this short note, we give the negative answer on this question in an elementary way.","authors_text":"Vyacheslav M. Abramov","cross_cats":["math.CO"],"headline":"There is no prime number p > 5 such that the residues of 2!, 3!, …, (p-1)! modulo p are all distinct.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-29T08:39:51Z","title":"Solution to the Erdos problem on distinct residues of factorials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.26429","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-08T03:17:37.183518Z","id":"48459c9c-a3dd-4eaf-8eef-e251cfcf4f44","model_set":{"reader":"grok-4.3"},"one_line_summary":"No prime p>5 exists such that the residues of 2!, 3!, ..., (p-1)! modulo p are all distinct.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"There is no prime number p > 5 such that the residues of 2!, 3!, …, (p-1)! modulo p are all distinct.","strongest_claim":"There is no prime number p>5 such that the residues of 2!, 3!,…, (p-1)! modulo p all are distinct.","weakest_assumption":"The elementary proof applies to every prime p>5 with no exceptions arising from special cases or additional modular constraints."}},"verdict_id":"48459c9c-a3dd-4eaf-8eef-e251cfcf4f44"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b8ffb0306ab9467a2ace74ec99cdae8336012439ef007fdf12e663373918d783","target":"record","created_at":"2026-05-28T01:04:41Z","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":"d800140b95b97bde6ed5233df37a02b2e01dda97b264197493ef3d5d370713d7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-04-29T08:39:51Z","title_canon_sha256":"ef5ba2200b67d71cda266fb96bebabfd0c7b04ff69b256b851862ee554a67ae4"},"schema_version":"1.0","source":{"id":"2604.26429","kind":"arxiv","version":3}},"canonical_sha256":"41797619700e4073ea4d506ad978fd19b5bf0ca29be00d2c196a3e31e8466e2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41797619700e4073ea4d506ad978fd19b5bf0ca29be00d2c196a3e31e8466e2a","first_computed_at":"2026-05-28T01:04:41.007472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-28T01:04:41.007472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qNYU2UKYmrcQmU7kxGJWAiHvu6nusQGvL3RiAXhGunPYS7nQB+TBsov1V59f0rPbvh+XkF0r4qY0U/glKoIkAQ==","signature_status":"signed_v1","signed_at":"2026-05-28T01:04:41.007895Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.26429","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b8ffb0306ab9467a2ace74ec99cdae8336012439ef007fdf12e663373918d783","sha256:bf0a91ef6a976a64ed5b94dfb9d99d5e848b9328873af7eae150b2170414c686"],"state_sha256":"73aa01342d47cfdfc5475f5601503cc9e61160601c5b13798fa0192c55abc904"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WkbMxjfxRGWAiBFmuFS/Sibz+PldYxRsoYQZ8rnsSw6G2ONSe8Hcs6M6T6HsoqJiPA77GQqL3+fukJnFB/B1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:02:44.722049Z","bundle_sha256":"6310723e294b878bb0279c45f6091d49b498bd6bbc134d672c09ca2a111ded79"}}