{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6MH7MKDCHCHFJVE6JPF2O7H6CX","short_pith_number":"pith:6MH7MKDC","canonical_record":{"source":{"id":"2604.16689","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-04-17T20:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"433d65ec197416f91d501ba670b12b80a9ab77ccfdaebea182f23e58f322103a","abstract_canon_sha256":"1e9d3d0bed2f6f4ac316265cd3dd50200faa8609dd1e5ca7e8bbf32a763d0990"},"schema_version":"1.0"},"canonical_sha256":"f30ff62862388e54d49e4bcba77cfe15fe02bd29030e6d18a289593546824049","source":{"kind":"arxiv","id":"2604.16689","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.16689","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"2604.16689v2","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.16689","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"6MH7MKDCHCHF","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"pith_short_16","alias_value":"6MH7MKDCHCHFJVE6","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"pith_short_8","alias_value":"6MH7MKDC","created_at":"2026-06-12T01:08:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6MH7MKDCHCHFJVE6JPF2O7H6CX","target":"record","payload":{"canonical_record":{"source":{"id":"2604.16689","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-04-17T20:46:25Z","cross_cats_sorted":[],"title_canon_sha256":"433d65ec197416f91d501ba670b12b80a9ab77ccfdaebea182f23e58f322103a","abstract_canon_sha256":"1e9d3d0bed2f6f4ac316265cd3dd50200faa8609dd1e5ca7e8bbf32a763d0990"},"schema_version":"1.0"},"canonical_sha256":"f30ff62862388e54d49e4bcba77cfe15fe02bd29030e6d18a289593546824049","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:08:24.766807Z","signature_b64":"7gWqtW/GyQpYdmxOIjlIn26QckXnmjzh3EfTggeEbAMq6l1DjAHo7YVn00tNf5rkbMSiYMk4GL47qMofbC66AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f30ff62862388e54d49e4bcba77cfe15fe02bd29030e6d18a289593546824049","last_reissued_at":"2026-06-12T01:08:24.765894Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:08:24.765894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.16689","source_version":2,"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-06-12T01:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJ4UF1SPKeypVwb44vo5zETSVrKa0ZYfF8WnWtVM5RrOsbhnNyTCgCPXmbZwFliL+cCF3s3TiaoJbd5qV1hCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:49:13.000971Z"},"content_sha256":"038c9961096e8777413a7d6a6a065c212ee55a4fefcbcbbd289cb2a973aa30a6","schema_version":"1.0","event_id":"sha256:038c9961096e8777413a7d6a6a065c212ee55a4fefcbcbbd289cb2a973aa30a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6MH7MKDCHCHFJVE6JPF2O7H6CX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Query Channel: Information-Theoretic Limits of Masking-Based Explanations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Masking-based explanations can be recovered reliably only when their rate stays below the query channel's identification capacity.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Erciyes Karakaya, Ozgur Ercetin","submitted_at":"2026-04-17T20:46:25Z","abstract_excerpt":"Masking-based post-hoc explanation methods, such as KernelSHAP and LIME, estimate local feature importance by querying a black-box model under randomized perturbations. This paper formulates this procedure as communication over a query channel, where the latent explanation acts as a message and each masked evaluation is a channel use. Within this framework, the complexity of the explanation is captured by the entropy of the hypothesis class, while the query interface supplies information at a rate determined by an identification capacity per query. We derive a strong converse showing that, if "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We derive a strong converse showing that, if the explanation rate exceeds this capacity, the probability of exact recovery necessarily converges to one in error for any sequence of explainers and decoders. We also prove an achievability result establishing that a sparse maximum-likelihood decoder attains reliable recovery when the rate lies below capacity.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The query channel model assumes that randomized masking perturbations supply information at a well-defined identification capacity per query that is independent enough of the specific black-box to allow the strong converse to apply uniformly across explainers.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Masking-based explanations are governed by the information capacity of the query channel, with reliable recovery achievable below capacity via sparse maximum-likelihood decoding but impossible above it.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Masking-based explanations can be recovered reliably only when their rate stays below the query channel's identification capacity.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"057766eac6beafb72155225bc515958bdc2bb9a7c49f2d4c87c7782ebce74268"},"source":{"id":"2604.16689","kind":"arxiv","version":2},"verdict":{"id":"a7e7eef2-91fc-4279-882e-fcbc0c1f3cf1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T08:06:36.153392Z","strongest_claim":"We derive a strong converse showing that, if the explanation rate exceeds this capacity, the probability of exact recovery necessarily converges to one in error for any sequence of explainers and decoders. We also prove an achievability result establishing that a sparse maximum-likelihood decoder attains reliable recovery when the rate lies below capacity.","one_line_summary":"Masking-based explanations are governed by the information capacity of the query channel, with reliable recovery achievable below capacity via sparse maximum-likelihood decoding but impossible above it.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The query channel model assumes that randomized masking perturbations supply information at a well-defined identification capacity per query that is independent enough of the specific black-box to allow the strong converse to apply uniformly across explainers.","pith_extraction_headline":"Masking-based explanations can be recovered reliably only when their rate stays below the query channel's identification capacity."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.16689/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":"a7e7eef2-91fc-4279-882e-fcbc0c1f3cf1"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-12T01:08:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VHsNjmO2rWpwu11as2VHii1Pz356dD4Jrexe6BJbbrHLgM92HiyGCpomrwLRH5h3t6drlmpRYrcOUiijS1kKAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T10:49:13.001462Z"},"content_sha256":"a0483d0260cd035553547b9511096a178c4c430056cfb5f7e3efcae29fcfbcf7","schema_version":"1.0","event_id":"sha256:a0483d0260cd035553547b9511096a178c4c430056cfb5f7e3efcae29fcfbcf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6MH7MKDCHCHFJVE6JPF2O7H6CX/bundle.json","state_url":"https://pith.science/pith/6MH7MKDCHCHFJVE6JPF2O7H6CX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6MH7MKDCHCHFJVE6JPF2O7H6CX/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-06-20T10:49:13Z","links":{"resolver":"https://pith.science/pith/6MH7MKDCHCHFJVE6JPF2O7H6CX","bundle":"https://pith.science/pith/6MH7MKDCHCHFJVE6JPF2O7H6CX/bundle.json","state":"https://pith.science/pith/6MH7MKDCHCHFJVE6JPF2O7H6CX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6MH7MKDCHCHFJVE6JPF2O7H6CX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6MH7MKDCHCHFJVE6JPF2O7H6CX","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":"1e9d3d0bed2f6f4ac316265cd3dd50200faa8609dd1e5ca7e8bbf32a763d0990","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-04-17T20:46:25Z","title_canon_sha256":"433d65ec197416f91d501ba670b12b80a9ab77ccfdaebea182f23e58f322103a"},"schema_version":"1.0","source":{"id":"2604.16689","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.16689","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"arxiv_version","alias_value":"2604.16689v2","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.16689","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"pith_short_12","alias_value":"6MH7MKDCHCHF","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"pith_short_16","alias_value":"6MH7MKDCHCHFJVE6","created_at":"2026-06-12T01:08:24Z"},{"alias_kind":"pith_short_8","alias_value":"6MH7MKDC","created_at":"2026-06-12T01:08:24Z"}],"graph_snapshots":[{"event_id":"sha256:a0483d0260cd035553547b9511096a178c4c430056cfb5f7e3efcae29fcfbcf7","target":"graph","created_at":"2026-06-12T01:08:24Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We derive a strong converse showing that, if the explanation rate exceeds this capacity, the probability of exact recovery necessarily converges to one in error for any sequence of explainers and decoders. We also prove an achievability result establishing that a sparse maximum-likelihood decoder attains reliable recovery when the rate lies below capacity."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The query channel model assumes that randomized masking perturbations supply information at a well-defined identification capacity per query that is independent enough of the specific black-box to allow the strong converse to apply uniformly across explainers."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Masking-based explanations are governed by the information capacity of the query channel, with reliable recovery achievable below capacity via sparse maximum-likelihood decoding but impossible above it."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Masking-based explanations can be recovered reliably only when their rate stays below the query channel's identification capacity."}],"snapshot_sha256":"057766eac6beafb72155225bc515958bdc2bb9a7c49f2d4c87c7782ebce74268"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.16689/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Masking-based post-hoc explanation methods, such as KernelSHAP and LIME, estimate local feature importance by querying a black-box model under randomized perturbations. This paper formulates this procedure as communication over a query channel, where the latent explanation acts as a message and each masked evaluation is a channel use. Within this framework, the complexity of the explanation is captured by the entropy of the hypothesis class, while the query interface supplies information at a rate determined by an identification capacity per query. We derive a strong converse showing that, if ","authors_text":"Erciyes Karakaya, Ozgur Ercetin","cross_cats":[],"headline":"Masking-based explanations can be recovered reliably only when their rate stays below the query channel's identification capacity.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-04-17T20:46:25Z","title":"The Query Channel: Information-Theoretic Limits of Masking-Based Explanations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.16689","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T08:06:36.153392Z","id":"a7e7eef2-91fc-4279-882e-fcbc0c1f3cf1","model_set":{"reader":"grok-4.3"},"one_line_summary":"Masking-based explanations are governed by the information capacity of the query channel, with reliable recovery achievable below capacity via sparse maximum-likelihood decoding but impossible above it.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Masking-based explanations can be recovered reliably only when their rate stays below the query channel's identification capacity.","strongest_claim":"We derive a strong converse showing that, if the explanation rate exceeds this capacity, the probability of exact recovery necessarily converges to one in error for any sequence of explainers and decoders. We also prove an achievability result establishing that a sparse maximum-likelihood decoder attains reliable recovery when the rate lies below capacity.","weakest_assumption":"The query channel model assumes that randomized masking perturbations supply information at a well-defined identification capacity per query that is independent enough of the specific black-box to allow the strong converse to apply uniformly across explainers."}},"verdict_id":"a7e7eef2-91fc-4279-882e-fcbc0c1f3cf1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:038c9961096e8777413a7d6a6a065c212ee55a4fefcbcbbd289cb2a973aa30a6","target":"record","created_at":"2026-06-12T01:08:24Z","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":"1e9d3d0bed2f6f4ac316265cd3dd50200faa8609dd1e5ca7e8bbf32a763d0990","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-04-17T20:46:25Z","title_canon_sha256":"433d65ec197416f91d501ba670b12b80a9ab77ccfdaebea182f23e58f322103a"},"schema_version":"1.0","source":{"id":"2604.16689","kind":"arxiv","version":2}},"canonical_sha256":"f30ff62862388e54d49e4bcba77cfe15fe02bd29030e6d18a289593546824049","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f30ff62862388e54d49e4bcba77cfe15fe02bd29030e6d18a289593546824049","first_computed_at":"2026-06-12T01:08:24.765894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:08:24.765894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7gWqtW/GyQpYdmxOIjlIn26QckXnmjzh3EfTggeEbAMq6l1DjAHo7YVn00tNf5rkbMSiYMk4GL47qMofbC66AA==","signature_status":"signed_v1","signed_at":"2026-06-12T01:08:24.766807Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.16689","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:038c9961096e8777413a7d6a6a065c212ee55a4fefcbcbbd289cb2a973aa30a6","sha256:a0483d0260cd035553547b9511096a178c4c430056cfb5f7e3efcae29fcfbcf7"],"state_sha256":"a36904c719c3cd97b6d2d6305f5b4b8df62a54d3ad45e938b62d7044696e0fe0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LTdSf6ewcSndzhJCXGK0EcmQ81A9fJV4/BBtUyAykGeC4YwK/EIPXQzcuqbZAeXfGkRe3NbQek/UieBuxBMgBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T10:49:13.003696Z","bundle_sha256":"aedca1157b3de9b9a794113dca38eb13d6bb2c8412fd415bb08da7a665813633"}}