{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:74VTQDXUSJXHNHYOBJEFKYQAPT","short_pith_number":"pith:74VTQDXU","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"},"canonical_sha256":"ff2b380ef4926e769f0e0a485562007cff73ae6e953deff9049dec6c3d561c38","source":{"kind":"arxiv","id":"1210.5991","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5991","created_at":"2026-05-18T03:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5991v2","created_at":"2026-05-18T03:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5991","created_at":"2026-05-18T03:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"74VTQDXUSJXH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"74VTQDXUSJXHNHYO","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"74VTQDXU","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:74VTQDXUSJXHNHYOBJEFKYQAPT","target":"record","payload":{"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"},"canonical_sha256":"ff2b380ef4926e769f0e0a485562007cff73ae6e953deff9049dec6c3d561c38","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"},"source_kind":"arxiv","source_id":"1210.5991","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:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQgp9wOR9GkbG6h5fRoEP6+/qfd/fMS0I/psMi7VzuvetEhbws5vIqFXG273xzPj0aW2gcXFoSOuo686eftYCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:22:47.065691Z"},"content_sha256":"f5f8b33bd15ed2a53af3d4e255e3e14433b3b9acbbd707e8d10a4fc8fa7aa43f","schema_version":"1.0","event_id":"sha256:f5f8b33bd15ed2a53af3d4e255e3e14433b3b9acbbd707e8d10a4fc8fa7aa43f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:74VTQDXUSJXHNHYOBJEFKYQAPT","target":"graph","payload":{"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"},"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:29:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/qyu7H7EdC3Hfhv9Iq5MTW2lSrKf6s26+ISMFJQXsQifda5n8MMWLniTVoCT58IPiZBvxxmryPw6um4zNdvcAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:22:47.066043Z"},"content_sha256":"9b86308d5f265d05181701559ccee9b9cb47226a1c734cf378c2ddddd01b4fd8","schema_version":"1.0","event_id":"sha256:9b86308d5f265d05181701559ccee9b9cb47226a1c734cf378c2ddddd01b4fd8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/bundle.json","state_url":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/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-24T22:22:47Z","links":{"resolver":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT","bundle":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/bundle.json","state":"https://pith.science/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74VTQDXUSJXHNHYOBJEFKYQAPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:74VTQDXUSJXHNHYOBJEFKYQAPT","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":"67d6f24f46ab3e28f3f77a8eca4a1da80419a4d193323fa9b4a02eba7af52939","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-22T18:17:37Z","title_canon_sha256":"24c83344cda68321cd9f49ad7e3a7a37762b07327ff0a20f6bcd3cf4b86c42a0"},"schema_version":"1.0","source":{"id":"1210.5991","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.5991","created_at":"2026-05-18T03:29:37Z"},{"alias_kind":"arxiv_version","alias_value":"1210.5991v2","created_at":"2026-05-18T03:29:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.5991","created_at":"2026-05-18T03:29:37Z"},{"alias_kind":"pith_short_12","alias_value":"74VTQDXUSJXH","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"74VTQDXUSJXHNHYO","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"74VTQDXU","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:9b86308d5f265d05181701559ccee9b9cb47226a1c734cf378c2ddddd01b4fd8","target":"graph","created_at":"2026-05-18T03:29:37Z","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 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","authors_text":"Hakan Erdogan, Nazim Burak Karahanoglu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-22T18:17:37Z","title":"Online Recovery Guarantees and Analytical Results for OMP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.5991","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:f5f8b33bd15ed2a53af3d4e255e3e14433b3b9acbbd707e8d10a4fc8fa7aa43f","target":"record","created_at":"2026-05-18T03:29:37Z","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":"67d6f24f46ab3e28f3f77a8eca4a1da80419a4d193323fa9b4a02eba7af52939","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-10-22T18:17:37Z","title_canon_sha256":"24c83344cda68321cd9f49ad7e3a7a37762b07327ff0a20f6bcd3cf4b86c42a0"},"schema_version":"1.0","source":{"id":"1210.5991","kind":"arxiv","version":2}},"canonical_sha256":"ff2b380ef4926e769f0e0a485562007cff73ae6e953deff9049dec6c3d561c38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff2b380ef4926e769f0e0a485562007cff73ae6e953deff9049dec6c3d561c38","first_computed_at":"2026-05-18T03:29:37.533410Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:37.533410Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mqYxxwnGyV7qSSEIWn4mRngkjfWT1y+mq8OiwcxaGo26Zp7oWfkgl9MHBT4u++WsVa33rmlC2Wf9C9uUpRd1Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:37.534193Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.5991","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5f8b33bd15ed2a53af3d4e255e3e14433b3b9acbbd707e8d10a4fc8fa7aa43f","sha256:9b86308d5f265d05181701559ccee9b9cb47226a1c734cf378c2ddddd01b4fd8"],"state_sha256":"53758460e7bfae3265dfedaacca8eaa5a1b630bfe97d4d5c780d0a5ce11815f8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aFFHidWGdJvssCHMul2TRVEvf5Fqj+2Qg03W8iBYwf6u45TGbpxSThRNRHBfuKp0lGOya5RLTv9uS8WFGFSuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:22:47.068007Z","bundle_sha256":"a3a7c4fe056ce3530fb50d75942117bf5347bc2332000b391d9108481cf71c4f"}}