{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BL57MAI6L2Y4PVE7L2TC7FXR3V","short_pith_number":"pith:BL57MAI6","schema_version":"1.0","canonical_sha256":"0afbf6011e5eb1c7d49f5ea62f96f1dd72d75ce5ff4a79c5bbf39185a943b937","source":{"kind":"arxiv","id":"1905.11092","version":1},"attestation_state":"computed","paper":{"title":"A Rate-Distortion Framework for Explaining Neural Network Decisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gitta Kutyniok, Jan Macdonald, Sascha Hauch, Stephan W\\\"aldchen","submitted_at":"2019-05-27T09:58:08Z","abstract_excerpt":"We formalise the widespread idea of interpreting neural network decisions as an explicit optimisation problem in a rate-distortion framework. A set of input features is deemed relevant for a classification decision if the expected classifier score remains nearly constant when randomising the remaining features. We discuss the computational complexity of finding small sets of relevant features and show that the problem is complete for $\\mathsf{NP}^\\mathsf{PP}$, an important class of computational problems frequently arising in AI tasks. Furthermore, we show that it even remains $\\mathsf{NP}$-ha"},"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":"1905.11092","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T09:58:08Z","cross_cats_sorted":["cs.CC","cs.IT","math.IT","stat.ML"],"title_canon_sha256":"e825ae95f4eccddc06383e03b9dc6b19a8b8fb06e5f33c529f376f7faa9d98d5","abstract_canon_sha256":"3cac3fb1210ac8a82e96d404eec2513bd30b57f9e4bab2b63f159c9a2f992427"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:02.966077Z","signature_b64":"haSLaCXR7srP8Aj3A3wSYbQ9a8vQVecSkkddGshPGFYaDkaaxACUxV79nZlH0CwP9I2gFdowClt/iS/dEznSAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0afbf6011e5eb1c7d49f5ea62f96f1dd72d75ce5ff4a79c5bbf39185a943b937","last_reissued_at":"2026-05-17T23:45:02.965561Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:02.965561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Rate-Distortion Framework for Explaining Neural Network Decisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.IT","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Gitta Kutyniok, Jan Macdonald, Sascha Hauch, Stephan W\\\"aldchen","submitted_at":"2019-05-27T09:58:08Z","abstract_excerpt":"We formalise the widespread idea of interpreting neural network decisions as an explicit optimisation problem in a rate-distortion framework. A set of input features is deemed relevant for a classification decision if the expected classifier score remains nearly constant when randomising the remaining features. We discuss the computational complexity of finding small sets of relevant features and show that the problem is complete for $\\mathsf{NP}^\\mathsf{PP}$, an important class of computational problems frequently arising in AI tasks. Furthermore, we show that it even remains $\\mathsf{NP}$-ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11092","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":""},"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":"1905.11092","created_at":"2026-05-17T23:45:02.965646+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11092v1","created_at":"2026-05-17T23:45:02.965646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11092","created_at":"2026-05-17T23:45:02.965646+00:00"},{"alias_kind":"pith_short_12","alias_value":"BL57MAI6L2Y4","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BL57MAI6L2Y4PVE7","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BL57MAI6","created_at":"2026-05-18T12:33:12.712433+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/BL57MAI6L2Y4PVE7L2TC7FXR3V","json":"https://pith.science/pith/BL57MAI6L2Y4PVE7L2TC7FXR3V.json","graph_json":"https://pith.science/api/pith-number/BL57MAI6L2Y4PVE7L2TC7FXR3V/graph.json","events_json":"https://pith.science/api/pith-number/BL57MAI6L2Y4PVE7L2TC7FXR3V/events.json","paper":"https://pith.science/paper/BL57MAI6"},"agent_actions":{"view_html":"https://pith.science/pith/BL57MAI6L2Y4PVE7L2TC7FXR3V","download_json":"https://pith.science/pith/BL57MAI6L2Y4PVE7L2TC7FXR3V.json","view_paper":"https://pith.science/paper/BL57MAI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11092&json=true","fetch_graph":"https://pith.science/api/pith-number/BL57MAI6L2Y4PVE7L2TC7FXR3V/graph.json","fetch_events":"https://pith.science/api/pith-number/BL57MAI6L2Y4PVE7L2TC7FXR3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BL57MAI6L2Y4PVE7L2TC7FXR3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BL57MAI6L2Y4PVE7L2TC7FXR3V/action/storage_attestation","attest_author":"https://pith.science/pith/BL57MAI6L2Y4PVE7L2TC7FXR3V/action/author_attestation","sign_citation":"https://pith.science/pith/BL57MAI6L2Y4PVE7L2TC7FXR3V/action/citation_signature","submit_replication":"https://pith.science/pith/BL57MAI6L2Y4PVE7L2TC7FXR3V/action/replication_record"}},"created_at":"2026-05-17T23:45:02.965646+00:00","updated_at":"2026-05-17T23:45:02.965646+00:00"}