{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L3OUFUU2NAVERHWBTXZC6B6HKA","short_pith_number":"pith:L3OUFUU2","schema_version":"1.0","canonical_sha256":"5edd42d29a682a489ec19df22f07c750245936caedfda189754a47673fc792de","source":{"kind":"arxiv","id":"1904.09398","version":1},"attestation_state":"computed","paper":{"title":"Exact Sparse Signal Recovery via Orthogonal Matching Pursuit with Prior Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinming Wen, Wei Yu","submitted_at":"2019-04-20T03:58:44Z","abstract_excerpt":"The orthogonal matching pursuit (OMP) algorithm is a commonly used algorithm for recovering $K$-sparse signals $\\x\\in \\mathbb{R}^{n}$ from linear model $\\y=\\A\\x$, where $\\A\\in \\mathbb{R}^{m\\times n}$ is a sensing matrix. A fundamental question in the performance analysis of OMP is the characterization of the probability that it can exactly recover $\\x$ for random matrix $\\A$. Although in many practical applications, in addition to the sparsity, $\\x$ usually also has some additional property (for example, the nonzero entries of $\\x$ independently and identically follow the Gaussian distribution"},"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":"1904.09398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-04-20T03:58:44Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"60cbb1596fbb2ed0d3e7b58a1a25e1040e967bf6bb7c669a2eb82d15b1611baa","abstract_canon_sha256":"99468167b3e0a9e04a80e7295c5834aa88bcb372510273d143226cde671295a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:07.200177Z","signature_b64":"IAC0nAlBkvvzY/1zH+9u+J9YmilZSkDbrxX7WTvKacjozIc1Gca5RRseNH0rtBCtAk7ou+MA3nSzdpDyoLXMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5edd42d29a682a489ec19df22f07c750245936caedfda189754a47673fc792de","last_reissued_at":"2026-05-17T23:48:07.199620Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:07.199620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Sparse Signal Recovery via Orthogonal Matching Pursuit with Prior Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinming Wen, Wei Yu","submitted_at":"2019-04-20T03:58:44Z","abstract_excerpt":"The orthogonal matching pursuit (OMP) algorithm is a commonly used algorithm for recovering $K$-sparse signals $\\x\\in \\mathbb{R}^{n}$ from linear model $\\y=\\A\\x$, where $\\A\\in \\mathbb{R}^{m\\times n}$ is a sensing matrix. A fundamental question in the performance analysis of OMP is the characterization of the probability that it can exactly recover $\\x$ for random matrix $\\A$. Although in many practical applications, in addition to the sparsity, $\\x$ usually also has some additional property (for example, the nonzero entries of $\\x$ independently and identically follow the Gaussian distribution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09398","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":"1904.09398","created_at":"2026-05-17T23:48:07.199705+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.09398v1","created_at":"2026-05-17T23:48:07.199705+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09398","created_at":"2026-05-17T23:48:07.199705+00:00"},{"alias_kind":"pith_short_12","alias_value":"L3OUFUU2NAVE","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"L3OUFUU2NAVERHWB","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"L3OUFUU2","created_at":"2026-05-18T12:33:21.387695+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/L3OUFUU2NAVERHWBTXZC6B6HKA","json":"https://pith.science/pith/L3OUFUU2NAVERHWBTXZC6B6HKA.json","graph_json":"https://pith.science/api/pith-number/L3OUFUU2NAVERHWBTXZC6B6HKA/graph.json","events_json":"https://pith.science/api/pith-number/L3OUFUU2NAVERHWBTXZC6B6HKA/events.json","paper":"https://pith.science/paper/L3OUFUU2"},"agent_actions":{"view_html":"https://pith.science/pith/L3OUFUU2NAVERHWBTXZC6B6HKA","download_json":"https://pith.science/pith/L3OUFUU2NAVERHWBTXZC6B6HKA.json","view_paper":"https://pith.science/paper/L3OUFUU2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.09398&json=true","fetch_graph":"https://pith.science/api/pith-number/L3OUFUU2NAVERHWBTXZC6B6HKA/graph.json","fetch_events":"https://pith.science/api/pith-number/L3OUFUU2NAVERHWBTXZC6B6HKA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L3OUFUU2NAVERHWBTXZC6B6HKA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L3OUFUU2NAVERHWBTXZC6B6HKA/action/storage_attestation","attest_author":"https://pith.science/pith/L3OUFUU2NAVERHWBTXZC6B6HKA/action/author_attestation","sign_citation":"https://pith.science/pith/L3OUFUU2NAVERHWBTXZC6B6HKA/action/citation_signature","submit_replication":"https://pith.science/pith/L3OUFUU2NAVERHWBTXZC6B6HKA/action/replication_record"}},"created_at":"2026-05-17T23:48:07.199705+00:00","updated_at":"2026-05-17T23:48:07.199705+00:00"}