{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NT7SBYPZFC7HSA3XY5LBG2GHAS","short_pith_number":"pith:NT7SBYPZ","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"},"canonical_sha256":"6cff20e1f928be790377c7561368c704ab689784cf8d606bfd20ad1ea1cb4f8f","source":{"kind":"arxiv","id":"1907.03692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03692","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03692v1","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03692","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"NT7SBYPZFC7H","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NT7SBYPZFC7HSA3X","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NT7SBYPZ","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NT7SBYPZFC7HSA3XY5LBG2GHAS","target":"record","payload":{"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"},"canonical_sha256":"6cff20e1f928be790377c7561368c704ab689784cf8d606bfd20ad1ea1cb4f8f","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"},"source_kind":"arxiv","source_id":"1907.03692","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ub6WeYNzA6yXtbbenCgB4pRSW4lE9qMiUKMkUSQuoumrPCSIiKBEKu65B7K445w7NLcjGgpKoic5spKUBERYDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:36:14.691449Z"},"content_sha256":"3eac75bdca2a698100955b2795ac4561865b03786af7749d836680d59d105fd0","schema_version":"1.0","event_id":"sha256:3eac75bdca2a698100955b2795ac4561865b03786af7749d836680d59d105fd0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NT7SBYPZFC7HSA3XY5LBG2GHAS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PdTK96bnbuBQkBACpNecZE5efGyS+/DBIZWpinzvAq+35gLdbt5TUbFxH9nBKhS7a3cJv4+jFq5txkQix5isCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T00:36:14.692120Z"},"content_sha256":"ed9db29b9c07348eb6f5d0ece12add69d95cf85807e9a0d08dcda120665e71ae","schema_version":"1.0","event_id":"sha256:ed9db29b9c07348eb6f5d0ece12add69d95cf85807e9a0d08dcda120665e71ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/bundle.json","state_url":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T00:36:14Z","links":{"resolver":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS","bundle":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/bundle.json","state":"https://pith.science/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NT7SBYPZFC7HSA3XY5LBG2GHAS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NT7SBYPZFC7HSA3XY5LBG2GHAS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4f3a04b8f7b141faa67c10edb40256bb3a46b129eaed29e2c9b586ab82aa2de0","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-08T15:57:13Z","title_canon_sha256":"67df580fc09acd14de77a63bb83d8b4f4403fad35f57f456810c0685e4a3f15e"},"schema_version":"1.0","source":{"id":"1907.03692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03692","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03692v1","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03692","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"NT7SBYPZFC7H","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"NT7SBYPZFC7HSA3X","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"NT7SBYPZ","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:ed9db29b9c07348eb6f5d0ece12add69d95cf85807e9a0d08dcda120665e71ae","target":"graph","created_at":"2026-05-17T23:41:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Andrew Christlieb, Bosu Choi, Yang Wang","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-08T15:57:13Z","title":"Multiscale High-Dimensional Sparse Fourier Algorithms for Noisy Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03692","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3eac75bdca2a698100955b2795ac4561865b03786af7749d836680d59d105fd0","target":"record","created_at":"2026-05-17T23:41:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4f3a04b8f7b141faa67c10edb40256bb3a46b129eaed29e2c9b586ab82aa2de0","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-07-08T15:57:13Z","title_canon_sha256":"67df580fc09acd14de77a63bb83d8b4f4403fad35f57f456810c0685e4a3f15e"},"schema_version":"1.0","source":{"id":"1907.03692","kind":"arxiv","version":1}},"canonical_sha256":"6cff20e1f928be790377c7561368c704ab689784cf8d606bfd20ad1ea1cb4f8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6cff20e1f928be790377c7561368c704ab689784cf8d606bfd20ad1ea1cb4f8f","first_computed_at":"2026-05-17T23:41:14.012052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:14.012052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"homqxjgRHMYXXTKa5hfdEHdckMjPz8SLN/ucclQtdv7Ws0q+DZMK11iYd6nOjQxalihWU6n+QkBmm0VXLllJBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:14.012427Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3eac75bdca2a698100955b2795ac4561865b03786af7749d836680d59d105fd0","sha256:ed9db29b9c07348eb6f5d0ece12add69d95cf85807e9a0d08dcda120665e71ae"],"state_sha256":"0e2bd2ba5eab63eb4484f1df12a749af7896b6a5d27c14b97b8d3b569236b046"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfZNEBjFtCIz3id1l1Fv/LppyZx+5PYuamtoch19e7ZWM2OsfPeDdqLXgJqDH55dJz54Cw5HwVRHAD/NlpXVAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T00:36:14.695903Z","bundle_sha256":"06ef75815c6b250612da34f917cfc5baa008dff13d66f0ef9c1332d42036e5ad"}}