{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:YPSCVTMT3SJLBLCI5NOJHXIS6J","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":"1ae825af64e4fb4c3d418a3b4c48d4112003510c77830d66b03fac68e456a2e8","cross_cats_sorted":["cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-02-17T09:10:40Z","title_canon_sha256":"ca9ba2a9a05d76c59fd580b2c640817140435992cc1b20af8755500b5402e775"},"schema_version":"1.0","source":{"id":"2402.11228","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.11228","created_at":"2026-07-05T09:01:30Z"},{"alias_kind":"arxiv_version","alias_value":"2402.11228v2","created_at":"2026-07-05T09:01:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.11228","created_at":"2026-07-05T09:01:30Z"},{"alias_kind":"pith_short_12","alias_value":"YPSCVTMT3SJL","created_at":"2026-07-05T09:01:30Z"},{"alias_kind":"pith_short_16","alias_value":"YPSCVTMT3SJLBLCI","created_at":"2026-07-05T09:01:30Z"},{"alias_kind":"pith_short_8","alias_value":"YPSCVTMT","created_at":"2026-07-05T09:01:30Z"}],"graph_snapshots":[{"event_id":"sha256:46513e64756b3e7a0fc5c929db66a7ce8d6028332e71e33de983a21e4a28ee84","target":"graph","created_at":"2026-07-05T09:01:30Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2402.11228/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we propose a new random forest algorithm that constructs the trees using a novel adaptive split-balancing method. Rather than relying on the widely-used random feature selection, we propose a permutation-based balanced splitting criterion. The adaptive split balancing forest (ASBF), achieves minimax optimality under the Lipschitz class. Its localized version, which fits local regressions at the leaf level, attains the minimax rate under the broad H\\\"older class $\\mathcal{H}^{q,\\beta}$ of problems for any $q\\in\\mathbb{N}$ and $\\beta\\in(0,1]$. We identify that over-reliance on aux","authors_text":"Jelena Bradic, Weijie Ji, Yuqian Zhang","cross_cats":["cs.LG","math.ST","stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-02-17T09:10:40Z","title":"Adaptive Split Balancing for Optimal Random Forest"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.11228","kind":"arxiv","version":2},"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:3a8c63f8c6eaaef2949708d4bcf45ae211da9ec1699a672dd227d49a5b4e3ca1","target":"record","created_at":"2026-07-05T09:01:30Z","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":"1ae825af64e4fb4c3d418a3b4c48d4112003510c77830d66b03fac68e456a2e8","cross_cats_sorted":["cs.LG","math.ST","stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-02-17T09:10:40Z","title_canon_sha256":"ca9ba2a9a05d76c59fd580b2c640817140435992cc1b20af8755500b5402e775"},"schema_version":"1.0","source":{"id":"2402.11228","kind":"arxiv","version":2}},"canonical_sha256":"c3e42acd93dc92b0ac48eb5c93dd12f25435e95a2f493da3193e514795c5654e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3e42acd93dc92b0ac48eb5c93dd12f25435e95a2f493da3193e514795c5654e","first_computed_at":"2026-07-05T09:01:30.189545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:01:30.189545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UFg25IRODbLM8z7AR7GtdSDdI6Jzmsse5gBS7jZG4fo096Sx01I7ZmdcvzEBCJzIBkwYQtxJ7EKG8bc5xyLBDg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:01:30.190013Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.11228","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a8c63f8c6eaaef2949708d4bcf45ae211da9ec1699a672dd227d49a5b4e3ca1","sha256:46513e64756b3e7a0fc5c929db66a7ce8d6028332e71e33de983a21e4a28ee84"],"state_sha256":"de3a4bcf53f3a6690b4afa502bff0c5b0f5ac7c6d5d74b8e15c34591077d9472"}