{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JCENMMQNNK66EBARSYZGWRCA35","short_pith_number":"pith:JCENMMQN","schema_version":"1.0","canonical_sha256":"4888d6320d6abde2041196326b4440df4e2b2993d9dd35d811af7b684a370235","source":{"kind":"arxiv","id":"2406.18334","version":2},"attestation_state":"computed","paper":{"title":"Efficient and Accurate Explanation Estimation with Distribution Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bernd Bischl, Giuseppe Casalicchio, Hubert Baniecki, Przemyslaw Biecek","submitted_at":"2024-06-26T13:21:24Z","abstract_excerpt":"We discover a theoretical connection between explanation estimation and distribution compression that significantly improves the approximation of feature attributions, importance, and effects. While the exact computation of various machine learning explanations requires numerous model inferences and becomes impractical, the computational cost of approximation increases with an ever-increasing size of data and model parameters. We show that the standard i.i.d. sampling used in a broad spectrum of algorithms for post-hoc explanation leads to an approximation error worthy of improvement. To this "},"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":"2406.18334","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-26T13:21:24Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"77ca57a1f7d7d14ca0063d48c1675cd08d83332ad8a78a1dafb81d0f3b2fb43f","abstract_canon_sha256":"7514a8d09cff45ce8c19475012bdc569fd3d20c8ce9e1947423b389bf89a7a5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:04:14.154443Z","signature_b64":"ASYY8CvJ5jSPb0wvLUCAK/VPrlmtyesg1vsIKEgdcZ/Q8Zp97mMLCS0+n+9fqrr/vzJOOeszdfghY+Q7YOesCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4888d6320d6abde2041196326b4440df4e2b2993d9dd35d811af7b684a370235","last_reissued_at":"2026-07-05T10:04:14.153991Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:04:14.153991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Accurate Explanation Estimation with Distribution Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bernd Bischl, Giuseppe Casalicchio, Hubert Baniecki, Przemyslaw Biecek","submitted_at":"2024-06-26T13:21:24Z","abstract_excerpt":"We discover a theoretical connection between explanation estimation and distribution compression that significantly improves the approximation of feature attributions, importance, and effects. While the exact computation of various machine learning explanations requires numerous model inferences and becomes impractical, the computational cost of approximation increases with an ever-increasing size of data and model parameters. We show that the standard i.i.d. sampling used in a broad spectrum of algorithms for post-hoc explanation leads to an approximation error worthy of improvement. To this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18334","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/2406.18334/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":"2406.18334","created_at":"2026-07-05T10:04:14.154055+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18334v2","created_at":"2026-07-05T10:04:14.154055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18334","created_at":"2026-07-05T10:04:14.154055+00:00"},{"alias_kind":"pith_short_12","alias_value":"JCENMMQNNK66","created_at":"2026-07-05T10:04:14.154055+00:00"},{"alias_kind":"pith_short_16","alias_value":"JCENMMQNNK66EBAR","created_at":"2026-07-05T10:04:14.154055+00:00"},{"alias_kind":"pith_short_8","alias_value":"JCENMMQN","created_at":"2026-07-05T10:04:14.154055+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2412.11308","citing_title":"From XAI to MLOps: Explainable Concept Drift Detection with Profile Drift Detection","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2603.01097","citing_title":"Understanding LoRA as Knowledge Memory: An Empirical Analysis","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JCENMMQNNK66EBARSYZGWRCA35","json":"https://pith.science/pith/JCENMMQNNK66EBARSYZGWRCA35.json","graph_json":"https://pith.science/api/pith-number/JCENMMQNNK66EBARSYZGWRCA35/graph.json","events_json":"https://pith.science/api/pith-number/JCENMMQNNK66EBARSYZGWRCA35/events.json","paper":"https://pith.science/paper/JCENMMQN"},"agent_actions":{"view_html":"https://pith.science/pith/JCENMMQNNK66EBARSYZGWRCA35","download_json":"https://pith.science/pith/JCENMMQNNK66EBARSYZGWRCA35.json","view_paper":"https://pith.science/paper/JCENMMQN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18334&json=true","fetch_graph":"https://pith.science/api/pith-number/JCENMMQNNK66EBARSYZGWRCA35/graph.json","fetch_events":"https://pith.science/api/pith-number/JCENMMQNNK66EBARSYZGWRCA35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JCENMMQNNK66EBARSYZGWRCA35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JCENMMQNNK66EBARSYZGWRCA35/action/storage_attestation","attest_author":"https://pith.science/pith/JCENMMQNNK66EBARSYZGWRCA35/action/author_attestation","sign_citation":"https://pith.science/pith/JCENMMQNNK66EBARSYZGWRCA35/action/citation_signature","submit_replication":"https://pith.science/pith/JCENMMQNNK66EBARSYZGWRCA35/action/replication_record"}},"created_at":"2026-07-05T10:04:14.154055+00:00","updated_at":"2026-07-05T10:04:14.154055+00:00"}