{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:CE6ME6NF7LBQT7NANB3VEG27QX","short_pith_number":"pith:CE6ME6NF","canonical_record":{"source":{"id":"1511.05741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-11-18T11:34:43Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"57859ce96ab18a6040fa89bb94a69ec86c3835127da135d45765d0cd2b11ede3","abstract_canon_sha256":"6f37d2a6ba5237bb4a27af0f4f0b06c94e39192b9bf582caae84228ca477e6cd"},"schema_version":"1.0"},"canonical_sha256":"113cc279a5fac309fda06877521b5f85d8b43881c0d68eed806ca539e59ea6c5","source":{"kind":"arxiv","id":"1511.05741","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05741","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05741v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05741","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"CE6ME6NF7LBQ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CE6ME6NF7LBQT7NA","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CE6ME6NF","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:CE6ME6NF7LBQT7NANB3VEG27QX","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05741","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-11-18T11:34:43Z","cross_cats_sorted":["stat.ML","stat.TH"],"title_canon_sha256":"57859ce96ab18a6040fa89bb94a69ec86c3835127da135d45765d0cd2b11ede3","abstract_canon_sha256":"6f37d2a6ba5237bb4a27af0f4f0b06c94e39192b9bf582caae84228ca477e6cd"},"schema_version":"1.0"},"canonical_sha256":"113cc279a5fac309fda06877521b5f85d8b43881c0d68eed806ca539e59ea6c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:32.885882Z","signature_b64":"MTk7KhZDAMA8wiYyzpMoItuROrigSVRr/7nA3UQPlal8O0KjZWK0YI6zOLmy0z8Xth+/iJ92MR36RK2/NbSjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"113cc279a5fac309fda06877521b5f85d8b43881c0d68eed806ca539e59ea6c5","last_reissued_at":"2026-05-18T01:26:32.885194Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:32.885194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05741","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-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"90BR5WBo3kHQGMShEv0D4LXFbhY5iC2Oh1dqfw1c/dWhcbZmC/6itkEUwyeUbmJAxOp+HeoopPGIyKjVlZF4DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:33:05.578054Z"},"content_sha256":"b98d4d55915a225859c159157ed07f6c33b64426bcdf354469a0947e7b4f6053","schema_version":"1.0","event_id":"sha256:b98d4d55915a225859c159157ed07f6c33b64426bcdf354469a0947e7b4f6053"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:CE6ME6NF7LBQT7NANB3VEG27QX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Random Forest Guided Tour","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)","submitted_at":"2015-11-18T11:34:43Z","abstract_excerpt":"The random forest algorithm, proposed by L. Breiman in 2001, has been extremely successful as a general-purpose classification and regression method. The approach, which combines several randomized decision trees and aggregates their predictions by averaging, has shown excellent performance in settings where the number of variables is much larger than the number of observations. Moreover, it is versatile enough to be applied to large-scale problems, is easily adapted to various ad-hoc learning tasks, and returns measures of variable importance. The present article reviews the most recent theor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05741","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-18T01:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XD+hmnYCQscO2xWPBzjLnLF2vSGXsqQh81hP7oNxku629NU0G2OGmUNSTqviARETdzpT8MALft1wW4yJYKv+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:33:05.578416Z"},"content_sha256":"93db22aa29e93f7f5be0eeebe954fb1f0dc2ff967edfd7e48e35b4d64510a260","schema_version":"1.0","event_id":"sha256:93db22aa29e93f7f5be0eeebe954fb1f0dc2ff967edfd7e48e35b4d64510a260"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CE6ME6NF7LBQT7NANB3VEG27QX/bundle.json","state_url":"https://pith.science/pith/CE6ME6NF7LBQT7NANB3VEG27QX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CE6ME6NF7LBQT7NANB3VEG27QX/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-21T13:33:05Z","links":{"resolver":"https://pith.science/pith/CE6ME6NF7LBQT7NANB3VEG27QX","bundle":"https://pith.science/pith/CE6ME6NF7LBQT7NANB3VEG27QX/bundle.json","state":"https://pith.science/pith/CE6ME6NF7LBQT7NANB3VEG27QX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CE6ME6NF7LBQT7NANB3VEG27QX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:CE6ME6NF7LBQT7NANB3VEG27QX","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":"6f37d2a6ba5237bb4a27af0f4f0b06c94e39192b9bf582caae84228ca477e6cd","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-11-18T11:34:43Z","title_canon_sha256":"57859ce96ab18a6040fa89bb94a69ec86c3835127da135d45765d0cd2b11ede3"},"schema_version":"1.0","source":{"id":"1511.05741","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05741","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05741v1","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05741","created_at":"2026-05-18T01:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"CE6ME6NF7LBQ","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"CE6ME6NF7LBQT7NA","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"CE6ME6NF","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:93db22aa29e93f7f5be0eeebe954fb1f0dc2ff967edfd7e48e35b4d64510a260","target":"graph","created_at":"2026-05-18T01:26:32Z","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 random forest algorithm, proposed by L. Breiman in 2001, has been extremely successful as a general-purpose classification and regression method. The approach, which combines several randomized decision trees and aggregates their predictions by averaging, has shown excellent performance in settings where the number of variables is much larger than the number of observations. Moreover, it is versatile enough to be applied to large-scale problems, is easily adapted to various ad-hoc learning tasks, and returns measures of variable importance. The present article reviews the most recent theor","authors_text":"Erwan Scornet (LSTA), G\\'erard Biau (LSTA)","cross_cats":["stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-11-18T11:34:43Z","title":"A Random Forest Guided Tour"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05741","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:b98d4d55915a225859c159157ed07f6c33b64426bcdf354469a0947e7b4f6053","target":"record","created_at":"2026-05-18T01:26:32Z","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":"6f37d2a6ba5237bb4a27af0f4f0b06c94e39192b9bf582caae84228ca477e6cd","cross_cats_sorted":["stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-11-18T11:34:43Z","title_canon_sha256":"57859ce96ab18a6040fa89bb94a69ec86c3835127da135d45765d0cd2b11ede3"},"schema_version":"1.0","source":{"id":"1511.05741","kind":"arxiv","version":1}},"canonical_sha256":"113cc279a5fac309fda06877521b5f85d8b43881c0d68eed806ca539e59ea6c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"113cc279a5fac309fda06877521b5f85d8b43881c0d68eed806ca539e59ea6c5","first_computed_at":"2026-05-18T01:26:32.885194Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:32.885194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MTk7KhZDAMA8wiYyzpMoItuROrigSVRr/7nA3UQPlal8O0KjZWK0YI6zOLmy0z8Xth+/iJ92MR36RK2/NbSjAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:32.885882Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05741","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b98d4d55915a225859c159157ed07f6c33b64426bcdf354469a0947e7b4f6053","sha256:93db22aa29e93f7f5be0eeebe954fb1f0dc2ff967edfd7e48e35b4d64510a260"],"state_sha256":"f77a01d5b2065de310ea5dc95bb73e80642aeeda12aa599efa622211d4c84989"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V+gXkKzfqBapMIK4gx120d6lAtU2DhDOzeW6KCAjddvNaYkwdyub0PeV76Esqr70XqYZwmsH97oVpGAuFApUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:33:05.580421Z","bundle_sha256":"ab282714b83a3dfbe474996139288bb4fd3213692ed69aa527f96b837b4798c7"}}