{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NS7Z6RI5QZVKDJRPUUIDCAQIKG","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":"9017c672c71d2b0515e2ef781ebef33c714ef32d5c0edab1b44f8d014eb35658","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-23T21:39:20Z","title_canon_sha256":"cea33b579b4efb523e1b9d06e3ef5aac36029f1b6d8092c3d5bbff0b10121b47"},"schema_version":"1.0","source":{"id":"1403.5804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5804","created_at":"2026-05-18T02:51:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5804v2","created_at":"2026-05-18T02:51:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5804","created_at":"2026-05-18T02:51:58Z"},{"alias_kind":"pith_short_12","alias_value":"NS7Z6RI5QZVK","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NS7Z6RI5QZVKDJRP","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NS7Z6RI5","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:2cc8250d9ce4c28dbabcdd27d8235705f9f27a45e2dc8baa5d92cf83700e1609","target":"graph","created_at":"2026-05-18T02:51:58Z","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 give an algorithm for $\\ell_2/\\ell_2$ sparse recovery from Fourier measurements using $O(k\\log N)$ samples, matching the lower bound of \\cite{DIPW} for non-adaptive algorithms up to constant factors for any $k\\leq N^{1-\\delta}$. The algorithm runs in $\\tilde O(N)$ time. Our algorithm extends to higher dimensions, leading to sample complexity of $O_d(k\\log N)$, which is optimal up to constant factors for any $d=O(1)$. These are the first sample optimal algorithms for these problems.\n  A preliminary experimental evaluation indicates that our algorithm has empirical sampling complexity compara","authors_text":"Michael Kapralov, Piotr Indyk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-23T21:39:20Z","title":"Sample-Optimal Fourier Sampling in Any Constant Dimension -- Part I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5804","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:cc517d26583b4b68b268bbe2b8e1b3fd636bae840a1c370f59ffd5171b6f5170","target":"record","created_at":"2026-05-18T02:51:58Z","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":"9017c672c71d2b0515e2ef781ebef33c714ef32d5c0edab1b44f8d014eb35658","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-23T21:39:20Z","title_canon_sha256":"cea33b579b4efb523e1b9d06e3ef5aac36029f1b6d8092c3d5bbff0b10121b47"},"schema_version":"1.0","source":{"id":"1403.5804","kind":"arxiv","version":2}},"canonical_sha256":"6cbf9f451d866aa1a62fa51031020851b553ef3e94a68149451eb2625cf04a9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cbf9f451d866aa1a62fa51031020851b553ef3e94a68149451eb2625cf04a9b","first_computed_at":"2026-05-18T02:51:58.407691Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:58.407691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qH1PoQOs/+iIHgTKSi1KqgpVbhHRR6sMwX/rAPo3Uroiav1PvK1EDd+RpAXr8s9vKYJkYxHy/CdpmTFj6qDcDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:58.408048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc517d26583b4b68b268bbe2b8e1b3fd636bae840a1c370f59ffd5171b6f5170","sha256:2cc8250d9ce4c28dbabcdd27d8235705f9f27a45e2dc8baa5d92cf83700e1609"],"state_sha256":"e169864decd1fbd4858f8f1448482c995fb58e77520d04aefd891aa91e428a50"}