{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LHMX57DT737E4RPEARXAIDUISG","short_pith_number":"pith:LHMX57DT","schema_version":"1.0","canonical_sha256":"59d97efc73fefe4e45e4046e040e8891ac5697393a0686d3869699f4c97ed8e5","source":{"kind":"arxiv","id":"1906.00555","version":2},"attestation_state":"computed","paper":{"title":"Adversarially Robust Generalization Just Requires More Unlabeled Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Dan, Di He, John Hopcroft, Kun He, Liwei Wang, Runtian Zhai, Tianle Cai","submitted_at":"2019-06-03T03:56:41Z","abstract_excerpt":"Neural network robustness has recently been highlighted by the existence of adversarial examples. Many previous works show that the learned networks do not perform well on perturbed test data, and significantly more labeled data is required to achieve adversarially robust generalization. In this paper, we theoretically and empirically show that with just more unlabeled data, we can learn a model with better adversarially robust generalization. The key insight of our results is based on a risk decomposition theorem, in which the expected robust risk is separated into two parts: the stability pa"},"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":"1906.00555","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-03T03:56:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"4f88dc524281eaeada334b430c898769f9bc36961862c2afbe28455e80db3f94","abstract_canon_sha256":"ccde2a06d9463ffced0de5d0d048a5f79e1273cf0bbc4ba845b70651eb199a8d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:07:23.629196Z","signature_b64":"V3z+obpzXdVjBiaqMPkjupczT0ao7dZcjurWlq2s+r+sah8tj/dLiNkKAV55syqcPqfHopzEWLQnI29ZGvj7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d97efc73fefe4e45e4046e040e8891ac5697393a0686d3869699f4c97ed8e5","last_reissued_at":"2026-07-05T00:07:23.628763Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:07:23.628763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarially Robust Generalization Just Requires More Unlabeled Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Dan, Di He, John Hopcroft, Kun He, Liwei Wang, Runtian Zhai, Tianle Cai","submitted_at":"2019-06-03T03:56:41Z","abstract_excerpt":"Neural network robustness has recently been highlighted by the existence of adversarial examples. Many previous works show that the learned networks do not perform well on perturbed test data, and significantly more labeled data is required to achieve adversarially robust generalization. In this paper, we theoretically and empirically show that with just more unlabeled data, we can learn a model with better adversarially robust generalization. The key insight of our results is based on a risk decomposition theorem, in which the expected robust risk is separated into two parts: the stability pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00555","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/1906.00555/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":"1906.00555","created_at":"2026-07-05T00:07:23.628818+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00555v2","created_at":"2026-07-05T00:07:23.628818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00555","created_at":"2026-07-05T00:07:23.628818+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHMX57DT737E","created_at":"2026-07-05T00:07:23.628818+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHMX57DT737E4RPE","created_at":"2026-07-05T00:07:23.628818+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHMX57DT","created_at":"2026-07-05T00:07:23.628818+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00207","citing_title":"Homogenization of $\\ell_2$-Adversarial Training in High-Dimensions: Exact Dynamics under Stochastic Gradient Descent","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26496","citing_title":"Robust Alignment: Harmonizing Clean Accuracy and Adversarial Robustness in Adversarial Training","ref_index":70,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHMX57DT737E4RPEARXAIDUISG","json":"https://pith.science/pith/LHMX57DT737E4RPEARXAIDUISG.json","graph_json":"https://pith.science/api/pith-number/LHMX57DT737E4RPEARXAIDUISG/graph.json","events_json":"https://pith.science/api/pith-number/LHMX57DT737E4RPEARXAIDUISG/events.json","paper":"https://pith.science/paper/LHMX57DT"},"agent_actions":{"view_html":"https://pith.science/pith/LHMX57DT737E4RPEARXAIDUISG","download_json":"https://pith.science/pith/LHMX57DT737E4RPEARXAIDUISG.json","view_paper":"https://pith.science/paper/LHMX57DT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00555&json=true","fetch_graph":"https://pith.science/api/pith-number/LHMX57DT737E4RPEARXAIDUISG/graph.json","fetch_events":"https://pith.science/api/pith-number/LHMX57DT737E4RPEARXAIDUISG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHMX57DT737E4RPEARXAIDUISG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHMX57DT737E4RPEARXAIDUISG/action/storage_attestation","attest_author":"https://pith.science/pith/LHMX57DT737E4RPEARXAIDUISG/action/author_attestation","sign_citation":"https://pith.science/pith/LHMX57DT737E4RPEARXAIDUISG/action/citation_signature","submit_replication":"https://pith.science/pith/LHMX57DT737E4RPEARXAIDUISG/action/replication_record"}},"created_at":"2026-07-05T00:07:23.628818+00:00","updated_at":"2026-07-05T00:07:23.628818+00:00"}