{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5DVCALDICDUUBD3F2I5FC2YJSB","short_pith_number":"pith:5DVCALDI","schema_version":"1.0","canonical_sha256":"e8ea202c6810e9408f65d23a516b09906e39601ed2978ccf01215899176f28e3","source":{"kind":"arxiv","id":"1811.01490","version":1},"attestation_state":"computed","paper":{"title":"Putting F\\\"urer Algorithm into Practice with the BPAS Library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Davood Mohajerani, Lin-Xiao Wang, Marc Moreno-Maza, Sviatoslav Covanov","submitted_at":"2018-11-05T02:29:36Z","abstract_excerpt":"Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\\\"o}nhage and Strassen designed an algorithm that improved the multiplication time for two integers of at most $n$ bits to $\\mathcal{O}(\\log n \\log \\log n)$. In 2007, Martin F\\\"urer presented a new algorithm that runs in $O \\left(n \\log n\\ \\cdot 2^{O(\\log^* n)} \\right)$, where $\\log^* n$ is the iterated logarithm of $n$.\n  We explain how we can put F\\\"urer's ideas into practice for multiplying polynomials over a prime field $\\mathbb{Z} / p \\math"},"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":"1811.01490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-11-05T02:29:36Z","cross_cats_sorted":[],"title_canon_sha256":"1b3df569691cfdd5ebbb10ee11ff2838ee67c0080c093e598ba7cb5d57e50020","abstract_canon_sha256":"60be928bdd02cc900322d1b0c32be6a619ef9f1557b3b7e0f62f170d5eece487"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.167737Z","signature_b64":"5/o9kh6MRNKRVfJI8jgXgCrS+wV4J6y5etwGRIHUuyZ5XUf6Vj1fIVj95m5l088s8r1tL6WKKjGGO8D6D4V1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8ea202c6810e9408f65d23a516b09906e39601ed2978ccf01215899176f28e3","last_reissued_at":"2026-05-18T00:01:34.167113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.167113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Putting F\\\"urer Algorithm into Practice with the BPAS Library","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Davood Mohajerani, Lin-Xiao Wang, Marc Moreno-Maza, Sviatoslav Covanov","submitted_at":"2018-11-05T02:29:36Z","abstract_excerpt":"Fast algorithms for integer and polynomial multiplication play an important role in scientific computing as well as in other disciplines. In 1971, Sch{\\\"o}nhage and Strassen designed an algorithm that improved the multiplication time for two integers of at most $n$ bits to $\\mathcal{O}(\\log n \\log \\log n)$. In 2007, Martin F\\\"urer presented a new algorithm that runs in $O \\left(n \\log n\\ \\cdot 2^{O(\\log^* n)} \\right)$, where $\\log^* n$ is the iterated logarithm of $n$.\n  We explain how we can put F\\\"urer's ideas into practice for multiplying polynomials over a prime field $\\mathbb{Z} / p \\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01490","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":"1811.01490","created_at":"2026-05-18T00:01:34.167206+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01490v1","created_at":"2026-05-18T00:01:34.167206+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01490","created_at":"2026-05-18T00:01:34.167206+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DVCALDICDUU","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DVCALDICDUUBD3F","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DVCALDI","created_at":"2026-05-18T12:32:08.215937+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/5DVCALDICDUUBD3F2I5FC2YJSB","json":"https://pith.science/pith/5DVCALDICDUUBD3F2I5FC2YJSB.json","graph_json":"https://pith.science/api/pith-number/5DVCALDICDUUBD3F2I5FC2YJSB/graph.json","events_json":"https://pith.science/api/pith-number/5DVCALDICDUUBD3F2I5FC2YJSB/events.json","paper":"https://pith.science/paper/5DVCALDI"},"agent_actions":{"view_html":"https://pith.science/pith/5DVCALDICDUUBD3F2I5FC2YJSB","download_json":"https://pith.science/pith/5DVCALDICDUUBD3F2I5FC2YJSB.json","view_paper":"https://pith.science/paper/5DVCALDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01490&json=true","fetch_graph":"https://pith.science/api/pith-number/5DVCALDICDUUBD3F2I5FC2YJSB/graph.json","fetch_events":"https://pith.science/api/pith-number/5DVCALDICDUUBD3F2I5FC2YJSB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DVCALDICDUUBD3F2I5FC2YJSB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DVCALDICDUUBD3F2I5FC2YJSB/action/storage_attestation","attest_author":"https://pith.science/pith/5DVCALDICDUUBD3F2I5FC2YJSB/action/author_attestation","sign_citation":"https://pith.science/pith/5DVCALDICDUUBD3F2I5FC2YJSB/action/citation_signature","submit_replication":"https://pith.science/pith/5DVCALDICDUUBD3F2I5FC2YJSB/action/replication_record"}},"created_at":"2026-05-18T00:01:34.167206+00:00","updated_at":"2026-05-18T00:01:34.167206+00:00"}