{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OXRYMV7YZ7YYJJFHQ23HXXGTCF","short_pith_number":"pith:OXRYMV7Y","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"},"canonical_sha256":"75e38657f8cff184a4a786b67bdcd3116150810aac4fbc2d034d2248b83c1fdf","source":{"kind":"arxiv","id":"1010.1101","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1101","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1101v1","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1101","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"OXRYMV7YZ7YY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OXRYMV7YZ7YYJJFH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OXRYMV7Y","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OXRYMV7YZ7YYJJFHQ23HXXGTCF","target":"record","payload":{"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"},"canonical_sha256":"75e38657f8cff184a4a786b67bdcd3116150810aac4fbc2d034d2248b83c1fdf","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"},"source_kind":"arxiv","source_id":"1010.1101","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXNg9gQcSkuunT93auHKtD44lIn1YjKAGNhGwhXNOUdfFDbEePiYuCKO6j2bzc/TuvyHk2Bv6TuLrxDe5CIbAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:47:42.437912Z"},"content_sha256":"84003717cf63dab679d50fe19bc19de6c53d06b0b93801af1a5c2f4eafb13c7f","schema_version":"1.0","event_id":"sha256:84003717cf63dab679d50fe19bc19de6c53d06b0b93801af1a5c2f4eafb13c7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OXRYMV7YZ7YYJJFHQ23HXXGTCF","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIeSoM0U9OIMdQwH7jDQDR/GVZaPdasolUWCYgBXXK6eqghrxGwmKc9vAlNd28YInOKVK4TPIJRbbxlmbdP4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:47:42.438640Z"},"content_sha256":"e543cc38719aee8434e76fda7e4a929334296a558f34c8c062ceb3588917361c","schema_version":"1.0","event_id":"sha256:e543cc38719aee8434e76fda7e4a929334296a558f34c8c062ceb3588917361c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/bundle.json","state_url":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T11:47:42Z","links":{"resolver":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF","bundle":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/bundle.json","state":"https://pith.science/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXRYMV7YZ7YYJJFHQ23HXXGTCF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OXRYMV7YZ7YYJJFHQ23HXXGTCF","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":"647845047216e28c3324300a5735522f6624ab7b267314ebd54dcc1c80d55173","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-06T09:29:34Z","title_canon_sha256":"48b28e6e2d610c380efe475056d2ab0372a9d616848745430bda6e6897d73409"},"schema_version":"1.0","source":{"id":"1010.1101","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.1101","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1010.1101v1","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.1101","created_at":"2026-05-18T04:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"OXRYMV7YZ7YY","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OXRYMV7YZ7YYJJFH","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OXRYMV7Y","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:e543cc38719aee8434e76fda7e4a929334296a558f34c8c062ceb3588917361c","target":"graph","created_at":"2026-05-18T04:39:49Z","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":"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","authors_text":"Alexey Pospelov","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-06T09:29:34Z","title":"Faster Polynomial Multiplication via Discrete Fourier Transforms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.1101","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:84003717cf63dab679d50fe19bc19de6c53d06b0b93801af1a5c2f4eafb13c7f","target":"record","created_at":"2026-05-18T04:39:49Z","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":"647845047216e28c3324300a5735522f6624ab7b267314ebd54dcc1c80d55173","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-06T09:29:34Z","title_canon_sha256":"48b28e6e2d610c380efe475056d2ab0372a9d616848745430bda6e6897d73409"},"schema_version":"1.0","source":{"id":"1010.1101","kind":"arxiv","version":1}},"canonical_sha256":"75e38657f8cff184a4a786b67bdcd3116150810aac4fbc2d034d2248b83c1fdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75e38657f8cff184a4a786b67bdcd3116150810aac4fbc2d034d2248b83c1fdf","first_computed_at":"2026-05-18T04:39:49.807348Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:49.807348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uvUgcK7bRB0kt+wGBcBSYO6L1A2s8RKJEYCpk0p3E56Wo+j+noBkXFRshU0hiARHwdSvJydrKgTCKhd6OKgDDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:49.807835Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.1101","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84003717cf63dab679d50fe19bc19de6c53d06b0b93801af1a5c2f4eafb13c7f","sha256:e543cc38719aee8434e76fda7e4a929334296a558f34c8c062ceb3588917361c"],"state_sha256":"347d24b115f43a8d0525d1e2b31671a11e3e4065f793abb869c55405b648235d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8qgeNg2dT1ksi1RTKobWPT/wxXiJPrZzADEsY6tSAUEvfZO52oDVvORCpSHWpFhKkZnM5L9FblE+O4R3w2YADw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:47:42.442732Z","bundle_sha256":"d1b8573e1321c0ae1c0d484b700c419a049110bcfcd268338a495f8c9f7043f0"}}