{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:KSG4JWATKRY3ODTXHBFAUY5IGP","short_pith_number":"pith:KSG4JWAT","schema_version":"1.0","canonical_sha256":"548dc4d8135471b70e77384a0a63a833d7c3c62b8094f6f18137a7914f5d83ac","source":{"kind":"arxiv","id":"1905.11468","version":2},"attestation_state":"computed","paper":{"title":"Scaleable input gradient regularization for adversarial robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Adam M Oberman, Chris Finlay","submitted_at":"2019-05-27T19:40:52Z","abstract_excerpt":"In this work we revisit gradient regularization for adversarial robustness with some new ingredients. First, we derive new per-image theoretical robustness bounds based on local gradient information. These bounds strongly motivate input gradient regularization. Second, we implement a scaleable version of input gradient regularization which avoids double backpropagation: adversarially robust ImageNet models are trained in 33 hours on four consumer grade GPUs. Finally, we show experimentally and through theoretical certification that input gradient regularization is competitive with adversarial "},"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":"1905.11468","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-27T19:40:52Z","cross_cats_sorted":["cs.CR","cs.CV","cs.LG"],"title_canon_sha256":"5580a209751e39ed52e0aa81546604ee6fc7aeb7f59dd96bfffc829b51421d54","abstract_canon_sha256":"e520b50ab6e97763b67c210fed21b5a117b7331834fafc870e10d35a62f38f9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:09:50.946269Z","signature_b64":"cUpwiKW7Sj9lmW6DYwSjlRKmoliGwDFNgIzDt1qcg5SI7yzwloOA4NsxaCMex3UXPA51G0xuTa+DsubHGKupCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"548dc4d8135471b70e77384a0a63a833d7c3c62b8094f6f18137a7914f5d83ac","last_reissued_at":"2026-07-05T00:09:50.945841Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:09:50.945841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaleable input gradient regularization for adversarial robustness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Adam M Oberman, Chris Finlay","submitted_at":"2019-05-27T19:40:52Z","abstract_excerpt":"In this work we revisit gradient regularization for adversarial robustness with some new ingredients. First, we derive new per-image theoretical robustness bounds based on local gradient information. These bounds strongly motivate input gradient regularization. Second, we implement a scaleable version of input gradient regularization which avoids double backpropagation: adversarially robust ImageNet models are trained in 33 hours on four consumer grade GPUs. Finally, we show experimentally and through theoretical certification that input gradient regularization is competitive with adversarial "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11468","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/1905.11468/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":"1905.11468","created_at":"2026-07-05T00:09:50.945899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11468v2","created_at":"2026-07-05T00:09:50.945899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11468","created_at":"2026-07-05T00:09:50.945899+00:00"},{"alias_kind":"pith_short_12","alias_value":"KSG4JWATKRY3","created_at":"2026-07-05T00:09:50.945899+00:00"},{"alias_kind":"pith_short_16","alias_value":"KSG4JWATKRY3ODTX","created_at":"2026-07-05T00:09:50.945899+00:00"},{"alias_kind":"pith_short_8","alias_value":"KSG4JWAT","created_at":"2026-07-05T00:09:50.945899+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.01667","citing_title":"A principled approach for generating adversarial images under non-smooth dissimilarity metrics","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KSG4JWATKRY3ODTXHBFAUY5IGP","json":"https://pith.science/pith/KSG4JWATKRY3ODTXHBFAUY5IGP.json","graph_json":"https://pith.science/api/pith-number/KSG4JWATKRY3ODTXHBFAUY5IGP/graph.json","events_json":"https://pith.science/api/pith-number/KSG4JWATKRY3ODTXHBFAUY5IGP/events.json","paper":"https://pith.science/paper/KSG4JWAT"},"agent_actions":{"view_html":"https://pith.science/pith/KSG4JWATKRY3ODTXHBFAUY5IGP","download_json":"https://pith.science/pith/KSG4JWATKRY3ODTXHBFAUY5IGP.json","view_paper":"https://pith.science/paper/KSG4JWAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11468&json=true","fetch_graph":"https://pith.science/api/pith-number/KSG4JWATKRY3ODTXHBFAUY5IGP/graph.json","fetch_events":"https://pith.science/api/pith-number/KSG4JWATKRY3ODTXHBFAUY5IGP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KSG4JWATKRY3ODTXHBFAUY5IGP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KSG4JWATKRY3ODTXHBFAUY5IGP/action/storage_attestation","attest_author":"https://pith.science/pith/KSG4JWATKRY3ODTXHBFAUY5IGP/action/author_attestation","sign_citation":"https://pith.science/pith/KSG4JWATKRY3ODTXHBFAUY5IGP/action/citation_signature","submit_replication":"https://pith.science/pith/KSG4JWATKRY3ODTXHBFAUY5IGP/action/replication_record"}},"created_at":"2026-07-05T00:09:50.945899+00:00","updated_at":"2026-07-05T00:09:50.945899+00:00"}