{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4UKZPFMVYZ6MKNGVDRQZLVWB4C","short_pith_number":"pith:4UKZPFMV","schema_version":"1.0","canonical_sha256":"e515979595c67cc534d51c6195d6c1e08244421e99eebe0ac4a51734b465999f","source":{"kind":"arxiv","id":"1109.2397","version":2},"attestation_state":"computed","paper":{"title":"Structured sparsity through convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (LIENS, Guillaume Obozinski (LIENS, INRIA Paris - Rocquencourt), Julien Mairal, Rodolphe Jenatton (LIENS","submitted_at":"2011-09-12T08:23:02Z","abstract_excerpt":"Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. While naturally cast as a combinatorial optimization problem, variable or feature selection admits a convex relaxation through the regularization by the $\\ell_1$-norm. In this paper, we consider situations where we are not only interested in sparsity, but where some structural prior knowledge is available as well. We show that the $\\ell_1$-norm can then be extended to structured norms built on either disjoint or overlapping groups of variables, leading to a flexible framework that can deal"},"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":"1109.2397","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T08:23:02Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"86635505248e15b966123ed7d69d6b75159dd89285d0fbb9ab840f47996335ef","abstract_canon_sha256":"7614196e5ebffb42fd4e18600d3d89bfa8b6a6f9c090ebf8557c736eebe5c33c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:26.796190Z","signature_b64":"FXHIlaTSRNmZRZIgpeK4mUylbOkF5iFXfaDH/z3Da+A/ulMdPSmPqifu0BBjGkE8+ptiAtVgPN8DpIoEdbohDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e515979595c67cc534d51c6195d6c1e08244421e99eebe0ac4a51734b465999f","last_reissued_at":"2026-05-18T03:57:26.795425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:26.795425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structured sparsity through convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Francis Bach (LIENS, Guillaume Obozinski (LIENS, INRIA Paris - Rocquencourt), Julien Mairal, Rodolphe Jenatton (LIENS","submitted_at":"2011-09-12T08:23:02Z","abstract_excerpt":"Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. While naturally cast as a combinatorial optimization problem, variable or feature selection admits a convex relaxation through the regularization by the $\\ell_1$-norm. In this paper, we consider situations where we are not only interested in sparsity, but where some structural prior knowledge is available as well. We show that the $\\ell_1$-norm can then be extended to structured norms built on either disjoint or overlapping groups of variables, leading to a flexible framework that can deal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2397","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":"1109.2397","created_at":"2026-05-18T03:57:26.795566+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2397v2","created_at":"2026-05-18T03:57:26.795566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2397","created_at":"2026-05-18T03:57:26.795566+00:00"},{"alias_kind":"pith_short_12","alias_value":"4UKZPFMVYZ6M","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4UKZPFMVYZ6MKNGV","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4UKZPFMV","created_at":"2026-05-18T12:26:20.644004+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/4UKZPFMVYZ6MKNGVDRQZLVWB4C","json":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C.json","graph_json":"https://pith.science/api/pith-number/4UKZPFMVYZ6MKNGVDRQZLVWB4C/graph.json","events_json":"https://pith.science/api/pith-number/4UKZPFMVYZ6MKNGVDRQZLVWB4C/events.json","paper":"https://pith.science/paper/4UKZPFMV"},"agent_actions":{"view_html":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C","download_json":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C.json","view_paper":"https://pith.science/paper/4UKZPFMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2397&json=true","fetch_graph":"https://pith.science/api/pith-number/4UKZPFMVYZ6MKNGVDRQZLVWB4C/graph.json","fetch_events":"https://pith.science/api/pith-number/4UKZPFMVYZ6MKNGVDRQZLVWB4C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/action/storage_attestation","attest_author":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/action/author_attestation","sign_citation":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/action/citation_signature","submit_replication":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/action/replication_record"}},"created_at":"2026-05-18T03:57:26.795566+00:00","updated_at":"2026-05-18T03:57:26.795566+00:00"}