{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:JG543EGGIZS6SJR6D2KZTLPCTI","short_pith_number":"pith:JG543EGG","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"},"canonical_sha256":"49bbcd90c64665e9263e1e9599ade29a06f7a142f0ab251be4debf6e0b4e4448","source":{"kind":"arxiv","id":"1602.08610","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08610","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08610v2","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08610","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"pith_short_12","alias_value":"JG543EGGIZS6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JG543EGGIZS6SJR6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JG543EGG","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:JG543EGGIZS6SJR6D2KZTLPCTI","target":"record","payload":{"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"},"canonical_sha256":"49bbcd90c64665e9263e1e9599ade29a06f7a142f0ab251be4debf6e0b4e4448","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"},"source_kind":"arxiv","source_id":"1602.08610","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-18T00:47:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B/G3jCFRDMOjecPQE0p7H7psZfDwi3ogF59sNn8/5ro+wPWvi34im1Rk50oKbLIPAt4F0M327MycGj4vogVIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T01:43:59.614383Z"},"content_sha256":"88e84f16df4eac21c7c2aff6dd628b50036bed06a112bc7b68b1b793c98beab0","schema_version":"1.0","event_id":"sha256:88e84f16df4eac21c7c2aff6dd628b50036bed06a112bc7b68b1b793c98beab0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:JG543EGGIZS6SJR6D2KZTLPCTI","target":"graph","payload":{"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"},"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:47:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gKJJiredyIUJH6zijyBXqmHdnrVk3+Qj2rnx9L78Neyg6UDXjWy9XD0DvLBE7Q+lpQnryrcnmgmycvMW9+96Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T01:43:59.614812Z"},"content_sha256":"2565c3ae108d36ab8a3dbe1a79d67e38c4a483fc500358b1d426758cbe20ff36","schema_version":"1.0","event_id":"sha256:2565c3ae108d36ab8a3dbe1a79d67e38c4a483fc500358b1d426758cbe20ff36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI/bundle.json","state_url":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JG543EGGIZS6SJR6D2KZTLPCTI/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-24T01:43:59Z","links":{"resolver":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI","bundle":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI/bundle.json","state":"https://pith.science/pith/JG543EGGIZS6SJR6D2KZTLPCTI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JG543EGGIZS6SJR6D2KZTLPCTI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:JG543EGGIZS6SJR6D2KZTLPCTI","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":"10b69a4c4dae08087d151662e5b7ca67bb03e9fe2099958f201604c0e5f0f11e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2016-02-27T16:29:24Z","title_canon_sha256":"40295c850f15ab7ea1938b96c9dc8ec12e568526de82e58ea4973d17c21c1bd8"},"schema_version":"1.0","source":{"id":"1602.08610","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08610","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08610v2","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08610","created_at":"2026-05-18T00:47:29Z"},{"alias_kind":"pith_short_12","alias_value":"JG543EGGIZS6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"JG543EGGIZS6SJR6","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"JG543EGG","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:2565c3ae108d36ab8a3dbe1a79d67e38c4a483fc500358b1d426758cbe20ff36","target":"graph","created_at":"2026-05-18T00:47:29Z","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 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","authors_text":"Cynthia Rudin, Hongyu Yang, Margo Seltzer","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2016-02-27T16:29:24Z","title":"Scalable Bayesian Rule Lists"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08610","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:88e84f16df4eac21c7c2aff6dd628b50036bed06a112bc7b68b1b793c98beab0","target":"record","created_at":"2026-05-18T00:47:29Z","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":"10b69a4c4dae08087d151662e5b7ca67bb03e9fe2099958f201604c0e5f0f11e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2016-02-27T16:29:24Z","title_canon_sha256":"40295c850f15ab7ea1938b96c9dc8ec12e568526de82e58ea4973d17c21c1bd8"},"schema_version":"1.0","source":{"id":"1602.08610","kind":"arxiv","version":2}},"canonical_sha256":"49bbcd90c64665e9263e1e9599ade29a06f7a142f0ab251be4debf6e0b4e4448","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49bbcd90c64665e9263e1e9599ade29a06f7a142f0ab251be4debf6e0b4e4448","first_computed_at":"2026-05-18T00:47:29.330370Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:47:29.330370Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6LVt+RBLvvHm346hvrWD3U9yRRieO/6c3AevrEnm4RGhzvNpdtVcezOBe39XiNqu9L1ED6SSoLlIjRFvyqOWAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:47:29.331029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08610","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88e84f16df4eac21c7c2aff6dd628b50036bed06a112bc7b68b1b793c98beab0","sha256:2565c3ae108d36ab8a3dbe1a79d67e38c4a483fc500358b1d426758cbe20ff36"],"state_sha256":"7e862fbf6501f19cc743dcd753ede36ca6558fa90feb8c21b5d244a149d8af04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0dsGHTGKZ8KTkZsmYmPEOoQBnQRbA8un4ItCdiD0IuQDaBUaWnU5lrFFsIELaA0J314h4ElonpNUugkoNGVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T01:43:59.618416Z","bundle_sha256":"04e8341a5aa77204df820e2c44a554dd0ff80f871f20ccbb76f5b449f5390dcc"}}