{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4ILISCHFOIDEX5IYLX244MISGD","short_pith_number":"pith:4ILISCHF","schema_version":"1.0","canonical_sha256":"e2168908e572064bf5185df5ce311230d4fa0967d9e614fc3d52114a9ef43a23","source":{"kind":"arxiv","id":"1101.4458","version":4},"attestation_state":"computed","paper":{"title":"Remarks on the Restricted Isometry Property in Orthogonal Matching Pursuit algorithm","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qun Mo, Yi Shen","submitted_at":"2011-01-24T07:49:23Z","abstract_excerpt":"This paper demonstrates theoretically that if the restricted isometry constant $\\delta_K$ of the compressed sensing matrix satisfies $$ \\delta_{K+1} < \\frac{1}{\\sqrt{K}+1}, $$ then a greedy algorithm called Orthogonal Matching Pursuit (OMP) can recover a signal with $K$ nonzero entries in $K$ iterations. In contrast, matrices are also constructed with restricted isometry constant $$ \\delta_{K+1} = \\frac{1}{\\sqrt{K}} $$ such that OMP can not recover $K$-sparse $x$ in $K$ iterations. This result shows that the conjecture given by Dai and Milenkovic is ture."},"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":"1101.4458","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.IT","submitted_at":"2011-01-24T07:49:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"99518d6ff9004d5f907f02d5318ddbfafdff2a8fab0ef9375c3bde6e8b14fb01","abstract_canon_sha256":"10d993b4f05c0fe12f977ddb2ef2b612f8d0e960294c82c8a852a643cebd0681"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:42.445700Z","signature_b64":"CH0XU31wg29WWgYpmrMlxVEwioc7UWbm3glNVCZAgQlh7F+xy4AvpmRhcK01QsWws0h6TLaZqrDucfAlW1Y6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2168908e572064bf5185df5ce311230d4fa0967d9e614fc3d52114a9ef43a23","last_reissued_at":"2026-05-18T04:04:42.445064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:42.445064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Remarks on the Restricted Isometry Property in Orthogonal Matching Pursuit algorithm","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Qun Mo, Yi Shen","submitted_at":"2011-01-24T07:49:23Z","abstract_excerpt":"This paper demonstrates theoretically that if the restricted isometry constant $\\delta_K$ of the compressed sensing matrix satisfies $$ \\delta_{K+1} < \\frac{1}{\\sqrt{K}+1}, $$ then a greedy algorithm called Orthogonal Matching Pursuit (OMP) can recover a signal with $K$ nonzero entries in $K$ iterations. In contrast, matrices are also constructed with restricted isometry constant $$ \\delta_{K+1} = \\frac{1}{\\sqrt{K}} $$ such that OMP can not recover $K$-sparse $x$ in $K$ iterations. This result shows that the conjecture given by Dai and Milenkovic is ture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.4458","kind":"arxiv","version":4},"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":"1101.4458","created_at":"2026-05-18T04:04:42.445152+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.4458v4","created_at":"2026-05-18T04:04:42.445152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.4458","created_at":"2026-05-18T04:04:42.445152+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ILISCHFOIDE","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ILISCHFOIDEX5IY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ILISCHF","created_at":"2026-05-18T12:26:20.644004+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/4ILISCHFOIDEX5IYLX244MISGD","json":"https://pith.science/pith/4ILISCHFOIDEX5IYLX244MISGD.json","graph_json":"https://pith.science/api/pith-number/4ILISCHFOIDEX5IYLX244MISGD/graph.json","events_json":"https://pith.science/api/pith-number/4ILISCHFOIDEX5IYLX244MISGD/events.json","paper":"https://pith.science/paper/4ILISCHF"},"agent_actions":{"view_html":"https://pith.science/pith/4ILISCHFOIDEX5IYLX244MISGD","download_json":"https://pith.science/pith/4ILISCHFOIDEX5IYLX244MISGD.json","view_paper":"https://pith.science/paper/4ILISCHF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.4458&json=true","fetch_graph":"https://pith.science/api/pith-number/4ILISCHFOIDEX5IYLX244MISGD/graph.json","fetch_events":"https://pith.science/api/pith-number/4ILISCHFOIDEX5IYLX244MISGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ILISCHFOIDEX5IYLX244MISGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ILISCHFOIDEX5IYLX244MISGD/action/storage_attestation","attest_author":"https://pith.science/pith/4ILISCHFOIDEX5IYLX244MISGD/action/author_attestation","sign_citation":"https://pith.science/pith/4ILISCHFOIDEX5IYLX244MISGD/action/citation_signature","submit_replication":"https://pith.science/pith/4ILISCHFOIDEX5IYLX244MISGD/action/replication_record"}},"created_at":"2026-05-18T04:04:42.445152+00:00","updated_at":"2026-05-18T04:04:42.445152+00:00"}