{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JZASV7NTQFL3EBM76UAEYOVEEF","short_pith_number":"pith:JZASV7NT","schema_version":"1.0","canonical_sha256":"4e412afdb38157b2059ff5004c3aa4217c5595c9f00af9707648786b51e40710","source":{"kind":"arxiv","id":"2211.10752","version":1},"attestation_state":"computed","paper":{"title":"Towards Robust Dataset Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Florian Kerschbaum, Heng Huang, Hongyang Zhang, Xinda Li, Yihan Wu","submitted_at":"2022-11-19T17:06:10Z","abstract_excerpt":"Adversarial training has been actively studied in recent computer vision research to improve the robustness of models. However, due to the huge computational cost of generating adversarial samples, adversarial training methods are often slow. In this paper, we study the problem of learning a robust dataset such that any classifier naturally trained on the dataset is adversarially robust. Such a dataset benefits the downstream tasks as natural training is much faster than adversarial training, and demonstrates that the desired property of robustness is transferable between models and data. In t"},"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":"2211.10752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2022-11-19T17:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"879f6497f521e0807a84e17f3f22aa4b5bd8c60b47b7e6adf6d3381181df8418","abstract_canon_sha256":"2cb228aef64703458d21dab2ed791320cb8a454e0c3a474c9b36d83bf720e2fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:17:34.143469Z","signature_b64":"TX3VZ5xOPAeZ6yAeb+3y+gOcQ4R0R2jQhrcU1Lm5dcejJ1ljfijD7klgcJUJIlAxJu3pd2wbXf0N6xp2MotkCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e412afdb38157b2059ff5004c3aa4217c5595c9f00af9707648786b51e40710","last_reissued_at":"2026-07-05T05:17:34.143072Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:17:34.143072Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Robust Dataset Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Florian Kerschbaum, Heng Huang, Hongyang Zhang, Xinda Li, Yihan Wu","submitted_at":"2022-11-19T17:06:10Z","abstract_excerpt":"Adversarial training has been actively studied in recent computer vision research to improve the robustness of models. However, due to the huge computational cost of generating adversarial samples, adversarial training methods are often slow. In this paper, we study the problem of learning a robust dataset such that any classifier naturally trained on the dataset is adversarially robust. Such a dataset benefits the downstream tasks as natural training is much faster than adversarial training, and demonstrates that the desired property of robustness is transferable between models and data. In t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.10752","kind":"arxiv","version":1},"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/2211.10752/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":"2211.10752","created_at":"2026-07-05T05:17:34.143129+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.10752v1","created_at":"2026-07-05T05:17:34.143129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.10752","created_at":"2026-07-05T05:17:34.143129+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZASV7NTQFL3","created_at":"2026-07-05T05:17:34.143129+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZASV7NTQFL3EBM7","created_at":"2026-07-05T05:17:34.143129+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZASV7NT","created_at":"2026-07-05T05:17:34.143129+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.20606","citing_title":"Mind Your Margin and Boundary: Are Your Distilled Datasets Truly Robust?","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JZASV7NTQFL3EBM76UAEYOVEEF","json":"https://pith.science/pith/JZASV7NTQFL3EBM76UAEYOVEEF.json","graph_json":"https://pith.science/api/pith-number/JZASV7NTQFL3EBM76UAEYOVEEF/graph.json","events_json":"https://pith.science/api/pith-number/JZASV7NTQFL3EBM76UAEYOVEEF/events.json","paper":"https://pith.science/paper/JZASV7NT"},"agent_actions":{"view_html":"https://pith.science/pith/JZASV7NTQFL3EBM76UAEYOVEEF","download_json":"https://pith.science/pith/JZASV7NTQFL3EBM76UAEYOVEEF.json","view_paper":"https://pith.science/paper/JZASV7NT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.10752&json=true","fetch_graph":"https://pith.science/api/pith-number/JZASV7NTQFL3EBM76UAEYOVEEF/graph.json","fetch_events":"https://pith.science/api/pith-number/JZASV7NTQFL3EBM76UAEYOVEEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZASV7NTQFL3EBM76UAEYOVEEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZASV7NTQFL3EBM76UAEYOVEEF/action/storage_attestation","attest_author":"https://pith.science/pith/JZASV7NTQFL3EBM76UAEYOVEEF/action/author_attestation","sign_citation":"https://pith.science/pith/JZASV7NTQFL3EBM76UAEYOVEEF/action/citation_signature","submit_replication":"https://pith.science/pith/JZASV7NTQFL3EBM76UAEYOVEEF/action/replication_record"}},"created_at":"2026-07-05T05:17:34.143129+00:00","updated_at":"2026-07-05T05:17:34.143129+00:00"}