{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BIETYC3BODF36VI7Q2B5HJQGCQ","short_pith_number":"pith:BIETYC3B","canonical_record":{"source":{"id":"1202.3708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"da58f6a2cc1b9bb09c6753d665a180bf44e411410afc424d6b6411845c9494e4","abstract_canon_sha256":"751d6dc07d91407e6fe8415b96be65816091a06ababd68b9dfe31799bcdede4d"},"schema_version":"1.0"},"canonical_sha256":"0a093c0b6170cbbf551f8683d3a606140553c22b44f17f6641d46bc4d8afa4d1","source":{"kind":"arxiv","id":"1202.3708","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3708","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3708v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3708","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"BIETYC3BODF3","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BIETYC3BODF36VI7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BIETYC3B","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BIETYC3BODF36VI7Q2B5HJQGCQ","target":"record","payload":{"canonical_record":{"source":{"id":"1202.3708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"da58f6a2cc1b9bb09c6753d665a180bf44e411410afc424d6b6411845c9494e4","abstract_canon_sha256":"751d6dc07d91407e6fe8415b96be65816091a06ababd68b9dfe31799bcdede4d"},"schema_version":"1.0"},"canonical_sha256":"0a093c0b6170cbbf551f8683d3a606140553c22b44f17f6641d46bc4d8afa4d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:02:03.455839Z","signature_b64":"OndWllpzuW3MBFuTB4HGe0ACaQlFCsVXLa25smAvGvantNosQUtD1PCsWOYhcECHJWSZiHn2ZO5HqICoNV5yCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a093c0b6170cbbf551f8683d3a606140553c22b44f17f6641d46bc4d8afa4d1","last_reissued_at":"2026-05-18T04:02:03.455305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:02:03.455305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.3708","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r7aS2PdriP9wOju1tHUIa3DzFp9GD9y+KhmKJ5xJn6JPKYkKus82Xe6ej5ES0+8RmKS8or0GyrzJuPHY6R93Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:16:26.636200Z"},"content_sha256":"e5d6b34abe7a84f5a752b829c1963e4638ea9b5bee8917cb02afdb5907f51e8a","schema_version":"1.0","event_id":"sha256:e5d6b34abe7a84f5a752b829c1963e4638ea9b5bee8917cb02afdb5907f51e8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BIETYC3BODF36VI7Q2B5HJQGCQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Smoothing Proximal Gradient Method for General Structured Sparse Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric P. Xing, Jaime G. Carbonell, Qihang Lin, Seyoung Kim, Xi Chen","submitted_at":"2012-02-14T16:41:17Z","abstract_excerpt":"We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input or output sides. We consider two widely adopted types of such penalties as our motivating examples: 1) overlapping group lasso penalty, based on the l1/l2 mixed-norm penalty, and 2) graph-guided fusion penalty. For both types of penalties, due to their non-separability, developing an efficient optimization method has remained a challenging problem. In this paper, we propose a general optimization approach, called smo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3708","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-18T04:02:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3cZlFNgKrSXDrgHWP8I2zu+ZfH2jlYLSaajLNc7Pcn8FEtsSVlTj5pZI0n+1dsK9Grvj6K/ip4UmfKUkMXnnAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:16:26.636581Z"},"content_sha256":"a8591c3c82ad65c5cec5d88add7265e48bc198ebb6408f5d4c5f96f023d20514","schema_version":"1.0","event_id":"sha256:a8591c3c82ad65c5cec5d88add7265e48bc198ebb6408f5d4c5f96f023d20514"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/bundle.json","state_url":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/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-20T10:16:26Z","links":{"resolver":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ","bundle":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/bundle.json","state":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BIETYC3BODF36VI7Q2B5HJQGCQ","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":"751d6dc07d91407e6fe8415b96be65816091a06ababd68b9dfe31799bcdede4d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"da58f6a2cc1b9bb09c6753d665a180bf44e411410afc424d6b6411845c9494e4"},"schema_version":"1.0","source":{"id":"1202.3708","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.3708","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"arxiv_version","alias_value":"1202.3708v1","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3708","created_at":"2026-05-18T04:02:03Z"},{"alias_kind":"pith_short_12","alias_value":"BIETYC3BODF3","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BIETYC3BODF36VI7","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BIETYC3B","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:a8591c3c82ad65c5cec5d88add7265e48bc198ebb6408f5d4c5f96f023d20514","target":"graph","created_at":"2026-05-18T04:02:03Z","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 study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input or output sides. We consider two widely adopted types of such penalties as our motivating examples: 1) overlapping group lasso penalty, based on the l1/l2 mixed-norm penalty, and 2) graph-guided fusion penalty. For both types of penalties, due to their non-separability, developing an efficient optimization method has remained a challenging problem. In this paper, we propose a general optimization approach, called smo","authors_text":"Eric P. Xing, Jaime G. Carbonell, Qihang Lin, Seyoung Kim, Xi Chen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title":"Smoothing Proximal Gradient Method for General Structured Sparse Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.3708","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:e5d6b34abe7a84f5a752b829c1963e4638ea9b5bee8917cb02afdb5907f51e8a","target":"record","created_at":"2026-05-18T04:02:03Z","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":"751d6dc07d91407e6fe8415b96be65816091a06ababd68b9dfe31799bcdede4d","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-02-14T16:41:17Z","title_canon_sha256":"da58f6a2cc1b9bb09c6753d665a180bf44e411410afc424d6b6411845c9494e4"},"schema_version":"1.0","source":{"id":"1202.3708","kind":"arxiv","version":1}},"canonical_sha256":"0a093c0b6170cbbf551f8683d3a606140553c22b44f17f6641d46bc4d8afa4d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a093c0b6170cbbf551f8683d3a606140553c22b44f17f6641d46bc4d8afa4d1","first_computed_at":"2026-05-18T04:02:03.455305Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:02:03.455305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OndWllpzuW3MBFuTB4HGe0ACaQlFCsVXLa25smAvGvantNosQUtD1PCsWOYhcECHJWSZiHn2ZO5HqICoNV5yCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:02:03.455839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.3708","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5d6b34abe7a84f5a752b829c1963e4638ea9b5bee8917cb02afdb5907f51e8a","sha256:a8591c3c82ad65c5cec5d88add7265e48bc198ebb6408f5d4c5f96f023d20514"],"state_sha256":"f1c010387d4062e47b15cdd5c68dde33968c0971151617359f99a8dbc40b3dd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3w+gKLLdjh+YlOMi8BHR2R8DwfGThoTWvzNkGxiAwMPVaco4rTf5jesudam499l6Kg2GkQXijuUMo4EVWM2yAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:16:26.638767Z","bundle_sha256":"fd168afc498f6df67c942cfcb3f78bba47caf86d1dd9d31200200624226859c6"}}