{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VH42YNED2C6H3MPITYB5L73IN7","short_pith_number":"pith:VH42YNED","canonical_record":{"source":{"id":"1111.6664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-29T01:49:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de0a3be0b00798fb8d2e40c4f0d3efb709d1aff1a09482ef14030840bfb78418","abstract_canon_sha256":"e22f74ac517153ba96c3c5de26d9c4375bd9cd9774fefc81fabdb59923953f39"},"schema_version":"1.0"},"canonical_sha256":"a9f9ac3483d0bc7db1e89e03d5ff686ff87b74ef45252f21d2ac0cf3edc538ec","source":{"kind":"arxiv","id":"1111.6664","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6664","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6664v2","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6664","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"VH42YNED2C6H","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VH42YNED2C6H3MPI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VH42YNED","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VH42YNED2C6H3MPITYB5L73IN7","target":"record","payload":{"canonical_record":{"source":{"id":"1111.6664","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-29T01:49:50Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"de0a3be0b00798fb8d2e40c4f0d3efb709d1aff1a09482ef14030840bfb78418","abstract_canon_sha256":"e22f74ac517153ba96c3c5de26d9c4375bd9cd9774fefc81fabdb59923953f39"},"schema_version":"1.0"},"canonical_sha256":"a9f9ac3483d0bc7db1e89e03d5ff686ff87b74ef45252f21d2ac0cf3edc538ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:18.782967Z","signature_b64":"sME3HPHY8cCt+CU8Smpo5VxgS5rAdCOeTyMqIwoNhAU9AT0Ib9Tdjj5wFKHR7fww04prrVAulxWaOiINwHBKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9f9ac3483d0bc7db1e89e03d5ff686ff87b74ef45252f21d2ac0cf3edc538ec","last_reissued_at":"2026-05-18T02:55:18.782541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:18.782541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.6664","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-18T02:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PrVxWUtep4dxxBuriIOI1oUwkreS5VaOYnfHKQNwvj8iWUzEJRulbalFN44TDx4bjuhnf64434OZcDuJTJDcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:52:23.382711Z"},"content_sha256":"4e3f71f56bcfcad62dc696eeb5f06686a721c6658314b2dcf439a0c521232e65","schema_version":"1.0","event_id":"sha256:4e3f71f56bcfcad62dc696eeb5f06686a721c6658314b2dcf439a0c521232e65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VH42YNED2C6H3MPITYB5L73IN7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Generalized Orthogonal Matching Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Byonghyo Shim, Jian Wang, Seokbeop Kwon","submitted_at":"2011-11-29T01:49:50Z","abstract_excerpt":"As a greedy algorithm to recover sparse signals from compressed measurements, orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the OMP for pursuing efficiency in reconstructing sparse signals. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple $N$ indices are identified per iteration. Owing to the selection of multiple ''correct'' indices, the gOMP algorithm is finished with much smaller number of iterations when compared to the OM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6664","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-18T02:55:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nw1jJmPbnyNhxEhQtWk17x4n++KqNsGoKe/P/hJZ8hyF/hh1c6WCYO6/r32/hR3HWro5V+z4LZTLrWkXbSFDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:52:23.383384Z"},"content_sha256":"b826543d6a5362d1e5ca53fe0816e212a3e35f99f919293e37d6d9ac34c17b6a","schema_version":"1.0","event_id":"sha256:b826543d6a5362d1e5ca53fe0816e212a3e35f99f919293e37d6d9ac34c17b6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7/bundle.json","state_url":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VH42YNED2C6H3MPITYB5L73IN7/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-05-25T19:52:23Z","links":{"resolver":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7","bundle":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7/bundle.json","state":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VH42YNED2C6H3MPITYB5L73IN7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VH42YNED2C6H3MPITYB5L73IN7","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":"e22f74ac517153ba96c3c5de26d9c4375bd9cd9774fefc81fabdb59923953f39","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-29T01:49:50Z","title_canon_sha256":"de0a3be0b00798fb8d2e40c4f0d3efb709d1aff1a09482ef14030840bfb78418"},"schema_version":"1.0","source":{"id":"1111.6664","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6664","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6664v2","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6664","created_at":"2026-05-18T02:55:18Z"},{"alias_kind":"pith_short_12","alias_value":"VH42YNED2C6H","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VH42YNED2C6H3MPI","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VH42YNED","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:b826543d6a5362d1e5ca53fe0816e212a3e35f99f919293e37d6d9ac34c17b6a","target":"graph","created_at":"2026-05-18T02:55:18Z","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":"As a greedy algorithm to recover sparse signals from compressed measurements, orthogonal matching pursuit (OMP) algorithm has received much attention in recent years. In this paper, we introduce an extension of the OMP for pursuing efficiency in reconstructing sparse signals. Our approach, henceforth referred to as generalized OMP (gOMP), is literally a generalization of the OMP in the sense that multiple $N$ indices are identified per iteration. Owing to the selection of multiple ''correct'' indices, the gOMP algorithm is finished with much smaller number of iterations when compared to the OM","authors_text":"Byonghyo Shim, Jian Wang, Seokbeop Kwon","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-29T01:49:50Z","title":"Generalized Orthogonal Matching Pursuit"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6664","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:4e3f71f56bcfcad62dc696eeb5f06686a721c6658314b2dcf439a0c521232e65","target":"record","created_at":"2026-05-18T02:55:18Z","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":"e22f74ac517153ba96c3c5de26d9c4375bd9cd9774fefc81fabdb59923953f39","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-29T01:49:50Z","title_canon_sha256":"de0a3be0b00798fb8d2e40c4f0d3efb709d1aff1a09482ef14030840bfb78418"},"schema_version":"1.0","source":{"id":"1111.6664","kind":"arxiv","version":2}},"canonical_sha256":"a9f9ac3483d0bc7db1e89e03d5ff686ff87b74ef45252f21d2ac0cf3edc538ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9f9ac3483d0bc7db1e89e03d5ff686ff87b74ef45252f21d2ac0cf3edc538ec","first_computed_at":"2026-05-18T02:55:18.782541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:18.782541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sME3HPHY8cCt+CU8Smpo5VxgS5rAdCOeTyMqIwoNhAU9AT0Ib9Tdjj5wFKHR7fww04prrVAulxWaOiINwHBKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:18.782967Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6664","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e3f71f56bcfcad62dc696eeb5f06686a721c6658314b2dcf439a0c521232e65","sha256:b826543d6a5362d1e5ca53fe0816e212a3e35f99f919293e37d6d9ac34c17b6a"],"state_sha256":"303f55abc4350ea679e366f38cea9bf20ec6b25e4485db7b1a185c0a6bf73c95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PW87qI/Uw97pvvf+y+ijRe08S0Bde1Q1OHiotJZfAgSiCzQ6MJNvpap8UNQaMSt9bI5qU/Uq5M6rMSf5QRevBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:52:23.387125Z","bundle_sha256":"e5deb5d2e1900db85f4136c1e3e7432ae5879cc39e54af14d5640f9aedff5b3e"}}