{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BL5BGBCGXG6KVSYYURX4YXA2A5","short_pith_number":"pith:BL5BGBCG","schema_version":"1.0","canonical_sha256":"0afa130446b9bcaacb18a46fcc5c1a07634101a2c8de1f091c0a4a62e1a55144","source":{"kind":"arxiv","id":"1703.07285","version":2},"attestation_state":"computed","paper":{"title":"From safe screening rules to working sets for faster Lasso-type solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Joseph Salmon, Mathurin Massias","submitted_at":"2017-03-21T15:42:38Z","abstract_excerpt":"Convex sparsity-promoting regularizations are ubiquitous in modern statistical learning. By construction, they yield solutions with few non-zero coefficients, which correspond to saturated constraints in the dual optimization formulation. Working set (WS) strategies are generic optimization techniques that consist in solving simpler problems that only consider a subset of constraints, whose indices form the WS. Working set methods therefore involve two nested iterations: the outer loop corresponds to the definition of the WS and the inner loop calls a solver for the subproblems. For the Lasso "},"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":"1703.07285","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-21T15:42:38Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"c170ceac22362dc010e2d9a5fb27a3c6d5039799e21d02cf2b5ddda96e05d3b6","abstract_canon_sha256":"f36a7c08c5738bebcd2279c4cfb46fac602a98701ec5aef41931d9f95284bf7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:19.570980Z","signature_b64":"y9aYO+AsrGagcMT+L/MfUvEduo/jmdM01QzR2Buz9Hj327iukBxqgDLFKefACnP/QGkk+BF0IjXIlOi1T92eCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0afa130446b9bcaacb18a46fcc5c1a07634101a2c8de1f091c0a4a62e1a55144","last_reissued_at":"2026-05-18T00:45:19.570359Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:19.570359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From safe screening rules to working sets for faster Lasso-type solvers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC","stat.CO"],"primary_cat":"stat.ML","authors_text":"Alexandre Gramfort, Joseph Salmon, Mathurin Massias","submitted_at":"2017-03-21T15:42:38Z","abstract_excerpt":"Convex sparsity-promoting regularizations are ubiquitous in modern statistical learning. By construction, they yield solutions with few non-zero coefficients, which correspond to saturated constraints in the dual optimization formulation. Working set (WS) strategies are generic optimization techniques that consist in solving simpler problems that only consider a subset of constraints, whose indices form the WS. Working set methods therefore involve two nested iterations: the outer loop corresponds to the definition of the WS and the inner loop calls a solver for the subproblems. For the Lasso "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07285","kind":"arxiv","version":2},"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":"1703.07285","created_at":"2026-05-18T00:45:19.570449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07285v2","created_at":"2026-05-18T00:45:19.570449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07285","created_at":"2026-05-18T00:45:19.570449+00:00"},{"alias_kind":"pith_short_12","alias_value":"BL5BGBCGXG6K","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BL5BGBCGXG6KVSYY","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BL5BGBCG","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.12077","citing_title":"Large scale Lasso with windowed active set for convolutional spike sorting","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BL5BGBCGXG6KVSYYURX4YXA2A5","json":"https://pith.science/pith/BL5BGBCGXG6KVSYYURX4YXA2A5.json","graph_json":"https://pith.science/api/pith-number/BL5BGBCGXG6KVSYYURX4YXA2A5/graph.json","events_json":"https://pith.science/api/pith-number/BL5BGBCGXG6KVSYYURX4YXA2A5/events.json","paper":"https://pith.science/paper/BL5BGBCG"},"agent_actions":{"view_html":"https://pith.science/pith/BL5BGBCGXG6KVSYYURX4YXA2A5","download_json":"https://pith.science/pith/BL5BGBCGXG6KVSYYURX4YXA2A5.json","view_paper":"https://pith.science/paper/BL5BGBCG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07285&json=true","fetch_graph":"https://pith.science/api/pith-number/BL5BGBCGXG6KVSYYURX4YXA2A5/graph.json","fetch_events":"https://pith.science/api/pith-number/BL5BGBCGXG6KVSYYURX4YXA2A5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BL5BGBCGXG6KVSYYURX4YXA2A5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BL5BGBCGXG6KVSYYURX4YXA2A5/action/storage_attestation","attest_author":"https://pith.science/pith/BL5BGBCGXG6KVSYYURX4YXA2A5/action/author_attestation","sign_citation":"https://pith.science/pith/BL5BGBCGXG6KVSYYURX4YXA2A5/action/citation_signature","submit_replication":"https://pith.science/pith/BL5BGBCGXG6KVSYYURX4YXA2A5/action/replication_record"}},"created_at":"2026-05-18T00:45:19.570449+00:00","updated_at":"2026-05-18T00:45:19.570449+00:00"}