{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3MW74BE6MBDFDGFFQQFHXRITQ3","short_pith_number":"pith:3MW74BE6","canonical_record":{"source":{"id":"1610.08203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-26T06:56:14Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"601cd9214552c0cf63aa4443ce346c28503f40a3089302a060e53d17c332954b","abstract_canon_sha256":"ae7d2e34cd0b141760fa95f8ac93bf866de5016d7a0d989c0b7dc6c730336eff"},"schema_version":"1.0"},"canonical_sha256":"db2dfe049e60465198a5840a7bc51386e81c68f525b93341ab546e1cd8304610","source":{"kind":"arxiv","id":"1610.08203","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08203","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08203v2","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08203","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"3MW74BE6MBDF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3MW74BE6MBDFDGFF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3MW74BE6","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3MW74BE6MBDFDGFFQQFHXRITQ3","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08203","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-26T06:56:14Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"601cd9214552c0cf63aa4443ce346c28503f40a3089302a060e53d17c332954b","abstract_canon_sha256":"ae7d2e34cd0b141760fa95f8ac93bf866de5016d7a0d989c0b7dc6c730336eff"},"schema_version":"1.0"},"canonical_sha256":"db2dfe049e60465198a5840a7bc51386e81c68f525b93341ab546e1cd8304610","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:25.236174Z","signature_b64":"rOV2nryPfuytfZqcOk4cHoQxOX85VP+LWXWgrjd8wO6YbBY2W8pZI2qxCfcwOBeNcag+5cJHFaRNZBCnQ3wADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db2dfe049e60465198a5840a7bc51386e81c68f525b93341ab546e1cd8304610","last_reissued_at":"2026-05-18T00:52:25.235618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:25.235618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08203","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-18T00:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zyd/ID8Bs1UCz9S2DBsebiAYpXChIXrirR898IzMrZUn/9/mC0mdZsH0a3yMPEJ2SgTm/Kc0yFhlXOVZvO/iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:37:10.505659Z"},"content_sha256":"e22e436e940b4e8a0b534578453f748ab64636596b1d7f4e0d07ccee54d3f93d","schema_version":"1.0","event_id":"sha256:e22e436e940b4e8a0b534578453f748ab64636596b1d7f4e0d07ccee54d3f93d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3MW74BE6MBDFDGFFQQFHXRITQ3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Arbres CART et For\\^ets al\\'eatoires, Importance et s\\'election de variables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"stat.ME","authors_text":"Jean-Michel Poggi (LMO, Robin Genuer (SISTM), UPD5)","submitted_at":"2016-10-26T06:56:14Z","abstract_excerpt":"Two algorithms proposed by Leo Breiman : CART trees (Classification And Regression Trees for) introduced in the first half of the 80s and random forests emerged, meanwhile, in the early 2000s, are the subject of this article. The goal is to provide each of the topics, a presentation, a theoretical guarantee, an example and some variants and extensions. After a preamble, introduction recalls objectives of classification and regression problems before retracing some predecessors of the Random Forests. Then, a section is devoted to CART trees then random forests are presented. Then, a variable se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08203","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-18T00:52:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZm5jgoSSIyrluwetwpChYK8CmgL2dojNwjTw8w17vIuRBHrENHFYQviRRhzzjn9NtCzLn2AXzYklgrEJH9FBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:37:10.506015Z"},"content_sha256":"91e7f2b0704b0928e009b359a909fe7a89b1e4f233e609100f8ddf89f0570e86","schema_version":"1.0","event_id":"sha256:91e7f2b0704b0928e009b359a909fe7a89b1e4f233e609100f8ddf89f0570e86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3MW74BE6MBDFDGFFQQFHXRITQ3/bundle.json","state_url":"https://pith.science/pith/3MW74BE6MBDFDGFFQQFHXRITQ3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3MW74BE6MBDFDGFFQQFHXRITQ3/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-06-22T12:37:10Z","links":{"resolver":"https://pith.science/pith/3MW74BE6MBDFDGFFQQFHXRITQ3","bundle":"https://pith.science/pith/3MW74BE6MBDFDGFFQQFHXRITQ3/bundle.json","state":"https://pith.science/pith/3MW74BE6MBDFDGFFQQFHXRITQ3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3MW74BE6MBDFDGFFQQFHXRITQ3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3MW74BE6MBDFDGFFQQFHXRITQ3","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":"ae7d2e34cd0b141760fa95f8ac93bf866de5016d7a0d989c0b7dc6c730336eff","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-26T06:56:14Z","title_canon_sha256":"601cd9214552c0cf63aa4443ce346c28503f40a3089302a060e53d17c332954b"},"schema_version":"1.0","source":{"id":"1610.08203","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08203","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08203v2","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08203","created_at":"2026-05-18T00:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"3MW74BE6MBDF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3MW74BE6MBDFDGFF","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3MW74BE6","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:91e7f2b0704b0928e009b359a909fe7a89b1e4f233e609100f8ddf89f0570e86","target":"graph","created_at":"2026-05-18T00:52:25Z","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":"Two algorithms proposed by Leo Breiman : CART trees (Classification And Regression Trees for) introduced in the first half of the 80s and random forests emerged, meanwhile, in the early 2000s, are the subject of this article. The goal is to provide each of the topics, a presentation, a theoretical guarantee, an example and some variants and extensions. After a preamble, introduction recalls objectives of classification and regression problems before retracing some predecessors of the Random Forests. Then, a section is devoted to CART trees then random forests are presented. Then, a variable se","authors_text":"Jean-Michel Poggi (LMO, Robin Genuer (SISTM), UPD5)","cross_cats":["math.ST","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-26T06:56:14Z","title":"Arbres CART et For\\^ets al\\'eatoires, Importance et s\\'election de variables"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08203","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:e22e436e940b4e8a0b534578453f748ab64636596b1d7f4e0d07ccee54d3f93d","target":"record","created_at":"2026-05-18T00:52:25Z","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":"ae7d2e34cd0b141760fa95f8ac93bf866de5016d7a0d989c0b7dc6c730336eff","cross_cats_sorted":["math.ST","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-26T06:56:14Z","title_canon_sha256":"601cd9214552c0cf63aa4443ce346c28503f40a3089302a060e53d17c332954b"},"schema_version":"1.0","source":{"id":"1610.08203","kind":"arxiv","version":2}},"canonical_sha256":"db2dfe049e60465198a5840a7bc51386e81c68f525b93341ab546e1cd8304610","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db2dfe049e60465198a5840a7bc51386e81c68f525b93341ab546e1cd8304610","first_computed_at":"2026-05-18T00:52:25.235618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:25.235618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rOV2nryPfuytfZqcOk4cHoQxOX85VP+LWXWgrjd8wO6YbBY2W8pZI2qxCfcwOBeNcag+5cJHFaRNZBCnQ3wADA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:25.236174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08203","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e22e436e940b4e8a0b534578453f748ab64636596b1d7f4e0d07ccee54d3f93d","sha256:91e7f2b0704b0928e009b359a909fe7a89b1e4f233e609100f8ddf89f0570e86"],"state_sha256":"a8468fde004fc361424d259a2e75247f7118d5d22b56dc191a3ad3da94c7f3b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfJD9IXOfNpmBkcZTSU0uA0hdGzpUUmG0Vv2WrzoksB8bRzZ3ghJMUOp2JpuVIprvTw+I6dPyWB+EwI2NSWyAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:37:10.507955Z","bundle_sha256":"e171fc9848bb9f2c91b9f05d2f387443df2601aaea5117e32f2400d5012f8316"}}