{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OP6DBQXGDKCX56ANE6TXOYMXTI","short_pith_number":"pith:OP6DBQXG","canonical_record":{"source":{"id":"1905.07631","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2019-05-18T19:46:41Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"eb3ced5d50de47832ae5958e00152204fbdfaedc7254689c37c3e2dd022fbc87","abstract_canon_sha256":"cff8ccbd57e7550f1ba9174acad6884affc2040961d130e5bc805cdbe118973d"},"schema_version":"1.0"},"canonical_sha256":"73fc30c2e61a857ef80d27a77761979a0a90555cccafb20ca11573b34d09880b","source":{"kind":"arxiv","id":"1905.07631","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07631","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07631v1","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07631","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"OP6DBQXGDKCX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OP6DBQXGDKCX56AN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OP6DBQXG","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OP6DBQXGDKCX56ANE6TXOYMXTI","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07631","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2019-05-18T19:46:41Z","cross_cats_sorted":["cs.LG","stat.ME"],"title_canon_sha256":"eb3ced5d50de47832ae5958e00152204fbdfaedc7254689c37c3e2dd022fbc87","abstract_canon_sha256":"cff8ccbd57e7550f1ba9174acad6884affc2040961d130e5bc805cdbe118973d"},"schema_version":"1.0"},"canonical_sha256":"73fc30c2e61a857ef80d27a77761979a0a90555cccafb20ca11573b34d09880b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:49.013873Z","signature_b64":"ECN+91JRBj7kHwH5SDi1/DANaDq3oygbM19BFaKMvWSXx1vwpx8y5ukW5IM3fYyFcuy4ho4lSH556USYKYylAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"73fc30c2e61a857ef80d27a77761979a0a90555cccafb20ca11573b34d09880b","last_reissued_at":"2026-05-17T23:45:49.013351Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:49.013351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07631","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-17T23:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"93bSV/Ga3EycswYtiiESsxD2C5xiT7Ra4SpzIYNaGbmKOL8qOxIrv5Hw/0lPvPC3mNiq7lBjKwpskbaI6MQ+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:35:45.981815Z"},"content_sha256":"e9f2f4d52ac8445fcb4570b5647d423a58677deffdd104e53c4d6f587414b5ed","schema_version":"1.0","event_id":"sha256:e9f2f4d52ac8445fcb4570b5647d423a58677deffdd104e53c4d6f587414b5ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OP6DBQXGDKCX56ANE6TXOYMXTI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Disentangled Attribution Curves for Interpreting Random Forests and Boosted Trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ME"],"primary_cat":"stat.ML","authors_text":"Bin Yu, Chandan Singh, Summer Devlin, W. James Murdoch","submitted_at":"2019-05-18T19:46:41Z","abstract_excerpt":"Tree ensembles, such as random forests and AdaBoost, are ubiquitous machine learning models known for achieving strong predictive performance across a wide variety of domains. However, this strong performance comes at the cost of interpretability (i.e. users are unable to understand the relationships a trained random forest has learned and why it is making its predictions). In particular, it is challenging to understand how the contribution of a particular feature, or group of features, varies as their value changes. To address this, we introduce Disentangled Attribution Curves (DAC), a method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07631","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-17T23:45:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xgnihTx0X0kRlo/UKjDdbUVMP0iU3Cqtkdo0Bmh5m95yZbw7rz77zAXF/1fDV1aMbb0b8d2hjcG9W1UPvPcuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:35:45.982160Z"},"content_sha256":"bde1befdfe9b5fcd6d23921d61fc2ecbca6c6a7cbbc5534285a5c8410410b984","schema_version":"1.0","event_id":"sha256:bde1befdfe9b5fcd6d23921d61fc2ecbca6c6a7cbbc5534285a5c8410410b984"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OP6DBQXGDKCX56ANE6TXOYMXTI/bundle.json","state_url":"https://pith.science/pith/OP6DBQXGDKCX56ANE6TXOYMXTI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OP6DBQXGDKCX56ANE6TXOYMXTI/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-27T18:35:45Z","links":{"resolver":"https://pith.science/pith/OP6DBQXGDKCX56ANE6TXOYMXTI","bundle":"https://pith.science/pith/OP6DBQXGDKCX56ANE6TXOYMXTI/bundle.json","state":"https://pith.science/pith/OP6DBQXGDKCX56ANE6TXOYMXTI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OP6DBQXGDKCX56ANE6TXOYMXTI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OP6DBQXGDKCX56ANE6TXOYMXTI","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":"cff8ccbd57e7550f1ba9174acad6884affc2040961d130e5bc805cdbe118973d","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2019-05-18T19:46:41Z","title_canon_sha256":"eb3ced5d50de47832ae5958e00152204fbdfaedc7254689c37c3e2dd022fbc87"},"schema_version":"1.0","source":{"id":"1905.07631","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07631","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07631v1","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07631","created_at":"2026-05-17T23:45:49Z"},{"alias_kind":"pith_short_12","alias_value":"OP6DBQXGDKCX","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OP6DBQXGDKCX56AN","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OP6DBQXG","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:bde1befdfe9b5fcd6d23921d61fc2ecbca6c6a7cbbc5534285a5c8410410b984","target":"graph","created_at":"2026-05-17T23:45:49Z","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":"Tree ensembles, such as random forests and AdaBoost, are ubiquitous machine learning models known for achieving strong predictive performance across a wide variety of domains. However, this strong performance comes at the cost of interpretability (i.e. users are unable to understand the relationships a trained random forest has learned and why it is making its predictions). In particular, it is challenging to understand how the contribution of a particular feature, or group of features, varies as their value changes. To address this, we introduce Disentangled Attribution Curves (DAC), a method","authors_text":"Bin Yu, Chandan Singh, Summer Devlin, W. James Murdoch","cross_cats":["cs.LG","stat.ME"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2019-05-18T19:46:41Z","title":"Disentangled Attribution Curves for Interpreting Random Forests and Boosted Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07631","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:e9f2f4d52ac8445fcb4570b5647d423a58677deffdd104e53c4d6f587414b5ed","target":"record","created_at":"2026-05-17T23:45:49Z","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":"cff8ccbd57e7550f1ba9174acad6884affc2040961d130e5bc805cdbe118973d","cross_cats_sorted":["cs.LG","stat.ME"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2019-05-18T19:46:41Z","title_canon_sha256":"eb3ced5d50de47832ae5958e00152204fbdfaedc7254689c37c3e2dd022fbc87"},"schema_version":"1.0","source":{"id":"1905.07631","kind":"arxiv","version":1}},"canonical_sha256":"73fc30c2e61a857ef80d27a77761979a0a90555cccafb20ca11573b34d09880b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"73fc30c2e61a857ef80d27a77761979a0a90555cccafb20ca11573b34d09880b","first_computed_at":"2026-05-17T23:45:49.013351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:49.013351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ECN+91JRBj7kHwH5SDi1/DANaDq3oygbM19BFaKMvWSXx1vwpx8y5ukW5IM3fYyFcuy4ho4lSH556USYKYylAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:49.013873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07631","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e9f2f4d52ac8445fcb4570b5647d423a58677deffdd104e53c4d6f587414b5ed","sha256:bde1befdfe9b5fcd6d23921d61fc2ecbca6c6a7cbbc5534285a5c8410410b984"],"state_sha256":"12331cdc708bc77560b2cc9cc1dd873152cbb4de9ea0a00886b5a384564e29ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0QEWvK24OvC2+cMQWZew8cN0mh4D/fTA+Vmd+Vhu3CjBDUbjsCDQimFN/N5lGG5qszGsvbyDe2zWWOcABOs3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:35:45.984018Z","bundle_sha256":"a9a531d2a75b5ca9c5b2cdcc29eed3fa9b0b255bd6c782c7b47cb892cd3469af"}}