{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3O5WABQQDQU63RKGWAMLERKS3F","short_pith_number":"pith:3O5WABQQ","schema_version":"1.0","canonical_sha256":"dbbb6006101c29edc546b018b24552d95aaedad93c9a4d55f2c5190b59af4f97","source":{"kind":"arxiv","id":"1410.6880","version":1},"attestation_state":"computed","paper":{"title":"Screening Rules for Overlapping Group Lasso","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Eric P. Xing, Seunghak Lee","submitted_at":"2014-10-25T04:06:49Z","abstract_excerpt":"Recently, to solve large-scale lasso and group lasso problems, screening rules have been developed, the goal of which is to reduce the problem size by efficiently discarding zero coefficients using simple rules independently of the others. However, screening for overlapping group lasso remains an open challenge because the overlaps between groups make it infeasible to test each group independently. In this paper, we develop screening rules for overlapping group lasso. To address the challenge arising from groups with overlaps, we take into account overlapping groups only if they are inclusive "},"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":"1410.6880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-25T04:06:49Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8e2f1616b0d129a919a987a5739df86e021af0bbb2e5fb42b7a4989f6003d87e","abstract_canon_sha256":"a71d99ce07b0a03cb3c1486e60246392e849923182c5d391f64840f57e8a7c35"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:18.406988Z","signature_b64":"VdkqJjimqHyovBPf1TUQoYsBWHGeXl2TUhYTWMV4UpswWDXwvOjO6Ugiki6pKaXKaJHJjkQZxET9+HVg3eIoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbbb6006101c29edc546b018b24552d95aaedad93c9a4d55f2c5190b59af4f97","last_reissued_at":"2026-05-18T02:39:18.406598Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:18.406598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Screening Rules for Overlapping Group Lasso","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Eric P. Xing, Seunghak Lee","submitted_at":"2014-10-25T04:06:49Z","abstract_excerpt":"Recently, to solve large-scale lasso and group lasso problems, screening rules have been developed, the goal of which is to reduce the problem size by efficiently discarding zero coefficients using simple rules independently of the others. However, screening for overlapping group lasso remains an open challenge because the overlaps between groups make it infeasible to test each group independently. In this paper, we develop screening rules for overlapping group lasso. To address the challenge arising from groups with overlaps, we take into account overlapping groups only if they are inclusive "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6880","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":"1410.6880","created_at":"2026-05-18T02:39:18.406654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6880v1","created_at":"2026-05-18T02:39:18.406654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6880","created_at":"2026-05-18T02:39:18.406654+00:00"},{"alias_kind":"pith_short_12","alias_value":"3O5WABQQDQU6","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3O5WABQQDQU63RKG","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3O5WABQQ","created_at":"2026-05-18T12:28:11.866339+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/3O5WABQQDQU63RKGWAMLERKS3F","json":"https://pith.science/pith/3O5WABQQDQU63RKGWAMLERKS3F.json","graph_json":"https://pith.science/api/pith-number/3O5WABQQDQU63RKGWAMLERKS3F/graph.json","events_json":"https://pith.science/api/pith-number/3O5WABQQDQU63RKGWAMLERKS3F/events.json","paper":"https://pith.science/paper/3O5WABQQ"},"agent_actions":{"view_html":"https://pith.science/pith/3O5WABQQDQU63RKGWAMLERKS3F","download_json":"https://pith.science/pith/3O5WABQQDQU63RKGWAMLERKS3F.json","view_paper":"https://pith.science/paper/3O5WABQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6880&json=true","fetch_graph":"https://pith.science/api/pith-number/3O5WABQQDQU63RKGWAMLERKS3F/graph.json","fetch_events":"https://pith.science/api/pith-number/3O5WABQQDQU63RKGWAMLERKS3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3O5WABQQDQU63RKGWAMLERKS3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3O5WABQQDQU63RKGWAMLERKS3F/action/storage_attestation","attest_author":"https://pith.science/pith/3O5WABQQDQU63RKGWAMLERKS3F/action/author_attestation","sign_citation":"https://pith.science/pith/3O5WABQQDQU63RKGWAMLERKS3F/action/citation_signature","submit_replication":"https://pith.science/pith/3O5WABQQDQU63RKGWAMLERKS3F/action/replication_record"}},"created_at":"2026-05-18T02:39:18.406654+00:00","updated_at":"2026-05-18T02:39:18.406654+00:00"}