{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3UU57XRS7PHXYJSEMSIUZ2W7LR","short_pith_number":"pith:3UU57XRS","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"},"canonical_sha256":"dd29dfde32fbcf7c264464914ceadf5c61c32ba3a1623c92c24ac0e83cf5f678","source":{"kind":"arxiv","id":"1905.09163","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09163","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09163v2","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09163","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"3UU57XRS7PHX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3UU57XRS7PHXYJSE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3UU57XRS","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3UU57XRS7PHXYJSEMSIUZ2W7LR","target":"record","payload":{"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"},"canonical_sha256":"dd29dfde32fbcf7c264464914ceadf5c61c32ba3a1623c92c24ac0e83cf5f678","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"},"source_kind":"arxiv","source_id":"1905.09163","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-05-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GcF+itD8pVDZdv+whwfBfYIFFHy1UPdZXuYv5jn2YvVRfTsEQHallEc9m5xjwVcchADng/HTn85MVbAWZ7xAAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T01:59:14.427399Z"},"content_sha256":"28be258fb26ab34689b60827b333b46e7bfaa7bb3a67e68c2759f19f0e2ccd81","schema_version":"1.0","event_id":"sha256:28be258fb26ab34689b60827b333b46e7bfaa7bb3a67e68c2759f19f0e2ccd81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3UU57XRS7PHXYJSEMSIUZ2W7LR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+zYKwBAdettFcqAyrD1f+SF/ddeDOD8jn8wyrts9+4qOi/zfdQHcwkc8eiaAidhSfhcNHdcdo2vINy10YN1dBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T01:59:14.427745Z"},"content_sha256":"209230d07ab8f6e8a561500553a92c60d483eee5851e1b9ab0c6e52322682fb1","schema_version":"1.0","event_id":"sha256:209230d07ab8f6e8a561500553a92c60d483eee5851e1b9ab0c6e52322682fb1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/bundle.json","state_url":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/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-29T01:59:14Z","links":{"resolver":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR","bundle":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/bundle.json","state":"https://pith.science/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3UU57XRS7PHXYJSEMSIUZ2W7LR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3UU57XRS7PHXYJSEMSIUZ2W7LR","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":"28dfb778ebe5514bd469af91a232a5d607436a96e2bdde8b590ae9af45601ca8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-22T14:20:54Z","title_canon_sha256":"43f060bfc295678a7d73a62d68ddd2144872cfdf8841028a28b0a0bc992db608"},"schema_version":"1.0","source":{"id":"1905.09163","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.09163","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"arxiv_version","alias_value":"1905.09163v2","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.09163","created_at":"2026-05-17T23:43:08Z"},{"alias_kind":"pith_short_12","alias_value":"3UU57XRS7PHX","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3UU57XRS7PHXYJSE","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3UU57XRS","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:209230d07ab8f6e8a561500553a92c60d483eee5851e1b9ab0c6e52322682fb1","target":"graph","created_at":"2026-05-17T23:43:08Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gitta Kutyniok, Jan Macdonald, Sascha Hauch, Stephan W\\\"aldchen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-22T14:20:54Z","title":"The Computational Complexity of Understanding Network Decisions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.09163","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:28be258fb26ab34689b60827b333b46e7bfaa7bb3a67e68c2759f19f0e2ccd81","target":"record","created_at":"2026-05-17T23:43:08Z","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":"28dfb778ebe5514bd469af91a232a5d607436a96e2bdde8b590ae9af45601ca8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-05-22T14:20:54Z","title_canon_sha256":"43f060bfc295678a7d73a62d68ddd2144872cfdf8841028a28b0a0bc992db608"},"schema_version":"1.0","source":{"id":"1905.09163","kind":"arxiv","version":2}},"canonical_sha256":"dd29dfde32fbcf7c264464914ceadf5c61c32ba3a1623c92c24ac0e83cf5f678","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd29dfde32fbcf7c264464914ceadf5c61c32ba3a1623c92c24ac0e83cf5f678","first_computed_at":"2026-05-17T23:43:08.817010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:08.817010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b0vR21E1skjP0B31P/mcwN5x3oVVh7O+7EypBg41pRIPZ31G5duaUzrjxi36vbu1ZdRjzG3qzWjRKILrF26yBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:08.817533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.09163","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28be258fb26ab34689b60827b333b46e7bfaa7bb3a67e68c2759f19f0e2ccd81","sha256:209230d07ab8f6e8a561500553a92c60d483eee5851e1b9ab0c6e52322682fb1"],"state_sha256":"7b8b59d8018d442e797bff0ff6e2bfe9c96d6442f7230aa14303f523af5baad4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/ocSVAy8xIhVdbmdpcTpg2WKQZs/O9XobUMc4xal76U0okgvPFI49i3gyrvBFFfuH4Di7W0WmXyjMxNU+sK8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T01:59:14.429673Z","bundle_sha256":"f451870803b7635e1fef3511428039193e3f128dbf9f71bcdf7f112449a6e69c"}}