{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JF7EOJLOXPRPLNUVQVCMY7MKXU","short_pith_number":"pith:JF7EOJLO","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"},"canonical_sha256":"497e47256ebbe2f5b6958544cc7d8abd13dd8a601a091b529a967d31b87e20bd","source":{"kind":"arxiv","id":"1604.02557","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02557","created_at":"2026-05-17T23:48:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02557v4","created_at":"2026-05-17T23:48:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02557","created_at":"2026-05-17T23:48:23Z"},{"alias_kind":"pith_short_12","alias_value":"JF7EOJLOXPRP","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JF7EOJLOXPRPLNUV","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JF7EOJLO","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JF7EOJLOXPRPLNUVQVCMY7MKXU","target":"record","payload":{"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"},"canonical_sha256":"497e47256ebbe2f5b6958544cc7d8abd13dd8a601a091b529a967d31b87e20bd","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"},"source_kind":"arxiv","source_id":"1604.02557","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VbgLWXBkERlCAP46l5I8YJV472YXxigKawKfegOIXZrT+86S7ec41L7KZ+OmxkvZurmR+eu2jrDv3q/KMEdZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:40:00.558591Z"},"content_sha256":"638ffdae6d514d3b38483cd2cfb0238716290d271115edf17241b9044383fdad","schema_version":"1.0","event_id":"sha256:638ffdae6d514d3b38483cd2cfb0238716290d271115edf17241b9044383fdad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JF7EOJLOXPRPLNUVQVCMY7MKXU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:48:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JWtzdNL9t1uuhUMLtzya8VwLlqN+zbRVOjiSURqFN+R4s8n+maSB2H8GMVxKQIRmHFaPGhKfSrrqqZCho9BGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T18:40:00.558934Z"},"content_sha256":"32736fc3c93fee86ab8e14c7412c677ae922053f719f164b7670503964b27455","schema_version":"1.0","event_id":"sha256:32736fc3c93fee86ab8e14c7412c677ae922053f719f164b7670503964b27455"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/bundle.json","state_url":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T18:40:00Z","links":{"resolver":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU","bundle":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/bundle.json","state":"https://pith.science/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JF7EOJLOXPRPLNUVQVCMY7MKXU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JF7EOJLOXPRPLNUVQVCMY7MKXU","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b4bb710a4846726f5911a821ea19d1bbac479a0768f34c097611f91432beea33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-09T12:35:47Z","title_canon_sha256":"e7c4e72551517614801a15b3243ccaaf35faac6030caa0419614dcf2761292a3"},"schema_version":"1.0","source":{"id":"1604.02557","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02557","created_at":"2026-05-17T23:48:23Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02557v4","created_at":"2026-05-17T23:48:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02557","created_at":"2026-05-17T23:48:23Z"},{"alias_kind":"pith_short_12","alias_value":"JF7EOJLOXPRP","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JF7EOJLOXPRPLNUV","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JF7EOJLO","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:32736fc3c93fee86ab8e14c7412c677ae922053f719f164b7670503964b27455","target":"graph","created_at":"2026-05-17T23:48:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gal Yehuda, Nir Ailon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-09T12:35:47Z","title":"The Complexity of Computing (Almost) Unitary Matrices With $\\eps$-Copies of the Fourier Transform"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02557","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:638ffdae6d514d3b38483cd2cfb0238716290d271115edf17241b9044383fdad","target":"record","created_at":"2026-05-17T23:48:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b4bb710a4846726f5911a821ea19d1bbac479a0768f34c097611f91432beea33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-04-09T12:35:47Z","title_canon_sha256":"e7c4e72551517614801a15b3243ccaaf35faac6030caa0419614dcf2761292a3"},"schema_version":"1.0","source":{"id":"1604.02557","kind":"arxiv","version":4}},"canonical_sha256":"497e47256ebbe2f5b6958544cc7d8abd13dd8a601a091b529a967d31b87e20bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"497e47256ebbe2f5b6958544cc7d8abd13dd8a601a091b529a967d31b87e20bd","first_computed_at":"2026-05-17T23:48:23.057100Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:23.057100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ew6wnmQZLvZ3n26wwtUwsVjdO1Y8Z/HwCzCTImGluz2e9y6z6df3euzqmxNLpPdUY/VV8Zubb2CVMBp0LNRLDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:23.057542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02557","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:638ffdae6d514d3b38483cd2cfb0238716290d271115edf17241b9044383fdad","sha256:32736fc3c93fee86ab8e14c7412c677ae922053f719f164b7670503964b27455"],"state_sha256":"3606a29ed629ffc699ae16c8446b16cdd8ae12bdd09397592d3df8a2c364a1d1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xOt0ZdyqmBU7J/wfYie3utIreInmsI6S8Yj5FM+MdE98bzqai9oR8Fk7kzL3o3r3OlCC8vjPlV92IXcpxhTkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T18:40:00.560932Z","bundle_sha256":"6918f959da6ad483ea507ce37606f948bd50c973481999707d7f6fda55e02682"}}