{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OXRYMV7YZ7YYJJFHQ23HXXGTCF","short_pith_number":"pith:OXRYMV7Y","schema_version":"1.0","canonical_sha256":"75e38657f8cff184a4a786b67bdcd3116150810aac4fbc2d034d2248b83c1fdf","source":{"kind":"arxiv","id":"1010.1101","version":1},"attestation_state":"computed","paper":{"title":"Faster Polynomial Multiplication via Discrete Fourier Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Alexey Pospelov","submitted_at":"2010-10-06T09:29:34Z","abstract_excerpt":"We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for multiplication of polynomials over fields supporting DFTs of large smooth orders, Sch\\\"onhage-Strassen's algorithm over arbitrary fields of characteristic different from 2, Sch\\\"onhage's algorithm over fields of characteristic 2, and Cantor-Kaltofen's algorithm over arbitrary algebras---all appear to be instances of this approach. We also obtain faster algorithms for p"},"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":"1010.1101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-06T09:29:34Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"48b28e6e2d610c380efe475056d2ab0372a9d616848745430bda6e6897d73409","abstract_canon_sha256":"647845047216e28c3324300a5735522f6624ab7b267314ebd54dcc1c80d55173"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:49.807835Z","signature_b64":"uvUgcK7bRB0kt+wGBcBSYO6L1A2s8RKJEYCpk0p3E56Wo+j+noBkXFRshU0hiARHwdSvJydrKgTCKhd6OKgDDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75e38657f8cff184a4a786b67bdcd3116150810aac4fbc2d034d2248b83c1fdf","last_reissued_at":"2026-05-18T04:39:49.807348Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:49.807348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Polynomial Multiplication via Discrete Fourier Transforms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Alexey Pospelov","submitted_at":"2010-10-06T09:29:34Z","abstract_excerpt":"We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for multiplication of polynomials over fields supporting DFTs of large smooth orders, Sch\\\"onhage-Strassen's algorithm over arbitrary fields of characteristic different from 2, Sch\\\"onhage's algorithm over fields of characteristic 2, and Cantor-Kaltofen's algorithm over arbitrary algebras---all appear to be instances of this approach. We also obtain faster algorithms for p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1101","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":"1010.1101","created_at":"2026-05-18T04:39:49.807425+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.1101v1","created_at":"2026-05-18T04:39:49.807425+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1101","created_at":"2026-05-18T04:39:49.807425+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXRYMV7YZ7YY","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXRYMV7YZ7YYJJFH","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXRYMV7Y","created_at":"2026-05-18T12:26:12.377268+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/OXRYMV7YZ7YYJJFHQ23HXXGTCF","json":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF.json","graph_json":"https://pith.science/api/pith-number/OXRYMV7YZ7YYJJFHQ23HXXGTCF/graph.json","events_json":"https://pith.science/api/pith-number/OXRYMV7YZ7YYJJFHQ23HXXGTCF/events.json","paper":"https://pith.science/paper/OXRYMV7Y"},"agent_actions":{"view_html":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF","download_json":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF.json","view_paper":"https://pith.science/paper/OXRYMV7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.1101&json=true","fetch_graph":"https://pith.science/api/pith-number/OXRYMV7YZ7YYJJFHQ23HXXGTCF/graph.json","fetch_events":"https://pith.science/api/pith-number/OXRYMV7YZ7YYJJFHQ23HXXGTCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/action/storage_attestation","attest_author":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/action/author_attestation","sign_citation":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/action/citation_signature","submit_replication":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/action/replication_record"}},"created_at":"2026-05-18T04:39:49.807425+00:00","updated_at":"2026-05-18T04:39:49.807425+00:00"}