{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SF3UT7WE4LEQKYOYTOIE4DKLU5","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":"a37ab4e2796a7ea1a5cfe3958c721817c9ebd361ede30ec0606c3442221ead5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T13:31:47Z","title_canon_sha256":"f3be7fc7fa8ff701ffb86eb0e23ec0c4801eabafb393eee0a0201c6e093dd4c0"},"schema_version":"1.0","source":{"id":"1702.01286","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01286","created_at":"2026-05-18T00:46:37Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01286v2","created_at":"2026-05-18T00:46:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01286","created_at":"2026-05-18T00:46:37Z"},{"alias_kind":"pith_short_12","alias_value":"SF3UT7WE4LEQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SF3UT7WE4LEQKYOY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SF3UT7WE","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:7b0c7f3523dee0c671ca37f4feca0d9d612fcd1cee23e90197f85e0c4a81cac9","target":"graph","created_at":"2026-05-18T00:46:37Z","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":"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","authors_text":"Amir Zandieh, Jonathan Scarlett, Michael Kapralov, Volkan Cevher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T13:31:47Z","title":"An Adaptive Sublinear-Time Block Sparse Fourier Transform"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01286","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:77c967f7875ffea750626642526b6d8544c9847eb26c667300244a0e124018cc","target":"record","created_at":"2026-05-18T00:46:37Z","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":"a37ab4e2796a7ea1a5cfe3958c721817c9ebd361ede30ec0606c3442221ead5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-02-04T13:31:47Z","title_canon_sha256":"f3be7fc7fa8ff701ffb86eb0e23ec0c4801eabafb393eee0a0201c6e093dd4c0"},"schema_version":"1.0","source":{"id":"1702.01286","kind":"arxiv","version":2}},"canonical_sha256":"917749fec4e2c90561d89b904e0d4ba760bb0359658f8978f67ce03158d6c4fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"917749fec4e2c90561d89b904e0d4ba760bb0359658f8978f67ce03158d6c4fa","first_computed_at":"2026-05-18T00:46:37.710485Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:37.710485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PJqsMKo3I4jxOAwmT3aY2obnSwGLXKRsFB4eM9YnjsoMoyeHfcXuPInGODpQIYBEgWKcRHmaHhJ2/FpkDOhsBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:37.711051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01286","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77c967f7875ffea750626642526b6d8544c9847eb26c667300244a0e124018cc","sha256:7b0c7f3523dee0c671ca37f4feca0d9d612fcd1cee23e90197f85e0c4a81cac9"],"state_sha256":"1aeffafeadf40729ae82ffab43612aac55e17707ce93c1677af5b3a4c59dfde8"}