{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VH42YNED2C6H3MPITYB5L73IN7","short_pith_number":"pith:VH42YNED","schema_version":"1.0","canonical_sha256":"a9f9ac3483d0bc7db1e89e03d5ff686ff87b74ef45252f21d2ac0cf3edc538ec","source":{"kind":"arxiv","id":"1111.6664","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.6664","created_at":"2026-05-18T02:55:18.782606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.6664v2","created_at":"2026-05-18T02:55:18.782606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6664","created_at":"2026-05-18T02:55:18.782606+00:00"},{"alias_kind":"pith_short_12","alias_value":"VH42YNED2C6H","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VH42YNED2C6H3MPI","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VH42YNED","created_at":"2026-05-18T12:26:44.992195+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/VH42YNED2C6H3MPITYB5L73IN7","json":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7.json","graph_json":"https://pith.science/api/pith-number/VH42YNED2C6H3MPITYB5L73IN7/graph.json","events_json":"https://pith.science/api/pith-number/VH42YNED2C6H3MPITYB5L73IN7/events.json","paper":"https://pith.science/paper/VH42YNED"},"agent_actions":{"view_html":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7","download_json":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7.json","view_paper":"https://pith.science/paper/VH42YNED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.6664&json=true","fetch_graph":"https://pith.science/api/pith-number/VH42YNED2C6H3MPITYB5L73IN7/graph.json","fetch_events":"https://pith.science/api/pith-number/VH42YNED2C6H3MPITYB5L73IN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7/action/storage_attestation","attest_author":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7/action/author_attestation","sign_citation":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7/action/citation_signature","submit_replication":"https://pith.science/pith/VH42YNED2C6H3MPITYB5L73IN7/action/replication_record"}},"created_at":"2026-05-18T02:55:18.782606+00:00","updated_at":"2026-05-18T02:55:18.782606+00:00"}