{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PC5TXMYR27OUFY5ZASY4BWEVRE","short_pith_number":"pith:PC5TXMYR","canonical_record":{"source":{"id":"1304.4517","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-16T16:49:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c1507ca29960bd535d37195ce279bc8ad752c5e2de1048e9f10a54b9d9039710","abstract_canon_sha256":"3e314fb2fc4cb57da4de10a2b27de1a304b2a579bb6c31a2d058f21400045477"},"schema_version":"1.0"},"canonical_sha256":"78bb3bb311d7dd42e3b904b1c0d895891ef353b4cd1435d37ec691140c7c6d93","source":{"kind":"arxiv","id":"1304.4517","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4517","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4517v2","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4517","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"PC5TXMYR27OU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PC5TXMYR27OUFY5Z","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PC5TXMYR","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PC5TXMYR27OUFY5ZASY4BWEVRE","target":"record","payload":{"canonical_record":{"source":{"id":"1304.4517","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-16T16:49:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c1507ca29960bd535d37195ce279bc8ad752c5e2de1048e9f10a54b9d9039710","abstract_canon_sha256":"3e314fb2fc4cb57da4de10a2b27de1a304b2a579bb6c31a2d058f21400045477"},"schema_version":"1.0"},"canonical_sha256":"78bb3bb311d7dd42e3b904b1c0d895891ef353b4cd1435d37ec691140c7c6d93","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:30.342254Z","signature_b64":"nxJC/W5HOMGmjFUgHm0DooN592/O/UFJIyCdOvei5EPJTO9BLktJk/Vm3+zToGzkPdAI6ab0CjZW8rivQkFGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78bb3bb311d7dd42e3b904b1c0d895891ef353b4cd1435d37ec691140c7c6d93","last_reissued_at":"2026-05-18T03:14:30.341557Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:30.341557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.4517","source_version":2,"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-18T03:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tF3uxF7x5qoO4x3w1t7uEYOe6cSZGZVwn7rPb7grym5XsrRKnR7/xoeNXf4h42gqKtL7lg4+PlAGSq7BAxyFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:36.559653Z"},"content_sha256":"d1f6a6dbbfc141875173d6eb6302dce0a4096d621f90b7a0f6ff4dd6f210b099","schema_version":"1.0","event_id":"sha256:d1f6a6dbbfc141875173d6eb6302dce0a4096d621f90b7a0f6ff4dd6f210b099"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PC5TXMYR27OUFY5ZASY4BWEVRE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Multiscale Sub-linear Time Fourier Algorithm for Noisy Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.NA","authors_text":"Andrew Christlieb, David Lawlor, Yang Wang","submitted_at":"2013-04-16T16:49:43Z","abstract_excerpt":"We extend the recent sparse Fourier transform algorithm of (Lawlor, Christlieb, and Wang, 2013) to the noisy setting, in which a signal of bandwidth N is given as a superposition of k << N frequencies and additive noise. We present two such extensions, the second of which exhibits a novel form of error-correction in its frequency estimation not unlike that of the beta-encoders in analog-to-digital conversion (Daubechies et al, 2006). The algorithm runs in time O(k log(k) log(N/k)) on average, provided the noise is not overwhelming. The error-correction property allows the algorithm to outperfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4517","kind":"arxiv","version":2},"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-18T03:14:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d80f34zAkyq89fjrg6ZWSsR4pP7CvYq+SaZLThiN+Fmspk5wzrxFGgCIXXBlZ3pg8zl5hmnh7JhL9VnKZPv9DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:52:36.560008Z"},"content_sha256":"99d89a63a8bd55fee9c05f2df962b47d5df35c99914aa414eca3b495691aa103","schema_version":"1.0","event_id":"sha256:99d89a63a8bd55fee9c05f2df962b47d5df35c99914aa414eca3b495691aa103"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PC5TXMYR27OUFY5ZASY4BWEVRE/bundle.json","state_url":"https://pith.science/pith/PC5TXMYR27OUFY5ZASY4BWEVRE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PC5TXMYR27OUFY5ZASY4BWEVRE/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-30T05:52:36Z","links":{"resolver":"https://pith.science/pith/PC5TXMYR27OUFY5ZASY4BWEVRE","bundle":"https://pith.science/pith/PC5TXMYR27OUFY5ZASY4BWEVRE/bundle.json","state":"https://pith.science/pith/PC5TXMYR27OUFY5ZASY4BWEVRE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PC5TXMYR27OUFY5ZASY4BWEVRE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PC5TXMYR27OUFY5ZASY4BWEVRE","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":"3e314fb2fc4cb57da4de10a2b27de1a304b2a579bb6c31a2d058f21400045477","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-16T16:49:43Z","title_canon_sha256":"c1507ca29960bd535d37195ce279bc8ad752c5e2de1048e9f10a54b9d9039710"},"schema_version":"1.0","source":{"id":"1304.4517","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4517","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4517v2","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4517","created_at":"2026-05-18T03:14:30Z"},{"alias_kind":"pith_short_12","alias_value":"PC5TXMYR27OU","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PC5TXMYR27OUFY5Z","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PC5TXMYR","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:99d89a63a8bd55fee9c05f2df962b47d5df35c99914aa414eca3b495691aa103","target":"graph","created_at":"2026-05-18T03:14:30Z","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 extend the recent sparse Fourier transform algorithm of (Lawlor, Christlieb, and Wang, 2013) to the noisy setting, in which a signal of bandwidth N is given as a superposition of k << N frequencies and additive noise. We present two such extensions, the second of which exhibits a novel form of error-correction in its frequency estimation not unlike that of the beta-encoders in analog-to-digital conversion (Daubechies et al, 2006). The algorithm runs in time O(k log(k) log(N/k)) on average, provided the noise is not overwhelming. The error-correction property allows the algorithm to outperfo","authors_text":"Andrew Christlieb, David Lawlor, Yang Wang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-16T16:49:43Z","title":"A Multiscale Sub-linear Time Fourier Algorithm for Noisy Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4517","kind":"arxiv","version":2},"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:d1f6a6dbbfc141875173d6eb6302dce0a4096d621f90b7a0f6ff4dd6f210b099","target":"record","created_at":"2026-05-18T03:14:30Z","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":"3e314fb2fc4cb57da4de10a2b27de1a304b2a579bb6c31a2d058f21400045477","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-04-16T16:49:43Z","title_canon_sha256":"c1507ca29960bd535d37195ce279bc8ad752c5e2de1048e9f10a54b9d9039710"},"schema_version":"1.0","source":{"id":"1304.4517","kind":"arxiv","version":2}},"canonical_sha256":"78bb3bb311d7dd42e3b904b1c0d895891ef353b4cd1435d37ec691140c7c6d93","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78bb3bb311d7dd42e3b904b1c0d895891ef353b4cd1435d37ec691140c7c6d93","first_computed_at":"2026-05-18T03:14:30.341557Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:30.341557Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nxJC/W5HOMGmjFUgHm0DooN592/O/UFJIyCdOvei5EPJTO9BLktJk/Vm3+zToGzkPdAI6ab0CjZW8rivQkFGAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:30.342254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4517","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1f6a6dbbfc141875173d6eb6302dce0a4096d621f90b7a0f6ff4dd6f210b099","sha256:99d89a63a8bd55fee9c05f2df962b47d5df35c99914aa414eca3b495691aa103"],"state_sha256":"ff22fc9731eb6de28740f005be0219506c3b603dbacd3cb302c72707d6f2bce2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zgDhNXRoOJx3ryRRaNVtSuPSxbKUXctds4aSTKh44Tz5eEYYU8thjtL/O/SVoK3P/E3oT2XqjyAFpSZZsJ26Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:52:36.562187Z","bundle_sha256":"e055fd4da4cf89f51a63ae65a3e81fa619dd3417193a0049044eb15f0de8626a"}}