{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:IRDB5VOIJEEE2VBYHRNEB37DQQ","short_pith_number":"pith:IRDB5VOI","schema_version":"1.0","canonical_sha256":"44461ed5c849084d54383c5a40efe384108c0cb22df7ae25c7e70745ef078f87","source":{"kind":"arxiv","id":"1104.1872","version":3},"attestation_state":"computed","paper":{"title":"Convex and Network Flow Optimization for Structured Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Francis Bach (LIENS, Guillaume Obozinski (LIENS, INRIA Paris - Rocquencourt), Julien Mairal, Rodolphe Jenatton (LIENS","submitted_at":"2011-04-11T08:04:59Z","abstract_excerpt":"We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of l_2- or l_infinity-norms over groups of variables. Whereas much effort has been put in developing fast optimization techniques when the groups are disjoint or embedded in a hierarchy, we address here the case of general overlapping groups. To this end, we present two different strategies: On the one hand, we show that the proximal operator associated with a sum of l_infinity-norms can be computed exactly in polynomial time by solving a quadratic min-cost flow problem, allowing the "},"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":"1104.1872","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-11T08:04:59Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"9b9dc96a8423247a7827002e2a84942567633754280c8793396cfa3eb51bc3f6","abstract_canon_sha256":"c568c693b1192977ddfec412435ca11bfcf16e39ae085a8e15faa9e49ea21edb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:10:58.659823Z","signature_b64":"0Rmp22H67nCUKqU5g6Pj0YDH4OxJpjj3IGRs1aq5Vl27/wKRHh7Y/R1w8/Io//JjCqQ405OLYy4D8oTeFN0CBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44461ed5c849084d54383c5a40efe384108c0cb22df7ae25c7e70745ef078f87","last_reissued_at":"2026-05-18T04:10:58.659162Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:10:58.659162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex and Network Flow Optimization for Structured Sparsity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Francis Bach (LIENS, Guillaume Obozinski (LIENS, INRIA Paris - Rocquencourt), Julien Mairal, Rodolphe Jenatton (LIENS","submitted_at":"2011-04-11T08:04:59Z","abstract_excerpt":"We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of l_2- or l_infinity-norms over groups of variables. Whereas much effort has been put in developing fast optimization techniques when the groups are disjoint or embedded in a hierarchy, we address here the case of general overlapping groups. To this end, we present two different strategies: On the one hand, we show that the proximal operator associated with a sum of l_infinity-norms can be computed exactly in polynomial time by solving a quadratic min-cost flow problem, allowing the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1872","kind":"arxiv","version":3},"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":"1104.1872","created_at":"2026-05-18T04:10:58.659272+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.1872v3","created_at":"2026-05-18T04:10:58.659272+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1872","created_at":"2026-05-18T04:10:58.659272+00:00"},{"alias_kind":"pith_short_12","alias_value":"IRDB5VOIJEEE","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"IRDB5VOIJEEE2VBY","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"IRDB5VOI","created_at":"2026-05-18T12:26:32.869790+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/IRDB5VOIJEEE2VBYHRNEB37DQQ","json":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ.json","graph_json":"https://pith.science/api/pith-number/IRDB5VOIJEEE2VBYHRNEB37DQQ/graph.json","events_json":"https://pith.science/api/pith-number/IRDB5VOIJEEE2VBYHRNEB37DQQ/events.json","paper":"https://pith.science/paper/IRDB5VOI"},"agent_actions":{"view_html":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ","download_json":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ.json","view_paper":"https://pith.science/paper/IRDB5VOI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.1872&json=true","fetch_graph":"https://pith.science/api/pith-number/IRDB5VOIJEEE2VBYHRNEB37DQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/IRDB5VOIJEEE2VBYHRNEB37DQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/action/storage_attestation","attest_author":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/action/author_attestation","sign_citation":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/action/citation_signature","submit_replication":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/action/replication_record"}},"created_at":"2026-05-18T04:10:58.659272+00:00","updated_at":"2026-05-18T04:10:58.659272+00:00"}