Pith. sign in

REVIEW 1 cited by

Watermarking Language Models with Error Correcting Codes

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.10281 v6 pith:JAMUAQDG submitted 2024-06-12 cs.CR cs.CLcs.LG

classification cs.CRcs.CLcs.LG
keywords watermarkwatermarkingmodelsrobustcodecorrectingerrorlanguage
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Recent progress in large language models enables the creation of realistic machine-generated content. Watermarking is a promising approach to distinguish machine-generated text from human text, embedding statistical signals in the output that are ideally undetectable to humans. We propose a watermarking framework that encodes such signals through an error correcting code. Our method, termed robust binary code (RBC) watermark, introduces no noticeable degradation in quality. We evaluate our watermark on base and instruction fine-tuned models and find that our watermark is robust to edits, deletions, and translations. We provide an information-theoretic perspective on watermarking, a powerful statistical test for detection and for generating $p$-values, and theoretical guarantees. Our empirical findings suggest our watermark is fast, powerful, and robust, comparing favorably to the state-of-the-art.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimized Couplings for Watermarking Large Language Models

    cs.CR 2025-05 conditional novelty 6.0 of 10

    For one-shot token watermarking with a min-entropy constraint, the authors derive a closed-form max-min detection rate and show that a correlated channel with balanced random partitions achieves it.

Pith tools