Pith Number

pith:W2IXFVWC

pith:2026:W2IXFVWCDC76WC66NGC7EN5L3J

not attested not anchored not stored refs resolved

Woodelf++: A Fast and Unified Partial Dependence Plot Algorithm for Decision Tree Ensembles

Alexander Nadel, Ron Wettenstein, Udi Boker

Woodelf++ computes partial dependence plots, joint plots, and all-order interaction values for decision tree ensembles with exponential complexity reductions.

arxiv:2605.14578 v1 · 2026-05-14 · cs.LG

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{W2IXFVWCDC76WC66NGC7EN5L3J}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest 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.

C2weakest 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.

C3one 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.

References

27 extracted · 27 resolved · 0 Pith anchors

[1] Why Should I Trust You? 2026

[2] Setp[i] = 1ifx i ∈S + k

[3] Setp[i] = 2if(x i ∈S − k )∧(x i ∈s)

[4] Setp[i] = 3if(x i ∈S − k )∧(x i /∈s)

[5] In par- ticular, there is noisuch thatx i ∈S + k andx i ∈S − k

Formal links

2 machine-checked theorem links

Receipt and verification

First computed	2026-05-17T23:39:05.396192Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

b69172d6c218bfeb0bde6985f237abda4a5dfe584b8ae68d06f503a6586f5fc5

Aliases

arxiv: 2605.14578 · arxiv_version: 2605.14578v1 · doi: 10.48550/arxiv.2605.14578 · pith_short_12: W2IXFVWCDC76 · pith_short_16: W2IXFVWCDC76WC66 · pith_short_8: W2IXFVWC

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/W2IXFVWCDC76WC66NGC7EN5L3J \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: b69172d6c218bfeb0bde6985f237abda4a5dfe584b8ae68d06f503a6586f5fc5

Canonical record JSON

{
  "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
  }
}