{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:YY6474UHDQOPQPVLU65J5QE7I3","short_pith_number":"pith:YY6474UH","canonical_record":{"source":{"id":"0707.4203","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2007-07-28T02:38:43Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e6d8f423af7f533b04206e242cd0d2fb21a93fd65d286eee44810ee402f61c03","abstract_canon_sha256":"55624f166c58b3cbdbdd776061ff8a852eefba2f1f37040e7ab2065bbf350e8a"},"schema_version":"1.0"},"canonical_sha256":"c63dcff2871c1cf83eaba7ba9ec09f46f402828d9132f410961baa2fbd494d1b","source":{"kind":"arxiv","id":"0707.4203","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.4203","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"0707.4203v4","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.4203","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"YY6474UHDQOP","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"YY6474UHDQOPQPVL","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"YY6474UH","created_at":"2026-06-03T22:06:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:YY6474UHDQOPQPVLU65J5QE7I3","target":"record","payload":{"canonical_record":{"source":{"id":"0707.4203","kind":"arxiv","version":4},"metadata":{"license":"","primary_cat":"math.NA","submitted_at":"2007-07-28T02:38:43Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"e6d8f423af7f533b04206e242cd0d2fb21a93fd65d286eee44810ee402f61c03","abstract_canon_sha256":"55624f166c58b3cbdbdd776061ff8a852eefba2f1f37040e7ab2065bbf350e8a"},"schema_version":"1.0"},"canonical_sha256":"c63dcff2871c1cf83eaba7ba9ec09f46f402828d9132f410961baa2fbd494d1b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T22:06:01.629493Z","signature_b64":"OldjPM3r0G85ofttkojh9DzSuK9D66A1va/LIBhe1n8vj3quhMOcwtzSEOOYvDjpUyoLNQLJ25UkGqdU0yUzBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c63dcff2871c1cf83eaba7ba9ec09f46f402828d9132f410961baa2fbd494d1b","last_reissued_at":"2026-06-03T22:06:01.629074Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T22:06:01.629074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0707.4203","source_version":4,"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:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zXSpYeXYbFFMSwfrWYcSI4WAq7QNVJadoMAwq31Ak9XV8avAwHQBpoZL1xbgIlip2wLQjYwkYE9Yu9T8ho7ECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:49:38.309314Z"},"content_sha256":"8588948184d03a639e6c6e41a800ba7b9ece159ec803455f0359dde9652c0ffc","schema_version":"1.0","event_id":"sha256:8588948184d03a639e6c6e41a800ba7b9ece159ec803455f0359dde9652c0ffc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:YY6474UHDQOPQPVLU65J5QE7I3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Uniform Uncertainty Principle and signal recovery via Regularized Orthogonal Matching Pursuit","license":"","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Deanna Needell, Roman Vershynin","submitted_at":"2007-07-28T02:38:43Z","abstract_excerpt":"This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements -- L_1-minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of the Orthogonal Matching Pursuit (ROMP) which has advantages of both approaches: the speed and transparency of OMP and the strong uniform guarantees of the L_1-minimization. Our algorithm ROMP reconstructs a sparse signal in a number of iterations linear in the sparsity (in practice even logarithmic), and the reconstruction is exact provided the linear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.4203","kind":"arxiv","version":4},"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/0707.4203/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:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bL1JNr/XKQ9k/UcrcpvekzxftsJEIimk6IUTu/JjmULktWncAJD/p6g8BuyhypDU+udH8Wylc4qVgiNfpFrnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T04:49:38.309814Z"},"content_sha256":"b04879236e9708c3343072195c44d1c5ea30e3c73e532508d1d89fe8d004c43e","schema_version":"1.0","event_id":"sha256:b04879236e9708c3343072195c44d1c5ea30e3c73e532508d1d89fe8d004c43e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YY6474UHDQOPQPVLU65J5QE7I3/bundle.json","state_url":"https://pith.science/pith/YY6474UHDQOPQPVLU65J5QE7I3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YY6474UHDQOPQPVLU65J5QE7I3/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-08-07T04:49:38Z","links":{"resolver":"https://pith.science/pith/YY6474UHDQOPQPVLU65J5QE7I3","bundle":"https://pith.science/pith/YY6474UHDQOPQPVLU65J5QE7I3/bundle.json","state":"https://pith.science/pith/YY6474UHDQOPQPVLU65J5QE7I3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YY6474UHDQOPQPVLU65J5QE7I3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:YY6474UHDQOPQPVLU65J5QE7I3","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":"55624f166c58b3cbdbdd776061ff8a852eefba2f1f37040e7ab2065bbf350e8a","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2007-07-28T02:38:43Z","title_canon_sha256":"e6d8f423af7f533b04206e242cd0d2fb21a93fd65d286eee44810ee402f61c03"},"schema_version":"1.0","source":{"id":"0707.4203","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0707.4203","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"arxiv_version","alias_value":"0707.4203v4","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0707.4203","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_12","alias_value":"YY6474UHDQOP","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_16","alias_value":"YY6474UHDQOPQPVL","created_at":"2026-06-03T22:06:01Z"},{"alias_kind":"pith_short_8","alias_value":"YY6474UH","created_at":"2026-06-03T22:06:01Z"}],"graph_snapshots":[{"event_id":"sha256:b04879236e9708c3343072195c44d1c5ea30e3c73e532508d1d89fe8d004c43e","target":"graph","created_at":"2026-06-03T22:06:01Z","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/0707.4203/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper seeks to bridge the two major algorithmic approaches to sparse signal recovery from an incomplete set of linear measurements -- L_1-minimization methods and iterative methods (Matching Pursuits). We find a simple regularized version of the Orthogonal Matching Pursuit (ROMP) which has advantages of both approaches: the speed and transparency of OMP and the strong uniform guarantees of the L_1-minimization. Our algorithm ROMP reconstructs a sparse signal in a number of iterations linear in the sparsity (in practice even logarithmic), and the reconstruction is exact provided the linear","authors_text":"Deanna Needell, Roman Vershynin","cross_cats":["cs.NA"],"headline":"","license":"","primary_cat":"math.NA","submitted_at":"2007-07-28T02:38:43Z","title":"Uniform Uncertainty Principle and signal recovery via Regularized Orthogonal Matching Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0707.4203","kind":"arxiv","version":4},"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:8588948184d03a639e6c6e41a800ba7b9ece159ec803455f0359dde9652c0ffc","target":"record","created_at":"2026-06-03T22:06:01Z","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":"55624f166c58b3cbdbdd776061ff8a852eefba2f1f37040e7ab2065bbf350e8a","cross_cats_sorted":["cs.NA"],"license":"","primary_cat":"math.NA","submitted_at":"2007-07-28T02:38:43Z","title_canon_sha256":"e6d8f423af7f533b04206e242cd0d2fb21a93fd65d286eee44810ee402f61c03"},"schema_version":"1.0","source":{"id":"0707.4203","kind":"arxiv","version":4}},"canonical_sha256":"c63dcff2871c1cf83eaba7ba9ec09f46f402828d9132f410961baa2fbd494d1b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c63dcff2871c1cf83eaba7ba9ec09f46f402828d9132f410961baa2fbd494d1b","first_computed_at":"2026-06-03T22:06:01.629074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T22:06:01.629074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OldjPM3r0G85ofttkojh9DzSuK9D66A1va/LIBhe1n8vj3quhMOcwtzSEOOYvDjpUyoLNQLJ25UkGqdU0yUzBw==","signature_status":"signed_v1","signed_at":"2026-06-03T22:06:01.629493Z","signed_message":"canonical_sha256_bytes"},"source_id":"0707.4203","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8588948184d03a639e6c6e41a800ba7b9ece159ec803455f0359dde9652c0ffc","sha256:b04879236e9708c3343072195c44d1c5ea30e3c73e532508d1d89fe8d004c43e"],"state_sha256":"8cca7fffe69eb2fec16d3c71cd2ef850855cabaf08ee2ae4fd81e844ef261c8b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xg4kZigIk7HJ5rdFn+/k8G6brcRAgsd9RHpE+kiCRyrSR6QZ+hLtf32ov2/m9D7LzPilt1/g0Errqg69E/88DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T04:49:38.314585Z","bundle_sha256":"88b127ad3ac33df1d9569a07532e85bd697d121e09db7ff4cad8609ece00d1fb"}}