{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:LWN76HUNSPZYQRLHMAQDEGGX4X","short_pith_number":"pith:LWN76HUN","schema_version":"1.0","canonical_sha256":"5d9bff1e8d93f388456760203218d7e5e721fcca8c31dcaf415a82a7aab9d65c","source":{"kind":"arxiv","id":"1005.0208","version":3},"attestation_state":"computed","paper":{"title":"Analysis of a Random Forests Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"DMA, G\\'erard Biau (LSTA, LPMA)","submitted_at":"2010-05-03T06:50:17Z","abstract_excerpt":"Random forests are a scheme proposed by Leo Breiman in the 2000's for building a predictor ensemble with a set of decision trees that grow in randomly selected subspaces of data. Despite growing interest and practical use, there has been little exploration of the statistical properties of random forests, and little is known about the mathematical forces driving the algorithm. In this paper, we offer an in-depth analysis of a random forests model suggested by Breiman in \\cite{Bre04}, which is very close to the original algorithm. We show in particular that the procedure is consistent and adapts"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1005.0208","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2010-05-03T06:50:17Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"54da41495ee063b5f14d011a8c0f02bc59fbbcdac055d8ac6826953eb315c1a0","abstract_canon_sha256":"d4c504e888432746f69b483cd7ca7e171f22645947e54279da0b470ee7efef73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:14.093703Z","signature_b64":"SwzaP3PhmOt2OPHFirrM3NfI4oCl20EjAxGKRlu98B80NzDDg/Q/+AZA3JWCCirSgn8WXU26iOCG/mneu8utDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d9bff1e8d93f388456760203218d7e5e721fcca8c31dcaf415a82a7aab9d65c","last_reissued_at":"2026-05-18T03:59:14.093004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:14.093004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of a Random Forests Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"DMA, G\\'erard Biau (LSTA, LPMA)","submitted_at":"2010-05-03T06:50:17Z","abstract_excerpt":"Random forests are a scheme proposed by Leo Breiman in the 2000's for building a predictor ensemble with a set of decision trees that grow in randomly selected subspaces of data. Despite growing interest and practical use, there has been little exploration of the statistical properties of random forests, and little is known about the mathematical forces driving the algorithm. In this paper, we offer an in-depth analysis of a random forests model suggested by Breiman in \\cite{Bre04}, which is very close to the original algorithm. We show in particular that the procedure is consistent and adapts"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0208","kind":"arxiv","version":3},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1005.0208","created_at":"2026-05-18T03:59:14.093105+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.0208v3","created_at":"2026-05-18T03:59:14.093105+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0208","created_at":"2026-05-18T03:59:14.093105+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWN76HUNSPZY","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWN76HUNSPZYQRLH","created_at":"2026-05-18T12:26:10.704358+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWN76HUN","created_at":"2026-05-18T12:26:10.704358+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.18579","citing_title":"The T16 Planet Hunt: 10,000 New Planet Candidates from TESS Cycle 1 and the Confirmation of a Hot Jupiter Around TIC 183374187","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LWN76HUNSPZYQRLHMAQDEGGX4X","json":"https://pith.science/pith/LWN76HUNSPZYQRLHMAQDEGGX4X.json","graph_json":"https://pith.science/api/pith-number/LWN76HUNSPZYQRLHMAQDEGGX4X/graph.json","events_json":"https://pith.science/api/pith-number/LWN76HUNSPZYQRLHMAQDEGGX4X/events.json","paper":"https://pith.science/paper/LWN76HUN"},"agent_actions":{"view_html":"https://pith.science/pith/LWN76HUNSPZYQRLHMAQDEGGX4X","download_json":"https://pith.science/pith/LWN76HUNSPZYQRLHMAQDEGGX4X.json","view_paper":"https://pith.science/paper/LWN76HUN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.0208&json=true","fetch_graph":"https://pith.science/api/pith-number/LWN76HUNSPZYQRLHMAQDEGGX4X/graph.json","fetch_events":"https://pith.science/api/pith-number/LWN76HUNSPZYQRLHMAQDEGGX4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWN76HUNSPZYQRLHMAQDEGGX4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWN76HUNSPZYQRLHMAQDEGGX4X/action/storage_attestation","attest_author":"https://pith.science/pith/LWN76HUNSPZYQRLHMAQDEGGX4X/action/author_attestation","sign_citation":"https://pith.science/pith/LWN76HUNSPZYQRLHMAQDEGGX4X/action/citation_signature","submit_replication":"https://pith.science/pith/LWN76HUNSPZYQRLHMAQDEGGX4X/action/replication_record"}},"created_at":"2026-05-18T03:59:14.093105+00:00","updated_at":"2026-05-18T03:59:14.093105+00:00"}