{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:IRDB5VOIJEEE2VBYHRNEB37DQQ","short_pith_number":"pith:IRDB5VOI","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"},"canonical_sha256":"44461ed5c849084d54383c5a40efe384108c0cb22df7ae25c7e70745ef078f87","source":{"kind":"arxiv","id":"1104.1872","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1872","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1872v3","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1872","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"IRDB5VOIJEEE","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IRDB5VOIJEEE2VBY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IRDB5VOI","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:IRDB5VOIJEEE2VBYHRNEB37DQQ","target":"record","payload":{"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"},"canonical_sha256":"44461ed5c849084d54383c5a40efe384108c0cb22df7ae25c7e70745ef078f87","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"},"source_kind":"arxiv","source_id":"1104.1872","source_version":3,"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-18T04:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d49Dmkl+OAycuU6lMfcBuU1Zex6qULdeUV1PFG8eCs0f0ToX1PAS1fP1SJVfh9MqGfL/Zj+M0jgRy4gDGfo0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:47:16.719750Z"},"content_sha256":"5d02204050be7d523b21f9c71b1bb4669c88f4b165706816d9bac39a13416206","schema_version":"1.0","event_id":"sha256:5d02204050be7d523b21f9c71b1bb4669c88f4b165706816d9bac39a13416206"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:IRDB5VOIJEEE2VBYHRNEB37DQQ","target":"graph","payload":{"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"},"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-18T04:10:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YVgqKjqcYMsqDv1Qu7VKilKbpKjHV2Ux73dpzhfnXQ8v3rW66nn9KSys0DDIYme+olWgupqO5j0u1/bnTRyJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T06:47:16.720114Z"},"content_sha256":"cc744637c6210fae1a0da93e7e13f5276c474c9f92de1fd68b39173a6d83ec8d","schema_version":"1.0","event_id":"sha256:cc744637c6210fae1a0da93e7e13f5276c474c9f92de1fd68b39173a6d83ec8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/bundle.json","state_url":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/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-02T06:47:16Z","links":{"resolver":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ","bundle":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/bundle.json","state":"https://pith.science/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IRDB5VOIJEEE2VBYHRNEB37DQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:IRDB5VOIJEEE2VBYHRNEB37DQQ","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":"c568c693b1192977ddfec412435ca11bfcf16e39ae085a8e15faa9e49ea21edb","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-11T08:04:59Z","title_canon_sha256":"9b9dc96a8423247a7827002e2a84942567633754280c8793396cfa3eb51bc3f6"},"schema_version":"1.0","source":{"id":"1104.1872","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1872","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1872v3","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1872","created_at":"2026-05-18T04:10:58Z"},{"alias_kind":"pith_short_12","alias_value":"IRDB5VOIJEEE","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"IRDB5VOIJEEE2VBY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"IRDB5VOI","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:cc744637c6210fae1a0da93e7e13f5276c474c9f92de1fd68b39173a6d83ec8d","target":"graph","created_at":"2026-05-18T04:10:58Z","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":"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 ","authors_text":"Francis Bach (LIENS, Guillaume Obozinski (LIENS, INRIA Paris - Rocquencourt), Julien Mairal, Rodolphe Jenatton (LIENS","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-11T08:04:59Z","title":"Convex and Network Flow Optimization for Structured Sparsity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1872","kind":"arxiv","version":3},"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:5d02204050be7d523b21f9c71b1bb4669c88f4b165706816d9bac39a13416206","target":"record","created_at":"2026-05-18T04:10:58Z","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":"c568c693b1192977ddfec412435ca11bfcf16e39ae085a8e15faa9e49ea21edb","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-04-11T08:04:59Z","title_canon_sha256":"9b9dc96a8423247a7827002e2a84942567633754280c8793396cfa3eb51bc3f6"},"schema_version":"1.0","source":{"id":"1104.1872","kind":"arxiv","version":3}},"canonical_sha256":"44461ed5c849084d54383c5a40efe384108c0cb22df7ae25c7e70745ef078f87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44461ed5c849084d54383c5a40efe384108c0cb22df7ae25c7e70745ef078f87","first_computed_at":"2026-05-18T04:10:58.659162Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:10:58.659162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Rmp22H67nCUKqU5g6Pj0YDH4OxJpjj3IGRs1aq5Vl27/wKRHh7Y/R1w8/Io//JjCqQ405OLYy4D8oTeFN0CBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:10:58.659823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1872","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5d02204050be7d523b21f9c71b1bb4669c88f4b165706816d9bac39a13416206","sha256:cc744637c6210fae1a0da93e7e13f5276c474c9f92de1fd68b39173a6d83ec8d"],"state_sha256":"b800d53482741d5d36fc66d061af9418d356861be72c25a261f46b34f25f310d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29zZB7C6GeI7TjJgpGaV++fjjsELJY7wsB+OX5UMHdPOKzKEKcWtCGUsv7VRQEdLr6TcPGoWc6sYiOTHtMqiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T06:47:16.722150Z","bundle_sha256":"5addfcf9fca2c32cdc3b911d420d1912f876d8feed44c6ed88df7399459f779c"}}