{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:I3XFOFFEDHJYBZP5UL4ODJGDVS","short_pith_number":"pith:I3XFOFFE","schema_version":"1.0","canonical_sha256":"46ee5714a419d380e5fda2f8e1a4c3aca6ede3d77fdf97ad62d9e6a863c6a99b","source":{"kind":"arxiv","id":"1302.0490","version":1},"attestation_state":"computed","paper":{"title":"Improved Bounds on RIP 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":"Mrityunjoy Chakraborty, Rajib Lochan Das, Siddhartha Satpathi","submitted_at":"2013-02-03T13:40:49Z","abstract_excerpt":"Generalized Orthogonal Matching Pursuit (gOMP) is a natural extension of OMP algorithm where unlike OMP, it may select $N (\\geq1)$ atoms in each iteration. In this paper, we demonstrate that gOMP can successfully reconstruct a $K$-sparse signal from a compressed measurement $ {\\bf y}={\\bf \\Phi x}$ by $K^{th}$ iteration if the sensing matrix ${\\bf \\Phi}$ satisfies restricted isometry property (RIP) of order $NK$ where $\\delta_{NK} < \\frac {\\sqrt{N}}{\\sqrt{K}+2\\sqrt{N}}$. Our bound offers an improvement over the very recent result shown in \\cite{wang_2012b}. Moreover, we present another bound fo"},"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":"1302.0490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-02-03T13:40:49Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"bd21c5140dd9a52d56ca59ae84930f1ffe783b4219adc7223a963b8095727879","abstract_canon_sha256":"7e2cfd8d0c14803a1c3055dcbdc26b1197ef0d5233457add57ca5c90eedde2a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:51:51.042909Z","signature_b64":"3mitkt1/fY+Ln9RwH2BCuU6aheAKXOmG/US6pqYE1bYzMlL3nNGAfYQk8oZasslaVgVFlv/TnmuBrsMpxSULCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46ee5714a419d380e5fda2f8e1a4c3aca6ede3d77fdf97ad62d9e6a863c6a99b","last_reissued_at":"2026-05-18T01:51:51.042526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:51:51.042526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Bounds on RIP 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":"Mrityunjoy Chakraborty, Rajib Lochan Das, Siddhartha Satpathi","submitted_at":"2013-02-03T13:40:49Z","abstract_excerpt":"Generalized Orthogonal Matching Pursuit (gOMP) is a natural extension of OMP algorithm where unlike OMP, it may select $N (\\geq1)$ atoms in each iteration. In this paper, we demonstrate that gOMP can successfully reconstruct a $K$-sparse signal from a compressed measurement $ {\\bf y}={\\bf \\Phi x}$ by $K^{th}$ iteration if the sensing matrix ${\\bf \\Phi}$ satisfies restricted isometry property (RIP) of order $NK$ where $\\delta_{NK} < \\frac {\\sqrt{N}}{\\sqrt{K}+2\\sqrt{N}}$. Our bound offers an improvement over the very recent result shown in \\cite{wang_2012b}. Moreover, we present another bound fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0490","kind":"arxiv","version":1},"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":"1302.0490","created_at":"2026-05-18T01:51:51.042584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0490v1","created_at":"2026-05-18T01:51:51.042584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0490","created_at":"2026-05-18T01:51:51.042584+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3XFOFFEDHJY","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3XFOFFEDHJYBZP5","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3XFOFFE","created_at":"2026-05-18T12:27:46.883200+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/I3XFOFFEDHJYBZP5UL4ODJGDVS","json":"https://pith.science/pith/I3XFOFFEDHJYBZP5UL4ODJGDVS.json","graph_json":"https://pith.science/api/pith-number/I3XFOFFEDHJYBZP5UL4ODJGDVS/graph.json","events_json":"https://pith.science/api/pith-number/I3XFOFFEDHJYBZP5UL4ODJGDVS/events.json","paper":"https://pith.science/paper/I3XFOFFE"},"agent_actions":{"view_html":"https://pith.science/pith/I3XFOFFEDHJYBZP5UL4ODJGDVS","download_json":"https://pith.science/pith/I3XFOFFEDHJYBZP5UL4ODJGDVS.json","view_paper":"https://pith.science/paper/I3XFOFFE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0490&json=true","fetch_graph":"https://pith.science/api/pith-number/I3XFOFFEDHJYBZP5UL4ODJGDVS/graph.json","fetch_events":"https://pith.science/api/pith-number/I3XFOFFEDHJYBZP5UL4ODJGDVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3XFOFFEDHJYBZP5UL4ODJGDVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3XFOFFEDHJYBZP5UL4ODJGDVS/action/storage_attestation","attest_author":"https://pith.science/pith/I3XFOFFEDHJYBZP5UL4ODJGDVS/action/author_attestation","sign_citation":"https://pith.science/pith/I3XFOFFEDHJYBZP5UL4ODJGDVS/action/citation_signature","submit_replication":"https://pith.science/pith/I3XFOFFEDHJYBZP5UL4ODJGDVS/action/replication_record"}},"created_at":"2026-05-18T01:51:51.042584+00:00","updated_at":"2026-05-18T01:51:51.042584+00:00"}