{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:NS7Z6RI5QZVKDJRPUUIDCAQIKG","short_pith_number":"pith:NS7Z6RI5","schema_version":"1.0","canonical_sha256":"6cbf9f451d866aa1a62fa51031020851b553ef3e94a68149451eb2625cf04a9b","source":{"kind":"arxiv","id":"1403.5804","version":2},"attestation_state":"computed","paper":{"title":"Sample-Optimal Fourier Sampling in Any Constant Dimension -- Part I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov, Piotr Indyk","submitted_at":"2014-03-23T21:39:20Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1403.5804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-23T21:39:20Z","cross_cats_sorted":[],"title_canon_sha256":"cea33b579b4efb523e1b9d06e3ef5aac36029f1b6d8092c3d5bbff0b10121b47","abstract_canon_sha256":"9017c672c71d2b0515e2ef781ebef33c714ef32d5c0edab1b44f8d014eb35658"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:58.408048Z","signature_b64":"qH1PoQOs/+iIHgTKSi1KqgpVbhHRR6sMwX/rAPo3Uroiav1PvK1EDd+RpAXr8s9vKYJkYxHy/CdpmTFj6qDcDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cbf9f451d866aa1a62fa51031020851b553ef3e94a68149451eb2625cf04a9b","last_reissued_at":"2026-05-18T02:51:58.407691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:58.407691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample-Optimal Fourier Sampling in Any Constant Dimension -- Part I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov, Piotr Indyk","submitted_at":"2014-03-23T21:39:20Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5804","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.5804","created_at":"2026-05-18T02:51:58.407746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5804v2","created_at":"2026-05-18T02:51:58.407746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5804","created_at":"2026-05-18T02:51:58.407746+00:00"},{"alias_kind":"pith_short_12","alias_value":"NS7Z6RI5QZVK","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"NS7Z6RI5QZVKDJRP","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"NS7Z6RI5","created_at":"2026-05-18T12:28:41.024544+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NS7Z6RI5QZVKDJRPUUIDCAQIKG","json":"https://pith.science/pith/NS7Z6RI5QZVKDJRPUUIDCAQIKG.json","graph_json":"https://pith.science/api/pith-number/NS7Z6RI5QZVKDJRPUUIDCAQIKG/graph.json","events_json":"https://pith.science/api/pith-number/NS7Z6RI5QZVKDJRPUUIDCAQIKG/events.json","paper":"https://pith.science/paper/NS7Z6RI5"},"agent_actions":{"view_html":"https://pith.science/pith/NS7Z6RI5QZVKDJRPUUIDCAQIKG","download_json":"https://pith.science/pith/NS7Z6RI5QZVKDJRPUUIDCAQIKG.json","view_paper":"https://pith.science/paper/NS7Z6RI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5804&json=true","fetch_graph":"https://pith.science/api/pith-number/NS7Z6RI5QZVKDJRPUUIDCAQIKG/graph.json","fetch_events":"https://pith.science/api/pith-number/NS7Z6RI5QZVKDJRPUUIDCAQIKG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NS7Z6RI5QZVKDJRPUUIDCAQIKG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NS7Z6RI5QZVKDJRPUUIDCAQIKG/action/storage_attestation","attest_author":"https://pith.science/pith/NS7Z6RI5QZVKDJRPUUIDCAQIKG/action/author_attestation","sign_citation":"https://pith.science/pith/NS7Z6RI5QZVKDJRPUUIDCAQIKG/action/citation_signature","submit_replication":"https://pith.science/pith/NS7Z6RI5QZVKDJRPUUIDCAQIKG/action/replication_record"}},"created_at":"2026-05-18T02:51:58.407746+00:00","updated_at":"2026-05-18T02:51:58.407746+00:00"}