{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T14:24:12Z","timestamp":1769178252547,"version":"3.49.0"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3653833","type":"journal-article","created":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T20:59:51Z","timestamp":1768337991000},"page":"9319-9339","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Robust Watermarking for Large Language Models via Dynamic Token Embedding Perturbation"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-0330-4411","authenticated-orcid":false,"given":"Ziyang","family":"Zeng","sequence":"first","affiliation":[{"name":"New York University, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5165-9264","authenticated-orcid":false,"given":"Han","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Wisconsin–Madison, Madison, WI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6779-5636","authenticated-orcid":false,"given":"Shuxin","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6474-1315","authenticated-orcid":false,"given":"Boyuan","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Southern California, Los Angeles, CA, USA"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1877","article-title":"Language models are few-shot learners","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Brown"},{"key":"ref2","article-title":"GPT-4 technical report","volume-title":"arXiv:2303.08774","author":"Achiam","year":"2023"},{"key":"ref3","article-title":"LLaMA: Open and efficient foundation language models","author":"Touvron","year":"2023","journal-title":"arXiv:2302.13971"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3571502"},{"key":"ref5","article-title":"Release strategies and the social impacts of language models","author":"Solaiman","year":"2019","journal-title":"arXiv:1908.09203"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3442188.3445922"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.54097\/7ysr5k17"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.coling-main.208"},{"key":"ref9","article-title":"Automatic detection of generated text is easiest when humans are fooled","author":"Ippolito","year":"2019","journal-title":"arXiv:1911.00650"},{"key":"ref10","first-page":"17061","article-title":"A watermark for large language models","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Kirchenbauer"},{"key":"ref11","volume-title":"Watermarking GPT Outputs","author":"Aaronson","year":"2023"},{"key":"ref12","article-title":"Provable robust watermarking for AI-generated text","author":"Zhao","year":"2023","journal-title":"arXiv:2306.17439"},{"key":"ref13","article-title":"Robust distortion-free watermarks for language models","author":"Kuditipudi","year":"2023","journal-title":"arXiv:2307.15593"},{"key":"ref14","first-page":"24950","article-title":"DetectGPT: Zero-shot machine-generated text detection using probability curvature","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mitchell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/p19-3019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS58808.2023.10374576"},{"key":"ref17","article-title":"Undetectable watermarks for language models","author":"Christ","year":"2023","journal-title":"arXiv:2306.09194"},{"key":"ref18","article-title":"Certifying language model robustness with fuzzed randomized smoothing: An efficient defense against backdoor attacks","volume-title":"Proc. 13th Int. Conf. Learn. Represent.","author":"He"},{"key":"ref19","article-title":"On the reliability of watermarks for large language models","author":"Kirchenbauer","year":"2023","journal-title":"arXiv:2306.04634"},{"key":"ref20","article-title":"Paraphrasing evades detectors of AI-generated text, but retrieval is an effective defense","author":"Krishna","year":"2023","journal-title":"arXiv:2303.13408"},{"key":"ref21","article-title":"Can AI-generated text be reliably detected?","author":"Sadasivan","year":"2023","journal-title":"arXiv:2303.11156"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.emnlp-main.1005"},{"key":"ref23","article-title":"A semantic invariant robust watermark for large language models","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Liu"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-long.226"},{"key":"ref25","article-title":"Mark my words: Analyzing and evaluating language model watermarks","author":"Piet","year":"2023","journal-title":"arXiv:2312.00273"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2025.3599787"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-acl.683"},{"key":"ref28","article-title":"WatME: Towards lossless watermarking through lexical redundancy","author":"Wu","year":"2024","journal-title":"arXiv:2311.09832"},{"key":"ref29","article-title":"Revealing weaknesses in text watermarking through self-information rewrite attacks","author":"Liu","year":"2024","journal-title":"arXiv:2505.05190"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-long.117"},{"key":"ref31","article-title":"PASER: Post-training data selection for efficient pruned large language model recovery","author":"He","year":"2025","journal-title":"arXiv:2502.12594"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-024-08025-4"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3691626"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.naacl-long.226"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-naacl.40"},{"key":"ref36","first-page":"8452","article-title":"Bypassing LLM watermarks with color-aware substitutions","volume-title":"Proc. 62nd Annu. Meeting Assoc. Comput. Linguistics","author":"Shi"},{"key":"ref37","article-title":"RLCracker: Exposing the vulnerability of LLM watermarks with adaptive RL attacks","author":"Pan","year":"2025","journal-title":"arXiv:2509.20924"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-long.630"},{"key":"ref39","article-title":"An unforgeable publicly verifiable watermark for large language models","author":"Liu","year":"2023","journal-title":"arXiv:2307.16230"},{"key":"ref40","article-title":"Towards codable watermarking for injecting multi-bits information to LLMs","author":"Wang","year":"2023","journal-title":"arXiv:2307.15992"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.71129\/ijaci.v1.i1.pp39-47"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.71129\/ijaci.v1.i2.pp89-98"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.71129\/ijaci.v2i1.pp41-52"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.71129\/ijaci.v2i1.pp62-74"},{"key":"ref45","article-title":"The curious case of neural text degeneration","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Holtzman"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.acl-long.83"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.emnlp-demo.7"},{"key":"ref48","article-title":"Mistral 7B","author":"Albert","year":"2023","journal-title":"arXiv:2310.06825"},{"key":"ref49","article-title":"Gemma: Open models based on Gemini research and technology","author":"Team","year":"2024","journal-title":"arXiv:2403.08295"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.findings-acl.327"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11348107.pdf?arnumber=11348107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:03:24Z","timestamp":1769115804000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11348107\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3653833","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}