{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LESDFM6BLWVB55ITYGY5DWVM7K","short_pith_number":"pith:LESDFM6B","schema_version":"1.0","canonical_sha256":"592432b3c15daa1ef513c1b1d1daacfa9f7a81b11fcf3a4401c68e78a332d1d0","source":{"kind":"arxiv","id":"1011.5936","version":1},"attestation_state":"computed","paper":{"title":"On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ao Tang, Meng Wang, Weiyu Xu","submitted_at":"2010-11-26T23:12:24Z","abstract_excerpt":"It is known that a high-dimensional sparse vector x* in R^n can be recovered from low-dimensional measurements y= A^{m*n} x* (m<n) . In this paper, we investigate the recovering ability of l_p-minimization (0<=p<=1) as p varies, where l_p-minimization returns a vector with the least l_p ``norm'' among all the vectors x satisfying Ax=y. Besides analyzing the performance of strong recovery where l_p-minimization needs to recover all the sparse vectors up to certain sparsity, we also for the first time analyze the performance of ``weak'' recovery of l_p-minimization (0<=p<1) where the aim is to r"},"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":"1011.5936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-11-26T23:12:24Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f5bb4a871e8ea0239a3b12a619ee1c92fed3b18eddddc36efc7008e074bf75b1","abstract_canon_sha256":"c1a66ae2064a118f38579c47b078169e01aa797865e316dc6c2964da121399af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:37.876290Z","signature_b64":"Tx0y3UWNsRm3tFnBmrAL7KEKCWwHCEV7pl4SudGKPS37Poc/ItJXq6plR/a5XKMuNeA1K9JJWWiD5tS1c9FgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"592432b3c15daa1ef513c1b1d1daacfa9f7a81b11fcf3a4401c68e78a332d1d0","last_reissued_at":"2026-05-18T04:34:37.875623Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:37.875623Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Ao Tang, Meng Wang, Weiyu Xu","submitted_at":"2010-11-26T23:12:24Z","abstract_excerpt":"It is known that a high-dimensional sparse vector x* in R^n can be recovered from low-dimensional measurements y= A^{m*n} x* (m<n) . In this paper, we investigate the recovering ability of l_p-minimization (0<=p<=1) as p varies, where l_p-minimization returns a vector with the least l_p ``norm'' among all the vectors x satisfying Ax=y. Besides analyzing the performance of strong recovery where l_p-minimization needs to recover all the sparse vectors up to certain sparsity, we also for the first time analyze the performance of ``weak'' recovery of l_p-minimization (0<=p<1) where the aim is to r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5936","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":"1011.5936","created_at":"2026-05-18T04:34:37.875725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.5936v1","created_at":"2026-05-18T04:34:37.875725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5936","created_at":"2026-05-18T04:34:37.875725+00:00"},{"alias_kind":"pith_short_12","alias_value":"LESDFM6BLWVB","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LESDFM6BLWVB55IT","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LESDFM6B","created_at":"2026-05-18T12:26:10.704358+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/LESDFM6BLWVB55ITYGY5DWVM7K","json":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K.json","graph_json":"https://pith.science/api/pith-number/LESDFM6BLWVB55ITYGY5DWVM7K/graph.json","events_json":"https://pith.science/api/pith-number/LESDFM6BLWVB55ITYGY5DWVM7K/events.json","paper":"https://pith.science/paper/LESDFM6B"},"agent_actions":{"view_html":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K","download_json":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K.json","view_paper":"https://pith.science/paper/LESDFM6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.5936&json=true","fetch_graph":"https://pith.science/api/pith-number/LESDFM6BLWVB55ITYGY5DWVM7K/graph.json","fetch_events":"https://pith.science/api/pith-number/LESDFM6BLWVB55ITYGY5DWVM7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K/action/storage_attestation","attest_author":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K/action/author_attestation","sign_citation":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K/action/citation_signature","submit_replication":"https://pith.science/pith/LESDFM6BLWVB55ITYGY5DWVM7K/action/replication_record"}},"created_at":"2026-05-18T04:34:37.875725+00:00","updated_at":"2026-05-18T04:34:37.875725+00:00"}