{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:53GEV3CQ7TXXQEHVT5UWBW4FEK","short_pith_number":"pith:53GEV3CQ","schema_version":"1.0","canonical_sha256":"eecc4aec50fcef7810f59f6960db8522acd1ed018a91d7818daa657967e9ce85","source":{"kind":"arxiv","id":"2002.03339","version":2},"attestation_state":"computed","paper":{"title":"Input Validation for Neural Networks via Runtime Local Robustness Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Antoine Mine, Jiangchao Liu, Ji Wang, Liqian Chen","submitted_at":"2020-02-09T10:24:29Z","abstract_excerpt":"Local robustness verification can verify that a neural network is robust wrt. any perturbation to a specific input within a certain distance. We call this distance Robustness Radius. We observe that the robustness radii of correctly classified inputs are much larger than that of misclassified inputs which include adversarial examples, especially those from strong adversarial attacks. Another observation is that the robustness radii of correctly classified inputs often follow a normal distribution. Based on these two observations, we propose to validate inputs for neural networks via runtime lo"},"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":"2002.03339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-09T10:24:29Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ec8cd80915108795d2e7bf360cdefe1c5a8ec105dfe7e888ac7929ba77f5248d","abstract_canon_sha256":"3c7d056290bdc46d62152837a9724f59f76b70b55d741959ca00135b212e3528"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:44:14.904055Z","signature_b64":"mZljdNs6t9SURaeFvtFtTItU+YlY6w035GGm3WGDwvHIrYLWOlhrxuzM4TEnKjlbCZCtz6WUkA3lXz1LhRgJAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eecc4aec50fcef7810f59f6960db8522acd1ed018a91d7818daa657967e9ce85","last_reissued_at":"2026-07-05T07:44:14.903512Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:44:14.903512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Input Validation for Neural Networks via Runtime Local Robustness Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Antoine Mine, Jiangchao Liu, Ji Wang, Liqian Chen","submitted_at":"2020-02-09T10:24:29Z","abstract_excerpt":"Local robustness verification can verify that a neural network is robust wrt. any perturbation to a specific input within a certain distance. We call this distance Robustness Radius. We observe that the robustness radii of correctly classified inputs are much larger than that of misclassified inputs which include adversarial examples, especially those from strong adversarial attacks. Another observation is that the robustness radii of correctly classified inputs often follow a normal distribution. Based on these two observations, we propose to validate inputs for neural networks via runtime lo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03339","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/2002.03339/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":"2002.03339","created_at":"2026-07-05T07:44:14.903569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.03339v2","created_at":"2026-07-05T07:44:14.903569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03339","created_at":"2026-07-05T07:44:14.903569+00:00"},{"alias_kind":"pith_short_12","alias_value":"53GEV3CQ7TXX","created_at":"2026-07-05T07:44:14.903569+00:00"},{"alias_kind":"pith_short_16","alias_value":"53GEV3CQ7TXXQEHV","created_at":"2026-07-05T07:44:14.903569+00:00"},{"alias_kind":"pith_short_8","alias_value":"53GEV3CQ","created_at":"2026-07-05T07:44:14.903569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.09377","citing_title":"Scaling Neural Network Verification with Tensor Parallelism and Fully Sharded Data Parallelism","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/53GEV3CQ7TXXQEHVT5UWBW4FEK","json":"https://pith.science/pith/53GEV3CQ7TXXQEHVT5UWBW4FEK.json","graph_json":"https://pith.science/api/pith-number/53GEV3CQ7TXXQEHVT5UWBW4FEK/graph.json","events_json":"https://pith.science/api/pith-number/53GEV3CQ7TXXQEHVT5UWBW4FEK/events.json","paper":"https://pith.science/paper/53GEV3CQ"},"agent_actions":{"view_html":"https://pith.science/pith/53GEV3CQ7TXXQEHVT5UWBW4FEK","download_json":"https://pith.science/pith/53GEV3CQ7TXXQEHVT5UWBW4FEK.json","view_paper":"https://pith.science/paper/53GEV3CQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.03339&json=true","fetch_graph":"https://pith.science/api/pith-number/53GEV3CQ7TXXQEHVT5UWBW4FEK/graph.json","fetch_events":"https://pith.science/api/pith-number/53GEV3CQ7TXXQEHVT5UWBW4FEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53GEV3CQ7TXXQEHVT5UWBW4FEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53GEV3CQ7TXXQEHVT5UWBW4FEK/action/storage_attestation","attest_author":"https://pith.science/pith/53GEV3CQ7TXXQEHVT5UWBW4FEK/action/author_attestation","sign_citation":"https://pith.science/pith/53GEV3CQ7TXXQEHVT5UWBW4FEK/action/citation_signature","submit_replication":"https://pith.science/pith/53GEV3CQ7TXXQEHVT5UWBW4FEK/action/replication_record"}},"created_at":"2026-07-05T07:44:14.903569+00:00","updated_at":"2026-07-05T07:44:14.903569+00:00"}