{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IF4XMGLQBZAHH2SNKBVNS6H5DG","short_pith_number":"pith:IF4XMGLQ","schema_version":"1.0","canonical_sha256":"41797619700e4073ea4d506ad978fd19b5bf0ca29be00d2c196a3e31e8466e2a","source":{"kind":"arxiv","id":"2604.26429","version":3},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2604.26429","created_at":"2026-05-28T01:04:41.007525+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.26429v3","created_at":"2026-05-28T01:04:41.007525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.26429","created_at":"2026-05-28T01:04:41.007525+00:00"},{"alias_kind":"pith_short_12","alias_value":"IF4XMGLQBZAH","created_at":"2026-05-28T01:04:41.007525+00:00"},{"alias_kind":"pith_short_16","alias_value":"IF4XMGLQBZAHH2SN","created_at":"2026-05-28T01:04:41.007525+00:00"},{"alias_kind":"pith_short_8","alias_value":"IF4XMGLQ","created_at":"2026-05-28T01:04:41.007525+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG","json":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG.json","graph_json":"https://pith.science/api/pith-number/IF4XMGLQBZAHH2SNKBVNS6H5DG/graph.json","events_json":"https://pith.science/api/pith-number/IF4XMGLQBZAHH2SNKBVNS6H5DG/events.json","paper":"https://pith.science/paper/IF4XMGLQ"},"agent_actions":{"view_html":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG","download_json":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG.json","view_paper":"https://pith.science/paper/IF4XMGLQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.26429&json=true","fetch_graph":"https://pith.science/api/pith-number/IF4XMGLQBZAHH2SNKBVNS6H5DG/graph.json","fetch_events":"https://pith.science/api/pith-number/IF4XMGLQBZAHH2SNKBVNS6H5DG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/action/storage_attestation","attest_author":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/action/author_attestation","sign_citation":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/action/citation_signature","submit_replication":"https://pith.science/pith/IF4XMGLQBZAHH2SNKBVNS6H5DG/action/replication_record"}},"created_at":"2026-05-28T01:04:41.007525+00:00","updated_at":"2026-05-28T01:04:41.007525+00:00"}