{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:PCRWZXZD6BEDYGMBVSMMF7MDCS","short_pith_number":"pith:PCRWZXZD","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"},"canonical_sha256":"78a36cdf23f0483c1981ac98c2fd8314941c84d8bacadbd6a1cc14e76a5ca290","source":{"kind":"arxiv","id":"2207.07072","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.07072","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"2207.07072v1","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07072","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"PCRWZXZD6BED","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"pith_short_16","alias_value":"PCRWZXZD6BEDYGMB","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"pith_short_8","alias_value":"PCRWZXZD","created_at":"2026-07-05T04:40:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:PCRWZXZD6BEDYGMBVSMMF7MDCS","target":"record","payload":{"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"},"canonical_sha256":"78a36cdf23f0483c1981ac98c2fd8314941c84d8bacadbd6a1cc14e76a5ca290","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"},"source_kind":"arxiv","source_id":"2207.07072","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F5rskCEhbz69SEWb2Abm8mwvAuhQlnkoLaR8GSM/q6u6qspcjMxNY93QSpFKJ2ozqymCA5lnhsSD4Sw7BsHJDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:25:02.120375Z"},"content_sha256":"6abb076ee2eb263e13dec5e0a660d8efd0ec68eb8123bdbfc5a31929d867fda6","schema_version":"1.0","event_id":"sha256:6abb076ee2eb263e13dec5e0a660d8efd0ec68eb8123bdbfc5a31929d867fda6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:PCRWZXZD6BEDYGMBVSMMF7MDCS","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T04:40:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4AyrVzLEpOd6Zz+hMtnbWuZhbbemGoKGbED/0lteEuH7rCH+U8N6VDvGY/ih/l1t2fZPqlIx0jD7Rm4cfmL4AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:25:02.121025Z"},"content_sha256":"b1093232427411f41d298c49934f408e32444ef9314e4eeed8cdb0801f460ba1","schema_version":"1.0","event_id":"sha256:b1093232427411f41d298c49934f408e32444ef9314e4eeed8cdb0801f460ba1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/bundle.json","state_url":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-05T15:25:02Z","links":{"resolver":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS","bundle":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/bundle.json","state":"https://pith.science/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCRWZXZD6BEDYGMBVSMMF7MDCS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PCRWZXZD6BEDYGMBVSMMF7MDCS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"199216ac6719d264cd288a10ed6a8ea55d8d796714b25c41bae2dfde190e969c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-14T17:21:13Z","title_canon_sha256":"29f89747f62b68fec366e30d7883480f762d71a490ec6144f0b17fd61adc1706"},"schema_version":"1.0","source":{"id":"2207.07072","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.07072","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"arxiv_version","alias_value":"2207.07072v1","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.07072","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"pith_short_12","alias_value":"PCRWZXZD6BED","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"pith_short_16","alias_value":"PCRWZXZD6BEDYGMB","created_at":"2026-07-05T04:40:20Z"},{"alias_kind":"pith_short_8","alias_value":"PCRWZXZD","created_at":"2026-07-05T04:40:20Z"}],"graph_snapshots":[{"event_id":"sha256:b1093232427411f41d298c49934f408e32444ef9314e4eeed8cdb0801f460ba1","target":"graph","created_at":"2026-07-05T04:40:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.07072/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Caleb Koch, Guy Blanc, Jane Lange, Li-Yang Tan","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-14T17:21:13Z","title":"A Query-Optimal Algorithm for Finding Counterfactuals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.07072","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6abb076ee2eb263e13dec5e0a660d8efd0ec68eb8123bdbfc5a31929d867fda6","target":"record","created_at":"2026-07-05T04:40:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"199216ac6719d264cd288a10ed6a8ea55d8d796714b25c41bae2dfde190e969c","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-07-14T17:21:13Z","title_canon_sha256":"29f89747f62b68fec366e30d7883480f762d71a490ec6144f0b17fd61adc1706"},"schema_version":"1.0","source":{"id":"2207.07072","kind":"arxiv","version":1}},"canonical_sha256":"78a36cdf23f0483c1981ac98c2fd8314941c84d8bacadbd6a1cc14e76a5ca290","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78a36cdf23f0483c1981ac98c2fd8314941c84d8bacadbd6a1cc14e76a5ca290","first_computed_at":"2026-07-05T04:40:20.745060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:40:20.745060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W7UshOfU1HLYdOgwXHWoOnXv0c98opJINUL4FD3TlEe0OUcTYLcEQe2pa+Y4qShCybiTkS/wQ/iJa2c8UjyGDg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:40:20.745512Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.07072","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6abb076ee2eb263e13dec5e0a660d8efd0ec68eb8123bdbfc5a31929d867fda6","sha256:b1093232427411f41d298c49934f408e32444ef9314e4eeed8cdb0801f460ba1"],"state_sha256":"de524c0829c5b5053fed16dcff56103312228b4620d8023072dbbf9ca2528ed0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FtNWQbzr2wAaiHZH6Z6BEOI37egZZGkkvU/2fmPzsfMjZS699EVjkqm1YSzYjdAz9QlfXGCfw5oBUfVC7LYTDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:25:02.124700Z","bundle_sha256":"11645b61c95481392f044c5701ba16872fe97a7cba3984df539fa11f8fa2065a"}}