{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5DVCALDICDUUBD3F2I5FC2YJSB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"60be928bdd02cc900322d1b0c32be6a619ef9f1557b3b7e0f62f170d5eece487","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-11-05T02:29:36Z","title_canon_sha256":"1b3df569691cfdd5ebbb10ee11ff2838ee67c0080c093e598ba7cb5d57e50020"},"schema_version":"1.0","source":{"id":"1811.01490","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01490","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01490v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01490","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"5DVCALDICDUU","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5DVCALDICDUUBD3F","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5DVCALDI","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:8bc5214732e6aef6199b916903ac067f663bc807ccbf8c974122e56b69b053c2","target":"graph","created_at":"2026-05-18T00:01:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Davood Mohajerani, Lin-Xiao Wang, Marc Moreno-Maza, Sviatoslav Covanov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-11-05T02:29:36Z","title":"Putting F\\\"urer Algorithm into Practice with the BPAS Library"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01490","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a710a7d4b23454ad82e9867b2148c97f51a29216edf4eca45feccb4e30dc9d76","target":"record","created_at":"2026-05-18T00:01:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"60be928bdd02cc900322d1b0c32be6a619ef9f1557b3b7e0f62f170d5eece487","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-11-05T02:29:36Z","title_canon_sha256":"1b3df569691cfdd5ebbb10ee11ff2838ee67c0080c093e598ba7cb5d57e50020"},"schema_version":"1.0","source":{"id":"1811.01490","kind":"arxiv","version":1}},"canonical_sha256":"e8ea202c6810e9408f65d23a516b09906e39601ed2978ccf01215899176f28e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8ea202c6810e9408f65d23a516b09906e39601ed2978ccf01215899176f28e3","first_computed_at":"2026-05-18T00:01:34.167113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.167113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5/o9kh6MRNKRVfJI8jgXgCrS+wV4J6y5etwGRIHUuyZ5XUf6Vj1fIVj95m5l088s8r1tL6WKKjGGO8D6D4V1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.167737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01490","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a710a7d4b23454ad82e9867b2148c97f51a29216edf4eca45feccb4e30dc9d76","sha256:8bc5214732e6aef6199b916903ac067f663bc807ccbf8c974122e56b69b053c2"],"state_sha256":"802ba78acad7efdc2a2114f3ea867b262f4438eb1f7152210fcfedaa29135834"}