{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:O4TOJZKFHDQ4D2RSWIGE3TXVGW","short_pith_number":"pith:O4TOJZKF","canonical_record":{"source":{"id":"1009.4219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-21T21:13:15Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"43e0f0d836c74aa50cd0fe61010025fdccb51ad213f11fe803b23fced9f56e39","abstract_canon_sha256":"edc375b735d771dc1670b61529f130a4affd5292423eceaf506129735e59d3d9"},"schema_version":"1.0"},"canonical_sha256":"7726e4e54538e1c1ea32b20c4dcef535b5f0f57a0b16ec61de73ae06ac827205","source":{"kind":"arxiv","id":"1009.4219","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4219","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4219v2","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4219","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"pith_short_12","alias_value":"O4TOJZKFHDQ4","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O4TOJZKFHDQ4D2RS","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O4TOJZKF","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:O4TOJZKFHDQ4D2RSWIGE3TXVGW","target":"record","payload":{"canonical_record":{"source":{"id":"1009.4219","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-21T21:13:15Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"43e0f0d836c74aa50cd0fe61010025fdccb51ad213f11fe803b23fced9f56e39","abstract_canon_sha256":"edc375b735d771dc1670b61529f130a4affd5292423eceaf506129735e59d3d9"},"schema_version":"1.0"},"canonical_sha256":"7726e4e54538e1c1ea32b20c4dcef535b5f0f57a0b16ec61de73ae06ac827205","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:52.967950Z","signature_b64":"Rl46t3C4vVlRpmMtOUzkmFmBs1lVBcawlZ+wmbBBV7aWbygnfAYBZg/axd6J+IlVM+14L2kX3Vsr+UfBjdQbCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7726e4e54538e1c1ea32b20c4dcef535b5f0f57a0b16ec61de73ae06ac827205","last_reissued_at":"2026-05-18T04:21:52.967473Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:52.967473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1009.4219","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:21:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SJReT00enqEN3NvYv8zXPuEzYPyO0lVxDHrsIap1HSg44yMylp8d4XT9a4suh/Q3axcZ3K6dAMQn8CpNF88MAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:40:22.843410Z"},"content_sha256":"390e78e21a6105e0bb77b0443d977ac9e06db076459b46212686f8dbacddb8fa","schema_version":"1.0","event_id":"sha256:390e78e21a6105e0bb77b0443d977ac9e06db076459b46212686f8dbacddb8fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:O4TOJZKFHDQ4D2RSWIGE3TXVGW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe Feature Elimination for the LASSO and Sparse Supervised Learning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"cs.LG","authors_text":"Laurent El Ghaoui, Tarek Rabbani, Vivian Viallon","submitted_at":"2010-09-21T21:13:15Z","abstract_excerpt":"We describe a fast method to eliminate features (variables) in l1 -penalized least-square regression (or LASSO) problems. The elimination of features leads to a potentially substantial reduction in running time, specially for large values of the penalty parameter. Our method is not heuristic: it only eliminates features that are guaranteed to be absent after solving the LASSO problem. The feature elimination step is easy to parallelize and can test each feature for elimination independently. Moreover, the computational effort of our method is negligible compared to that of solving the LASSO pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4219","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:21:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZUekPM/MrDFxoLpRT+PzKtW/eyt9hPM8g/KiOfc19oDOzBlhtMaKihISuNoOTci/tK2aT8nQI923Jv4yd0h8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:40:22.843757Z"},"content_sha256":"8cec83987461e01d4a36c52096e09e7be9f53f4258dbf4f34bbe98e8570e8158","schema_version":"1.0","event_id":"sha256:8cec83987461e01d4a36c52096e09e7be9f53f4258dbf4f34bbe98e8570e8158"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O4TOJZKFHDQ4D2RSWIGE3TXVGW/bundle.json","state_url":"https://pith.science/pith/O4TOJZKFHDQ4D2RSWIGE3TXVGW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O4TOJZKFHDQ4D2RSWIGE3TXVGW/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-02T05:40:22Z","links":{"resolver":"https://pith.science/pith/O4TOJZKFHDQ4D2RSWIGE3TXVGW","bundle":"https://pith.science/pith/O4TOJZKFHDQ4D2RSWIGE3TXVGW/bundle.json","state":"https://pith.science/pith/O4TOJZKFHDQ4D2RSWIGE3TXVGW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O4TOJZKFHDQ4D2RSWIGE3TXVGW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:O4TOJZKFHDQ4D2RSWIGE3TXVGW","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":"edc375b735d771dc1670b61529f130a4affd5292423eceaf506129735e59d3d9","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-21T21:13:15Z","title_canon_sha256":"43e0f0d836c74aa50cd0fe61010025fdccb51ad213f11fe803b23fced9f56e39"},"schema_version":"1.0","source":{"id":"1009.4219","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1009.4219","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"arxiv_version","alias_value":"1009.4219v2","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.4219","created_at":"2026-05-18T04:21:52Z"},{"alias_kind":"pith_short_12","alias_value":"O4TOJZKFHDQ4","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"O4TOJZKFHDQ4D2RS","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"O4TOJZKF","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:8cec83987461e01d4a36c52096e09e7be9f53f4258dbf4f34bbe98e8570e8158","target":"graph","created_at":"2026-05-18T04:21:52Z","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 describe a fast method to eliminate features (variables) in l1 -penalized least-square regression (or LASSO) problems. The elimination of features leads to a potentially substantial reduction in running time, specially for large values of the penalty parameter. Our method is not heuristic: it only eliminates features that are guaranteed to be absent after solving the LASSO problem. The feature elimination step is easy to parallelize and can test each feature for elimination independently. Moreover, the computational effort of our method is negligible compared to that of solving the LASSO pr","authors_text":"Laurent El Ghaoui, Tarek Rabbani, Vivian Viallon","cross_cats":["cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-21T21:13:15Z","title":"Safe Feature Elimination for the LASSO and Sparse Supervised Learning Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.4219","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:390e78e21a6105e0bb77b0443d977ac9e06db076459b46212686f8dbacddb8fa","target":"record","created_at":"2026-05-18T04:21:52Z","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":"edc375b735d771dc1670b61529f130a4affd5292423eceaf506129735e59d3d9","cross_cats_sorted":["cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-21T21:13:15Z","title_canon_sha256":"43e0f0d836c74aa50cd0fe61010025fdccb51ad213f11fe803b23fced9f56e39"},"schema_version":"1.0","source":{"id":"1009.4219","kind":"arxiv","version":2}},"canonical_sha256":"7726e4e54538e1c1ea32b20c4dcef535b5f0f57a0b16ec61de73ae06ac827205","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7726e4e54538e1c1ea32b20c4dcef535b5f0f57a0b16ec61de73ae06ac827205","first_computed_at":"2026-05-18T04:21:52.967473Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:52.967473Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rl46t3C4vVlRpmMtOUzkmFmBs1lVBcawlZ+wmbBBV7aWbygnfAYBZg/axd6J+IlVM+14L2kX3Vsr+UfBjdQbCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:52.967950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1009.4219","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:390e78e21a6105e0bb77b0443d977ac9e06db076459b46212686f8dbacddb8fa","sha256:8cec83987461e01d4a36c52096e09e7be9f53f4258dbf4f34bbe98e8570e8158"],"state_sha256":"26359f3b5be9cc308af7cc8d0fa5968803865ce73e8b3914480c234779f0d079"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+mlooQtmXErqlWOQ2QSSdV1tEB+qykOe3SogQavUAMeImit5qmGrojvTYXzRM5HmA390UFGViVkmSv/jRR7zBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T05:40:22.845886Z","bundle_sha256":"6b39686adfaab2b3d56405598480249a56c919756aef6c6c64d4e5bba47fb309"}}