{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:XS3AGPUMLN7NVF34YEIQKDED3M","short_pith_number":"pith:XS3AGPUM","canonical_record":{"source":{"id":"1811.10656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:27:26Z","cross_cats_sorted":[],"title_canon_sha256":"c9777459803ed99d6e8f5758c48bc2404f664d2d54069805baa08922fce575a5","abstract_canon_sha256":"2ec2ccdbc32785351b58f2985cfda73a4be8b60f2a55b2e09d36476112e59923"},"schema_version":"1.0"},"canonical_sha256":"bcb6033e8c5b7eda977cc111050c83db066603cad5e7aab60160f01e4baf1db1","source":{"kind":"arxiv","id":"1811.10656","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10656","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10656v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10656","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"XS3AGPUMLN7N","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XS3AGPUMLN7NVF34","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XS3AGPUM","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:XS3AGPUMLN7NVF34YEIQKDED3M","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10656","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:27:26Z","cross_cats_sorted":[],"title_canon_sha256":"c9777459803ed99d6e8f5758c48bc2404f664d2d54069805baa08922fce575a5","abstract_canon_sha256":"2ec2ccdbc32785351b58f2985cfda73a4be8b60f2a55b2e09d36476112e59923"},"schema_version":"1.0"},"canonical_sha256":"bcb6033e8c5b7eda977cc111050c83db066603cad5e7aab60160f01e4baf1db1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.906143Z","signature_b64":"j3iwPF3FxBL5UNVZub6sElE4x7WHzTs9lrNtoB1LTmZLxynMvtnRk5GqLmf2++xU66vc+JDPM66lS8haId08BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bcb6033e8c5b7eda977cc111050c83db066603cad5e7aab60160f01e4baf1db1","last_reissued_at":"2026-05-17T23:59:47.905482Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.905482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10656","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-05-17T23:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7w8prxsEbiA0EYohSsNb9i6ddRC3wNGzbqa+bLOfJAmyw4s4aT8aSVlbCd7Qr9e/Rklp/cDNDIMsBDAlNNdBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:54:57.301305Z"},"content_sha256":"1801ee12a096a53f5545b4e54d7745264523551d25cd41b6b95c87c1c4c13d6a","schema_version":"1.0","event_id":"sha256:1801ee12a096a53f5545b4e54d7745264523551d25cd41b6b95c87c1c4c13d6a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:XS3AGPUMLN7NVF34YEIQKDED3M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Abduction-Based Explanations for Machine Learning Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexey Ignatiev, Joao Marques-Silva, Nina Narodytska","submitted_at":"2018-11-26T19:27:26Z","abstract_excerpt":"The growing range of applications of Machine Learning (ML) in a multitude of settings motivates the ability of computing small explanations for predictions made. Small explanations are generally accepted as easier for human decision makers to understand. Most earlier work on computing explanations is based on heuristic approaches, providing no guarantees of quality, in terms of how close such solutions are from cardinality- or subset-minimal explanations. This paper develops a constraint-agnostic solution for computing explanations for any ML model. The proposed solution exploits abductive rea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10656","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":""},"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-17T23:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"80/3MU0hhIFK8/QmMjQQ7PI+FytaEGf2B/rQcocIQO8Hb2umjXjYOVRG4/nl/EPcWGi4AJxymCM2PwThM2ZbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:54:57.301674Z"},"content_sha256":"e56c44d18f001d8c12c190860f027c3e7e17087db4c85ae070c97babd7163e63","schema_version":"1.0","event_id":"sha256:e56c44d18f001d8c12c190860f027c3e7e17087db4c85ae070c97babd7163e63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XS3AGPUMLN7NVF34YEIQKDED3M/bundle.json","state_url":"https://pith.science/pith/XS3AGPUMLN7NVF34YEIQKDED3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XS3AGPUMLN7NVF34YEIQKDED3M/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-06-01T14:54:57Z","links":{"resolver":"https://pith.science/pith/XS3AGPUMLN7NVF34YEIQKDED3M","bundle":"https://pith.science/pith/XS3AGPUMLN7NVF34YEIQKDED3M/bundle.json","state":"https://pith.science/pith/XS3AGPUMLN7NVF34YEIQKDED3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XS3AGPUMLN7NVF34YEIQKDED3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:XS3AGPUMLN7NVF34YEIQKDED3M","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":"2ec2ccdbc32785351b58f2985cfda73a4be8b60f2a55b2e09d36476112e59923","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:27:26Z","title_canon_sha256":"c9777459803ed99d6e8f5758c48bc2404f664d2d54069805baa08922fce575a5"},"schema_version":"1.0","source":{"id":"1811.10656","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10656","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10656v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10656","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"XS3AGPUMLN7N","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"XS3AGPUMLN7NVF34","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"XS3AGPUM","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:e56c44d18f001d8c12c190860f027c3e7e17087db4c85ae070c97babd7163e63","target":"graph","created_at":"2026-05-17T23:59:47Z","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":"The growing range of applications of Machine Learning (ML) in a multitude of settings motivates the ability of computing small explanations for predictions made. Small explanations are generally accepted as easier for human decision makers to understand. Most earlier work on computing explanations is based on heuristic approaches, providing no guarantees of quality, in terms of how close such solutions are from cardinality- or subset-minimal explanations. This paper develops a constraint-agnostic solution for computing explanations for any ML model. The proposed solution exploits abductive rea","authors_text":"Alexey Ignatiev, Joao Marques-Silva, Nina Narodytska","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:27:26Z","title":"Abduction-Based Explanations for Machine Learning Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10656","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:1801ee12a096a53f5545b4e54d7745264523551d25cd41b6b95c87c1c4c13d6a","target":"record","created_at":"2026-05-17T23:59:47Z","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":"2ec2ccdbc32785351b58f2985cfda73a4be8b60f2a55b2e09d36476112e59923","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-26T19:27:26Z","title_canon_sha256":"c9777459803ed99d6e8f5758c48bc2404f664d2d54069805baa08922fce575a5"},"schema_version":"1.0","source":{"id":"1811.10656","kind":"arxiv","version":1}},"canonical_sha256":"bcb6033e8c5b7eda977cc111050c83db066603cad5e7aab60160f01e4baf1db1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bcb6033e8c5b7eda977cc111050c83db066603cad5e7aab60160f01e4baf1db1","first_computed_at":"2026-05-17T23:59:47.905482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:47.905482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j3iwPF3FxBL5UNVZub6sElE4x7WHzTs9lrNtoB1LTmZLxynMvtnRk5GqLmf2++xU66vc+JDPM66lS8haId08BQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:47.906143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10656","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1801ee12a096a53f5545b4e54d7745264523551d25cd41b6b95c87c1c4c13d6a","sha256:e56c44d18f001d8c12c190860f027c3e7e17087db4c85ae070c97babd7163e63"],"state_sha256":"c6eb0dea29693cc7e961aa062527395337afe464a5f9be3a51bb012fd8035d9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kBpTWZWcraG6e87wzpsD5HPgz8WK6Ogcs/O07TK0bJ57zhn9iCE8x4fLw3XP4ZvtFZd5HW+nmPlF0FCkqpCXCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:54:57.303780Z","bundle_sha256":"7bde7bfd218fc9ede4545dfe5aa1886119204f12905519e2504e84b496e14313"}}