{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:F5KTRNKAO5NFEU23624TJ3ENGT","short_pith_number":"pith:F5KTRNKA","schema_version":"1.0","canonical_sha256":"2f5538b540775a52535bf6b934ec8d34fd1e1419ec8c6641ba78f3ad2812787a","source":{"kind":"arxiv","id":"2105.03743","version":3},"attestation_state":"computed","paper":{"title":"Certified Robustness to Text Adversarial Attacks by Randomized [MASK]","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jianhan Xu, Jiehang Zeng, Linyang Li, Liping Yuan, Xiaoqing Zheng, Xuanjing Huang","submitted_at":"2021-05-08T16:59:10Z","abstract_excerpt":"Recently, few certified defense methods have been developed to provably guarantee the robustness of a text classifier to adversarial synonym substitutions. However, all existing certified defense methods assume that the defenders are informed of how the adversaries generate synonyms, which is not a realistic scenario. In this paper, we propose a certifiably robust defense method by randomly masking a certain proportion of the words in an input text, in which the above unrealistic assumption is no longer necessary. The proposed method can defend against not only word substitution-based attacks,"},"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":"2105.03743","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CL","submitted_at":"2021-05-08T16:59:10Z","cross_cats_sorted":[],"title_canon_sha256":"c90d71ed80865d4bccb8516b4c75da4500efeaf2dc694f03601a976f8fd722dc","abstract_canon_sha256":"dfa480a5363ceaabf2cfe8505a109df93436a4147ff25571eeafc7af6247ca51"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:00:33.291145Z","signature_b64":"LVrgaxY1rY9DQf2Pu+dae0LLE0IPB0IhuniJ65mxonZtx/v7LhczKZY2HP0lRlqJvqXj8LaB27fOyQYIwCYODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f5538b540775a52535bf6b934ec8d34fd1e1419ec8c6641ba78f3ad2812787a","last_reissued_at":"2026-07-05T03:00:33.290668Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:00:33.290668Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Certified Robustness to Text Adversarial Attacks by Randomized [MASK]","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jianhan Xu, Jiehang Zeng, Linyang Li, Liping Yuan, Xiaoqing Zheng, Xuanjing Huang","submitted_at":"2021-05-08T16:59:10Z","abstract_excerpt":"Recently, few certified defense methods have been developed to provably guarantee the robustness of a text classifier to adversarial synonym substitutions. However, all existing certified defense methods assume that the defenders are informed of how the adversaries generate synonyms, which is not a realistic scenario. In this paper, we propose a certifiably robust defense method by randomly masking a certain proportion of the words in an input text, in which the above unrealistic assumption is no longer necessary. The proposed method can defend against not only word substitution-based attacks,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.03743","kind":"arxiv","version":3},"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/2105.03743/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":"2105.03743","created_at":"2026-07-05T03:00:33.290725+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.03743v3","created_at":"2026-07-05T03:00:33.290725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.03743","created_at":"2026-07-05T03:00:33.290725+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5KTRNKAO5NF","created_at":"2026-07-05T03:00:33.290725+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5KTRNKAO5NFEU23","created_at":"2026-07-05T03:00:33.290725+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5KTRNKA","created_at":"2026-07-05T03:00:33.290725+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13439","citing_title":"S-GBT: Smooth Growth Bound Tensor for Certified Robustness Against Word Substitution Attacks in NLP","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/F5KTRNKAO5NFEU23624TJ3ENGT","json":"https://pith.science/pith/F5KTRNKAO5NFEU23624TJ3ENGT.json","graph_json":"https://pith.science/api/pith-number/F5KTRNKAO5NFEU23624TJ3ENGT/graph.json","events_json":"https://pith.science/api/pith-number/F5KTRNKAO5NFEU23624TJ3ENGT/events.json","paper":"https://pith.science/paper/F5KTRNKA"},"agent_actions":{"view_html":"https://pith.science/pith/F5KTRNKAO5NFEU23624TJ3ENGT","download_json":"https://pith.science/pith/F5KTRNKAO5NFEU23624TJ3ENGT.json","view_paper":"https://pith.science/paper/F5KTRNKA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.03743&json=true","fetch_graph":"https://pith.science/api/pith-number/F5KTRNKAO5NFEU23624TJ3ENGT/graph.json","fetch_events":"https://pith.science/api/pith-number/F5KTRNKAO5NFEU23624TJ3ENGT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5KTRNKAO5NFEU23624TJ3ENGT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5KTRNKAO5NFEU23624TJ3ENGT/action/storage_attestation","attest_author":"https://pith.science/pith/F5KTRNKAO5NFEU23624TJ3ENGT/action/author_attestation","sign_citation":"https://pith.science/pith/F5KTRNKAO5NFEU23624TJ3ENGT/action/citation_signature","submit_replication":"https://pith.science/pith/F5KTRNKAO5NFEU23624TJ3ENGT/action/replication_record"}},"created_at":"2026-07-05T03:00:33.290725+00:00","updated_at":"2026-07-05T03:00:33.290725+00:00"}