{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:OLLDHM5BQK2BDDHEVNSL5Q5CSL","short_pith_number":"pith:OLLDHM5B","schema_version":"1.0","canonical_sha256":"72d633b3a182b4118ce4ab64bec3a292d38ed0610e5b5d5fd3a2c4e5407ef94b","source":{"kind":"arxiv","id":"1204.1657","version":2},"attestation_state":"computed","paper":{"title":"A faster pseudo-primality test","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jean-Marc Couveignes, Reynald Lercier, Tony Ezome","submitted_at":"2012-04-07T16:53:12Z","abstract_excerpt":"We propose a pseudo-primality test using cyclic extensions of $\\mathbb Z/n \\mathbb Z$. For every positive integer $k \\leq \\log n$, this test achieves the security of $k$ Miller-Rabin tests at the cost of $k^{1/2+o(1)}$ Miller-Rabin tests."},"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":"1204.1657","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-04-07T16:53:12Z","cross_cats_sorted":[],"title_canon_sha256":"202aefe7ded8f7c771971d60148eb3fe34987a7462202b39b455c924802c724b","abstract_canon_sha256":"21a1bbb7483214433d06f78aa65b9dec0d2ca5203e4a76666bc928f108a7610e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:36.249110Z","signature_b64":"AT92ULhDlE7e9l5AEONUgkpg0erxjrxtA6BPNYjlJxt4GSyHayHfNal0UmUn9QT5f0T5GyqWJ0a7RYLurNVPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72d633b3a182b4118ce4ab64bec3a292d38ed0610e5b5d5fd3a2c4e5407ef94b","last_reissued_at":"2026-05-17T23:53:36.248401Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:36.248401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A faster pseudo-primality test","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jean-Marc Couveignes, Reynald Lercier, Tony Ezome","submitted_at":"2012-04-07T16:53:12Z","abstract_excerpt":"We propose a pseudo-primality test using cyclic extensions of $\\mathbb Z/n \\mathbb Z$. For every positive integer $k \\leq \\log n$, this test achieves the security of $k$ Miller-Rabin tests at the cost of $k^{1/2+o(1)}$ Miller-Rabin tests."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1657","kind":"arxiv","version":2},"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":"1204.1657","created_at":"2026-05-17T23:53:36.248511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1657v2","created_at":"2026-05-17T23:53:36.248511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1657","created_at":"2026-05-17T23:53:36.248511+00:00"},{"alias_kind":"pith_short_12","alias_value":"OLLDHM5BQK2B","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"OLLDHM5BQK2BDDHE","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"OLLDHM5B","created_at":"2026-05-18T12:27:16.716162+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/OLLDHM5BQK2BDDHEVNSL5Q5CSL","json":"https://pith.science/pith/OLLDHM5BQK2BDDHEVNSL5Q5CSL.json","graph_json":"https://pith.science/api/pith-number/OLLDHM5BQK2BDDHEVNSL5Q5CSL/graph.json","events_json":"https://pith.science/api/pith-number/OLLDHM5BQK2BDDHEVNSL5Q5CSL/events.json","paper":"https://pith.science/paper/OLLDHM5B"},"agent_actions":{"view_html":"https://pith.science/pith/OLLDHM5BQK2BDDHEVNSL5Q5CSL","download_json":"https://pith.science/pith/OLLDHM5BQK2BDDHEVNSL5Q5CSL.json","view_paper":"https://pith.science/paper/OLLDHM5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1657&json=true","fetch_graph":"https://pith.science/api/pith-number/OLLDHM5BQK2BDDHEVNSL5Q5CSL/graph.json","fetch_events":"https://pith.science/api/pith-number/OLLDHM5BQK2BDDHEVNSL5Q5CSL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OLLDHM5BQK2BDDHEVNSL5Q5CSL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OLLDHM5BQK2BDDHEVNSL5Q5CSL/action/storage_attestation","attest_author":"https://pith.science/pith/OLLDHM5BQK2BDDHEVNSL5Q5CSL/action/author_attestation","sign_citation":"https://pith.science/pith/OLLDHM5BQK2BDDHEVNSL5Q5CSL/action/citation_signature","submit_replication":"https://pith.science/pith/OLLDHM5BQK2BDDHEVNSL5Q5CSL/action/replication_record"}},"created_at":"2026-05-17T23:53:36.248511+00:00","updated_at":"2026-05-17T23:53:36.248511+00:00"}