{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SMJYYDEGFYAHQJBMH6DD2L7XXZ","short_pith_number":"pith:SMJYYDEG","schema_version":"1.0","canonical_sha256":"93138c0c862e0078242c3f863d2ff7be7cb7f8501b4a2e8c8987b03240b3f684","source":{"kind":"arxiv","id":"2211.14966","version":1},"attestation_state":"computed","paper":{"title":"Adversarial Rademacher Complexity of Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiancong Xiao, Ruoyu Sun, Yanbo Fan, Zhi-Quan Luo","submitted_at":"2022-11-27T23:24:37Z","abstract_excerpt":"Deep neural networks are vulnerable to adversarial attacks. Ideally, a robust model shall perform well on both the perturbed training data and the unseen perturbed test data. It is found empirically that fitting perturbed training data is not hard, but generalizing to perturbed test data is quite difficult. To better understand adversarial generalization, it is of great interest to study the adversarial Rademacher complexity (ARC) of deep neural networks. However, how to bound ARC in multi-layers cases is largely unclear due to the difficulty of analyzing adversarial loss in the definition of "},"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.14966","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-11-27T23:24:37Z","cross_cats_sorted":[],"title_canon_sha256":"d35f9ef11f86eb23ef276dd9b805d2c6c8ace0dfb494baff7abb830fd8138bf7","abstract_canon_sha256":"29d6181bccb495703e852a83eee09e0bce89042e457353ad5af62b0cd60c0052"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:19:57.947714Z","signature_b64":"1GHOg2DdG40BpDa+09RDd3GWL0Q9oSCvrZjeZJkqvBfCqQpUecNEh7fbA9SBcPlppNT7++ij3iC9NLNSwmmZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93138c0c862e0078242c3f863d2ff7be7cb7f8501b4a2e8c8987b03240b3f684","last_reissued_at":"2026-07-05T05:19:57.947297Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:19:57.947297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Rademacher Complexity of Deep Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiancong Xiao, Ruoyu Sun, Yanbo Fan, Zhi-Quan Luo","submitted_at":"2022-11-27T23:24:37Z","abstract_excerpt":"Deep neural networks are vulnerable to adversarial attacks. Ideally, a robust model shall perform well on both the perturbed training data and the unseen perturbed test data. It is found empirically that fitting perturbed training data is not hard, but generalizing to perturbed test data is quite difficult. To better understand adversarial generalization, it is of great interest to study the adversarial Rademacher complexity (ARC) of deep neural networks. However, how to bound ARC in multi-layers cases is largely unclear due to the difficulty of analyzing adversarial loss in the definition of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.14966","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.14966/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.14966","created_at":"2026-07-05T05:19:57.947366+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.14966v1","created_at":"2026-07-05T05:19:57.947366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.14966","created_at":"2026-07-05T05:19:57.947366+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMJYYDEGFYAH","created_at":"2026-07-05T05:19:57.947366+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMJYYDEGFYAHQJBM","created_at":"2026-07-05T05:19:57.947366+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMJYYDEG","created_at":"2026-07-05T05:19:57.947366+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.12449","citing_title":"Adversarially robust generalization theory via Jacobian regularization for deep neural networks","ref_index":2022,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SMJYYDEGFYAHQJBMH6DD2L7XXZ","json":"https://pith.science/pith/SMJYYDEGFYAHQJBMH6DD2L7XXZ.json","graph_json":"https://pith.science/api/pith-number/SMJYYDEGFYAHQJBMH6DD2L7XXZ/graph.json","events_json":"https://pith.science/api/pith-number/SMJYYDEGFYAHQJBMH6DD2L7XXZ/events.json","paper":"https://pith.science/paper/SMJYYDEG"},"agent_actions":{"view_html":"https://pith.science/pith/SMJYYDEGFYAHQJBMH6DD2L7XXZ","download_json":"https://pith.science/pith/SMJYYDEGFYAHQJBMH6DD2L7XXZ.json","view_paper":"https://pith.science/paper/SMJYYDEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.14966&json=true","fetch_graph":"https://pith.science/api/pith-number/SMJYYDEGFYAHQJBMH6DD2L7XXZ/graph.json","fetch_events":"https://pith.science/api/pith-number/SMJYYDEGFYAHQJBMH6DD2L7XXZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMJYYDEGFYAHQJBMH6DD2L7XXZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMJYYDEGFYAHQJBMH6DD2L7XXZ/action/storage_attestation","attest_author":"https://pith.science/pith/SMJYYDEGFYAHQJBMH6DD2L7XXZ/action/author_attestation","sign_citation":"https://pith.science/pith/SMJYYDEGFYAHQJBMH6DD2L7XXZ/action/citation_signature","submit_replication":"https://pith.science/pith/SMJYYDEGFYAHQJBMH6DD2L7XXZ/action/replication_record"}},"created_at":"2026-07-05T05:19:57.947366+00:00","updated_at":"2026-07-05T05:19:57.947366+00:00"}