{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:D5PBN3WUR7GQUBMH4FIG53BWQJ","short_pith_number":"pith:D5PBN3WU","schema_version":"1.0","canonical_sha256":"1f5e16eed48fcd0a0587e1506eec3682438f50204c1bfdbeb0c0a64ad021a019","source":{"kind":"arxiv","id":"1305.4745","version":1},"attestation_state":"computed","paper":{"title":"A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nir Ailon","submitted_at":"2013-05-21T07:58:28Z","abstract_excerpt":"Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem. All lower bounds so far have made strong restrictions on the computational model. One of the most well known results, by Morgenstern from 1973, provides an $\\Omega(n \\log n)$ lower bound for the \\emph{unnormalized} FFT when the constants used in the computation are bounded. The proof uses a potential function related to a determinant. The determinant of the unnormalized Fourier transform is $n^{n/2}$, and thus by showing that it can grow"},"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":"1305.4745","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-05-21T07:58:28Z","cross_cats_sorted":[],"title_canon_sha256":"648ec0a992af823fab487f5749c3ef349fa990b2fb042ba56e350c9560477f7b","abstract_canon_sha256":"089355ec4f36605b96cc76ac191399ed9f829ccad0bc5abf36bc83719658a8af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:15.323765Z","signature_b64":"f/lWyopDPp9Y/2VatiPYIvCqH3kaw6L1f12NyRtVc2vKxiY2x+LWkx5N75GNhWnF4ainLybWG9YoNENuHXFoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f5e16eed48fcd0a0587e1506eec3682438f50204c1bfdbeb0c0a64ad021a019","last_reissued_at":"2026-05-18T03:25:15.323241Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:15.323241Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Lower Bound for Fourier Transform Computation in a Linear Model Over 2x2 Unitary Gates Using Matrix Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nir Ailon","submitted_at":"2013-05-21T07:58:28Z","abstract_excerpt":"Obtaining a non-trivial (super-linear) lower bound for computation of the Fourier transform in the linear circuit model has been a long standing open problem. All lower bounds so far have made strong restrictions on the computational model. One of the most well known results, by Morgenstern from 1973, provides an $\\Omega(n \\log n)$ lower bound for the \\emph{unnormalized} FFT when the constants used in the computation are bounded. The proof uses a potential function related to a determinant. The determinant of the unnormalized Fourier transform is $n^{n/2}$, and thus by showing that it can grow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4745","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":"1305.4745","created_at":"2026-05-18T03:25:15.323303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.4745v1","created_at":"2026-05-18T03:25:15.323303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4745","created_at":"2026-05-18T03:25:15.323303+00:00"},{"alias_kind":"pith_short_12","alias_value":"D5PBN3WUR7GQ","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"D5PBN3WUR7GQUBMH","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"D5PBN3WU","created_at":"2026-05-18T12:27:40.988391+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/D5PBN3WUR7GQUBMH4FIG53BWQJ","json":"https://pith.science/pith/D5PBN3WUR7GQUBMH4FIG53BWQJ.json","graph_json":"https://pith.science/api/pith-number/D5PBN3WUR7GQUBMH4FIG53BWQJ/graph.json","events_json":"https://pith.science/api/pith-number/D5PBN3WUR7GQUBMH4FIG53BWQJ/events.json","paper":"https://pith.science/paper/D5PBN3WU"},"agent_actions":{"view_html":"https://pith.science/pith/D5PBN3WUR7GQUBMH4FIG53BWQJ","download_json":"https://pith.science/pith/D5PBN3WUR7GQUBMH4FIG53BWQJ.json","view_paper":"https://pith.science/paper/D5PBN3WU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.4745&json=true","fetch_graph":"https://pith.science/api/pith-number/D5PBN3WUR7GQUBMH4FIG53BWQJ/graph.json","fetch_events":"https://pith.science/api/pith-number/D5PBN3WUR7GQUBMH4FIG53BWQJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D5PBN3WUR7GQUBMH4FIG53BWQJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D5PBN3WUR7GQUBMH4FIG53BWQJ/action/storage_attestation","attest_author":"https://pith.science/pith/D5PBN3WUR7GQUBMH4FIG53BWQJ/action/author_attestation","sign_citation":"https://pith.science/pith/D5PBN3WUR7GQUBMH4FIG53BWQJ/action/citation_signature","submit_replication":"https://pith.science/pith/D5PBN3WUR7GQUBMH4FIG53BWQJ/action/replication_record"}},"created_at":"2026-05-18T03:25:15.323303+00:00","updated_at":"2026-05-18T03:25:15.323303+00:00"}