{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Z2KNTLXRKTDECLKXRS26BR3YGY","short_pith_number":"pith:Z2KNTLXR","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"},"canonical_sha256":"ce94d9aef154c6412d578cb5e0c77836208249417143d72217f95b72710bb2b2","source":{"kind":"arxiv","id":"1403.1307","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1307","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1307v5","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1307","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"Z2KNTLXRKTDE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z2KNTLXRKTDECLKX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z2KNTLXR","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Z2KNTLXRKTDECLKXRS26BR3YGY","target":"record","payload":{"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"},"canonical_sha256":"ce94d9aef154c6412d578cb5e0c77836208249417143d72217f95b72710bb2b2","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"},"source_kind":"arxiv","source_id":"1403.1307","source_version":5,"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-18T02:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p8fT3AGTBwPWTulWQl1iYHYFn+KhKnqOa/X9wFnnYx6qb+VYyd1cgYhQqhtjzPM/Jc6U2lh8W/R3mLB4X7ZVCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:19:00.919220Z"},"content_sha256":"fd03b324874b3ac4d36c80b7b9a39cbbcb1e400214dcdbc631017e48f132e313","schema_version":"1.0","event_id":"sha256:fd03b324874b3ac4d36c80b7b9a39cbbcb1e400214dcdbc631017e48f132e313"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Z2KNTLXRKTDECLKXRS26BR3YGY","target":"graph","payload":{"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"},"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-18T02:46:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ULL7C/mdz9Cj3jY0JpgNCMaZCIdNgseDgsvkwj4q4qH3eS/aMHqAk9MtzQeqgAK6WhZ+H9lctc706pRvU+3PCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:19:00.919578Z"},"content_sha256":"85c605cb6f8ae31c39be584d8b889b3b034e60f1ee839eb408102331c2618017","schema_version":"1.0","event_id":"sha256:85c605cb6f8ae31c39be584d8b889b3b034e60f1ee839eb408102331c2618017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/bundle.json","state_url":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/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-02T15:19:00Z","links":{"resolver":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY","bundle":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/bundle.json","state":"https://pith.science/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2KNTLXRKTDECLKXRS26BR3YGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Z2KNTLXRKTDECLKXRS26BR3YGY","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":"045154b81a1047fde85ffd4a65f892e6b87386dd769f185f41fbde7e7706ca2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-06T01:02:54Z","title_canon_sha256":"5647d8b59098683119ed889e0c9c88864c2bf451c6d2d11653763829352363e8"},"schema_version":"1.0","source":{"id":"1403.1307","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1307","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1307v5","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1307","created_at":"2026-05-18T02:46:39Z"},{"alias_kind":"pith_short_12","alias_value":"Z2KNTLXRKTDE","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"Z2KNTLXRKTDECLKX","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"Z2KNTLXR","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:85c605cb6f8ae31c39be584d8b889b3b034e60f1ee839eb408102331c2618017","target":"graph","created_at":"2026-05-18T02:46:39Z","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":"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","authors_text":"Nir Ailon","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-06T01:02:54Z","title":"An n\\log n Lower Bound for Fourier Transform Computation in the Well Conditioned Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1307","kind":"arxiv","version":5},"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:fd03b324874b3ac4d36c80b7b9a39cbbcb1e400214dcdbc631017e48f132e313","target":"record","created_at":"2026-05-18T02:46:39Z","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":"045154b81a1047fde85ffd4a65f892e6b87386dd769f185f41fbde7e7706ca2c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-03-06T01:02:54Z","title_canon_sha256":"5647d8b59098683119ed889e0c9c88864c2bf451c6d2d11653763829352363e8"},"schema_version":"1.0","source":{"id":"1403.1307","kind":"arxiv","version":5}},"canonical_sha256":"ce94d9aef154c6412d578cb5e0c77836208249417143d72217f95b72710bb2b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce94d9aef154c6412d578cb5e0c77836208249417143d72217f95b72710bb2b2","first_computed_at":"2026-05-18T02:46:39.167376Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:39.167376Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IyqbXie6wXRjiKZKlyxdQjjD78spaWxPAGCNGl0+CUS8sfNxWixbohu0yTG3k2+rhR/YB4ROxCCgNgJb3a/nBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:39.168002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.1307","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd03b324874b3ac4d36c80b7b9a39cbbcb1e400214dcdbc631017e48f132e313","sha256:85c605cb6f8ae31c39be584d8b889b3b034e60f1ee839eb408102331c2618017"],"state_sha256":"a1ee44458e3c22ab914c4e7e9e17e09d10dd563a05231c2d2a72d60c104c3885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiLyGjqTqgqtAHjB9WCZnFF3A4l16Nhfw/eRwdO0jJfIKUfABOtop08VAiC4If1oNTrC5Fnueuf29X1j5EXNCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:19:00.921538Z","bundle_sha256":"7432be931cb1a4adc997868c95253eb1aaa2a6ae5a9dcf53e10e8e9071dd3633"}}