{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JG543EGGIZS6SJR6D2KZTLPCTI","short_pith_number":"pith:JG543EGG","schema_version":"1.0","canonical_sha256":"49bbcd90c64665e9263e1e9599ade29a06f7a142f0ab251be4debf6e0b4e4448","source":{"kind":"arxiv","id":"1602.08610","version":2},"attestation_state":"computed","paper":{"title":"Scalable Bayesian Rule Lists","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Cynthia Rudin, Hongyu Yang, Margo Seltzer","submitted_at":"2016-02-27T16:29:24Z","abstract_excerpt":"We present an algorithm for building probabilistic rule lists that is two orders of magnitude faster than previous work. Rule list algorithms are competitors for decision tree algorithms. They are associative classifiers, in that they are built from pre-mined association rules. They have a logical structure that is a sequence of IF-THEN rules, identical to a decision list or one-sided decision tree. Instead of using greedy splitting and pruning like decision tree algorithms, we fully optimize over rule lists, striking a practical balance between accuracy, interpretability, and computational sp"},"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":"1602.08610","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2016-02-27T16:29:24Z","cross_cats_sorted":[],"title_canon_sha256":"40295c850f15ab7ea1938b96c9dc8ec12e568526de82e58ea4973d17c21c1bd8","abstract_canon_sha256":"10b69a4c4dae08087d151662e5b7ca67bb03e9fe2099958f201604c0e5f0f11e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:29.331029Z","signature_b64":"6LVt+RBLvvHm346hvrWD3U9yRRieO/6c3AevrEnm4RGhzvNpdtVcezOBe39XiNqu9L1ED6SSoLlIjRFvyqOWAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49bbcd90c64665e9263e1e9599ade29a06f7a142f0ab251be4debf6e0b4e4448","last_reissued_at":"2026-05-18T00:47:29.330370Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:29.330370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Bayesian Rule Lists","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Cynthia Rudin, Hongyu Yang, Margo Seltzer","submitted_at":"2016-02-27T16:29:24Z","abstract_excerpt":"We present an algorithm for building probabilistic rule lists that is two orders of magnitude faster than previous work. Rule list algorithms are competitors for decision tree algorithms. They are associative classifiers, in that they are built from pre-mined association rules. They have a logical structure that is a sequence of IF-THEN rules, identical to a decision list or one-sided decision tree. Instead of using greedy splitting and pruning like decision tree algorithms, we fully optimize over rule lists, striking a practical balance between accuracy, interpretability, and computational sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08610","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":"1602.08610","created_at":"2026-05-18T00:47:29.330501+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08610v2","created_at":"2026-05-18T00:47:29.330501+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08610","created_at":"2026-05-18T00:47:29.330501+00:00"},{"alias_kind":"pith_short_12","alias_value":"JG543EGGIZS6","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JG543EGGIZS6SJR6","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JG543EGG","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI","json":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI.json","graph_json":"https://pith.science/api/pith-number/JG543EGGIZS6SJR6D2KZTLPCTI/graph.json","events_json":"https://pith.science/api/pith-number/JG543EGGIZS6SJR6D2KZTLPCTI/events.json","paper":"https://pith.science/paper/JG543EGG"},"agent_actions":{"view_html":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI","download_json":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI.json","view_paper":"https://pith.science/paper/JG543EGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08610&json=true","fetch_graph":"https://pith.science/api/pith-number/JG543EGGIZS6SJR6D2KZTLPCTI/graph.json","fetch_events":"https://pith.science/api/pith-number/JG543EGGIZS6SJR6D2KZTLPCTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI/action/storage_attestation","attest_author":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI/action/author_attestation","sign_citation":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI/action/citation_signature","submit_replication":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI/action/replication_record"}},"created_at":"2026-05-18T00:47:29.330501+00:00","updated_at":"2026-05-18T00:47:29.330501+00:00"}