{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NZT7XPJU2BH5I5DUMR4KP3WYZY","short_pith_number":"pith:NZT7XPJU","canonical_record":{"source":{"id":"1108.4168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T07:18:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"844314c2e692cd1c032770ef4695aff6814381eae86c8eed5fb79c7f7f76e8f1","abstract_canon_sha256":"dab71a5c35e34cd1d99d3f5533cbe89ba98992bb39ee43632fa94a657810df1c"},"schema_version":"1.0"},"canonical_sha256":"6e67fbbd34d04fd474746478a7eed8ce3869f837ecd24611009addf94979043e","source":{"kind":"arxiv","id":"1108.4168","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4168","created_at":"2026-05-18T04:14:56Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4168v1","created_at":"2026-05-18T04:14:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4168","created_at":"2026-05-18T04:14:56Z"},{"alias_kind":"pith_short_12","alias_value":"NZT7XPJU2BH5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NZT7XPJU2BH5I5DU","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NZT7XPJU","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NZT7XPJU2BH5I5DUMR4KP3WYZY","target":"record","payload":{"canonical_record":{"source":{"id":"1108.4168","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T07:18:42Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"844314c2e692cd1c032770ef4695aff6814381eae86c8eed5fb79c7f7f76e8f1","abstract_canon_sha256":"dab71a5c35e34cd1d99d3f5533cbe89ba98992bb39ee43632fa94a657810df1c"},"schema_version":"1.0"},"canonical_sha256":"6e67fbbd34d04fd474746478a7eed8ce3869f837ecd24611009addf94979043e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:56.007466Z","signature_b64":"27Kiuf2UdB07uw/trhBa0ZGHkhqdJIJ3A/FN+1EZaxoc9lJcZrOpukPVSN72jB/TgGiZT3SohYuZQyKjz1cvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e67fbbd34d04fd474746478a7eed8ce3869f837ecd24611009addf94979043e","last_reissued_at":"2026-05-18T04:14:56.006998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:56.006998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.4168","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:14:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SRGmnLKX7AjbH12blTrWUHGO4UR4EHv2f1zhKawzuSutH49qVMXGCvpcIqw45xaRa7KJgmOvhFGzHqUVABv9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:45:34.128186Z"},"content_sha256":"49d1fa9f082320073c9cc403c24f9f4889efe14c16572de41cdf49545c3abb97","schema_version":"1.0","event_id":"sha256:49d1fa9f082320073c9cc403c24f9f4889efe14c16572de41cdf49545c3abb97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NZT7XPJU2BH5I5DUMR4KP3WYZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Complexity of Cyclotomic Fast Fourier Transforms over Characteristic-2 Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Xuebin Wu, Zhiyuan Yan","submitted_at":"2011-08-21T07:18:42Z","abstract_excerpt":"Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of their low multiplicative and overall complexities. However, their advantages are shown by inspection in the literature, and there is no asymptotic computational complexity analysis for CFFTs. Their high additive complexity also incurs difficulties in hardware implementations. In this paper, we derive the bounds for the multiplicative and additive complexities "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4168","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:14:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUKQrz3puhTD0F77jl49l4RTRQwLjsxA3qnfMS/k/i6B7MHUTTAKLPqcKiAlnXIiELWNMukPCnjFu5rusyPuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:45:34.128551Z"},"content_sha256":"6de8b0afbec91e7ec7bd8b3ad733d654370c27b4850b5ba5bbf477e5eeea301e","schema_version":"1.0","event_id":"sha256:6de8b0afbec91e7ec7bd8b3ad733d654370c27b4850b5ba5bbf477e5eeea301e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NZT7XPJU2BH5I5DUMR4KP3WYZY/bundle.json","state_url":"https://pith.science/pith/NZT7XPJU2BH5I5DUMR4KP3WYZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NZT7XPJU2BH5I5DUMR4KP3WYZY/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-01T09:45:34Z","links":{"resolver":"https://pith.science/pith/NZT7XPJU2BH5I5DUMR4KP3WYZY","bundle":"https://pith.science/pith/NZT7XPJU2BH5I5DUMR4KP3WYZY/bundle.json","state":"https://pith.science/pith/NZT7XPJU2BH5I5DUMR4KP3WYZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NZT7XPJU2BH5I5DUMR4KP3WYZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NZT7XPJU2BH5I5DUMR4KP3WYZY","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":"dab71a5c35e34cd1d99d3f5533cbe89ba98992bb39ee43632fa94a657810df1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T07:18:42Z","title_canon_sha256":"844314c2e692cd1c032770ef4695aff6814381eae86c8eed5fb79c7f7f76e8f1"},"schema_version":"1.0","source":{"id":"1108.4168","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.4168","created_at":"2026-05-18T04:14:56Z"},{"alias_kind":"arxiv_version","alias_value":"1108.4168v1","created_at":"2026-05-18T04:14:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.4168","created_at":"2026-05-18T04:14:56Z"},{"alias_kind":"pith_short_12","alias_value":"NZT7XPJU2BH5","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NZT7XPJU2BH5I5DU","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NZT7XPJU","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:6de8b0afbec91e7ec7bd8b3ad733d654370c27b4850b5ba5bbf477e5eeea301e","target":"graph","created_at":"2026-05-18T04:14:56Z","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":"Cyclotomic fast Fourier transforms (CFFTs) are efficient implementations of discrete Fourier transforms over finite fields, which have widespread applications in cryptography and error control codes. They are of great interest because of their low multiplicative and overall complexities. However, their advantages are shown by inspection in the literature, and there is no asymptotic computational complexity analysis for CFFTs. Their high additive complexity also incurs difficulties in hardware implementations. In this paper, we derive the bounds for the multiplicative and additive complexities ","authors_text":"Xuebin Wu, Zhiyuan Yan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T07:18:42Z","title":"Computational Complexity of Cyclotomic Fast Fourier Transforms over Characteristic-2 Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.4168","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:49d1fa9f082320073c9cc403c24f9f4889efe14c16572de41cdf49545c3abb97","target":"record","created_at":"2026-05-18T04:14:56Z","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":"dab71a5c35e34cd1d99d3f5533cbe89ba98992bb39ee43632fa94a657810df1c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-08-21T07:18:42Z","title_canon_sha256":"844314c2e692cd1c032770ef4695aff6814381eae86c8eed5fb79c7f7f76e8f1"},"schema_version":"1.0","source":{"id":"1108.4168","kind":"arxiv","version":1}},"canonical_sha256":"6e67fbbd34d04fd474746478a7eed8ce3869f837ecd24611009addf94979043e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e67fbbd34d04fd474746478a7eed8ce3869f837ecd24611009addf94979043e","first_computed_at":"2026-05-18T04:14:56.006998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:56.006998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"27Kiuf2UdB07uw/trhBa0ZGHkhqdJIJ3A/FN+1EZaxoc9lJcZrOpukPVSN72jB/TgGiZT3SohYuZQyKjz1cvBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:56.007466Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.4168","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49d1fa9f082320073c9cc403c24f9f4889efe14c16572de41cdf49545c3abb97","sha256:6de8b0afbec91e7ec7bd8b3ad733d654370c27b4850b5ba5bbf477e5eeea301e"],"state_sha256":"58347d3f01e61ba3cbdd128dbf2b3f52b9c72b1ccb2f57fdc3dadc78c24ff2d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rr+w9MfR2Cfok/z6ZW9XvesrBCjPdcwkZQuLO+neJxteQxO/jFE4JdtuCM6vijyIBhxQSnEO0KkUChQQRdBnBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:45:34.130508Z","bundle_sha256":"cabfad3c994c503e3d638542b534dbcb117cefe08cb7db5bf08acaa9782effa9"}}