{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ITMLLIJ6K63BJEQR6WYR5JTIWB","short_pith_number":"pith:ITMLLIJ6","canonical_record":{"source":{"id":"1405.2881","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-12T19:15:32Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"fc5669a0c95df59cbec5a646948bc2732370a6df16a7e26ec41bf4359ea9a9c6","abstract_canon_sha256":"847321d8b51ea7092dd82a8654e1f189e0caafcb3e146acfc018a8dbafca856a"},"schema_version":"1.0"},"canonical_sha256":"44d8b5a13e57b6149211f5b11ea668b07310e0ffc09cec4b4be19c7ee8be198c","source":{"kind":"arxiv","id":"1405.2881","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2881","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2881v4","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2881","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"ITMLLIJ6K63B","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ITMLLIJ6K63BJEQR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ITMLLIJ6","created_at":"2026-05-18T12:28:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ITMLLIJ6K63BJEQR6WYR5JTIWB","target":"record","payload":{"canonical_record":{"source":{"id":"1405.2881","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-12T19:15:32Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"fc5669a0c95df59cbec5a646948bc2732370a6df16a7e26ec41bf4359ea9a9c6","abstract_canon_sha256":"847321d8b51ea7092dd82a8654e1f189e0caafcb3e146acfc018a8dbafca856a"},"schema_version":"1.0"},"canonical_sha256":"44d8b5a13e57b6149211f5b11ea668b07310e0ffc09cec4b4be19c7ee8be198c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:38.416084Z","signature_b64":"1sSWn2eR2wY6fTJ81n9xyplFXPdL/eKOHS8O9DdWN6OS48T8Jn8tc3WEYYsvIDdAcmmnpe9v8L2cx7xWiJabAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44d8b5a13e57b6149211f5b11ea668b07310e0ffc09cec4b4be19c7ee8be198c","last_reissued_at":"2026-05-18T01:35:38.415609Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:38.415609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.2881","source_version":4,"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-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yAZmHqCrJqiRgdD3KYvn1gycTKui4pDEsrvlVuwBQk12B5kRFIo4M3PqXlROEwv7l8sHhrK3J5GuC3ik9u2AAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:04:53.199336Z"},"content_sha256":"5e1c69753eeb9e125547e5a09fccff6cd317854a789354ff9dfdba2705a28c58","schema_version":"1.0","event_id":"sha256:5e1c69753eeb9e125547e5a09fccff6cd317854a789354ff9dfdba2705a28c58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ITMLLIJ6K63BJEQR6WYR5JTIWB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Consistency of random forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Erwan Scornet (LSTA), G\\'erard Biau (LSTA, Jean-Philippe Vert (CBIO), LPMA)","submitted_at":"2014-05-12T19:15:32Z","abstract_excerpt":"Random forests are a learning algorithm proposed by Breiman [Mach. Learn. 45 (2001) 5--32] that combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical performance, little is known about the mathematical properties of the procedure. This disparity between theory and practice originates in the difficulty to simultaneously analyze both the randomization process and the highly data-dependent tree structure. In the present paper, we take a step forward in forest exploration by proving a consistency result for Breima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2881","kind":"arxiv","version":4},"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-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9b+4Kx1CWiRx/KkMRXZ00Z1ZJulqOPObWxlqcFWI0W/RcI60nSaJIhybe+4/I6LEuhGIb+dDNyKocV603CkZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:04:53.199695Z"},"content_sha256":"51174b7c409cb99a4d22af38d8e1517d0e90f559c0beb4710c366c49a42021e6","schema_version":"1.0","event_id":"sha256:51174b7c409cb99a4d22af38d8e1517d0e90f559c0beb4710c366c49a42021e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITMLLIJ6K63BJEQR6WYR5JTIWB/bundle.json","state_url":"https://pith.science/pith/ITMLLIJ6K63BJEQR6WYR5JTIWB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITMLLIJ6K63BJEQR6WYR5JTIWB/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-05-28T10:04:53Z","links":{"resolver":"https://pith.science/pith/ITMLLIJ6K63BJEQR6WYR5JTIWB","bundle":"https://pith.science/pith/ITMLLIJ6K63BJEQR6WYR5JTIWB/bundle.json","state":"https://pith.science/pith/ITMLLIJ6K63BJEQR6WYR5JTIWB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITMLLIJ6K63BJEQR6WYR5JTIWB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ITMLLIJ6K63BJEQR6WYR5JTIWB","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":"847321d8b51ea7092dd82a8654e1f189e0caafcb3e146acfc018a8dbafca856a","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-12T19:15:32Z","title_canon_sha256":"fc5669a0c95df59cbec5a646948bc2732370a6df16a7e26ec41bf4359ea9a9c6"},"schema_version":"1.0","source":{"id":"1405.2881","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2881","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2881v4","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2881","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"ITMLLIJ6K63B","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_16","alias_value":"ITMLLIJ6K63BJEQR","created_at":"2026-05-18T12:28:33Z"},{"alias_kind":"pith_short_8","alias_value":"ITMLLIJ6","created_at":"2026-05-18T12:28:33Z"}],"graph_snapshots":[{"event_id":"sha256:51174b7c409cb99a4d22af38d8e1517d0e90f559c0beb4710c366c49a42021e6","target":"graph","created_at":"2026-05-18T01:35:38Z","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":"Random forests are a learning algorithm proposed by Breiman [Mach. Learn. 45 (2001) 5--32] that combines several randomized decision trees and aggregates their predictions by averaging. Despite its wide usage and outstanding practical performance, little is known about the mathematical properties of the procedure. This disparity between theory and practice originates in the difficulty to simultaneously analyze both the randomization process and the highly data-dependent tree structure. In the present paper, we take a step forward in forest exploration by proving a consistency result for Breima","authors_text":"Erwan Scornet (LSTA), G\\'erard Biau (LSTA, Jean-Philippe Vert (CBIO), LPMA)","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-12T19:15:32Z","title":"Consistency of random forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2881","kind":"arxiv","version":4},"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:5e1c69753eeb9e125547e5a09fccff6cd317854a789354ff9dfdba2705a28c58","target":"record","created_at":"2026-05-18T01:35:38Z","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":"847321d8b51ea7092dd82a8654e1f189e0caafcb3e146acfc018a8dbafca856a","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-12T19:15:32Z","title_canon_sha256":"fc5669a0c95df59cbec5a646948bc2732370a6df16a7e26ec41bf4359ea9a9c6"},"schema_version":"1.0","source":{"id":"1405.2881","kind":"arxiv","version":4}},"canonical_sha256":"44d8b5a13e57b6149211f5b11ea668b07310e0ffc09cec4b4be19c7ee8be198c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44d8b5a13e57b6149211f5b11ea668b07310e0ffc09cec4b4be19c7ee8be198c","first_computed_at":"2026-05-18T01:35:38.415609Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:38.415609Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1sSWn2eR2wY6fTJ81n9xyplFXPdL/eKOHS8O9DdWN6OS48T8Jn8tc3WEYYsvIDdAcmmnpe9v8L2cx7xWiJabAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:38.416084Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2881","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e1c69753eeb9e125547e5a09fccff6cd317854a789354ff9dfdba2705a28c58","sha256:51174b7c409cb99a4d22af38d8e1517d0e90f559c0beb4710c366c49a42021e6"],"state_sha256":"1d469880e9dfc61dd98960ac326dbe7ef070a72115fc18dcd0762a9ccd7591bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6jDCYASdKz3V/HVao6K5Of39xorVWWEnUxhYrCSIL9EIC3mI/QBECL8VYziRmi//nWgD0Dvgit4on3Gq0TmIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:04:53.201695Z","bundle_sha256":"6031721cf533cf37580d2ef306fb4cfb430eba30f84ac6974851b3c61ae8d6d7"}}