SemTrace: Source-Grounded Semantic Signatures for Tracing LLM Exposure to Protected Documents
Organizations: The Hong Kong University of Science and Technology (Guangzhou), Guangzhou, China · Bosum Institute of Management Science, Shenzhen, China
Abstract
Large language models are increasingly used to read documents and produce downstream text, creating a provenance problem when the document owner cannot control or inspect the model that performs the generation. We introduce SemTrace, a source-grounded semantic watermark for detecting whether a generated review was influenced by a known protected manuscript copy. Rather than biasing token probabilities or imposing surface-form patterns, SemTrace constructs a document-specific binary signature from factual propositions that are directly supported by the manuscript itself. A protected PDF invisibly carries a content contract that selects one fact from each binary pair and asks an instruction-following reviewer to express those facts in fixed review slots without changing its independent evaluation. A frozen natural language inference model then decodes the resulting semantic evidence with explicit erasures and scores the recovered bits against the codeword assigned to that copy. This design targets model-agnostic, assigned-copy exposure detection while keeping the watermark semantically tied to the source document.
Figures & tables
| ICML 2023 | ICLR 2024 | |
|---|---|---|
| ROC-AUC | 1.000 | 0.990 |
| 95% cluster CI | [1.000, 1.000] | [0.970, 1.000] |
| Zero-FPR TPR | 1.00 | 0.98 |
| Positive observed bits | 10.76 | 10.84 |
| Control observed bits | 1.46 | 1.26 |
| Positive bit accuracy | 1.0000 | 0.9945 |
| Dataset | Attack | ROC-AUC | TPR@clean thr. | Obs. bits |
|---|---|---|---|---|
| ICML 2023 | Neutral | 0.880 | 0.68 | 9.06 |
| ICML 2023 | Adaptive | 0.990 | 0.98 | 10.18 |
| ICLR 2024 | Neutral | 0.960 | 0.92 | 9.50 |
| ICLR 2024 | Adaptive | 0.980 | 0.94 | 10.64 |
Data Provenance Auditing of Fine-Tuned Large Language Models with a Text-Preserving Technique
marks'' using invisible Unicode characters organized into (cue'', reply'') pairs. During an audit, prompts containing only cue'' fragments are issued to trigger regurgitation of the corresponding ``reply'', indicating document usage. To control false positives, we compare against held-out counterfactual marks and apply a ranking test, yielding a verifiable bound on the false positive rate. Empirically, we obtain a true positive rate of 96.7% at 0% false positive rate and reply regurgitation rates exceeding 28% per document with only 40 (4%) watermarked documents. The approach is minimally invasive, scalable across many sources, robust to standard processing pipelines, and achieves high detection power even when marked data is a small fraction of the fine-tuning corpus.