{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QB6WI4SG3VS5X4NXVW36KXS2RB","short_pith_number":"pith:QB6WI4SG","schema_version":"1.0","canonical_sha256":"807d647246dd65dbf1b7adb7e55e5a8871716711f504641a28e52e46e12f633e","source":{"kind":"arxiv","id":"2302.00944","version":2},"attestation_state":"computed","paper":{"title":"TransFool: An Adversarial Attack against Neural Machine Translation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ljiljana Dolamic, Pascal Frossard, Sahar Sadrizadeh","submitted_at":"2023-02-02T08:35:34Z","abstract_excerpt":"Deep neural networks have been shown to be vulnerable to small perturbations of their inputs, known as adversarial attacks. In this paper, we investigate the vulnerability of Neural Machine Translation (NMT) models to adversarial attacks and propose a new attack algorithm called TransFool. To fool NMT models, TransFool builds on a multi-term optimization problem and a gradient projection step. By integrating the embedding representation of a language model, we generate fluent adversarial examples in the source language that maintain a high level of semantic similarity with the clean samples. E"},"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":"2302.00944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2023-02-02T08:35:34Z","cross_cats_sorted":[],"title_canon_sha256":"fab4dd6d87e980eeceeb2d2512a9fb4c56135d42be82feef0ecf77d84ac44518","abstract_canon_sha256":"8c4065a2000c0223a0561d48623272fd2f2f88e2441b0cc185165e82fe3e9ff4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:21:15.331737Z","signature_b64":"ZMny7udAAYgiNnUIBwUP8+uNiPo9FOsibM9MXeImE0fHE2ecnzAj82A14Hn7/g1Or19fjF6pBFyCWRUPN7i/DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"807d647246dd65dbf1b7adb7e55e5a8871716711f504641a28e52e46e12f633e","last_reissued_at":"2026-07-05T06:21:15.331299Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:21:15.331299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TransFool: An Adversarial Attack against Neural Machine Translation Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Ljiljana Dolamic, Pascal Frossard, Sahar Sadrizadeh","submitted_at":"2023-02-02T08:35:34Z","abstract_excerpt":"Deep neural networks have been shown to be vulnerable to small perturbations of their inputs, known as adversarial attacks. In this paper, we investigate the vulnerability of Neural Machine Translation (NMT) models to adversarial attacks and propose a new attack algorithm called TransFool. To fool NMT models, TransFool builds on a multi-term optimization problem and a gradient projection step. By integrating the embedding representation of a language model, we generate fluent adversarial examples in the source language that maintain a high level of semantic similarity with the clean samples. E"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.00944","kind":"arxiv","version":2},"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/2302.00944/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":"2302.00944","created_at":"2026-07-05T06:21:15.331372+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.00944v2","created_at":"2026-07-05T06:21:15.331372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.00944","created_at":"2026-07-05T06:21:15.331372+00:00"},{"alias_kind":"pith_short_12","alias_value":"QB6WI4SG3VS5","created_at":"2026-07-05T06:21:15.331372+00:00"},{"alias_kind":"pith_short_16","alias_value":"QB6WI4SG3VS5X4NX","created_at":"2026-07-05T06:21:15.331372+00:00"},{"alias_kind":"pith_short_8","alias_value":"QB6WI4SG","created_at":"2026-07-05T06:21:15.331372+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.10039","citing_title":"Multi-task Adversarial Attacks against Black-box Model with Few-shot Queries","ref_index":2019,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QB6WI4SG3VS5X4NXVW36KXS2RB","json":"https://pith.science/pith/QB6WI4SG3VS5X4NXVW36KXS2RB.json","graph_json":"https://pith.science/api/pith-number/QB6WI4SG3VS5X4NXVW36KXS2RB/graph.json","events_json":"https://pith.science/api/pith-number/QB6WI4SG3VS5X4NXVW36KXS2RB/events.json","paper":"https://pith.science/paper/QB6WI4SG"},"agent_actions":{"view_html":"https://pith.science/pith/QB6WI4SG3VS5X4NXVW36KXS2RB","download_json":"https://pith.science/pith/QB6WI4SG3VS5X4NXVW36KXS2RB.json","view_paper":"https://pith.science/paper/QB6WI4SG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.00944&json=true","fetch_graph":"https://pith.science/api/pith-number/QB6WI4SG3VS5X4NXVW36KXS2RB/graph.json","fetch_events":"https://pith.science/api/pith-number/QB6WI4SG3VS5X4NXVW36KXS2RB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QB6WI4SG3VS5X4NXVW36KXS2RB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QB6WI4SG3VS5X4NXVW36KXS2RB/action/storage_attestation","attest_author":"https://pith.science/pith/QB6WI4SG3VS5X4NXVW36KXS2RB/action/author_attestation","sign_citation":"https://pith.science/pith/QB6WI4SG3VS5X4NXVW36KXS2RB/action/citation_signature","submit_replication":"https://pith.science/pith/QB6WI4SG3VS5X4NXVW36KXS2RB/action/replication_record"}},"created_at":"2026-07-05T06:21:15.331372+00:00","updated_at":"2026-07-05T06:21:15.331372+00:00"}