{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:A6WQNLGCHEDLZYZRLOL26MUGNJ","short_pith_number":"pith:A6WQNLGC","canonical_record":{"source":{"id":"1701.05305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T05:58:05Z","cross_cats_sorted":[],"title_canon_sha256":"d060d7cd31a7ba63df746de9ad93820256a5d7132ed43df67f60ae5b4eb93a50","abstract_canon_sha256":"eb9af8e42d90f10de8d61844fa6bae4207567c53163063c4826ddcd8d99d78f5"},"schema_version":"1.0"},"canonical_sha256":"07ad06acc23906bce3315b97af32866a563f6039fc32857c57290ac89f93b7ef","source":{"kind":"arxiv","id":"1701.05305","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05305","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05305v2","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05305","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"A6WQNLGCHEDL","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6WQNLGCHEDLZYZR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6WQNLGC","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:A6WQNLGCHEDLZYZRLOL26MUGNJ","target":"record","payload":{"canonical_record":{"source":{"id":"1701.05305","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T05:58:05Z","cross_cats_sorted":[],"title_canon_sha256":"d060d7cd31a7ba63df746de9ad93820256a5d7132ed43df67f60ae5b4eb93a50","abstract_canon_sha256":"eb9af8e42d90f10de8d61844fa6bae4207567c53163063c4826ddcd8d99d78f5"},"schema_version":"1.0"},"canonical_sha256":"07ad06acc23906bce3315b97af32866a563f6039fc32857c57290ac89f93b7ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:29.162878Z","signature_b64":"fFG8MYLzaLucYClgSRx7lm7EtqrE4eg5LpwDNEJv+4jbRhnUAWw2FP2BuwKU3St1O3cjJYNXeVKN46qosjK2Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"07ad06acc23906bce3315b97af32866a563f6039fc32857c57290ac89f93b7ef","last_reissued_at":"2026-05-18T00:52:29.162462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:29.162462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.05305","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:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqoW1fkY4rQe38UDZSYZu1Can47jgC45t20C+/Ptn03NlL90KIUTB9Uc2qKRDrWPDu6BMi2iWxX9UJEzgDBLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:22:12.018296Z"},"content_sha256":"7b6310e906e0a1f43714a5c9da947692585929a9a658ae43928a240bf508b8d8","schema_version":"1.0","event_id":"sha256:7b6310e906e0a1f43714a5c9da947692585929a9a658ae43928a240bf508b8d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:A6WQNLGCHEDLZYZRLOL26MUGNJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Forest Missing Data Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Fei Tang, Hemant Ishwaran","submitted_at":"2017-01-19T05:58:05Z","abstract_excerpt":"Random forest (RF) missing data algorithms are an attractive approach for dealing with missing data. They have the desirable properties of being able to handle mixed types of missing data, they are adaptive to interactions and nonlinearity, and they have the potential to scale to big data settings. Currently there are many different RF imputation algorithms but relatively little guidance about their efficacy, which motivated us to study their performance. Using a large, diverse collection of data sets, performance of various RF algorithms was assessed under different missing data mechanisms. A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05305","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:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aA/xQyjcQOoubYR8ajhbxYdk/N7oRIZROSdi5UAaR+TD1q4CCMb1pibkgKU76CUZDDOaly0eyKllqN9zgdvdAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T13:22:12.018912Z"},"content_sha256":"e9406f4a1d4b9fc3f45da429094cfeaa7c9b808709700307f22602e0e2721a84","schema_version":"1.0","event_id":"sha256:e9406f4a1d4b9fc3f45da429094cfeaa7c9b808709700307f22602e0e2721a84"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A6WQNLGCHEDLZYZRLOL26MUGNJ/bundle.json","state_url":"https://pith.science/pith/A6WQNLGCHEDLZYZRLOL26MUGNJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A6WQNLGCHEDLZYZRLOL26MUGNJ/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-06T13:22:12Z","links":{"resolver":"https://pith.science/pith/A6WQNLGCHEDLZYZRLOL26MUGNJ","bundle":"https://pith.science/pith/A6WQNLGCHEDLZYZRLOL26MUGNJ/bundle.json","state":"https://pith.science/pith/A6WQNLGCHEDLZYZRLOL26MUGNJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A6WQNLGCHEDLZYZRLOL26MUGNJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:A6WQNLGCHEDLZYZRLOL26MUGNJ","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":"eb9af8e42d90f10de8d61844fa6bae4207567c53163063c4826ddcd8d99d78f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T05:58:05Z","title_canon_sha256":"d060d7cd31a7ba63df746de9ad93820256a5d7132ed43df67f60ae5b4eb93a50"},"schema_version":"1.0","source":{"id":"1701.05305","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.05305","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"arxiv_version","alias_value":"1701.05305v2","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.05305","created_at":"2026-05-18T00:52:29Z"},{"alias_kind":"pith_short_12","alias_value":"A6WQNLGCHEDL","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"A6WQNLGCHEDLZYZR","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"A6WQNLGC","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:e9406f4a1d4b9fc3f45da429094cfeaa7c9b808709700307f22602e0e2721a84","target":"graph","created_at":"2026-05-18T00:52:29Z","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) missing data algorithms are an attractive approach for dealing with missing data. They have the desirable properties of being able to handle mixed types of missing data, they are adaptive to interactions and nonlinearity, and they have the potential to scale to big data settings. Currently there are many different RF imputation algorithms but relatively little guidance about their efficacy, which motivated us to study their performance. Using a large, diverse collection of data sets, performance of various RF algorithms was assessed under different missing data mechanisms. A","authors_text":"Fei Tang, Hemant Ishwaran","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T05:58:05Z","title":"Random Forest Missing Data Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.05305","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:7b6310e906e0a1f43714a5c9da947692585929a9a658ae43928a240bf508b8d8","target":"record","created_at":"2026-05-18T00:52:29Z","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":"eb9af8e42d90f10de8d61844fa6bae4207567c53163063c4826ddcd8d99d78f5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-19T05:58:05Z","title_canon_sha256":"d060d7cd31a7ba63df746de9ad93820256a5d7132ed43df67f60ae5b4eb93a50"},"schema_version":"1.0","source":{"id":"1701.05305","kind":"arxiv","version":2}},"canonical_sha256":"07ad06acc23906bce3315b97af32866a563f6039fc32857c57290ac89f93b7ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"07ad06acc23906bce3315b97af32866a563f6039fc32857c57290ac89f93b7ef","first_computed_at":"2026-05-18T00:52:29.162462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:29.162462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fFG8MYLzaLucYClgSRx7lm7EtqrE4eg5LpwDNEJv+4jbRhnUAWw2FP2BuwKU3St1O3cjJYNXeVKN46qosjK2Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:29.162878Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.05305","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b6310e906e0a1f43714a5c9da947692585929a9a658ae43928a240bf508b8d8","sha256:e9406f4a1d4b9fc3f45da429094cfeaa7c9b808709700307f22602e0e2721a84"],"state_sha256":"486896f20967034faac37f99b15f57c2ce9736c2231e17298fb59db55d9beac2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gPLv53TAEz2gA1qs1GS3uk4m0F5/H6d7qa7ya9VS4OBIA7m5ZaBIDah40Tx9rBbm1YSoGeU4AXSenIXYLEegAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T13:22:12.021330Z","bundle_sha256":"1115db541d08e104b0289bf450733dc3ee303364968f9d388b32dac548b2f941"}}