{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SK5KWSAFEQUQBQ2WQEV423F3YE","short_pith_number":"pith:SK5KWSAF","canonical_record":{"source":{"id":"1609.03278","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-12T06:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"58ba216637ef2ff012fa87c022dbf55cc5f90dc60cf2375eb32d2e3730a69a0e","abstract_canon_sha256":"cb4972f94e4b9ca2062955bcce0455b085ac310ed790455f2b0231cd6eeee51b"},"schema_version":"1.0"},"canonical_sha256":"92baab4805242900c356812bcd6cbbc11bee74a9b62172a7f56a420c4653790e","source":{"kind":"arxiv","id":"1609.03278","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03278","created_at":"2026-05-18T00:01:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03278v6","created_at":"2026-05-18T00:01:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03278","created_at":"2026-05-18T00:01:19Z"},{"alias_kind":"pith_short_12","alias_value":"SK5KWSAFEQUQ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SK5KWSAFEQUQBQ2W","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SK5KWSAF","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SK5KWSAFEQUQBQ2WQEV423F3YE","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03278","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-12T06:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"58ba216637ef2ff012fa87c022dbf55cc5f90dc60cf2375eb32d2e3730a69a0e","abstract_canon_sha256":"cb4972f94e4b9ca2062955bcce0455b085ac310ed790455f2b0231cd6eeee51b"},"schema_version":"1.0"},"canonical_sha256":"92baab4805242900c356812bcd6cbbc11bee74a9b62172a7f56a420c4653790e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:19.861681Z","signature_b64":"B5hF31tIR71eJhIyGUKBP9lc5L3nyWTBImbaTDPbmicpF8I8r5gV3PK432Pej8ovICIdQigW3rg4SldS3wW+Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92baab4805242900c356812bcd6cbbc11bee74a9b62172a7f56a420c4653790e","last_reissued_at":"2026-05-18T00:01:19.861167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:19.861167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03278","source_version":6,"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-18T00:01:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZwYS5FDsqqO3SYtNfJVVQRWrbI3D/WuDq3wDRPEFts0ci/aXbHg6wzPihDyY7UOb1nts2I9c2brJ97xodwK0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:33:09.465692Z"},"content_sha256":"2c2d17033d0fd40b3f80e4ff6a9db45dec383db8a2463a6890768674c06e36d7","schema_version":"1.0","event_id":"sha256:2c2d17033d0fd40b3f80e4ff6a9db45dec383db8a2463a6890768674c06e36d7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SK5KWSAFEQUQBQ2WQEV423F3YE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Paraunitary Matrices, Entropy, Algebraic Condition Number and Fourier Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Nir Ailon","submitted_at":"2016-09-12T06:43:03Z","abstract_excerpt":"The Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\\log n)$. From a lower bound perspective, relatively little is known. Ailon shows in 2013 an $\\Omega(n\\log n)$ bound for computing the normalized Fourier Transform assuming only unitary operations on two coordinates are allowed at each step, and no extra memory is allowed. In 2014, Ailon then improved the result to show that, in a $\\kappa$-well conditioned computation, Fouri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03278","kind":"arxiv","version":6},"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-18T00:01:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sRs9e0vGxDWw9OC2OK7sltk3Qztnqd4/7jVRQMBM7l8bBqaSaH6oy5uLHgbC7S8CRpooY9/lwooiBoXhXbElCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T23:33:09.466042Z"},"content_sha256":"1512930612918759476e55431d6a678bd242275bdf4a65f538d04eb246093b8e","schema_version":"1.0","event_id":"sha256:1512930612918759476e55431d6a678bd242275bdf4a65f538d04eb246093b8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SK5KWSAFEQUQBQ2WQEV423F3YE/bundle.json","state_url":"https://pith.science/pith/SK5KWSAFEQUQBQ2WQEV423F3YE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SK5KWSAFEQUQBQ2WQEV423F3YE/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-02T23:33:09Z","links":{"resolver":"https://pith.science/pith/SK5KWSAFEQUQBQ2WQEV423F3YE","bundle":"https://pith.science/pith/SK5KWSAFEQUQBQ2WQEV423F3YE/bundle.json","state":"https://pith.science/pith/SK5KWSAFEQUQBQ2WQEV423F3YE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SK5KWSAFEQUQBQ2WQEV423F3YE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SK5KWSAFEQUQBQ2WQEV423F3YE","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":"cb4972f94e4b9ca2062955bcce0455b085ac310ed790455f2b0231cd6eeee51b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-12T06:43:03Z","title_canon_sha256":"58ba216637ef2ff012fa87c022dbf55cc5f90dc60cf2375eb32d2e3730a69a0e"},"schema_version":"1.0","source":{"id":"1609.03278","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03278","created_at":"2026-05-18T00:01:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03278v6","created_at":"2026-05-18T00:01:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03278","created_at":"2026-05-18T00:01:19Z"},{"alias_kind":"pith_short_12","alias_value":"SK5KWSAFEQUQ","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SK5KWSAFEQUQBQ2W","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SK5KWSAF","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:1512930612918759476e55431d6a678bd242275bdf4a65f538d04eb246093b8e","target":"graph","created_at":"2026-05-18T00:01:19Z","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 Fourier Transform is one of the most important linear transformations used in science and engineering. Cooley and Tukey's Fast Fourier Transform (FFT) from 1964 is a method for computing this transformation in time $O(n\\log n)$. From a lower bound perspective, relatively little is known. Ailon shows in 2013 an $\\Omega(n\\log n)$ bound for computing the normalized Fourier Transform assuming only unitary operations on two coordinates are allowed at each step, and no extra memory is allowed. In 2014, Ailon then improved the result to show that, in a $\\kappa$-well conditioned computation, Fouri","authors_text":"Nir Ailon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-12T06:43:03Z","title":"Paraunitary Matrices, Entropy, Algebraic Condition Number and Fourier Computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03278","kind":"arxiv","version":6},"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:2c2d17033d0fd40b3f80e4ff6a9db45dec383db8a2463a6890768674c06e36d7","target":"record","created_at":"2026-05-18T00:01:19Z","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":"cb4972f94e4b9ca2062955bcce0455b085ac310ed790455f2b0231cd6eeee51b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-09-12T06:43:03Z","title_canon_sha256":"58ba216637ef2ff012fa87c022dbf55cc5f90dc60cf2375eb32d2e3730a69a0e"},"schema_version":"1.0","source":{"id":"1609.03278","kind":"arxiv","version":6}},"canonical_sha256":"92baab4805242900c356812bcd6cbbc11bee74a9b62172a7f56a420c4653790e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92baab4805242900c356812bcd6cbbc11bee74a9b62172a7f56a420c4653790e","first_computed_at":"2026-05-18T00:01:19.861167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:19.861167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B5hF31tIR71eJhIyGUKBP9lc5L3nyWTBImbaTDPbmicpF8I8r5gV3PK432Pej8ovICIdQigW3rg4SldS3wW+Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:19.861681Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03278","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c2d17033d0fd40b3f80e4ff6a9db45dec383db8a2463a6890768674c06e36d7","sha256:1512930612918759476e55431d6a678bd242275bdf4a65f538d04eb246093b8e"],"state_sha256":"a5aef87f0cdc994fba3a7c96a60d48738dd57c55bd02c77553a96dacde27b8fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h7o9SCcQLSUubrDZlWlwrvcr7jCdvkTW+Rw7LZ4/nZ+eEDLt2n82jcm1HAMY5Y4AvKEc07Jwlo3SgCIiQhxsCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T23:33:09.468869Z","bundle_sha256":"2ba228dad674c4fd5cb78cc38a6d9c8f01c61d36bb936e5660920f2a86f4988f"}}