Pith. Sign in

RECORD

Baselines for Identifying Watermarked Large Language Models

Machine Learning · Submitted 29 May 2023

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Notably, watermarked LLMs tend to produce distributions that diverge qualitatively and identifiably from standard models.

how it is stated · asserted 0.75 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2305.18456 (version 1)
Pith ID4WGTNDTT, Pith's permanent record of this paper and its review
CitationGavin Uberti, Leonard Tang, Tom Shlomi. "Baselines for Identifying Watermarked Large Language Models." arXiv:2305.18456 (2023). https://pith.science/paper/4WGTNDTT
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,358 input tokens.

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.25 · human participants 0.04 · controlled comparison 0.77 · randomized assignment 0.02 · states quantitative result 0.04 · compares with prior results 0.24 · mentions code or data availability 0.03.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We consider the emerging problem of identifying the presence and use of watermarking schemes in widely used, publicly hosted, closed source large language models (LLMs). We introduce a suite of baseline algorithms for identifying watermarks in LLMs that rely on analyzing distributions of output tokens and logits generated by watermarked and unmarked LLMs. Notably, watermarked LLMs tend to produce distributions that diverge qualitatively and identifiably from standard models. Furthermore, we investigate the identifiability of watermarks at varying strengths and consider the tradeoffs of each of our identification mechanisms with respect to watermarking scenario. Along the way, we formalize the specific problem of identifying watermarks in LLMs, as well as LLM watermarks and watermark detection in general, providing a framework and foundations for studying them.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We consider the emerging problem of identifying the presence and use of watermarking schemes in widely used, publicly hosted, closed source large language models (LLMs). background 0.95 0.12 0.04 asserted 0.76
s1 We introduce a suite of baseline algorithms for identifying watermarks in LLMs that rely on analyzing distributions of output tokens and logits generated by watermarked and unmarked LLMs. contribution 0.84 0.94 0.13 asserted 0.99
s2 Notably, watermarked LLMs tend to produce distributions that diverge qualitatively and identifiably from standard models. result 0.99 0.71 0.35 asserted 0.75
s3 Furthermore, we investigate the identifiability of watermarks at varying strengths and consider the tradeoffs of each of our identification mechanisms with respect to watermarking scenario. contribution 0.97 0.92 0.10 asserted 0.76
s4 Along the way, we formalize the specific problem of identifying watermarks in LLMs, as well as LLM watermarks and watermark detection in general, providing a framework and foundations for studying them. contribution 1.00 0.93 0.10 asserted 1.00

What kind of paper the classifier reports this is: method or tool 0.99 · evidence from observation or experiment 0.89.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We consider the emerging problem of identifying the presence and use of watermarking schemes in widely used, publicly hosted, closed source large language models (LLMs). We introduce a suite of baseline algorithms for identifying watermarks in LLMs that rely on analyzing distributions of output tokens and logits generated by watermarked and unmarked LLMs. Notably, watermarked LLMs tend to produce distributions that diverge qualitatively and identifiably from standard models. Furthermore, we investigate the identifiability of watermarks at varying strengths and consider the tradeoffs of each of our identification mechanisms with respect to watermarking scenario. Along the way, we formalize the specific problem of identifying watermarks in LLMs, as well as LLM watermarks and watermark detection in general, providing a framework and foundations for studying them.

Human review
References
How the literature uses it

1 arXiv paper cite this in 1 sentence

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it

Cites it as background 1 paper
  • This includes the design of benchmark tasks and metrics to test the quality of watermarks [ref] , some with a special focus on text quality [ref] or robustness [ref] .

    Optimizing watermarks for large language models · Related work · 0.99

What it cites · 5 sentences without a confident label

Uses the method or tool of 1 paper
  • Consider the watermark $W_s$ from [ref] that generates a pseudorandom number $r ∈[0,1]$ by applying $f_s$ to the previous tokens.

    A Watermark for Large Language Models · Watermarks on Large Language Models · 0.91

Cites as support 1 paper
  • Though other watermarks are less sensitive to changes to the text, all known watermarks are vulnerable to attacks that preserve generated text quality while evading detection [ref] .

    Can AI-Generated Text be Reliably Detected? · Watermarks on Large Language Models · 0.97

Cites as background 2 papers

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.