{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:BQO4O2SFD5FKNJYAKJ7DS5W6WN","short_pith_number":"pith:BQO4O2SF","canonical_record":{"source":{"id":"2007.15140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-07-29T22:35:22Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ac9acfeefc369101532b755801aaa5d300458bf557cefe318b5d2d83a31fc4b5","abstract_canon_sha256":"fcdf9d7964e25c13e24783082fcdf96906e099fdb7a47a5cabb891fb51eb033d"},"schema_version":"1.0"},"canonical_sha256":"0c1dc76a451f4aa6a700527e3976deb348694ab5e9b99c0bf7f58cc7867418cf","source":{"kind":"arxiv","id":"2007.15140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.15140","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"2007.15140v1","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.15140","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"BQO4O2SFD5FK","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"BQO4O2SFD5FKNJYA","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"BQO4O2SF","created_at":"2026-07-05T01:23:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:BQO4O2SFD5FKNJYAKJ7DS5W6WN","target":"record","payload":{"canonical_record":{"source":{"id":"2007.15140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-07-29T22:35:22Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ac9acfeefc369101532b755801aaa5d300458bf557cefe318b5d2d83a31fc4b5","abstract_canon_sha256":"fcdf9d7964e25c13e24783082fcdf96906e099fdb7a47a5cabb891fb51eb033d"},"schema_version":"1.0"},"canonical_sha256":"0c1dc76a451f4aa6a700527e3976deb348694ab5e9b99c0bf7f58cc7867418cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:23:27.656930Z","signature_b64":"XbdmMtabl9dkMjCLCIS1vQSCT5iQBOt0nvNcUgcxEExxE17H/PRk2GGL0SQ/HUtz+cDb+q19UPGuvs9LNO1nCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c1dc76a451f4aa6a700527e3976deb348694ab5e9b99c0bf7f58cc7867418cf","last_reissued_at":"2026-07-05T01:23:27.656525Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:23:27.656525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.15140","source_version":1,"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-07-05T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUdao6qBTLChB02UXTeEWDAWggREZNKz5zM1gT1tOojMyYbkOgNwJFflsRQgNzh5OnvYsEqlWhj7x+gk6hsCDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:10:24.780966Z"},"content_sha256":"f47faafefa6388239a72ad25dc95bf08862bffe20b76084388025fd0e66c94ee","schema_version":"1.0","event_id":"sha256:f47faafefa6388239a72ad25dc95bf08862bffe20b76084388025fd0e66c94ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:BQO4O2SFD5FKNJYAKJ7DS5W6WN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing Optimal Decision Sets with SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.AI","authors_text":"Alexey Ignatiev, Jinqiang Yu, Peter J. Stuckey, Pierre Le Bodic","submitted_at":"2020-07-29T22:35:22Z","abstract_excerpt":"As machine learning is increasingly used to help make decisions, there is a demand for these decisions to be explainable. Arguably, the most explainable machine learning models use decision rules. This paper focuses on decision sets, a type of model with unordered rules, which explains each prediction with a single rule. In order to be easy for humans to understand, these rules must be concise. Earlier work on generating optimal decision sets first minimizes the number of rules, and then minimizes the number of literals, but the resulting rules can often be very large. Here we consider a bette"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.15140","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2007.15140/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:23:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8ZUqT8HlebECkLl7C1QbWm2xSPV5n55u9m/6sF2Ul5UO3almramxrTwwDRZ83QQY++QFqoi1YYoA0RQI3kzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T21:10:24.781819Z"},"content_sha256":"5bb8665af6c502a239af8e7eda7f586616a675fc4ba8a897ad94316b9cdd1150","schema_version":"1.0","event_id":"sha256:5bb8665af6c502a239af8e7eda7f586616a675fc4ba8a897ad94316b9cdd1150"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQO4O2SFD5FKNJYAKJ7DS5W6WN/bundle.json","state_url":"https://pith.science/pith/BQO4O2SFD5FKNJYAKJ7DS5W6WN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQO4O2SFD5FKNJYAKJ7DS5W6WN/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-08-05T21:10:24Z","links":{"resolver":"https://pith.science/pith/BQO4O2SFD5FKNJYAKJ7DS5W6WN","bundle":"https://pith.science/pith/BQO4O2SFD5FKNJYAKJ7DS5W6WN/bundle.json","state":"https://pith.science/pith/BQO4O2SFD5FKNJYAKJ7DS5W6WN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQO4O2SFD5FKNJYAKJ7DS5W6WN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:BQO4O2SFD5FKNJYAKJ7DS5W6WN","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":"fcdf9d7964e25c13e24783082fcdf96906e099fdb7a47a5cabb891fb51eb033d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-07-29T22:35:22Z","title_canon_sha256":"ac9acfeefc369101532b755801aaa5d300458bf557cefe318b5d2d83a31fc4b5"},"schema_version":"1.0","source":{"id":"2007.15140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.15140","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"arxiv_version","alias_value":"2007.15140v1","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.15140","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"pith_short_12","alias_value":"BQO4O2SFD5FK","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"pith_short_16","alias_value":"BQO4O2SFD5FKNJYA","created_at":"2026-07-05T01:23:27Z"},{"alias_kind":"pith_short_8","alias_value":"BQO4O2SF","created_at":"2026-07-05T01:23:27Z"}],"graph_snapshots":[{"event_id":"sha256:5bb8665af6c502a239af8e7eda7f586616a675fc4ba8a897ad94316b9cdd1150","target":"graph","created_at":"2026-07-05T01:23:27Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2007.15140/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"As machine learning is increasingly used to help make decisions, there is a demand for these decisions to be explainable. Arguably, the most explainable machine learning models use decision rules. This paper focuses on decision sets, a type of model with unordered rules, which explains each prediction with a single rule. In order to be easy for humans to understand, these rules must be concise. Earlier work on generating optimal decision sets first minimizes the number of rules, and then minimizes the number of literals, but the resulting rules can often be very large. Here we consider a bette","authors_text":"Alexey Ignatiev, Jinqiang Yu, Peter J. Stuckey, Pierre Le Bodic","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-07-29T22:35:22Z","title":"Computing Optimal Decision Sets with SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.15140","kind":"arxiv","version":1},"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:f47faafefa6388239a72ad25dc95bf08862bffe20b76084388025fd0e66c94ee","target":"record","created_at":"2026-07-05T01:23:27Z","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":"fcdf9d7964e25c13e24783082fcdf96906e099fdb7a47a5cabb891fb51eb033d","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-07-29T22:35:22Z","title_canon_sha256":"ac9acfeefc369101532b755801aaa5d300458bf557cefe318b5d2d83a31fc4b5"},"schema_version":"1.0","source":{"id":"2007.15140","kind":"arxiv","version":1}},"canonical_sha256":"0c1dc76a451f4aa6a700527e3976deb348694ab5e9b99c0bf7f58cc7867418cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c1dc76a451f4aa6a700527e3976deb348694ab5e9b99c0bf7f58cc7867418cf","first_computed_at":"2026-07-05T01:23:27.656525Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:23:27.656525Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XbdmMtabl9dkMjCLCIS1vQSCT5iQBOt0nvNcUgcxEExxE17H/PRk2GGL0SQ/HUtz+cDb+q19UPGuvs9LNO1nCw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:23:27.656930Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.15140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f47faafefa6388239a72ad25dc95bf08862bffe20b76084388025fd0e66c94ee","sha256:5bb8665af6c502a239af8e7eda7f586616a675fc4ba8a897ad94316b9cdd1150"],"state_sha256":"ecac4f504bb165be6ecdf85549952c01830d0ddc2e327e917114333a63ae1b1b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mkTrt3Ofz+bBJipUdF5jSWyqYMUpfliTWTuYJfa/Wkyhe643SZJpzVkcDNIROd916UcLBiWnw1r77J99irQHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T21:10:24.788709Z","bundle_sha256":"9fbb0c3dde551a53d5b4a9059cfe53d3482391710e02f4b0e2ebfdb35978817d"}}