{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LHVHNIAQFMO7QLGCHH2ZQVII6A","short_pith_number":"pith:LHVHNIAQ","schema_version":"1.0","canonical_sha256":"59ea76a0102b1df82cc239f5985508f01218e30b3475215157424810c4eb7f3b","source":{"kind":"arxiv","id":"1806.08697","version":1},"attestation_state":"computed","paper":{"title":"Fast tabulation of challenge pseudoprimes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Shallue, Jonathan Webster","submitted_at":"2018-06-22T14:33:39Z","abstract_excerpt":"We provide a new algorithm for tabulating composite numbers which are pseudoprimes to both a Fermat test and a Lucas test. Our algorithm is optimized for parameter choices that minimize the occurrence of pseudoprimes, and for pseudoprimes with a fixed number of prime factors. Using this, we have confirmed that there are no PSW challenge pseudoprimes with two or three prime factors up to $2^{80}$. In the case where one is tabulating challenge pseudoprimes with a fixed number of prime factors, we prove our algorithm gives an unconditional asymptotic improvement over previous methods."},"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":"1806.08697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-06-22T14:33:39Z","cross_cats_sorted":[],"title_canon_sha256":"ad6c9393abbb7ff3871cd6740a88597d8a09c45dfa0b5674beb8491b2839b70d","abstract_canon_sha256":"94d14eef8fa5f638bf127fb07c41659f64f76438be535f6702d43b1c86adda32"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:11.304596Z","signature_b64":"tRWkMkiWcNVZJ459qQOSLfCtvv2H1+t4ZEP1Dx/1LN6hPnYLGKTpn3+vPy4z7UgkRhEz7Gho9aCystVWGQqFBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59ea76a0102b1df82cc239f5985508f01218e30b3475215157424810c4eb7f3b","last_reissued_at":"2026-05-17T23:54:11.303998Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:11.303998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast tabulation of challenge pseudoprimes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Andrew Shallue, Jonathan Webster","submitted_at":"2018-06-22T14:33:39Z","abstract_excerpt":"We provide a new algorithm for tabulating composite numbers which are pseudoprimes to both a Fermat test and a Lucas test. Our algorithm is optimized for parameter choices that minimize the occurrence of pseudoprimes, and for pseudoprimes with a fixed number of prime factors. Using this, we have confirmed that there are no PSW challenge pseudoprimes with two or three prime factors up to $2^{80}$. In the case where one is tabulating challenge pseudoprimes with a fixed number of prime factors, we prove our algorithm gives an unconditional asymptotic improvement over previous methods."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.08697","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":"1806.08697","created_at":"2026-05-17T23:54:11.304105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.08697v1","created_at":"2026-05-17T23:54:11.304105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.08697","created_at":"2026-05-17T23:54:11.304105+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHVHNIAQFMO7","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHVHNIAQFMO7QLGC","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHVHNIAQ","created_at":"2026-05-18T12:32:37.024351+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/LHVHNIAQFMO7QLGCHH2ZQVII6A","json":"https://pith.science/pith/LHVHNIAQFMO7QLGCHH2ZQVII6A.json","graph_json":"https://pith.science/api/pith-number/LHVHNIAQFMO7QLGCHH2ZQVII6A/graph.json","events_json":"https://pith.science/api/pith-number/LHVHNIAQFMO7QLGCHH2ZQVII6A/events.json","paper":"https://pith.science/paper/LHVHNIAQ"},"agent_actions":{"view_html":"https://pith.science/pith/LHVHNIAQFMO7QLGCHH2ZQVII6A","download_json":"https://pith.science/pith/LHVHNIAQFMO7QLGCHH2ZQVII6A.json","view_paper":"https://pith.science/paper/LHVHNIAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.08697&json=true","fetch_graph":"https://pith.science/api/pith-number/LHVHNIAQFMO7QLGCHH2ZQVII6A/graph.json","fetch_events":"https://pith.science/api/pith-number/LHVHNIAQFMO7QLGCHH2ZQVII6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHVHNIAQFMO7QLGCHH2ZQVII6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHVHNIAQFMO7QLGCHH2ZQVII6A/action/storage_attestation","attest_author":"https://pith.science/pith/LHVHNIAQFMO7QLGCHH2ZQVII6A/action/author_attestation","sign_citation":"https://pith.science/pith/LHVHNIAQFMO7QLGCHH2ZQVII6A/action/citation_signature","submit_replication":"https://pith.science/pith/LHVHNIAQFMO7QLGCHH2ZQVII6A/action/replication_record"}},"created_at":"2026-05-17T23:54:11.304105+00:00","updated_at":"2026-05-17T23:54:11.304105+00:00"}