{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:JUX76MJERUXZMALEWIZ4KH26Y3","short_pith_number":"pith:JUX76MJE","canonical_record":{"source":{"id":"math/0502357","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2005-02-16T17:25:20Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"bb35f08fd1ca3c75871d17d16ac583a055b7739313665a1226ffb21a4dd980e8","abstract_canon_sha256":"c2a9c64b8357fd2b9eac33263cd7d59c36ee267c55e062a1b7b42383aad170e2"},"schema_version":"1.0"},"canonical_sha256":"4d2fff31248d2f960164b233c51f5ec6d7e39ab84333ed1fec3294092dd331c2","source":{"kind":"arxiv","id":"math/0502357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0502357","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"math/0502357v1","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0502357","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"JUX76MJERUXZ","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_16","alias_value":"JUX76MJERUXZMALE","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_8","alias_value":"JUX76MJE","created_at":"2026-06-03T22:06:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:JUX76MJERUXZMALEWIZ4KH26Y3","target":"record","payload":{"canonical_record":{"source":{"id":"math/0502357","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2005-02-16T17:25:20Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"bb35f08fd1ca3c75871d17d16ac583a055b7739313665a1226ffb21a4dd980e8","abstract_canon_sha256":"c2a9c64b8357fd2b9eac33263cd7d59c36ee267c55e062a1b7b42383aad170e2"},"schema_version":"1.0"},"canonical_sha256":"4d2fff31248d2f960164b233c51f5ec6d7e39ab84333ed1fec3294092dd331c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:16.398478Z","signature_b64":"Ql/Kqb0XwOsFslWwyMhQ5+geJQtkoZJNzfBvmnAhuAcxrCJwgUjSyPuT2/HHSa0qzOPG9OWo+BHC62ts4/c7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d2fff31248d2f960164b233c51f5ec6d7e39ab84333ed1fec3294092dd331c2","last_reissued_at":"2026-06-03T22:06:16.398042Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:16.398042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"math/0502357","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-06-03T22:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DwVrRlk4KHQpFBsqRjPtMclcumirNOq4lkxN36NM3SFeNRjFGEG4ZzuXaFoul8Ha9Q5+AjWOEc93Kdj5Li9EBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:13:34.678518Z"},"content_sha256":"c32f9134b219402c25bab2fc986814926183a25bbbf673baf6191097f4c589d3","schema_version":"1.0","event_id":"sha256:c32f9134b219402c25bab2fc986814926183a25bbbf673baf6191097f4c589d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:JUX76MJERUXZMALEWIZ4KH26Y3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Sublinear Algorithm of Sparse Fourier Transform for Nonequispaced Data","license":"","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Computational Mathematics, Jing Zou (1) ((1) Program in Applied, Princeton University.)","submitted_at":"2005-02-16T17:25:20Z","abstract_excerpt":"We present a sublinear randomized algorithm to compute a sparse Fourier transform for nonequispaced data. Suppose a signal S is known to consist of N equispaced samples, of which only L<N are available. If the ratio p=L/N is not close to 1, the available data are typically non-equispaced samples. Then our algorithm reconstructs a near-optimal B-term representation R with high probability 1-delta, in time and space poly(B,log(L),log p, log(1/delta), epsilon^{-1}, such that ||S-R||^2 < (1+epsilon) ||S-R_{opt}^B||^2, where R_{opt}^B is the optimal B-term Fourier representation of signal S. The su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0502357","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/math/0502357/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-03T22:06:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LRPmaLO1G5H241ZpHm4KwARvTyLIcHvAJI/qR0y+SJN4CFVoi8i4+NqiuoVgobIfdIar02Fcv8lyGtwgi89UBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T03:13:34.679263Z"},"content_sha256":"1ea60cf20882fbeb57805722fda08862be5022c573d24fa2e2919abaa0f3d30a","schema_version":"1.0","event_id":"sha256:1ea60cf20882fbeb57805722fda08862be5022c573d24fa2e2919abaa0f3d30a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JUX76MJERUXZMALEWIZ4KH26Y3/bundle.json","state_url":"https://pith.science/pith/JUX76MJERUXZMALEWIZ4KH26Y3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JUX76MJERUXZMALEWIZ4KH26Y3/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-10T03:13:34Z","links":{"resolver":"https://pith.science/pith/JUX76MJERUXZMALEWIZ4KH26Y3","bundle":"https://pith.science/pith/JUX76MJERUXZMALEWIZ4KH26Y3/bundle.json","state":"https://pith.science/pith/JUX76MJERUXZMALEWIZ4KH26Y3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JUX76MJERUXZMALEWIZ4KH26Y3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:JUX76MJERUXZMALEWIZ4KH26Y3","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":"c2a9c64b8357fd2b9eac33263cd7d59c36ee267c55e062a1b7b42383aad170e2","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2005-02-16T17:25:20Z","title_canon_sha256":"bb35f08fd1ca3c75871d17d16ac583a055b7739313665a1226ffb21a4dd980e8"},"schema_version":"1.0","source":{"id":"math/0502357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/0502357","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"arxiv_version","alias_value":"math/0502357v1","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0502357","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_12","alias_value":"JUX76MJERUXZ","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_16","alias_value":"JUX76MJERUXZMALE","created_at":"2026-06-03T22:06:16Z"},{"alias_kind":"pith_short_8","alias_value":"JUX76MJE","created_at":"2026-06-03T22:06:16Z"}],"graph_snapshots":[{"event_id":"sha256:1ea60cf20882fbeb57805722fda08862be5022c573d24fa2e2919abaa0f3d30a","target":"graph","created_at":"2026-06-03T22:06:16Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/math/0502357/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a sublinear randomized algorithm to compute a sparse Fourier transform for nonequispaced data. Suppose a signal S is known to consist of N equispaced samples, of which only L<N are available. If the ratio p=L/N is not close to 1, the available data are typically non-equispaced samples. Then our algorithm reconstructs a near-optimal B-term representation R with high probability 1-delta, in time and space poly(B,log(L),log p, log(1/delta), epsilon^{-1}, such that ||S-R||^2 < (1+epsilon) ||S-R_{opt}^B||^2, where R_{opt}^B is the optimal B-term Fourier representation of signal S. The su","authors_text":"Computational Mathematics, Jing Zou (1) ((1) Program in Applied, Princeton University.)","cross_cats":["cs.NA"],"headline":"","license":"","primary_cat":"math.NA","submitted_at":"2005-02-16T17:25:20Z","title":"A Sublinear Algorithm of Sparse Fourier Transform for Nonequispaced Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0502357","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:c32f9134b219402c25bab2fc986814926183a25bbbf673baf6191097f4c589d3","target":"record","created_at":"2026-06-03T22:06:16Z","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":"c2a9c64b8357fd2b9eac33263cd7d59c36ee267c55e062a1b7b42383aad170e2","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2005-02-16T17:25:20Z","title_canon_sha256":"bb35f08fd1ca3c75871d17d16ac583a055b7739313665a1226ffb21a4dd980e8"},"schema_version":"1.0","source":{"id":"math/0502357","kind":"arxiv","version":1}},"canonical_sha256":"4d2fff31248d2f960164b233c51f5ec6d7e39ab84333ed1fec3294092dd331c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d2fff31248d2f960164b233c51f5ec6d7e39ab84333ed1fec3294092dd331c2","first_computed_at":"2026-06-03T22:06:16.398042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:16.398042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ql/Kqb0XwOsFslWwyMhQ5+geJQtkoZJNzfBvmnAhuAcxrCJwgUjSyPuT2/HHSa0qzOPG9OWo+BHC62ts4/c7AA==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:16.398478Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/0502357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c32f9134b219402c25bab2fc986814926183a25bbbf673baf6191097f4c589d3","sha256:1ea60cf20882fbeb57805722fda08862be5022c573d24fa2e2919abaa0f3d30a"],"state_sha256":"23b761d8d0a04f3d6394b20cdf178fb952a291d000b8c46ca2bd6ea41aa9b903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ArE3+Hmd6AgolnKTPcCFCMNfW18jxvIX4CT8T2H8IPWCZMKxAVH5LyhAV2TJHe5Vr8hio3qE4v5esusPLZnlDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T03:13:34.683119Z","bundle_sha256":"e6c7d098c588b68ababebd9b2afb594f75ffee145ef639908d64110bafc0811c"}}