{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2A23BZTKKTSKU2PER6U5AIGGUC","short_pith_number":"pith:2A23BZTK","schema_version":"1.0","canonical_sha256":"d035b0e66a54e4aa69e48fa9d020c6a0bca8cbec9a43a74c3b1aa8049aef587c","source":{"kind":"arxiv","id":"1509.00864","version":1},"attestation_state":"computed","paper":{"title":"Strong Pseudoprimes to Twelve Prime Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS"],"primary_cat":"math.NT","authors_text":"Jonathan P. Sorenson, Jonathan Webster","submitted_at":"2015-09-02T20:23:07Z","abstract_excerpt":"Let $\\psi_m$ be the smallest strong pseudoprime to the first $m$ prime bases. This value is known for $1 \\leq m \\leq 11$. We extend this by finding $\\psi_{12}$ and $\\psi_{13}$. We also present an algorithm to find all integers $n\\le B$ that are strong pseudoprimes to the first $m$ prime bases; with a reasonable heuristic assumption we can show that it takes at most $B^{2/3+o(1)}$ time."},"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":"1509.00864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-09-02T20:23:07Z","cross_cats_sorted":["cs.DS","cs.MS"],"title_canon_sha256":"fb06089211a8dbb11c90d69259466d29016c3647ff45c0752302af069f8b8ce0","abstract_canon_sha256":"d71630cbacb2487153be9b438f7d92e323124900d6aecece88d782091b66fd37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:41.644405Z","signature_b64":"vCpIGV5vVAXqosKIM4LHsg8vCOcru5VAFjFMP5/xI80Gge1KiJ3w/ACT9WRXxqCs5U3BXN3vzT1ptH6QzKEwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d035b0e66a54e4aa69e48fa9d020c6a0bca8cbec9a43a74c3b1aa8049aef587c","last_reissued_at":"2026-05-18T00:00:41.643827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:41.643827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Pseudoprimes to Twelve Prime Bases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.MS"],"primary_cat":"math.NT","authors_text":"Jonathan P. Sorenson, Jonathan Webster","submitted_at":"2015-09-02T20:23:07Z","abstract_excerpt":"Let $\\psi_m$ be the smallest strong pseudoprime to the first $m$ prime bases. This value is known for $1 \\leq m \\leq 11$. We extend this by finding $\\psi_{12}$ and $\\psi_{13}$. We also present an algorithm to find all integers $n\\le B$ that are strong pseudoprimes to the first $m$ prime bases; with a reasonable heuristic assumption we can show that it takes at most $B^{2/3+o(1)}$ time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00864","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":"1509.00864","created_at":"2026-05-18T00:00:41.643917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.00864v1","created_at":"2026-05-18T00:00:41.643917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00864","created_at":"2026-05-18T00:00:41.643917+00:00"},{"alias_kind":"pith_short_12","alias_value":"2A23BZTKKTSK","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"2A23BZTKKTSKU2PE","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"2A23BZTK","created_at":"2026-05-18T12:28:59.999130+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/2A23BZTKKTSKU2PER6U5AIGGUC","json":"https://pith.science/pith/2A23BZTKKTSKU2PER6U5AIGGUC.json","graph_json":"https://pith.science/api/pith-number/2A23BZTKKTSKU2PER6U5AIGGUC/graph.json","events_json":"https://pith.science/api/pith-number/2A23BZTKKTSKU2PER6U5AIGGUC/events.json","paper":"https://pith.science/paper/2A23BZTK"},"agent_actions":{"view_html":"https://pith.science/pith/2A23BZTKKTSKU2PER6U5AIGGUC","download_json":"https://pith.science/pith/2A23BZTKKTSKU2PER6U5AIGGUC.json","view_paper":"https://pith.science/paper/2A23BZTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.00864&json=true","fetch_graph":"https://pith.science/api/pith-number/2A23BZTKKTSKU2PER6U5AIGGUC/graph.json","fetch_events":"https://pith.science/api/pith-number/2A23BZTKKTSKU2PER6U5AIGGUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2A23BZTKKTSKU2PER6U5AIGGUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2A23BZTKKTSKU2PER6U5AIGGUC/action/storage_attestation","attest_author":"https://pith.science/pith/2A23BZTKKTSKU2PER6U5AIGGUC/action/author_attestation","sign_citation":"https://pith.science/pith/2A23BZTKKTSKU2PER6U5AIGGUC/action/citation_signature","submit_replication":"https://pith.science/pith/2A23BZTKKTSKU2PER6U5AIGGUC/action/replication_record"}},"created_at":"2026-05-18T00:00:41.643917+00:00","updated_at":"2026-05-18T00:00:41.643917+00:00"}