{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4UKZPFMVYZ6MKNGVDRQZLVWB4C","short_pith_number":"pith:4UKZPFMV","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"},"canonical_sha256":"e515979595c67cc534d51c6195d6c1e08244421e99eebe0ac4a51734b465999f","source":{"kind":"arxiv","id":"1109.2397","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2397","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2397v2","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2397","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"4UKZPFMVYZ6M","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4UKZPFMVYZ6MKNGV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4UKZPFMV","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4UKZPFMVYZ6MKNGVDRQZLVWB4C","target":"record","payload":{"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"},"canonical_sha256":"e515979595c67cc534d51c6195d6c1e08244421e99eebe0ac4a51734b465999f","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"},"source_kind":"arxiv","source_id":"1109.2397","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZDdt7BWZkUK6SNPr/qiq0kdbr1tpadwdzRX3oT9nY0sKSxxyrRWAXNfamHjjKOIOyZMVzM4EUXhyVZ23QRzaBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:12:51.190088Z"},"content_sha256":"9c9a6161da22db11cc4466f31a9bd1519e0dfc72803f1faa562120d3f76eae96","schema_version":"1.0","event_id":"sha256:9c9a6161da22db11cc4466f31a9bd1519e0dfc72803f1faa562120d3f76eae96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4UKZPFMVYZ6MKNGVDRQZLVWB4C","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:57:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DCB7me0b1UGwzAxc6jwZkDLoBvaEYc2RaEWcuaEK0nU5jG89l6SYkAOKkghfBeI15jWhx/X/T7KEubJ0XOriDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:12:51.190455Z"},"content_sha256":"5cde1b12f10e213c048f1fcb840c8219304be17c26561835600a9e2a9866580c","schema_version":"1.0","event_id":"sha256:5cde1b12f10e213c048f1fcb840c8219304be17c26561835600a9e2a9866580c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/bundle.json","state_url":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T11:12:51Z","links":{"resolver":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C","bundle":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/bundle.json","state":"https://pith.science/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UKZPFMVYZ6MKNGVDRQZLVWB4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4UKZPFMVYZ6MKNGVDRQZLVWB4C","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"7614196e5ebffb42fd4e18600d3d89bfa8b6a6f9c090ebf8557c736eebe5c33c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T08:23:02Z","title_canon_sha256":"86635505248e15b966123ed7d69d6b75159dd89285d0fbb9ab840f47996335ef"},"schema_version":"1.0","source":{"id":"1109.2397","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2397","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2397v2","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2397","created_at":"2026-05-18T03:57:26Z"},{"alias_kind":"pith_short_12","alias_value":"4UKZPFMVYZ6M","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4UKZPFMVYZ6MKNGV","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4UKZPFMV","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:5cde1b12f10e213c048f1fcb840c8219304be17c26561835600a9e2a9866580c","target":"graph","created_at":"2026-05-18T03:57:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Francis Bach (LIENS, Guillaume Obozinski (LIENS, INRIA Paris - Rocquencourt), Julien Mairal, Rodolphe Jenatton (LIENS","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T08:23:02Z","title":"Structured sparsity through convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2397","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9c9a6161da22db11cc4466f31a9bd1519e0dfc72803f1faa562120d3f76eae96","target":"record","created_at":"2026-05-18T03:57:26Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"7614196e5ebffb42fd4e18600d3d89bfa8b6a6f9c090ebf8557c736eebe5c33c","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-12T08:23:02Z","title_canon_sha256":"86635505248e15b966123ed7d69d6b75159dd89285d0fbb9ab840f47996335ef"},"schema_version":"1.0","source":{"id":"1109.2397","kind":"arxiv","version":2}},"canonical_sha256":"e515979595c67cc534d51c6195d6c1e08244421e99eebe0ac4a51734b465999f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e515979595c67cc534d51c6195d6c1e08244421e99eebe0ac4a51734b465999f","first_computed_at":"2026-05-18T03:57:26.795425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:26.795425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FXHIlaTSRNmZRZIgpeK4mUylbOkF5iFXfaDH/z3Da+A/ulMdPSmPqifu0BBjGkE8+ptiAtVgPN8DpIoEdbohDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:26.796190Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2397","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c9a6161da22db11cc4466f31a9bd1519e0dfc72803f1faa562120d3f76eae96","sha256:5cde1b12f10e213c048f1fcb840c8219304be17c26561835600a9e2a9866580c"],"state_sha256":"963f1cc2bd42a42b0ea0c75ee3141389eaf612e81bbf42fdb903bfdff6d19c55"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nKClJBfTF5Htc8aZ/FnMUU1OFDkSJLKJPn3eJxdiJU56vef63G46OZAfnQ6be1vTLW7X6a8mPEhLwQByDpUzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:12:51.192437Z","bundle_sha256":"05357c919cb3a60456a577928593a0f80f53ae6f88c4571cf415032089e8761b"}}