{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:S5LGPH37NKLLXVSPW54GUSDYLT","short_pith_number":"pith:S5LGPH37","canonical_record":{"source":{"id":"2605.26675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-26T08:13:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1942bb2891a3772958019648473b269820352f0e040164582c9867196ba24010","abstract_canon_sha256":"302ef28a5b612aa1f67dfdf406cadade8b6e81e52cc2677f573e121b2f75964b"},"schema_version":"1.0"},"canonical_sha256":"9756679f7f6a96bbd64fb7786a48785ce8655059a96758280fe8471e2bb4b4e0","source":{"kind":"arxiv","id":"2605.26675","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26675","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26675v1","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26675","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"pith_short_12","alias_value":"S5LGPH37NKLL","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"pith_short_16","alias_value":"S5LGPH37NKLLXVSP","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"pith_short_8","alias_value":"S5LGPH37","created_at":"2026-05-27T01:06:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:S5LGPH37NKLLXVSPW54GUSDYLT","target":"record","payload":{"canonical_record":{"source":{"id":"2605.26675","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-26T08:13:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1942bb2891a3772958019648473b269820352f0e040164582c9867196ba24010","abstract_canon_sha256":"302ef28a5b612aa1f67dfdf406cadade8b6e81e52cc2677f573e121b2f75964b"},"schema_version":"1.0"},"canonical_sha256":"9756679f7f6a96bbd64fb7786a48785ce8655059a96758280fe8471e2bb4b4e0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:06:05.362187Z","signature_b64":"VJdPQOGiZDC72i298pxgfhffa5/y+ZmnfQNSZpX2psibo7mgZF4WprkG//Fh2i9GQ0Vid/GjNk7PmTHem6H9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9756679f7f6a96bbd64fb7786a48785ce8655059a96758280fe8471e2bb4b4e0","last_reissued_at":"2026-05-27T01:06:05.361373Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:06:05.361373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.26675","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-27T01:06:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+EjWptpfOFK8ZolvdxxU38S1DgIxPLdWybvyu9USBlgo9ExZNUYC/Y4/2Q8uOUp2CtN6/MQ75UvR8879qojnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T01:03:29.556248Z"},"content_sha256":"aae790c51ad31cab8c995015161a46c229b3e60e3b49375f41ce8a04bd01de46","schema_version":"1.0","event_id":"sha256:aae790c51ad31cab8c995015161a46c229b3e60e3b49375f41ce8a04bd01de46"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:S5LGPH37NKLLXVSPW54GUSDYLT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"CART Random Forests as Sequential Allocation over Random Opportunity Sets: A Stochastic-Control Theory of Ensemble Risk","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jinchi Lv, Mingming Leng, Tianxing Mei, Yingying Fan","submitted_at":"2026-05-26T08:13:22Z","abstract_excerpt":"CART random forests are among the most widely used modern predictive methods, with well-documented empirical success. Yet, at the mechanistic level, the algorithm is often treated as a black box because of its complexity. In this paper, we develop a stochastic-control perspective on feature-subsampled CART random forests, named CART random opportunity-set allocation (CART-ROSA). At each node, the random subset of features is interpreted as a random feasible action set, and the CART split rule as a masked-action allocation policy. This policy induces a controlled stochastic process over informa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26675","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.26675/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"},"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-27T01:06:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KH1vBJI9n11gKG5wfjloproyDHCmzFKEbVVYVqJ+Enis3nwsh9N/KvnAUZlAtA/Z+urDzIxp1i8c2u1OWnnXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T01:03:29.556628Z"},"content_sha256":"ebcf7d7ac4acebaf3275d4337706692eacb5e2d0a6ce7a2a0c4c30b6d07d6a67","schema_version":"1.0","event_id":"sha256:ebcf7d7ac4acebaf3275d4337706692eacb5e2d0a6ce7a2a0c4c30b6d07d6a67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5LGPH37NKLLXVSPW54GUSDYLT/bundle.json","state_url":"https://pith.science/pith/S5LGPH37NKLLXVSPW54GUSDYLT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5LGPH37NKLLXVSPW54GUSDYLT/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-07-02T01:03:29Z","links":{"resolver":"https://pith.science/pith/S5LGPH37NKLLXVSPW54GUSDYLT","bundle":"https://pith.science/pith/S5LGPH37NKLLXVSPW54GUSDYLT/bundle.json","state":"https://pith.science/pith/S5LGPH37NKLLXVSPW54GUSDYLT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5LGPH37NKLLXVSPW54GUSDYLT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:S5LGPH37NKLLXVSPW54GUSDYLT","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":"302ef28a5b612aa1f67dfdf406cadade8b6e81e52cc2677f573e121b2f75964b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-26T08:13:22Z","title_canon_sha256":"1942bb2891a3772958019648473b269820352f0e040164582c9867196ba24010"},"schema_version":"1.0","source":{"id":"2605.26675","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26675","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26675v1","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26675","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"pith_short_12","alias_value":"S5LGPH37NKLL","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"pith_short_16","alias_value":"S5LGPH37NKLLXVSP","created_at":"2026-05-27T01:06:05Z"},{"alias_kind":"pith_short_8","alias_value":"S5LGPH37","created_at":"2026-05-27T01:06:05Z"}],"graph_snapshots":[{"event_id":"sha256:ebcf7d7ac4acebaf3275d4337706692eacb5e2d0a6ce7a2a0c4c30b6d07d6a67","target":"graph","created_at":"2026-05-27T01:06:05Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.26675/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"CART random forests are among the most widely used modern predictive methods, with well-documented empirical success. Yet, at the mechanistic level, the algorithm is often treated as a black box because of its complexity. In this paper, we develop a stochastic-control perspective on feature-subsampled CART random forests, named CART random opportunity-set allocation (CART-ROSA). At each node, the random subset of features is interpreted as a random feasible action set, and the CART split rule as a masked-action allocation policy. This policy induces a controlled stochastic process over informa","authors_text":"Jinchi Lv, Mingming Leng, Tianxing Mei, Yingying Fan","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-26T08:13:22Z","title":"CART Random Forests as Sequential Allocation over Random Opportunity Sets: A Stochastic-Control Theory of Ensemble Risk"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26675","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:aae790c51ad31cab8c995015161a46c229b3e60e3b49375f41ce8a04bd01de46","target":"record","created_at":"2026-05-27T01:06:05Z","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":"302ef28a5b612aa1f67dfdf406cadade8b6e81e52cc2677f573e121b2f75964b","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-05-26T08:13:22Z","title_canon_sha256":"1942bb2891a3772958019648473b269820352f0e040164582c9867196ba24010"},"schema_version":"1.0","source":{"id":"2605.26675","kind":"arxiv","version":1}},"canonical_sha256":"9756679f7f6a96bbd64fb7786a48785ce8655059a96758280fe8471e2bb4b4e0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9756679f7f6a96bbd64fb7786a48785ce8655059a96758280fe8471e2bb4b4e0","first_computed_at":"2026-05-27T01:06:05.361373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:06:05.361373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VJdPQOGiZDC72i298pxgfhffa5/y+ZmnfQNSZpX2psibo7mgZF4WprkG//Fh2i9GQ0Vid/GjNk7PmTHem6H9Cw==","signature_status":"signed_v1","signed_at":"2026-05-27T01:06:05.362187Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26675","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aae790c51ad31cab8c995015161a46c229b3e60e3b49375f41ce8a04bd01de46","sha256:ebcf7d7ac4acebaf3275d4337706692eacb5e2d0a6ce7a2a0c4c30b6d07d6a67"],"state_sha256":"8a60b2418007c0b8d09a4bc2dc41c89cf19e0a3fcf3421e54375661c98d9c8cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0i38YiQHybjuwP6V/1w2WPX9PiJFP0w8dtIAHzk6xno+TGSBD2sctXDmGV8aN+WSITjc8UzC/emEcLAuxevLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T01:03:29.558592Z","bundle_sha256":"d54bcd0a241ce7bf3d2c07742eb385be576881c9e6d9d58f976b2b966da46187"}}