{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SFEJ2LFTYHCHX43VDJO5F3KT5X","short_pith_number":"pith:SFEJ2LFT","schema_version":"1.0","canonical_sha256":"91489d2cb3c1c47bf3751a5dd2ed53edf579fe647e817b6b03441a16db0a29aa","source":{"kind":"arxiv","id":"1707.00349","version":3},"attestation_state":"computed","paper":{"title":"A new algorithm for fast generalized DFTs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"cs.DS","authors_text":"Chloe Ching-Yun Hsu, Chris Umans","submitted_at":"2017-07-02T20:41:10Z","abstract_excerpt":"We give an new arithmetic algorithm to compute the generalized Discrete Fourier Transform (DFT) over finite groups $G$. The new algorithm uses $O(|G|^{\\omega/2 + o(1)})$ operations to compute the generalized DFT over finite groups of Lie type, including the linear, orthogonal, and symplectic families and their variants, as well as all finite simple groups of Lie type. Here $\\omega$ is the exponent of matrix multiplication, so the exponent $\\omega/2$ is optimal if $\\omega = 2$. Previously, \"exponent one\" algorithms were known for supersolvable groups and the symmetric and alternating groups. No"},"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":"1707.00349","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-02T20:41:10Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"d24307bddb0e0af1c3a2bc793e2ec38ea910dcc80918ec7437b2f6b2a0f19815","abstract_canon_sha256":"479eb6844f642fd78d01f166552a8091854f01d01f42676180c43e790fdc1935"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:47.504627Z","signature_b64":"sFm9Co+NsX/ecoks5RA54dI4KfrF6ScSdd03pe3AUuT3I1TCd/KoJoZsVdZyJyxxPKm70TIpiAbUZn7lDnMoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91489d2cb3c1c47bf3751a5dd2ed53edf579fe647e817b6b03441a16db0a29aa","last_reissued_at":"2026-05-18T00:19:47.503891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:47.503891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new algorithm for fast generalized DFTs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"cs.DS","authors_text":"Chloe Ching-Yun Hsu, Chris Umans","submitted_at":"2017-07-02T20:41:10Z","abstract_excerpt":"We give an new arithmetic algorithm to compute the generalized Discrete Fourier Transform (DFT) over finite groups $G$. The new algorithm uses $O(|G|^{\\omega/2 + o(1)})$ operations to compute the generalized DFT over finite groups of Lie type, including the linear, orthogonal, and symplectic families and their variants, as well as all finite simple groups of Lie type. Here $\\omega$ is the exponent of matrix multiplication, so the exponent $\\omega/2$ is optimal if $\\omega = 2$. Previously, \"exponent one\" algorithms were known for supersolvable groups and the symmetric and alternating groups. No"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00349","kind":"arxiv","version":3},"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":"1707.00349","created_at":"2026-05-18T00:19:47.504003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00349v3","created_at":"2026-05-18T00:19:47.504003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00349","created_at":"2026-05-18T00:19:47.504003+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFEJ2LFTYHCH","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFEJ2LFTYHCHX43V","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFEJ2LFT","created_at":"2026-05-18T12:31:43.269735+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/SFEJ2LFTYHCHX43VDJO5F3KT5X","json":"https://pith.science/pith/SFEJ2LFTYHCHX43VDJO5F3KT5X.json","graph_json":"https://pith.science/api/pith-number/SFEJ2LFTYHCHX43VDJO5F3KT5X/graph.json","events_json":"https://pith.science/api/pith-number/SFEJ2LFTYHCHX43VDJO5F3KT5X/events.json","paper":"https://pith.science/paper/SFEJ2LFT"},"agent_actions":{"view_html":"https://pith.science/pith/SFEJ2LFTYHCHX43VDJO5F3KT5X","download_json":"https://pith.science/pith/SFEJ2LFTYHCHX43VDJO5F3KT5X.json","view_paper":"https://pith.science/paper/SFEJ2LFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00349&json=true","fetch_graph":"https://pith.science/api/pith-number/SFEJ2LFTYHCHX43VDJO5F3KT5X/graph.json","fetch_events":"https://pith.science/api/pith-number/SFEJ2LFTYHCHX43VDJO5F3KT5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFEJ2LFTYHCHX43VDJO5F3KT5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFEJ2LFTYHCHX43VDJO5F3KT5X/action/storage_attestation","attest_author":"https://pith.science/pith/SFEJ2LFTYHCHX43VDJO5F3KT5X/action/author_attestation","sign_citation":"https://pith.science/pith/SFEJ2LFTYHCHX43VDJO5F3KT5X/action/citation_signature","submit_replication":"https://pith.science/pith/SFEJ2LFTYHCHX43VDJO5F3KT5X/action/replication_record"}},"created_at":"2026-05-18T00:19:47.504003+00:00","updated_at":"2026-05-18T00:19:47.504003+00:00"}