{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZBXM3XQVBEOCVSIPKUGGSQKOQY","short_pith_number":"pith:ZBXM3XQV","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"},"canonical_sha256":"c86ecdde15091c2ac90f550c69414e863ecee87b11d0d8310128d621d4ac54d7","source":{"kind":"arxiv","id":"1609.00896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00896","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00896v1","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00896","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZBXM3XQVBEOC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZBXM3XQVBEOCVSIP","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZBXM3XQV","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZBXM3XQVBEOCVSIPKUGGSQKOQY","target":"record","payload":{"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"},"canonical_sha256":"c86ecdde15091c2ac90f550c69414e863ecee87b11d0d8310128d621d4ac54d7","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"},"source_kind":"arxiv","source_id":"1609.00896","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-18T01:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qw6o9Q539lOzIf1oUXJVePAh7T/KFzZ/n8TMb622frl53/7QK6HJEwjkfPUdxIqpEfTfOmklqzfscsa7Y573Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:53.838889Z"},"content_sha256":"4523c0c23b8ef1967fd5aeeefc1a54c1010342393fcd0c46b16b20c425c7aed3","schema_version":"1.0","event_id":"sha256:4523c0c23b8ef1967fd5aeeefc1a54c1010342393fcd0c46b16b20c425c7aed3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZBXM3XQVBEOCVSIPKUGGSQKOQY","target":"graph","payload":{"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"},"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-18T01:06:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2DAF8AFrNQsf5RZtprBLE/qbscTfGnL5QlvmO/iT2vHj8q2jZjLgssYhXCf1ooV7vRniUPA2hAGSpWWY9U9AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:22:53.839601Z"},"content_sha256":"f2a70f4147e4d09b2cc0da58a02eaa4a54388eec4ef6996580fd46e1cad59924","schema_version":"1.0","event_id":"sha256:f2a70f4147e4d09b2cc0da58a02eaa4a54388eec4ef6996580fd46e1cad59924"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/bundle.json","state_url":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/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-06-01T06:22:53Z","links":{"resolver":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY","bundle":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/bundle.json","state":"https://pith.science/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZBXM3XQVBEOCVSIPKUGGSQKOQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZBXM3XQVBEOCVSIPKUGGSQKOQY","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":"3b501cd602da6a3658395ad6ae38daffd32ca1667dc7118e7b47df2ec0ce6f0c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-09-04T06:07:40Z","title_canon_sha256":"d50f6896587e94e51f7cb9c732b80406b7f318bd314644e6baba660c0864ab0e"},"schema_version":"1.0","source":{"id":"1609.00896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.00896","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"arxiv_version","alias_value":"1609.00896v1","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.00896","created_at":"2026-05-18T01:06:19Z"},{"alias_kind":"pith_short_12","alias_value":"ZBXM3XQVBEOC","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"ZBXM3XQVBEOCVSIP","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"ZBXM3XQV","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:f2a70f4147e4d09b2cc0da58a02eaa4a54388eec4ef6996580fd46e1cad59924","target":"graph","created_at":"2026-05-18T01:06:19Z","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":"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","authors_text":"Eric Price, Zhao Song","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-09-04T06:07:40Z","title":"A Robust Sparse Fourier Transform in the Continuous Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.00896","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:4523c0c23b8ef1967fd5aeeefc1a54c1010342393fcd0c46b16b20c425c7aed3","target":"record","created_at":"2026-05-18T01:06:19Z","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":"3b501cd602da6a3658395ad6ae38daffd32ca1667dc7118e7b47df2ec0ce6f0c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2016-09-04T06:07:40Z","title_canon_sha256":"d50f6896587e94e51f7cb9c732b80406b7f318bd314644e6baba660c0864ab0e"},"schema_version":"1.0","source":{"id":"1609.00896","kind":"arxiv","version":1}},"canonical_sha256":"c86ecdde15091c2ac90f550c69414e863ecee87b11d0d8310128d621d4ac54d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c86ecdde15091c2ac90f550c69414e863ecee87b11d0d8310128d621d4ac54d7","first_computed_at":"2026-05-18T01:06:19.652138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:06:19.652138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"402Rs7IlBlNrOJ8hqsD2ZbyNduhRGw4z8Y6EWur+IzZ66a2g+YWTbuUsjwbiIrxTDrhtyIOCDcmsqh4sa+TQBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:06:19.652810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.00896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4523c0c23b8ef1967fd5aeeefc1a54c1010342393fcd0c46b16b20c425c7aed3","sha256:f2a70f4147e4d09b2cc0da58a02eaa4a54388eec4ef6996580fd46e1cad59924"],"state_sha256":"9311333cea9b97d4cade00e78edd44f9fc5e10b92eb9dc93381e11fa68dffc21"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WQixN+HT3aufj+DJZAaROE5eqLlAeqKwvdSyM3s/DOG/NAbThxSlq8B5usomsLVqySIkaOysseS6vowu9lZCAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:22:53.843695Z","bundle_sha256":"23018605c9e569e5149db21ea13caf20ad1fbb3a11ff234a664819aa76b1d13d"}}