{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:KYUNULHU43JT727KY76EEBLQ3A","short_pith_number":"pith:KYUNULHU","schema_version":"1.0","canonical_sha256":"5628da2cf4e6d33febeac7fc420570d804efe1ab0992db8f2bab07e9d15dac36","source":{"kind":"arxiv","id":"2102.07048","version":1},"attestation_state":"computed","paper":{"title":"Connecting Interpretability and Robustness in Decision Trees through Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kamalika Chaudhuri, Michal Moshkovitz, Yao-Yuan Yang","submitted_at":"2021-02-14T02:08:01Z","abstract_excerpt":"Recent research has recognized interpretability and robustness as essential properties of trustworthy classification. Curiously, a connection between robustness and interpretability was empirically observed, but the theoretical reasoning behind it remained elusive. In this paper, we rigorously investigate this connection. Specifically, we focus on interpretation using decision trees and robustness to $l_{\\infty}$-perturbation. Previous works defined the notion of $r$-separation as a sufficient condition for robustness. We prove upper and lower bounds on the tree size in case the data is $r$-se"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2102.07048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-02-14T02:08:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"beb179b09a3b54db3edc89811deffbb2d8f2cb351741e90b558fc33faa834661","abstract_canon_sha256":"7e46d4f10fe86bb18e87149e873f7577178715ca39da9aa0fd9e83db27633c37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:15:00.856174Z","signature_b64":"nG3Ig2aJooylz2tI8G5fmunMCgfjSjT+zwTIY2L0u7ADkcMa/XCchYL0tuXKSLvZ2fkUBaL/dEW0EJjXD1AADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5628da2cf4e6d33febeac7fc420570d804efe1ab0992db8f2bab07e9d15dac36","last_reissued_at":"2026-07-05T02:15:00.855562Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:15:00.855562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connecting Interpretability and Robustness in Decision Trees through Separation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kamalika Chaudhuri, Michal Moshkovitz, Yao-Yuan Yang","submitted_at":"2021-02-14T02:08:01Z","abstract_excerpt":"Recent research has recognized interpretability and robustness as essential properties of trustworthy classification. Curiously, a connection between robustness and interpretability was empirically observed, but the theoretical reasoning behind it remained elusive. In this paper, we rigorously investigate this connection. Specifically, we focus on interpretation using decision trees and robustness to $l_{\\infty}$-perturbation. Previous works defined the notion of $r$-separation as a sufficient condition for robustness. We prove upper and lower bounds on the tree size in case the data is $r$-se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.07048","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/2102.07048/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2102.07048","created_at":"2026-07-05T02:15:00.855631+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.07048v1","created_at":"2026-07-05T02:15:00.855631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.07048","created_at":"2026-07-05T02:15:00.855631+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYUNULHU43JT","created_at":"2026-07-05T02:15:00.855631+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYUNULHU43JT727K","created_at":"2026-07-05T02:15:00.855631+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYUNULHU","created_at":"2026-07-05T02:15:00.855631+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.02566","citing_title":"Robustness questions the interpretability of graph neural networks: what to do?","ref_index":19,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KYUNULHU43JT727KY76EEBLQ3A","json":"https://pith.science/pith/KYUNULHU43JT727KY76EEBLQ3A.json","graph_json":"https://pith.science/api/pith-number/KYUNULHU43JT727KY76EEBLQ3A/graph.json","events_json":"https://pith.science/api/pith-number/KYUNULHU43JT727KY76EEBLQ3A/events.json","paper":"https://pith.science/paper/KYUNULHU"},"agent_actions":{"view_html":"https://pith.science/pith/KYUNULHU43JT727KY76EEBLQ3A","download_json":"https://pith.science/pith/KYUNULHU43JT727KY76EEBLQ3A.json","view_paper":"https://pith.science/paper/KYUNULHU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.07048&json=true","fetch_graph":"https://pith.science/api/pith-number/KYUNULHU43JT727KY76EEBLQ3A/graph.json","fetch_events":"https://pith.science/api/pith-number/KYUNULHU43JT727KY76EEBLQ3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYUNULHU43JT727KY76EEBLQ3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYUNULHU43JT727KY76EEBLQ3A/action/storage_attestation","attest_author":"https://pith.science/pith/KYUNULHU43JT727KY76EEBLQ3A/action/author_attestation","sign_citation":"https://pith.science/pith/KYUNULHU43JT727KY76EEBLQ3A/action/citation_signature","submit_replication":"https://pith.science/pith/KYUNULHU43JT727KY76EEBLQ3A/action/replication_record"}},"created_at":"2026-07-05T02:15:00.855631+00:00","updated_at":"2026-07-05T02:15:00.855631+00:00"}