{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VYHTPLT2H2NPR47U6Z7BGU7OWO","short_pith_number":"pith:VYHTPLT2","canonical_record":{"source":{"id":"1209.0368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-03T14:46:14Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"94ebce983b1af632b14edb068924312b13a51e5b2400965870664c42c07fadbd","abstract_canon_sha256":"69eb3141a8b27885cdd1ed59f7f186033f84ce095cfc0d64dac08ba84bf2cac2"},"schema_version":"1.0"},"canonical_sha256":"ae0f37ae7a3e9af8f3f4f67e1353eeb386fd709946beb292849280654db165a0","source":{"kind":"arxiv","id":"1209.0368","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0368","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0368v1","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0368","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"VYHTPLT2H2NP","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VYHTPLT2H2NPR47U","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VYHTPLT2","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VYHTPLT2H2NPR47U6Z7BGU7OWO","target":"record","payload":{"canonical_record":{"source":{"id":"1209.0368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-03T14:46:14Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"94ebce983b1af632b14edb068924312b13a51e5b2400965870664c42c07fadbd","abstract_canon_sha256":"69eb3141a8b27885cdd1ed59f7f186033f84ce095cfc0d64dac08ba84bf2cac2"},"schema_version":"1.0"},"canonical_sha256":"ae0f37ae7a3e9af8f3f4f67e1353eeb386fd709946beb292849280654db165a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:29.229858Z","signature_b64":"9P8UYVRlvAjCZr8IcTJ9YlbmQ9YvNqLT4bF8vD4l5mvrTujrGSJvhBiquWwl9pvs/pAFtURDL9mMQhA0JSiPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae0f37ae7a3e9af8f3f4f67e1353eeb386fd709946beb292849280654db165a0","last_reissued_at":"2026-05-18T03:46:29.228806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:29.228806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.0368","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:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v6caC0Q2DnJQrSpXj8l476M7c5mJpzKCI9jitKhExyrReI6e6aWdT0+Y4L2IsaICifQ5lnhbWi7kSumcwB0wAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:25:56.490706Z"},"content_sha256":"2ecfe520211d355c5f876d9d084bfec5f027de2efa0baf70cc5a2f33209b2fef","schema_version":"1.0","event_id":"sha256:2ecfe520211d355c5f876d9d084bfec5f027de2efa0baf70cc5a2f33209b2fef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VYHTPLT2H2NPR47U6Z7BGU7OWO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Proximal methods for the latent group lasso penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Alessandro Verri, Lorenzo Rosasco, Silvia Villa, Sofia Mosci","submitted_at":"2012-09-03T14:46:14Z","abstract_excerpt":"We consider a regularized least squares problem, with regularization by structured sparsity-inducing norms, which extend the usual $\\ell_1$ and the group lasso penalty, by allowing the subsets to overlap. Such regularizations lead to nonsmooth problems that are difficult to optimize, and we propose in this paper a suitable version of an accelerated proximal method to solve them. We prove convergence of a nested procedure, obtained composing an accelerated proximal method with an inner algorithm for computing the proximity operator. By exploiting the geometrical properties of the penalty, we de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0368","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:46:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xMzqscyDDqe1GmXyLZXoMSsr/c/w+NdkFfwhkW6h1sI+gAHhCMRKnkIn0buOjuUR/TL2cBzWGpZ8qc6L5nAgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T23:25:56.491487Z"},"content_sha256":"a33772bec30362c8aed979e187b6d1a07893f17755eee376195a721982233604","schema_version":"1.0","event_id":"sha256:a33772bec30362c8aed979e187b6d1a07893f17755eee376195a721982233604"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYHTPLT2H2NPR47U6Z7BGU7OWO/bundle.json","state_url":"https://pith.science/pith/VYHTPLT2H2NPR47U6Z7BGU7OWO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYHTPLT2H2NPR47U6Z7BGU7OWO/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-09T23:25:56Z","links":{"resolver":"https://pith.science/pith/VYHTPLT2H2NPR47U6Z7BGU7OWO","bundle":"https://pith.science/pith/VYHTPLT2H2NPR47U6Z7BGU7OWO/bundle.json","state":"https://pith.science/pith/VYHTPLT2H2NPR47U6Z7BGU7OWO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYHTPLT2H2NPR47U6Z7BGU7OWO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VYHTPLT2H2NPR47U6Z7BGU7OWO","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":"69eb3141a8b27885cdd1ed59f7f186033f84ce095cfc0d64dac08ba84bf2cac2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-03T14:46:14Z","title_canon_sha256":"94ebce983b1af632b14edb068924312b13a51e5b2400965870664c42c07fadbd"},"schema_version":"1.0","source":{"id":"1209.0368","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.0368","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.0368v1","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.0368","created_at":"2026-05-18T03:46:29Z"},{"alias_kind":"pith_short_12","alias_value":"VYHTPLT2H2NP","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VYHTPLT2H2NPR47U","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VYHTPLT2","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:a33772bec30362c8aed979e187b6d1a07893f17755eee376195a721982233604","target":"graph","created_at":"2026-05-18T03:46:29Z","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 regularized least squares problem, with regularization by structured sparsity-inducing norms, which extend the usual $\\ell_1$ and the group lasso penalty, by allowing the subsets to overlap. Such regularizations lead to nonsmooth problems that are difficult to optimize, and we propose in this paper a suitable version of an accelerated proximal method to solve them. We prove convergence of a nested procedure, obtained composing an accelerated proximal method with an inner algorithm for computing the proximity operator. By exploiting the geometrical properties of the penalty, we de","authors_text":"Alessandro Verri, Lorenzo Rosasco, Silvia Villa, Sofia Mosci","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-03T14:46:14Z","title":"Proximal methods for the latent group lasso penalty"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.0368","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:2ecfe520211d355c5f876d9d084bfec5f027de2efa0baf70cc5a2f33209b2fef","target":"record","created_at":"2026-05-18T03:46:29Z","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":"69eb3141a8b27885cdd1ed59f7f186033f84ce095cfc0d64dac08ba84bf2cac2","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-09-03T14:46:14Z","title_canon_sha256":"94ebce983b1af632b14edb068924312b13a51e5b2400965870664c42c07fadbd"},"schema_version":"1.0","source":{"id":"1209.0368","kind":"arxiv","version":1}},"canonical_sha256":"ae0f37ae7a3e9af8f3f4f67e1353eeb386fd709946beb292849280654db165a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae0f37ae7a3e9af8f3f4f67e1353eeb386fd709946beb292849280654db165a0","first_computed_at":"2026-05-18T03:46:29.228806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:29.228806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9P8UYVRlvAjCZr8IcTJ9YlbmQ9YvNqLT4bF8vD4l5mvrTujrGSJvhBiquWwl9pvs/pAFtURDL9mMQhA0JSiPBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:29.229858Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.0368","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ecfe520211d355c5f876d9d084bfec5f027de2efa0baf70cc5a2f33209b2fef","sha256:a33772bec30362c8aed979e187b6d1a07893f17755eee376195a721982233604"],"state_sha256":"9e2d9dba817790addcdeb7a6f7a5b6a1c066f585dc539288093d04d0e8f6b8c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rbaofCu/aIUhxYLLN25oZROqXY+IV/qljtQ/JhfAX41KTr7thyoY/98ReOkW3bNGhbCsa9sRtLxl7Bek22wJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T23:25:56.495939Z","bundle_sha256":"6938711d570e3856d581cfb074ba7d2cf81e9353e0ca3faeb1556f6d310b09ca"}}