{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:7KRVJ4X2BYM6Q7KLIMVFHM7ZUN","short_pith_number":"pith:7KRVJ4X2","canonical_record":{"source":{"id":"1205.1240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-06T19:54:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1a068a9490b179561246bef348bc48286ce29ff8ef526f6c509c5ee61a57fd52","abstract_canon_sha256":"ef07894b75fbfc6c7a586f1de46678e7faba32a831c25bd8a62f1ad9626f03c4"},"schema_version":"1.0"},"canonical_sha256":"faa354f2fa0e19e87d4b432a53b3f9a34ef4bea21524ce669168a605bfe9836c","source":{"kind":"arxiv","id":"1205.1240","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1240","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1240v1","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1240","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"7KRVJ4X2BYM6","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7KRVJ4X2BYM6Q7KL","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7KRVJ4X2","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:7KRVJ4X2BYM6Q7KLIMVFHM7ZUN","target":"record","payload":{"canonical_record":{"source":{"id":"1205.1240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-06T19:54:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1a068a9490b179561246bef348bc48286ce29ff8ef526f6c509c5ee61a57fd52","abstract_canon_sha256":"ef07894b75fbfc6c7a586f1de46678e7faba32a831c25bd8a62f1ad9626f03c4"},"schema_version":"1.0"},"canonical_sha256":"faa354f2fa0e19e87d4b432a53b3f9a34ef4bea21524ce669168a605bfe9836c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:11.712541Z","signature_b64":"FvoLDbqWl7vY3uCv0JBTgYFkVtiA7cbUC0YcRMZPDQdZ1StRJ3qre/5Kl4f/+fbOca1KmA45iYgWn5eSTlHyAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faa354f2fa0e19e87d4b432a53b3f9a34ef4bea21524ce669168a605bfe9836c","last_reissued_at":"2026-05-18T03:56:11.711797Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:11.711797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1205.1240","source_version":1,"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T4QGI9c4Lmc1eqpsDCMiTENJiFKwHiIqNMiYmuooCXq5vldMsDBIiRtIlsaIsuvtdZFkasBVbo7HqLmXfr17CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:15:34.279673Z"},"content_sha256":"d00af303fef04bc8fbc86e75ce5ce6ac0a5ec7672d613879155e7427a9e14ba0","schema_version":"1.0","event_id":"sha256:d00af303fef04bc8fbc86e75ce5ce6ac0a5ec7672d613879155e7427a9e14ba0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:7KRVJ4X2BYM6Q7KLIMVFHM7ZUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Relaxation for Combinatorial Penalties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, Guillaume Obozinski (INRIA Paris - Rocquencourt, LIENS)","submitted_at":"2012-05-06T19:54:33Z","abstract_excerpt":"In this paper, we propose an unifying view of several recently proposed structured sparsity-inducing norms. We consider the situation of a model simultaneously (a) penalized by a set- function de ned on the support of the unknown parameter vector which represents prior knowledge on supports, and (b) regularized in Lp-norm. We show that the natural combinatorial optimization problems obtained may be relaxed into convex optimization problems and introduce a notion, the lower combinatorial envelope of a set-function, that characterizes the tightness of our relaxations. We moreover establish links"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1240","kind":"arxiv","version":1},"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:56:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Obc2EkicMbxkIeoOnYR+O3z2Txtbnbk3ePgar5FNijYuVFApKL5LftkgVyBapKTUvkRFdV5kaqjr4gxx6hhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T05:15:34.280336Z"},"content_sha256":"abb2e9f53fcc25c346f169fd401c01917aa86fbedb6987e95b5d488a8dd0c0f9","schema_version":"1.0","event_id":"sha256:abb2e9f53fcc25c346f169fd401c01917aa86fbedb6987e95b5d488a8dd0c0f9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/bundle.json","state_url":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/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-05T05:15:34Z","links":{"resolver":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN","bundle":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/bundle.json","state":"https://pith.science/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KRVJ4X2BYM6Q7KLIMVFHM7ZUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:7KRVJ4X2BYM6Q7KLIMVFHM7ZUN","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":"ef07894b75fbfc6c7a586f1de46678e7faba32a831c25bd8a62f1ad9626f03c4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-06T19:54:33Z","title_canon_sha256":"1a068a9490b179561246bef348bc48286ce29ff8ef526f6c509c5ee61a57fd52"},"schema_version":"1.0","source":{"id":"1205.1240","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1240","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1240v1","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1240","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"7KRVJ4X2BYM6","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"7KRVJ4X2BYM6Q7KL","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"7KRVJ4X2","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:abb2e9f53fcc25c346f169fd401c01917aa86fbedb6987e95b5d488a8dd0c0f9","target":"graph","created_at":"2026-05-18T03:56:11Z","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":"In this paper, we propose an unifying view of several recently proposed structured sparsity-inducing norms. We consider the situation of a model simultaneously (a) penalized by a set- function de ned on the support of the unknown parameter vector which represents prior knowledge on supports, and (b) regularized in Lp-norm. We show that the natural combinatorial optimization problems obtained may be relaxed into convex optimization problems and introduce a notion, the lower combinatorial envelope of a set-function, that characterizes the tightness of our relaxations. We moreover establish links","authors_text":"Francis Bach (INRIA Paris - Rocquencourt, Guillaume Obozinski (INRIA Paris - Rocquencourt, LIENS)","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-06T19:54:33Z","title":"Convex Relaxation for Combinatorial Penalties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1240","kind":"arxiv","version":1},"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:d00af303fef04bc8fbc86e75ce5ce6ac0a5ec7672d613879155e7427a9e14ba0","target":"record","created_at":"2026-05-18T03:56:11Z","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":"ef07894b75fbfc6c7a586f1de46678e7faba32a831c25bd8a62f1ad9626f03c4","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-05-06T19:54:33Z","title_canon_sha256":"1a068a9490b179561246bef348bc48286ce29ff8ef526f6c509c5ee61a57fd52"},"schema_version":"1.0","source":{"id":"1205.1240","kind":"arxiv","version":1}},"canonical_sha256":"faa354f2fa0e19e87d4b432a53b3f9a34ef4bea21524ce669168a605bfe9836c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faa354f2fa0e19e87d4b432a53b3f9a34ef4bea21524ce669168a605bfe9836c","first_computed_at":"2026-05-18T03:56:11.711797Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:11.711797Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FvoLDbqWl7vY3uCv0JBTgYFkVtiA7cbUC0YcRMZPDQdZ1StRJ3qre/5Kl4f/+fbOca1KmA45iYgWn5eSTlHyAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:11.712541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1240","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d00af303fef04bc8fbc86e75ce5ce6ac0a5ec7672d613879155e7427a9e14ba0","sha256:abb2e9f53fcc25c346f169fd401c01917aa86fbedb6987e95b5d488a8dd0c0f9"],"state_sha256":"31995493e999add4a9460b9f47d33fb1902c430e5dcfa91e239c38d1312f7b2b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I0aAQJ7OTefdXKLeV4Ofe1/a86V8TgzFrOBmL16rBmALyNjVorMX+g0jcW7yfgQc7vnWbENjgBY5hBnrzHCnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T05:15:34.284228Z","bundle_sha256":"bbbb3a142aea4b5c213d80bff20ee55caec63674d8a8c6486ea08dc88734cc46"}}