{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HYRDVCAR7ZJS22LWA2SWWVBY5X","short_pith_number":"pith:HYRDVCAR","schema_version":"1.0","canonical_sha256":"3e223a8811fe532d697606a56b5438ededdc1fb00658f8979f2fcba4cabae8e9","source":{"kind":"arxiv","id":"1911.12199","version":4},"attestation_state":"computed","paper":{"title":"FOCUS: Flexible Optimizable Counterfactual Explanations for Tree Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ana Lucic, Harrie Oosterhuis, Hinda Haned, Maarten de Rijke","submitted_at":"2019-11-27T14:57:11Z","abstract_excerpt":"Model interpretability has become an important problem in machine learning (ML) due to the increased effect that algorithmic decisions have on humans. Counterfactual explanations can help users understand not only why ML models make certain decisions, but also how these decisions can be changed. We frame the problem of finding counterfactual explanations as a gradient-based optimization task and extend previous work that could only be applied to differentiable models. In order to accommodate non-differentiable models such as tree ensembles, we use probabilistic model approximations in the opti"},"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":"1911.12199","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-27T14:57:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c2212f0378e108927be16a279eca023b1ff5fe9bc512fcc93213024c9c75c1fc","abstract_canon_sha256":"fd81c602bbdc5175a96933ef1194979829a35e96128f819d70fcbe61a4ca538f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:41:36.735329Z","signature_b64":"KtXG9m3c6t8/L17c1UtqBIvScGBbiT8isjsFZHrRc/Lj1xmiASWu/SMHt1WYogWv9GsTDNaqGeBtdE2EHo3PBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e223a8811fe532d697606a56b5438ededdc1fb00658f8979f2fcba4cabae8e9","last_reissued_at":"2026-07-05T03:41:36.734971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:41:36.734971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"FOCUS: Flexible Optimizable Counterfactual Explanations for Tree Ensembles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ana Lucic, Harrie Oosterhuis, Hinda Haned, Maarten de Rijke","submitted_at":"2019-11-27T14:57:11Z","abstract_excerpt":"Model interpretability has become an important problem in machine learning (ML) due to the increased effect that algorithmic decisions have on humans. Counterfactual explanations can help users understand not only why ML models make certain decisions, but also how these decisions can be changed. We frame the problem of finding counterfactual explanations as a gradient-based optimization task and extend previous work that could only be applied to differentiable models. In order to accommodate non-differentiable models such as tree ensembles, we use probabilistic model approximations in the opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12199","kind":"arxiv","version":4},"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/1911.12199/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":"1911.12199","created_at":"2026-07-05T03:41:36.735026+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.12199v4","created_at":"2026-07-05T03:41:36.735026+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12199","created_at":"2026-07-05T03:41:36.735026+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYRDVCAR7ZJS","created_at":"2026-07-05T03:41:36.735026+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYRDVCAR7ZJS22LW","created_at":"2026-07-05T03:41:36.735026+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYRDVCAR","created_at":"2026-07-05T03:41:36.735026+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00884","citing_title":"An Explainable Gaussian Process Auto-encoder for Tabular Data","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HYRDVCAR7ZJS22LWA2SWWVBY5X","json":"https://pith.science/pith/HYRDVCAR7ZJS22LWA2SWWVBY5X.json","graph_json":"https://pith.science/api/pith-number/HYRDVCAR7ZJS22LWA2SWWVBY5X/graph.json","events_json":"https://pith.science/api/pith-number/HYRDVCAR7ZJS22LWA2SWWVBY5X/events.json","paper":"https://pith.science/paper/HYRDVCAR"},"agent_actions":{"view_html":"https://pith.science/pith/HYRDVCAR7ZJS22LWA2SWWVBY5X","download_json":"https://pith.science/pith/HYRDVCAR7ZJS22LWA2SWWVBY5X.json","view_paper":"https://pith.science/paper/HYRDVCAR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.12199&json=true","fetch_graph":"https://pith.science/api/pith-number/HYRDVCAR7ZJS22LWA2SWWVBY5X/graph.json","fetch_events":"https://pith.science/api/pith-number/HYRDVCAR7ZJS22LWA2SWWVBY5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYRDVCAR7ZJS22LWA2SWWVBY5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYRDVCAR7ZJS22LWA2SWWVBY5X/action/storage_attestation","attest_author":"https://pith.science/pith/HYRDVCAR7ZJS22LWA2SWWVBY5X/action/author_attestation","sign_citation":"https://pith.science/pith/HYRDVCAR7ZJS22LWA2SWWVBY5X/action/citation_signature","submit_replication":"https://pith.science/pith/HYRDVCAR7ZJS22LWA2SWWVBY5X/action/replication_record"}},"created_at":"2026-07-05T03:41:36.735026+00:00","updated_at":"2026-07-05T03:41:36.735026+00:00"}