{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:UBEFJWB5GLPTVOESVGIK3YNO7Q","short_pith_number":"pith:UBEFJWB5","schema_version":"1.0","canonical_sha256":"a04854d83d32df3ab892a990ade1aefc066c727a333df42875471a161d215949","source":{"kind":"arxiv","id":"1210.2077","version":2},"attestation_state":"computed","paper":{"title":"Sparsity by Worst-Case Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Christophe Ambroise, Julien Chiquet, Yves Grandvalet","submitted_at":"2012-10-07T17:06:45Z","abstract_excerpt":"This paper proposes a new interpretation of sparse penalties such as the elastic-net and the group-lasso. Beyond providing a new viewpoint on these penalization schemes, our approach results in a unified optimization strategy. Our experiments demonstrate that this strategy, implemented on the elastic-net, is computationally extremely efficient for small to medium size problems. Our accompanying software solves problems very accurately, at machine precision, in the time required to get a rough estimate with competing state-of-the-art algorithms. We illustrate on real and artificial datasets tha"},"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":"1210.2077","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-07T17:06:45Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"3d50d21d8e1718a3100edb19cf74ac611e6d7b2f16349b1c159a0306e8e158db","abstract_canon_sha256":"cd576606cd8b5de0896ed884298643281fdeff2fdf60105797ffa279fc35f123"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:58.797718Z","signature_b64":"qAVXViLDulH/d6QyzsClcVv0H+2YeZz0oPPgLrWBOAZbIxPnvP0FJfB1lWySgktJ4UDFnTOZIAYnAWKJZS18Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a04854d83d32df3ab892a990ade1aefc066c727a333df42875471a161d215949","last_reissued_at":"2026-05-18T00:39:58.797215Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:58.797215Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparsity by Worst-Case Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Christophe Ambroise, Julien Chiquet, Yves Grandvalet","submitted_at":"2012-10-07T17:06:45Z","abstract_excerpt":"This paper proposes a new interpretation of sparse penalties such as the elastic-net and the group-lasso. Beyond providing a new viewpoint on these penalization schemes, our approach results in a unified optimization strategy. Our experiments demonstrate that this strategy, implemented on the elastic-net, is computationally extremely efficient for small to medium size problems. Our accompanying software solves problems very accurately, at machine precision, in the time required to get a rough estimate with competing state-of-the-art algorithms. We illustrate on real and artificial datasets tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.2077","kind":"arxiv","version":2},"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":"1210.2077","created_at":"2026-05-18T00:39:58.797282+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.2077v2","created_at":"2026-05-18T00:39:58.797282+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.2077","created_at":"2026-05-18T00:39:58.797282+00:00"},{"alias_kind":"pith_short_12","alias_value":"UBEFJWB5GLPT","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"UBEFJWB5GLPTVOES","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"UBEFJWB5","created_at":"2026-05-18T12:27:23.164592+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/UBEFJWB5GLPTVOESVGIK3YNO7Q","json":"https://pith.science/pith/UBEFJWB5GLPTVOESVGIK3YNO7Q.json","graph_json":"https://pith.science/api/pith-number/UBEFJWB5GLPTVOESVGIK3YNO7Q/graph.json","events_json":"https://pith.science/api/pith-number/UBEFJWB5GLPTVOESVGIK3YNO7Q/events.json","paper":"https://pith.science/paper/UBEFJWB5"},"agent_actions":{"view_html":"https://pith.science/pith/UBEFJWB5GLPTVOESVGIK3YNO7Q","download_json":"https://pith.science/pith/UBEFJWB5GLPTVOESVGIK3YNO7Q.json","view_paper":"https://pith.science/paper/UBEFJWB5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.2077&json=true","fetch_graph":"https://pith.science/api/pith-number/UBEFJWB5GLPTVOESVGIK3YNO7Q/graph.json","fetch_events":"https://pith.science/api/pith-number/UBEFJWB5GLPTVOESVGIK3YNO7Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UBEFJWB5GLPTVOESVGIK3YNO7Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UBEFJWB5GLPTVOESVGIK3YNO7Q/action/storage_attestation","attest_author":"https://pith.science/pith/UBEFJWB5GLPTVOESVGIK3YNO7Q/action/author_attestation","sign_citation":"https://pith.science/pith/UBEFJWB5GLPTVOESVGIK3YNO7Q/action/citation_signature","submit_replication":"https://pith.science/pith/UBEFJWB5GLPTVOESVGIK3YNO7Q/action/replication_record"}},"created_at":"2026-05-18T00:39:58.797282+00:00","updated_at":"2026-05-18T00:39:58.797282+00:00"}