{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KMRGQ6G3LS5SIBGDTJIC2GOTLN","short_pith_number":"pith:KMRGQ6G3","schema_version":"1.0","canonical_sha256":"53226878db5cbb2404c39a502d19d35b4fa09214fa622245fd5064efbe2fd541","source":{"kind":"arxiv","id":"1912.13091","version":1},"attestation_state":"computed","paper":{"title":"Basis Pursuit and Orthogonal Matching Pursuit for Subspace-preserving Recovery: Theoretical Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chong You, Daniel P. Robinson, Rene Vidal","submitted_at":"2019-12-30T21:31:15Z","abstract_excerpt":"Given an overcomplete dictionary $A$ and a signal $b = Ac^*$ for some sparse vector $c^*$ whose nonzero entries correspond to linearly independent columns of $A$, classical sparse signal recovery theory considers the problem of whether $c^*$ can be recovered as the unique sparsest solution to $b = A c$. It is now well-understood that such recovery is possible by practical algorithms when the dictionary $A$ is incoherent or restricted isometric. In this paper, we consider the more general case where $b$ lies in a subspace $\\mathcal{S}_0$ spanned by a subset of linearly dependent columns of $A$,"},"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":"1912.13091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-12-30T21:31:15Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"4b13e7f131e33c34c135de80ed1781c20a134da3c25c66ab1b68434b9700a827","abstract_canon_sha256":"760054ba425d0b9c51d6994703fa690283fdfbc51feea8f19274f8607466f7a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:06.018175Z","signature_b64":"/bDUDS0wrihuaTW0mIF9mk8gT0iUYCPiP55cpTv6nX3UZWSJLAMRMyjX+Wk8wYRHszqqWg4W7QHqt9G+8PjyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"53226878db5cbb2404c39a502d19d35b4fa09214fa622245fd5064efbe2fd541","last_reissued_at":"2026-07-05T00:29:06.017834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:06.017834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Basis Pursuit and Orthogonal Matching Pursuit for Subspace-preserving Recovery: Theoretical Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chong You, Daniel P. Robinson, Rene Vidal","submitted_at":"2019-12-30T21:31:15Z","abstract_excerpt":"Given an overcomplete dictionary $A$ and a signal $b = Ac^*$ for some sparse vector $c^*$ whose nonzero entries correspond to linearly independent columns of $A$, classical sparse signal recovery theory considers the problem of whether $c^*$ can be recovered as the unique sparsest solution to $b = A c$. It is now well-understood that such recovery is possible by practical algorithms when the dictionary $A$ is incoherent or restricted isometric. In this paper, we consider the more general case where $b$ lies in a subspace $\\mathcal{S}_0$ spanned by a subset of linearly dependent columns of $A$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.13091","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.13091/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.13091","created_at":"2026-07-05T00:29:06.017889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.13091v1","created_at":"2026-07-05T00:29:06.017889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.13091","created_at":"2026-07-05T00:29:06.017889+00:00"},{"alias_kind":"pith_short_12","alias_value":"KMRGQ6G3LS5S","created_at":"2026-07-05T00:29:06.017889+00:00"},{"alias_kind":"pith_short_16","alias_value":"KMRGQ6G3LS5SIBGD","created_at":"2026-07-05T00:29:06.017889+00:00"},{"alias_kind":"pith_short_8","alias_value":"KMRGQ6G3","created_at":"2026-07-05T00:29:06.017889+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/KMRGQ6G3LS5SIBGDTJIC2GOTLN","json":"https://pith.science/pith/KMRGQ6G3LS5SIBGDTJIC2GOTLN.json","graph_json":"https://pith.science/api/pith-number/KMRGQ6G3LS5SIBGDTJIC2GOTLN/graph.json","events_json":"https://pith.science/api/pith-number/KMRGQ6G3LS5SIBGDTJIC2GOTLN/events.json","paper":"https://pith.science/paper/KMRGQ6G3"},"agent_actions":{"view_html":"https://pith.science/pith/KMRGQ6G3LS5SIBGDTJIC2GOTLN","download_json":"https://pith.science/pith/KMRGQ6G3LS5SIBGDTJIC2GOTLN.json","view_paper":"https://pith.science/paper/KMRGQ6G3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.13091&json=true","fetch_graph":"https://pith.science/api/pith-number/KMRGQ6G3LS5SIBGDTJIC2GOTLN/graph.json","fetch_events":"https://pith.science/api/pith-number/KMRGQ6G3LS5SIBGDTJIC2GOTLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KMRGQ6G3LS5SIBGDTJIC2GOTLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KMRGQ6G3LS5SIBGDTJIC2GOTLN/action/storage_attestation","attest_author":"https://pith.science/pith/KMRGQ6G3LS5SIBGDTJIC2GOTLN/action/author_attestation","sign_citation":"https://pith.science/pith/KMRGQ6G3LS5SIBGDTJIC2GOTLN/action/citation_signature","submit_replication":"https://pith.science/pith/KMRGQ6G3LS5SIBGDTJIC2GOTLN/action/replication_record"}},"created_at":"2026-07-05T00:29:06.017889+00:00","updated_at":"2026-07-05T00:29:06.017889+00:00"}