{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LGGAMAX4RX6UHEWL2ELJMBH4SR","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":"c16de6e0f2fee76321900c628546caa60eefd52352463bfed8a176c4dedcbe95","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-27T07:58:16Z","title_canon_sha256":"b6e52b3a49883f10f401a36eec985281b8d1ec13f795d611430e761f51399837"},"schema_version":"1.0","source":{"id":"1905.11028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11028","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11028v1","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11028","created_at":"2026-05-17T23:45:03Z"},{"alias_kind":"pith_short_12","alias_value":"LGGAMAX4RX6U","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LGGAMAX4RX6UHEWL","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LGGAMAX4","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:3a328e1a252a88506ebf8dc3dfb7e3266365bf80723e7c6b37cb8a7569018e66","target":"graph","created_at":"2026-05-17T23:45:03Z","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"},"paper":{"abstract_excerpt":"We propose an algorithm named best-scored random forest for binary classification problems. The terminology \"best-scored\" means to select the one with the best empirical performance out of a certain number of purely random tree candidates as each single tree in the forest. In this way, the resulting forest can be more accurate than the original purely random forest. From the theoretical perspective, within the framework of regularized empirical risk minimization penalized on the number of splits, we establish almost optimal convergence rates for the proposed best-scored random trees under cert","authors_text":"Hanyuan Hang, Ingo Steinwart, Xiaoyu Liu","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-27T07:58:16Z","title":"Best-scored Random Forest Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11028","kind":"arxiv","version":1},"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:2061074f8a24d5170d622afdb08141c6c18391b2dcecd4f73da50cd5fc19a4b8","target":"record","created_at":"2026-05-17T23:45:03Z","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":"c16de6e0f2fee76321900c628546caa60eefd52352463bfed8a176c4dedcbe95","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-27T07:58:16Z","title_canon_sha256":"b6e52b3a49883f10f401a36eec985281b8d1ec13f795d611430e761f51399837"},"schema_version":"1.0","source":{"id":"1905.11028","kind":"arxiv","version":1}},"canonical_sha256":"598c0602fc8dfd4392cbd1169604fc947819cd196cd06eabedee9bf114cb66e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"598c0602fc8dfd4392cbd1169604fc947819cd196cd06eabedee9bf114cb66e0","first_computed_at":"2026-05-17T23:45:03.100927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:03.100927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrxmAmSMmfYo0Tr9jjIBruAprTM4+4a4rtsL7NpOO1UGMiwe5jG9Pok+g/BL7ksG2x7OM6wBmKV2gsb1BvqvCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:03.101496Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2061074f8a24d5170d622afdb08141c6c18391b2dcecd4f73da50cd5fc19a4b8","sha256:3a328e1a252a88506ebf8dc3dfb7e3266365bf80723e7c6b37cb8a7569018e66"],"state_sha256":"caaf41abf03bf43dc22867b9c4be422c4d3be58839ef984da10fc2fb6a2642cb"}