{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QGRNIT2H73NHKYLW7BDBXMO6YW","short_pith_number":"pith:QGRNIT2H","canonical_record":{"source":{"id":"1801.07194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-22T17:05:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ffdd301e295ff7996057c23da623b905727bc649dc0326a5bcc751050a9677da","abstract_canon_sha256":"502e012f42b892cbe07cf32c63038ae532a75a260dca85aef958e46cf87838a8"},"schema_version":"1.0"},"canonical_sha256":"81a2d44f47feda756176f8461bb1dec58a8abb23ff0032addf2d622f1b1c1cad","source":{"kind":"arxiv","id":"1801.07194","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07194","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07194v1","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07194","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"QGRNIT2H73NH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QGRNIT2H73NHKYLW","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QGRNIT2H","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QGRNIT2H73NHKYLW7BDBXMO6YW","target":"record","payload":{"canonical_record":{"source":{"id":"1801.07194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-22T17:05:20Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ffdd301e295ff7996057c23da623b905727bc649dc0326a5bcc751050a9677da","abstract_canon_sha256":"502e012f42b892cbe07cf32c63038ae532a75a260dca85aef958e46cf87838a8"},"schema_version":"1.0"},"canonical_sha256":"81a2d44f47feda756176f8461bb1dec58a8abb23ff0032addf2d622f1b1c1cad","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:58.612810Z","signature_b64":"GkYfFgzWuk3CPvU1OfGsC+7bZav1NjMT+tUmW6mYfx5vDpysXZknPeiK3EpkM2+sksIsM+z3qX7qR7MNk8wgBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81a2d44f47feda756176f8461bb1dec58a8abb23ff0032addf2d622f1b1c1cad","last_reissued_at":"2026-05-18T00:23:58.612148Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:58.612148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.07194","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-18T00:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o7d7DplnIGMgWZ3NaMmHAsTXNsnXCEbXvg87u4eAVayjT2305cFnKICvzGksLjETBuidvCEuPhqKMPg4tp2AAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:47:23.890539Z"},"content_sha256":"f43890080b4898a87552c6d8304a7a8e396944489cb31a08281a4d33eabd59be","schema_version":"1.0","event_id":"sha256:f43890080b4898a87552c6d8304a7a8e396944489cb31a08281a4d33eabd59be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QGRNIT2H73NHKYLW7BDBXMO6YW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Prediction Intervals by Tuning Random Forest via Meta-Validation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Davide Falessi, Sean Bayley","submitted_at":"2018-01-22T17:05:20Z","abstract_excerpt":"Recent studies have shown that tuning prediction models increases prediction accuracy and that Random Forest can be used to construct prediction intervals. However, to our best knowledge, no study has investigated the need to, and the manner in which one can, tune Random Forest for optimizing prediction intervals { this paper aims to fill this gap. We explore a tuning approach that combines an effectively exhaustive search with a validation technique on a single Random Forest parameter. This paper investigates which, out of eight validation techniques, are beneficial for tuning, i.e., which au"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07194","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-18T00:23:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o77WUJH/DRDaFFJM+ZnddBTT6Xdl6KvuYnPwe1KlD1+9kENyn5YJQMxcj/EFUUEDQP1sR8WlyFwJvcbW0A7mAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T01:47:23.891071Z"},"content_sha256":"156a7d96da627fde1b5dc47e644ab8973706bd9bb4ff323140f84f1172b65d29","schema_version":"1.0","event_id":"sha256:156a7d96da627fde1b5dc47e644ab8973706bd9bb4ff323140f84f1172b65d29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QGRNIT2H73NHKYLW7BDBXMO6YW/bundle.json","state_url":"https://pith.science/pith/QGRNIT2H73NHKYLW7BDBXMO6YW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QGRNIT2H73NHKYLW7BDBXMO6YW/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-12T01:47:23Z","links":{"resolver":"https://pith.science/pith/QGRNIT2H73NHKYLW7BDBXMO6YW","bundle":"https://pith.science/pith/QGRNIT2H73NHKYLW7BDBXMO6YW/bundle.json","state":"https://pith.science/pith/QGRNIT2H73NHKYLW7BDBXMO6YW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QGRNIT2H73NHKYLW7BDBXMO6YW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QGRNIT2H73NHKYLW7BDBXMO6YW","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":"502e012f42b892cbe07cf32c63038ae532a75a260dca85aef958e46cf87838a8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-22T17:05:20Z","title_canon_sha256":"ffdd301e295ff7996057c23da623b905727bc649dc0326a5bcc751050a9677da"},"schema_version":"1.0","source":{"id":"1801.07194","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.07194","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"arxiv_version","alias_value":"1801.07194v1","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07194","created_at":"2026-05-18T00:23:58Z"},{"alias_kind":"pith_short_12","alias_value":"QGRNIT2H73NH","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QGRNIT2H73NHKYLW","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QGRNIT2H","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:156a7d96da627fde1b5dc47e644ab8973706bd9bb4ff323140f84f1172b65d29","target":"graph","created_at":"2026-05-18T00:23:58Z","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":"Recent studies have shown that tuning prediction models increases prediction accuracy and that Random Forest can be used to construct prediction intervals. However, to our best knowledge, no study has investigated the need to, and the manner in which one can, tune Random Forest for optimizing prediction intervals { this paper aims to fill this gap. We explore a tuning approach that combines an effectively exhaustive search with a validation technique on a single Random Forest parameter. This paper investigates which, out of eight validation techniques, are beneficial for tuning, i.e., which au","authors_text":"Davide Falessi, Sean Bayley","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-22T17:05:20Z","title":"Optimizing Prediction Intervals by Tuning Random Forest via Meta-Validation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07194","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:f43890080b4898a87552c6d8304a7a8e396944489cb31a08281a4d33eabd59be","target":"record","created_at":"2026-05-18T00:23:58Z","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":"502e012f42b892cbe07cf32c63038ae532a75a260dca85aef958e46cf87838a8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-01-22T17:05:20Z","title_canon_sha256":"ffdd301e295ff7996057c23da623b905727bc649dc0326a5bcc751050a9677da"},"schema_version":"1.0","source":{"id":"1801.07194","kind":"arxiv","version":1}},"canonical_sha256":"81a2d44f47feda756176f8461bb1dec58a8abb23ff0032addf2d622f1b1c1cad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81a2d44f47feda756176f8461bb1dec58a8abb23ff0032addf2d622f1b1c1cad","first_computed_at":"2026-05-18T00:23:58.612148Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:58.612148Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GkYfFgzWuk3CPvU1OfGsC+7bZav1NjMT+tUmW6mYfx5vDpysXZknPeiK3EpkM2+sksIsM+z3qX7qR7MNk8wgBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:58.612810Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.07194","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f43890080b4898a87552c6d8304a7a8e396944489cb31a08281a4d33eabd59be","sha256:156a7d96da627fde1b5dc47e644ab8973706bd9bb4ff323140f84f1172b65d29"],"state_sha256":"c8e96cd11a999b71bfb2f101a2eebaefb1673ad2533e9936256806bd351998c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFwA6401ml7uKH7pIn2F1IHz7UkJbilBUZiKHdx8gbbx6dmGDRHcL9wHV40FCtFA7qYWC23OO0yPYEl31usoDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T01:47:23.893679Z","bundle_sha256":"a60c79962efd66fad9bb3581919c405569898afbc7c6225083eb95634e779305"}}