{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5424ZMF4N72I5PHVLBVJLEDG4T","short_pith_number":"pith:5424ZMF4","canonical_record":{"source":{"id":"1803.00218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T05:31:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c26debf9bb246e13353ff8f6e51f58b6b6a8eaa5194bd4418584d3a411ce0cb8","abstract_canon_sha256":"340fe47eeb0672a92c0791b7169814019d6b8d6f102c6b55975e921838eec746"},"schema_version":"1.0"},"canonical_sha256":"ef35ccb0bc6ff48ebcf5586a959066e4d73b00bc6af943ff41bdfe47c78bab89","source":{"kind":"arxiv","id":"1803.00218","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00218","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00218v1","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00218","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"5424ZMF4N72I","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"5424ZMF4N72I5PHV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"5424ZMF4","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5424ZMF4N72I5PHVLBVJLEDG4T","target":"record","payload":{"canonical_record":{"source":{"id":"1803.00218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T05:31:38Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c26debf9bb246e13353ff8f6e51f58b6b6a8eaa5194bd4418584d3a411ce0cb8","abstract_canon_sha256":"340fe47eeb0672a92c0791b7169814019d6b8d6f102c6b55975e921838eec746"},"schema_version":"1.0"},"canonical_sha256":"ef35ccb0bc6ff48ebcf5586a959066e4d73b00bc6af943ff41bdfe47c78bab89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:12.968715Z","signature_b64":"UAv/a7PRwYYlcK5dYj3s57acXRrPOuaA8rz/E4uf+yOEVnu9Hs2mwZOKDyOu2iXrGA0FMvsMonYLY7hqE6+SBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ef35ccb0bc6ff48ebcf5586a959066e4d73b00bc6af943ff41bdfe47c78bab89","last_reissued_at":"2026-05-18T00:22:12.968065Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:12.968065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.00218","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:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BA5yHiYbsZRSPZ+RZRxvKpnlKcPNgfSjkA2NkebWr+iEH+nBHox8+iEJJDtHjicphEy+pbKGYmPqjNZYHOunAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:47:54.100616Z"},"content_sha256":"db7b8dd1595a16ca2bc266783d56c9206a5add3010c118c8de0b1535dfae0b2e","schema_version":"1.0","event_id":"sha256:db7b8dd1595a16ca2bc266783d56c9206a5add3010c118c8de0b1535dfae0b2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5424ZMF4N72I5PHVLBVJLEDG4T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interval-based Prediction Uncertainty Bound Computation in Learning with Missing Values","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Hiroyuki Hanada, Ichiro Takeuchi, Jun Sakuma, Toshiyuki Takada","submitted_at":"2018-03-01T05:31:38Z","abstract_excerpt":"The problem of machine learning with missing values is common in many areas. A simple approach is to first construct a dataset without missing values simply by discarding instances with missing entries or by imputing a fixed value for each missing entry, and then train a prediction model with the new dataset. A drawback of this naive approach is that the uncertainty in the missing entries is not properly incorporated in the prediction. In order to evaluate prediction uncertainty, the multiple imputation (MI) approach has been studied, but the performance of MI is sensitive to the choice of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00218","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:22:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"elxx3NvRZLy7pwjuftJVCwk4WT6VIbHaD8vifNzXB3bPPYIZ5ybeM4kpqxBqkkKZXX1Bvr53tGjPAAe48C9zCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T18:47:54.100959Z"},"content_sha256":"da4e19e36538a089c11f73febb7242c0a5957ca6eff00103b2c8b11ddd7b1b8a","schema_version":"1.0","event_id":"sha256:da4e19e36538a089c11f73febb7242c0a5957ca6eff00103b2c8b11ddd7b1b8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5424ZMF4N72I5PHVLBVJLEDG4T/bundle.json","state_url":"https://pith.science/pith/5424ZMF4N72I5PHVLBVJLEDG4T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5424ZMF4N72I5PHVLBVJLEDG4T/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-26T18:47:54Z","links":{"resolver":"https://pith.science/pith/5424ZMF4N72I5PHVLBVJLEDG4T","bundle":"https://pith.science/pith/5424ZMF4N72I5PHVLBVJLEDG4T/bundle.json","state":"https://pith.science/pith/5424ZMF4N72I5PHVLBVJLEDG4T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5424ZMF4N72I5PHVLBVJLEDG4T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5424ZMF4N72I5PHVLBVJLEDG4T","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":"340fe47eeb0672a92c0791b7169814019d6b8d6f102c6b55975e921838eec746","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T05:31:38Z","title_canon_sha256":"c26debf9bb246e13353ff8f6e51f58b6b6a8eaa5194bd4418584d3a411ce0cb8"},"schema_version":"1.0","source":{"id":"1803.00218","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.00218","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"arxiv_version","alias_value":"1803.00218v1","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.00218","created_at":"2026-05-18T00:22:12Z"},{"alias_kind":"pith_short_12","alias_value":"5424ZMF4N72I","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"5424ZMF4N72I5PHV","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"5424ZMF4","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:da4e19e36538a089c11f73febb7242c0a5957ca6eff00103b2c8b11ddd7b1b8a","target":"graph","created_at":"2026-05-18T00:22:12Z","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":"The problem of machine learning with missing values is common in many areas. A simple approach is to first construct a dataset without missing values simply by discarding instances with missing entries or by imputing a fixed value for each missing entry, and then train a prediction model with the new dataset. A drawback of this naive approach is that the uncertainty in the missing entries is not properly incorporated in the prediction. In order to evaluate prediction uncertainty, the multiple imputation (MI) approach has been studied, but the performance of MI is sensitive to the choice of the","authors_text":"Hiroyuki Hanada, Ichiro Takeuchi, Jun Sakuma, Toshiyuki Takada","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T05:31:38Z","title":"Interval-based Prediction Uncertainty Bound Computation in Learning with Missing Values"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.00218","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:db7b8dd1595a16ca2bc266783d56c9206a5add3010c118c8de0b1535dfae0b2e","target":"record","created_at":"2026-05-18T00:22:12Z","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":"340fe47eeb0672a92c0791b7169814019d6b8d6f102c6b55975e921838eec746","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-01T05:31:38Z","title_canon_sha256":"c26debf9bb246e13353ff8f6e51f58b6b6a8eaa5194bd4418584d3a411ce0cb8"},"schema_version":"1.0","source":{"id":"1803.00218","kind":"arxiv","version":1}},"canonical_sha256":"ef35ccb0bc6ff48ebcf5586a959066e4d73b00bc6af943ff41bdfe47c78bab89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ef35ccb0bc6ff48ebcf5586a959066e4d73b00bc6af943ff41bdfe47c78bab89","first_computed_at":"2026-05-18T00:22:12.968065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:12.968065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UAv/a7PRwYYlcK5dYj3s57acXRrPOuaA8rz/E4uf+yOEVnu9Hs2mwZOKDyOu2iXrGA0FMvsMonYLY7hqE6+SBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:12.968715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.00218","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db7b8dd1595a16ca2bc266783d56c9206a5add3010c118c8de0b1535dfae0b2e","sha256:da4e19e36538a089c11f73febb7242c0a5957ca6eff00103b2c8b11ddd7b1b8a"],"state_sha256":"ae96fe70919ceefb19fa8c91feef1d14ba30544f2c73300d6b9fb991c07cd8d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TTjsyuPvnqI8MiJxxQy6+i8WUSBnlUZujbwRy2F0+BIM3nu7mOqlxMWS1s3D7Zx53JzGuwIcGlKPc9rnHh6ICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T18:47:54.102848Z","bundle_sha256":"8491ee34dafbdbe19a8d6a270d4a0e886e78dc08057903171237314d612995ed"}}