{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:K7XRT5MVUJHC7TTFTF4EGVNH5O","short_pith_number":"pith:K7XRT5MV","schema_version":"1.0","canonical_sha256":"57ef19f595a24e2fce6599784355a7eb97ac82241b50d4d6b17a115d67bd25ec","source":{"kind":"arxiv","id":"2002.11750","version":4},"attestation_state":"computed","paper":{"title":"On Certifying Robustness against Backdoor Attacks via Randomized Smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Binghui Wang, Jinyuan Jia, Neil Zhenqiang Gong, Xiaoyu Cao","submitted_at":"2020-02-26T19:15:46Z","abstract_excerpt":"Backdoor attack is a severe security threat to deep neural networks (DNNs). We envision that, like adversarial examples, there will be a cat-and-mouse game for backdoor attacks, i.e., new empirical defenses are developed to defend against backdoor attacks but they are soon broken by strong adaptive backdoor attacks. To prevent such cat-and-mouse game, we take the first step towards certified defenses against backdoor attacks. Specifically, in this work, we study the feasibility and effectiveness of certifying robustness against backdoor attacks using a recent technique called randomized smooth"},"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":"2002.11750","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2020-02-26T19:15:46Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8d4a05f37ee2649b7c5867eb653ca07bd502f84bbcce1c516e8ec36cf37ef993","abstract_canon_sha256":"62d17d3b6ac203b0db1eeaf81f774758fc32222c5e7948cd5b8d53a63bc88010"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:20:15.679851Z","signature_b64":"BQLDYqCt1h93nzbV0Fwq8PNxR4XjIVrvzMLjjedzg/ddGV1i7HWG+ELlox+wE646gJ00Y/Bradp01S3G9nWYAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57ef19f595a24e2fce6599784355a7eb97ac82241b50d4d6b17a115d67bd25ec","last_reissued_at":"2026-07-05T01:20:15.679364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:20:15.679364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Certifying Robustness against Backdoor Attacks via Randomized Smoothing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CR","authors_text":"Binghui Wang, Jinyuan Jia, Neil Zhenqiang Gong, Xiaoyu Cao","submitted_at":"2020-02-26T19:15:46Z","abstract_excerpt":"Backdoor attack is a severe security threat to deep neural networks (DNNs). We envision that, like adversarial examples, there will be a cat-and-mouse game for backdoor attacks, i.e., new empirical defenses are developed to defend against backdoor attacks but they are soon broken by strong adaptive backdoor attacks. To prevent such cat-and-mouse game, we take the first step towards certified defenses against backdoor attacks. Specifically, in this work, we study the feasibility and effectiveness of certifying robustness against backdoor attacks using a recent technique called randomized smooth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.11750","kind":"arxiv","version":4},"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/2002.11750/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":"2002.11750","created_at":"2026-07-05T01:20:15.679427+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.11750v4","created_at":"2026-07-05T01:20:15.679427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.11750","created_at":"2026-07-05T01:20:15.679427+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7XRT5MVUJHC","created_at":"2026-07-05T01:20:15.679427+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7XRT5MVUJHC7TTF","created_at":"2026-07-05T01:20:15.679427+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7XRT5MV","created_at":"2026-07-05T01:20:15.679427+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21780","citing_title":"Provable Robustness against Backdoor Attacks via the Primal-Dual Perspective on Differential Privacy","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2512.20865","citing_title":"Robustness Certificates for Neural Networks Against Data Poisoning and Evasion Attacks","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K7XRT5MVUJHC7TTFTF4EGVNH5O","json":"https://pith.science/pith/K7XRT5MVUJHC7TTFTF4EGVNH5O.json","graph_json":"https://pith.science/api/pith-number/K7XRT5MVUJHC7TTFTF4EGVNH5O/graph.json","events_json":"https://pith.science/api/pith-number/K7XRT5MVUJHC7TTFTF4EGVNH5O/events.json","paper":"https://pith.science/paper/K7XRT5MV"},"agent_actions":{"view_html":"https://pith.science/pith/K7XRT5MVUJHC7TTFTF4EGVNH5O","download_json":"https://pith.science/pith/K7XRT5MVUJHC7TTFTF4EGVNH5O.json","view_paper":"https://pith.science/paper/K7XRT5MV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.11750&json=true","fetch_graph":"https://pith.science/api/pith-number/K7XRT5MVUJHC7TTFTF4EGVNH5O/graph.json","fetch_events":"https://pith.science/api/pith-number/K7XRT5MVUJHC7TTFTF4EGVNH5O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7XRT5MVUJHC7TTFTF4EGVNH5O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7XRT5MVUJHC7TTFTF4EGVNH5O/action/storage_attestation","attest_author":"https://pith.science/pith/K7XRT5MVUJHC7TTFTF4EGVNH5O/action/author_attestation","sign_citation":"https://pith.science/pith/K7XRT5MVUJHC7TTFTF4EGVNH5O/action/citation_signature","submit_replication":"https://pith.science/pith/K7XRT5MVUJHC7TTFTF4EGVNH5O/action/replication_record"}},"created_at":"2026-07-05T01:20:15.679427+00:00","updated_at":"2026-07-05T01:20:15.679427+00:00"}