- Rating
- 4
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper mainly studies how to dynamically determine the number of bits embedded at each next-token prediction step in multi-bit LLM watermarking. The authors first propose choosing this number according to the mutual information between the message block and the next token. Since this requires expensive computation, they then propose a simpler rule based on the entropy of the original next-token distribution. Both methods aim to improve the trade-off between message recovery and text quality.
Critical strengths
-
The paper is generally well written and easy to follow. I can get the main intuition of the algorithm clearly from reading the paper.
-
The topic is interesting and of practical importance. I think studying this problem can help achieve a better trade-off between watermark strength and text fidelity.
Critical weaknesses
1.The descriptions of related work are unclear and even not correct in several places and sometimes terminology that do not appear in the original papers is used.
For example, the paper said "XMark adds ∼1.2 s from its reinforcement-based logit search", however, when I read the original paper, I do not understand what this refers to. The word "reinforcement" even does not appear in the original paper.
Another example is, the paper said that "Model-based detection (StealthInk, EWP-L, EWP-DF, DepthW, MMIP-L, MMIP-DF) must re-run the model on the observed prefix to recover per-step distributions." However, among these papers, my understanding is that at least StealthInk does not require re-run the model.
- The novelty claimed in this paper is not fully supported. For example, the Entropy-Based Watermark Payload is claimed as one of the contributions of this work. However, I think similar idea already appears in a paper "PURA: Provably Unbiased and Robust Multi-Bit Watermarking for AI-Generated Text Attribution", which is already accepted by ACM CCS 2026. This paper should have been cited and discussed in depth in the manuscript.
Questions for authors
Could the authors cite and discuss in detail the relationship between this work and “PURA: Provably Unbiased and Robust Multi-Bit Watermarking for AI-Generated Text Attribution” (https://arxiv.org/abs/2608.22218)? I understand the two papers might be finished around the same time, so I do not think this missing comparison is a reason to reject the paper. However, it would be helpful to explain in more detail how the two papers are similar and how they differ.
Also, could the authors check again their descriptions of previous methods against the original papers to ensure they are accurate?
Dear Reviewers,
As the discussion deadline (Nov 18, AoE) approaches, please review the authors' rebuttal if you have not done so, and post a follow-up indicating whether your main concerns have been addressed or whether any issues remain.
Best,
AC