{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SF3UT7WE4LEQKYOYTOIE4DKLU5","short_pith_number":"pith:SF3UT7WE","schema_version":"1.0","canonical_sha256":"917749fec4e2c90561d89b904e0d4ba760bb0359658f8978f67ce03158d6c4fa","source":{"kind":"arxiv","id":"1702.01286","version":2},"attestation_state":"computed","paper":{"title":"An Adaptive Sublinear-Time Block Sparse Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Zandieh, Jonathan Scarlett, Michael Kapralov, Volkan Cevher","submitted_at":"2017-02-04T13:31:47Z","abstract_excerpt":"The problem of approximately computing the $k$ dominant Fourier coefficients of a vector $X$ quickly, and using few samples in time domain, is known as the Sparse Fourier Transform (sparse FFT) problem. A long line of work on the sparse FFT has resulted in algorithms with $O(k\\log n\\log (n/k))$ runtime [Hassanieh et al., STOC'12] and $O(k\\log n)$ sample complexity [Indyk et al., FOCS'14]. These results are proved using non-adaptive algorithms, and the latter $O(k\\log n)$ sample complexity result is essentially the best possible under the sparsity assumption alone.\n  This paper revisits the spa"},"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":"1702.01286","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T13:31:47Z","cross_cats_sorted":[],"title_canon_sha256":"f3be7fc7fa8ff701ffb86eb0e23ec0c4801eabafb393eee0a0201c6e093dd4c0","abstract_canon_sha256":"a37ab4e2796a7ea1a5cfe3958c721817c9ebd361ede30ec0606c3442221ead5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:37.711051Z","signature_b64":"PJqsMKo3I4jxOAwmT3aY2obnSwGLXKRsFB4eM9YnjsoMoyeHfcXuPInGODpQIYBEgWKcRHmaHhJ2/FpkDOhsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"917749fec4e2c90561d89b904e0d4ba760bb0359658f8978f67ce03158d6c4fa","last_reissued_at":"2026-05-18T00:46:37.710485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:37.710485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Adaptive Sublinear-Time Block Sparse Fourier Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amir Zandieh, Jonathan Scarlett, Michael Kapralov, Volkan Cevher","submitted_at":"2017-02-04T13:31:47Z","abstract_excerpt":"The problem of approximately computing the $k$ dominant Fourier coefficients of a vector $X$ quickly, and using few samples in time domain, is known as the Sparse Fourier Transform (sparse FFT) problem. A long line of work on the sparse FFT has resulted in algorithms with $O(k\\log n\\log (n/k))$ runtime [Hassanieh et al., STOC'12] and $O(k\\log n)$ sample complexity [Indyk et al., FOCS'14]. These results are proved using non-adaptive algorithms, and the latter $O(k\\log n)$ sample complexity result is essentially the best possible under the sparsity assumption alone.\n  This paper revisits the spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01286","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":"1702.01286","created_at":"2026-05-18T00:46:37.710593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.01286v2","created_at":"2026-05-18T00:46:37.710593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01286","created_at":"2026-05-18T00:46:37.710593+00:00"},{"alias_kind":"pith_short_12","alias_value":"SF3UT7WE4LEQ","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SF3UT7WE4LEQKYOY","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SF3UT7WE","created_at":"2026-05-18T12:31:43.269735+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/SF3UT7WE4LEQKYOYTOIE4DKLU5","json":"https://pith.science/pith/SF3UT7WE4LEQKYOYTOIE4DKLU5.json","graph_json":"https://pith.science/api/pith-number/SF3UT7WE4LEQKYOYTOIE4DKLU5/graph.json","events_json":"https://pith.science/api/pith-number/SF3UT7WE4LEQKYOYTOIE4DKLU5/events.json","paper":"https://pith.science/paper/SF3UT7WE"},"agent_actions":{"view_html":"https://pith.science/pith/SF3UT7WE4LEQKYOYTOIE4DKLU5","download_json":"https://pith.science/pith/SF3UT7WE4LEQKYOYTOIE4DKLU5.json","view_paper":"https://pith.science/paper/SF3UT7WE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.01286&json=true","fetch_graph":"https://pith.science/api/pith-number/SF3UT7WE4LEQKYOYTOIE4DKLU5/graph.json","fetch_events":"https://pith.science/api/pith-number/SF3UT7WE4LEQKYOYTOIE4DKLU5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SF3UT7WE4LEQKYOYTOIE4DKLU5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SF3UT7WE4LEQKYOYTOIE4DKLU5/action/storage_attestation","attest_author":"https://pith.science/pith/SF3UT7WE4LEQKYOYTOIE4DKLU5/action/author_attestation","sign_citation":"https://pith.science/pith/SF3UT7WE4LEQKYOYTOIE4DKLU5/action/citation_signature","submit_replication":"https://pith.science/pith/SF3UT7WE4LEQKYOYTOIE4DKLU5/action/replication_record"}},"created_at":"2026-05-18T00:46:37.710593+00:00","updated_at":"2026-05-18T00:46:37.710593+00:00"}