{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:J25B6LG3QBKDZQAFY7AHCKAFLN","short_pith_number":"pith:J25B6LG3","schema_version":"1.0","canonical_sha256":"4eba1f2cdb80543cc005c7c07128055b4b161f1899394ac6c4333cc4446641ac","source":{"kind":"arxiv","id":"2205.12700","version":3},"attestation_state":"computed","paper":{"title":"BITE: Textual Backdoor Attacks with Iterative Trigger Injection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jun Yan, Vansh Gupta, Xiang Ren","submitted_at":"2022-05-25T11:58:38Z","abstract_excerpt":"Backdoor attacks have become an emerging threat to NLP systems. By providing poisoned training data, the adversary can embed a \"backdoor\" into the victim model, which allows input instances satisfying certain textual patterns (e.g., containing a keyword) to be predicted as a target label of the adversary's choice. In this paper, we demonstrate that it is possible to design a backdoor attack that is both stealthy (i.e., hard to notice) and effective (i.e., has a high attack success rate). We propose BITE, a backdoor attack that poisons the training data to establish strong correlations between "},"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":"2205.12700","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2022-05-25T11:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"00bb5984c81b94c9623fe6d7afb83ab5d80ccfdf6528cbadb774fe5cb7344b8b","abstract_canon_sha256":"7ccdec133ef0ba4f85c7c4ce077509c61b2417314820f1f3a06afb3a0f41e4b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:34.901714Z","signature_b64":"J1Aoh4937goemkH8Gl9S7PFWDfu8S4l4/7dUD4vqsqjKEwCYFlQcgxi34n64CUCAbin076ltbQNBuC931Ej8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4eba1f2cdb80543cc005c7c07128055b4b161f1899394ac6c4333cc4446641ac","last_reissued_at":"2026-07-05T06:14:34.901261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:34.901261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BITE: Textual Backdoor Attacks with Iterative Trigger Injection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jun Yan, Vansh Gupta, Xiang Ren","submitted_at":"2022-05-25T11:58:38Z","abstract_excerpt":"Backdoor attacks have become an emerging threat to NLP systems. By providing poisoned training data, the adversary can embed a \"backdoor\" into the victim model, which allows input instances satisfying certain textual patterns (e.g., containing a keyword) to be predicted as a target label of the adversary's choice. In this paper, we demonstrate that it is possible to design a backdoor attack that is both stealthy (i.e., hard to notice) and effective (i.e., has a high attack success rate). We propose BITE, a backdoor attack that poisons the training data to establish strong correlations between "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.12700","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/2205.12700/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":"2205.12700","created_at":"2026-07-05T06:14:34.901326+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.12700v3","created_at":"2026-07-05T06:14:34.901326+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.12700","created_at":"2026-07-05T06:14:34.901326+00:00"},{"alias_kind":"pith_short_12","alias_value":"J25B6LG3QBKD","created_at":"2026-07-05T06:14:34.901326+00:00"},{"alias_kind":"pith_short_16","alias_value":"J25B6LG3QBKDZQAF","created_at":"2026-07-05T06:14:34.901326+00:00"},{"alias_kind":"pith_short_8","alias_value":"J25B6LG3","created_at":"2026-07-05T06:14:34.901326+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27511","citing_title":"When the Aggregator Cheats: Data-Free Backdoors in Federated LLM-based QA Systems","ref_index":49,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J25B6LG3QBKDZQAFY7AHCKAFLN","json":"https://pith.science/pith/J25B6LG3QBKDZQAFY7AHCKAFLN.json","graph_json":"https://pith.science/api/pith-number/J25B6LG3QBKDZQAFY7AHCKAFLN/graph.json","events_json":"https://pith.science/api/pith-number/J25B6LG3QBKDZQAFY7AHCKAFLN/events.json","paper":"https://pith.science/paper/J25B6LG3"},"agent_actions":{"view_html":"https://pith.science/pith/J25B6LG3QBKDZQAFY7AHCKAFLN","download_json":"https://pith.science/pith/J25B6LG3QBKDZQAFY7AHCKAFLN.json","view_paper":"https://pith.science/paper/J25B6LG3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.12700&json=true","fetch_graph":"https://pith.science/api/pith-number/J25B6LG3QBKDZQAFY7AHCKAFLN/graph.json","fetch_events":"https://pith.science/api/pith-number/J25B6LG3QBKDZQAFY7AHCKAFLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J25B6LG3QBKDZQAFY7AHCKAFLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J25B6LG3QBKDZQAFY7AHCKAFLN/action/storage_attestation","attest_author":"https://pith.science/pith/J25B6LG3QBKDZQAFY7AHCKAFLN/action/author_attestation","sign_citation":"https://pith.science/pith/J25B6LG3QBKDZQAFY7AHCKAFLN/action/citation_signature","submit_replication":"https://pith.science/pith/J25B6LG3QBKDZQAFY7AHCKAFLN/action/replication_record"}},"created_at":"2026-07-05T06:14:34.901326+00:00","updated_at":"2026-07-05T06:14:34.901326+00:00"}