{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PCRWZXZD6BEDYGMBVSMMF7MDCS","short_pith_number":"pith:PCRWZXZD","schema_version":"1.0","canonical_sha256":"78a36cdf23f0483c1981ac98c2fd8314941c84d8bacadbd6a1cc14e76a5ca290","source":{"kind":"arxiv","id":"2207.07072","version":1},"attestation_state":"computed","paper":{"title":"A Query-Optimal Algorithm for Finding Counterfactuals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Caleb Koch, Guy Blanc, Jane Lange, Li-Yang Tan","submitted_at":"2022-07-14T17:21:13Z","abstract_excerpt":"We design an algorithm for finding counterfactuals with strong theoretical guarantees on its performance. For any monotone model $f : X^d \\to \\{0,1\\}$ and instance $x^\\star$, our algorithm makes \\[ {S(f)^{O(\\Delta_f(x^\\star))}\\cdot \\log d}\\] queries to $f$ and returns {an {\\sl optimal}} counterfactual for $x^\\star$: a nearest instance $x'$ to $x^\\star$ for which $f(x')\\ne f(x^\\star)$. Here $S(f)$ is the sensitivity of $f$, a discrete analogue of the Lipschitz constant, and $\\Delta_f(x^\\star)$ is the distance from $x^\\star$ to its nearest counterfactuals. The previous best known query complexit"},"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":"2207.07072","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-14T17:21:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"29f89747f62b68fec366e30d7883480f762d71a490ec6144f0b17fd61adc1706","abstract_canon_sha256":"199216ac6719d264cd288a10ed6a8ea55d8d796714b25c41bae2dfde190e969c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:20.745512Z","signature_b64":"W7UshOfU1HLYdOgwXHWoOnXv0c98opJINUL4FD3TlEe0OUcTYLcEQe2pa+Y4qShCybiTkS/wQ/iJa2c8UjyGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78a36cdf23f0483c1981ac98c2fd8314941c84d8bacadbd6a1cc14e76a5ca290","last_reissued_at":"2026-07-05T04:40:20.745060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:20.745060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Query-Optimal Algorithm for Finding Counterfactuals","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Caleb Koch, Guy Blanc, Jane Lange, Li-Yang Tan","submitted_at":"2022-07-14T17:21:13Z","abstract_excerpt":"We design an algorithm for finding counterfactuals with strong theoretical guarantees on its performance. For any monotone model $f : X^d \\to \\{0,1\\}$ and instance $x^\\star$, our algorithm makes \\[ {S(f)^{O(\\Delta_f(x^\\star))}\\cdot \\log d}\\] queries to $f$ and returns {an {\\sl optimal}} counterfactual for $x^\\star$: a nearest instance $x'$ to $x^\\star$ for which $f(x')\\ne f(x^\\star)$. Here $S(f)$ is the sensitivity of $f$, a discrete analogue of the Lipschitz constant, and $\\Delta_f(x^\\star)$ is the distance from $x^\\star$ to its nearest counterfactuals. The previous best known query complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.07072","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/2207.07072/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":"2207.07072","created_at":"2026-07-05T04:40:20.745115+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.07072v1","created_at":"2026-07-05T04:40:20.745115+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07072","created_at":"2026-07-05T04:40:20.745115+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCRWZXZD6BED","created_at":"2026-07-05T04:40:20.745115+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCRWZXZD6BEDYGMB","created_at":"2026-07-05T04:40:20.745115+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCRWZXZD","created_at":"2026-07-05T04:40:20.745115+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS","json":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS.json","graph_json":"https://pith.science/api/pith-number/PCRWZXZD6BEDYGMBVSMMF7MDCS/graph.json","events_json":"https://pith.science/api/pith-number/PCRWZXZD6BEDYGMBVSMMF7MDCS/events.json","paper":"https://pith.science/paper/PCRWZXZD"},"agent_actions":{"view_html":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS","download_json":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS.json","view_paper":"https://pith.science/paper/PCRWZXZD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.07072&json=true","fetch_graph":"https://pith.science/api/pith-number/PCRWZXZD6BEDYGMBVSMMF7MDCS/graph.json","fetch_events":"https://pith.science/api/pith-number/PCRWZXZD6BEDYGMBVSMMF7MDCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/action/storage_attestation","attest_author":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/action/author_attestation","sign_citation":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/action/citation_signature","submit_replication":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/action/replication_record"}},"created_at":"2026-07-05T04:40:20.745115+00:00","updated_at":"2026-07-05T04:40:20.745115+00:00"}