{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:NLADDYAA4AIDYRQGP4CWRRYZF4","short_pith_number":"pith:NLADDYAA","canonical_record":{"source":{"id":"1009.3515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-17T21:29:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f2bf99252be3681ab61ef00e4ab1625f6b047ff7db43f8b29c999fb634b055df","abstract_canon_sha256":"81b3356abf34fed8909a2f9ab72e9f135110a44be32ce86b1c076ba39d775c54"},"schema_version":"1.0"},"canonical_sha256":"6ac031e000e0103c46067f0568c7192f0df3ae4585759fa9117f7bd358d03453","source":{"kind":"arxiv","id":"1009.3515","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3515","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3515v2","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3515","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"pith_short_12","alias_value":"NLADDYAA4AID","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NLADDYAA4AIDYRQG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NLADDYAA","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:NLADDYAA4AIDYRQGP4CWRRYZF4","target":"record","payload":{"canonical_record":{"source":{"id":"1009.3515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-17T21:29:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f2bf99252be3681ab61ef00e4ab1625f6b047ff7db43f8b29c999fb634b055df","abstract_canon_sha256":"81b3356abf34fed8909a2f9ab72e9f135110a44be32ce86b1c076ba39d775c54"},"schema_version":"1.0"},"canonical_sha256":"6ac031e000e0103c46067f0568c7192f0df3ae4585759fa9117f7bd358d03453","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:38:16.648188Z","signature_b64":"aECBrRozi1xlLEsC+pORX4esCHd9mk+hu1PDtSBCH8XU0agdBJd4mKGDpfMBmcc2Jk+MUs6O4cBX18FrEtq0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ac031e000e0103c46067f0568c7192f0df3ae4585759fa9117f7bd358d03453","last_reissued_at":"2026-05-18T04:38:16.647488Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:38:16.647488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.3515","source_version":2,"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:38:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"snPa2lGbWS7HVR8QrOQWuTWMr0O4jYg9dFfWtvAOo3zCk8QMa44CgRs+rSgRQ7o8WolJb1pH0gSXtlN/YUu4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:03:44.479476Z"},"content_sha256":"8dce7746693e5c466a4a293b1d93012cf31925b60e96e2e03b18256bcdf418c2","schema_version":"1.0","event_id":"sha256:8dce7746693e5c466a4a293b1d93012cf31925b60e96e2e03b18256bcdf418c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:NLADDYAA4AIDYRQGP4CWRRYZF4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe Feature Elimination in Sparse Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Laurent El Ghaoui, Tarek Rabbani, Vivian Viallon","submitted_at":"2010-09-17T21:29:09Z","abstract_excerpt":"We investigate fast methods that allow to quickly eliminate variables (features) in supervised learning problems involving a convex loss function and a $l_1$-norm penalty, leading to a potentially substantial reduction in the number of variables prior to running the supervised learning algorithm. The methods are not heuristic: they only eliminate features that are {\\em guaranteed} to be absent after solving the learning problem. Our framework applies to a large class of problems, including support vector machine classification, logistic regression and least-squares.\n  The complexity of the fea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3515","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"},"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:38:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p90D9YOhKVxeHTtHKuqE3yEbjpBsIc9c3zzAfDxXuzbz9cJuH0b3mMBHYYHM1E0ItIRz+1oufBcsLXdTLcMgDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T07:03:44.479823Z"},"content_sha256":"e500667333736fddd195cb6040093f7592646173b30bda8e18d7ec5c43036065","schema_version":"1.0","event_id":"sha256:e500667333736fddd195cb6040093f7592646173b30bda8e18d7ec5c43036065"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/bundle.json","state_url":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/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-02T07:03:44Z","links":{"resolver":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4","bundle":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/bundle.json","state":"https://pith.science/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NLADDYAA4AIDYRQGP4CWRRYZF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NLADDYAA4AIDYRQGP4CWRRYZF4","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":"81b3356abf34fed8909a2f9ab72e9f135110a44be32ce86b1c076ba39d775c54","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-17T21:29:09Z","title_canon_sha256":"f2bf99252be3681ab61ef00e4ab1625f6b047ff7db43f8b29c999fb634b055df"},"schema_version":"1.0","source":{"id":"1009.3515","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.3515","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"arxiv_version","alias_value":"1009.3515v2","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3515","created_at":"2026-05-18T04:38:16Z"},{"alias_kind":"pith_short_12","alias_value":"NLADDYAA4AID","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NLADDYAA4AIDYRQG","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NLADDYAA","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:e500667333736fddd195cb6040093f7592646173b30bda8e18d7ec5c43036065","target":"graph","created_at":"2026-05-18T04:38:16Z","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 investigate fast methods that allow to quickly eliminate variables (features) in supervised learning problems involving a convex loss function and a $l_1$-norm penalty, leading to a potentially substantial reduction in the number of variables prior to running the supervised learning algorithm. The methods are not heuristic: they only eliminate features that are {\\em guaranteed} to be absent after solving the learning problem. Our framework applies to a large class of problems, including support vector machine classification, logistic regression and least-squares.\n  The complexity of the fea","authors_text":"Laurent El Ghaoui, Tarek Rabbani, Vivian Viallon","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-17T21:29:09Z","title":"Safe Feature Elimination in Sparse Supervised Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3515","kind":"arxiv","version":2},"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:8dce7746693e5c466a4a293b1d93012cf31925b60e96e2e03b18256bcdf418c2","target":"record","created_at":"2026-05-18T04:38:16Z","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":"81b3356abf34fed8909a2f9ab72e9f135110a44be32ce86b1c076ba39d775c54","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-17T21:29:09Z","title_canon_sha256":"f2bf99252be3681ab61ef00e4ab1625f6b047ff7db43f8b29c999fb634b055df"},"schema_version":"1.0","source":{"id":"1009.3515","kind":"arxiv","version":2}},"canonical_sha256":"6ac031e000e0103c46067f0568c7192f0df3ae4585759fa9117f7bd358d03453","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ac031e000e0103c46067f0568c7192f0df3ae4585759fa9117f7bd358d03453","first_computed_at":"2026-05-18T04:38:16.647488Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:16.647488Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aECBrRozi1xlLEsC+pORX4esCHd9mk+hu1PDtSBCH8XU0agdBJd4mKGDpfMBmcc2Jk+MUs6O4cBX18FrEtq0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:16.648188Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.3515","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8dce7746693e5c466a4a293b1d93012cf31925b60e96e2e03b18256bcdf418c2","sha256:e500667333736fddd195cb6040093f7592646173b30bda8e18d7ec5c43036065"],"state_sha256":"a7330c19a7c045a5791eaa0848d21928507a7f11831216d8609d0bf16f5dde3c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zT64/H5Xx+jecWTlwoUzG2niAKm7hYEctcWZ2J/SX6hvlONyY+q4CBE9PKZHHfmUasD1wV44YwKeHz+c2V2nBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T07:03:44.482747Z","bundle_sha256":"df41c03cd4c67446cba4a03ed243657da3809ce58c4525ee153f59496aee80e4"}}