{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MVBCWEG2YSFVTSI7XTNEVNPDRQ","short_pith_number":"pith:MVBCWEG2","schema_version":"1.0","canonical_sha256":"65422b10dac48b59c91fbcda4ab5e38c0885d92d06cb1ac31d83607b46aa4363","source":{"kind":"arxiv","id":"1606.02702","version":1},"attestation_state":"computed","paper":{"title":"Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Eugene Ndiaye, Joseph Salmon, Olivier Fercoq, Vincent Lecl\\`ere","submitted_at":"2016-06-08T19:51:47Z","abstract_excerpt":"In high dimensional settings, sparse structures are crucial for efficiency, both in term of memory, computation and performance. It is customary to consider $\\ell_1$ penalty to enforce sparsity in such scenarios. Sparsity enforcing methods, the Lasso being a canonical example, are popular candidates to address high dimension. For efficiency, they rely on tuning a parameter trading data fitting versus sparsity. For the Lasso theory to hold this tuning parameter should be proportional to the noise level, yet the latter is often unknown in practice. A possible remedy is to jointly optimize over t"},"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":"1606.02702","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-06-08T19:51:47Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"770bc90db584b3712e554b5bbf31d960c663a7e8c9c179b515448a6fd5d27042","abstract_canon_sha256":"a5ebdda183975741d76c6de60445e13f65b782eecc6212c8028337a75c0acd91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:09.114713Z","signature_b64":"tXt8pxJ5NlAZxH8GOc9fEssSddhEAYGeeEX/sIYegipnXK4TNYZe03sk67gXfMwTkCL70LLti51TEB+A1o/LBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65422b10dac48b59c91fbcda4ab5e38c0885d92d06cb1ac31d83607b46aa4363","last_reissued_at":"2026-05-18T00:30:09.114206Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:09.114206Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Smoothed Concomitant Lasso Estimation for High Dimensional Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Eugene Ndiaye, Joseph Salmon, Olivier Fercoq, Vincent Lecl\\`ere","submitted_at":"2016-06-08T19:51:47Z","abstract_excerpt":"In high dimensional settings, sparse structures are crucial for efficiency, both in term of memory, computation and performance. It is customary to consider $\\ell_1$ penalty to enforce sparsity in such scenarios. Sparsity enforcing methods, the Lasso being a canonical example, are popular candidates to address high dimension. For efficiency, they rely on tuning a parameter trading data fitting versus sparsity. For the Lasso theory to hold this tuning parameter should be proportional to the noise level, yet the latter is often unknown in practice. A possible remedy is to jointly optimize over t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02702","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":"1606.02702","created_at":"2026-05-18T00:30:09.114285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02702v1","created_at":"2026-05-18T00:30:09.114285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02702","created_at":"2026-05-18T00:30:09.114285+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVBCWEG2YSFV","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVBCWEG2YSFVTSI7","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVBCWEG2","created_at":"2026-05-18T12:30:32.724797+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/MVBCWEG2YSFVTSI7XTNEVNPDRQ","json":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ.json","graph_json":"https://pith.science/api/pith-number/MVBCWEG2YSFVTSI7XTNEVNPDRQ/graph.json","events_json":"https://pith.science/api/pith-number/MVBCWEG2YSFVTSI7XTNEVNPDRQ/events.json","paper":"https://pith.science/paper/MVBCWEG2"},"agent_actions":{"view_html":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ","download_json":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ.json","view_paper":"https://pith.science/paper/MVBCWEG2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02702&json=true","fetch_graph":"https://pith.science/api/pith-number/MVBCWEG2YSFVTSI7XTNEVNPDRQ/graph.json","fetch_events":"https://pith.science/api/pith-number/MVBCWEG2YSFVTSI7XTNEVNPDRQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/action/storage_attestation","attest_author":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/action/author_attestation","sign_citation":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/action/citation_signature","submit_replication":"https://pith.science/pith/MVBCWEG2YSFVTSI7XTNEVNPDRQ/action/replication_record"}},"created_at":"2026-05-18T00:30:09.114285+00:00","updated_at":"2026-05-18T00:30:09.114285+00:00"}