{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:HMYWV4JQHFES7DZDDVIDY37VQX","short_pith_number":"pith:HMYWV4JQ","schema_version":"1.0","canonical_sha256":"3b316af13039492f8f231d503c6ff585cebc4971b0b26fd86fd1e38315fc60fa","source":{"kind":"arxiv","id":"2202.00449","version":2},"attestation_state":"computed","paper":{"title":"A Consistent and Efficient Evaluation Strategy for Attribution Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Enkelejda Kasneci, Gjergji Kasneci, Tobias Leemann, Vadim Borisov, Yao Rong","submitted_at":"2022-02-01T15:00:26Z","abstract_excerpt":"With a variety of local feature attribution methods being proposed in recent years, follow-up work suggested several evaluation strategies. To assess the attribution quality across different attribution techniques, the most popular among these evaluation strategies in the image domain use pixel perturbations. However, recent advances discovered that different evaluation strategies produce conflicting rankings of attribution methods and can be prohibitively expensive to compute. In this work, we present an information-theoretic analysis of evaluation strategies based on pixel perturbations. Our"},"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":"2202.00449","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-02-01T15:00:26Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"feed6176308b4a9215e6f867c58c8f3d5e56c54cbf3ef70d82bd801b76b8791e","abstract_canon_sha256":"de9dd4e5bf0c838e385ae87a0b7d361e0287966162417ff68d5a39cc88f454cb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:31:32.198947Z","signature_b64":"RP2U3c/tCcxTu/uOnFectnEuby2k81ueZp/EPJT9rjM6xNwGzH4BO0SRY9S0A0N4Dh0KFtBZN51V2kw+QunrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b316af13039492f8f231d503c6ff585cebc4971b0b26fd86fd1e38315fc60fa","last_reissued_at":"2026-07-05T04:31:32.198451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:31:32.198451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Consistent and Efficient Evaluation Strategy for Attribution Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Enkelejda Kasneci, Gjergji Kasneci, Tobias Leemann, Vadim Borisov, Yao Rong","submitted_at":"2022-02-01T15:00:26Z","abstract_excerpt":"With a variety of local feature attribution methods being proposed in recent years, follow-up work suggested several evaluation strategies. To assess the attribution quality across different attribution techniques, the most popular among these evaluation strategies in the image domain use pixel perturbations. However, recent advances discovered that different evaluation strategies produce conflicting rankings of attribution methods and can be prohibitively expensive to compute. In this work, we present an information-theoretic analysis of evaluation strategies based on pixel perturbations. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.00449","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/2202.00449/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":"2202.00449","created_at":"2026-07-05T04:31:32.198506+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.00449v2","created_at":"2026-07-05T04:31:32.198506+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.00449","created_at":"2026-07-05T04:31:32.198506+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMYWV4JQHFES","created_at":"2026-07-05T04:31:32.198506+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMYWV4JQHFES7DZD","created_at":"2026-07-05T04:31:32.198506+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMYWV4JQ","created_at":"2026-07-05T04:31:32.198506+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.14590","citing_title":"Explainable AI needs formalization","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05480","citing_title":"GRALIS: A Unified Canonical Framework for Linear Attribution Methods via Riesz Representation","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16905","citing_title":"AIM: Adversarial Information Masking for Faithfulness Evaluation of Saliency Maps","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.05480","citing_title":"GRALIS: A Unified Canonical Framework for Linear Attribution Methods via Riesz Representation","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22045","citing_title":"H-Sets: Hessian-Guided Discovery of Set-Level Feature Interactions in Image Classifiers","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HMYWV4JQHFES7DZDDVIDY37VQX","json":"https://pith.science/pith/HMYWV4JQHFES7DZDDVIDY37VQX.json","graph_json":"https://pith.science/api/pith-number/HMYWV4JQHFES7DZDDVIDY37VQX/graph.json","events_json":"https://pith.science/api/pith-number/HMYWV4JQHFES7DZDDVIDY37VQX/events.json","paper":"https://pith.science/paper/HMYWV4JQ"},"agent_actions":{"view_html":"https://pith.science/pith/HMYWV4JQHFES7DZDDVIDY37VQX","download_json":"https://pith.science/pith/HMYWV4JQHFES7DZDDVIDY37VQX.json","view_paper":"https://pith.science/paper/HMYWV4JQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.00449&json=true","fetch_graph":"https://pith.science/api/pith-number/HMYWV4JQHFES7DZDDVIDY37VQX/graph.json","fetch_events":"https://pith.science/api/pith-number/HMYWV4JQHFES7DZDDVIDY37VQX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMYWV4JQHFES7DZDDVIDY37VQX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMYWV4JQHFES7DZDDVIDY37VQX/action/storage_attestation","attest_author":"https://pith.science/pith/HMYWV4JQHFES7DZDDVIDY37VQX/action/author_attestation","sign_citation":"https://pith.science/pith/HMYWV4JQHFES7DZDDVIDY37VQX/action/citation_signature","submit_replication":"https://pith.science/pith/HMYWV4JQHFES7DZDDVIDY37VQX/action/replication_record"}},"created_at":"2026-07-05T04:31:32.198506+00:00","updated_at":"2026-07-05T04:31:32.198506+00:00"}