{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HZ5HJGX4G277G24F7I4SWEXFQU","short_pith_number":"pith:HZ5HJGX4","schema_version":"1.0","canonical_sha256":"3e7a749afc36bff36b85fa392b12e585186929df013108b8a2f9aff8a507f4e4","source":{"kind":"arxiv","id":"1905.11213","version":2},"attestation_state":"computed","paper":{"title":"Provable robustness against all adversarial $l_p$-perturbations for $p\\geq 1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Francesco Croce, Matthias Hein","submitted_at":"2019-05-27T13:49:08Z","abstract_excerpt":"In recent years several adversarial attacks and defenses have been proposed. Often seemingly robust models turn out to be non-robust when more sophisticated attacks are used. One way out of this dilemma are provable robustness guarantees. While provably robust models for specific $l_p$-perturbation models have been developed, we show that they do not come with any guarantee against other $l_q$-perturbations. We propose a new regularization scheme, MMR-Universal, for ReLU networks which enforces robustness wrt $l_1$- and $l_\\infty$-perturbations and show how that leads to the first provably rob"},"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.11213","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-05-27T13:49:08Z","cross_cats_sorted":["cs.CR","stat.ML"],"title_canon_sha256":"29b315c01cd67d112db2f6ea444d40df4ee1c684e18f88291e9b709ee10453f0","abstract_canon_sha256":"698473eb38453d0fbd49048f050b78b8c7bd7ca66b3008bad1cf3123336806e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:57:49.272696Z","signature_b64":"XqD7FUJBOQuJ3E/us9E5Eeu3pFt8omQc30H70qD1nYAaWPngnfxHYoB+UXR0kAWpavv8iG7ojsmcyDenzrrSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e7a749afc36bff36b85fa392b12e585186929df013108b8a2f9aff8a507f4e4","last_reissued_at":"2026-07-05T00:57:49.272251Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:57:49.272251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable robustness against all adversarial $l_p$-perturbations for $p\\geq 1$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Francesco Croce, Matthias Hein","submitted_at":"2019-05-27T13:49:08Z","abstract_excerpt":"In recent years several adversarial attacks and defenses have been proposed. Often seemingly robust models turn out to be non-robust when more sophisticated attacks are used. One way out of this dilemma are provable robustness guarantees. While provably robust models for specific $l_p$-perturbation models have been developed, we show that they do not come with any guarantee against other $l_q$-perturbations. We propose a new regularization scheme, MMR-Universal, for ReLU networks which enforces robustness wrt $l_1$- and $l_\\infty$-perturbations and show how that leads to the first provably rob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11213","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.11213/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.11213","created_at":"2026-07-05T00:57:49.272306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.11213v2","created_at":"2026-07-05T00:57:49.272306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11213","created_at":"2026-07-05T00:57:49.272306+00:00"},{"alias_kind":"pith_short_12","alias_value":"HZ5HJGX4G277","created_at":"2026-07-05T00:57:49.272306+00:00"},{"alias_kind":"pith_short_16","alias_value":"HZ5HJGX4G277G24F","created_at":"2026-07-05T00:57:49.272306+00:00"},{"alias_kind":"pith_short_8","alias_value":"HZ5HJGX4","created_at":"2026-07-05T00:57:49.272306+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.12780","citing_title":"Efficient Adversarial Training via Criticality-Aware Fine-Tuning","ref_index":31,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HZ5HJGX4G277G24F7I4SWEXFQU","json":"https://pith.science/pith/HZ5HJGX4G277G24F7I4SWEXFQU.json","graph_json":"https://pith.science/api/pith-number/HZ5HJGX4G277G24F7I4SWEXFQU/graph.json","events_json":"https://pith.science/api/pith-number/HZ5HJGX4G277G24F7I4SWEXFQU/events.json","paper":"https://pith.science/paper/HZ5HJGX4"},"agent_actions":{"view_html":"https://pith.science/pith/HZ5HJGX4G277G24F7I4SWEXFQU","download_json":"https://pith.science/pith/HZ5HJGX4G277G24F7I4SWEXFQU.json","view_paper":"https://pith.science/paper/HZ5HJGX4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.11213&json=true","fetch_graph":"https://pith.science/api/pith-number/HZ5HJGX4G277G24F7I4SWEXFQU/graph.json","fetch_events":"https://pith.science/api/pith-number/HZ5HJGX4G277G24F7I4SWEXFQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HZ5HJGX4G277G24F7I4SWEXFQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HZ5HJGX4G277G24F7I4SWEXFQU/action/storage_attestation","attest_author":"https://pith.science/pith/HZ5HJGX4G277G24F7I4SWEXFQU/action/author_attestation","sign_citation":"https://pith.science/pith/HZ5HJGX4G277G24F7I4SWEXFQU/action/citation_signature","submit_replication":"https://pith.science/pith/HZ5HJGX4G277G24F7I4SWEXFQU/action/replication_record"}},"created_at":"2026-07-05T00:57:49.272306+00:00","updated_at":"2026-07-05T00:57:49.272306+00:00"}