{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:BSFMGO35MEQCPICLKLBUOR23BR","short_pith_number":"pith:BSFMGO35","schema_version":"1.0","canonical_sha256":"0c8ac33b7d612027a04b52c347475b0c719f318f06d302d912b42678371c4850","source":{"kind":"arxiv","id":"1603.01507","version":2},"attestation_state":"computed","paper":{"title":"A Novel Sufficient Condition for Generalized Orthogonal Matching Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongfang Li, Jinming Wen, Xiaohu Tang, Zhengchun Zhou","submitted_at":"2016-03-04T15:41:33Z","abstract_excerpt":"Generalized orthogonal matching pursuit (gOMP), also called orthogonal multi-matching pursuit, is an extension of OMP in the sense that $N\\geq1$ indices are identified per iteration. In this paper, we show that if the restricted isometry constant (RIC) $\\delta_{NK+1}$ of a sensing matrix $\\A$ satisfies $\\delta_{NK+1} < 1/\\sqrt {K/N+1}$, then under a condition on the signal-to-noise ratio, gOMP identifies at least one index in the support of any $K$-sparse signal $\\x$ from $\\y=\\A\\x+\\v$ at each iteration, where $\\v$ is a noise vector. Surprisingly, this condition does not require $N\\leq K$ which"},"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":"1603.01507","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-03-04T15:41:33Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"1cbf08e1ebaa26a1928a3525d46894635f8c479d65b99fe07edf42605b0bd52e","abstract_canon_sha256":"fb736f97c172a3e8a66316ffdcca38ced5b99908beafa328c2e1870154ce1b3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:47.929356Z","signature_b64":"u06LNZaov/y6iuXLfUCl2gMiTum7wrdpQycxWtgL5jCQQyBB62dyn6GNDS59LbF+7MK8R3T+jIPnobYj2zT/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c8ac33b7d612027a04b52c347475b0c719f318f06d302d912b42678371c4850","last_reissued_at":"2026-05-18T00:54:47.928890Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:47.928890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Sufficient Condition for Generalized Orthogonal Matching Pursuit","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Dongfang Li, Jinming Wen, Xiaohu Tang, Zhengchun Zhou","submitted_at":"2016-03-04T15:41:33Z","abstract_excerpt":"Generalized orthogonal matching pursuit (gOMP), also called orthogonal multi-matching pursuit, is an extension of OMP in the sense that $N\\geq1$ indices are identified per iteration. In this paper, we show that if the restricted isometry constant (RIC) $\\delta_{NK+1}$ of a sensing matrix $\\A$ satisfies $\\delta_{NK+1} < 1/\\sqrt {K/N+1}$, then under a condition on the signal-to-noise ratio, gOMP identifies at least one index in the support of any $K$-sparse signal $\\x$ from $\\y=\\A\\x+\\v$ at each iteration, where $\\v$ is a noise vector. Surprisingly, this condition does not require $N\\leq K$ which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01507","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":"1603.01507","created_at":"2026-05-18T00:54:47.928971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01507v2","created_at":"2026-05-18T00:54:47.928971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01507","created_at":"2026-05-18T00:54:47.928971+00:00"},{"alias_kind":"pith_short_12","alias_value":"BSFMGO35MEQC","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_16","alias_value":"BSFMGO35MEQCPICL","created_at":"2026-05-18T12:30:07.202191+00:00"},{"alias_kind":"pith_short_8","alias_value":"BSFMGO35","created_at":"2026-05-18T12:30:07.202191+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/BSFMGO35MEQCPICLKLBUOR23BR","json":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR.json","graph_json":"https://pith.science/api/pith-number/BSFMGO35MEQCPICLKLBUOR23BR/graph.json","events_json":"https://pith.science/api/pith-number/BSFMGO35MEQCPICLKLBUOR23BR/events.json","paper":"https://pith.science/paper/BSFMGO35"},"agent_actions":{"view_html":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR","download_json":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR.json","view_paper":"https://pith.science/paper/BSFMGO35","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01507&json=true","fetch_graph":"https://pith.science/api/pith-number/BSFMGO35MEQCPICLKLBUOR23BR/graph.json","fetch_events":"https://pith.science/api/pith-number/BSFMGO35MEQCPICLKLBUOR23BR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR/action/storage_attestation","attest_author":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR/action/author_attestation","sign_citation":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR/action/citation_signature","submit_replication":"https://pith.science/pith/BSFMGO35MEQCPICLKLBUOR23BR/action/replication_record"}},"created_at":"2026-05-18T00:54:47.928971+00:00","updated_at":"2026-05-18T00:54:47.928971+00:00"}