{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:W2IXFVWCDC76WC66NGC7EN5L3J","short_pith_number":"pith:W2IXFVWC","canonical_record":{"source":{"id":"2605.14578","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T08:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"9e01914691aaefb046cf4766510c703b04189bc2a9d28c747de421bd51546420","abstract_canon_sha256":"fcffcd67b46807ee09eba5fd1ce5fd7aae4b07e053a9b362afd7ae821841f87c"},"schema_version":"1.0"},"canonical_sha256":"b69172d6c218bfeb0bde6985f237abda4a5dfe584b8ae68d06f503a6586f5fc5","source":{"kind":"arxiv","id":"2605.14578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14578","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14578v1","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14578","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"W2IXFVWCDC76","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"W2IXFVWCDC76WC66","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"W2IXFVWC","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:W2IXFVWCDC76WC66NGC7EN5L3J","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14578","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T08:49:19Z","cross_cats_sorted":[],"title_canon_sha256":"9e01914691aaefb046cf4766510c703b04189bc2a9d28c747de421bd51546420","abstract_canon_sha256":"fcffcd67b46807ee09eba5fd1ce5fd7aae4b07e053a9b362afd7ae821841f87c"},"schema_version":"1.0"},"canonical_sha256":"b69172d6c218bfeb0bde6985f237abda4a5dfe584b8ae68d06f503a6586f5fc5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:05.396843Z","signature_b64":"hjUjnL9A1AnOhm/NabHd+IhHpx0YSOpf+qiFhjeTo0tnLToAtzL237BpHstgdDOuarVwYs8IJzPcESuaZ2ESDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b69172d6c218bfeb0bde6985f237abda4a5dfe584b8ae68d06f503a6586f5fc5","last_reissued_at":"2026-05-17T23:39:05.396192Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:05.396192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14578","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:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNBDa3+Qa8CzAzYBDdCGtEuEx1gMcTVtcmE+Q4D+muA55DuECe51Zq/yaJV066Ih9MZOo/0H/CQ77ZXfN4YeDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:25:25.964984Z"},"content_sha256":"f4907f5298a83c46dba4314cffc560bf7d0a033477b9ad6770abd8a7e958e0b4","schema_version":"1.0","event_id":"sha256:f4907f5298a83c46dba4314cffc560bf7d0a033477b9ad6770abd8a7e958e0b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:W2IXFVWCDC76WC66NGC7EN5L3J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Woodelf++: A Fast and Unified Partial Dependence Plot Algorithm for Decision Tree Ensembles","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Woodelf++ computes partial dependence plots, joint plots, and all-order interaction values for decision tree ensembles with exponential complexity reductions.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexander Nadel, Ron Wettenstein, Udi Boker","submitted_at":"2026-05-14T08:49:19Z","abstract_excerpt":"Partial Dependence Plots (PDPs) visualize how changes in a single feature affect the average model prediction. They are widely used in practice to interpret decision tree ensembles and other machine learning models. Joint-PDPs extend this idea to pairs of features, revealing their combined effect. Partial Dependence Interaction Values (PDIVs) measure feature interactions. The Any-Order-PDIVs task computes these interactions for every feature subset across all rows of the dataset.\n  We introduce Woodelf++, a unified and efficient approach for computing all these useful explainability tools on d"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Woodelf++ computes Any-Order-PDIVs for every feature subset across all rows with an exponential complexity improvement, finishing in 5 minutes on a 400k-row dataset while the state of the art would require over 1,000,000 years.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The claimed exponential gain and practical speedups rest on the assumption that the pseudo-Boolean function metrics derived from the tree ensemble can be evaluated without hidden per-row or per-subset overheads that grow with dataset size or number of features.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Woodelf++ computes exact and approximate PDPs, Joint-PDPs, and Any-Order-PDIVs for decision tree ensembles with up to exponential speedups by deriving metrics over pseudo-Boolean functions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Woodelf++ computes partial dependence plots, joint plots, and all-order interaction values for decision tree ensembles with exponential complexity reductions.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"d1fb408652e199b7eab342b26948ef25142e30dd0a9c9c05a8e733b44adc770e"},"source":{"id":"2605.14578","kind":"arxiv","version":1},"verdict":{"id":"2d80a408-80ef-49bb-89f3-25974a30a2c0","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:37:51.929724Z","strongest_claim":"Woodelf++ computes Any-Order-PDIVs for every feature subset across all rows with an exponential complexity improvement, finishing in 5 minutes on a 400k-row dataset while the state of the art would require over 1,000,000 years.","one_line_summary":"Woodelf++ computes exact and approximate PDPs, Joint-PDPs, and Any-Order-PDIVs for decision tree ensembles with up to exponential speedups by deriving metrics over pseudo-Boolean functions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The claimed exponential gain and practical speedups rest on the assumption that the pseudo-Boolean function metrics derived from the tree ensemble can be evaluated without hidden per-row or per-subset overheads that grow with dataset size or number of features.","pith_extraction_headline":"Woodelf++ computes partial dependence plots, joint plots, and all-order interaction values for decision tree ensembles with exponential complexity reductions."},"references":{"count":27,"sample":[{"doi":"","year":2026,"title":"Why Should I Trust You?","work_id":"d5d8ac43-fb9f-44d2-a4bd-4894f421f1f0","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Setp[i] = 1ifx i ∈S + k","work_id":"56ec3976-c5f3-4bcf-8ee1-a6bc3f36a7d1","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Setp[i] = 2if(x i ∈S − k )∧(x i ∈s)","work_id":"924dae2f-8131-4312-86f7-03728bd3f1d8","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Setp[i] = 3if(x i ∈S − k )∧(x i /∈s)","work_id":"bfe910a4-3bb6-401d-a8fc-dd3bef9e399b","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"In par- ticular, there is noisuch thatx i ∈S + k andx i ∈S − k","work_id":"0e3c33e0-ce88-496e-a3de-5ee264e29efd","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":27,"snapshot_sha256":"c2349fc88b052450c25f44611eaf93b37c590473f39ab73b8270d7b9bca2f0a2","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ee4ae89f860ebfb44380cec0273cdd9dc9cd421c0faf0c9252398734de9acd06"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"2d80a408-80ef-49bb-89f3-25974a30a2c0"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wFZuCA1mfvi2JPLjwvifvhDx+LCgyK60ywspPs14UEEj5+DxDoYx5P3oOKYKO855XSXgcCjNWHU+PIxUgSSVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:25:25.965987Z"},"content_sha256":"e682e47b30f380d59cba7a0a84d418c1c72f42023f5807a063a34a1803d5a8b4","schema_version":"1.0","event_id":"sha256:e682e47b30f380d59cba7a0a84d418c1c72f42023f5807a063a34a1803d5a8b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2IXFVWCDC76WC66NGC7EN5L3J/bundle.json","state_url":"https://pith.science/pith/W2IXFVWCDC76WC66NGC7EN5L3J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2IXFVWCDC76WC66NGC7EN5L3J/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-30T05:25:25Z","links":{"resolver":"https://pith.science/pith/W2IXFVWCDC76WC66NGC7EN5L3J","bundle":"https://pith.science/pith/W2IXFVWCDC76WC66NGC7EN5L3J/bundle.json","state":"https://pith.science/pith/W2IXFVWCDC76WC66NGC7EN5L3J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2IXFVWCDC76WC66NGC7EN5L3J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:W2IXFVWCDC76WC66NGC7EN5L3J","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":"fcffcd67b46807ee09eba5fd1ce5fd7aae4b07e053a9b362afd7ae821841f87c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T08:49:19Z","title_canon_sha256":"9e01914691aaefb046cf4766510c703b04189bc2a9d28c747de421bd51546420"},"schema_version":"1.0","source":{"id":"2605.14578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14578","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14578v1","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14578","created_at":"2026-05-17T23:39:05Z"},{"alias_kind":"pith_short_12","alias_value":"W2IXFVWCDC76","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"W2IXFVWCDC76WC66","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"W2IXFVWC","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e682e47b30f380d59cba7a0a84d418c1c72f42023f5807a063a34a1803d5a8b4","target":"graph","created_at":"2026-05-17T23:39:05Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Woodelf++ computes Any-Order-PDIVs for every feature subset across all rows with an exponential complexity improvement, finishing in 5 minutes on a 400k-row dataset while the state of the art would require over 1,000,000 years."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The claimed exponential gain and practical speedups rest on the assumption that the pseudo-Boolean function metrics derived from the tree ensemble can be evaluated without hidden per-row or per-subset overheads that grow with dataset size or number of features."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Woodelf++ computes exact and approximate PDPs, Joint-PDPs, and Any-Order-PDIVs for decision tree ensembles with up to exponential speedups by deriving metrics over pseudo-Boolean functions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Woodelf++ computes partial dependence plots, joint plots, and all-order interaction values for decision tree ensembles with exponential complexity reductions."}],"snapshot_sha256":"d1fb408652e199b7eab342b26948ef25142e30dd0a9c9c05a8e733b44adc770e"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ee4ae89f860ebfb44380cec0273cdd9dc9cd421c0faf0c9252398734de9acd06"},"paper":{"abstract_excerpt":"Partial Dependence Plots (PDPs) visualize how changes in a single feature affect the average model prediction. They are widely used in practice to interpret decision tree ensembles and other machine learning models. Joint-PDPs extend this idea to pairs of features, revealing their combined effect. Partial Dependence Interaction Values (PDIVs) measure feature interactions. The Any-Order-PDIVs task computes these interactions for every feature subset across all rows of the dataset.\n  We introduce Woodelf++, a unified and efficient approach for computing all these useful explainability tools on d","authors_text":"Alexander Nadel, Ron Wettenstein, Udi Boker","cross_cats":[],"headline":"Woodelf++ computes partial dependence plots, joint plots, and all-order interaction values for decision tree ensembles with exponential complexity reductions.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T08:49:19Z","title":"Woodelf++: A Fast and Unified Partial Dependence Plot Algorithm for Decision Tree Ensembles"},"references":{"count":27,"internal_anchors":0,"resolved_work":27,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Why Should I Trust You?","work_id":"d5d8ac43-fb9f-44d2-a4bd-4894f421f1f0","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Setp[i] = 1ifx i ∈S + k","work_id":"56ec3976-c5f3-4bcf-8ee1-a6bc3f36a7d1","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Setp[i] = 2if(x i ∈S − k )∧(x i ∈s)","work_id":"924dae2f-8131-4312-86f7-03728bd3f1d8","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Setp[i] = 3if(x i ∈S − k )∧(x i /∈s)","work_id":"bfe910a4-3bb6-401d-a8fc-dd3bef9e399b","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"In par- ticular, there is noisuch thatx i ∈S + k andx i ∈S − k","work_id":"0e3c33e0-ce88-496e-a3de-5ee264e29efd","year":null}],"snapshot_sha256":"c2349fc88b052450c25f44611eaf93b37c590473f39ab73b8270d7b9bca2f0a2"},"source":{"id":"2605.14578","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:37:51.929724Z","id":"2d80a408-80ef-49bb-89f3-25974a30a2c0","model_set":{"reader":"grok-4.3"},"one_line_summary":"Woodelf++ computes exact and approximate PDPs, Joint-PDPs, and Any-Order-PDIVs for decision tree ensembles with up to exponential speedups by deriving metrics over pseudo-Boolean functions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Woodelf++ computes partial dependence plots, joint plots, and all-order interaction values for decision tree ensembles with exponential complexity reductions.","strongest_claim":"Woodelf++ computes Any-Order-PDIVs for every feature subset across all rows with an exponential complexity improvement, finishing in 5 minutes on a 400k-row dataset while the state of the art would require over 1,000,000 years.","weakest_assumption":"The claimed exponential gain and practical speedups rest on the assumption that the pseudo-Boolean function metrics derived from the tree ensemble can be evaluated without hidden per-row or per-subset overheads that grow with dataset size or number of features."}},"verdict_id":"2d80a408-80ef-49bb-89f3-25974a30a2c0"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f4907f5298a83c46dba4314cffc560bf7d0a033477b9ad6770abd8a7e958e0b4","target":"record","created_at":"2026-05-17T23:39:05Z","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":"fcffcd67b46807ee09eba5fd1ce5fd7aae4b07e053a9b362afd7ae821841f87c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T08:49:19Z","title_canon_sha256":"9e01914691aaefb046cf4766510c703b04189bc2a9d28c747de421bd51546420"},"schema_version":"1.0","source":{"id":"2605.14578","kind":"arxiv","version":1}},"canonical_sha256":"b69172d6c218bfeb0bde6985f237abda4a5dfe584b8ae68d06f503a6586f5fc5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b69172d6c218bfeb0bde6985f237abda4a5dfe584b8ae68d06f503a6586f5fc5","first_computed_at":"2026-05-17T23:39:05.396192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:05.396192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hjUjnL9A1AnOhm/NabHd+IhHpx0YSOpf+qiFhjeTo0tnLToAtzL237BpHstgdDOuarVwYs8IJzPcESuaZ2ESDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:05.396843Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f4907f5298a83c46dba4314cffc560bf7d0a033477b9ad6770abd8a7e958e0b4","sha256:e682e47b30f380d59cba7a0a84d418c1c72f42023f5807a063a34a1803d5a8b4"],"state_sha256":"816ba7eec39696c7745a6887a210818048d3b98e80596335c7717c7b4afba486"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5ghxOSn+nM9ck5TtkovbVBhuIGu9RsQTHc4mcV43e7i2BfrLPnSOYp3e0KAkGjRi6KJSseAGTLBPxkakFDZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:25:25.969340Z","bundle_sha256":"234eae85557d251822bbc2207b9e67e46bc596c2fce663d96c5af493d6f398bd"}}