{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AEK4ZFBMFSUT6XLCYTP53KCQHX","short_pith_number":"pith:AEK4ZFBM","canonical_record":{"source":{"id":"1704.01701","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-06T04:02:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dbf781f55b284becbb0ade5595267e34a7c9e0d6712452346983c39e494229f2","abstract_canon_sha256":"36db0fa00e7880ed0ee417ede0622061b9b324b6f180beffb304efb9d531fa47"},"schema_version":"1.0"},"canonical_sha256":"0115cc942c2ca93f5d62c4dfdda8503dfb3465377ad7c083aef9d0b687592357","source":{"kind":"arxiv","id":"1704.01701","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01701","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01701v4","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01701","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"AEK4ZFBMFSUT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AEK4ZFBMFSUT6XLC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AEK4ZFBM","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AEK4ZFBMFSUT6XLCYTP53KCQHX","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01701","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-06T04:02:35Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"dbf781f55b284becbb0ade5595267e34a7c9e0d6712452346983c39e494229f2","abstract_canon_sha256":"36db0fa00e7880ed0ee417ede0622061b9b324b6f180beffb304efb9d531fa47"},"schema_version":"1.0"},"canonical_sha256":"0115cc942c2ca93f5d62c4dfdda8503dfb3465377ad7c083aef9d0b687592357","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:55.416174Z","signature_b64":"J6BelDIdGWTGMOn3YXLYhpm0G/E+aOSLUXsu7ApZSkddg4pcxeKfpK0nLkxQXJ9dKOP5PGB4V2VahX9bHrr4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0115cc942c2ca93f5d62c4dfdda8503dfb3465377ad7c083aef9d0b687592357","last_reissued_at":"2026-05-18T00:08:55.415661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:55.415661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01701","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:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Qbd+dmxr+WATbYFtT9QeLC+P6DskHxIF0SL2im+7u96WwZ+TqaNrd9L0Zhzu6W9Kk+fcQYfWSzuM3JDnBCXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:45:10.471996Z"},"content_sha256":"961e18707858463841b058f9e78de0c1bc795d46bc3c967955d4389ab29b0b43","schema_version":"1.0","event_id":"sha256:961e18707858463841b058f9e78de0c1bc795d46bc3c967955d4389ab29b0b43"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AEK4ZFBMFSUT6XLCYTP53KCQHX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Certifiably Optimal Rule Lists for Categorical Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Cynthia Rudin, Daniel Alabi, Elaine Angelino, Margo Seltzer, Nicholas Larus-Stone","submitted_at":"2017-04-06T04:02:35Z","abstract_excerpt":"We present the design and implementation of a custom discrete optimization technique for building rule lists over a categorical feature space. Our algorithm produces rule lists with optimal training performance, according to the regularized empirical risk, with a certificate of optimality. By leveraging algorithmic bounds, efficient data structures, and computational reuse, we achieve several orders of magnitude speedup in time and a massive reduction of memory consumption. We demonstrate that our approach produces optimal rule lists on practical problems in seconds. Our results indicate that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01701","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:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jej1v8DWT0tNObKNJgqpSwUefCYill/B/uabQfdZ53CfYEpjo9csk2qM5lczy+czcxnF2lrNjw9704sLUgG6Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T00:45:10.472659Z"},"content_sha256":"b835ff21352ac7ae7bb4ed1595898b747ab1bf270e539f008666b34eebaaa7d2","schema_version":"1.0","event_id":"sha256:b835ff21352ac7ae7bb4ed1595898b747ab1bf270e539f008666b34eebaaa7d2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEK4ZFBMFSUT6XLCYTP53KCQHX/bundle.json","state_url":"https://pith.science/pith/AEK4ZFBMFSUT6XLCYTP53KCQHX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEK4ZFBMFSUT6XLCYTP53KCQHX/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-05-20T00:45:10Z","links":{"resolver":"https://pith.science/pith/AEK4ZFBMFSUT6XLCYTP53KCQHX","bundle":"https://pith.science/pith/AEK4ZFBMFSUT6XLCYTP53KCQHX/bundle.json","state":"https://pith.science/pith/AEK4ZFBMFSUT6XLCYTP53KCQHX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEK4ZFBMFSUT6XLCYTP53KCQHX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AEK4ZFBMFSUT6XLCYTP53KCQHX","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":"36db0fa00e7880ed0ee417ede0622061b9b324b6f180beffb304efb9d531fa47","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-06T04:02:35Z","title_canon_sha256":"dbf781f55b284becbb0ade5595267e34a7c9e0d6712452346983c39e494229f2"},"schema_version":"1.0","source":{"id":"1704.01701","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01701","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01701v4","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01701","created_at":"2026-05-18T00:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"AEK4ZFBMFSUT","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AEK4ZFBMFSUT6XLC","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AEK4ZFBM","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:b835ff21352ac7ae7bb4ed1595898b747ab1bf270e539f008666b34eebaaa7d2","target":"graph","created_at":"2026-05-18T00:08:55Z","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 present the design and implementation of a custom discrete optimization technique for building rule lists over a categorical feature space. Our algorithm produces rule lists with optimal training performance, according to the regularized empirical risk, with a certificate of optimality. By leveraging algorithmic bounds, efficient data structures, and computational reuse, we achieve several orders of magnitude speedup in time and a massive reduction of memory consumption. We demonstrate that our approach produces optimal rule lists on practical problems in seconds. Our results indicate that ","authors_text":"Cynthia Rudin, Daniel Alabi, Elaine Angelino, Margo Seltzer, Nicholas Larus-Stone","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-06T04:02:35Z","title":"Learning Certifiably Optimal Rule Lists for Categorical Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01701","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:961e18707858463841b058f9e78de0c1bc795d46bc3c967955d4389ab29b0b43","target":"record","created_at":"2026-05-18T00:08:55Z","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":"36db0fa00e7880ed0ee417ede0622061b9b324b6f180beffb304efb9d531fa47","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-06T04:02:35Z","title_canon_sha256":"dbf781f55b284becbb0ade5595267e34a7c9e0d6712452346983c39e494229f2"},"schema_version":"1.0","source":{"id":"1704.01701","kind":"arxiv","version":4}},"canonical_sha256":"0115cc942c2ca93f5d62c4dfdda8503dfb3465377ad7c083aef9d0b687592357","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0115cc942c2ca93f5d62c4dfdda8503dfb3465377ad7c083aef9d0b687592357","first_computed_at":"2026-05-18T00:08:55.415661Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:55.415661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J6BelDIdGWTGMOn3YXLYhpm0G/E+aOSLUXsu7ApZSkddg4pcxeKfpK0nLkxQXJ9dKOP5PGB4V2VahX9bHrr4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:55.416174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01701","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:961e18707858463841b058f9e78de0c1bc795d46bc3c967955d4389ab29b0b43","sha256:b835ff21352ac7ae7bb4ed1595898b747ab1bf270e539f008666b34eebaaa7d2"],"state_sha256":"9dfd51356cf1fcf11f3acdc5b63b57c41f3d184e1436bd7b7b966070cd0fe093"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nef7a1WfP4UKvGt7kS52R3VjYiDCLmsICH3tl2rK1aX/S90zdxebFO3m/URQd5FxBNd+2cWDk8MBLSMau2cEAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T00:45:10.477953Z","bundle_sha256":"0b30a078290d9665e6570f3bb1f35f28829b3226bfafb79775cb78fdcb9c7032"}}