{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KO3EP4E7FPYZLBBJL57IER6FIU","short_pith_number":"pith:KO3EP4E7","schema_version":"1.0","canonical_sha256":"53b647f09f2bf19584295f7e8247c5450e3c58ee5357875c8a89000ca2642cde","source":{"kind":"arxiv","id":"1903.06823","version":1},"attestation_state":"computed","paper":{"title":"A Probable Prime Test With High Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jon Grantham","submitted_at":"2019-03-15T22:21:14Z","abstract_excerpt":"Monier and Rabin proved that an odd composite can pass the Strong Probable Prime Test for at most $\\frac 14$ of the possible bases. In this paper, a probable prime test is developed using quadratic polynomials and the Frobenius automorphism. The test, along with a fixed number of trial divisions, ensures that a composite $n$ will pass for less than $\\frac 1{7710}$ of the polynomials $x^2-bx-c$ with $\\left(b^2+4c\\over n\\right)=-1$ and $\\left(-c\\over n\\right)=1$. The running time of the test is asymptotically $3$ times that of the Strong Probable Prime Test."},"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":"1903.06823","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-03-15T22:21:14Z","cross_cats_sorted":[],"title_canon_sha256":"4bc5d15855aaf109b1b8fb23cf371e0be670d47425e2e6f20ce3308e06c0b56c","abstract_canon_sha256":"4a2cc86197e2df02d5213d81f233567189c761130bd4c1c091c1963a86491c13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:08.927030Z","signature_b64":"S9mPP1ABNOFrTj7SMZTw3HOQ94e7F7ZKbDCj3MWpPKFoNbqCP3jFt+Zps6sj1akHGdR5Ghgq67EbqJ8fPpIwDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53b647f09f2bf19584295f7e8247c5450e3c58ee5357875c8a89000ca2642cde","last_reissued_at":"2026-05-17T23:51:08.926420Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:08.926420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Probable Prime Test With High Confidence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jon Grantham","submitted_at":"2019-03-15T22:21:14Z","abstract_excerpt":"Monier and Rabin proved that an odd composite can pass the Strong Probable Prime Test for at most $\\frac 14$ of the possible bases. In this paper, a probable prime test is developed using quadratic polynomials and the Frobenius automorphism. The test, along with a fixed number of trial divisions, ensures that a composite $n$ will pass for less than $\\frac 1{7710}$ of the polynomials $x^2-bx-c$ with $\\left(b^2+4c\\over n\\right)=-1$ and $\\left(-c\\over n\\right)=1$. The running time of the test is asymptotically $3$ times that of the Strong Probable Prime Test."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.06823","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":"1903.06823","created_at":"2026-05-17T23:51:08.926506+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.06823v1","created_at":"2026-05-17T23:51:08.926506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.06823","created_at":"2026-05-17T23:51:08.926506+00:00"},{"alias_kind":"pith_short_12","alias_value":"KO3EP4E7FPYZ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"KO3EP4E7FPYZLBBJ","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"KO3EP4E7","created_at":"2026-05-18T12:33:21.387695+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/KO3EP4E7FPYZLBBJL57IER6FIU","json":"https://pith.science/pith/KO3EP4E7FPYZLBBJL57IER6FIU.json","graph_json":"https://pith.science/api/pith-number/KO3EP4E7FPYZLBBJL57IER6FIU/graph.json","events_json":"https://pith.science/api/pith-number/KO3EP4E7FPYZLBBJL57IER6FIU/events.json","paper":"https://pith.science/paper/KO3EP4E7"},"agent_actions":{"view_html":"https://pith.science/pith/KO3EP4E7FPYZLBBJL57IER6FIU","download_json":"https://pith.science/pith/KO3EP4E7FPYZLBBJL57IER6FIU.json","view_paper":"https://pith.science/paper/KO3EP4E7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.06823&json=true","fetch_graph":"https://pith.science/api/pith-number/KO3EP4E7FPYZLBBJL57IER6FIU/graph.json","fetch_events":"https://pith.science/api/pith-number/KO3EP4E7FPYZLBBJL57IER6FIU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KO3EP4E7FPYZLBBJL57IER6FIU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KO3EP4E7FPYZLBBJL57IER6FIU/action/storage_attestation","attest_author":"https://pith.science/pith/KO3EP4E7FPYZLBBJL57IER6FIU/action/author_attestation","sign_citation":"https://pith.science/pith/KO3EP4E7FPYZLBBJL57IER6FIU/action/citation_signature","submit_replication":"https://pith.science/pith/KO3EP4E7FPYZLBBJL57IER6FIU/action/replication_record"}},"created_at":"2026-05-17T23:51:08.926506+00:00","updated_at":"2026-05-17T23:51:08.926506+00:00"}