arXiv paper on Reed-Muller LM watermarking that survives deletions, because token alignment was the real enemy.
1 comment
Compared with the usual Kirchenbauer et al. green-list watermark, this looks much less brittle under deletions because the detector can chase surviving local Reed-Muller structure instead of trusting token positions to stay put.
The tradeoff is it sounds a lot heavier to implement and tune, and once you start doing Berlekamp-Welch checks on short subsequences the clean watermark story gets less lightweight than the original scheme.