{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:OO4QNUU26UIWA3NVEM3WAXKVRN","short_pith_number":"pith:OO4QNUU2","schema_version":"1.0","canonical_sha256":"73b906d29af511606db52337605d558b77b8a2c0ccb674b926d02ae10678a4de","source":{"kind":"arxiv","id":"1007.1213","version":2},"attestation_state":"computed","paper":{"title":"Composite Cyclotomic Fourier Transforms with Reduced Complexities","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Meghanad Wagh, Ning Chen, Xuebin Wu, Ying Wang, Zhiyuan Yan","submitted_at":"2010-07-07T18:14:28Z","abstract_excerpt":"Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic fast Fourier transforms (CFFTs) are promising due to their low multiplicative complexities. Unfortunately, there are two issues with CFFTs: (1) they rely on efficient short cyclic convolution algorithms, which has not been investigated thoroughly yet, and (2) they have very high additive complexities when directly implemented. In this paper, we address both i"},"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":"1007.1213","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.IT","submitted_at":"2010-07-07T18:14:28Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"ad6f66c6277fa58e9e9e348ce63f1183da0e0185785ae8b427df5d1163ae2fcc","abstract_canon_sha256":"12279b16a9e7dcfd3d6505d5db9927f3a6790f5d37731b14a3bf0dd0d0fb1c56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:31.413974Z","signature_b64":"PDKOTtVVm6osmhRuWI69LyPcoBy7EB1PATOAYKzQAjhlOKNDb6mMtZrZvTtbXeoy3Pc9ujrtRjLhR7/2VYXqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73b906d29af511606db52337605d558b77b8a2c0ccb674b926d02ae10678a4de","last_reissued_at":"2026-05-18T02:06:31.413185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:31.413185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Composite Cyclotomic Fourier Transforms with Reduced Complexities","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Meghanad Wagh, Ning Chen, Xuebin Wu, Ying Wang, Zhiyuan Yan","submitted_at":"2010-07-07T18:14:28Z","abstract_excerpt":"Discrete Fourier transforms~(DFTs) over finite fields have widespread applications in digital communication and storage systems. Hence, reducing the computational complexities of DFTs is of great significance. Recently proposed cyclotomic fast Fourier transforms (CFFTs) are promising due to their low multiplicative complexities. Unfortunately, there are two issues with CFFTs: (1) they rely on efficient short cyclic convolution algorithms, which has not been investigated thoroughly yet, and (2) they have very high additive complexities when directly implemented. In this paper, we address both i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1213","kind":"arxiv","version":2},"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":"1007.1213","created_at":"2026-05-18T02:06:31.413295+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1213v2","created_at":"2026-05-18T02:06:31.413295+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1213","created_at":"2026-05-18T02:06:31.413295+00:00"},{"alias_kind":"pith_short_12","alias_value":"OO4QNUU26UIW","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"OO4QNUU26UIWA3NV","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"OO4QNUU2","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/OO4QNUU26UIWA3NVEM3WAXKVRN","json":"https://pith.science/pith/OO4QNUU26UIWA3NVEM3WAXKVRN.json","graph_json":"https://pith.science/api/pith-number/OO4QNUU26UIWA3NVEM3WAXKVRN/graph.json","events_json":"https://pith.science/api/pith-number/OO4QNUU26UIWA3NVEM3WAXKVRN/events.json","paper":"https://pith.science/paper/OO4QNUU2"},"agent_actions":{"view_html":"https://pith.science/pith/OO4QNUU26UIWA3NVEM3WAXKVRN","download_json":"https://pith.science/pith/OO4QNUU26UIWA3NVEM3WAXKVRN.json","view_paper":"https://pith.science/paper/OO4QNUU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1213&json=true","fetch_graph":"https://pith.science/api/pith-number/OO4QNUU26UIWA3NVEM3WAXKVRN/graph.json","fetch_events":"https://pith.science/api/pith-number/OO4QNUU26UIWA3NVEM3WAXKVRN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OO4QNUU26UIWA3NVEM3WAXKVRN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OO4QNUU26UIWA3NVEM3WAXKVRN/action/storage_attestation","attest_author":"https://pith.science/pith/OO4QNUU26UIWA3NVEM3WAXKVRN/action/author_attestation","sign_citation":"https://pith.science/pith/OO4QNUU26UIWA3NVEM3WAXKVRN/action/citation_signature","submit_replication":"https://pith.science/pith/OO4QNUU26UIWA3NVEM3WAXKVRN/action/replication_record"}},"created_at":"2026-05-18T02:06:31.413295+00:00","updated_at":"2026-05-18T02:06:31.413295+00:00"}