{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:ZE66ITYBCLAIVO3W2G35L75MGA","short_pith_number":"pith:ZE66ITYB","schema_version":"1.0","canonical_sha256":"c93de44f0112c08abb76d1b7d5ffac302f9b9fb48a241a5bd9db35df1b1e5e93","source":{"kind":"arxiv","id":"2205.00658","version":3},"attestation_state":"computed","paper":{"title":"Improved Reconstruction for Fourier-Sparse Signals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baocheng Sun, Omri Weinstein, Ruizhe Zhang, Yeqi Gao, Zhao Song","submitted_at":"2022-05-02T05:15:54Z","abstract_excerpt":"We revisit the classical problem of Fourier-sparse signal reconstruction -- a variant of the \\emph{Set Query} problem -- which asks to efficiently reconstruct (a subset of) a $d$-dimensional Fourier-sparse signal ($\\|\\hat{x}(t)\\|_0 \\leq k$), from minimum \\emph{noisy} samples of $x(t)$ in the time domain. We present a unified framework for this problem by developing a theory of sparse Fourier transforms (SFT) for frequencies lying on a \\emph{lattice}, which can be viewed as a ``semi-continuous'' version of SFT in between discrete and continuous domains. Using this framework, we obtain the follo"},"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":"2205.00658","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-05-02T05:15:54Z","cross_cats_sorted":[],"title_canon_sha256":"b951b1ad3c4f62f568585d7decf1c5342f6d3210e058e414aa70f45a7da09082","abstract_canon_sha256":"6c01cc91e0d8af846037f9c46ae079f8dc1f3f890b2d85d8cb3e328141ff42a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:14:05.492529Z","signature_b64":"GbNrskVCSpfhxkMokqb167pNG4EvkUrtr6rmB/uDwuZT1sLM+9L6122ORAYWcZk09IyPGcVxOwEZ36twZv9nDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c93de44f0112c08abb76d1b7d5ffac302f9b9fb48a241a5bd9db35df1b1e5e93","last_reissued_at":"2026-07-05T07:14:05.492101Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:14:05.492101Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Reconstruction for Fourier-Sparse Signals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Baocheng Sun, Omri Weinstein, Ruizhe Zhang, Yeqi Gao, Zhao Song","submitted_at":"2022-05-02T05:15:54Z","abstract_excerpt":"We revisit the classical problem of Fourier-sparse signal reconstruction -- a variant of the \\emph{Set Query} problem -- which asks to efficiently reconstruct (a subset of) a $d$-dimensional Fourier-sparse signal ($\\|\\hat{x}(t)\\|_0 \\leq k$), from minimum \\emph{noisy} samples of $x(t)$ in the time domain. We present a unified framework for this problem by developing a theory of sparse Fourier transforms (SFT) for frequencies lying on a \\emph{lattice}, which can be viewed as a ``semi-continuous'' version of SFT in between discrete and continuous domains. Using this framework, we obtain the follo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.00658","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.00658/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2205.00658","created_at":"2026-07-05T07:14:05.492159+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.00658v3","created_at":"2026-07-05T07:14:05.492159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.00658","created_at":"2026-07-05T07:14:05.492159+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZE66ITYBCLAI","created_at":"2026-07-05T07:14:05.492159+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZE66ITYBCLAIVO3W","created_at":"2026-07-05T07:14:05.492159+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZE66ITYB","created_at":"2026-07-05T07:14:05.492159+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/ZE66ITYBCLAIVO3W2G35L75MGA","json":"https://pith.science/pith/ZE66ITYBCLAIVO3W2G35L75MGA.json","graph_json":"https://pith.science/api/pith-number/ZE66ITYBCLAIVO3W2G35L75MGA/graph.json","events_json":"https://pith.science/api/pith-number/ZE66ITYBCLAIVO3W2G35L75MGA/events.json","paper":"https://pith.science/paper/ZE66ITYB"},"agent_actions":{"view_html":"https://pith.science/pith/ZE66ITYBCLAIVO3W2G35L75MGA","download_json":"https://pith.science/pith/ZE66ITYBCLAIVO3W2G35L75MGA.json","view_paper":"https://pith.science/paper/ZE66ITYB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.00658&json=true","fetch_graph":"https://pith.science/api/pith-number/ZE66ITYBCLAIVO3W2G35L75MGA/graph.json","fetch_events":"https://pith.science/api/pith-number/ZE66ITYBCLAIVO3W2G35L75MGA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZE66ITYBCLAIVO3W2G35L75MGA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZE66ITYBCLAIVO3W2G35L75MGA/action/storage_attestation","attest_author":"https://pith.science/pith/ZE66ITYBCLAIVO3W2G35L75MGA/action/author_attestation","sign_citation":"https://pith.science/pith/ZE66ITYBCLAIVO3W2G35L75MGA/action/citation_signature","submit_replication":"https://pith.science/pith/ZE66ITYBCLAIVO3W2G35L75MGA/action/replication_record"}},"created_at":"2026-07-05T07:14:05.492159+00:00","updated_at":"2026-07-05T07:14:05.492159+00:00"}