{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Z2KNTLXRKTDECLKXRS26BR3YGY","short_pith_number":"pith:Z2KNTLXR","schema_version":"1.0","canonical_sha256":"ce94d9aef154c6412d578cb5e0c77836208249417143d72217f95b72710bb2b2","source":{"kind":"arxiv","id":"1403.1307","version":5},"attestation_state":"computed","paper":{"title":"An n\\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nir Ailon","submitted_at":"2014-03-06T01:02:54Z","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 for over 40 years.\n  An early result by Morgenstern from 1973, provides an $\\Omega(n \\log n)$ lower bound for the unnormalized Fourier transform when the constants used in the computation are bounded. The proof uses a potential function related to a determinant. The result does not explain why the normalized Fourier transform (of unit determinant) should be difficult to compute in the same model. Hence, the result is not scale insensitive"},"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":"1403.1307","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-06T01:02:54Z","cross_cats_sorted":[],"title_canon_sha256":"5647d8b59098683119ed889e0c9c88864c2bf451c6d2d11653763829352363e8","abstract_canon_sha256":"045154b81a1047fde85ffd4a65f892e6b87386dd769f185f41fbde7e7706ca2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:39.168002Z","signature_b64":"IyqbXie6wXRjiKZKlyxdQjjD78spaWxPAGCNGl0+CUS8sfNxWixbohu0yTG3k2+rhR/YB4ROxCCgNgJb3a/nBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce94d9aef154c6412d578cb5e0c77836208249417143d72217f95b72710bb2b2","last_reissued_at":"2026-05-18T02:46:39.167376Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:39.167376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An n\\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nir Ailon","submitted_at":"2014-03-06T01:02:54Z","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 for over 40 years.\n  An early result by Morgenstern from 1973, provides an $\\Omega(n \\log n)$ lower bound for the unnormalized Fourier transform when the constants used in the computation are bounded. The proof uses a potential function related to a determinant. The result does not explain why the normalized Fourier transform (of unit determinant) should be difficult to compute in the same model. Hence, the result is not scale insensitive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1307","kind":"arxiv","version":5},"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":"1403.1307","created_at":"2026-05-18T02:46:39.167464+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1307v5","created_at":"2026-05-18T02:46:39.167464+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1307","created_at":"2026-05-18T02:46:39.167464+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2KNTLXRKTDE","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2KNTLXRKTDECLKX","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2KNTLXR","created_at":"2026-05-18T12:28:59.999130+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/Z2KNTLXRKTDECLKXRS26BR3YGY","json":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY.json","graph_json":"https://pith.science/api/pith-number/Z2KNTLXRKTDECLKXRS26BR3YGY/graph.json","events_json":"https://pith.science/api/pith-number/Z2KNTLXRKTDECLKXRS26BR3YGY/events.json","paper":"https://pith.science/paper/Z2KNTLXR"},"agent_actions":{"view_html":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY","download_json":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY.json","view_paper":"https://pith.science/paper/Z2KNTLXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1307&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2KNTLXRKTDECLKXRS26BR3YGY/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2KNTLXRKTDECLKXRS26BR3YGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/action/storage_attestation","attest_author":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/action/author_attestation","sign_citation":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/action/citation_signature","submit_replication":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/action/replication_record"}},"created_at":"2026-05-18T02:46:39.167464+00:00","updated_at":"2026-05-18T02:46:39.167464+00:00"}