{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZA4TJ7FB5PMSSS7QNRCRTVU4KY","short_pith_number":"pith:ZA4TJ7FB","schema_version":"1.0","canonical_sha256":"c83934fca1ebd9294bf06c4519d69c56238849611b1f4e213727dbfe781bf59e","source":{"kind":"arxiv","id":"1008.3651","version":3},"attestation_state":"computed","paper":{"title":"Accuracy guarantees for L1-recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Anatoli Iouditski (LJK), Arkadii S. Nemirovski (ISyE)","submitted_at":"2010-08-21T18:32:03Z","abstract_excerpt":"We discuss two new methods of recovery of sparse signals from noisy observation based on $\\ell_1$- minimization. They are closely related to the well-known techniques such as Lasso and Dantzig Selector. However, these estimators come with efficiently verifiable guaranties of performance. By optimizing these bounds with respect to the method parameters we are able to construct the estimators which possess better statistical properties than the commonly used ones. We also show how these techniques allow to provide efficiently computable accuracy bounds for Lasso and Dantzig Selector. We link our"},"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":"1008.3651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2010-08-21T18:32:03Z","cross_cats_sorted":["cs.SY","math.OC","stat.TH"],"title_canon_sha256":"e98bb1eaeee226ccbbaca13a893847e8fa5218fbfca0029fa52f92308640e703","abstract_canon_sha256":"414174f0d0bb58160fcd98a371936750bf5617c2caf59df0d94a20879e59d0e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:31.054148Z","signature_b64":"JfJHGE03nXOcCSF4a2d/xbSK4vf3TP3z3WehYop33odXMBRrRFPkqk2K+o6j8BG6K59osKYduNhY0kcFB7jZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c83934fca1ebd9294bf06c4519d69c56238849611b1f4e213727dbfe781bf59e","last_reissued_at":"2026-05-18T02:54:31.053534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:31.053534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accuracy guarantees for L1-recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC","stat.TH"],"primary_cat":"math.ST","authors_text":"Anatoli Iouditski (LJK), Arkadii S. Nemirovski (ISyE)","submitted_at":"2010-08-21T18:32:03Z","abstract_excerpt":"We discuss two new methods of recovery of sparse signals from noisy observation based on $\\ell_1$- minimization. They are closely related to the well-known techniques such as Lasso and Dantzig Selector. However, these estimators come with efficiently verifiable guaranties of performance. By optimizing these bounds with respect to the method parameters we are able to construct the estimators which possess better statistical properties than the commonly used ones. We also show how these techniques allow to provide efficiently computable accuracy bounds for Lasso and Dantzig Selector. We link our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.3651","kind":"arxiv","version":3},"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":"1008.3651","created_at":"2026-05-18T02:54:31.053625+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.3651v3","created_at":"2026-05-18T02:54:31.053625+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.3651","created_at":"2026-05-18T02:54:31.053625+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZA4TJ7FB5PMS","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZA4TJ7FB5PMSSS7Q","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZA4TJ7FB","created_at":"2026-05-18T12:26:17.028572+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/ZA4TJ7FB5PMSSS7QNRCRTVU4KY","json":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY.json","graph_json":"https://pith.science/api/pith-number/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/graph.json","events_json":"https://pith.science/api/pith-number/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/events.json","paper":"https://pith.science/paper/ZA4TJ7FB"},"agent_actions":{"view_html":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY","download_json":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY.json","view_paper":"https://pith.science/paper/ZA4TJ7FB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.3651&json=true","fetch_graph":"https://pith.science/api/pith-number/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/graph.json","fetch_events":"https://pith.science/api/pith-number/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/action/storage_attestation","attest_author":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/action/author_attestation","sign_citation":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/action/citation_signature","submit_replication":"https://pith.science/pith/ZA4TJ7FB5PMSSS7QNRCRTVU4KY/action/replication_record"}},"created_at":"2026-05-18T02:54:31.053625+00:00","updated_at":"2026-05-18T02:54:31.053625+00:00"}