{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YQLKRTN572K3E6ZIZYRRJUGCZ2","short_pith_number":"pith:YQLKRTN5","canonical_record":{"source":{"id":"2507.22665","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-30T13:22:28Z","cross_cats_sorted":["cs.HC"],"title_canon_sha256":"7e221660a6abc7ef1b59f113fcf3e6d911c206339b2835063bfd842357b6c4cb","abstract_canon_sha256":"a3a7d212909878162da99dabc5063b09e3bb6f13ba137846308c89c728d2a4b7"},"schema_version":"1.0"},"canonical_sha256":"c416a8cdbdfe95b27b28ce2314d0c2ce8e072d709830978fe14691ceb57d6660","source":{"kind":"arxiv","id":"2507.22665","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.22665","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"2507.22665v1","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22665","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"YQLKRTN572K3","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"pith_short_16","alias_value":"YQLKRTN572K3E6ZI","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"pith_short_8","alias_value":"YQLKRTN5","created_at":"2026-07-05T11:45:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YQLKRTN572K3E6ZIZYRRJUGCZ2","target":"record","payload":{"canonical_record":{"source":{"id":"2507.22665","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-30T13:22:28Z","cross_cats_sorted":["cs.HC"],"title_canon_sha256":"7e221660a6abc7ef1b59f113fcf3e6d911c206339b2835063bfd842357b6c4cb","abstract_canon_sha256":"a3a7d212909878162da99dabc5063b09e3bb6f13ba137846308c89c728d2a4b7"},"schema_version":"1.0"},"canonical_sha256":"c416a8cdbdfe95b27b28ce2314d0c2ce8e072d709830978fe14691ceb57d6660","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:45:46.544735Z","signature_b64":"9jB63nVlwOw40m1ELTtjxbPzsG2+WW6WoPKCV2qH5HW7CDBB0T8jYV+jPGWWfzItI3BvajQmo8tpe3cX92S0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c416a8cdbdfe95b27b28ce2314d0c2ce8e072d709830978fe14691ceb57d6660","last_reissued_at":"2026-07-05T11:45:46.544223Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:45:46.544223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.22665","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-07-05T11:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5b+Ndk0PtDztE42qi2zPNqxsaKty359Oc2QrN4+zibQJOkdSo0XHK5yP5TjoXLKYzjlD8GkGx6Psd35JGeYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T04:20:05.730112Z"},"content_sha256":"1d3d8684b84e48be8c177cb7ab8390d045c0594913e5814cc631b084cc34e641","schema_version":"1.0","event_id":"sha256:1d3d8684b84e48be8c177cb7ab8390d045c0594913e5814cc631b084cc34e641"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YQLKRTN572K3E6ZIZYRRJUGCZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cluster-Based Random Forest Visualization and Interpretation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.HC"],"primary_cat":"cs.LG","authors_text":"Christofer Meinecke, Dennis Collaris, Max Sondag, Stef van den Elzen, Tatiana von Landesberger","submitted_at":"2025-07-30T13:22:28Z","abstract_excerpt":"Random forests are a machine learning method used to automatically classify datasets and consist of a multitude of decision trees. While these random forests often have higher performance and generalize better than a single decision tree, they are also harder to interpret. This paper presents a visualization method and system to increase interpretability of random forests. We cluster similar trees which enables users to interpret how the model performs in general without needing to analyze each individual decision tree in detail, or interpret an oversimplified summary of the full forest. To me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22665","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.22665/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:45:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zsfa7o+AhSvAC0cy9DTShX5uiul5rM2jST9TGmRLRPWkiP1NVS2vK7V31uvG3haj/6xqKzvs63JB0BgozWpJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-19T04:20:05.730489Z"},"content_sha256":"56ab72f6c06f72b1b7c3680dca90e6c63d48e82c2c397245e66dd62240d80709","schema_version":"1.0","event_id":"sha256:56ab72f6c06f72b1b7c3680dca90e6c63d48e82c2c397245e66dd62240d80709"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YQLKRTN572K3E6ZIZYRRJUGCZ2/bundle.json","state_url":"https://pith.science/pith/YQLKRTN572K3E6ZIZYRRJUGCZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YQLKRTN572K3E6ZIZYRRJUGCZ2/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-07-19T04:20:05Z","links":{"resolver":"https://pith.science/pith/YQLKRTN572K3E6ZIZYRRJUGCZ2","bundle":"https://pith.science/pith/YQLKRTN572K3E6ZIZYRRJUGCZ2/bundle.json","state":"https://pith.science/pith/YQLKRTN572K3E6ZIZYRRJUGCZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YQLKRTN572K3E6ZIZYRRJUGCZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YQLKRTN572K3E6ZIZYRRJUGCZ2","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":"a3a7d212909878162da99dabc5063b09e3bb6f13ba137846308c89c728d2a4b7","cross_cats_sorted":["cs.HC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-30T13:22:28Z","title_canon_sha256":"7e221660a6abc7ef1b59f113fcf3e6d911c206339b2835063bfd842357b6c4cb"},"schema_version":"1.0","source":{"id":"2507.22665","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.22665","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"arxiv_version","alias_value":"2507.22665v1","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.22665","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"pith_short_12","alias_value":"YQLKRTN572K3","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"pith_short_16","alias_value":"YQLKRTN572K3E6ZI","created_at":"2026-07-05T11:45:46Z"},{"alias_kind":"pith_short_8","alias_value":"YQLKRTN5","created_at":"2026-07-05T11:45:46Z"}],"graph_snapshots":[{"event_id":"sha256:56ab72f6c06f72b1b7c3680dca90e6c63d48e82c2c397245e66dd62240d80709","target":"graph","created_at":"2026-07-05T11:45:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.22665/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Random forests are a machine learning method used to automatically classify datasets and consist of a multitude of decision trees. While these random forests often have higher performance and generalize better than a single decision tree, they are also harder to interpret. This paper presents a visualization method and system to increase interpretability of random forests. We cluster similar trees which enables users to interpret how the model performs in general without needing to analyze each individual decision tree in detail, or interpret an oversimplified summary of the full forest. To me","authors_text":"Christofer Meinecke, Dennis Collaris, Max Sondag, Stef van den Elzen, Tatiana von Landesberger","cross_cats":["cs.HC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-30T13:22:28Z","title":"Cluster-Based Random Forest Visualization and Interpretation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.22665","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:1d3d8684b84e48be8c177cb7ab8390d045c0594913e5814cc631b084cc34e641","target":"record","created_at":"2026-07-05T11:45:46Z","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":"a3a7d212909878162da99dabc5063b09e3bb6f13ba137846308c89c728d2a4b7","cross_cats_sorted":["cs.HC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-30T13:22:28Z","title_canon_sha256":"7e221660a6abc7ef1b59f113fcf3e6d911c206339b2835063bfd842357b6c4cb"},"schema_version":"1.0","source":{"id":"2507.22665","kind":"arxiv","version":1}},"canonical_sha256":"c416a8cdbdfe95b27b28ce2314d0c2ce8e072d709830978fe14691ceb57d6660","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c416a8cdbdfe95b27b28ce2314d0c2ce8e072d709830978fe14691ceb57d6660","first_computed_at":"2026-07-05T11:45:46.544223Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:45:46.544223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9jB63nVlwOw40m1ELTtjxbPzsG2+WW6WoPKCV2qH5HW7CDBB0T8jYV+jPGWWfzItI3BvajQmo8tpe3cX92S0DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:45:46.544735Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.22665","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d3d8684b84e48be8c177cb7ab8390d045c0594913e5814cc631b084cc34e641","sha256:56ab72f6c06f72b1b7c3680dca90e6c63d48e82c2c397245e66dd62240d80709"],"state_sha256":"16fae00562774486cebca64a5569e313c646696478e90778de12fcaec7c1b0fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fk1eHk5V39RfyJYKUyKc3T0XLTnyF0y63hFrh3h5LBYLJN6IeSwHD/6oplME0Bf5osfFzYHBdO6w6jW+lAiCDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-19T04:20:05.732571Z","bundle_sha256":"157ce1d1878c4caaaa9a578f411263058009ba43062655c7040b97d77b2f5f35"}}