{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:3K6A2LI2QJG6DK5F6J4B6HFUKR","short_pith_number":"pith:3K6A2LI2","schema_version":"1.0","canonical_sha256":"dabc0d2d1a824de1aba5f2781f1cb4546f6a06789f725288288097aabae1929c","source":{"kind":"arxiv","id":"2006.00442","version":2},"attestation_state":"computed","paper":{"title":"Evaluations and Methods for Explanation through Robustness Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cheng-Yu Hsieh, Chih-Kuan Yeh, Cho-Jui Hsieh, Pradeep Ravikumar, Sanjiv Kumar, Seungyeon Kim, Xuanqing Liu","submitted_at":"2020-05-31T05:52:05Z","abstract_excerpt":"Feature based explanations, that provide importance of each feature towards the model prediction, is arguably one of the most intuitive ways to explain a model. In this paper, we establish a novel set of evaluation criteria for such feature based explanations by robustness analysis. In contrast to existing evaluations which require us to specify some way to \"remove\" features that could inevitably introduces biases and artifacts, we make use of the subtler notion of smaller adversarial perturbations. By optimizing towards our proposed evaluation criteria, we obtain new explanations that are loo"},"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":"2006.00442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-31T05:52:05Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"357fa9de1514295f0d5326042365cfa6169d2a3704869b28b3b1e334b4238298","abstract_canon_sha256":"e1a60b2478f8833e70453a8e8637d4cfc7bfa1b0cf75612d1bcb8c23aed0e23d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:28.716412Z","signature_b64":"WaQYywdkP1EPPfZRlnv/0MRXkMENPbD+pO9JiBwDcE5xCw8BM9ctNxVPO0cUoXsCWTSOvtWh1V2kuADWDKPbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dabc0d2d1a824de1aba5f2781f1cb4546f6a06789f725288288097aabae1929c","last_reissued_at":"2026-07-05T02:30:28.715845Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:28.715845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluations and Methods for Explanation through Robustness Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Cheng-Yu Hsieh, Chih-Kuan Yeh, Cho-Jui Hsieh, Pradeep Ravikumar, Sanjiv Kumar, Seungyeon Kim, Xuanqing Liu","submitted_at":"2020-05-31T05:52:05Z","abstract_excerpt":"Feature based explanations, that provide importance of each feature towards the model prediction, is arguably one of the most intuitive ways to explain a model. In this paper, we establish a novel set of evaluation criteria for such feature based explanations by robustness analysis. In contrast to existing evaluations which require us to specify some way to \"remove\" features that could inevitably introduces biases and artifacts, we make use of the subtler notion of smaller adversarial perturbations. By optimizing towards our proposed evaluation criteria, we obtain new explanations that are loo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.00442","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/2006.00442/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":"2006.00442","created_at":"2026-07-05T02:30:28.715933+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.00442v2","created_at":"2026-07-05T02:30:28.715933+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.00442","created_at":"2026-07-05T02:30:28.715933+00:00"},{"alias_kind":"pith_short_12","alias_value":"3K6A2LI2QJG6","created_at":"2026-07-05T02:30:28.715933+00:00"},{"alias_kind":"pith_short_16","alias_value":"3K6A2LI2QJG6DK5F","created_at":"2026-07-05T02:30:28.715933+00:00"},{"alias_kind":"pith_short_8","alias_value":"3K6A2LI2","created_at":"2026-07-05T02:30:28.715933+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.16905","citing_title":"AIM: Adversarial Information Masking for Faithfulness Evaluation of Saliency Maps","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2605.15328","citing_title":"From Weight Perturbation to Feature Attribution for Explaining Fully Connected Neural Networks","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3K6A2LI2QJG6DK5F6J4B6HFUKR","json":"https://pith.science/pith/3K6A2LI2QJG6DK5F6J4B6HFUKR.json","graph_json":"https://pith.science/api/pith-number/3K6A2LI2QJG6DK5F6J4B6HFUKR/graph.json","events_json":"https://pith.science/api/pith-number/3K6A2LI2QJG6DK5F6J4B6HFUKR/events.json","paper":"https://pith.science/paper/3K6A2LI2"},"agent_actions":{"view_html":"https://pith.science/pith/3K6A2LI2QJG6DK5F6J4B6HFUKR","download_json":"https://pith.science/pith/3K6A2LI2QJG6DK5F6J4B6HFUKR.json","view_paper":"https://pith.science/paper/3K6A2LI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.00442&json=true","fetch_graph":"https://pith.science/api/pith-number/3K6A2LI2QJG6DK5F6J4B6HFUKR/graph.json","fetch_events":"https://pith.science/api/pith-number/3K6A2LI2QJG6DK5F6J4B6HFUKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3K6A2LI2QJG6DK5F6J4B6HFUKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3K6A2LI2QJG6DK5F6J4B6HFUKR/action/storage_attestation","attest_author":"https://pith.science/pith/3K6A2LI2QJG6DK5F6J4B6HFUKR/action/author_attestation","sign_citation":"https://pith.science/pith/3K6A2LI2QJG6DK5F6J4B6HFUKR/action/citation_signature","submit_replication":"https://pith.science/pith/3K6A2LI2QJG6DK5F6J4B6HFUKR/action/replication_record"}},"created_at":"2026-07-05T02:30:28.715933+00:00","updated_at":"2026-07-05T02:30:28.715933+00:00"}