- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper designs a new multi-bits LLM watermark method named SimpleMark that explicitly controls per-key distributional distortion using -divergence constraints. It combines LDPC coding, simplex-based token mapping, and divergence-constrained probability reweighting for watermark embedding, along with maximum-likelihood decoding for message recovery. The paper also investigates the trade-off between embedding capacity, recovery reliability, and statistical detectability.
Critical strengths
-
Clear motivation. The paper highlights the limitations of average-key distortion-freeness and introduces explicit per-key divergence constraints.
-
Simple and theoretically grounded design. The proposed probability reweighting admits an efficient solution under TV and KL divergence constraints, supported by theoretical analysis.
-
Comprehensive quality evaluation. Experiments on two LLMs demonstrate competitive message recovery while maintaining low distributional distortion, perplexity, and reasoning performance.
Critical weaknesses
-
Restrictive decoding assumptions. The decoding method requires access to both the original LLM and the generation prompt, limiting its practicality for practical commercial LLMs.
-
Limited comparisons with recent work. The experimental baselines are limited to BiMark and ArcMark. Several recent methods, including PURA [1], EBEW [2], MC²Mark [3], MirrorMark [4], StealthInk [5], QuantileMark [6], and XMark [7], are not evaluated. In particular, PURA [1] also considers model-assisted verification using smaller surrogate LLMs, making it a relevant baseline.
-
Insufficient robustness evaluation. Robustness is a crucial property of text watermarking, yet it receives limited attention in this paper. The evaluation is restricted to random token substitution and is presented only in the appendix. Other common attacks, such as token insertion, deletion, and LLM paraphrasing, are not considered.
-
Limited payload scalability. The maximum evaluated payload is only 16 bits, substantially smaller than those considered in several recent works (e.g., 64 bits in EBEW [2]). Moreover, the exhaustive ML decoder has exponential complexity in the payload length, while no runtime comparisons are provided to demonstrate its scalability.
[1] Wang et al. (2026). PURA: Provably Unbiased and Robust Multi-Bit Watermarking for AI-Generated Text Attribution. ACM CCS 2026.
[2] Gloaguen et al. (2026). Every Bit, Everywhere, All at Once: A Binomial Multibit LLM Watermark. NeurIPS 2026.
[3] Cui et al. (2026). MC²Mark: Distortion-Free Multi-Bit Watermarking for Long Messages.
[4] Jiang et al. (2026). MirrorMark: Generalizable Mirrored Sampling for Multi-bit LLM Watermarking.
[5] Jiang et al. (2025). StealthInk: A Multi-bit and Stealthy Watermark for Large Language Models. ICML 2025.
[6] Zhu et al. (2026). QuantileMark: A Message-Symmetric Multi-bit Watermark for LLMs. ACL 2026.
[7] Xu et al. (2026). XMark: Reliable Multi-Bit Watermarking for LLM-Generated Texts. ACL 2026.
Questions for authors
-
Practical decoding performance. Could the authors evaluate decoding with surrogate LLMs of different sizes or architectures, as well as without the original prompt? Would the proposed method remain effective under these more realistic settings?
-
Selection of baselines. Why are BiMark and ArcMark selected as the only experimental baselines? Could the authors include comparisons with more recent methods [1–7], particularly PURA [1] and QuantileMark [6], which also consider model-assisted verification?
-
Novelty of the distortion analysis. Prior work [8] has also discussed the limitations of marginal distortion-freeness (distribution preservation averaged over secret keys), as well as KL divergence and perplexity as distortion measures. Could the authors clarify what new theoretical insights their per-key formulation provides beyond this prior work?
[8] Cai et al. (2026). Towards Better Statistical Understanding of Watermarking LLMs. Journal of the American Statistical Association (JASA), 121(553), 247–258. https://doi.org/10.1080/01621459.2026.2618290
Review acknowledgement
Thank you for your review. Please find a brief response addressing your concerns.
Due to our limited distribution shift from our f-divergence security definition, we require more information and parameters in general to perform decoding. Other definitions of distortion freeness are able to shift the distribution more (over an average for example) and bias towards singular desired tokens more frequently. As solved for in this paper, this leads to more per step distortion and larger capacity.
In practice, from discussions it seems commercial LLMs are also focused on embedding overhead and distortion freeness, rather than decoding or detecting watermarks
Also, thank you for pointing us towards additional relevant work. In our manuscript we mention that we benchmark against watermarks that have publicly available implementations and are distortion free to some respect. Other watermarking papers include 2-3 baselines. We apologize since we could not realistically benchmark seven multibit watermarks in this discussion period.
We include fundamental differences between watermarks’ distortion guarantee and other literature requested below.
[1] establishes computational indistinguishability over only a randomly sampled key for a single generation.
[2] is distribution preserving in expectation over messages.
[3] optimizes the KL distortion measure for average zero bit detection constraints with asymptotic guarantees.
In our work we have an explicit per key f-divergence guarantee that holds for every realized key and message in a multi-bit watermarking setting. As mentioned above, the properties in [1][2] allow for more distortion at each individual step and larger capacity.
Thank you again for your review. We hope we are able to clarify fundamental concerns you may have.
References
[1] Wang et al. PURA: Provably Unbiased and Robust Multi-Bit Watermarking for AI-Generated Text Attribution. ACM CCS 2026.
[2] Zhu et al. QuantileMark: A Message-Symmetric Multi-bit Watermark for LLMs. ACL 2026.
[3] Cai et al. Towards Better Statistical Understanding of Watermarking LLMs. Journal of the American Statistical Association 2026