{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:74VTQDXUSJXHNHYOBJEFKYQAPT","short_pith_number":"pith:74VTQDXU","schema_version":"1.0","canonical_sha256":"ff2b380ef4926e769f0e0a485562007cff73ae6e953deff9049dec6c3d561c38","source":{"kind":"arxiv","id":"1210.5991","version":2},"attestation_state":"computed","paper":{"title":"Online Recovery Guarantees and Analytical Results for OMP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hakan Erdogan, Nazim Burak Karahanoglu","submitted_at":"2012-10-22T18:17:37Z","abstract_excerpt":"Orthogonal Matching Pursuit (OMP) is a simple, yet empirically competitive algorithm for sparse recovery. Recent developments have shown that OMP guarantees exact recovery of K-sparse signals with K or more than K iterations if the observation matrix satisfies the restricted isometry property (RIP) with some conditions. We develop RIP-based online guarantees for recovery of a K-sparse signal with more than K OMP iterations. Though these guarantees cannot be generalized to all sparse signals a priori, we show that they can still hold online when the state-of-the-art K-step recovery guarantees f"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1210.5991","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-22T18:17:37Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"24c83344cda68321cd9f49ad7e3a7a37762b07327ff0a20f6bcd3cf4b86c42a0","abstract_canon_sha256":"67d6f24f46ab3e28f3f77a8eca4a1da80419a4d193323fa9b4a02eba7af52939"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:37.534193Z","signature_b64":"mqYxxwnGyV7qSSEIWn4mRngkjfWT1y+mq8OiwcxaGo26Zp7oWfkgl9MHBT4u++WsVa33rmlC2Wf9C9uUpRd1Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff2b380ef4926e769f0e0a485562007cff73ae6e953deff9049dec6c3d561c38","last_reissued_at":"2026-05-18T03:29:37.533410Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:37.533410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Recovery Guarantees and Analytical Results for OMP","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hakan Erdogan, Nazim Burak Karahanoglu","submitted_at":"2012-10-22T18:17:37Z","abstract_excerpt":"Orthogonal Matching Pursuit (OMP) is a simple, yet empirically competitive algorithm for sparse recovery. Recent developments have shown that OMP guarantees exact recovery of K-sparse signals with K or more than K iterations if the observation matrix satisfies the restricted isometry property (RIP) with some conditions. We develop RIP-based online guarantees for recovery of a K-sparse signal with more than K OMP iterations. Though these guarantees cannot be generalized to all sparse signals a priori, we show that they can still hold online when the state-of-the-art K-step recovery guarantees f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5991","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1210.5991","created_at":"2026-05-18T03:29:37.533545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.5991v2","created_at":"2026-05-18T03:29:37.533545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5991","created_at":"2026-05-18T03:29:37.533545+00:00"},{"alias_kind":"pith_short_12","alias_value":"74VTQDXUSJXH","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"74VTQDXUSJXHNHYO","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"74VTQDXU","created_at":"2026-05-18T12:26:56.085431+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT","json":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT.json","graph_json":"https://pith.science/api/pith-number/74VTQDXUSJXHNHYOBJEFKYQAPT/graph.json","events_json":"https://pith.science/api/pith-number/74VTQDXUSJXHNHYOBJEFKYQAPT/events.json","paper":"https://pith.science/paper/74VTQDXU"},"agent_actions":{"view_html":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT","download_json":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT.json","view_paper":"https://pith.science/paper/74VTQDXU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.5991&json=true","fetch_graph":"https://pith.science/api/pith-number/74VTQDXUSJXHNHYOBJEFKYQAPT/graph.json","fetch_events":"https://pith.science/api/pith-number/74VTQDXUSJXHNHYOBJEFKYQAPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/action/storage_attestation","attest_author":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/action/author_attestation","sign_citation":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/action/citation_signature","submit_replication":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/action/replication_record"}},"created_at":"2026-05-18T03:29:37.533545+00:00","updated_at":"2026-05-18T03:29:37.533545+00:00"}