{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:QHHBSLAEVIGRTEVGAP2JZNKH7Q","short_pith_number":"pith:QHHBSLAE","canonical_record":{"source":{"id":"1705.05654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-16T11:38:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d05e8fa532fd3b9ac000090335dced9a1a74668f1c2749f277f16ad9165999e2","abstract_canon_sha256":"d2c9a213bc187c59c0b1c436fe6a344a2fce77da3969d4b85c12d228aaf15500"},"schema_version":"1.0"},"canonical_sha256":"81ce192c04aa0d1992a603f49cb547fc2faa1eda644adbc5dc4b0b711c7eb35f","source":{"kind":"arxiv","id":"1705.05654","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05654","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05654v1","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05654","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"QHHBSLAEVIGR","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QHHBSLAEVIGRTEVG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QHHBSLAE","created_at":"2026-05-18T12:31:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:QHHBSLAEVIGRTEVGAP2JZNKH7Q","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05654","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-16T11:38:12Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"d05e8fa532fd3b9ac000090335dced9a1a74668f1c2749f277f16ad9165999e2","abstract_canon_sha256":"d2c9a213bc187c59c0b1c436fe6a344a2fce77da3969d4b85c12d228aaf15500"},"schema_version":"1.0"},"canonical_sha256":"81ce192c04aa0d1992a603f49cb547fc2faa1eda644adbc5dc4b0b711c7eb35f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:49.697005Z","signature_b64":"4fruIUnHTJu333RPj7L7//542LQJ152dpeviBT8P9mmlmKgQBawKVO1vbYQ8HzU8H1RoU06d6WqNSGNayvjWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81ce192c04aa0d1992a603f49cb547fc2faa1eda644adbc5dc4b0b711c7eb35f","last_reissued_at":"2026-05-17T23:51:49.696212Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:49.696212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05654","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SpUj0MM8YArJyv0taXxTybpeijCm16D5Vc69aeGzmVKiOLkSXB16BpqwCoLWMpXNcu5P2M2DzHRiPqUp/c7ADA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:16:32.323260Z"},"content_sha256":"9726a0e7771a6f571471986b3a01bfbcd3b3ef87f0841e7d7cb5ef0c0df008b6","schema_version":"1.0","event_id":"sha256:9726a0e7771a6f571471986b3a01bfbcd3b3ef87f0841e7d7cb5ef0c0df008b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:QHHBSLAEVIGRTEVGAP2JZNKH7Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"To tune or not to tune the number of trees in random forest?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Anne-Laure Boulesteix, Philipp Probst","submitted_at":"2017-05-16T11:38:12Z","abstract_excerpt":"The number of trees T in the random forest (RF) algorithm for supervised learning has to be set by the user. It is controversial whether T should simply be set to the largest computationally manageable value or whether a smaller T may in some cases be better. While the principle underlying bagging is that \"more trees are better\", in practice the classification error rate sometimes reaches a minimum before increasing again for increasing number of trees. The goal of this paper is four-fold: (i) providing theoretical results showing that the expected error rate may be a non-monotonous function o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05654","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:51:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jaMVXQmCOMmt175KOp9Jw1Hf8hSh6E1A1EoaSNiD1Kdfc84RPdRpZ1DkUHs8JRFJb+O0f1EAr9vHtgLYJ5RvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T00:16:32.323939Z"},"content_sha256":"6d5b1e8ed5d4be20fdd4be8cc4da8b26aac56ecd2e2876d1b7d5866f1fd69f7d","schema_version":"1.0","event_id":"sha256:6d5b1e8ed5d4be20fdd4be8cc4da8b26aac56ecd2e2876d1b7d5866f1fd69f7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHHBSLAEVIGRTEVGAP2JZNKH7Q/bundle.json","state_url":"https://pith.science/pith/QHHBSLAEVIGRTEVGAP2JZNKH7Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHHBSLAEVIGRTEVGAP2JZNKH7Q/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T00:16:32Z","links":{"resolver":"https://pith.science/pith/QHHBSLAEVIGRTEVGAP2JZNKH7Q","bundle":"https://pith.science/pith/QHHBSLAEVIGRTEVGAP2JZNKH7Q/bundle.json","state":"https://pith.science/pith/QHHBSLAEVIGRTEVGAP2JZNKH7Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHHBSLAEVIGRTEVGAP2JZNKH7Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:QHHBSLAEVIGRTEVGAP2JZNKH7Q","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":"d2c9a213bc187c59c0b1c436fe6a344a2fce77da3969d4b85c12d228aaf15500","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-16T11:38:12Z","title_canon_sha256":"d05e8fa532fd3b9ac000090335dced9a1a74668f1c2749f277f16ad9165999e2"},"schema_version":"1.0","source":{"id":"1705.05654","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05654","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05654v1","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05654","created_at":"2026-05-17T23:51:49Z"},{"alias_kind":"pith_short_12","alias_value":"QHHBSLAEVIGR","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_16","alias_value":"QHHBSLAEVIGRTEVG","created_at":"2026-05-18T12:31:39Z"},{"alias_kind":"pith_short_8","alias_value":"QHHBSLAE","created_at":"2026-05-18T12:31:39Z"}],"graph_snapshots":[{"event_id":"sha256:6d5b1e8ed5d4be20fdd4be8cc4da8b26aac56ecd2e2876d1b7d5866f1fd69f7d","target":"graph","created_at":"2026-05-17T23:51:49Z","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":"The number of trees T in the random forest (RF) algorithm for supervised learning has to be set by the user. It is controversial whether T should simply be set to the largest computationally manageable value or whether a smaller T may in some cases be better. While the principle underlying bagging is that \"more trees are better\", in practice the classification error rate sometimes reaches a minimum before increasing again for increasing number of trees. The goal of this paper is four-fold: (i) providing theoretical results showing that the expected error rate may be a non-monotonous function o","authors_text":"Anne-Laure Boulesteix, Philipp Probst","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-16T11:38:12Z","title":"To tune or not to tune the number of trees in random forest?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05654","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:9726a0e7771a6f571471986b3a01bfbcd3b3ef87f0841e7d7cb5ef0c0df008b6","target":"record","created_at":"2026-05-17T23:51:49Z","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":"d2c9a213bc187c59c0b1c436fe6a344a2fce77da3969d4b85c12d228aaf15500","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-16T11:38:12Z","title_canon_sha256":"d05e8fa532fd3b9ac000090335dced9a1a74668f1c2749f277f16ad9165999e2"},"schema_version":"1.0","source":{"id":"1705.05654","kind":"arxiv","version":1}},"canonical_sha256":"81ce192c04aa0d1992a603f49cb547fc2faa1eda644adbc5dc4b0b711c7eb35f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81ce192c04aa0d1992a603f49cb547fc2faa1eda644adbc5dc4b0b711c7eb35f","first_computed_at":"2026-05-17T23:51:49.696212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:49.696212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4fruIUnHTJu333RPj7L7//542LQJ152dpeviBT8P9mmlmKgQBawKVO1vbYQ8HzU8H1RoU06d6WqNSGNayvjWAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:49.697005Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05654","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9726a0e7771a6f571471986b3a01bfbcd3b3ef87f0841e7d7cb5ef0c0df008b6","sha256:6d5b1e8ed5d4be20fdd4be8cc4da8b26aac56ecd2e2876d1b7d5866f1fd69f7d"],"state_sha256":"ecbcdff0e41f2de87cd83f6b84facad7d085d3b1e53ac33b0294b500ef4c4f7b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bmrXY4Nsa025h4klc1DJqRHgs0/gpiavsjWgNwbalFLW0uL4D76q8vAbQfGd0yclpZNgcj75Ttvo9h3utkuDDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T00:16:32.327267Z","bundle_sha256":"e10640851851b9e486f70f0f019598fdac0afc38657217b0be1098a38e754078"}}