{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EGJVKKK5AATLQHATYFVXENRG6M","short_pith_number":"pith:EGJVKKK5","schema_version":"1.0","canonical_sha256":"219355295d0026b81c13c16b723626f3074d0bd9d2b625145a72e172af138f4d","source":{"kind":"arxiv","id":"2310.09361","version":1},"attestation_state":"computed","paper":{"title":"Is Certifying $\\ell_p$ Robustness Still Worthwhile?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anupam Datta, Corina Pasareanu, Kai Hu, Klas Leino, Matt Fredrikson, Ravi Mangal, Weicheng Yu, Zifan Wang","submitted_at":"2023-10-13T19:08:21Z","abstract_excerpt":"Over the years, researchers have developed myriad attacks that exploit the ubiquity of adversarial examples, as well as defenses that aim to guard against the security vulnerabilities posed by such attacks. Of particular interest to this paper are defenses that provide provable guarantees against the class of $\\ell_p$-bounded attacks. Certified defenses have made significant progress, taking robustness certification from toy models and datasets to large-scale problems like ImageNet classification. While this is undoubtedly an interesting academic problem, as the field has matured, its impact i"},"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":"2310.09361","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-13T19:08:21Z","cross_cats_sorted":[],"title_canon_sha256":"f2be33defaebed758b51f8a5ec70f0e897c437065bfd46d68f5299cf3a11d3ac","abstract_canon_sha256":"0ee61dfb23bd6b3220179673179fe6de22c3f5bccd61919be70a4d71695af84f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:00:46.909861Z","signature_b64":"Dm8KmtUY/wH72hdv5LBaoZFVsFkYBBPCvzZTpm2jgtRCrxnLtOQdUpYGFDeJHrZzaSHc88N8fUh56+5ETn1hBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"219355295d0026b81c13c16b723626f3074d0bd9d2b625145a72e172af138f4d","last_reissued_at":"2026-07-05T07:00:46.909354Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:00:46.909354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Is Certifying $\\ell_p$ Robustness Still Worthwhile?","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Anupam Datta, Corina Pasareanu, Kai Hu, Klas Leino, Matt Fredrikson, Ravi Mangal, Weicheng Yu, Zifan Wang","submitted_at":"2023-10-13T19:08:21Z","abstract_excerpt":"Over the years, researchers have developed myriad attacks that exploit the ubiquity of adversarial examples, as well as defenses that aim to guard against the security vulnerabilities posed by such attacks. Of particular interest to this paper are defenses that provide provable guarantees against the class of $\\ell_p$-bounded attacks. Certified defenses have made significant progress, taking robustness certification from toy models and datasets to large-scale problems like ImageNet classification. While this is undoubtedly an interesting academic problem, as the field has matured, its impact i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.09361","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/2310.09361/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":"2310.09361","created_at":"2026-07-05T07:00:46.909412+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.09361v1","created_at":"2026-07-05T07:00:46.909412+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.09361","created_at":"2026-07-05T07:00:46.909412+00:00"},{"alias_kind":"pith_short_12","alias_value":"EGJVKKK5AATL","created_at":"2026-07-05T07:00:46.909412+00:00"},{"alias_kind":"pith_short_16","alias_value":"EGJVKKK5AATLQHAT","created_at":"2026-07-05T07:00:46.909412+00:00"},{"alias_kind":"pith_short_8","alias_value":"EGJVKKK5","created_at":"2026-07-05T07:00:46.909412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.23203","citing_title":"Lipschitz Optimization for Formal Verification of Homographies","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2410.03000","citing_title":"Towards Generalized Certified Robustness with Multi-Norm Training","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EGJVKKK5AATLQHATYFVXENRG6M","json":"https://pith.science/pith/EGJVKKK5AATLQHATYFVXENRG6M.json","graph_json":"https://pith.science/api/pith-number/EGJVKKK5AATLQHATYFVXENRG6M/graph.json","events_json":"https://pith.science/api/pith-number/EGJVKKK5AATLQHATYFVXENRG6M/events.json","paper":"https://pith.science/paper/EGJVKKK5"},"agent_actions":{"view_html":"https://pith.science/pith/EGJVKKK5AATLQHATYFVXENRG6M","download_json":"https://pith.science/pith/EGJVKKK5AATLQHATYFVXENRG6M.json","view_paper":"https://pith.science/paper/EGJVKKK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.09361&json=true","fetch_graph":"https://pith.science/api/pith-number/EGJVKKK5AATLQHATYFVXENRG6M/graph.json","fetch_events":"https://pith.science/api/pith-number/EGJVKKK5AATLQHATYFVXENRG6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EGJVKKK5AATLQHATYFVXENRG6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EGJVKKK5AATLQHATYFVXENRG6M/action/storage_attestation","attest_author":"https://pith.science/pith/EGJVKKK5AATLQHATYFVXENRG6M/action/author_attestation","sign_citation":"https://pith.science/pith/EGJVKKK5AATLQHATYFVXENRG6M/action/citation_signature","submit_replication":"https://pith.science/pith/EGJVKKK5AATLQHATYFVXENRG6M/action/replication_record"}},"created_at":"2026-07-05T07:00:46.909412+00:00","updated_at":"2026-07-05T07:00:46.909412+00:00"}