{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DVL5GFPMHACBNHHHWFKHL5JPJL","short_pith_number":"pith:DVL5GFPM","schema_version":"1.0","canonical_sha256":"1d57d315ec3804169ce7b15475f52f4afd54b3e8b417b6275a3095dd06344af7","source":{"kind":"arxiv","id":"1604.00845","version":1},"attestation_state":"computed","paper":{"title":"Sparse Fourier Transform in Any Constant Dimension with Nearly-Optimal Sample Complexity in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov","submitted_at":"2016-04-04T13:19:57Z","abstract_excerpt":"We consider the problem of computing a $k$-sparse approximation to the Fourier transform of a length $N$ signal. Our main result is a randomized algorithm for computing such an approximation (i.e. achieving the $\\ell_2/\\ell_2$ sparse recovery guarantees using Fourier measurements) using $O_d(k\\log N\\log\\log N)$ samples of the signal in time domain that runs in time $O_d(k\\log^{d+3} N)$, where $d\\geq 1$ is the dimensionality of the Fourier transform. The sample complexity matches the lower bound of $\\Omega(k\\log (N/k))$ for non-adaptive algorithms due to \\cite{DIPW} for any $k\\leq N^{1-\\delta}$"},"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":"1604.00845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-04T13:19:57Z","cross_cats_sorted":[],"title_canon_sha256":"3a28340e0dd114db523f32213f702c0b4bc4f11417bdd2f244d667462f146f04","abstract_canon_sha256":"e58a7beed02ad52b062f760543954460a8e020b99f8ca52acf787923abf47dd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:48.045215Z","signature_b64":"Vgf8WevdjtCMIaMApLmKsSlkKCdMmZf6l6EPZ3bFgs4CHsSd+kOVk0fq/csbPxpki+ZFns4/UuhbMyAI0Rj3CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d57d315ec3804169ce7b15475f52f4afd54b3e8b417b6275a3095dd06344af7","last_reissued_at":"2026-05-18T01:17:48.044365Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:48.044365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse Fourier Transform in Any Constant Dimension with Nearly-Optimal Sample Complexity in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov","submitted_at":"2016-04-04T13:19:57Z","abstract_excerpt":"We consider the problem of computing a $k$-sparse approximation to the Fourier transform of a length $N$ signal. Our main result is a randomized algorithm for computing such an approximation (i.e. achieving the $\\ell_2/\\ell_2$ sparse recovery guarantees using Fourier measurements) using $O_d(k\\log N\\log\\log N)$ samples of the signal in time domain that runs in time $O_d(k\\log^{d+3} N)$, where $d\\geq 1$ is the dimensionality of the Fourier transform. The sample complexity matches the lower bound of $\\Omega(k\\log (N/k))$ for non-adaptive algorithms due to \\cite{DIPW} for any $k\\leq N^{1-\\delta}$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00845","kind":"arxiv","version":1},"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":"1604.00845","created_at":"2026-05-18T01:17:48.044503+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00845v1","created_at":"2026-05-18T01:17:48.044503+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00845","created_at":"2026-05-18T01:17:48.044503+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVL5GFPMHACB","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVL5GFPMHACBNHHH","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVL5GFPM","created_at":"2026-05-18T12:30:12.583610+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03692","citing_title":"Multiscale High-Dimensional Sparse Fourier Algorithms for Noisy Data","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL","json":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL.json","graph_json":"https://pith.science/api/pith-number/DVL5GFPMHACBNHHHWFKHL5JPJL/graph.json","events_json":"https://pith.science/api/pith-number/DVL5GFPMHACBNHHHWFKHL5JPJL/events.json","paper":"https://pith.science/paper/DVL5GFPM"},"agent_actions":{"view_html":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL","download_json":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL.json","view_paper":"https://pith.science/paper/DVL5GFPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00845&json=true","fetch_graph":"https://pith.science/api/pith-number/DVL5GFPMHACBNHHHWFKHL5JPJL/graph.json","fetch_events":"https://pith.science/api/pith-number/DVL5GFPMHACBNHHHWFKHL5JPJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/action/storage_attestation","attest_author":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/action/author_attestation","sign_citation":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/action/citation_signature","submit_replication":"https://pith.science/pith/DVL5GFPMHACBNHHHWFKHL5JPJL/action/replication_record"}},"created_at":"2026-05-18T01:17:48.044503+00:00","updated_at":"2026-05-18T01:17:48.044503+00:00"}