Pith Number

pith:6U3QYYO4

pith:2026:6U3QYYO43NFVGLXUHVVIZATFGV

not attested not anchored not stored refs pending

MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound

Chi-Nguyen Tran, Dao Sy Duy Minh, Huynh Trung Kiet, Long Tran-Thanh, Nguyen Lam Phu Quy, Phu-Hoa Pham

Streaming decision trees achieve reliable splits for online class-incremental learning by using a K-independent McDiarmid bound on Gini impurity together with Bayesian inheritance and quantile sketches.

arxiv:2605.11617 v2 · 2026-05-12 · cs.LG · math.ST · stat.TH

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

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{6U3QYYO43NFVGLXUHVVIZATFGV}

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

MIST resolves both failures through three integrated components: (i) a tight, K-independent McDiarmid confidence radius for Gini splitting that acts as a structural regulariser; (ii) a Bayesian inheritance protocol that projects parent statistics to child nodes via truncated-Gaussian moments, with variance reduction guarantees strongest precisely when splitting is most conservative; and (iii) per-leaf KLL quantile sketches that support both continuous threshold evaluation and geometry-adaptive leaf prediction from a single data structure.

C2weakest assumption

The assumption that a McDiarmid bound applied to Gini impurity yields a practically tight and K-independent radius under the streaming, non-stationary data regime, and that the truncated-Gaussian moment projection accurately captures the statistical relationship between parent and child nodes without introducing bias that grows with class count.

C3one line summary

MIST fixes unreliable splits in streaming decision trees for class-incremental learning by using a K-independent McDiarmid bound on Gini impurity, Bayesian moment projection for knowledge transfer, and KLL quantile sketches for adaptive leaf predictions.

Formal links

2 machine-checked theorem links

Receipt and verification

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

Canonical hash

f5370c61dcdb4b532ef43d6a8c8265356527366844fcd37282ed1fd1862a1637

Aliases

arxiv: 2605.11617 · arxiv_version: 2605.11617v2 · doi: 10.48550/arxiv.2605.11617 · pith_short_12: 6U3QYYO43NFV · pith_short_16: 6U3QYYO43NFVGLXU · pith_short_8: 6U3QYYO4

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/6U3QYYO43NFVGLXUHVVIZATFGV \
  | 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: f5370c61dcdb4b532ef43d6a8c8265356527366844fcd37282ed1fd1862a1637

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "e18fe80f0cdff2e47a36d464f385a7c8ddd0537e05682d9fd6b3314833525c37",
    "cross_cats_sorted": [
      "math.ST",
      "stat.TH"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.LG",
    "submitted_at": "2026-05-12T06:45:00Z",
    "title_canon_sha256": "674d727e8f5ec19fa194f772455c66dce228b5a02bdf4e3b7fc2b64abeaf3dc6"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.11617",
    "kind": "arxiv",
    "version": 2
  }
}