{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ZBXM3XQVBEOCVSIPKUGGSQKOQY","short_pith_number":"pith:ZBXM3XQV","schema_version":"1.0","canonical_sha256":"c86ecdde15091c2ac90f550c69414e863ecee87b11d0d8310128d621d4ac54d7","source":{"kind":"arxiv","id":"1609.00896","version":1},"attestation_state":"computed","paper":{"title":"A Robust Sparse Fourier Transform in the Continuous Setting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Price, Zhao Song","submitted_at":"2016-09-04T06:07:40Z","abstract_excerpt":"In recent years, a number of works have studied methods for computing the Fourier transform in sublinear time if the output is sparse. Most of these have focused on the discrete setting, even though in many applications the input signal is continuous and naive discretization significantly worsens the sparsity level.\n  We present an algorithm for robustly computing sparse Fourier transforms in the continuous setting. Let $x(t) = x^*(t) + g(t)$, where $x^*$ has a $k$-sparse Fourier transform and $g$ is an arbitrary noise term. Given sample access to $x(t)$ for some duration $T$, we show how to f"},"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":"1609.00896","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-09-04T06:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"d50f6896587e94e51f7cb9c732b80406b7f318bd314644e6baba660c0864ab0e","abstract_canon_sha256":"3b501cd602da6a3658395ad6ae38daffd32ca1667dc7118e7b47df2ec0ce6f0c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:06:19.652810Z","signature_b64":"402Rs7IlBlNrOJ8hqsD2ZbyNduhRGw4z8Y6EWur+IzZ66a2g+YWTbuUsjwbiIrxTDrhtyIOCDcmsqh4sa+TQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c86ecdde15091c2ac90f550c69414e863ecee87b11d0d8310128d621d4ac54d7","last_reissued_at":"2026-05-18T01:06:19.652138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:06:19.652138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Robust Sparse Fourier Transform in the Continuous Setting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Price, Zhao Song","submitted_at":"2016-09-04T06:07:40Z","abstract_excerpt":"In recent years, a number of works have studied methods for computing the Fourier transform in sublinear time if the output is sparse. Most of these have focused on the discrete setting, even though in many applications the input signal is continuous and naive discretization significantly worsens the sparsity level.\n  We present an algorithm for robustly computing sparse Fourier transforms in the continuous setting. Let $x(t) = x^*(t) + g(t)$, where $x^*$ has a $k$-sparse Fourier transform and $g$ is an arbitrary noise term. Given sample access to $x(t)$ for some duration $T$, we show how to f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00896","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":"1609.00896","created_at":"2026-05-18T01:06:19.652225+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.00896v1","created_at":"2026-05-18T01:06:19.652225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00896","created_at":"2026-05-18T01:06:19.652225+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZBXM3XQVBEOC","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZBXM3XQVBEOCVSIP","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZBXM3XQV","created_at":"2026-05-18T12:30:53.716459+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/ZBXM3XQVBEOCVSIPKUGGSQKOQY","json":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY.json","graph_json":"https://pith.science/api/pith-number/ZBXM3XQVBEOCVSIPKUGGSQKOQY/graph.json","events_json":"https://pith.science/api/pith-number/ZBXM3XQVBEOCVSIPKUGGSQKOQY/events.json","paper":"https://pith.science/paper/ZBXM3XQV"},"agent_actions":{"view_html":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY","download_json":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY.json","view_paper":"https://pith.science/paper/ZBXM3XQV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.00896&json=true","fetch_graph":"https://pith.science/api/pith-number/ZBXM3XQVBEOCVSIPKUGGSQKOQY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZBXM3XQVBEOCVSIPKUGGSQKOQY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/action/storage_attestation","attest_author":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/action/author_attestation","sign_citation":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/action/citation_signature","submit_replication":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/action/replication_record"}},"created_at":"2026-05-18T01:06:19.652225+00:00","updated_at":"2026-05-18T01:06:19.652225+00:00"}