{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:ORXK4APFC6Z6TW3E473NB5JLVI","short_pith_number":"pith:ORXK4APF","canonical_record":{"source":{"id":"1904.10416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-23T16:45:07Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"31069386b4417115e8887ce0adcf95372a38b3a6f06836842438dfe50b5ba5e5","abstract_canon_sha256":"aa491059fe3a1bcd679b337325cf143fb0fefbee5d1bb030fbc1168752c06ea9"},"schema_version":"1.0"},"canonical_sha256":"746eae01e517b3e9db64e7f6d0f52baa03ccdd6830d76cd6df927c018e272b27","source":{"kind":"arxiv","id":"1904.10416","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10416","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10416v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10416","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"ORXK4APFC6Z6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"ORXK4APFC6Z6TW3E","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"ORXK4APF","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:ORXK4APFC6Z6TW3E473NB5JLVI","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-23T16:45:07Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"31069386b4417115e8887ce0adcf95372a38b3a6f06836842438dfe50b5ba5e5","abstract_canon_sha256":"aa491059fe3a1bcd679b337325cf143fb0fefbee5d1bb030fbc1168752c06ea9"},"schema_version":"1.0"},"canonical_sha256":"746eae01e517b3e9db64e7f6d0f52baa03ccdd6830d76cd6df927c018e272b27","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:54.221611Z","signature_b64":"5vFeHXdg6dAta220rEA+kZfdruZGbFFjqqdQz+u589HKgQ4Fhwl2C5LiaIXJExf6+VK8moIpxsuFX/rMEaNcBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"746eae01e517b3e9db64e7f6d0f52baa03ccdd6830d76cd6df927c018e272b27","last_reissued_at":"2026-05-17T23:47:54.220966Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:54.220966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10416","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-17T23:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y8H2kj2RkvcwsydAzML1Efdiny2wu0xeqRDO3fQPLShKCLg7Y8oelYo9vAdwraxJO+OFICESy9rCwzqt1CKIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:27:22.171357Z"},"content_sha256":"d04de2e2ab43d7e7f6345544d71e4d401d6fcf885628b8de14386fd7b6b84e68","schema_version":"1.0","event_id":"sha256:d04de2e2ab43d7e7f6345544d71e4d401d6fcf885628b8de14386fd7b6b84e68"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:ORXK4APFC6Z6TW3E473NB5JLVI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regression-Enhanced Random Forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Dan Nettleton, Haozhe Zhang, Zhengyuan Zhu","submitted_at":"2019-04-23T16:45:07Z","abstract_excerpt":"Random forest (RF) methodology is one of the most popular machine learning techniques for prediction problems. In this article, we discuss some cases where random forests may suffer and propose a novel generalized RF method, namely regression-enhanced random forests (RERFs), that can improve on RFs by borrowing the strength of penalized parametric regression. The algorithm for constructing RERFs and selecting its tuning parameters is described. Both simulation study and real data examples show that RERFs have better predictive performance than RFs in important situations often encountered in p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10416","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-17T23:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y9gJAWCL0rIAi/IR+iMcp/AKzRsN0pV+boMuqDFB0X4UsF/7HEkQwAgGoTCbCDLTYqJ/x4HiL9p0aVr4Q2rmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:27:22.172044Z"},"content_sha256":"f0e9be78ea4787f6a6a22b67d8bce4c813e0c797ae0503aff04b2208bf27c6b4","schema_version":"1.0","event_id":"sha256:f0e9be78ea4787f6a6a22b67d8bce4c813e0c797ae0503aff04b2208bf27c6b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ORXK4APFC6Z6TW3E473NB5JLVI/bundle.json","state_url":"https://pith.science/pith/ORXK4APFC6Z6TW3E473NB5JLVI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ORXK4APFC6Z6TW3E473NB5JLVI/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:27:22Z","links":{"resolver":"https://pith.science/pith/ORXK4APFC6Z6TW3E473NB5JLVI","bundle":"https://pith.science/pith/ORXK4APFC6Z6TW3E473NB5JLVI/bundle.json","state":"https://pith.science/pith/ORXK4APFC6Z6TW3E473NB5JLVI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ORXK4APFC6Z6TW3E473NB5JLVI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:ORXK4APFC6Z6TW3E473NB5JLVI","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":"aa491059fe3a1bcd679b337325cf143fb0fefbee5d1bb030fbc1168752c06ea9","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-23T16:45:07Z","title_canon_sha256":"31069386b4417115e8887ce0adcf95372a38b3a6f06836842438dfe50b5ba5e5"},"schema_version":"1.0","source":{"id":"1904.10416","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10416","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10416v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10416","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"ORXK4APFC6Z6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"ORXK4APFC6Z6TW3E","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"ORXK4APF","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:f0e9be78ea4787f6a6a22b67d8bce4c813e0c797ae0503aff04b2208bf27c6b4","target":"graph","created_at":"2026-05-17T23:47:54Z","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 forest (RF) methodology is one of the most popular machine learning techniques for prediction problems. In this article, we discuss some cases where random forests may suffer and propose a novel generalized RF method, namely regression-enhanced random forests (RERFs), that can improve on RFs by borrowing the strength of penalized parametric regression. The algorithm for constructing RERFs and selecting its tuning parameters is described. Both simulation study and real data examples show that RERFs have better predictive performance than RFs in important situations often encountered in p","authors_text":"Dan Nettleton, Haozhe Zhang, Zhengyuan Zhu","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-23T16:45:07Z","title":"Regression-Enhanced Random Forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10416","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:d04de2e2ab43d7e7f6345544d71e4d401d6fcf885628b8de14386fd7b6b84e68","target":"record","created_at":"2026-05-17T23:47:54Z","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":"aa491059fe3a1bcd679b337325cf143fb0fefbee5d1bb030fbc1168752c06ea9","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-04-23T16:45:07Z","title_canon_sha256":"31069386b4417115e8887ce0adcf95372a38b3a6f06836842438dfe50b5ba5e5"},"schema_version":"1.0","source":{"id":"1904.10416","kind":"arxiv","version":1}},"canonical_sha256":"746eae01e517b3e9db64e7f6d0f52baa03ccdd6830d76cd6df927c018e272b27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"746eae01e517b3e9db64e7f6d0f52baa03ccdd6830d76cd6df927c018e272b27","first_computed_at":"2026-05-17T23:47:54.220966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:54.220966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vFeHXdg6dAta220rEA+kZfdruZGbFFjqqdQz+u589HKgQ4Fhwl2C5LiaIXJExf6+VK8moIpxsuFX/rMEaNcBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:54.221611Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10416","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d04de2e2ab43d7e7f6345544d71e4d401d6fcf885628b8de14386fd7b6b84e68","sha256:f0e9be78ea4787f6a6a22b67d8bce4c813e0c797ae0503aff04b2208bf27c6b4"],"state_sha256":"f08b80de11cca344f0e9c819a495fee48bb5dfc2bd3ac4d3631af0d84e74b7db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NQNSSugjFiNCxggEieiYbk2ZlIU3IXbVTRyZLhplDPTmrxFnFVF/w9sYEqrDHwbNIJcAgj3m3urRmSQb+hhwDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:27:22.176116Z","bundle_sha256":"7e4a8facf39604a1daa55014faccbca04debc1d1689aa5bf0d1df004fb248524"}}