{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4NCJSGREHF2JA2GAUUCUYUG3LJ","short_pith_number":"pith:4NCJSGRE","schema_version":"1.0","canonical_sha256":"e344991a2439749068c0a5054c50db5a56af239a550168336590d396e1837ab4","source":{"kind":"arxiv","id":"1801.10578","version":1},"attestation_state":"computed","paper":{"title":"Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Cho-Jui Hsieh, Dong Su, Huan Zhang, Jinfeng Yi, Luca Daniel, Pin-Yu Chen, Tsui-Wei Weng, Yupeng Gao","submitted_at":"2018-01-31T17:51:32Z","abstract_excerpt":"The robustness of neural networks to adversarial examples has received great attention due to security implications. Despite various attack approaches to crafting visually imperceptible adversarial examples, little has been developed towards a comprehensive measure of robustness. In this paper, we provide a theoretical justification for converting robustness analysis into a local Lipschitz constant estimation problem, and propose to use the Extreme Value Theory for efficient evaluation. Our analysis yields a novel robustness metric called CLEVER, which is short for Cross Lipschitz Extreme Valu"},"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":"1801.10578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-01-31T17:51:32Z","cross_cats_sorted":["cs.CR","cs.LG"],"title_canon_sha256":"f24e8bb7b016dcc82d501fa1d2eca438151a35ca2b116372e02bb8c5db6f2eed","abstract_canon_sha256":"c3ca939fdf3bea3e0c0d74ec8e599a2fe68dbe94bdeac13e44c3c7fa929812ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:40.441911Z","signature_b64":"ws3t13erSxP2X2b69MHid4pSvVP6Bcp9CtR5zmm7ugxZwKBHq1fbNm9NivdSI6LUB97604O5cJMmYqqp+ZVHAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e344991a2439749068c0a5054c50db5a56af239a550168336590d396e1837ab4","last_reissued_at":"2026-05-18T00:24:40.441294Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:40.441294Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Cho-Jui Hsieh, Dong Su, Huan Zhang, Jinfeng Yi, Luca Daniel, Pin-Yu Chen, Tsui-Wei Weng, Yupeng Gao","submitted_at":"2018-01-31T17:51:32Z","abstract_excerpt":"The robustness of neural networks to adversarial examples has received great attention due to security implications. Despite various attack approaches to crafting visually imperceptible adversarial examples, little has been developed towards a comprehensive measure of robustness. In this paper, we provide a theoretical justification for converting robustness analysis into a local Lipschitz constant estimation problem, and propose to use the Extreme Value Theory for efficient evaluation. Our analysis yields a novel robustness metric called CLEVER, which is short for Cross Lipschitz Extreme Valu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.10578","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":"1801.10578","created_at":"2026-05-18T00:24:40.441403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.10578v1","created_at":"2026-05-18T00:24:40.441403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.10578","created_at":"2026-05-18T00:24:40.441403+00:00"},{"alias_kind":"pith_short_12","alias_value":"4NCJSGREHF2J","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4NCJSGREHF2JA2GA","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4NCJSGRE","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.16714","citing_title":"Experimental robustness benchmarking of quantum neural networks on a superconducting quantum processor","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2604.20704","citing_title":"Auto-ART: Structured Literature Synthesis and Automated Adversarial Robustness Testing","ref_index":58,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4NCJSGREHF2JA2GAUUCUYUG3LJ","json":"https://pith.science/pith/4NCJSGREHF2JA2GAUUCUYUG3LJ.json","graph_json":"https://pith.science/api/pith-number/4NCJSGREHF2JA2GAUUCUYUG3LJ/graph.json","events_json":"https://pith.science/api/pith-number/4NCJSGREHF2JA2GAUUCUYUG3LJ/events.json","paper":"https://pith.science/paper/4NCJSGRE"},"agent_actions":{"view_html":"https://pith.science/pith/4NCJSGREHF2JA2GAUUCUYUG3LJ","download_json":"https://pith.science/pith/4NCJSGREHF2JA2GAUUCUYUG3LJ.json","view_paper":"https://pith.science/paper/4NCJSGRE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.10578&json=true","fetch_graph":"https://pith.science/api/pith-number/4NCJSGREHF2JA2GAUUCUYUG3LJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4NCJSGREHF2JA2GAUUCUYUG3LJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4NCJSGREHF2JA2GAUUCUYUG3LJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4NCJSGREHF2JA2GAUUCUYUG3LJ/action/storage_attestation","attest_author":"https://pith.science/pith/4NCJSGREHF2JA2GAUUCUYUG3LJ/action/author_attestation","sign_citation":"https://pith.science/pith/4NCJSGREHF2JA2GAUUCUYUG3LJ/action/citation_signature","submit_replication":"https://pith.science/pith/4NCJSGREHF2JA2GAUUCUYUG3LJ/action/replication_record"}},"created_at":"2026-05-18T00:24:40.441403+00:00","updated_at":"2026-05-18T00:24:40.441403+00:00"}