{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:YX3UYYAEMA3E3X4KG2JJRL5FY2","short_pith_number":"pith:YX3UYYAE","canonical_record":{"source":{"id":"2108.05266","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-08-11T15:08:11Z","cross_cats_sorted":[],"title_canon_sha256":"5601847c329d68cd76476c8ff262ebaa92bafe18ba792cc587f651243fe5715f","abstract_canon_sha256":"1af166026b82bd64b93677ed97057999623a1db3f9f99447bb420d2063f77b08"},"schema_version":"1.0"},"canonical_sha256":"c5f74c600460364ddf8a369298afa5c69e1411e8e9ac952e7b3c5388f9826b89","source":{"kind":"arxiv","id":"2108.05266","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.05266","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"2108.05266v2","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.05266","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"YX3UYYAEMA3E","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"pith_short_16","alias_value":"YX3UYYAEMA3E3X4K","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"pith_short_8","alias_value":"YX3UYYAE","created_at":"2026-07-05T03:11:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:YX3UYYAEMA3E3X4KG2JJRL5FY2","target":"record","payload":{"canonical_record":{"source":{"id":"2108.05266","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-08-11T15:08:11Z","cross_cats_sorted":[],"title_canon_sha256":"5601847c329d68cd76476c8ff262ebaa92bafe18ba792cc587f651243fe5715f","abstract_canon_sha256":"1af166026b82bd64b93677ed97057999623a1db3f9f99447bb420d2063f77b08"},"schema_version":"1.0"},"canonical_sha256":"c5f74c600460364ddf8a369298afa5c69e1411e8e9ac952e7b3c5388f9826b89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:32.072843Z","signature_b64":"5P5mUSaIZ8Rmr1TKXBUVYIXMDJwQ4Y7ida8OU8PFSt0hxT+EcToeLEes9b3x7aksRFJLCGb4vcEmvCxxhLopBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c5f74c600460364ddf8a369298afa5c69e1411e8e9ac952e7b3c5388f9826b89","last_reissued_at":"2026-07-05T03:11:32.072369Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:32.072369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.05266","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-07-05T03:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SpXP+HWy8hgNRHUgWC2rRi5TAWe6duePGSb3ir8rJuAquWXrmdqZnAr2ZtRrF8B3L62uqspSqI6I2FdpP/a9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:30:12.909073Z"},"content_sha256":"067a9b5a9c5b81879a0eb5d8cd17acd4f254f94bb0d41ccd7ca62daf9b8c7189","schema_version":"1.0","event_id":"sha256:067a9b5a9c5b81879a0eb5d8cd17acd4f254f94bb0d41ccd7ca62daf9b8c7189"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:YX3UYYAEMA3E3X4KG2JJRL5FY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Explanatory Power of Decision Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Fr\\'ed\\'eric Koriche, Gilles Audemard, Jean-Marie Lagniez, Louenas Bounia, Pierre Marquis, Steve Bellart","submitted_at":"2021-08-11T15:08:11Z","abstract_excerpt":"Decision trees have long been recognized as models of choice in sensitive applications where interpretability is of paramount importance. In this paper, we examine the computational ability of Boolean decision trees in deriving, minimizing, and counting sufficient reasons and contrastive explanations. We prove that the set of all sufficient reasons of minimal size for an instance given a decision tree can be exponentially larger than the size of the input (the instance and the decision tree). Therefore, generating the full set of sufficient reasons can be out of reach. In addition, computing a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.05266","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.05266/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-05T03:11:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QvPCc6Z9VZ8sxSvTiSiSkWJ5YkEXmgSnReHODzbGhSCPm791jGvRDAJcV3pttIrlnn9uTFPPF1b/mVRR76AqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T15:30:12.909667Z"},"content_sha256":"af92bc29583b6dc71377a11dce75b64b28efc40791d6c29e0dd46dc83e027184","schema_version":"1.0","event_id":"sha256:af92bc29583b6dc71377a11dce75b64b28efc40791d6c29e0dd46dc83e027184"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YX3UYYAEMA3E3X4KG2JJRL5FY2/bundle.json","state_url":"https://pith.science/pith/YX3UYYAEMA3E3X4KG2JJRL5FY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YX3UYYAEMA3E3X4KG2JJRL5FY2/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-09T15:30:12Z","links":{"resolver":"https://pith.science/pith/YX3UYYAEMA3E3X4KG2JJRL5FY2","bundle":"https://pith.science/pith/YX3UYYAEMA3E3X4KG2JJRL5FY2/bundle.json","state":"https://pith.science/pith/YX3UYYAEMA3E3X4KG2JJRL5FY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YX3UYYAEMA3E3X4KG2JJRL5FY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:YX3UYYAEMA3E3X4KG2JJRL5FY2","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":"1af166026b82bd64b93677ed97057999623a1db3f9f99447bb420d2063f77b08","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-08-11T15:08:11Z","title_canon_sha256":"5601847c329d68cd76476c8ff262ebaa92bafe18ba792cc587f651243fe5715f"},"schema_version":"1.0","source":{"id":"2108.05266","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.05266","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"arxiv_version","alias_value":"2108.05266v2","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.05266","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"pith_short_12","alias_value":"YX3UYYAEMA3E","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"pith_short_16","alias_value":"YX3UYYAEMA3E3X4K","created_at":"2026-07-05T03:11:32Z"},{"alias_kind":"pith_short_8","alias_value":"YX3UYYAE","created_at":"2026-07-05T03:11:32Z"}],"graph_snapshots":[{"event_id":"sha256:af92bc29583b6dc71377a11dce75b64b28efc40791d6c29e0dd46dc83e027184","target":"graph","created_at":"2026-07-05T03:11:32Z","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/2108.05266/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Decision trees have long been recognized as models of choice in sensitive applications where interpretability is of paramount importance. In this paper, we examine the computational ability of Boolean decision trees in deriving, minimizing, and counting sufficient reasons and contrastive explanations. We prove that the set of all sufficient reasons of minimal size for an instance given a decision tree can be exponentially larger than the size of the input (the instance and the decision tree). Therefore, generating the full set of sufficient reasons can be out of reach. In addition, computing a","authors_text":"Fr\\'ed\\'eric Koriche, Gilles Audemard, Jean-Marie Lagniez, Louenas Bounia, Pierre Marquis, Steve Bellart","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-08-11T15:08:11Z","title":"On the Explanatory Power of Decision Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.05266","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:067a9b5a9c5b81879a0eb5d8cd17acd4f254f94bb0d41ccd7ca62daf9b8c7189","target":"record","created_at":"2026-07-05T03:11:32Z","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":"1af166026b82bd64b93677ed97057999623a1db3f9f99447bb420d2063f77b08","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-08-11T15:08:11Z","title_canon_sha256":"5601847c329d68cd76476c8ff262ebaa92bafe18ba792cc587f651243fe5715f"},"schema_version":"1.0","source":{"id":"2108.05266","kind":"arxiv","version":2}},"canonical_sha256":"c5f74c600460364ddf8a369298afa5c69e1411e8e9ac952e7b3c5388f9826b89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c5f74c600460364ddf8a369298afa5c69e1411e8e9ac952e7b3c5388f9826b89","first_computed_at":"2026-07-05T03:11:32.072369Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:11:32.072369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5P5mUSaIZ8Rmr1TKXBUVYIXMDJwQ4Y7ida8OU8PFSt0hxT+EcToeLEes9b3x7aksRFJLCGb4vcEmvCxxhLopBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T03:11:32.072843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.05266","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:067a9b5a9c5b81879a0eb5d8cd17acd4f254f94bb0d41ccd7ca62daf9b8c7189","sha256:af92bc29583b6dc71377a11dce75b64b28efc40791d6c29e0dd46dc83e027184"],"state_sha256":"0d7d28dd81f2f28a356e9d68fdab6129f5dd2bd133103a46bba64e8c650bf22b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M7UdYDWkuHQLPCpfe5EJ2uMEqKVk8X+i1cxgBzmIsfAuoOAZxPi79aOy+FwPk0OBFyjAI24g2gpjNAfzagAiBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T15:30:12.913449Z","bundle_sha256":"17fea0885b0329a864d2c04563796a57bca2c4e101f61f1ad7ce4caf0880eca3"}}