Score: 0

HATS: High-Accuracy Triple-Set Watermarking for Large Language Models

Published: December 22, 2025 | arXiv ID: 2512.19378v1

By: Zhiqing Hu , Chenxu Zhao , Jiazhong Lu and more

Potential Business Impact:

Marks computer writing so you know it's from a machine.

Business Areas:
Text Analytics Data and Analytics, Software

Misuse of LLM-generated text can be curbed by watermarking techniques that embed implicit signals into the output. We propose a watermark that partitions the vocabulary at each decoding step into three sets (Green/Yellow/Red) with fixed ratios and restricts sampling to the Green and Yellow sets. At detection time, we replay the same partitions, compute Green-enrichment and Red-depletion statistics, convert them to one-sided z-scores, and aggregate their p-values via Fisher's method to decide whether a passage is watermarked. We implement generation, detection, and testing on Llama 2 7B, and evaluate true-positive rate, false-positive rate, and text quality. Results show that the triple-partition scheme achieves high detection accuracy at fixed FPR while preserving readability.

Page Count
5 pages

Category
Computer Science:
Computation and Language