- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes UniCoMark, which first encodes the payload with a linear error-correcting code and distributes codeword bits across token positions through seed-dependent routing. During generation, an optimal-transport sampler minimizes the Hamming mismatch between token labels and watermark labels while preserving the host token distribution. During detection, routed observations are aggregated into soft reliability scores and decoded with ordered statistics decoding. Experiments on two LLMs show strong exact message recovery under clean and text-editing settings while maintaining competitive text quality.
Critical strengths
- The proposed method UniCoMark is technically sound. The use of error-correcting coding (ECC), repeated bit routing, soft decoding, and optimal-transport sampling provides a clear and technically coherent framework for multi-bit watermarking.
- The experimental results are strong across multiple models and datasets. UniCoMark achieves high exact message recovery under both clean and text-editing settings.
Critical weaknesses
-
The contribution of ECC to the strong exact-message recovery remains unclear. UniCoMark uses a codeword length of N_c=2r, but the manuscript does not report a no-ECC setting. Such an ablation would help separate the gains from error-correcting redundancy, repeated routing, and the proposed sampling strategy.
-
The PPL evaluation uses Qwen3-14B as the only oracle model for both Llama and Gemma generations. The manuscript should clarify whether this cross-model PPL reliably reflects the quality degradation of the corresponding host models.
Questions for authors
-
Could the authors evaluate PPL using a larger model from the same model family? For example, Llama-3.1-70B could be used to evaluate generations from Llama-3.1-8B.
-
Could the authors clarify the difference between UniCoMark and prior work that also uses optimal transport, such as ArcMark [1]?
-
Could the authors compare UniCoMark with more recent multi-bit watermarking methods, such as XMark [2]?
-
Could the authors quantify the contribution of the ECC for UniCoMark? Additionally, applying similar ECC to the existing method will also help readers understand its role.
Reference: [1] ArcMark: Distortion-Free Multi-Byte LLM Watermark via Optimal Transport. [2] XMark: Reliable Multi-Bit Watermarking for LLM-Generated Texts.
4 comments
Response to Reviewer pQ44 (2/2)
Q2. Differences between UniCoMark and ArcMark
We already cited ArcMark in the paper. Although both methods use OT sampling, their starting points differ: ArcMark emphasizes distortion-free channel capacity and rate [3], while UniCoMark targets robust finite-length message recovery under textual edits. These objectives motivate different choices in codeword construction, evidence aggregation, and decoding. As already described in Sec. 3 and Appendices B–C, UniCoMark co-designs embedding–extraction and sampling by deriving its OT cost from a recovery-margin objective. This codeword design supports the following advantages in robustness and decoding scalability.
Robustness objective. ArcMark scores context-dependent random-linear-code symbols for each candidate message [3]. In contrast, UniCoMark targets finite-length exact-message recovery under textual edits, using a fixed codeword as the shared target of embedding and extraction. Local-context routing maps surviving valid observations to its coordinates, where repeated evidence is aggregated into soft reliabilities for joint ECC recovery. Edits change the available evidence while the codeword constraints remain fixed, enabling structured recovery from partially preserved text. Our analysis connects recovery to useful observations , noisy observations , and sampling mismatch , supported by token- and sentence-level mixed-edit and paraphrasing experiments.
Sampling objective. ArcMark minimizes angular distance on a circle under the token-marginal constraint [3, Eq. (5)]. UniCoMark instead derives its Hamming transport cost from a one-step recovery-margin loss under the uniform competing-target assumption (Appendix C), subject to the host-marginal constraint. Our sampling objective is therefore directly aligned with the binary evidence used in codeword recovery, with the resulting flip rate explicitly incorporated in our recovery theorem.
Decoding scalability. ArcMark's published Algorithm 2 exhaustively scores all candidate messages for an -bit payload [3]. UniCoMark instead aggregates observations into a fixed-length reliability vector and applies structured decoding, such as OSD. OSD-2 tests only candidate codewords (Appendix B, Eq. (21)). At 32 bits, this is 4,294,967,296 versus 529 candidates—an approximately 8.1-million-fold reduction in candidate count. This replaces exponential candidate growth with quadratic growth. ArcMark reports evaluations up to 32 bits [3, Sec. 5.1], whereas our payload-scaling experiments extend to 256 bits (Fig. 4(a)). Our supplementary 16-bit and 24-bit comparisons show close agreement between OSD-2 and exact ML near the recovery boundary.
Q3. Comparison with XMark
We added XMark [4] as a baseline at in the revised paper. Tables 2 and 3 (Sec. 5.1) compare message recovery across payload sizes and text lengths. For example, on ASAP-essay with Gemma-2-9B, UniCoMark at recovers 81.6% of 32-bit messages from 256 tokens, compared with 15.62% for XMark, with PPL values of 10.26 and 9.98, respectively (Table 2).
| Method | Message accuracy ↑ | PPL ↓ |
|---|---|---|
| XMark, | 15.62% | 9.98 |
| UniCoMark, | 81.6% | 10.26 |
| UniCoMark, | 98.8% | 11.27 |
Tables 16–19 (Appendix I.3) report message accuracy and bit accuracy for each model and dataset across all tested payload sizes and text lengths. Table 20 (Appendix I.4) reports PPL at 64, 128, 256, and 512 tokens.
For summarization and translation, Table 4 (Sec. 5.1) reports task quality and Table 22 (Appendix I.6) reports 4-bit message recovery. Figure 5 and Table 7 (Sec. 5.2) show recovery under mixed edits and paraphrasing, respectively. Tables 23 and 24 (Appendix I.7) give separate results for insertions, deletions, and replacements at the token and sentence levels.
References
[3] Atefeh Gilani, Sajani Vithana, Carol Xuan Long, Oliver Kosut, Lalitha Sankar, and Flavio P. Calmon. ArcMark: Distortion-Free Multi-Byte LLM Watermark via Optimal Transport. arXiv preprint arXiv:2602.07235v2, 2026.
[4] Jiahao Xu, Rui Hu, Olivera Kotevska, and Zikai Zhang. XMark: Reliable Multi-Bit Watermarking for LLM-Generated Texts. ACL, pp. 14747–14763, 2026. Official implementation: JiiahaoXU/XMark.
I appreciate the authors' responses, which have answered my questions. I have increased my score to 3.
Thank you for reconsidering our paper. Your suggestions to add XMark as a baseline and clarify the ECC ablation helped us strengthen the comparison and show more clearly how much ECC contributes to message recovery.
Response to Reviewer pQ44 (1/2)
We thank the reviewer for recognizing the technical coherence and empirical recovery performance of UniCoMark.
W1/Q4. ECC contribution and results on no-ECC setting.
ECC introduces redundant constraints across codeword coordinates, allowing the decoder to recover the message jointly from noisy or incomplete observations. Our soft decoder uses the reliability of each coordinate to exploit this redundancy.
Table 6 of the submitted paper compares four combinations of sampling and recovery. Here, we further report the exact-message recovery results under no-ECC, explicitly distinguishing the effects of routing and error correction.
In the comparison above, the first, fourth, fifth, and sixth rows match the configurations SB+EB, SU+EB, SB+EU, and SU+EU in the submitted Table 6. The two additional controls isolate routing without ECC.
The ablations show that routing, sampling, and coded recovery each improve message recovery. ECC improves recovery with both our sampler and the existing BiMark sampler. With uniform routing fixed, adding ECC and its corresponding decoder raises message recovery from 66.60% to 87.50% (+20.90 percentage points) for BiMark and from 75.59% to 97.27% (+21.68 percentage points) for OT.
W2/Q1. PPL evaluation with a larger same-family model
Choice of the original evaluator. Using a separate, larger PPL evaluator follows prior watermarking work. BiMark [1, Sec. 5.1] evaluates Llama3-8B generations with Gemma-9B, explicitly selecting an oracle with more parameters. Our use of Qwen3-14B-Base as a common evaluator for Llama and Gemma follows this practice.
Same-family validation. We additionally evaluate Gemma-2-9B generations on C4 RealNewsLike using Gemma-2-27B Base, providing the requested larger same-family check. The table reports median PPL; lower is better.
With the same-family evaluator, UniCoMark at s=0.6 remains close to Plain: 6.652 versus 6.593, approximately a 0.9% increase. All three UniCoMark settings retain lower PPL than BiMark and the δ=2 MPAC/SegMark settings under both evaluators. These comparisons therefore remain consistent under the larger same-family oracle. We report each oracle's scores separately because their absolute PPL scales differ.
References
[1] Xiaoyan Feng, He Zhang, Yanjun Zhang, Leo Yu Zhang, and Shirui Pan. BiMark: Unbiased Multilayer Watermarking for Large Language Models. ICML, 2025.