{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6U3QYYO43NFVGLXUHVVIZATFGV","short_pith_number":"pith:6U3QYYO4","schema_version":"1.0","canonical_sha256":"f5370c61dcdb4b532ef43d6a8c8265356527366844fcd37282ed1fd1862a1637","source":{"kind":"arxiv","id":"2605.11617","version":2},"attestation_state":"computed","paper":{"title":"MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"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.","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Chi-Nguyen Tran, Dao Sy Duy Minh, Huynh Trung Kiet, Long Tran-Thanh, Nguyen Lam Phu Quy, Phu-Hoa Pham","submitted_at":"2026-05-12T06:45:00Z","abstract_excerpt":"Streaming decision trees are natural candidates for open-world continual learning, as they perform local updates, enjoy bounded memory, and static decision boundaries. Despite these, they still fail in online class-incremental learning due to two coupled miscalibrations: (i) their split criterion grows unreliable as the class count K expands, and (ii) the absence of knowledge transfer at split time. Both failures share a common root: the range of Information Gain intrinsically scales with log2 K. Consequently, any Hoeffding-style confidence radius derived from it must inevitably grow with the "},"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":true},"canonical_record":{"source":{"id":"2605.11617","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-12T06:45:00Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"674d727e8f5ec19fa194f772455c66dce228b5a02bdf4e3b7fc2b64abeaf3dc6","abstract_canon_sha256":"e18fe80f0cdff2e47a36d464f385a7c8ddd0537e05682d9fd6b3314833525c37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:05:47.060584Z","signature_b64":"XDQLeXCILXWCvagXDzyQ1wvJBmN8vlTrZOHsG9asew6qI7nCAxZgzCa2GwuNjaTSrBW4s0qKu73ZC+t1raxxDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5370c61dcdb4b532ef43d6a8c8265356527366844fcd37282ed1fd1862a1637","last_reissued_at":"2026-05-20T00:05:47.060164Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:05:47.060164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound","license":"http://creativecommons.org/licenses/by/4.0/","headline":"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.","cross_cats":["math.ST","stat.TH"],"primary_cat":"cs.LG","authors_text":"Chi-Nguyen Tran, Dao Sy Duy Minh, Huynh Trung Kiet, Long Tran-Thanh, Nguyen Lam Phu Quy, Phu-Hoa Pham","submitted_at":"2026-05-12T06:45:00Z","abstract_excerpt":"Streaming decision trees are natural candidates for open-world continual learning, as they perform local updates, enjoy bounded memory, and static decision boundaries. Despite these, they still fail in online class-incremental learning due to two coupled miscalibrations: (i) their split criterion grows unreliable as the class count K expands, and (ii) the absence of knowledge transfer at split time. Both failures share a common root: the range of Information Gain intrinsically scales with log2 K. Consequently, any Hoeffding-style confidence radius derived from it must inevitably grow with the "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"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.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"25e61609b000ebe80fd0728961c8c25189a7c36e848757b292c9c1cb260ef876"},"source":{"id":"2605.11617","kind":"arxiv","version":2},"verdict":{"id":"6ee00463-7afb-4605-bc58-eb64f46d28cf","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T01:15:42.621195Z","strongest_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.","one_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.","pipeline_version":"pith-pipeline@v0.9.0","weakest_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.","pith_extraction_headline":"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."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11617/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T11:40:50.257254Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T09:31:18.077895Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:17:50.935505Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"be9aa7012b0628e329a96be3ca1a35cacf03ab5f13d4e9981fb88330dc588b0e"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4840c08c042eb84f2c72a8e5ee2ac2810e9da83fe101b8dd3c9bfad9fdc306df"},"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":"2605.11617","created_at":"2026-05-20T00:05:47.060220+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.11617v2","created_at":"2026-05-20T00:05:47.060220+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.11617","created_at":"2026-05-20T00:05:47.060220+00:00"},{"alias_kind":"pith_short_12","alias_value":"6U3QYYO43NFV","created_at":"2026-05-20T00:05:47.060220+00:00"},{"alias_kind":"pith_short_16","alias_value":"6U3QYYO43NFVGLXU","created_at":"2026-05-20T00:05:47.060220+00:00"},{"alias_kind":"pith_short_8","alias_value":"6U3QYYO4","created_at":"2026-05-20T00:05:47.060220+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV","json":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV.json","graph_json":"https://pith.science/api/pith-number/6U3QYYO43NFVGLXUHVVIZATFGV/graph.json","events_json":"https://pith.science/api/pith-number/6U3QYYO43NFVGLXUHVVIZATFGV/events.json","paper":"https://pith.science/paper/6U3QYYO4"},"agent_actions":{"view_html":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV","download_json":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV.json","view_paper":"https://pith.science/paper/6U3QYYO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.11617&json=true","fetch_graph":"https://pith.science/api/pith-number/6U3QYYO43NFVGLXUHVVIZATFGV/graph.json","fetch_events":"https://pith.science/api/pith-number/6U3QYYO43NFVGLXUHVVIZATFGV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV/action/storage_attestation","attest_author":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV/action/author_attestation","sign_citation":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV/action/citation_signature","submit_replication":"https://pith.science/pith/6U3QYYO43NFVGLXUHVVIZATFGV/action/replication_record"}},"created_at":"2026-05-20T00:05:47.060220+00:00","updated_at":"2026-05-20T00:05:47.060220+00:00"}