CORE-BREW is a new multi‑bit watermarking method for large language models that uses log‑likelihood ratios for soft‑decision decoding, targeting a fixed hit rate to calibrate the watermark channel. It introduces entropy‑aware erasures to reduce perturbations in low‑entropy contexts and combines likelihood‑based scoring with soft‑decision list decoding to better exploit token‑level reliability. Experiments on open‑source LLMs show that CORE‑BREW improves detection robustness and payload recovery compared to the BREW baseline while keeping false‑positive rates low and maintaining translation quality metrics close to unwatermarked text.
By Joeun Kim, HoEun Kim, Young-Sik Kim
arXiv:2609.38722v1 Announce Type: cross
Abstract: LLM watermarking has become an effective approach to distinguishing AI-generated text from human-written text by embedding detectable patterns during...
By Zewei Deng, Muhammad Siddeek, Liyan Xie, Mohamed Seif, Mengdi Wang, H. Vincent Poor, Andrea Goldsmith
arXiv:2606. 18430v1 Announce Type: new Abstract: Statistical watermarks help organizations attribute large language model (LLM) outputs, yet existing detectors often struggle when watermark signals are weak, texts are repetitive, or watermarks are edited.
By Chih-Duo Hong, Yen-Pang Chen, Fang Yu
arXiv:2608.29575v1 Announce Type: new
Abstract: Large language models are increasingly used to read documents and produce downstream text, creating a provenance problem when the document owner cannot...
By Junyan Zhang, Yudong Zeng, Yongwei Huang, Zuhao Ouyang, Hong Chen, Xuming Hu
arXiv:2608.27899v1 Announce Type: cross
Abstract: With the growing prevalence of large language model (LLM) generated content, watermarking is considered a promising approach for attributing text to...
By Miroojin Bakshi, Saksham Rastogi, Danish Pruthi
The paper introduces an adaptive embedding displacement attack (EDA) that exploits rewording, reordering, and resegmentation to remove semantic watermarks from text, achieving a 32.6%–47.9% success rate across four watermarking schemes. To counter this, the authors propose k‑SwordStamp, a semantic watermarking method that uses order‑robust detection over sub‑sentence units, significantly reducing vulnerability to structure‑based edits. Experiments show that EDA remains effective against k‑SwordStamp, but with a lower success rate (10.8%) compared to its performance on other schemes.
By Abdulrahman Diaa, Jonathan Petit, Florian Kerschbaum