- Rating
- 4
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies a watermarking method named ClockMark. For each one token context , each candidate token has a countdown , which decreases at rate . The first countdown to reach zero determines the next token: The selected pair then receives a fresh interval, while the others retain their updated remaining values and resume when the context reappear. The watermark decoder calculates the sum of the vectors reconstructed from distinct adjacent token pairs and recovers each message bit from the sign of the corresponding component.
The authors provide theoretical arguments and conduct experiments on Qwen2.5-7B-Instruct and Gemma-2-9B. Robustness is evaluated against deletion, substitution, and paraphrasing.
Critical strengths
The proposed method is intuitive and easy to understand.
The experiments seem to show good robustness to deletion, substitution, and paraphrasing compared with the baseline. The method in this paper is supported with both theoretical analysis of distribution preservation and false-positive control, and experimental results.
Critical weaknesses
For the robustness evaluation, the authors should also consider cropping attacks, for example by removing the first 10%, 30%, or 50% of the generated text and evaluating message recovery and watermark detection on the remaining text. This additional evaluation is needed because the detector in the current paper uses only the initial vector for each distinct token pair. It seems to be unclear how reliably the method can detect the watermark after the beginning of the text is removed.
Questions for authors
None
Dear Reviewer K1AJ,
Thank you again for your valuable comments! We have carefully considered your comments and have provided our responses.
We would greatly appreciate it if you could let us know if our replies have satisfactorily addressed your issues. If you have any further questions or need additional clarification, please do not hesitate to reach out.
Thank you very much for your time and consideration.
Best regards,
Authors