{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7YRNGQR3H35FQDC6D5XKHQ3CEO","short_pith_number":"pith:7YRNGQR3","canonical_record":{"source":{"id":"1710.11004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-30T15:16:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c4ab9395a327c0dea7fca2194c8d82efbfdc69a58b40c079f3715dbf1fe77b23","abstract_canon_sha256":"ba69b17463ec7949289682d8db9b166c183720242fbc2ec22eefb2b28149f8ef"},"schema_version":"1.0"},"canonical_sha256":"fe22d3423b3efa580c5e1f6ea3c36223be5a8e749a801781ae9c538c531494c7","source":{"kind":"arxiv","id":"1710.11004","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11004","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11004v1","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11004","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"7YRNGQR3H35F","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7YRNGQR3H35FQDC6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7YRNGQR3","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7YRNGQR3H35FQDC6D5XKHQ3CEO","target":"record","payload":{"canonical_record":{"source":{"id":"1710.11004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-30T15:16:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"c4ab9395a327c0dea7fca2194c8d82efbfdc69a58b40c079f3715dbf1fe77b23","abstract_canon_sha256":"ba69b17463ec7949289682d8db9b166c183720242fbc2ec22eefb2b28149f8ef"},"schema_version":"1.0"},"canonical_sha256":"fe22d3423b3efa580c5e1f6ea3c36223be5a8e749a801781ae9c538c531494c7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:45.857770Z","signature_b64":"ydqaubzSRjmidO2MFPtgTrkdBDYnGVaXRghr/kBh0OY6ELhRK5j+K3sSdVAHRga80U2m5XWLqY0OOKLs7zkpCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe22d3423b3efa580c5e1f6ea3c36223be5a8e749a801781ae9c538c531494c7","last_reissued_at":"2026-05-18T00:31:45.857122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:45.857122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.11004","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:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53lTdGfVSZsEyvVzh6TXgaAhQ5jmYLWsBkqxJZ7b5fKTQq0nLS/52qXCBxiS8KmaJeT98YqN1THpjBvbmEvzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:04:17.964357Z"},"content_sha256":"a6dd8edce57ca5cec5fc20b7a0bd3cbca209f4486485cb964d7391326f375421","schema_version":"1.0","event_id":"sha256:a6dd8edce57ca5cec5fc20b7a0bd3cbca209f4486485cb964d7391326f375421"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7YRNGQR3H35FQDC6D5XKHQ3CEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Denoising random forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Akisato Kimura, Hironobu Fujiyoshi, Masaya Hibino, Takayoshi Yamashita, Yuji Yamauchi","submitted_at":"2017-10-30T15:16:51Z","abstract_excerpt":"This paper proposes a novel type of random forests called a denoising random forests that are robust against noises contained in test samples. Such noise-corrupted samples cause serious damage to the estimation performances of random forests, since unexpected child nodes are often selected and the leaf nodes that the input sample reaches are sometimes far from those for a clean sample. Our main idea for tackling this problem originates from a binary indicator vector that encodes a traversal path of a sample in the forest. Our proposed method effectively employs this vector by introducing denoi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11004","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:31:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XSWYREKwD+A71XcTZpxzLvkgHrUzaDN+jA+aGLw+fApN72nVEy8Ywdme0EcubiZBw3s7fAPWaTxJMLslWYmtCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:04:17.964967Z"},"content_sha256":"e9bd87dd0cb998926bbfbf9ce06d77faa75ba6fddc9a0d8941fd879c8d0e0d11","schema_version":"1.0","event_id":"sha256:e9bd87dd0cb998926bbfbf9ce06d77faa75ba6fddc9a0d8941fd879c8d0e0d11"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YRNGQR3H35FQDC6D5XKHQ3CEO/bundle.json","state_url":"https://pith.science/pith/7YRNGQR3H35FQDC6D5XKHQ3CEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YRNGQR3H35FQDC6D5XKHQ3CEO/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-06T21:04:17Z","links":{"resolver":"https://pith.science/pith/7YRNGQR3H35FQDC6D5XKHQ3CEO","bundle":"https://pith.science/pith/7YRNGQR3H35FQDC6D5XKHQ3CEO/bundle.json","state":"https://pith.science/pith/7YRNGQR3H35FQDC6D5XKHQ3CEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YRNGQR3H35FQDC6D5XKHQ3CEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7YRNGQR3H35FQDC6D5XKHQ3CEO","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":"ba69b17463ec7949289682d8db9b166c183720242fbc2ec22eefb2b28149f8ef","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-30T15:16:51Z","title_canon_sha256":"c4ab9395a327c0dea7fca2194c8d82efbfdc69a58b40c079f3715dbf1fe77b23"},"schema_version":"1.0","source":{"id":"1710.11004","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.11004","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"arxiv_version","alias_value":"1710.11004v1","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.11004","created_at":"2026-05-18T00:31:45Z"},{"alias_kind":"pith_short_12","alias_value":"7YRNGQR3H35F","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7YRNGQR3H35FQDC6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7YRNGQR3","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:e9bd87dd0cb998926bbfbf9ce06d77faa75ba6fddc9a0d8941fd879c8d0e0d11","target":"graph","created_at":"2026-05-18T00:31:45Z","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":"This paper proposes a novel type of random forests called a denoising random forests that are robust against noises contained in test samples. Such noise-corrupted samples cause serious damage to the estimation performances of random forests, since unexpected child nodes are often selected and the leaf nodes that the input sample reaches are sometimes far from those for a clean sample. Our main idea for tackling this problem originates from a binary indicator vector that encodes a traversal path of a sample in the forest. Our proposed method effectively employs this vector by introducing denoi","authors_text":"Akisato Kimura, Hironobu Fujiyoshi, Masaya Hibino, Takayoshi Yamashita, Yuji Yamauchi","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-30T15:16:51Z","title":"Denoising random forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.11004","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:a6dd8edce57ca5cec5fc20b7a0bd3cbca209f4486485cb964d7391326f375421","target":"record","created_at":"2026-05-18T00:31:45Z","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":"ba69b17463ec7949289682d8db9b166c183720242fbc2ec22eefb2b28149f8ef","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-10-30T15:16:51Z","title_canon_sha256":"c4ab9395a327c0dea7fca2194c8d82efbfdc69a58b40c079f3715dbf1fe77b23"},"schema_version":"1.0","source":{"id":"1710.11004","kind":"arxiv","version":1}},"canonical_sha256":"fe22d3423b3efa580c5e1f6ea3c36223be5a8e749a801781ae9c538c531494c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe22d3423b3efa580c5e1f6ea3c36223be5a8e749a801781ae9c538c531494c7","first_computed_at":"2026-05-18T00:31:45.857122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:45.857122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ydqaubzSRjmidO2MFPtgTrkdBDYnGVaXRghr/kBh0OY6ELhRK5j+K3sSdVAHRga80U2m5XWLqY0OOKLs7zkpCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:45.857770Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.11004","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a6dd8edce57ca5cec5fc20b7a0bd3cbca209f4486485cb964d7391326f375421","sha256:e9bd87dd0cb998926bbfbf9ce06d77faa75ba6fddc9a0d8941fd879c8d0e0d11"],"state_sha256":"1b24830be9a84e3d5b38931fd22e9ed4089ec240f4edd8e3596bca28528e2173"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MkicOG4KsJWxVzRQ0aOcM/9NyoqGlancMrdOOYVUEsyNzjy81GsuhitI+K2OpB1TddDnW48gxSCHy7UV4Z/wAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:04:17.968416Z","bundle_sha256":"83268ebc259c30a35676a431462911b540630dcbd75dba749be5705bd0ef5194"}}