{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:F6GZJBT4JIMJHX5DW37ZSNUY3O","short_pith_number":"pith:F6GZJBT4","schema_version":"1.0","canonical_sha256":"2f8d94867c4a1893dfa3b6ff993698dbbb13c6521b615b726e87beb7b9780017","source":{"kind":"arxiv","id":"2004.11165","version":2},"attestation_state":"computed","paper":{"title":"Multi-Objective Counterfactual Explanations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bernd Bischl, Christoph Molnar, Martin Binder, Susanne Dandl","submitted_at":"2020-04-23T13:56:39Z","abstract_excerpt":"Counterfactual explanations are one of the most popular methods to make predictions of black box machine learning models interpretable by providing explanations in the form of `what-if scenarios'. Most current approaches optimize a collapsed, weighted sum of multiple objectives, which are naturally difficult to balance a-priori. We propose the Multi-Objective Counterfactuals (MOC) method, which translates the counterfactual search into a multi-objective optimization problem. Our approach not only returns a diverse set of counterfactuals with different trade-offs between the proposed objectives"},"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":"2004.11165","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"stat.ML","submitted_at":"2020-04-23T13:56:39Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"b3b579ff0daa38186510d3425ca6a479ef387c098a3d3eae809c40264bc8ba4b","abstract_canon_sha256":"02a4e34588fca4cbba7c8ec86067de90e29333b8d0be84c887a10351fad92350"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:43:14.813480Z","signature_b64":"l85X4kcvxrZUWHDZI2vIBN+35W3gncodFT83NubaNHuq3R1qnzHta7Q9MLO4KiGkHLI1V4OtDUPnMMVl8b4aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f8d94867c4a1893dfa3b6ff993698dbbb13c6521b615b726e87beb7b9780017","last_reissued_at":"2026-07-05T01:43:14.813043Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:43:14.813043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Objective Counterfactual Explanations","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Bernd Bischl, Christoph Molnar, Martin Binder, Susanne Dandl","submitted_at":"2020-04-23T13:56:39Z","abstract_excerpt":"Counterfactual explanations are one of the most popular methods to make predictions of black box machine learning models interpretable by providing explanations in the form of `what-if scenarios'. Most current approaches optimize a collapsed, weighted sum of multiple objectives, which are naturally difficult to balance a-priori. We propose the Multi-Objective Counterfactuals (MOC) method, which translates the counterfactual search into a multi-objective optimization problem. Our approach not only returns a diverse set of counterfactuals with different trade-offs between the proposed objectives"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.11165","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/2004.11165/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":"2004.11165","created_at":"2026-07-05T01:43:14.813110+00:00"},{"alias_kind":"arxiv_version","alias_value":"2004.11165v2","created_at":"2026-07-05T01:43:14.813110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.11165","created_at":"2026-07-05T01:43:14.813110+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6GZJBT4JIMJ","created_at":"2026-07-05T01:43:14.813110+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6GZJBT4JIMJHX5D","created_at":"2026-07-05T01:43:14.813110+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6GZJBT4","created_at":"2026-07-05T01:43:14.813110+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":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F6GZJBT4JIMJHX5DW37ZSNUY3O","json":"https://pith.science/pith/F6GZJBT4JIMJHX5DW37ZSNUY3O.json","graph_json":"https://pith.science/api/pith-number/F6GZJBT4JIMJHX5DW37ZSNUY3O/graph.json","events_json":"https://pith.science/api/pith-number/F6GZJBT4JIMJHX5DW37ZSNUY3O/events.json","paper":"https://pith.science/paper/F6GZJBT4"},"agent_actions":{"view_html":"https://pith.science/pith/F6GZJBT4JIMJHX5DW37ZSNUY3O","download_json":"https://pith.science/pith/F6GZJBT4JIMJHX5DW37ZSNUY3O.json","view_paper":"https://pith.science/paper/F6GZJBT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2004.11165&json=true","fetch_graph":"https://pith.science/api/pith-number/F6GZJBT4JIMJHX5DW37ZSNUY3O/graph.json","fetch_events":"https://pith.science/api/pith-number/F6GZJBT4JIMJHX5DW37ZSNUY3O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6GZJBT4JIMJHX5DW37ZSNUY3O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6GZJBT4JIMJHX5DW37ZSNUY3O/action/storage_attestation","attest_author":"https://pith.science/pith/F6GZJBT4JIMJHX5DW37ZSNUY3O/action/author_attestation","sign_citation":"https://pith.science/pith/F6GZJBT4JIMJHX5DW37ZSNUY3O/action/citation_signature","submit_replication":"https://pith.science/pith/F6GZJBT4JIMJHX5DW37ZSNUY3O/action/replication_record"}},"created_at":"2026-07-05T01:43:14.813110+00:00","updated_at":"2026-07-05T01:43:14.813110+00:00"}