{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:OKPNNQTNP23ZHKVFQT4ZPZY2I4","short_pith_number":"pith:OKPNNQTN","schema_version":"1.0","canonical_sha256":"729ed6c26d7eb793aaa584f997e71a473610826740fe65b80fb2386499a3b2a6","source":{"kind":"arxiv","id":"1905.07697","version":2},"attestation_state":"computed","paper":{"title":"Explaining Machine Learning Classifiers through Diverse Counterfactual Explanations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amit Sharma, Chenhao Tan, Ramaravind Kommiya Mothilal","submitted_at":"2019-05-19T07:23:01Z","abstract_excerpt":"Post-hoc explanations of machine learning models are crucial for people to understand and act on algorithmic predictions. An intriguing class of explanations is through counterfactuals, hypothetical examples that show people how to obtain a different prediction. We posit that effective counterfactual explanations should satisfy two properties: feasibility of the counterfactual actions given user context and constraints, and diversity among the counterfactuals presented. To this end, we propose a framework for generating and evaluating a diverse set of counterfactual explanations based on deter"},"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":"1905.07697","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-19T07:23:01Z","cross_cats_sorted":["cs.CY","stat.ML"],"title_canon_sha256":"be19baaf04665b56f4f7ef69fc6ff74a2bdff42ff2a522db01fb5cbef5aa9193","abstract_canon_sha256":"5d96a3fadd0a36084abcf7c8d892fddf402701c313bda13839e7661aa357c5f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:24:26.617548Z","signature_b64":"sPtA1PZsIXK1U/AfRi+6FCiql+wE5BPWVZR6OcqQ4OzbND7BuUUUbhn8bB0Mrg6l+lNQhJdjYVbNayGhxqcOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"729ed6c26d7eb793aaa584f997e71a473610826740fe65b80fb2386499a3b2a6","last_reissued_at":"2026-07-05T00:24:26.617012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:24:26.617012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explaining Machine Learning Classifiers through Diverse Counterfactual Explanations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Amit Sharma, Chenhao Tan, Ramaravind Kommiya Mothilal","submitted_at":"2019-05-19T07:23:01Z","abstract_excerpt":"Post-hoc explanations of machine learning models are crucial for people to understand and act on algorithmic predictions. An intriguing class of explanations is through counterfactuals, hypothetical examples that show people how to obtain a different prediction. We posit that effective counterfactual explanations should satisfy two properties: feasibility of the counterfactual actions given user context and constraints, and diversity among the counterfactuals presented. To this end, we propose a framework for generating and evaluating a diverse set of counterfactual explanations based on deter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07697","kind":"arxiv","version":2},"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/1905.07697/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":"1905.07697","created_at":"2026-07-05T00:24:26.617079+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.07697v2","created_at":"2026-07-05T00:24:26.617079+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07697","created_at":"2026-07-05T00:24:26.617079+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKPNNQTNP23Z","created_at":"2026-07-05T00:24:26.617079+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKPNNQTNP23ZHKVF","created_at":"2026-07-05T00:24:26.617079+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKPNNQTN","created_at":"2026-07-05T00:24:26.617079+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.17161","citing_title":"Tabular Diffusion based Actionable Counterfactual Explanations for Network Intrusion Detection","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKPNNQTNP23ZHKVFQT4ZPZY2I4","json":"https://pith.science/pith/OKPNNQTNP23ZHKVFQT4ZPZY2I4.json","graph_json":"https://pith.science/api/pith-number/OKPNNQTNP23ZHKVFQT4ZPZY2I4/graph.json","events_json":"https://pith.science/api/pith-number/OKPNNQTNP23ZHKVFQT4ZPZY2I4/events.json","paper":"https://pith.science/paper/OKPNNQTN"},"agent_actions":{"view_html":"https://pith.science/pith/OKPNNQTNP23ZHKVFQT4ZPZY2I4","download_json":"https://pith.science/pith/OKPNNQTNP23ZHKVFQT4ZPZY2I4.json","view_paper":"https://pith.science/paper/OKPNNQTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.07697&json=true","fetch_graph":"https://pith.science/api/pith-number/OKPNNQTNP23ZHKVFQT4ZPZY2I4/graph.json","fetch_events":"https://pith.science/api/pith-number/OKPNNQTNP23ZHKVFQT4ZPZY2I4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKPNNQTNP23ZHKVFQT4ZPZY2I4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKPNNQTNP23ZHKVFQT4ZPZY2I4/action/storage_attestation","attest_author":"https://pith.science/pith/OKPNNQTNP23ZHKVFQT4ZPZY2I4/action/author_attestation","sign_citation":"https://pith.science/pith/OKPNNQTNP23ZHKVFQT4ZPZY2I4/action/citation_signature","submit_replication":"https://pith.science/pith/OKPNNQTNP23ZHKVFQT4ZPZY2I4/action/replication_record"}},"created_at":"2026-07-05T00:24:26.617079+00:00","updated_at":"2026-07-05T00:24:26.617079+00:00"}