{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:YYLZPYKS6XF453D7WQLXPQRKER","short_pith_number":"pith:YYLZPYKS","schema_version":"1.0","canonical_sha256":"c61797e152f5cbceec7fb41777c22a2475841893d8ab8e93e797aed9b99695f1","source":{"kind":"arxiv","id":"1009.5689","version":5},"attestation_state":"computed","paper":{"title":"Square-Root Lasso: Pivotal Recovery of Sparse Signals via Conic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Alexandre Belloni, Lie Wang, Victor Chernozhukov","submitted_at":"2010-09-28T20:39:14Z","abstract_excerpt":"We propose a pivotal method for estimating high-dimensional sparse linear regression models, where the overall number of regressors $p$ is large, possibly much larger than $n$, but only $s$ regressors are significant. The method is a modification of the lasso, called the square-root lasso. The method is pivotal in that it neither relies on the knowledge of the standard deviation $\\sigma$ or nor does it need to pre-estimate $\\sigma$. Moreover, the method does not rely on normality or sub-Gaussianity of noise. It achieves near-oracle performance, attaining the convergence rate $\\sigma \\{(s/n)\\lo"},"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":"1009.5689","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2010-09-28T20:39:14Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"5a10012ea398b79c0e1f76d8dca2d386d31996601519aea893b6b40e3c00c227","abstract_canon_sha256":"1da72f4b55b7adb4d4d74c3fe6f4b33ab70d848fcb1e5c7206467700d0f27e6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:48.210118Z","signature_b64":"4Pm+8loginGzjuheaJPk20YXnr5OVqwr4yllckncECZ6CkcgfhwbldOonRu1mgKiuEuOJ2CmbPvPsyONZfUSCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c61797e152f5cbceec7fb41777c22a2475841893d8ab8e93e797aed9b99695f1","last_reissued_at":"2026-05-18T02:23:48.209453Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:48.209453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Square-Root Lasso: Pivotal Recovery of Sparse Signals via Conic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Alexandre Belloni, Lie Wang, Victor Chernozhukov","submitted_at":"2010-09-28T20:39:14Z","abstract_excerpt":"We propose a pivotal method for estimating high-dimensional sparse linear regression models, where the overall number of regressors $p$ is large, possibly much larger than $n$, but only $s$ regressors are significant. The method is a modification of the lasso, called the square-root lasso. The method is pivotal in that it neither relies on the knowledge of the standard deviation $\\sigma$ or nor does it need to pre-estimate $\\sigma$. Moreover, the method does not rely on normality or sub-Gaussianity of noise. It achieves near-oracle performance, attaining the convergence rate $\\sigma \\{(s/n)\\lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5689","kind":"arxiv","version":5},"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":"1009.5689","created_at":"2026-05-18T02:23:48.209548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5689v5","created_at":"2026-05-18T02:23:48.209548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5689","created_at":"2026-05-18T02:23:48.209548+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYLZPYKS6XF4","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYLZPYKS6XF453D7","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYLZPYKS","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/YYLZPYKS6XF453D7WQLXPQRKER","json":"https://pith.science/pith/YYLZPYKS6XF453D7WQLXPQRKER.json","graph_json":"https://pith.science/api/pith-number/YYLZPYKS6XF453D7WQLXPQRKER/graph.json","events_json":"https://pith.science/api/pith-number/YYLZPYKS6XF453D7WQLXPQRKER/events.json","paper":"https://pith.science/paper/YYLZPYKS"},"agent_actions":{"view_html":"https://pith.science/pith/YYLZPYKS6XF453D7WQLXPQRKER","download_json":"https://pith.science/pith/YYLZPYKS6XF453D7WQLXPQRKER.json","view_paper":"https://pith.science/paper/YYLZPYKS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5689&json=true","fetch_graph":"https://pith.science/api/pith-number/YYLZPYKS6XF453D7WQLXPQRKER/graph.json","fetch_events":"https://pith.science/api/pith-number/YYLZPYKS6XF453D7WQLXPQRKER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYLZPYKS6XF453D7WQLXPQRKER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYLZPYKS6XF453D7WQLXPQRKER/action/storage_attestation","attest_author":"https://pith.science/pith/YYLZPYKS6XF453D7WQLXPQRKER/action/author_attestation","sign_citation":"https://pith.science/pith/YYLZPYKS6XF453D7WQLXPQRKER/action/citation_signature","submit_replication":"https://pith.science/pith/YYLZPYKS6XF453D7WQLXPQRKER/action/replication_record"}},"created_at":"2026-05-18T02:23:48.209548+00:00","updated_at":"2026-05-18T02:23:48.209548+00:00"}