{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3UU57XRS7PHXYJSEMSIUZ2W7LR","short_pith_number":"pith:3UU57XRS","schema_version":"1.0","canonical_sha256":"dd29dfde32fbcf7c264464914ceadf5c61c32ba3a1623c92c24ac0e83cf5f678","source":{"kind":"arxiv","id":"1905.09163","version":2},"attestation_state":"computed","paper":{"title":"The Computational Complexity of Understanding Network Decisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gitta Kutyniok, Jan Macdonald, Sascha Hauch, Stephan W\\\"aldchen","submitted_at":"2019-05-22T14:20:54Z","abstract_excerpt":"For a Boolean function $\\Phi\\colon\\{0,1\\}^d\\to\\{0,1\\}$ and an assignment to its variables $\\mathbf{x}=(x_1, x_2, \\dots, x_d)$ we consider the problem of finding the subsets of the variables that are sufficient to determine the function value with a given probability $\\delta$. This is motivated by the task of interpreting predictions of binary classifiers described as Boolean circuits (which can be seen as special cases of neural networks). We show that the problem of deciding whether such subsets of relevant variables of limited size $k\\leq d$ exist is complete for the complexity class $\\maths"},"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.09163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-22T14:20:54Z","cross_cats_sorted":[],"title_canon_sha256":"43f060bfc295678a7d73a62d68ddd2144872cfdf8841028a28b0a0bc992db608","abstract_canon_sha256":"28dfb778ebe5514bd469af91a232a5d607436a96e2bdde8b590ae9af45601ca8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:08.817533Z","signature_b64":"b0vR21E1skjP0B31P/mcwN5x3oVVh7O+7EypBg41pRIPZ31G5duaUzrjxi36vbu1ZdRjzG3qzWjRKILrF26yBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd29dfde32fbcf7c264464914ceadf5c61c32ba3a1623c92c24ac0e83cf5f678","last_reissued_at":"2026-05-17T23:43:08.817010Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:08.817010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Computational Complexity of Understanding Network Decisions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gitta Kutyniok, Jan Macdonald, Sascha Hauch, Stephan W\\\"aldchen","submitted_at":"2019-05-22T14:20:54Z","abstract_excerpt":"For a Boolean function $\\Phi\\colon\\{0,1\\}^d\\to\\{0,1\\}$ and an assignment to its variables $\\mathbf{x}=(x_1, x_2, \\dots, x_d)$ we consider the problem of finding the subsets of the variables that are sufficient to determine the function value with a given probability $\\delta$. This is motivated by the task of interpreting predictions of binary classifiers described as Boolean circuits (which can be seen as special cases of neural networks). We show that the problem of deciding whether such subsets of relevant variables of limited size $k\\leq d$ exist is complete for the complexity class $\\maths"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09163","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":""},"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.09163","created_at":"2026-05-17T23:43:08.817094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.09163v2","created_at":"2026-05-17T23:43:08.817094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09163","created_at":"2026-05-17T23:43:08.817094+00:00"},{"alias_kind":"pith_short_12","alias_value":"3UU57XRS7PHX","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3UU57XRS7PHXYJSE","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3UU57XRS","created_at":"2026-05-18T12:33:10.108867+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/3UU57XRS7PHXYJSEMSIUZ2W7LR","json":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR.json","graph_json":"https://pith.science/api/pith-number/3UU57XRS7PHXYJSEMSIUZ2W7LR/graph.json","events_json":"https://pith.science/api/pith-number/3UU57XRS7PHXYJSEMSIUZ2W7LR/events.json","paper":"https://pith.science/paper/3UU57XRS"},"agent_actions":{"view_html":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR","download_json":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR.json","view_paper":"https://pith.science/paper/3UU57XRS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.09163&json=true","fetch_graph":"https://pith.science/api/pith-number/3UU57XRS7PHXYJSEMSIUZ2W7LR/graph.json","fetch_events":"https://pith.science/api/pith-number/3UU57XRS7PHXYJSEMSIUZ2W7LR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/action/storage_attestation","attest_author":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/action/author_attestation","sign_citation":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/action/citation_signature","submit_replication":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/action/replication_record"}},"created_at":"2026-05-17T23:43:08.817094+00:00","updated_at":"2026-05-17T23:43:08.817094+00:00"}