{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4JPDDIRG54EKHGASO6CL4UZUPX","short_pith_number":"pith:4JPDDIRG","canonical_record":{"source":{"id":"1611.05780","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-17T16:55:12Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"0948e107d7ed45eecfcd9b28d38fd4843cf7b91f65b204a8ff19a7247db3d6ae","abstract_canon_sha256":"9272c39e0ea61dc12824c183035fcd162d39e1319516827262c9c736143e7016"},"schema_version":"1.0"},"canonical_sha256":"e25e31a226ef08a398127784be53347de8f01bad71e19d2cb678d32e03ed3624","source":{"kind":"arxiv","id":"1611.05780","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05780","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05780v4","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05780","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"pith_short_12","alias_value":"4JPDDIRG54EK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4JPDDIRG54EKHGAS","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4JPDDIRG","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4JPDDIRG54EKHGASO6CL4UZUPX","target":"record","payload":{"canonical_record":{"source":{"id":"1611.05780","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-17T16:55:12Z","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"title_canon_sha256":"0948e107d7ed45eecfcd9b28d38fd4843cf7b91f65b204a8ff19a7247db3d6ae","abstract_canon_sha256":"9272c39e0ea61dc12824c183035fcd162d39e1319516827262c9c736143e7016"},"schema_version":"1.0"},"canonical_sha256":"e25e31a226ef08a398127784be53347de8f01bad71e19d2cb678d32e03ed3624","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:09.833206Z","signature_b64":"lwZNsQ8uv01kt9a6zDTvTReesywcER9rr3/dcRtUvp2GfKn2ymmFi0c82WK7CHBoN9g2/a9hXUh19snT0E6TAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e25e31a226ef08a398127784be53347de8f01bad71e19d2cb678d32e03ed3624","last_reissued_at":"2026-05-18T00:27:09.832509Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:09.832509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.05780","source_version":4,"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-18T00:27:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2HWIiJny8cuQZKaOkLCAjcvIi2lQ/j6t5Tod/FzQkpVAw7wO64hjlNP/Ib/c8J18TLXXTUA/tGoF2ZjeJl6bAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:52:21.785896Z"},"content_sha256":"12cedb949ce82e5ab46d3709ea37e9ab7edf1dd2715a6336ba2a7382d4183de5","schema_version":"1.0","event_id":"sha256:12cedb949ce82e5ab46d3709ea37e9ab7edf1dd2715a6336ba2a7382d4183de5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4JPDDIRG54EKHGASO6CL4UZUPX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Gap Safe screening rules for sparsity enforcing penalties","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, Eugene Ndiaye, Joseph Salmon, Olivier Fercoq","submitted_at":"2016-11-17T16:55:12Z","abstract_excerpt":"In high dimensional regression settings, sparsity enforcing penalties have proved useful to regularize the data-fitting term. A recently introduced technique called screening rules propose to ignore some variables in the optimization leveraging the expected sparsity of the solutions and consequently leading to faster solvers. When the procedure is guaranteed not to discard variables wrongly the rules are said to be safe. In this work, we propose a unifying framework for generalized linear models regularized with standard sparsity enforcing penalties such as $\\ell_1$ or $\\ell_1/\\ell_2$ norms. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05780","kind":"arxiv","version":4},"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-18T00:27:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sXW7wWB2J3H3houNmfNkujvyg8y+Ckrtv6XV03TH5Mo7NV/YGJ0VxCVjK6T4Nb/Js9Fd842C9OFd7p5Wk+XeBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T10:52:21.786246Z"},"content_sha256":"8515532fa2573d28d793d23b543c07f21a357c75cb868e60e6983bdcb4901ee8","schema_version":"1.0","event_id":"sha256:8515532fa2573d28d793d23b543c07f21a357c75cb868e60e6983bdcb4901ee8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4JPDDIRG54EKHGASO6CL4UZUPX/bundle.json","state_url":"https://pith.science/pith/4JPDDIRG54EKHGASO6CL4UZUPX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4JPDDIRG54EKHGASO6CL4UZUPX/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-07-02T10:52:21Z","links":{"resolver":"https://pith.science/pith/4JPDDIRG54EKHGASO6CL4UZUPX","bundle":"https://pith.science/pith/4JPDDIRG54EKHGASO6CL4UZUPX/bundle.json","state":"https://pith.science/pith/4JPDDIRG54EKHGASO6CL4UZUPX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4JPDDIRG54EKHGASO6CL4UZUPX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4JPDDIRG54EKHGASO6CL4UZUPX","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":"9272c39e0ea61dc12824c183035fcd162d39e1319516827262c9c736143e7016","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-17T16:55:12Z","title_canon_sha256":"0948e107d7ed45eecfcd9b28d38fd4843cf7b91f65b204a8ff19a7247db3d6ae"},"schema_version":"1.0","source":{"id":"1611.05780","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.05780","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"arxiv_version","alias_value":"1611.05780v4","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05780","created_at":"2026-05-18T00:27:09Z"},{"alias_kind":"pith_short_12","alias_value":"4JPDDIRG54EK","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4JPDDIRG54EKHGAS","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4JPDDIRG","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:8515532fa2573d28d793d23b543c07f21a357c75cb868e60e6983bdcb4901ee8","target":"graph","created_at":"2026-05-18T00:27:09Z","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":"In high dimensional regression settings, sparsity enforcing penalties have proved useful to regularize the data-fitting term. A recently introduced technique called screening rules propose to ignore some variables in the optimization leveraging the expected sparsity of the solutions and consequently leading to faster solvers. When the procedure is guaranteed not to discard variables wrongly the rules are said to be safe. In this work, we propose a unifying framework for generalized linear models regularized with standard sparsity enforcing penalties such as $\\ell_1$ or $\\ell_1/\\ell_2$ norms. O","authors_text":"Alexandre Gramfort, Eugene Ndiaye, Joseph Salmon, Olivier Fercoq","cross_cats":["cs.LG","math.OC","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-17T16:55:12Z","title":"Gap Safe screening rules for sparsity enforcing penalties"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05780","kind":"arxiv","version":4},"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:12cedb949ce82e5ab46d3709ea37e9ab7edf1dd2715a6336ba2a7382d4183de5","target":"record","created_at":"2026-05-18T00:27:09Z","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":"9272c39e0ea61dc12824c183035fcd162d39e1319516827262c9c736143e7016","cross_cats_sorted":["cs.LG","math.OC","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-11-17T16:55:12Z","title_canon_sha256":"0948e107d7ed45eecfcd9b28d38fd4843cf7b91f65b204a8ff19a7247db3d6ae"},"schema_version":"1.0","source":{"id":"1611.05780","kind":"arxiv","version":4}},"canonical_sha256":"e25e31a226ef08a398127784be53347de8f01bad71e19d2cb678d32e03ed3624","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e25e31a226ef08a398127784be53347de8f01bad71e19d2cb678d32e03ed3624","first_computed_at":"2026-05-18T00:27:09.832509Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:09.832509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lwZNsQ8uv01kt9a6zDTvTReesywcER9rr3/dcRtUvp2GfKn2ymmFi0c82WK7CHBoN9g2/a9hXUh19snT0E6TAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:09.833206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.05780","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12cedb949ce82e5ab46d3709ea37e9ab7edf1dd2715a6336ba2a7382d4183de5","sha256:8515532fa2573d28d793d23b543c07f21a357c75cb868e60e6983bdcb4901ee8"],"state_sha256":"e4a1a4e051f5b0611afd267b984313b74b0f3936007e31130eac82f10157524e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TUc4JZW293r/6ArMMkwpge6+qIIHvvbHOGdTMWb4TmrvbGvpsNaj8h1cuPQZH6/Ivmf1jMJ1FRwBPserbsvGAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T10:52:21.788123Z","bundle_sha256":"e8262b13c02ef9653a6830a26709f69e3af0ce903eb55b1b4f1eb366ce5a410f"}}