{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QIFEWB5353ULHSBSHZQ6D54YRJ","short_pith_number":"pith:QIFEWB53","canonical_record":{"source":{"id":"1905.04610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T23:36:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"162e049b12ff4033eecd03ca4a5eb48d3a8ee1f3ed2ab207c63fbaa1e571c2cb","abstract_canon_sha256":"d16416eb5a3d94cec2ddc72bd19706f032a330f4f12ba13789ba9c948cc70839"},"schema_version":"1.0"},"canonical_sha256":"820a4b07bbeee8b3c8323e61e1f7988a5c4cce599fd1d5f39eed48c4c484dbb7","source":{"kind":"arxiv","id":"1905.04610","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04610","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04610v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04610","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"QIFEWB5353UL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QIFEWB5353ULHSBS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QIFEWB53","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QIFEWB5353ULHSBSHZQ6D54YRJ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04610","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T23:36:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"162e049b12ff4033eecd03ca4a5eb48d3a8ee1f3ed2ab207c63fbaa1e571c2cb","abstract_canon_sha256":"d16416eb5a3d94cec2ddc72bd19706f032a330f4f12ba13789ba9c948cc70839"},"schema_version":"1.0"},"canonical_sha256":"820a4b07bbeee8b3c8323e61e1f7988a5c4cce599fd1d5f39eed48c4c484dbb7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:24.213559Z","signature_b64":"Kq/g7iWnmK9CmTgBS0TCM5fDDQUKauEEFA4kcMwietGYS35QbB1ug7opzBOfgN6pRcF/VtCUp/FNg54d6mbDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"820a4b07bbeee8b3c8323e61e1f7988a5c4cce599fd1d5f39eed48c4c484dbb7","last_reissued_at":"2026-05-17T23:46:24.212931Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:24.212931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04610","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:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AkJnWzulWhcEz10jFWbXNggTkuNRqD84R5Swe/BMjsqo8dYig7MNfisM/rToqr+xJ5nqEr6Ud6V+/xZ9fTTLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:31:40.478116Z"},"content_sha256":"709a1cb9b55017eead21c984b4e186b00ec5d7f8c7c16689e5ec21c1b3c53615","schema_version":"1.0","event_id":"sha256:709a1cb9b55017eead21c984b4e186b00ec5d7f8c7c16689e5ec21c1b3c53615"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QIFEWB5353ULHSBSHZQ6D54YRJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explainable AI for Trees: From Local Explanations to Global Understanding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alex DeGrave, Bala Nair, Gabriel Erion, Hugh Chen, Jonathan Himmelfarb, Jordan M. Prutkin, Nisha Bansal, Ronit Katz, Scott M. Lundberg, Su-In Lee","submitted_at":"2019-05-11T23:36:59Z","abstract_excerpt":"Tree-based machine learning models such as random forests, decision trees, and gradient boosted trees are the most popular non-linear predictive models used in practice today, yet comparatively little attention has been paid to explaining their predictions. Here we significantly improve the interpretability of tree-based models through three main contributions: 1) The first polynomial time algorithm to compute optimal explanations based on game theory. 2) A new type of explanation that directly measures local feature interaction effects. 3) A new set of tools for understanding global model str"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04610","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:46:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mUFrS70/lpj3AfQOsvnYVdb2Yfvak+dMdqiJEEf1v/n+ztD1k5Ek0MgUVpSmJzkh8VthZPwKzpe0WIISu+pmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:31:40.478493Z"},"content_sha256":"4d92bb4a080968e8fdc421d1762dab293a740c051bf87eb4fbca7ee7ef8780b1","schema_version":"1.0","event_id":"sha256:4d92bb4a080968e8fdc421d1762dab293a740c051bf87eb4fbca7ee7ef8780b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QIFEWB5353ULHSBSHZQ6D54YRJ/bundle.json","state_url":"https://pith.science/pith/QIFEWB5353ULHSBSHZQ6D54YRJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QIFEWB5353ULHSBSHZQ6D54YRJ/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-05-28T11:31:40Z","links":{"resolver":"https://pith.science/pith/QIFEWB5353ULHSBSHZQ6D54YRJ","bundle":"https://pith.science/pith/QIFEWB5353ULHSBSHZQ6D54YRJ/bundle.json","state":"https://pith.science/pith/QIFEWB5353ULHSBSHZQ6D54YRJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QIFEWB5353ULHSBSHZQ6D54YRJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QIFEWB5353ULHSBSHZQ6D54YRJ","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":"d16416eb5a3d94cec2ddc72bd19706f032a330f4f12ba13789ba9c948cc70839","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T23:36:59Z","title_canon_sha256":"162e049b12ff4033eecd03ca4a5eb48d3a8ee1f3ed2ab207c63fbaa1e571c2cb"},"schema_version":"1.0","source":{"id":"1905.04610","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04610","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04610v1","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04610","created_at":"2026-05-17T23:46:24Z"},{"alias_kind":"pith_short_12","alias_value":"QIFEWB5353UL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QIFEWB5353ULHSBS","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QIFEWB53","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:4d92bb4a080968e8fdc421d1762dab293a740c051bf87eb4fbca7ee7ef8780b1","target":"graph","created_at":"2026-05-17T23:46:24Z","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":"Tree-based machine learning models such as random forests, decision trees, and gradient boosted trees are the most popular non-linear predictive models used in practice today, yet comparatively little attention has been paid to explaining their predictions. Here we significantly improve the interpretability of tree-based models through three main contributions: 1) The first polynomial time algorithm to compute optimal explanations based on game theory. 2) A new type of explanation that directly measures local feature interaction effects. 3) A new set of tools for understanding global model str","authors_text":"Alex DeGrave, Bala Nair, Gabriel Erion, Hugh Chen, Jonathan Himmelfarb, Jordan M. Prutkin, Nisha Bansal, Ronit Katz, Scott M. Lundberg, Su-In Lee","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T23:36:59Z","title":"Explainable AI for Trees: From Local Explanations to Global Understanding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04610","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:709a1cb9b55017eead21c984b4e186b00ec5d7f8c7c16689e5ec21c1b3c53615","target":"record","created_at":"2026-05-17T23:46:24Z","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":"d16416eb5a3d94cec2ddc72bd19706f032a330f4f12ba13789ba9c948cc70839","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-11T23:36:59Z","title_canon_sha256":"162e049b12ff4033eecd03ca4a5eb48d3a8ee1f3ed2ab207c63fbaa1e571c2cb"},"schema_version":"1.0","source":{"id":"1905.04610","kind":"arxiv","version":1}},"canonical_sha256":"820a4b07bbeee8b3c8323e61e1f7988a5c4cce599fd1d5f39eed48c4c484dbb7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"820a4b07bbeee8b3c8323e61e1f7988a5c4cce599fd1d5f39eed48c4c484dbb7","first_computed_at":"2026-05-17T23:46:24.212931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:24.212931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kq/g7iWnmK9CmTgBS0TCM5fDDQUKauEEFA4kcMwietGYS35QbB1ug7opzBOfgN6pRcF/VtCUp/FNg54d6mbDDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:24.213559Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04610","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:709a1cb9b55017eead21c984b4e186b00ec5d7f8c7c16689e5ec21c1b3c53615","sha256:4d92bb4a080968e8fdc421d1762dab293a740c051bf87eb4fbca7ee7ef8780b1"],"state_sha256":"5ed027dfbfa15269c0cb5a2406ea2c011228e988e942adef95c1eb7d036df883"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MGQMlCj4yGzm0iyZQj2K5Rqya5i1hl3o8jScekK/dbc6xgRYskGxH39crvLeUH4g8h8Ep1OkYqsIIrRIbA2uAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:31:40.480470Z","bundle_sha256":"7ba7ae7ddc5175ba28825b4a8f3910c16131bbaebc27ae4ca03c0d8b1d9997d5"}}