{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KQCORWKNFINP6R2OORU2LXH5JA","short_pith_number":"pith:KQCORWKN","schema_version":"1.0","canonical_sha256":"5404e8d94d2a1aff474e7469a5dcfd481fe464e8f991b16e1725d44bf70b8bec","source":{"kind":"arxiv","id":"1911.06876","version":1},"attestation_state":"computed","paper":{"title":"Explanatory Masks for Neural Network Interpretability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Garrett Goh, Lawrence Phillips, Nathan Hodas","submitted_at":"2019-11-15T21:10:50Z","abstract_excerpt":"Neural network interpretability is a vital component for applications across a wide variety of domains. In such cases it is often useful to analyze a network which has already been trained for its specific purpose. In this work, we develop a method to produce explanation masks for pre-trained networks. The mask localizes the most important aspects of each input for prediction of the original network. Masks are created by a secondary network whose goal is to create as small an explanation as possible while still preserving the predictive accuracy of the original network. We demonstrate the appl"},"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":"1911.06876","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-15T21:10:50Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"c8db0ab376a7f341e1100316fab9ada48b1ad9ea888f249f332fb74e398cfd58","abstract_canon_sha256":"35f253fda6b56fa5246a4c52d1c065f298dcb72ddfa882f24e5b648e9430993b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:19:40.238211Z","signature_b64":"LY+tz4JqqcA6gw+InbSBmABv1rqnyAFhzrLsplN4Z8+hZNZVghVkBTZlqlMClxe+Mv9YN3/OCAvkTzDWd0upCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5404e8d94d2a1aff474e7469a5dcfd481fe464e8f991b16e1725d44bf70b8bec","last_reissued_at":"2026-07-05T00:19:40.237758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:19:40.237758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Explanatory Masks for Neural Network Interpretability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Garrett Goh, Lawrence Phillips, Nathan Hodas","submitted_at":"2019-11-15T21:10:50Z","abstract_excerpt":"Neural network interpretability is a vital component for applications across a wide variety of domains. In such cases it is often useful to analyze a network which has already been trained for its specific purpose. In this work, we develop a method to produce explanation masks for pre-trained networks. The mask localizes the most important aspects of each input for prediction of the original network. Masks are created by a secondary network whose goal is to create as small an explanation as possible while still preserving the predictive accuracy of the original network. We demonstrate the appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.06876","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.06876/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":"1911.06876","created_at":"2026-07-05T00:19:40.237829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.06876v1","created_at":"2026-07-05T00:19:40.237829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.06876","created_at":"2026-07-05T00:19:40.237829+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQCORWKNFINP","created_at":"2026-07-05T00:19:40.237829+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQCORWKNFINP6R2O","created_at":"2026-07-05T00:19:40.237829+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQCORWKN","created_at":"2026-07-05T00:19:40.237829+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.14926","citing_title":"Interpretability in Parameter Space: Minimizing Mechanistic Description Length with Attribution-based Parameter Decomposition","ref_index":77,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KQCORWKNFINP6R2OORU2LXH5JA","json":"https://pith.science/pith/KQCORWKNFINP6R2OORU2LXH5JA.json","graph_json":"https://pith.science/api/pith-number/KQCORWKNFINP6R2OORU2LXH5JA/graph.json","events_json":"https://pith.science/api/pith-number/KQCORWKNFINP6R2OORU2LXH5JA/events.json","paper":"https://pith.science/paper/KQCORWKN"},"agent_actions":{"view_html":"https://pith.science/pith/KQCORWKNFINP6R2OORU2LXH5JA","download_json":"https://pith.science/pith/KQCORWKNFINP6R2OORU2LXH5JA.json","view_paper":"https://pith.science/paper/KQCORWKN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.06876&json=true","fetch_graph":"https://pith.science/api/pith-number/KQCORWKNFINP6R2OORU2LXH5JA/graph.json","fetch_events":"https://pith.science/api/pith-number/KQCORWKNFINP6R2OORU2LXH5JA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQCORWKNFINP6R2OORU2LXH5JA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQCORWKNFINP6R2OORU2LXH5JA/action/storage_attestation","attest_author":"https://pith.science/pith/KQCORWKNFINP6R2OORU2LXH5JA/action/author_attestation","sign_citation":"https://pith.science/pith/KQCORWKNFINP6R2OORU2LXH5JA/action/citation_signature","submit_replication":"https://pith.science/pith/KQCORWKNFINP6R2OORU2LXH5JA/action/replication_record"}},"created_at":"2026-07-05T00:19:40.237829+00:00","updated_at":"2026-07-05T00:19:40.237829+00:00"}