{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:KBZKJI6LLY6VDST7WIC2OGW5BT","short_pith_number":"pith:KBZKJI6L","schema_version":"1.0","canonical_sha256":"5072a4a3cb5e3d51ca7fb205a71add0cfd88498a92f99b7a057eeea48e14b745","source":{"kind":"arxiv","id":"2302.12366","version":2},"attestation_state":"computed","paper":{"title":"Less is More: Data Pruning for Faster Adversarial Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Bhavya Kailkhura, Pu Zhao, Ryan Goldhahn, Xue Lin, Yize Li","submitted_at":"2023-02-23T23:48:20Z","abstract_excerpt":"Deep neural networks (DNNs) are sensitive to adversarial examples, resulting in fragile and unreliable performance in the real world. Although adversarial training (AT) is currently one of the most effective methodologies to robustify DNNs, it is computationally very expensive (e.g., 5-10X costlier than standard training). To address this challenge, existing approaches focus on single-step AT, referred to as Fast AT, reducing the overhead of adversarial example generation. Unfortunately, these approaches are known to fail against stronger adversaries. To make AT computationally efficient witho"},"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":"2302.12366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-23T23:48:20Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"8fbd313de2ebb12f572722e0b2e60638c31211574dd602f9f72ca48430de6cd9","abstract_canon_sha256":"4529101508cc88104a89b301b752a01ab104f007d7aa6823624ca98a34a59653"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:46:39.401749Z","signature_b64":"o5FtGCuPohQiiBugcEuKQ7i+sbfb6ACnNbDCve1jXLv1KeyVClPxfldOJFkMMpd7R7D06uVQI1mYSGPNRnYRBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5072a4a3cb5e3d51ca7fb205a71add0cfd88498a92f99b7a057eeea48e14b745","last_reissued_at":"2026-07-05T05:46:39.401244Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:46:39.401244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Less is More: Data Pruning for Faster Adversarial Training","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Bhavya Kailkhura, Pu Zhao, Ryan Goldhahn, Xue Lin, Yize Li","submitted_at":"2023-02-23T23:48:20Z","abstract_excerpt":"Deep neural networks (DNNs) are sensitive to adversarial examples, resulting in fragile and unreliable performance in the real world. Although adversarial training (AT) is currently one of the most effective methodologies to robustify DNNs, it is computationally very expensive (e.g., 5-10X costlier than standard training). To address this challenge, existing approaches focus on single-step AT, referred to as Fast AT, reducing the overhead of adversarial example generation. Unfortunately, these approaches are known to fail against stronger adversaries. To make AT computationally efficient witho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.12366","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/2302.12366/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":"2302.12366","created_at":"2026-07-05T05:46:39.401303+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.12366v2","created_at":"2026-07-05T05:46:39.401303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.12366","created_at":"2026-07-05T05:46:39.401303+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBZKJI6LLY6V","created_at":"2026-07-05T05:46:39.401303+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBZKJI6LLY6VDST7","created_at":"2026-07-05T05:46:39.401303+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBZKJI6L","created_at":"2026-07-05T05:46:39.401303+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09010","citing_title":"Effective Data Pruning through Score Extrapolation","ref_index":57,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KBZKJI6LLY6VDST7WIC2OGW5BT","json":"https://pith.science/pith/KBZKJI6LLY6VDST7WIC2OGW5BT.json","graph_json":"https://pith.science/api/pith-number/KBZKJI6LLY6VDST7WIC2OGW5BT/graph.json","events_json":"https://pith.science/api/pith-number/KBZKJI6LLY6VDST7WIC2OGW5BT/events.json","paper":"https://pith.science/paper/KBZKJI6L"},"agent_actions":{"view_html":"https://pith.science/pith/KBZKJI6LLY6VDST7WIC2OGW5BT","download_json":"https://pith.science/pith/KBZKJI6LLY6VDST7WIC2OGW5BT.json","view_paper":"https://pith.science/paper/KBZKJI6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.12366&json=true","fetch_graph":"https://pith.science/api/pith-number/KBZKJI6LLY6VDST7WIC2OGW5BT/graph.json","fetch_events":"https://pith.science/api/pith-number/KBZKJI6LLY6VDST7WIC2OGW5BT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBZKJI6LLY6VDST7WIC2OGW5BT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBZKJI6LLY6VDST7WIC2OGW5BT/action/storage_attestation","attest_author":"https://pith.science/pith/KBZKJI6LLY6VDST7WIC2OGW5BT/action/author_attestation","sign_citation":"https://pith.science/pith/KBZKJI6LLY6VDST7WIC2OGW5BT/action/citation_signature","submit_replication":"https://pith.science/pith/KBZKJI6LLY6VDST7WIC2OGW5BT/action/replication_record"}},"created_at":"2026-07-05T05:46:39.401303+00:00","updated_at":"2026-07-05T05:46:39.401303+00:00"}