{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JF7EOJLOXPRPLNUVQVCMY7MKXU","short_pith_number":"pith:JF7EOJLO","schema_version":"1.0","canonical_sha256":"497e47256ebbe2f5b6958544cc7d8abd13dd8a601a091b529a967d31b87e20bd","source":{"kind":"arxiv","id":"1604.02557","version":4},"attestation_state":"computed","paper":{"title":"The Complexity of Computing (Almost) Unitary Matrices With $\\eps$-Copies of the Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gal Yehuda, Nir Ailon","submitted_at":"2016-04-09T12:35:47Z","abstract_excerpt":"The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies numerical ill-condition. The papers also quantify this tradeoff. The main method for proving these results is via a potential function called quasi-entropy, reminiscent of Shannon entropy. The quasi-entropy method opens new doors to understanding the computational complexity of the important Fourier transformation. However, it suffers from various obvious limitati"},"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":"1604.02557","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-09T12:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"e7c4e72551517614801a15b3243ccaaf35faac6030caa0419614dcf2761292a3","abstract_canon_sha256":"b4bb710a4846726f5911a821ea19d1bbac479a0768f34c097611f91432beea33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:23.057542Z","signature_b64":"ew6wnmQZLvZ3n26wwtUwsVjdO1Y8Z/HwCzCTImGluz2e9y6z6df3euzqmxNLpPdUY/VV8Zubb2CVMBp0LNRLDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"497e47256ebbe2f5b6958544cc7d8abd13dd8a601a091b529a967d31b87e20bd","last_reissued_at":"2026-05-17T23:48:23.057100Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:23.057100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Computing (Almost) Unitary Matrices With $\\eps$-Copies of the Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gal Yehuda, Nir Ailon","submitted_at":"2016-04-09T12:35:47Z","abstract_excerpt":"The complexity of computing the Fourier transform is a longstanding open problem. Very recently, Ailon (2013, 2014, 2015) showed in a collection of papers that, roughly speaking, a speedup of the Fourier transform computation implies numerical ill-condition. The papers also quantify this tradeoff. The main method for proving these results is via a potential function called quasi-entropy, reminiscent of Shannon entropy. The quasi-entropy method opens new doors to understanding the computational complexity of the important Fourier transformation. However, it suffers from various obvious limitati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02557","kind":"arxiv","version":4},"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":"1604.02557","created_at":"2026-05-17T23:48:23.057172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02557v4","created_at":"2026-05-17T23:48:23.057172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02557","created_at":"2026-05-17T23:48:23.057172+00:00"},{"alias_kind":"pith_short_12","alias_value":"JF7EOJLOXPRP","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JF7EOJLOXPRPLNUV","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JF7EOJLO","created_at":"2026-05-18T12:30:25.849896+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/JF7EOJLOXPRPLNUVQVCMY7MKXU","json":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU.json","graph_json":"https://pith.science/api/pith-number/JF7EOJLOXPRPLNUVQVCMY7MKXU/graph.json","events_json":"https://pith.science/api/pith-number/JF7EOJLOXPRPLNUVQVCMY7MKXU/events.json","paper":"https://pith.science/paper/JF7EOJLO"},"agent_actions":{"view_html":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU","download_json":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU.json","view_paper":"https://pith.science/paper/JF7EOJLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02557&json=true","fetch_graph":"https://pith.science/api/pith-number/JF7EOJLOXPRPLNUVQVCMY7MKXU/graph.json","fetch_events":"https://pith.science/api/pith-number/JF7EOJLOXPRPLNUVQVCMY7MKXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/action/storage_attestation","attest_author":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/action/author_attestation","sign_citation":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/action/citation_signature","submit_replication":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/action/replication_record"}},"created_at":"2026-05-17T23:48:23.057172+00:00","updated_at":"2026-05-17T23:48:23.057172+00:00"}