{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:422AZCD47DIB7QUWE43TZHLSA7","short_pith_number":"pith:422AZCD4","canonical_record":{"source":{"id":"1405.6684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-26T19:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"f48f0acfe1272112c83795546aef53469db192194d22a703fa82856576c76a8d","abstract_canon_sha256":"f6746a18da657cb56fac17cc61294f3192e151da04f2046a528e5c514908ae60"},"schema_version":"1.0"},"canonical_sha256":"e6b40c887cf8d01fc29627373c9d7207e5c78a9767ecb57df40dc9b0a237e741","source":{"kind":"arxiv","id":"1405.6684","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6684","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6684v1","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6684","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"422AZCD47DIB","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"422AZCD47DIB7QUW","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"422AZCD4","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:422AZCD47DIB7QUWE43TZHLSA7","target":"record","payload":{"canonical_record":{"source":{"id":"1405.6684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-26T19:00:15Z","cross_cats_sorted":[],"title_canon_sha256":"f48f0acfe1272112c83795546aef53469db192194d22a703fa82856576c76a8d","abstract_canon_sha256":"f6746a18da657cb56fac17cc61294f3192e151da04f2046a528e5c514908ae60"},"schema_version":"1.0"},"canonical_sha256":"e6b40c887cf8d01fc29627373c9d7207e5c78a9767ecb57df40dc9b0a237e741","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:31.121697Z","signature_b64":"ojpKX37QsNVZ8C+j7mdWb7VNlO781jhQdpeUqL2TVGgaxmkY3ryr+EkG4uc1bu4PWBOCirsvejvByqrHJFbmAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6b40c887cf8d01fc29627373c9d7207e5c78a9767ecb57df40dc9b0a237e741","last_reissued_at":"2026-05-18T02:47:31.121105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:31.121105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.6684","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-18T02:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I/7qJyBco/pil9fe/ezuJKYbNAxwcJZPUXmFa7+AhowBpFrD4vSdzkGdzirDib5/nhqUF+EhETEAQFdAVzMMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:22:13.242657Z"},"content_sha256":"44d7c3c12e0e66627639cdc08c1f6e4a4c4b1103018574f3bc4a7c7cb5e4188a","schema_version":"1.0","event_id":"sha256:44d7c3c12e0e66627639cdc08c1f6e4a4c4b1103018574f3bc4a7c7cb5e4188a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:422AZCD47DIB7QUWE43TZHLSA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Visualizing Random Forest with Self-Organising Map","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Krzysztof Zaremba, Piotr P{\\l}o\\'nski","submitted_at":"2014-05-26T19:00:15Z","abstract_excerpt":"Random Forest (RF) is a powerful ensemble method for classification and regression tasks. It consists of decision trees set. Although, a single tree is well interpretable for human, the ensemble of trees is a black-box model. The popular technique to look inside the RF model is to visualize a RF proximity matrix obtained on data samples with Multidimensional Scaling (MDS) method. Herein, we present a novel method based on Self-Organising Maps (SOM) for revealing intrinsic relationships in data that lay inside the RF used for classification tasks. We propose an algorithm to learn the SOM with t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6684","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-18T02:47:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A1RJ/c9Rs1frNeI111Z8h+cDjfEDTL/MW0jElucKFRe9Z4utooKP+7VWkNMJcAn7RCbd1OT4IhH8x302IcvpCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T05:22:13.243200Z"},"content_sha256":"cd7d145d0ce0bfa4871f1a1cb56ca629589e38e293c18c12201a44659bc0ce89","schema_version":"1.0","event_id":"sha256:cd7d145d0ce0bfa4871f1a1cb56ca629589e38e293c18c12201a44659bc0ce89"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/422AZCD47DIB7QUWE43TZHLSA7/bundle.json","state_url":"https://pith.science/pith/422AZCD47DIB7QUWE43TZHLSA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/422AZCD47DIB7QUWE43TZHLSA7/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-12T05:22:13Z","links":{"resolver":"https://pith.science/pith/422AZCD47DIB7QUWE43TZHLSA7","bundle":"https://pith.science/pith/422AZCD47DIB7QUWE43TZHLSA7/bundle.json","state":"https://pith.science/pith/422AZCD47DIB7QUWE43TZHLSA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/422AZCD47DIB7QUWE43TZHLSA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:422AZCD47DIB7QUWE43TZHLSA7","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":"f6746a18da657cb56fac17cc61294f3192e151da04f2046a528e5c514908ae60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-26T19:00:15Z","title_canon_sha256":"f48f0acfe1272112c83795546aef53469db192194d22a703fa82856576c76a8d"},"schema_version":"1.0","source":{"id":"1405.6684","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.6684","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"arxiv_version","alias_value":"1405.6684v1","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.6684","created_at":"2026-05-18T02:47:31Z"},{"alias_kind":"pith_short_12","alias_value":"422AZCD47DIB","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"422AZCD47DIB7QUW","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"422AZCD4","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:cd7d145d0ce0bfa4871f1a1cb56ca629589e38e293c18c12201a44659bc0ce89","target":"graph","created_at":"2026-05-18T02:47:31Z","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) is a powerful ensemble method for classification and regression tasks. It consists of decision trees set. Although, a single tree is well interpretable for human, the ensemble of trees is a black-box model. The popular technique to look inside the RF model is to visualize a RF proximity matrix obtained on data samples with Multidimensional Scaling (MDS) method. Herein, we present a novel method based on Self-Organising Maps (SOM) for revealing intrinsic relationships in data that lay inside the RF used for classification tasks. We propose an algorithm to learn the SOM with t","authors_text":"Krzysztof Zaremba, Piotr P{\\l}o\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-26T19:00:15Z","title":"Visualizing Random Forest with Self-Organising Map"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.6684","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:44d7c3c12e0e66627639cdc08c1f6e4a4c4b1103018574f3bc4a7c7cb5e4188a","target":"record","created_at":"2026-05-18T02:47:31Z","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":"f6746a18da657cb56fac17cc61294f3192e151da04f2046a528e5c514908ae60","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-05-26T19:00:15Z","title_canon_sha256":"f48f0acfe1272112c83795546aef53469db192194d22a703fa82856576c76a8d"},"schema_version":"1.0","source":{"id":"1405.6684","kind":"arxiv","version":1}},"canonical_sha256":"e6b40c887cf8d01fc29627373c9d7207e5c78a9767ecb57df40dc9b0a237e741","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6b40c887cf8d01fc29627373c9d7207e5c78a9767ecb57df40dc9b0a237e741","first_computed_at":"2026-05-18T02:47:31.121105Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:31.121105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ojpKX37QsNVZ8C+j7mdWb7VNlO781jhQdpeUqL2TVGgaxmkY3ryr+EkG4uc1bu4PWBOCirsvejvByqrHJFbmAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:31.121697Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.6684","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44d7c3c12e0e66627639cdc08c1f6e4a4c4b1103018574f3bc4a7c7cb5e4188a","sha256:cd7d145d0ce0bfa4871f1a1cb56ca629589e38e293c18c12201a44659bc0ce89"],"state_sha256":"b3a548170689a21f5b9b4b895b436dfd7556ebb543dfd5e930502dd1857fde6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q/svn8sASiZBtENC6XpD20l8f8P0lBTbgELr6Mx+r0pqh1KtBo3FY6ET0y/uiA5IIuGLoWG45sarCMs+9n6PAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T05:22:13.245968Z","bundle_sha256":"0310a7ece2d5a2c90080408e7383e217157042a9f61b12aac41c271089514035"}}