{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GLCU2IROEVRB7HHREUIQJC6KP5","short_pith_number":"pith:GLCU2IRO","schema_version":"1.0","canonical_sha256":"32c54d222e25621f9cf12511048bca7f7ddfd7aa50021a43e659be848a4d0006","source":{"kind":"arxiv","id":"2106.01350","version":2},"attestation_state":"computed","paper":{"title":"On Efficiently Explaining Graph-Based Classifiers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alexey Ignatiev, Joao Marques-Silva, Xuanxiang Huang, Yacine Izza","submitted_at":"2021-06-02T17:55:41Z","abstract_excerpt":"Recent work has shown that not only decision trees (DTs) may not be interpretable but also proposed a polynomial-time algorithm for computing one PI-explanation of a DT. This paper shows that for a wide range of classifiers, globally referred to as decision graphs, and which include decision trees and binary decision diagrams, but also their multi-valued variants, there exist polynomial-time algorithms for computing one PI-explanation. In addition, the paper also proposes a polynomial-time algorithm for computing one contrastive explanation. These novel algorithms build on explanation graphs ("},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2106.01350","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2021-06-02T17:55:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"0dcc049d85afeeec73884a822db955c3c6f05c67bd43050da30ce9ed3c17fe3b","abstract_canon_sha256":"d2bcb9f1489b1bbcb7c0773253eb58e027d8b8453bd50ed6d5521050186756b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:54.586582Z","signature_b64":"Jdy+HVUs4r2Dsg402zrijD+08AdncNZfqZznRHmSHiraIqwjs/HuwOpqFA77kZwB+9qOAs6GzdhqkpWDwy3cAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32c54d222e25621f9cf12511048bca7f7ddfd7aa50021a43e659be848a4d0006","last_reissued_at":"2026-07-05T02:51:54.586111Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:54.586111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Efficiently Explaining Graph-Based Classifiers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Alexey Ignatiev, Joao Marques-Silva, Xuanxiang Huang, Yacine Izza","submitted_at":"2021-06-02T17:55:41Z","abstract_excerpt":"Recent work has shown that not only decision trees (DTs) may not be interpretable but also proposed a polynomial-time algorithm for computing one PI-explanation of a DT. This paper shows that for a wide range of classifiers, globally referred to as decision graphs, and which include decision trees and binary decision diagrams, but also their multi-valued variants, there exist polynomial-time algorithms for computing one PI-explanation. In addition, the paper also proposes a polynomial-time algorithm for computing one contrastive explanation. These novel algorithms build on explanation graphs ("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.01350","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/2106.01350/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2106.01350","created_at":"2026-07-05T02:51:54.586171+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.01350v2","created_at":"2026-07-05T02:51:54.586171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.01350","created_at":"2026-07-05T02:51:54.586171+00:00"},{"alias_kind":"pith_short_12","alias_value":"GLCU2IROEVRB","created_at":"2026-07-05T02:51:54.586171+00:00"},{"alias_kind":"pith_short_16","alias_value":"GLCU2IROEVRB7HHR","created_at":"2026-07-05T02:51:54.586171+00:00"},{"alias_kind":"pith_short_8","alias_value":"GLCU2IRO","created_at":"2026-07-05T02:51:54.586171+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.09640","citing_title":"Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GLCU2IROEVRB7HHREUIQJC6KP5","json":"https://pith.science/pith/GLCU2IROEVRB7HHREUIQJC6KP5.json","graph_json":"https://pith.science/api/pith-number/GLCU2IROEVRB7HHREUIQJC6KP5/graph.json","events_json":"https://pith.science/api/pith-number/GLCU2IROEVRB7HHREUIQJC6KP5/events.json","paper":"https://pith.science/paper/GLCU2IRO"},"agent_actions":{"view_html":"https://pith.science/pith/GLCU2IROEVRB7HHREUIQJC6KP5","download_json":"https://pith.science/pith/GLCU2IROEVRB7HHREUIQJC6KP5.json","view_paper":"https://pith.science/paper/GLCU2IRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.01350&json=true","fetch_graph":"https://pith.science/api/pith-number/GLCU2IROEVRB7HHREUIQJC6KP5/graph.json","fetch_events":"https://pith.science/api/pith-number/GLCU2IROEVRB7HHREUIQJC6KP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GLCU2IROEVRB7HHREUIQJC6KP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GLCU2IROEVRB7HHREUIQJC6KP5/action/storage_attestation","attest_author":"https://pith.science/pith/GLCU2IROEVRB7HHREUIQJC6KP5/action/author_attestation","sign_citation":"https://pith.science/pith/GLCU2IROEVRB7HHREUIQJC6KP5/action/citation_signature","submit_replication":"https://pith.science/pith/GLCU2IROEVRB7HHREUIQJC6KP5/action/replication_record"}},"created_at":"2026-07-05T02:51:54.586171+00:00","updated_at":"2026-07-05T02:51:54.586171+00:00"}