{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:D7CXCN73E7LXEZ2TTKD77VI4DP","short_pith_number":"pith:D7CXCN73","schema_version":"1.0","canonical_sha256":"1fc57137fb27d77267539a87ffd51c1be94bb00a01dad56cc6a847ca0e292a2c","source":{"kind":"arxiv","id":"1810.09519","version":2},"attestation_state":"computed","paper":{"title":"Adversarial Risk Bounds via Function Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Justin Khim, Po-Ling Loh","submitted_at":"2018-10-22T19:51:20Z","abstract_excerpt":"We derive bounds for a notion of adversarial risk, designed to characterize the robustness of linear and neural network classifiers to adversarial perturbations. Specifically, we introduce a new class of function transformations with the property that the risk of the transformed functions upper-bounds the adversarial risk of the original functions. This reduces the problem of deriving bounds on the adversarial risk to the problem of deriving risk bounds using standard learning-theoretic techniques. We then derive bounds on the Rademacher complexities of the transformed function classes, obtain"},"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":"1810.09519","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-22T19:51:20Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3d90ae0a3ec38207704c560c7042b2c64cdc6b3d6f64459d4e924d2b150749fd","abstract_canon_sha256":"ac2547c4cb56708c78b7c56fba1e2096a63c7841b9b68372bad190301d87f00d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:07.290036Z","signature_b64":"mLBGnxtvXTEb4+4mRs/zTCnQBtfG+i56zmItL04Jd8i1vgDavcU7PM1kZy64ON5pkWcNGMw6xqWQiQiU0nWMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fc57137fb27d77267539a87ffd51c1be94bb00a01dad56cc6a847ca0e292a2c","last_reissued_at":"2026-05-17T23:57:07.289596Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:07.289596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adversarial Risk Bounds via Function Transformation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Justin Khim, Po-Ling Loh","submitted_at":"2018-10-22T19:51:20Z","abstract_excerpt":"We derive bounds for a notion of adversarial risk, designed to characterize the robustness of linear and neural network classifiers to adversarial perturbations. Specifically, we introduce a new class of function transformations with the property that the risk of the transformed functions upper-bounds the adversarial risk of the original functions. This reduces the problem of deriving bounds on the adversarial risk to the problem of deriving risk bounds using standard learning-theoretic techniques. We then derive bounds on the Rademacher complexities of the transformed function classes, obtain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.09519","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":""},"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":"1810.09519","created_at":"2026-05-17T23:57:07.289663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.09519v2","created_at":"2026-05-17T23:57:07.289663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.09519","created_at":"2026-05-17T23:57:07.289663+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7CXCN73E7LX","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7CXCN73E7LXEZ2T","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7CXCN73","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.01267","citing_title":"Adversarial learning for nonparametric regression: Minimax rate and adaptive estimation","ref_index":51,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D7CXCN73E7LXEZ2TTKD77VI4DP","json":"https://pith.science/pith/D7CXCN73E7LXEZ2TTKD77VI4DP.json","graph_json":"https://pith.science/api/pith-number/D7CXCN73E7LXEZ2TTKD77VI4DP/graph.json","events_json":"https://pith.science/api/pith-number/D7CXCN73E7LXEZ2TTKD77VI4DP/events.json","paper":"https://pith.science/paper/D7CXCN73"},"agent_actions":{"view_html":"https://pith.science/pith/D7CXCN73E7LXEZ2TTKD77VI4DP","download_json":"https://pith.science/pith/D7CXCN73E7LXEZ2TTKD77VI4DP.json","view_paper":"https://pith.science/paper/D7CXCN73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.09519&json=true","fetch_graph":"https://pith.science/api/pith-number/D7CXCN73E7LXEZ2TTKD77VI4DP/graph.json","fetch_events":"https://pith.science/api/pith-number/D7CXCN73E7LXEZ2TTKD77VI4DP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7CXCN73E7LXEZ2TTKD77VI4DP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7CXCN73E7LXEZ2TTKD77VI4DP/action/storage_attestation","attest_author":"https://pith.science/pith/D7CXCN73E7LXEZ2TTKD77VI4DP/action/author_attestation","sign_citation":"https://pith.science/pith/D7CXCN73E7LXEZ2TTKD77VI4DP/action/citation_signature","submit_replication":"https://pith.science/pith/D7CXCN73E7LXEZ2TTKD77VI4DP/action/replication_record"}},"created_at":"2026-05-17T23:57:07.289663+00:00","updated_at":"2026-05-17T23:57:07.289663+00:00"}