{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:Q2YEQM3LPDUDV5OFGYJ5QOMUY2","short_pith_number":"pith:Q2YEQM3L","schema_version":"1.0","canonical_sha256":"86b048336b78e83af5c53613d83994c69e4ec110110e525a3f26f217ffe4b41d","source":{"kind":"arxiv","id":"2010.09670","version":3},"attestation_state":"computed","paper":{"title":"RobustBench: a standardized adversarial robustness benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Edoardo Debenedetti, Francesco Croce, Maksym Andriushchenko, Matthias Hein, Mung Chiang, Nicolas Flammarion, Prateek Mittal, Vikash Sehwag","submitted_at":"2020-10-19T17:06:18Z","abstract_excerpt":"As a research community, we are still lacking a systematic understanding of the progress on adversarial robustness which often makes it hard to identify the most promising ideas in training robust models. A key challenge in benchmarking robustness is that its evaluation is often error-prone leading to robustness overestimation. Our goal is to establish a standardized benchmark of adversarial robustness, which as accurately as possible reflects the robustness of the considered models within a reasonable computational budget. To this end, we start by considering the image classification task and"},"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":"2010.09670","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-10-19T17:06:18Z","cross_cats_sorted":["cs.CR","cs.CV","stat.ML"],"title_canon_sha256":"860d2a95dae6aee772c1561fab24e971790447a2d5c8daed87d8ca4454bcee29","abstract_canon_sha256":"3150d6a44f006b06b6d0bca6d92e118591ece51ad041c6ca6261aa7e2cd4c8c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:27:26.773260Z","signature_b64":"yTWTtsbUmtMimv6ezMluu97GA+P8HcDV5cevcLC2HU/prkOfc/N4Ne3ETXHdV/KtlMZ04NYEzc7ABuzLCrejAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86b048336b78e83af5c53613d83994c69e4ec110110e525a3f26f217ffe4b41d","last_reissued_at":"2026-07-05T03:27:26.772804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:27:26.772804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RobustBench: a standardized adversarial robustness benchmark","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Edoardo Debenedetti, Francesco Croce, Maksym Andriushchenko, Matthias Hein, Mung Chiang, Nicolas Flammarion, Prateek Mittal, Vikash Sehwag","submitted_at":"2020-10-19T17:06:18Z","abstract_excerpt":"As a research community, we are still lacking a systematic understanding of the progress on adversarial robustness which often makes it hard to identify the most promising ideas in training robust models. A key challenge in benchmarking robustness is that its evaluation is often error-prone leading to robustness overestimation. Our goal is to establish a standardized benchmark of adversarial robustness, which as accurately as possible reflects the robustness of the considered models within a reasonable computational budget. To this end, we start by considering the image classification task and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09670","kind":"arxiv","version":3},"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/2010.09670/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":"2010.09670","created_at":"2026-07-05T03:27:26.772861+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.09670v3","created_at":"2026-07-05T03:27:26.772861+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09670","created_at":"2026-07-05T03:27:26.772861+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2YEQM3LPDUD","created_at":"2026-07-05T03:27:26.772861+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2YEQM3LPDUDV5OF","created_at":"2026-07-05T03:27:26.772861+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2YEQM3L","created_at":"2026-07-05T03:27:26.772861+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":18,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.02267","citing_title":"A combination of noise and bilateral filters achieve supralinear and scalable adversarial robustness in CNNs","ref_index":14,"is_internal_anchor":false},{"citing_arxiv_id":"2606.01746","citing_title":"Sensitivity as a Double-Edged Sword: A Trade-off Between Discriminability and Adversarial Robustness","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2606.29867","citing_title":"RoAd-RL: A Unified Library and Benchmark for Robust Adversarial Reinforcement Learning","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2606.09881","citing_title":"Toward Calibrated, Fair, and accurate Deepfake Detection","ref_index":277,"is_internal_anchor":false},{"citing_arxiv_id":"2309.10348","citing_title":"Language Guided Adversarial Purification","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2503.02574","citing_title":"LLM-Safety Evaluations Lack Robustness","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2505.19607","citing_title":"Contrastive Residual Energy Test-time Adaptation","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2507.01955","citing_title":"How Well Does GPT-4o Understand Vision? Evaluating Multimodal Foundation Models on Standard Computer Vision Tasks","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2109.13916","citing_title":"Unsolved Problems in ML Safety","ref_index":41,"is_internal_anchor":false},{"citing_arxiv_id":"2310.03684","citing_title":"SmoothLLM: Defending Large Language Models Against Jailbreaking Attacks","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2605.09075","citing_title":"Optimality of Sub-network Laplace Approximations: New Results and Methods","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24661","citing_title":"Agent-Centric Observation Adaptation for Robust Visual Control under Dynamic Perturbations","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02109","citing_title":"Detecting Adversarial Data via Provable Adversarial Noise Amplification","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11590","citing_title":"Learning Robustness at Test-Time from a Non-Robust Teacher","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08404","citing_title":"Adversarial Label Invariant Graph Data Augmentations for Out-of-Distribution Generalization","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06954","citing_title":"Compression as an Adversarial Amplifier Through Decision Space Reduction","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24661","citing_title":"Agent-Centric Observation Adaptation for Robust Visual Control under Dynamic Perturbations","ref_index":5,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16532","citing_title":"Beyond Attack Success Rate: A Multi-Metric Evaluation of Adversarial Transferability in Medical Imaging Models","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q2YEQM3LPDUDV5OFGYJ5QOMUY2","json":"https://pith.science/pith/Q2YEQM3LPDUDV5OFGYJ5QOMUY2.json","graph_json":"https://pith.science/api/pith-number/Q2YEQM3LPDUDV5OFGYJ5QOMUY2/graph.json","events_json":"https://pith.science/api/pith-number/Q2YEQM3LPDUDV5OFGYJ5QOMUY2/events.json","paper":"https://pith.science/paper/Q2YEQM3L"},"agent_actions":{"view_html":"https://pith.science/pith/Q2YEQM3LPDUDV5OFGYJ5QOMUY2","download_json":"https://pith.science/pith/Q2YEQM3LPDUDV5OFGYJ5QOMUY2.json","view_paper":"https://pith.science/paper/Q2YEQM3L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.09670&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2YEQM3LPDUDV5OFGYJ5QOMUY2/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2YEQM3LPDUDV5OFGYJ5QOMUY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2YEQM3LPDUDV5OFGYJ5QOMUY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2YEQM3LPDUDV5OFGYJ5QOMUY2/action/storage_attestation","attest_author":"https://pith.science/pith/Q2YEQM3LPDUDV5OFGYJ5QOMUY2/action/author_attestation","sign_citation":"https://pith.science/pith/Q2YEQM3LPDUDV5OFGYJ5QOMUY2/action/citation_signature","submit_replication":"https://pith.science/pith/Q2YEQM3LPDUDV5OFGYJ5QOMUY2/action/replication_record"}},"created_at":"2026-07-05T03:27:26.772861+00:00","updated_at":"2026-07-05T03:27:26.772861+00:00"}