{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VKSBVYVXPUICDTKSSVYS4GMOER","short_pith_number":"pith:VKSBVYVX","schema_version":"1.0","canonical_sha256":"aaa41ae2b77d1021cd5295712e198e2453a9385d87210eaa7b9d44eedca3ef77","source":{"kind":"arxiv","id":"1901.02536","version":1},"attestation_state":"computed","paper":{"title":"Fast generalized DFTs for all finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"cs.DS","authors_text":"Chris Umans","submitted_at":"2019-01-08T22:02:50Z","abstract_excerpt":"For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{\\omega/2 + \\epsilon})$ operations, for any $\\epsilon > 0$. Here, $\\omega$ is the exponent of matrix multiplication."},"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":"1901.02536","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-01-08T22:02:50Z","cross_cats_sorted":["math.GR"],"title_canon_sha256":"b359ace788d9302d1b3150ef54ed6b9ef5eefa115600a8b756ee4b5abf1d7bd6","abstract_canon_sha256":"e292f3d6bea110f85c1579d19c541379d730ef2a7ef4cd26df0e080849714126"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:40.260242Z","signature_b64":"4RdK7GcDkjnIwrpU7/0QcS/0jSmBNZpYqHupUD8P1ebliCWqoxqik/e+P8PxDv0/0oRVf3V0K+D31vo9+zk4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaa41ae2b77d1021cd5295712e198e2453a9385d87210eaa7b9d44eedca3ef77","last_reissued_at":"2026-05-17T23:56:40.259525Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:40.259525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast generalized DFTs for all finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"cs.DS","authors_text":"Chris Umans","submitted_at":"2019-01-08T22:02:50Z","abstract_excerpt":"For any finite group $G$, we give an arithmetic algorithm to compute generalized Discrete Fourier Transforms (DFTs) with respect to $G$, using $O(|G|^{\\omega/2 + \\epsilon})$ operations, for any $\\epsilon > 0$. Here, $\\omega$ is the exponent of matrix multiplication."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02536","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":"1901.02536","created_at":"2026-05-17T23:56:40.259633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02536v1","created_at":"2026-05-17T23:56:40.259633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02536","created_at":"2026-05-17T23:56:40.259633+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKSBVYVXPUIC","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKSBVYVXPUICDTKS","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKSBVYVX","created_at":"2026-05-18T12:33:30.264802+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/VKSBVYVXPUICDTKSSVYS4GMOER","json":"https://pith.science/pith/VKSBVYVXPUICDTKSSVYS4GMOER.json","graph_json":"https://pith.science/api/pith-number/VKSBVYVXPUICDTKSSVYS4GMOER/graph.json","events_json":"https://pith.science/api/pith-number/VKSBVYVXPUICDTKSSVYS4GMOER/events.json","paper":"https://pith.science/paper/VKSBVYVX"},"agent_actions":{"view_html":"https://pith.science/pith/VKSBVYVXPUICDTKSSVYS4GMOER","download_json":"https://pith.science/pith/VKSBVYVXPUICDTKSSVYS4GMOER.json","view_paper":"https://pith.science/paper/VKSBVYVX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02536&json=true","fetch_graph":"https://pith.science/api/pith-number/VKSBVYVXPUICDTKSSVYS4GMOER/graph.json","fetch_events":"https://pith.science/api/pith-number/VKSBVYVXPUICDTKSSVYS4GMOER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKSBVYVXPUICDTKSSVYS4GMOER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKSBVYVXPUICDTKSSVYS4GMOER/action/storage_attestation","attest_author":"https://pith.science/pith/VKSBVYVXPUICDTKSSVYS4GMOER/action/author_attestation","sign_citation":"https://pith.science/pith/VKSBVYVXPUICDTKSSVYS4GMOER/action/citation_signature","submit_replication":"https://pith.science/pith/VKSBVYVXPUICDTKSSVYS4GMOER/action/replication_record"}},"created_at":"2026-05-17T23:56:40.259633+00:00","updated_at":"2026-05-17T23:56:40.259633+00:00"}