{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NT7SBYPZFC7HSA3XY5LBG2GHAS","short_pith_number":"pith:NT7SBYPZ","schema_version":"1.0","canonical_sha256":"6cff20e1f928be790377c7561368c704ab689784cf8d606bfd20ad1ea1cb4f8f","source":{"kind":"arxiv","id":"1907.03692","version":1},"attestation_state":"computed","paper":{"title":"Multiscale High-Dimensional Sparse Fourier Algorithms for Noisy Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Andrew Christlieb, Bosu Choi, Yang Wang","submitted_at":"2019-07-08T15:57:13Z","abstract_excerpt":"We develop an efficient and robust high-dimensional sparse Fourier algorithm for noisy samples. Earlier in the paper ``Multi-dimensional sublinear sparse Fourier algorithm\" (2016), an efficient sparse Fourier algorithm with $\\Theta(ds \\log s)$ average-case runtime and $\\Theta(ds)$ sampling complexity under certain assumptions was developed for signals that are $s$-sparse and bandlimited in the $d$-dimensional Fourier domain, i.e. there are at most $s$ energetic frequencies and they are in $ \\left[-N/2, N/2\\right)^d\\cap \\mathbb{Z}^d$. However, in practice the measurements of signals often conta"},"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":"1907.03692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-08T15:57:13Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"67df580fc09acd14de77a63bb83d8b4f4403fad35f57f456810c0685e4a3f15e","abstract_canon_sha256":"4f3a04b8f7b141faa67c10edb40256bb3a46b129eaed29e2c9b586ab82aa2de0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:14.012427Z","signature_b64":"homqxjgRHMYXXTKa5hfdEHdckMjPz8SLN/ucclQtdv7Ws0q+DZMK11iYd6nOjQxalihWU6n+QkBmm0VXLllJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6cff20e1f928be790377c7561368c704ab689784cf8d606bfd20ad1ea1cb4f8f","last_reissued_at":"2026-05-17T23:41:14.012052Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:14.012052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiscale High-Dimensional Sparse Fourier Algorithms for Noisy Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Andrew Christlieb, Bosu Choi, Yang Wang","submitted_at":"2019-07-08T15:57:13Z","abstract_excerpt":"We develop an efficient and robust high-dimensional sparse Fourier algorithm for noisy samples. Earlier in the paper ``Multi-dimensional sublinear sparse Fourier algorithm\" (2016), an efficient sparse Fourier algorithm with $\\Theta(ds \\log s)$ average-case runtime and $\\Theta(ds)$ sampling complexity under certain assumptions was developed for signals that are $s$-sparse and bandlimited in the $d$-dimensional Fourier domain, i.e. there are at most $s$ energetic frequencies and they are in $ \\left[-N/2, N/2\\right)^d\\cap \\mathbb{Z}^d$. However, in practice the measurements of signals often conta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03692","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":"1907.03692","created_at":"2026-05-17T23:41:14.012113+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03692v1","created_at":"2026-05-17T23:41:14.012113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03692","created_at":"2026-05-17T23:41:14.012113+00:00"},{"alias_kind":"pith_short_12","alias_value":"NT7SBYPZFC7H","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NT7SBYPZFC7HSA3X","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NT7SBYPZ","created_at":"2026-05-18T12:33:24.271573+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/NT7SBYPZFC7HSA3XY5LBG2GHAS","json":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS.json","graph_json":"https://pith.science/api/pith-number/NT7SBYPZFC7HSA3XY5LBG2GHAS/graph.json","events_json":"https://pith.science/api/pith-number/NT7SBYPZFC7HSA3XY5LBG2GHAS/events.json","paper":"https://pith.science/paper/NT7SBYPZ"},"agent_actions":{"view_html":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS","download_json":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS.json","view_paper":"https://pith.science/paper/NT7SBYPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03692&json=true","fetch_graph":"https://pith.science/api/pith-number/NT7SBYPZFC7HSA3XY5LBG2GHAS/graph.json","fetch_events":"https://pith.science/api/pith-number/NT7SBYPZFC7HSA3XY5LBG2GHAS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/action/storage_attestation","attest_author":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/action/author_attestation","sign_citation":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/action/citation_signature","submit_replication":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/action/replication_record"}},"created_at":"2026-05-17T23:41:14.012113+00:00","updated_at":"2026-05-17T23:41:14.012113+00:00"}