{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RYCPLQVYS55XGYUQESJZHVI4WC","short_pith_number":"pith:RYCPLQVY","schema_version":"1.0","canonical_sha256":"8e04f5c2b8977b736290249393d51cb0b6ba33bf6700e357757ba16df91140d0","source":{"kind":"arxiv","id":"1905.10651","version":3},"attestation_state":"computed","paper":{"title":"Asymptotic Distributions and Rates of Convergence for Random Forests via Generalized U-statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Lucas Mentch, Tim Coleman, Wei Peng","submitted_at":"2019-05-25T18:31:23Z","abstract_excerpt":"Random forests remain among the most popular off-the-shelf supervised learning algorithms. Despite their well-documented empirical success, however, until recently, few theoretical results were available to describe their performance and behavior. In this work we push beyond recent work on consistency and asymptotic normality by establishing rates of convergence for random forests and other supervised learning ensembles. We develop the notion of generalized U-statistics and show that within this framework, random forest predictions can potentially remain asymptotically normal for larger subsam"},"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":"1905.10651","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-25T18:31:23Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"b4a84d477abd29f0015f7e6c497e8a163a212756aa71102b7af14657c4e17156","abstract_canon_sha256":"71356998ced8d054eeecdba190a09ed9c013d5cf2a31080ce357135791fa49fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:31:51.304208Z","signature_b64":"OAjwks3I5hd1bslQRWOeesIvUhXyQ4MqHdBEuXEuGWTvYGcQf4Ic/lXsiYfT48C/6GFKEmqBfTOH88KFy59sCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e04f5c2b8977b736290249393d51cb0b6ba33bf6700e357757ba16df91140d0","last_reissued_at":"2026-07-05T03:31:51.303576Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:31:51.303576Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotic Distributions and Rates of Convergence for Random Forests via Generalized U-statistics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Lucas Mentch, Tim Coleman, Wei Peng","submitted_at":"2019-05-25T18:31:23Z","abstract_excerpt":"Random forests remain among the most popular off-the-shelf supervised learning algorithms. Despite their well-documented empirical success, however, until recently, few theoretical results were available to describe their performance and behavior. In this work we push beyond recent work on consistency and asymptotic normality by establishing rates of convergence for random forests and other supervised learning ensembles. We develop the notion of generalized U-statistics and show that within this framework, random forest predictions can potentially remain asymptotically normal for larger subsam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10651","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.10651/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1905.10651","created_at":"2026-07-05T03:31:51.303662+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10651v3","created_at":"2026-07-05T03:31:51.303662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10651","created_at":"2026-07-05T03:31:51.303662+00:00"},{"alias_kind":"pith_short_12","alias_value":"RYCPLQVYS55X","created_at":"2026-07-05T03:31:51.303662+00:00"},{"alias_kind":"pith_short_16","alias_value":"RYCPLQVYS55XGYUQ","created_at":"2026-07-05T03:31:51.303662+00:00"},{"alias_kind":"pith_short_8","alias_value":"RYCPLQVY","created_at":"2026-07-05T03:31:51.303662+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09967","citing_title":"Locally Optimized Random Forests","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RYCPLQVYS55XGYUQESJZHVI4WC","json":"https://pith.science/pith/RYCPLQVYS55XGYUQESJZHVI4WC.json","graph_json":"https://pith.science/api/pith-number/RYCPLQVYS55XGYUQESJZHVI4WC/graph.json","events_json":"https://pith.science/api/pith-number/RYCPLQVYS55XGYUQESJZHVI4WC/events.json","paper":"https://pith.science/paper/RYCPLQVY"},"agent_actions":{"view_html":"https://pith.science/pith/RYCPLQVYS55XGYUQESJZHVI4WC","download_json":"https://pith.science/pith/RYCPLQVYS55XGYUQESJZHVI4WC.json","view_paper":"https://pith.science/paper/RYCPLQVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10651&json=true","fetch_graph":"https://pith.science/api/pith-number/RYCPLQVYS55XGYUQESJZHVI4WC/graph.json","fetch_events":"https://pith.science/api/pith-number/RYCPLQVYS55XGYUQESJZHVI4WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RYCPLQVYS55XGYUQESJZHVI4WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RYCPLQVYS55XGYUQESJZHVI4WC/action/storage_attestation","attest_author":"https://pith.science/pith/RYCPLQVYS55XGYUQESJZHVI4WC/action/author_attestation","sign_citation":"https://pith.science/pith/RYCPLQVYS55XGYUQESJZHVI4WC/action/citation_signature","submit_replication":"https://pith.science/pith/RYCPLQVYS55XGYUQESJZHVI4WC/action/replication_record"}},"created_at":"2026-07-05T03:31:51.303662+00:00","updated_at":"2026-07-05T03:31:51.303662+00:00"}