{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:H4PMHY5WBCKDNFWDIZ6QKMPCBY","short_pith_number":"pith:H4PMHY5W","canonical_record":{"source":{"id":"1405.0352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-02T07:16:55Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"045186b3d75db5f5cb7a6b86e06df4a011196cb3e90265fd0ca9b40aa037f3a5","abstract_canon_sha256":"97c619c249b0bc9d06a3ad7c3ef2f0567bdc1c831dcdefe122e4e7ca4f3a5714"},"schema_version":"1.0"},"canonical_sha256":"3f1ec3e3b608943696c3467d0531e20e3714c5df62d1c5800469551fb49aa473","source":{"kind":"arxiv","id":"1405.0352","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0352","created_at":"2026-05-18T01:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0352v2","created_at":"2026-05-18T01:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0352","created_at":"2026-05-18T01:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"H4PMHY5WBCKD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H4PMHY5WBCKDNFWD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H4PMHY5W","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:H4PMHY5WBCKDNFWDIZ6QKMPCBY","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0352","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-02T07:16:55Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"045186b3d75db5f5cb7a6b86e06df4a011196cb3e90265fd0ca9b40aa037f3a5","abstract_canon_sha256":"97c619c249b0bc9d06a3ad7c3ef2f0567bdc1c831dcdefe122e4e7ca4f3a5714"},"schema_version":"1.0"},"canonical_sha256":"3f1ec3e3b608943696c3467d0531e20e3714c5df62d1c5800469551fb49aa473","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:39.116905Z","signature_b64":"a1RravES1aBW50Ulab+8IRWF4h5L2bgMwN3Zouf8A6tv9l7cFwu5dn1CXGCPiuWnop2aS+E1bHYgAMCnGmIJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f1ec3e3b608943696c3467d0531e20e3714c5df62d1c5800469551fb49aa473","last_reissued_at":"2026-05-18T01:15:39.116130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:39.116130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0352","source_version":2,"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:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uZdo1bm76TubK9BXt4Kbk7G+OrhdHb/qYXgtPUV85ikOCSDB+TNxG/gXM/QV9KvpY8EztFd6PdUICGlyGyuTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:20:06.097867Z"},"content_sha256":"8334d457b9e63dbe67660611ee9c7e4617057d14d2987099418f8470068cac03","schema_version":"1.0","event_id":"sha256:8334d457b9e63dbe67660611ee9c7e4617057d14d2987099418f8470068cac03"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:H4PMHY5WBCKDNFWDIZ6QKMPCBY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotic Theory for Random Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Stefan Wager","submitted_at":"2014-05-02T07:16:55Z","abstract_excerpt":"Random forests have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their predictions are consistent, but these results do not provide practical estimates of random forest errors. In this paper, we analyze a random forest model based on subsampling, and show that random forest predictions are asymptotically normal provided that the subsample size s scales as s(n)/n = o(log(n)^{-d}), where n is the number of training examples and d is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0352","kind":"arxiv","version":2},"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:15:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1QmMLygFQmRIHUVzcZEiwXq2YhCTGB+Er3VWK1V3CmOcM8myG4KkQ6DsDimRxIOlMM8OUg6V4SRzapT9FYulDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:20:06.098572Z"},"content_sha256":"5064a1f6cf196a4e6a25d340513f7f9c1f56349537707ba533b0e10921222d78","schema_version":"1.0","event_id":"sha256:5064a1f6cf196a4e6a25d340513f7f9c1f56349537707ba533b0e10921222d78"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H4PMHY5WBCKDNFWDIZ6QKMPCBY/bundle.json","state_url":"https://pith.science/pith/H4PMHY5WBCKDNFWDIZ6QKMPCBY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H4PMHY5WBCKDNFWDIZ6QKMPCBY/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-26T02:20:06Z","links":{"resolver":"https://pith.science/pith/H4PMHY5WBCKDNFWDIZ6QKMPCBY","bundle":"https://pith.science/pith/H4PMHY5WBCKDNFWDIZ6QKMPCBY/bundle.json","state":"https://pith.science/pith/H4PMHY5WBCKDNFWDIZ6QKMPCBY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H4PMHY5WBCKDNFWDIZ6QKMPCBY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H4PMHY5WBCKDNFWDIZ6QKMPCBY","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":"97c619c249b0bc9d06a3ad7c3ef2f0567bdc1c831dcdefe122e4e7ca4f3a5714","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-02T07:16:55Z","title_canon_sha256":"045186b3d75db5f5cb7a6b86e06df4a011196cb3e90265fd0ca9b40aa037f3a5"},"schema_version":"1.0","source":{"id":"1405.0352","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0352","created_at":"2026-05-18T01:15:39Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0352v2","created_at":"2026-05-18T01:15:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0352","created_at":"2026-05-18T01:15:39Z"},{"alias_kind":"pith_short_12","alias_value":"H4PMHY5WBCKD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H4PMHY5WBCKDNFWD","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H4PMHY5W","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:5064a1f6cf196a4e6a25d340513f7f9c1f56349537707ba533b0e10921222d78","target":"graph","created_at":"2026-05-18T01:15:39Z","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 have proven to be reliable predictive algorithms in many application areas. Not much is known, however, about the statistical properties of random forests. Several authors have established conditions under which their predictions are consistent, but these results do not provide practical estimates of random forest errors. In this paper, we analyze a random forest model based on subsampling, and show that random forest predictions are asymptotically normal provided that the subsample size s scales as s(n)/n = o(log(n)^{-d}), where n is the number of training examples and d is the","authors_text":"Stefan Wager","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-02T07:16:55Z","title":"Asymptotic Theory for Random Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0352","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:8334d457b9e63dbe67660611ee9c7e4617057d14d2987099418f8470068cac03","target":"record","created_at":"2026-05-18T01:15:39Z","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":"97c619c249b0bc9d06a3ad7c3ef2f0567bdc1c831dcdefe122e4e7ca4f3a5714","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-05-02T07:16:55Z","title_canon_sha256":"045186b3d75db5f5cb7a6b86e06df4a011196cb3e90265fd0ca9b40aa037f3a5"},"schema_version":"1.0","source":{"id":"1405.0352","kind":"arxiv","version":2}},"canonical_sha256":"3f1ec3e3b608943696c3467d0531e20e3714c5df62d1c5800469551fb49aa473","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3f1ec3e3b608943696c3467d0531e20e3714c5df62d1c5800469551fb49aa473","first_computed_at":"2026-05-18T01:15:39.116130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:39.116130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a1RravES1aBW50Ulab+8IRWF4h5L2bgMwN3Zouf8A6tv9l7cFwu5dn1CXGCPiuWnop2aS+E1bHYgAMCnGmIJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:39.116905Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0352","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8334d457b9e63dbe67660611ee9c7e4617057d14d2987099418f8470068cac03","sha256:5064a1f6cf196a4e6a25d340513f7f9c1f56349537707ba533b0e10921222d78"],"state_sha256":"b9a3f95fea9ef6e3674a94ae099a34e6f6b8a828c5d3561bc97cd9a44d10241d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YI68bwBN+r2kGbRC5/OOq2p9+IKAJXMrKuq4j2VjxHcQd3T7uPmQichjE9W2A2KnKzkznKSxI5XJOoItieKSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:20:06.102168Z","bundle_sha256":"c8b2e410d248d8d9f8227020eacdce2188bd619d52491f3655c7246df225e917"}}