{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6JY4D4325X3L5WZZ2OVCYDSMRD","short_pith_number":"pith:6JY4D432","schema_version":"1.0","canonical_sha256":"f271c1f37aedf6bedb39d3aa2c0e4c88f2b1666fe2f996b7bf2277d0c5cefd7d","source":{"kind":"arxiv","id":"1708.04544","version":2},"attestation_state":"computed","paper":{"title":"Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov","submitted_at":"2017-08-15T15:11:18Z","abstract_excerpt":"The problem of computing the Fourier Transform of a signal whose spectrum is dominated by a small number $k$ of frequencies quickly and using a small number of samples of the signal in time domain (the Sparse FFT problem) has received significant attention recently. It is known how to approximately compute the $k$-sparse Fourier transform in $\\approx k\\log^2 n$ time [Hassanieh et al'STOC'12], or using the optimal number $O(k\\log n)$ of samples [Indyk et al'FOCS'14] in time domain, or come within $(\\log\\log n)^{O(1)}$ factors of both these bounds simultaneously, but no algorithm achieving the o"},"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":"1708.04544","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-15T15:11:18Z","cross_cats_sorted":[],"title_canon_sha256":"e105243b3ab9e9c8358a69f10f1f73f74ab8f093e4e77d99fd479ce55784ff3c","abstract_canon_sha256":"0864fe85fc392d66e6c34b93c90e13d229ecfde1a91e03f093a71a4fbacc0f21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:54.157613Z","signature_b64":"dLkXwzCSXWbzBbbLqgkosm0an171qW0I6dzeEW+pxDkQYsFj0Sl7jRoCeWBHSuppBfurT2BtBi9jRR3lG6sxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f271c1f37aedf6bedb39d3aa2c0e4c88f2b1666fe2f996b7bf2277d0c5cefd7d","last_reissued_at":"2026-05-18T00:37:54.157152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:54.157152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michael Kapralov","submitted_at":"2017-08-15T15:11:18Z","abstract_excerpt":"The problem of computing the Fourier Transform of a signal whose spectrum is dominated by a small number $k$ of frequencies quickly and using a small number of samples of the signal in time domain (the Sparse FFT problem) has received significant attention recently. It is known how to approximately compute the $k$-sparse Fourier transform in $\\approx k\\log^2 n$ time [Hassanieh et al'STOC'12], or using the optimal number $O(k\\log n)$ of samples [Indyk et al'FOCS'14] in time domain, or come within $(\\log\\log n)^{O(1)}$ factors of both these bounds simultaneously, but no algorithm achieving the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04544","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":"1708.04544","created_at":"2026-05-18T00:37:54.157221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04544v2","created_at":"2026-05-18T00:37:54.157221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04544","created_at":"2026-05-18T00:37:54.157221+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JY4D4325X3L","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JY4D4325X3L5WZZ","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JY4D432","created_at":"2026-05-18T12:31:03.183658+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/6JY4D4325X3L5WZZ2OVCYDSMRD","json":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD.json","graph_json":"https://pith.science/api/pith-number/6JY4D4325X3L5WZZ2OVCYDSMRD/graph.json","events_json":"https://pith.science/api/pith-number/6JY4D4325X3L5WZZ2OVCYDSMRD/events.json","paper":"https://pith.science/paper/6JY4D432"},"agent_actions":{"view_html":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD","download_json":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD.json","view_paper":"https://pith.science/paper/6JY4D432","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04544&json=true","fetch_graph":"https://pith.science/api/pith-number/6JY4D4325X3L5WZZ2OVCYDSMRD/graph.json","fetch_events":"https://pith.science/api/pith-number/6JY4D4325X3L5WZZ2OVCYDSMRD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/action/storage_attestation","attest_author":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/action/author_attestation","sign_citation":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/action/citation_signature","submit_replication":"https://pith.science/pith/6JY4D4325X3L5WZZ2OVCYDSMRD/action/replication_record"}},"created_at":"2026-05-18T00:37:54.157221+00:00","updated_at":"2026-05-18T00:37:54.157221+00:00"}