{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5ZU3HY2EPFM7MWPGEARDT7BHGT","short_pith_number":"pith:5ZU3HY2E","canonical_record":{"source":{"id":"1108.0775","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-08-03T07:55:19Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"84c5fa2c34c888bc41c507c1c6fd294a4926bdc2862e817ba60020d3950bc53f","abstract_canon_sha256":"7bc66fed8478ff807bbf83660e2750c0d2b6d6afc80e77100ad8710a1d4158c1"},"schema_version":"1.0"},"canonical_sha256":"ee69b3e3447959f659e6202239fc2734ead6c4283eab12a73bc1548a9ebec191","source":{"kind":"arxiv","id":"1108.0775","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0775","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0775v2","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0775","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"5ZU3HY2EPFM7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"5ZU3HY2EPFM7MWPG","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"5ZU3HY2E","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5ZU3HY2EPFM7MWPGEARDT7BHGT","target":"record","payload":{"canonical_record":{"source":{"id":"1108.0775","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-08-03T07:55:19Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"84c5fa2c34c888bc41c507c1c6fd294a4926bdc2862e817ba60020d3950bc53f","abstract_canon_sha256":"7bc66fed8478ff807bbf83660e2750c0d2b6d6afc80e77100ad8710a1d4158c1"},"schema_version":"1.0"},"canonical_sha256":"ee69b3e3447959f659e6202239fc2734ead6c4283eab12a73bc1548a9ebec191","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:52.444972Z","signature_b64":"0Bfoe5JMiOMPmdv60AhyHDpDbW1yXOpOZ+2/DaUeF4Yv0Aur5Aqnk8zCb63VG3dMiQL0gDK238Sa66U58xcRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee69b3e3447959f659e6202239fc2734ead6c4283eab12a73bc1548a9ebec191","last_reissued_at":"2026-05-18T04:07:52.444418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:52.444418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.0775","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-18T04:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jfbrPJqvX12KmoFvSBKHjJ2tA+Jpl9g0F0uLC0/LrebuHw4IaffRCweIAfziRmo7ERo9/ZVcjC02T3TIr/GZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:34:45.137227Z"},"content_sha256":"238faba0150c02f36170d1e84b1ac0b8eaaf52aa9f3232cfe121338719214716","schema_version":"1.0","event_id":"sha256:238faba0150c02f36170d1e84b1ac0b8eaaf52aa9f3232cfe121338719214716"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5ZU3HY2EPFM7MWPGEARDT7BHGT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization with Sparsity-Inducing Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","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-08-03T07:55:19Z","abstract_excerpt":"Sparse estimation methods are aimed at using or obtaining parsimonious representations of data or models. They were first dedicated to linear variable selection but numerous extensions have now emerged such as structured sparsity or kernel selection. It turns out that many of the related estimation problems can be cast as convex optimization problems by regularizing the empirical risk with appropriate non-smooth norms. The goal of this paper is to present from a general perspective optimization tools and techniques dedicated to such sparsity-inducing penalties. We cover proximal methods, block"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0775","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-18T04:07:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FA8Gmg5BBA/kfJUqhd5RpWjHsKPvVuPH48oqT2sFfWihODnWP9hG9J8xrpp4xPyBnvxDOEM35JUKQaqd4MJFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T16:34:45.137585Z"},"content_sha256":"baa9a8a3f36c1595503d1df8afa481d2f5e5e0fd7571a645de29be864d5fbee5","schema_version":"1.0","event_id":"sha256:baa9a8a3f36c1595503d1df8afa481d2f5e5e0fd7571a645de29be864d5fbee5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ZU3HY2EPFM7MWPGEARDT7BHGT/bundle.json","state_url":"https://pith.science/pith/5ZU3HY2EPFM7MWPGEARDT7BHGT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ZU3HY2EPFM7MWPGEARDT7BHGT/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-02T16:34:45Z","links":{"resolver":"https://pith.science/pith/5ZU3HY2EPFM7MWPGEARDT7BHGT","bundle":"https://pith.science/pith/5ZU3HY2EPFM7MWPGEARDT7BHGT/bundle.json","state":"https://pith.science/pith/5ZU3HY2EPFM7MWPGEARDT7BHGT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ZU3HY2EPFM7MWPGEARDT7BHGT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5ZU3HY2EPFM7MWPGEARDT7BHGT","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":"7bc66fed8478ff807bbf83660e2750c0d2b6d6afc80e77100ad8710a1d4158c1","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-08-03T07:55:19Z","title_canon_sha256":"84c5fa2c34c888bc41c507c1c6fd294a4926bdc2862e817ba60020d3950bc53f"},"schema_version":"1.0","source":{"id":"1108.0775","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.0775","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"arxiv_version","alias_value":"1108.0775v2","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.0775","created_at":"2026-05-18T04:07:52Z"},{"alias_kind":"pith_short_12","alias_value":"5ZU3HY2EPFM7","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"5ZU3HY2EPFM7MWPG","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"5ZU3HY2E","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:baa9a8a3f36c1595503d1df8afa481d2f5e5e0fd7571a645de29be864d5fbee5","target":"graph","created_at":"2026-05-18T04:07:52Z","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. They were first dedicated to linear variable selection but numerous extensions have now emerged such as structured sparsity or kernel selection. It turns out that many of the related estimation problems can be cast as convex optimization problems by regularizing the empirical risk with appropriate non-smooth norms. The goal of this paper is to present from a general perspective optimization tools and techniques dedicated to such sparsity-inducing penalties. We cover proximal methods, block","authors_text":"Francis Bach (LIENS, Guillaume Obozinski (LIENS, INRIA Paris - Rocquencourt), Julien Mairal, Rodolphe Jenatton (LIENS","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-08-03T07:55:19Z","title":"Optimization with Sparsity-Inducing Penalties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.0775","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:238faba0150c02f36170d1e84b1ac0b8eaaf52aa9f3232cfe121338719214716","target":"record","created_at":"2026-05-18T04:07:52Z","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":"7bc66fed8478ff807bbf83660e2750c0d2b6d6afc80e77100ad8710a1d4158c1","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-08-03T07:55:19Z","title_canon_sha256":"84c5fa2c34c888bc41c507c1c6fd294a4926bdc2862e817ba60020d3950bc53f"},"schema_version":"1.0","source":{"id":"1108.0775","kind":"arxiv","version":2}},"canonical_sha256":"ee69b3e3447959f659e6202239fc2734ead6c4283eab12a73bc1548a9ebec191","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee69b3e3447959f659e6202239fc2734ead6c4283eab12a73bc1548a9ebec191","first_computed_at":"2026-05-18T04:07:52.444418Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:52.444418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0Bfoe5JMiOMPmdv60AhyHDpDbW1yXOpOZ+2/DaUeF4Yv0Aur5Aqnk8zCb63VG3dMiQL0gDK238Sa66U58xcRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:52.444972Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.0775","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:238faba0150c02f36170d1e84b1ac0b8eaaf52aa9f3232cfe121338719214716","sha256:baa9a8a3f36c1595503d1df8afa481d2f5e5e0fd7571a645de29be864d5fbee5"],"state_sha256":"319881d6924ac51d24c7c68c87b7341d130bd2dc70c9b2f590087cfc6571016a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBansKFttOkf5vJcKqMU0pFS0+2MQ9hp6UA3YhzjG8T/L4EGJ01ITnUk1/aLKYXlmVdsZeq4ybQXBltUNOo8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T16:34:45.139489Z","bundle_sha256":"fb6fb326aa6440e139a832a6533295d95b7bf023eb965977c264845288e67d8c"}}