{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:SLORN76YGN7VIWQSGJMU5O3ZDI","short_pith_number":"pith:SLORN76Y","schema_version":"1.0","canonical_sha256":"92dd16ffd8337f545a1232594ebb791a3fb70e34e4f2542c599c03c85dd593cf","source":{"kind":"arxiv","id":"math/0207180","version":1},"attestation_state":"computed","paper":{"title":"The Primary Pretenders","license":"","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J. H. Conway, N. J. A. Sloane, R. K. Guy, W. A. Schneeberger","submitted_at":"2002-07-21T01:52:38Z","abstract_excerpt":"We call a composite number q such that there exists a positive integer b with b^p == b (mod q) a prime pretender to base b. The least prime pretender to base b is the primary pretender q_b. It is shown that there are only 132 distinct primary pretenders, and that q_b is a periodic function of b whose period is the 122-digit number 19568584333460072587245340037736278982017213829337604336734362-\n 294738647777395483196097971852999259921329236506842360439300."},"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":"math/0207180","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NT","submitted_at":"2002-07-21T01:52:38Z","cross_cats_sorted":[],"title_canon_sha256":"c3d69f36db265b7037d27ff7ee5485c0c6290bdd6b8e365342ea51c763d58b10","abstract_canon_sha256":"abdac78bb1970afbbeddf00269d3d9cc81f0c69ec3edd300177c407d3eb92349"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:29.453762Z","signature_b64":"KQU86m9ROGBUl9FUaiFb2zipPJrPeYJ3kh78d9NzHca/5lUebrcokcbHYKpN6v/2/yQwXaFqLo36J/jxCF2SBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92dd16ffd8337f545a1232594ebb791a3fb70e34e4f2542c599c03c85dd593cf","last_reissued_at":"2026-05-18T01:05:29.453336Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:29.453336Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Primary Pretenders","license":"","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J. H. Conway, N. J. A. Sloane, R. K. Guy, W. A. Schneeberger","submitted_at":"2002-07-21T01:52:38Z","abstract_excerpt":"We call a composite number q such that there exists a positive integer b with b^p == b (mod q) a prime pretender to base b. The least prime pretender to base b is the primary pretender q_b. It is shown that there are only 132 distinct primary pretenders, and that q_b is a periodic function of b whose period is the 122-digit number 19568584333460072587245340037736278982017213829337604336734362-\n 294738647777395483196097971852999259921329236506842360439300."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0207180","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":""},"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":"math/0207180","created_at":"2026-05-18T01:05:29.453404+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0207180v1","created_at":"2026-05-18T01:05:29.453404+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0207180","created_at":"2026-05-18T01:05:29.453404+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLORN76YGN7V","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLORN76YGN7VIWQS","created_at":"2026-05-18T12:25:51.375804+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLORN76Y","created_at":"2026-05-18T12:25:51.375804+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/SLORN76YGN7VIWQSGJMU5O3ZDI","json":"https://pith.science/pith/SLORN76YGN7VIWQSGJMU5O3ZDI.json","graph_json":"https://pith.science/api/pith-number/SLORN76YGN7VIWQSGJMU5O3ZDI/graph.json","events_json":"https://pith.science/api/pith-number/SLORN76YGN7VIWQSGJMU5O3ZDI/events.json","paper":"https://pith.science/paper/SLORN76Y"},"agent_actions":{"view_html":"https://pith.science/pith/SLORN76YGN7VIWQSGJMU5O3ZDI","download_json":"https://pith.science/pith/SLORN76YGN7VIWQSGJMU5O3ZDI.json","view_paper":"https://pith.science/paper/SLORN76Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0207180&json=true","fetch_graph":"https://pith.science/api/pith-number/SLORN76YGN7VIWQSGJMU5O3ZDI/graph.json","fetch_events":"https://pith.science/api/pith-number/SLORN76YGN7VIWQSGJMU5O3ZDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLORN76YGN7VIWQSGJMU5O3ZDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLORN76YGN7VIWQSGJMU5O3ZDI/action/storage_attestation","attest_author":"https://pith.science/pith/SLORN76YGN7VIWQSGJMU5O3ZDI/action/author_attestation","sign_citation":"https://pith.science/pith/SLORN76YGN7VIWQSGJMU5O3ZDI/action/citation_signature","submit_replication":"https://pith.science/pith/SLORN76YGN7VIWQSGJMU5O3ZDI/action/replication_record"}},"created_at":"2026-05-18T01:05:29.453404+00:00","updated_at":"2026-05-18T01:05:29.453404+00:00"}