{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:N5IS2ZEW5WHFBCWF2ZHCXAT2GG","short_pith_number":"pith:N5IS2ZEW","schema_version":"1.0","canonical_sha256":"6f512d6496ed8e508ac5d64e2b827a31972260a7dd3db2099d2227d14b4b050a","source":{"kind":"arxiv","id":"1004.2091","version":2},"attestation_state":"computed","paper":{"title":"An O(M(n) log n) algorithm for the Jacobi symbol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.DS","authors_text":"Paul Zimmermann, Richard P. Brent","submitted_at":"2010-04-13T02:15:09Z","abstract_excerpt":"The best known algorithm to compute the Jacobi symbol of two n-bit integers runs in time O(M(n) log n), using Sch\\\"onhage's fast continued fraction algorithm combined with an identity due to Gauss. We give a different O(M(n) log n) algorithm based on the binary recursive gcd algorithm of Stehl\\'e and Zimmermann. Our implementation - which to our knowledge is the first to run in time O(M(n) log n) - is faster than GMP's quadratic implementation for inputs larger than about 10000 decimal digits."},"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":"1004.2091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-04-13T02:15:09Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"be9830a4beec14b8a52680e75027a1a17074b65d21c2301115f2509901e7014e","abstract_canon_sha256":"27d90764c85d94648af4cc1f0cdc46417b69eff62585fd08530b1fd10eacd800"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:46.096659Z","signature_b64":"N5ET9KaljqxmsskR1guMIf22HgIFPT+JvqLiBIXTgpIICP32I1jc3K2rMOHlboylNIiQtRxU5fStPm34C80SAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f512d6496ed8e508ac5d64e2b827a31972260a7dd3db2099d2227d14b4b050a","last_reissued_at":"2026-05-18T04:34:46.096171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:46.096171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An O(M(n) log n) algorithm for the Jacobi symbol","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"cs.DS","authors_text":"Paul Zimmermann, Richard P. Brent","submitted_at":"2010-04-13T02:15:09Z","abstract_excerpt":"The best known algorithm to compute the Jacobi symbol of two n-bit integers runs in time O(M(n) log n), using Sch\\\"onhage's fast continued fraction algorithm combined with an identity due to Gauss. We give a different O(M(n) log n) algorithm based on the binary recursive gcd algorithm of Stehl\\'e and Zimmermann. Our implementation - which to our knowledge is the first to run in time O(M(n) log n) - is faster than GMP's quadratic implementation for inputs larger than about 10000 decimal digits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.2091","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":"1004.2091","created_at":"2026-05-18T04:34:46.096232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1004.2091v2","created_at":"2026-05-18T04:34:46.096232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.2091","created_at":"2026-05-18T04:34:46.096232+00:00"},{"alias_kind":"pith_short_12","alias_value":"N5IS2ZEW5WHF","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"N5IS2ZEW5WHFBCWF","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"N5IS2ZEW","created_at":"2026-05-18T12:26:10.704358+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/N5IS2ZEW5WHFBCWF2ZHCXAT2GG","json":"https://pith.science/pith/N5IS2ZEW5WHFBCWF2ZHCXAT2GG.json","graph_json":"https://pith.science/api/pith-number/N5IS2ZEW5WHFBCWF2ZHCXAT2GG/graph.json","events_json":"https://pith.science/api/pith-number/N5IS2ZEW5WHFBCWF2ZHCXAT2GG/events.json","paper":"https://pith.science/paper/N5IS2ZEW"},"agent_actions":{"view_html":"https://pith.science/pith/N5IS2ZEW5WHFBCWF2ZHCXAT2GG","download_json":"https://pith.science/pith/N5IS2ZEW5WHFBCWF2ZHCXAT2GG.json","view_paper":"https://pith.science/paper/N5IS2ZEW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1004.2091&json=true","fetch_graph":"https://pith.science/api/pith-number/N5IS2ZEW5WHFBCWF2ZHCXAT2GG/graph.json","fetch_events":"https://pith.science/api/pith-number/N5IS2ZEW5WHFBCWF2ZHCXAT2GG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N5IS2ZEW5WHFBCWF2ZHCXAT2GG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N5IS2ZEW5WHFBCWF2ZHCXAT2GG/action/storage_attestation","attest_author":"https://pith.science/pith/N5IS2ZEW5WHFBCWF2ZHCXAT2GG/action/author_attestation","sign_citation":"https://pith.science/pith/N5IS2ZEW5WHFBCWF2ZHCXAT2GG/action/citation_signature","submit_replication":"https://pith.science/pith/N5IS2ZEW5WHFBCWF2ZHCXAT2GG/action/replication_record"}},"created_at":"2026-05-18T04:34:46.096232+00:00","updated_at":"2026-05-18T04:34:46.096232+00:00"}