{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KZ3C5ZPX7PF5QS74H73YN4UJZ5","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":"62fd881b5774e75b543a03eb7049e4144e5cf70d96ac227efe9757c678f71b07","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-15T14:43:04Z","title_canon_sha256":"e47743b324fa932033e7d0845e5b71c77bf8cffa6880d5e0025b943d50c75a87"},"schema_version":"1.0","source":{"id":"1803.05784","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05784","created_at":"2026-05-17T23:49:05Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05784v2","created_at":"2026-05-17T23:49:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05784","created_at":"2026-05-17T23:49:05Z"},{"alias_kind":"pith_short_12","alias_value":"KZ3C5ZPX7PF5","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KZ3C5ZPX7PF5QS74","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KZ3C5ZPX","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:c0ba9e720de49df5fb396621231d40b54dd0fc2b6e415de638d0418852490237","target":"graph","created_at":"2026-05-17T23:49:05Z","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":"Introduced by Breiman, Random Forests are widely used classification and regression algorithms. While being initially designed as batch algorithms, several variants have been proposed to handle online learning. One particular instance of such forests is the \\emph{Mondrian Forest}, whose trees are built using the so-called Mondrian process, therefore allowing to easily update their construction in a streaming fashion. In this paper, we provide a thorough theoretical study of Mondrian Forests in a batch learning setting, based on new results about Mondrian partitions. Our results include consist","authors_text":"Erwan Scornet, Jaouad Mourtada, St\\'ephane Ga\\\"iffas","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-15T14:43:04Z","title":"Minimax optimal rates for Mondrian trees and forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05784","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:bdde2d16f39d51d8475454004d34844552e740399ddaf04226a26cb56386a561","target":"record","created_at":"2026-05-17T23:49:05Z","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":"62fd881b5774e75b543a03eb7049e4144e5cf70d96ac227efe9757c678f71b07","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-15T14:43:04Z","title_canon_sha256":"e47743b324fa932033e7d0845e5b71c77bf8cffa6880d5e0025b943d50c75a87"},"schema_version":"1.0","source":{"id":"1803.05784","kind":"arxiv","version":2}},"canonical_sha256":"56762ee5f7fbcbd84bfc3ff786f289cf742e04ce64d0379ecb150503b8ed27bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"56762ee5f7fbcbd84bfc3ff786f289cf742e04ce64d0379ecb150503b8ed27bb","first_computed_at":"2026-05-17T23:49:05.927373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:05.927373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JxxadhvYHHYc+DlHoMQs8/S5a5RCd+zEgqk4veUCvpRlJbWeOpe+MvfIqm+h8vLNp8Q2coDYqUtBLXjF2EzzDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:05.927916Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05784","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bdde2d16f39d51d8475454004d34844552e740399ddaf04226a26cb56386a561","sha256:c0ba9e720de49df5fb396621231d40b54dd0fc2b6e415de638d0418852490237"],"state_sha256":"1ad156d7e801c0c68abd47a43c084ba51853646d8449c8f83d1a70d953377846"}