{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JOCEFCRDLCE2MGUIFRHCHLBJW7","short_pith_number":"pith:JOCEFCRD","schema_version":"1.0","canonical_sha256":"4b84428a235889a61a882c4e23ac29b7f616d62aff1a1fc2967dc0132e0be478","source":{"kind":"arxiv","id":"2002.10097","version":4},"attestation_state":"computed","paper":{"title":"Towards Rapid and Robust Adversarial Training with One-Step Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bj\\\"orn Eskofier, Leo Schwinn, Ren\\'e Raab","submitted_at":"2020-02-24T07:28:43Z","abstract_excerpt":"Adversarial training is the most successful empirical method for increasing the robustness of neural networks against adversarial attacks. However, the most effective approaches, like training with Projected Gradient Descent (PGD) are accompanied by high computational complexity. In this paper, we present two ideas that, in combination, enable adversarial training with the computationally less expensive Fast Gradient Sign Method (FGSM). First, we add uniform noise to the initial data point of the FGSM attack, which creates a wider variety of adversaries, thus prohibiting overfitting to one par"},"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.10097","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-24T07:28:43Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cc73d88bc68ba1adc8fff830b91ad1be1b638be329f978b89b586a1786526feb","abstract_canon_sha256":"339c2b166043ab2888fd0741d934fddde55b1b4bc5f36a5f658b77005c0fac1b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:48:24.548140Z","signature_b64":"lTa7ViR1LtLon0f8es9ri5MJkOcKJZipWOoHoAt+HDByrepXjdnbWD+LyYPNnLbKVeN/6OK1lgoXZw7R14YvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b84428a235889a61a882c4e23ac29b7f616d62aff1a1fc2967dc0132e0be478","last_reissued_at":"2026-07-05T00:48:24.547627Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:48:24.547627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Rapid and Robust Adversarial Training with One-Step Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bj\\\"orn Eskofier, Leo Schwinn, Ren\\'e Raab","submitted_at":"2020-02-24T07:28:43Z","abstract_excerpt":"Adversarial training is the most successful empirical method for increasing the robustness of neural networks against adversarial attacks. However, the most effective approaches, like training with Projected Gradient Descent (PGD) are accompanied by high computational complexity. In this paper, we present two ideas that, in combination, enable adversarial training with the computationally less expensive Fast Gradient Sign Method (FGSM). First, we add uniform noise to the initial data point of the FGSM attack, which creates a wider variety of adversaries, thus prohibiting overfitting to one par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.10097","kind":"arxiv","version":4},"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.10097/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.10097","created_at":"2026-07-05T00:48:24.547690+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.10097v4","created_at":"2026-07-05T00:48:24.547690+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.10097","created_at":"2026-07-05T00:48:24.547690+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOCEFCRDLCE2","created_at":"2026-07-05T00:48:24.547690+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOCEFCRDLCE2MGUI","created_at":"2026-07-05T00:48:24.547690+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOCEFCRD","created_at":"2026-07-05T00:48:24.547690+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.00738","citing_title":"SORA: Free Second-Order Attacks in Fast Adversarial Training","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JOCEFCRDLCE2MGUIFRHCHLBJW7","json":"https://pith.science/pith/JOCEFCRDLCE2MGUIFRHCHLBJW7.json","graph_json":"https://pith.science/api/pith-number/JOCEFCRDLCE2MGUIFRHCHLBJW7/graph.json","events_json":"https://pith.science/api/pith-number/JOCEFCRDLCE2MGUIFRHCHLBJW7/events.json","paper":"https://pith.science/paper/JOCEFCRD"},"agent_actions":{"view_html":"https://pith.science/pith/JOCEFCRDLCE2MGUIFRHCHLBJW7","download_json":"https://pith.science/pith/JOCEFCRDLCE2MGUIFRHCHLBJW7.json","view_paper":"https://pith.science/paper/JOCEFCRD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.10097&json=true","fetch_graph":"https://pith.science/api/pith-number/JOCEFCRDLCE2MGUIFRHCHLBJW7/graph.json","fetch_events":"https://pith.science/api/pith-number/JOCEFCRDLCE2MGUIFRHCHLBJW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOCEFCRDLCE2MGUIFRHCHLBJW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOCEFCRDLCE2MGUIFRHCHLBJW7/action/storage_attestation","attest_author":"https://pith.science/pith/JOCEFCRDLCE2MGUIFRHCHLBJW7/action/author_attestation","sign_citation":"https://pith.science/pith/JOCEFCRDLCE2MGUIFRHCHLBJW7/action/citation_signature","submit_replication":"https://pith.science/pith/JOCEFCRDLCE2MGUIFRHCHLBJW7/action/replication_record"}},"created_at":"2026-07-05T00:48:24.547690+00:00","updated_at":"2026-07-05T00:48:24.547690+00:00"}