{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RR7YU4IWEDZBIKQ2OFKCS6APEC","short_pith_number":"pith:RR7YU4IW","schema_version":"1.0","canonical_sha256":"8c7f8a711620f2142a1a715429780f209a705c8af8588efe3829f5f67727dd7b","source":{"kind":"arxiv","id":"1706.02740","version":1},"attestation_state":"computed","paper":{"title":"A New Class of Fully Discrete Sparse Fourier Transforms: Faster Stable Implementations with Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Andrew Christlieb, Mark A. Iwen, Ruochuan Zhang, Sami Merhi","submitted_at":"2017-06-08T19:40:28Z","abstract_excerpt":"In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\\mathbf{\\hat{f}} \\in \\mathbb{C}^N$ of any given input vector $\\mathbf{f} \\in \\mathbb{C}^N$ in just $\\left( s \\log N\\right)^{\\mathcal{O}(1)}$-time using only a similarly small number of entries of $\\mathbf{f}$. In particular, we present a deterministic SFT algorithm which is guaranteed to always recover a near best $s$-term approximation of the DFT of any given input vector $\\mathbf{f} \\in \\mathbb{C}^N$ in $\\mathcal{O} \\left( s^"},"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":"1706.02740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-06-08T19:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"833f82100887e4cd7e3289bd09bee18af20301427d15740c5ac86ce58d14e8aa","abstract_canon_sha256":"92aff4edacf600ca85056e9a984f061e9e458b5c197af55660c06d4403f7ee81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:41.101476Z","signature_b64":"wNyhjm1VE+ciNbQG8Ef4NHTX9ejwjfcPsmCYvwCpHd9wzaASxi/w5Vy0shM8kPBmAOq8VTotIrNBpKjpttcQBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c7f8a711620f2142a1a715429780f209a705c8af8588efe3829f5f67727dd7b","last_reissued_at":"2026-05-18T00:42:41.100762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:41.100762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Class of Fully Discrete Sparse Fourier Transforms: Faster Stable Implementations with Guarantees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Andrew Christlieb, Mark A. Iwen, Ruochuan Zhang, Sami Merhi","submitted_at":"2017-06-08T19:40:28Z","abstract_excerpt":"In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best $s$-term approximation of the Discrete Fourier Transform (DFT) $\\mathbf{\\hat{f}} \\in \\mathbb{C}^N$ of any given input vector $\\mathbf{f} \\in \\mathbb{C}^N$ in just $\\left( s \\log N\\right)^{\\mathcal{O}(1)}$-time using only a similarly small number of entries of $\\mathbf{f}$. In particular, we present a deterministic SFT algorithm which is guaranteed to always recover a near best $s$-term approximation of the DFT of any given input vector $\\mathbf{f} \\in \\mathbb{C}^N$ in $\\mathcal{O} \\left( s^"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02740","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":"1706.02740","created_at":"2026-05-18T00:42:41.100871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.02740v1","created_at":"2026-05-18T00:42:41.100871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02740","created_at":"2026-05-18T00:42:41.100871+00:00"},{"alias_kind":"pith_short_12","alias_value":"RR7YU4IWEDZB","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_16","alias_value":"RR7YU4IWEDZBIKQ2","created_at":"2026-05-18T12:31:39.905425+00:00"},{"alias_kind":"pith_short_8","alias_value":"RR7YU4IW","created_at":"2026-05-18T12:31:39.905425+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.03692","citing_title":"Multiscale High-Dimensional Sparse Fourier Algorithms for Noisy Data","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC","json":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC.json","graph_json":"https://pith.science/api/pith-number/RR7YU4IWEDZBIKQ2OFKCS6APEC/graph.json","events_json":"https://pith.science/api/pith-number/RR7YU4IWEDZBIKQ2OFKCS6APEC/events.json","paper":"https://pith.science/paper/RR7YU4IW"},"agent_actions":{"view_html":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC","download_json":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC.json","view_paper":"https://pith.science/paper/RR7YU4IW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.02740&json=true","fetch_graph":"https://pith.science/api/pith-number/RR7YU4IWEDZBIKQ2OFKCS6APEC/graph.json","fetch_events":"https://pith.science/api/pith-number/RR7YU4IWEDZBIKQ2OFKCS6APEC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/action/storage_attestation","attest_author":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/action/author_attestation","sign_citation":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/action/citation_signature","submit_replication":"https://pith.science/pith/RR7YU4IWEDZBIKQ2OFKCS6APEC/action/replication_record"}},"created_at":"2026-05-18T00:42:41.100871+00:00","updated_at":"2026-05-18T00:42:41.100871+00:00"}