{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NEGJAZSU5VDZ257N5BFQRKQRSD","short_pith_number":"pith:NEGJAZSU","canonical_record":{"source":{"id":"1106.3373","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T01:22:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b20c887776b4413b02b74526c3d2153cb9f7297f6ad06a8f38b26b4838e627c2","abstract_canon_sha256":"b52f98940006246468cfabf7e2d3a2112b48c34bd7d93eb6458830a9fa0b9a80"},"schema_version":"1.0"},"canonical_sha256":"690c906654ed479d77ede84b08aa1190e82509f6ce764ab23e73c01e3d43cbed","source":{"kind":"arxiv","id":"1106.3373","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3373","created_at":"2026-05-18T02:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3373v3","created_at":"2026-05-18T02:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3373","created_at":"2026-05-18T02:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"NEGJAZSU5VDZ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NEGJAZSU5VDZ257N","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NEGJAZSU","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NEGJAZSU5VDZ257N5BFQRKQRSD","target":"record","payload":{"canonical_record":{"source":{"id":"1106.3373","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T01:22:54Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b20c887776b4413b02b74526c3d2153cb9f7297f6ad06a8f38b26b4838e627c2","abstract_canon_sha256":"b52f98940006246468cfabf7e2d3a2112b48c34bd7d93eb6458830a9fa0b9a80"},"schema_version":"1.0"},"canonical_sha256":"690c906654ed479d77ede84b08aa1190e82509f6ce764ab23e73c01e3d43cbed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:01:35.925008Z","signature_b64":"vFvY7OiZfleGT+TWeZrJ8PC6zUUQ5TaMFxnlbM+iAARisA/Jjm2lfYzArEViUXxwfEEMs/8UexU+B3pgZepkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"690c906654ed479d77ede84b08aa1190e82509f6ce764ab23e73c01e3d43cbed","last_reissued_at":"2026-05-18T02:01:35.924288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:01:35.924288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.3373","source_version":3,"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-18T02:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oW2PzCCbOSHwejsKUNDERwaOdyLtCztuJFoACmW6UuoTdAHHhdg1KtnWRandNl4WXE5apv09AyH5yEVEi/KOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:38:17.670831Z"},"content_sha256":"c616e7ca6227bd79f18a2200bd702a9229531a6025c7c37ef6eb9cbd5edb949a","schema_version":"1.0","event_id":"sha256:c616e7ca6227bd79f18a2200bd702a9229531a6025c7c37ef6eb9cbd5edb949a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NEGJAZSU5VDZ257N5BFQRKQRSD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perturbation Analysis of Orthogonal Matching Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jie Ding, Laming Chen, Yuantao Gu","submitted_at":"2011-06-17T01:22:54Z","abstract_excerpt":"Orthogonal Matching Pursuit (OMP) is a canonical greedy pursuit algorithm for sparse approximation. Previous studies of OMP have mainly considered the exact recovery of a sparse signal $\\bm x$ through $\\bm \\Phi$ and $\\bm y=\\bm \\Phi \\bm x$, where $\\bm \\Phi$ is a matrix with more columns than rows. In this paper, based on Restricted Isometry Property (RIP), the performance of OMP is analyzed under general perturbations, which means both $\\bm y$ and $\\bm \\Phi$ are perturbed. Though exact recovery of an almost sparse signal $\\bm x$ is no longer feasible, the main contribution reveals that the exac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3373","kind":"arxiv","version":3},"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-18T02:01:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oruaKH9Nb05UOxNern8FAVe4f45AtJZhFV5GCecWU2buk7BQySSGf/RWG01yq/Cp8a2tUbn+xnlBZmD5MejMAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:38:17.671601Z"},"content_sha256":"6d94d46d6c25053d6e7b5a80f862e1da79ef6579ad75295c4b69f2d907fc4c7e","schema_version":"1.0","event_id":"sha256:6d94d46d6c25053d6e7b5a80f862e1da79ef6579ad75295c4b69f2d907fc4c7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEGJAZSU5VDZ257N5BFQRKQRSD/bundle.json","state_url":"https://pith.science/pith/NEGJAZSU5VDZ257N5BFQRKQRSD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEGJAZSU5VDZ257N5BFQRKQRSD/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-11T08:38:17Z","links":{"resolver":"https://pith.science/pith/NEGJAZSU5VDZ257N5BFQRKQRSD","bundle":"https://pith.science/pith/NEGJAZSU5VDZ257N5BFQRKQRSD/bundle.json","state":"https://pith.science/pith/NEGJAZSU5VDZ257N5BFQRKQRSD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEGJAZSU5VDZ257N5BFQRKQRSD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NEGJAZSU5VDZ257N5BFQRKQRSD","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":"b52f98940006246468cfabf7e2d3a2112b48c34bd7d93eb6458830a9fa0b9a80","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T01:22:54Z","title_canon_sha256":"b20c887776b4413b02b74526c3d2153cb9f7297f6ad06a8f38b26b4838e627c2"},"schema_version":"1.0","source":{"id":"1106.3373","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.3373","created_at":"2026-05-18T02:01:35Z"},{"alias_kind":"arxiv_version","alias_value":"1106.3373v3","created_at":"2026-05-18T02:01:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.3373","created_at":"2026-05-18T02:01:35Z"},{"alias_kind":"pith_short_12","alias_value":"NEGJAZSU5VDZ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NEGJAZSU5VDZ257N","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NEGJAZSU","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:6d94d46d6c25053d6e7b5a80f862e1da79ef6579ad75295c4b69f2d907fc4c7e","target":"graph","created_at":"2026-05-18T02:01:35Z","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":"Orthogonal Matching Pursuit (OMP) is a canonical greedy pursuit algorithm for sparse approximation. Previous studies of OMP have mainly considered the exact recovery of a sparse signal $\\bm x$ through $\\bm \\Phi$ and $\\bm y=\\bm \\Phi \\bm x$, where $\\bm \\Phi$ is a matrix with more columns than rows. In this paper, based on Restricted Isometry Property (RIP), the performance of OMP is analyzed under general perturbations, which means both $\\bm y$ and $\\bm \\Phi$ are perturbed. Though exact recovery of an almost sparse signal $\\bm x$ is no longer feasible, the main contribution reveals that the exac","authors_text":"Jie Ding, Laming Chen, Yuantao Gu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T01:22:54Z","title":"Perturbation Analysis of Orthogonal Matching Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.3373","kind":"arxiv","version":3},"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:c616e7ca6227bd79f18a2200bd702a9229531a6025c7c37ef6eb9cbd5edb949a","target":"record","created_at":"2026-05-18T02:01:35Z","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":"b52f98940006246468cfabf7e2d3a2112b48c34bd7d93eb6458830a9fa0b9a80","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-06-17T01:22:54Z","title_canon_sha256":"b20c887776b4413b02b74526c3d2153cb9f7297f6ad06a8f38b26b4838e627c2"},"schema_version":"1.0","source":{"id":"1106.3373","kind":"arxiv","version":3}},"canonical_sha256":"690c906654ed479d77ede84b08aa1190e82509f6ce764ab23e73c01e3d43cbed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"690c906654ed479d77ede84b08aa1190e82509f6ce764ab23e73c01e3d43cbed","first_computed_at":"2026-05-18T02:01:35.924288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:01:35.924288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vFvY7OiZfleGT+TWeZrJ8PC6zUUQ5TaMFxnlbM+iAARisA/Jjm2lfYzArEViUXxwfEEMs/8UexU+B3pgZepkCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:01:35.925008Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.3373","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c616e7ca6227bd79f18a2200bd702a9229531a6025c7c37ef6eb9cbd5edb949a","sha256:6d94d46d6c25053d6e7b5a80f862e1da79ef6579ad75295c4b69f2d907fc4c7e"],"state_sha256":"88cd52631a3926018c999263b314f4044979afada30675a6be515ea14111b005"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sh20ExEixgX+CIzHfWHjlf0O2uHERWD5pabgbVUrDUJ6FVdcQk0+yzsVMFqtgEgA14Ss0C9pubcw9bxeuWjtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:38:17.676087Z","bundle_sha256":"2f8e014c54a5d2a4a6f746e70a79acb15d3873f2747ddfcb8d637d35d298bbe3"}}