{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GGVKS7SODXKS3M3VD4UEXR6KDS","short_pith_number":"pith:GGVKS7SO","canonical_record":{"source":{"id":"1201.2501","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T08:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"2acf227359473794b5ce6087dbda3a40cf5d16d2850c03c7a12a406c856e65ae","abstract_canon_sha256":"efbdde7d49f064b7852c382f9f770b57a7bcc4cd453c6f4120f326a096178543"},"schema_version":"1.0"},"canonical_sha256":"31aaa97e4e1dd52db3751f284bc7ca1cbf80d2d5876a723bb877589bf8a2ba19","source":{"kind":"arxiv","id":"1201.2501","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2501","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2501v2","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2501","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"GGVKS7SODXKS","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GGVKS7SODXKS3M3V","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GGVKS7SO","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GGVKS7SODXKS3M3VD4UEXR6KDS","target":"record","payload":{"canonical_record":{"source":{"id":"1201.2501","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T08:34:46Z","cross_cats_sorted":[],"title_canon_sha256":"2acf227359473794b5ce6087dbda3a40cf5d16d2850c03c7a12a406c856e65ae","abstract_canon_sha256":"efbdde7d49f064b7852c382f9f770b57a7bcc4cd453c6f4120f326a096178543"},"schema_version":"1.0"},"canonical_sha256":"31aaa97e4e1dd52db3751f284bc7ca1cbf80d2d5876a723bb877589bf8a2ba19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:26.100200Z","signature_b64":"VzEWtQjlzhoPIz6zfD+TPqXeAs1Qv16NAMxOQNVwmEqLP5E69ABHBGZXyU2Afa4O7RDWxw2sgMc5adVBMZhPAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31aaa97e4e1dd52db3751f284bc7ca1cbf80d2d5876a723bb877589bf8a2ba19","last_reissued_at":"2026-05-18T03:58:26.099533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:26.099533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.2501","source_version":2,"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-18T03:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUrRQaCM9sEuStJn6iFOg+if11VoFvlv+lKcbw36ov7UzUMM6DX8tVCBl+VTz29LdNcAkhHJsQj1JledaTfRAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:58:02.909989Z"},"content_sha256":"74db8277b3bde050e6a3ab48a01adc935c103370a5f2c32a4afe9e9205cde06b","schema_version":"1.0","event_id":"sha256:74db8277b3bde050e6a3ab48a01adc935c103370a5f2c32a4afe9e9205cde06b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GGVKS7SODXKS3M3VD4UEXR6KDS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nearly Optimal Sparse Fourier Transform","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dina Katabi, Eric Price, Haitham Hassanieh, Piotr Indyk","submitted_at":"2012-01-12T08:34:46Z","abstract_excerpt":"We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. We show:\n  * An O(k log n)-time randomized algorithm for the case where the input signal has at most k non-zero Fourier coefficients, and\n  * An O(k log n log(n/k))-time randomized algorithm for general input signals.\n  Both algorithms achieve o(n log n) time, and thus improve over the Fast Fourier Transform, for any k = o(n). They are the first known algorithms that satisfy this property. Also, if one assumes that the Fast Fourier Transform is optimal, the algorithm fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2501","kind":"arxiv","version":2},"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-18T03:58:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQAgijI62hi/3eaeZQ6cdzwE+fMLBRZ8wU+ONRC1u2PQowxEVm1pe8KboSKjAjWawsdXKCK0JdiIelormHP2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T20:58:02.910370Z"},"content_sha256":"27a933b6eba1804a4a935d3a60c6f5270d9d88d852ab44d4265b727a0813fcca","schema_version":"1.0","event_id":"sha256:27a933b6eba1804a4a935d3a60c6f5270d9d88d852ab44d4265b727a0813fcca"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGVKS7SODXKS3M3VD4UEXR6KDS/bundle.json","state_url":"https://pith.science/pith/GGVKS7SODXKS3M3VD4UEXR6KDS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGVKS7SODXKS3M3VD4UEXR6KDS/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-02T20:58:02Z","links":{"resolver":"https://pith.science/pith/GGVKS7SODXKS3M3VD4UEXR6KDS","bundle":"https://pith.science/pith/GGVKS7SODXKS3M3VD4UEXR6KDS/bundle.json","state":"https://pith.science/pith/GGVKS7SODXKS3M3VD4UEXR6KDS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGVKS7SODXKS3M3VD4UEXR6KDS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GGVKS7SODXKS3M3VD4UEXR6KDS","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":"efbdde7d49f064b7852c382f9f770b57a7bcc4cd453c6f4120f326a096178543","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T08:34:46Z","title_canon_sha256":"2acf227359473794b5ce6087dbda3a40cf5d16d2850c03c7a12a406c856e65ae"},"schema_version":"1.0","source":{"id":"1201.2501","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.2501","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"1201.2501v2","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.2501","created_at":"2026-05-18T03:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"GGVKS7SODXKS","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GGVKS7SODXKS3M3V","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GGVKS7SO","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:27a933b6eba1804a4a935d3a60c6f5270d9d88d852ab44d4265b727a0813fcca","target":"graph","created_at":"2026-05-18T03:58:26Z","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":"We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. We show:\n  * An O(k log n)-time randomized algorithm for the case where the input signal has at most k non-zero Fourier coefficients, and\n  * An O(k log n log(n/k))-time randomized algorithm for general input signals.\n  Both algorithms achieve o(n log n) time, and thus improve over the Fast Fourier Transform, for any k = o(n). They are the first known algorithms that satisfy this property. Also, if one assumes that the Fast Fourier Transform is optimal, the algorithm fo","authors_text":"Dina Katabi, Eric Price, Haitham Hassanieh, Piotr Indyk","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T08:34:46Z","title":"Nearly Optimal Sparse Fourier Transform"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.2501","kind":"arxiv","version":2},"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:74db8277b3bde050e6a3ab48a01adc935c103370a5f2c32a4afe9e9205cde06b","target":"record","created_at":"2026-05-18T03:58:26Z","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":"efbdde7d49f064b7852c382f9f770b57a7bcc4cd453c6f4120f326a096178543","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2012-01-12T08:34:46Z","title_canon_sha256":"2acf227359473794b5ce6087dbda3a40cf5d16d2850c03c7a12a406c856e65ae"},"schema_version":"1.0","source":{"id":"1201.2501","kind":"arxiv","version":2}},"canonical_sha256":"31aaa97e4e1dd52db3751f284bc7ca1cbf80d2d5876a723bb877589bf8a2ba19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"31aaa97e4e1dd52db3751f284bc7ca1cbf80d2d5876a723bb877589bf8a2ba19","first_computed_at":"2026-05-18T03:58:26.099533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:26.099533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VzEWtQjlzhoPIz6zfD+TPqXeAs1Qv16NAMxOQNVwmEqLP5E69ABHBGZXyU2Afa4O7RDWxw2sgMc5adVBMZhPAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:26.100200Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.2501","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74db8277b3bde050e6a3ab48a01adc935c103370a5f2c32a4afe9e9205cde06b","sha256:27a933b6eba1804a4a935d3a60c6f5270d9d88d852ab44d4265b727a0813fcca"],"state_sha256":"bdd96b2a698ebddc099c159388e845739c68b6271a29b9c70fefe48c4502534a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HCCouAhTLpRhYRAUNOevPFvre+NNpMivoM3T5p2Gu5HB1bNbtI7Iy8lC37kOA+wxkFqUVBL3p1AT01sZ9gq1CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T20:58:02.912542Z","bundle_sha256":"fc1042f3c841be216e82ebbbd3f46dcd30bbff3059120ceb6200c0c6a869386d"}}