{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:H5HJ5NV7WO22HVNAPDBWRFIXPZ","short_pith_number":"pith:H5HJ5NV7","schema_version":"1.0","canonical_sha256":"3f4e9eb6bfb3b5a3d5a078c36895177e6ed2370ac55e7628d322bfba9345b2db","source":{"kind":"arxiv","id":"1711.03783","version":1},"attestation_state":"computed","paper":{"title":"A Theoretical Analysis of Sparse Recovery Stability of Dantzig Selector and LASSO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Duan Li, Yun-Bin Zhao","submitted_at":"2017-11-10T11:53:27Z","abstract_excerpt":"Dantzig selector (DS) and LASSO problems have attracted plenty of attention in statistical learning, sparse data recovery and mathematical optimization. In this paper, we provide a theoretical analysis of the sparse recovery stability of these optimization problems in more general settings and from a new perspective. We establish recovery error bounds for these optimization problems under a mild assumption called weak range space property of a transposed design matrix. This assumption is less restrictive than the well known sparse recovery conditions such as restricted isometry property (RIP),"},"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":"1711.03783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-11-10T11:53:27Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"72d3df14c529d22e027bdcc1875a72318688d24e600c9a053a9163c63116ffdf","abstract_canon_sha256":"1b1f6f7071995d977d377aea69e6feb3e837ad7f5f2a43deba8cdb422dd514ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:51.474960Z","signature_b64":"9zoa2+FRYiGuPIEgdJYwc1jDPGPokwc7Ydb1JJbzf+p2hGhYqzR530J8UmJ9vOUK+rhYm4IZjH7sj/kzoQcNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f4e9eb6bfb3b5a3d5a078c36895177e6ed2370ac55e7628d322bfba9345b2db","last_reissued_at":"2026-05-18T00:30:51.474380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:51.474380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theoretical Analysis of Sparse Recovery Stability of Dantzig Selector and LASSO","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Duan Li, Yun-Bin Zhao","submitted_at":"2017-11-10T11:53:27Z","abstract_excerpt":"Dantzig selector (DS) and LASSO problems have attracted plenty of attention in statistical learning, sparse data recovery and mathematical optimization. In this paper, we provide a theoretical analysis of the sparse recovery stability of these optimization problems in more general settings and from a new perspective. We establish recovery error bounds for these optimization problems under a mild assumption called weak range space property of a transposed design matrix. This assumption is less restrictive than the well known sparse recovery conditions such as restricted isometry property (RIP),"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03783","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":"1711.03783","created_at":"2026-05-18T00:30:51.474488+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.03783v1","created_at":"2026-05-18T00:30:51.474488+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03783","created_at":"2026-05-18T00:30:51.474488+00:00"},{"alias_kind":"pith_short_12","alias_value":"H5HJ5NV7WO22","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"H5HJ5NV7WO22HVNA","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"H5HJ5NV7","created_at":"2026-05-18T12:31:18.294218+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2203.02607","citing_title":"An SDP Relaxation for the Sparse Integer Least Squares Problem","ref_index":56,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ","json":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ.json","graph_json":"https://pith.science/api/pith-number/H5HJ5NV7WO22HVNAPDBWRFIXPZ/graph.json","events_json":"https://pith.science/api/pith-number/H5HJ5NV7WO22HVNAPDBWRFIXPZ/events.json","paper":"https://pith.science/paper/H5HJ5NV7"},"agent_actions":{"view_html":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ","download_json":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ.json","view_paper":"https://pith.science/paper/H5HJ5NV7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.03783&json=true","fetch_graph":"https://pith.science/api/pith-number/H5HJ5NV7WO22HVNAPDBWRFIXPZ/graph.json","fetch_events":"https://pith.science/api/pith-number/H5HJ5NV7WO22HVNAPDBWRFIXPZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/action/storage_attestation","attest_author":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/action/author_attestation","sign_citation":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/action/citation_signature","submit_replication":"https://pith.science/pith/H5HJ5NV7WO22HVNAPDBWRFIXPZ/action/replication_record"}},"created_at":"2026-05-18T00:30:51.474488+00:00","updated_at":"2026-05-18T00:30:51.474488+00:00"}