{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:KUH3SD2AEGPCZKTAQXL75SF6YY","short_pith_number":"pith:KUH3SD2A","canonical_record":{"source":{"id":"2010.09919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-19T23:33:42Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"0f7ada0fd98d4791c5ece849675d100c605f0b30c89925ec2f99eb8c7646357a","abstract_canon_sha256":"9217cf72adc7d47b461b1d5afff81c869e8caf5e34c87c99498cd6afacc8e82f"},"schema_version":"1.0"},"canonical_sha256":"550fb90f40219e2caa6085d7fec8bec61ee5c053d1ccea9144ddb77f462523fa","source":{"kind":"arxiv","id":"2010.09919","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.09919","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"2010.09919v1","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09919","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"KUH3SD2AEGPC","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"pith_short_16","alias_value":"KUH3SD2AEGPCZKTA","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"pith_short_8","alias_value":"KUH3SD2A","created_at":"2026-07-05T01:44:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:KUH3SD2AEGPCZKTAQXL75SF6YY","target":"record","payload":{"canonical_record":{"source":{"id":"2010.09919","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-19T23:33:42Z","cross_cats_sorted":["cs.LG","cs.LO"],"title_canon_sha256":"0f7ada0fd98d4791c5ece849675d100c605f0b30c89925ec2f99eb8c7646357a","abstract_canon_sha256":"9217cf72adc7d47b461b1d5afff81c869e8caf5e34c87c99498cd6afacc8e82f"},"schema_version":"1.0"},"canonical_sha256":"550fb90f40219e2caa6085d7fec8bec61ee5c053d1ccea9144ddb77f462523fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:44:25.157859Z","signature_b64":"lwOtgqjk/XEUdwl/TGVn19NcKSu8ds8t3VV3jEH73SFcY9tKKzTRWB4UeZ19I4Gmi8nhjp8gi77cWwPANcm0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"550fb90f40219e2caa6085d7fec8bec61ee5c053d1ccea9144ddb77f462523fa","last_reissued_at":"2026-07-05T01:44:25.157447Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:44:25.157447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.09919","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:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"74OvnVqh6fIb64iDYQXgteQyyoklPW0veUrQOOU+jjvFILKBTEwa03FjtYU3JJrD30MI8e//OSQy25WLDn7kCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:11:40.554749Z"},"content_sha256":"9f807ce29b0c675c692fc35462ad326da14f3e9d9f496a9abbd534b37f8a4808","schema_version":"1.0","event_id":"sha256:9f807ce29b0c675c692fc35462ad326da14f3e9d9f496a9abbd534b37f8a4808"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:KUH3SD2AEGPCZKTAQXL75SF6YY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Decision Lists using SAT","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.LO"],"primary_cat":"cs.AI","authors_text":"Alexey Ignatiev, Jinqiang Yu, Peter J. Stuckey, Pierre Le Bodic","submitted_at":"2020-10-19T23:33:42Z","abstract_excerpt":"Decision lists are one of the most easily explainable machine learning models. Given the renewed emphasis on explainable machine learning decisions, this machine learning model is increasingly attractive, combining small size and clear explainability. In this paper, we show for the first time how to construct optimal \"perfect\" decision lists which are perfectly accurate on the training data, and minimal in size, making use of modern SAT solving technology. We also give a new method for determining optimal sparse decision lists, which trade off size and accuracy. We contrast the size and test a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09919","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/2010.09919/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:44:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XdvuINmcX34TXlTNT1Ftb2zozaKBqWrf3zxyfIeJFIknSu/KqTNCuVHgSORqfAAKh6XJAedu1KO+6JdFmPffBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:11:40.555328Z"},"content_sha256":"e3d22f7278321612f3e743700371c139537fed5a1af7deb0b56f628936241a99","schema_version":"1.0","event_id":"sha256:e3d22f7278321612f3e743700371c139537fed5a1af7deb0b56f628936241a99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KUH3SD2AEGPCZKTAQXL75SF6YY/bundle.json","state_url":"https://pith.science/pith/KUH3SD2AEGPCZKTAQXL75SF6YY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KUH3SD2AEGPCZKTAQXL75SF6YY/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-06T02:11:40Z","links":{"resolver":"https://pith.science/pith/KUH3SD2AEGPCZKTAQXL75SF6YY","bundle":"https://pith.science/pith/KUH3SD2AEGPCZKTAQXL75SF6YY/bundle.json","state":"https://pith.science/pith/KUH3SD2AEGPCZKTAQXL75SF6YY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KUH3SD2AEGPCZKTAQXL75SF6YY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:KUH3SD2AEGPCZKTAQXL75SF6YY","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":"9217cf72adc7d47b461b1d5afff81c869e8caf5e34c87c99498cd6afacc8e82f","cross_cats_sorted":["cs.LG","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-19T23:33:42Z","title_canon_sha256":"0f7ada0fd98d4791c5ece849675d100c605f0b30c89925ec2f99eb8c7646357a"},"schema_version":"1.0","source":{"id":"2010.09919","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.09919","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"arxiv_version","alias_value":"2010.09919v1","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09919","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"pith_short_12","alias_value":"KUH3SD2AEGPC","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"pith_short_16","alias_value":"KUH3SD2AEGPCZKTA","created_at":"2026-07-05T01:44:25Z"},{"alias_kind":"pith_short_8","alias_value":"KUH3SD2A","created_at":"2026-07-05T01:44:25Z"}],"graph_snapshots":[{"event_id":"sha256:e3d22f7278321612f3e743700371c139537fed5a1af7deb0b56f628936241a99","target":"graph","created_at":"2026-07-05T01:44:25Z","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/2010.09919/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decision lists are one of the most easily explainable machine learning models. Given the renewed emphasis on explainable machine learning decisions, this machine learning model is increasingly attractive, combining small size and clear explainability. In this paper, we show for the first time how to construct optimal \"perfect\" decision lists which are perfectly accurate on the training data, and minimal in size, making use of modern SAT solving technology. We also give a new method for determining optimal sparse decision lists, which trade off size and accuracy. We contrast the size and test a","authors_text":"Alexey Ignatiev, Jinqiang Yu, Peter J. Stuckey, Pierre Le Bodic","cross_cats":["cs.LG","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-19T23:33:42Z","title":"Optimal Decision Lists using SAT"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09919","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:9f807ce29b0c675c692fc35462ad326da14f3e9d9f496a9abbd534b37f8a4808","target":"record","created_at":"2026-07-05T01:44:25Z","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":"9217cf72adc7d47b461b1d5afff81c869e8caf5e34c87c99498cd6afacc8e82f","cross_cats_sorted":["cs.LG","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2020-10-19T23:33:42Z","title_canon_sha256":"0f7ada0fd98d4791c5ece849675d100c605f0b30c89925ec2f99eb8c7646357a"},"schema_version":"1.0","source":{"id":"2010.09919","kind":"arxiv","version":1}},"canonical_sha256":"550fb90f40219e2caa6085d7fec8bec61ee5c053d1ccea9144ddb77f462523fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"550fb90f40219e2caa6085d7fec8bec61ee5c053d1ccea9144ddb77f462523fa","first_computed_at":"2026-07-05T01:44:25.157447Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:44:25.157447Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lwOtgqjk/XEUdwl/TGVn19NcKSu8ds8t3VV3jEH73SFcY9tKKzTRWB4UeZ19I4Gmi8nhjp8gi77cWwPANcm0Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:44:25.157859Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.09919","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f807ce29b0c675c692fc35462ad326da14f3e9d9f496a9abbd534b37f8a4808","sha256:e3d22f7278321612f3e743700371c139537fed5a1af7deb0b56f628936241a99"],"state_sha256":"1af157567c32a1d9ae5553cd14aa05d45f18f55d17ca2d846478cbe033e23328"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBdvOy04SIhjR3xdEfg73eIk0t3pufxKynD2l0rPeL5HK0vs4P91IjLbmDZsuE6+6X2hoau4vpxbkwLRtR4PCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T02:11:40.559119Z","bundle_sha256":"6d16bd6ba9d08932ec872c92cad5aeb7f225fb1ff041ee6811d703359dd7267f"}}