{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BIETYC3BODF36VI7Q2B5HJQGCQ","short_pith_number":"pith:BIETYC3B","schema_version":"1.0","canonical_sha256":"0a093c0b6170cbbf551f8683d3a606140553c22b44f17f6641d46bc4d8afa4d1","source":{"kind":"arxiv","id":"1202.3708","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1202.3708","created_at":"2026-05-18T04:02:03.455390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.3708v1","created_at":"2026-05-18T04:02:03.455390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.3708","created_at":"2026-05-18T04:02:03.455390+00:00"},{"alias_kind":"pith_short_12","alias_value":"BIETYC3BODF3","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BIETYC3BODF36VI7","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BIETYC3B","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ","json":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ.json","graph_json":"https://pith.science/api/pith-number/BIETYC3BODF36VI7Q2B5HJQGCQ/graph.json","events_json":"https://pith.science/api/pith-number/BIETYC3BODF36VI7Q2B5HJQGCQ/events.json","paper":"https://pith.science/paper/BIETYC3B"},"agent_actions":{"view_html":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ","download_json":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ.json","view_paper":"https://pith.science/paper/BIETYC3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.3708&json=true","fetch_graph":"https://pith.science/api/pith-number/BIETYC3BODF36VI7Q2B5HJQGCQ/graph.json","fetch_events":"https://pith.science/api/pith-number/BIETYC3BODF36VI7Q2B5HJQGCQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/action/storage_attestation","attest_author":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/action/author_attestation","sign_citation":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/action/citation_signature","submit_replication":"https://pith.science/pith/BIETYC3BODF36VI7Q2B5HJQGCQ/action/replication_record"}},"created_at":"2026-05-18T04:02:03.455390+00:00","updated_at":"2026-05-18T04:02:03.455390+00:00"}