{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TRAAT5T35UQCWYNWFND4GCDJ5S","short_pith_number":"pith:TRAAT5T3","schema_version":"1.0","canonical_sha256":"9c4009f67bed202b61b62b47c30869ec8db7996599b817cc787e84c97ea0871b","source":{"kind":"arxiv","id":"2104.08139","version":1},"attestation_state":"computed","paper":{"title":"Towards Variable-Length Textual Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Boxing Chen, Enhong Chen, Junliang Guo, Linlin Zhang, Linli Xu, Weihua Luo, Zhirui Zhang","submitted_at":"2021-04-16T14:37:27Z","abstract_excerpt":"Adversarial attacks have shown the vulnerability of machine learning models, however, it is non-trivial to conduct textual adversarial attacks on natural language processing tasks due to the discreteness of data. Most previous approaches conduct attacks with the atomic \\textit{replacement} operation, which usually leads to fixed-length adversarial examples and therefore limits the exploration on the decision space. In this paper, we propose variable-length textual adversarial attacks~(VL-Attack) and integrate three atomic operations, namely \\textit{insertion}, \\textit{deletion} and \\textit{rep"},"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":"2104.08139","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2021-04-16T14:37:27Z","cross_cats_sorted":[],"title_canon_sha256":"7c2be18423f5db89759fe070717fbb52ac15693be0da779dbd57e95ee5b0e5fa","abstract_canon_sha256":"a5b48c754f02286e7aa68e9ede924fc922b737b8b3b2e9eb9414d42ded0bb296"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:41.401334Z","signature_b64":"h0Xl6RRG6jxR9IP9XCE6UuAgRQn84GEKIpN5ldlEbi2osC/LW9awSkgxTX81wK2A12Wgt5mP4Mn8wDOmZN9rCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c4009f67bed202b61b62b47c30869ec8db7996599b817cc787e84c97ea0871b","last_reissued_at":"2026-07-05T02:32:41.400925Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:41.400925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Variable-Length Textual Adversarial Attacks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Boxing Chen, Enhong Chen, Junliang Guo, Linlin Zhang, Linli Xu, Weihua Luo, Zhirui Zhang","submitted_at":"2021-04-16T14:37:27Z","abstract_excerpt":"Adversarial attacks have shown the vulnerability of machine learning models, however, it is non-trivial to conduct textual adversarial attacks on natural language processing tasks due to the discreteness of data. Most previous approaches conduct attacks with the atomic \\textit{replacement} operation, which usually leads to fixed-length adversarial examples and therefore limits the exploration on the decision space. In this paper, we propose variable-length textual adversarial attacks~(VL-Attack) and integrate three atomic operations, namely \\textit{insertion}, \\textit{deletion} and \\textit{rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.08139","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/2104.08139/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":"2104.08139","created_at":"2026-07-05T02:32:41.400982+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.08139v1","created_at":"2026-07-05T02:32:41.400982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.08139","created_at":"2026-07-05T02:32:41.400982+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRAAT5T35UQC","created_at":"2026-07-05T02:32:41.400982+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRAAT5T35UQCWYNW","created_at":"2026-07-05T02:32:41.400982+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRAAT5T3","created_at":"2026-07-05T02:32:41.400982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.18306","citing_title":"SALMAN: Stability Analysis of Language Models Through the Maps Between Graph-based Manifolds","ref_index":48,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TRAAT5T35UQCWYNWFND4GCDJ5S","json":"https://pith.science/pith/TRAAT5T35UQCWYNWFND4GCDJ5S.json","graph_json":"https://pith.science/api/pith-number/TRAAT5T35UQCWYNWFND4GCDJ5S/graph.json","events_json":"https://pith.science/api/pith-number/TRAAT5T35UQCWYNWFND4GCDJ5S/events.json","paper":"https://pith.science/paper/TRAAT5T3"},"agent_actions":{"view_html":"https://pith.science/pith/TRAAT5T35UQCWYNWFND4GCDJ5S","download_json":"https://pith.science/pith/TRAAT5T35UQCWYNWFND4GCDJ5S.json","view_paper":"https://pith.science/paper/TRAAT5T3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.08139&json=true","fetch_graph":"https://pith.science/api/pith-number/TRAAT5T35UQCWYNWFND4GCDJ5S/graph.json","fetch_events":"https://pith.science/api/pith-number/TRAAT5T35UQCWYNWFND4GCDJ5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRAAT5T35UQCWYNWFND4GCDJ5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRAAT5T35UQCWYNWFND4GCDJ5S/action/storage_attestation","attest_author":"https://pith.science/pith/TRAAT5T35UQCWYNWFND4GCDJ5S/action/author_attestation","sign_citation":"https://pith.science/pith/TRAAT5T35UQCWYNWFND4GCDJ5S/action/citation_signature","submit_replication":"https://pith.science/pith/TRAAT5T35UQCWYNWFND4GCDJ5S/action/replication_record"}},"created_at":"2026-07-05T02:32:41.400982+00:00","updated_at":"2026-07-05T02:32:41.400982+00:00"}