SAMark: A Self-Anchored Text Watermarking with Paragraph-Level Paraphrase Robustness

arXiv:2605.25796 · cs.CR, cs.AI, cs.CL · Submitted 2026-05-25 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Security Radio. Generated commentary on the latest security and cryptography papers.

Nadia: We're looking at the paper: "SAMark: A Self-Anchored Text Watermarking with Paragraph-Level Paraphrase Robustness".

Elias: Here's the gist of the paper. Semantic-level watermarking (SWM) methods are proposed to achieve robustness against paragraph-level paraphrasing attacks by establishing a step-independent green region in semantic space The authors introduce SAMARK, a self-anchored watermarking framework that removes the dependency on sentence order by establishing a step-independent green region in semantic space This work addresses the challenge of achieving robustness to paragraph-level paraphrasing attacks (PPA), which globally disrupt watermark signals by changing sentence order SAMARK improves detectability through a multi-channel hyperbolic scoring mechanism that amplifies watermark signals while suppressing noise from weakly aligned candidates Problem Formulation and Invariance The vulnerability of existing watermarking schemes stems from their reliance on step-dependent random seeds The authors identify that the intrinsic semantic content of each unit is the most reliable invariant under such attacks, motivating a shift away from step-dependent seed generation This insight leads to the self-anchored paradigm, where the random seed depends solely on the unit’s own semantics, i.e., rt = R(ϕ(ut); k) SAMARK Framework Components The proposed framework SAMARK is built upon three key components 1.

Nadia: A theoretically grounded self-anchored constraint that establishes a step-independent green region This is formalized by the Self-Anchored Condition (SAC), which ensures that the random seed rt = R(ut; k) and the partition Gt = P(omega; rt) depend exclusively on the current unit ut and the fixed key k 2.

Elias: A multi-channel hyperbolic scoring mechanism that amplifies robust watermark signals for improved detectability This mechanism uses a hyperbolic tangent transform to amplify candidates with strong channel alignment while suppressing near-zero noise 3.

Nadia: A diversity-aware filtering strategy that maintains text quality without sacrificing robustness This strategy combines hard filtering (n-gram and semantic filters) with soft regularization terms (semantic diversity and vocabulary novelty bonuses) to encourage lexical novelty Experimental Validation and Performance Extensive empirical evaluations demonstrate that SAMARK achieves strong robustness under extreme paragraph-level paraphrasing attacks where existing baselines largely fail SAMARK maintains high detectability across various attack scenarios, such as Doc-P II on Mistral-BOOKSUM, achieving 88.1% TP@FP1% Furthermore, the results show that SAMARK preserves generation quality competitive with that of unwatermarked text, effectively narrowing the traditional robustness-quality trade-off The authors demonstrate that SAMARK maintains TP@FP1% above 72% under all attack scenarios across both backbone models Efficiency and Sensitivity Analysis SAMARK achieves a low overall computation overhead among semantic-level methods Its generation latency is 0.22s per token, and its detection latency is only 0.0014s per token, which is over 130 times faster than PMark The authors also conduct a systematic sensitivity analysis on key hyperparameters, confirming that the hard filtering and soft regularization mechanisms are complementary in improving text quality Increasing the sample budget N from 64 to 200 consistently improves detection rates under all attack scenarios, and increasing diversity weights like λdiv and λnov steadily improves metrics such as Distinct-2 Current token-level and semantic-level watermarking methods are vulnerable to paragraph-level paraphrasing attacks due to their reliance on context-aware random seeders SAMARK is the first watermarking framework to achieve robustness against paragraph-level paraphrasing, consistently surpassing existing SWM baselines in robustness while maintaining competitive generation quality The self-anchored encoding strategy captures fundamental linguistic invariants rather than model-specific or domain-specific artifacts References

1: J.

Title and authors: Nadia: So we're looking at this paper called SAMARK: A Self-Anchored Text Watermarking with Paragraph-Level Paraphrase Robustness. It tackles the problem that existing semantic watermarking methods, like the ones based on sentences, struggle when paragraphs are paraphrased because changing the sentence order messes up those signals globally.

Elias: Exactly. The authors propose SAMARK as a self-anchored framework that fixes this by setting up a step-independent green region in semantic space. They want to remove that dependency on sentence order entirely so the watermark stays robust regardless of how the text is rearranged.

Priya: From what I can see, they're focusing on making the detection more reliable too, because if the signal gets scrambled by paraphrasing, you need a better way to spot it. They introduce this multi-channel hyperbolic scoring mechanism to amplify strong watermark signals while cutting out noise from candidates that are only weakly aligned.

Nadia: That amplification sounds important for real-world use, because in noisy environments, you can't just rely on a single signal being loud enough. But how do they actually build this green region? It sounds like the core of their method is fixing the randomness issue.

Elias: The paper formalizes this with what they call the Self-Anchored Condition, which sets up a random seed and a partition in semantic space that only depends on the current unit and a fixed key, not on where it sits in the sequence. This is how they ensure that even if you change the order, the underlying structure for generating watermarks stays consistent across every unit.

Priya: But I want to talk about what this actually means for a detector. If we have this robust mechanism, can we detect things without knowing any prior flags? The paper suggests a blind detection capability where the detector infers those flags through majority voting over directional responses and aligning the transformed alignment matrix using a z-test.

Nadia: That would be huge for defense because it means we don't need to know beforehand if something is watermarked to check it. It shifts the burden onto the signal itself to be detectable, which is a good direction for practical security research. But what about keeping the text from looking robotic while making it robust?

Elias: That’s where they bring in a diversity-aware filtering strategy. This combines hard filtering, using things like n-grams and semantic filters to cut out obvious repetition, with soft regularization terms like semantic diversity and vocabulary novelty bonuses. This is meant to encourage the text to have some lexical surprise without sacrificing the core watermark signal.

Priya: So they are trying to balance two opposing forces: keeping the text quality high, which means it sounds natural and diverse, while also ensuring that the detection mechanism isn't fooled by superficial changes in word choice. They are testing this trade-off quite rigorously.

Nadia: And the results show they actually managed to narrow that traditional robustness versus quality tradeoff a lot. They report achieving up to ninety point two percent true positives at one percent false positives under typical paragraph-level paraphrasing attacks, which is significantly better than the strongest prior baseline by more than thirty percent on average.

Elias: That performance metric under PPA is what really stands out, especially considering that previous methods struggled with changing sentence order. The paper shows that SAMARK maintains generation quality competitive with unwatermarked text, which is a big deal for deployment because you don't want to degrade the user experience just for security.

Priya: I like seeing the ablation studies too; they confirmed that every single component of SAMARK, from the hyperbolic scoring to the diversity bonuses, is necessary and contributes something positive to keeping it robust or better quality. Removing any part causes a noticeable drop in post attack true positives, around twenty percent for example.

Nadia: That confirms they didn't just throw some features in; they engineered each piece to serve a specific purpose against these kinds of attacks. So what is the final word on where this research leaves things for future work?

Elias: They discuss potential limitations, and one thing they flag is that the method relies on establishing a globally static green region within the entire space per response. That means its effectiveness might be tied to how well that initial semantic space partition holds up under extremely novel or adversarial paraphrasing schemes they haven't tested yet.

Priya: Another limitation is implied in their structure: it’s focused on sentence-level watermarking, and while it handles paragraph-level changes well, the paper doesn't directly address robustness against even more complex structural alterations beyond simple reordering.

Nadia: Overall though, SAMARK seems to be making a solid step forward by moving away from those step-dependent seeds and proving that semantic invariants can actually provide the necessary foundation for robust watermarking. It’s a practical framework because it maintains quality while improving security against paragraph-level paraphrasing attacks.

Elias: Yes, the paper on SAMARK really pushes the idea that focusing on fundamental linguistic content rather than model-specific artifacts is the right path for securing large language models long term. We'll keep an eye on how they tackle those more complex structural challenges in their next work.

The paper's summary: Nadia: So, to wrap up what we just heard, the paper proposes SAMARK as a new way to watermark text that specifically fights against paragraph paraphrasing attacks by making the watermark independent of sentence order itself.

Elias: Exactly. The core idea they push is moving away from those step-dependent random seeds and anchoring the randomness into the actual meaning of each piece of text, which they call the unit semantics.

Nadia: That means if an attacker just shuffles sentences around in a paragraph, it doesn't totally break the detection signal because SAMARK sets up this consistent green region in semantic space that doesn't care about the sequence.

Elias: Right. And to make sure we can actually find that signal even when it’s scrambled, they added this multi-channel hyperbolic scoring mechanism. It really boosts the strong signals while dampening the noise from candidates that are only vaguely similar to what we’re looking for.

Nadia: I see how that helps in practice, because in a real attack scenario, you don't have a perfect signal; you have lots of weak candidates trying to mimic something. This scoring mechanism is designed to let us pick the best one out of that mess.

Elias: And they pair that up with this diversity-aware filtering strategy. It uses both hard filters, like checking n-grams and semantic similarity, and soft regularization terms—like boosting the novelty of vocabulary—to keep the text sounding natural while still fighting redundancy.

Nadia: So what they show in their experiments is pretty strong. They say SAMARK can hit up to ninety point two percent true positives at one point one percent false positives under typical paragraph paraphrasing attacks, which is a big jump over the previous best methods.

Elias: It’s a significant improvement because it directly tackles the weakness of existing semantic watermarking schemes that rely on context or sentence position being fixed. They manage to keep generation quality pretty close to unwatermarked text while getting this level of robustness.

Nadia: The big implication here for us is that we might be able to deploy watermarks in AI outputs with much more confidence, knowing they won't be completely destroyed by simple reordering attacks.

Elias: And it really reinforces the idea that focusing on fundamental linguistic invariants—the actual meaning—is a better anchor for security than relying on artifacts specific to the model or the exact sequence of tokens.

Nadia: It seems like this moves us closer to having text provenance that’s actually resilient against some fairly common ways people try to tamper with it in a paragraph-level sense.

Elias: It is, and it sets a new benchmark for what we expect from semantic watermarking systems when facing sophisticated paraphrasing attempts.

The paper's improvements: Nadia: So, looking at how SAMARK actually improves things beyond just being robust against reordering, they introduce a whole set of tools to boost detectability and quality simultaneously.

Elias: Right. They focus on three main improvements here: that multi-channel hyperbolic scoring mechanism for amplification, the diversity-aware filtering strategy for text novelty, and then they even suggest a blind detection method.

Nadia: That’s the blind detection thing I was curious about earlier—they say you can infer if something is watermarked by looking at how the detector responds to different directions and then aligning that matrix using a z-test.

Elias: Exactly. It means the detector doesn't need any prior knowledge about which flags are there; it just figures it out from the signal itself, which is a really practical thing for deployment.

Nadia: And the filtering part—combining hard filters like n-grams with soft regularization terms like vocabulary novelty bonuses—they show that this combination actually helps maintain generation quality while fighting off semantic redundancy.

Elias: I agree. It’s not just about cutting out repetitive words; it’s about actively encouraging the AI to use new words and structures, which keeps the output sounding less predictable and more robust against subtle paraphrasing changes.

Nadia: So what this means for me, as someone who thinks about exploitation, is that if we can make detection this good without destroying the natural flow of a response, it makes defending against these kinds of attacks much more realistic.

Elias: It does. And from a cryptographic standpoint, they’re essentially proving that you can anchor your secret signal in something fundamentally stable—the meaning of the text—instead of something unstable like the exact sequence in which those words are written.

Nadia: So we've covered how it works and what makes it better, but I always want to know where this leaves things open for future work. What’s their next challenge?

Elias: They pointed out that while they handle paragraph reordering well, the method still relies on establishing a globally static green region within the entire semantic space for every response. That means its effectiveness might be limited by how well that initial partition holds up against completely novel or very aggressive paraphrasing schemes.

Nadia: So it’s not perfect protection against every single conceivable structural alteration, just paragraph reordering and related issues, but it’s a huge improvement over what we had before.

Elias: It is an improvement that moves the needle on how we secure AI outputs against specific classes of text manipulation.

Conclusion: Nadia: So we've covered how SAMARK tackles paragraph paraphrasing attacks by using self-anchored seeds to keep the watermark robust against sentence reordering and using hyperbolic scoring to boost detectability while maintaining text quality.

Elias: Right, it’s a framework that shifts the randomness dependency away from sequence order and toward intrinsic semantic content, which is a big step for making these watermarks actually reliable.

Priya: I just want to stress that the numbers they report on true positives under attack are pretty impressive compared to previous work, but we need to keep an eye on those caveats regarding the strength of that initial semantic space partition.

Nadia: True, it’s a strong result for robustness against PPA, and it shows that this approach can indeed narrow the gap between security and generation quality.

Elias: It proves that anchoring watermarks in something fundamental like meaning instead of something fragile like sentence position is a viable path forward for securing large language models.

Priya: I just wonder how hard it is to generalize this framework when we move from simple paragraph reordering to more complex, structural alterations in the text.

Nadia: That’s a fair point; it's focused on paragraph level changes, so we need to see if this method holds up against something much more complicated structurally.

Elias: We will have to look at those future challenges closely when we move on to papers that tackle even deeper types of AI manipulation.

Jiahao Huo, Wenjie Qu, Yibo Yan, Kening Zheng, Jiaheng Zhang, Xuming Hu, Philip S. Yu

The Hong Kong University of Science and Technology (Guangzhou) · University of Illinois Chicago · National University of Singapore

cs.CR, cs.AI, cs.CL

Submitted: 2026-05-25

Updated: 2026-11-14

Code: https://github.com/THU-BPM/MarkLLM

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 99/100

The gist: Semantic-level watermarking (SWM) methods are proposed to achieve robustness against paragraph-level paraphrasing attacks by establishing a step-independent green region in semantic space The authors…

Key concepts

Self-Anchored Condition (SAC)
This condition defines the core of SAMARK. It ensures that the random seed used for watermarking is determined only by the semantic content of a unit and a fixed key, not by its position in the sequence. This makes the watermark robust against attacks that change sentence order.
Multi-channel Hyperbolic Scoring Mechanism
This technique uses hyperbolic tangent transforms to score candidates for detection. It amplifies signals from candidates that are strongly aligned with the true watermark while effectively suppressing noise generated by weakly aligned or incorrect paraphrased candidates, boosting overall detectability.
Diversity-Aware Filtering Strategy
This strategy enhances text quality and robustness by combining hard filters (like n-grams) with soft regularization terms. These terms encourage lexical novelty and prevent redundant generation, ensuring the watermarked text remains fluent and high-quality.

Terminology

Summary

Semantic-level watermarking (SWM) methods are proposed to achieve robustness against paragraph-level paraphrasing attacks by establishing a step-independent green region in semantic space The authors introduce SAMARK, a self-anchored watermarking framework that removes the dependency on sentence order by establishing a step-independent green region in semantic space This work addresses the challenge of achieving robustness to paragraph-level paraphrasing attacks (PPA), which globally disrupt watermark signals by changing sentence order SAMARK improves detectability through a multi-channel hyperbolic scoring mechanism that amplifies watermark signals while suppressing noise from weakly aligned candidates

Problem Formulation and Invariance

The vulnerability of existing watermarking schemes stems from their reliance on step-dependent random seeds The authors identify that the intrinsic semantic content of each unit is the most reliable invariant under such attacks, motivating a shift away from step-dependent seed generation This insight leads to the self-anchored paradigm, where the random seed depends solely on the unit’s own semantics, i.e., rt = R(ϕ(ut); k)

SAMARK Framework Components

The proposed framework SAMARK is built upon three key components

  1. A theoretically grounded self-anchored constraint that establishes a step-independent green region This is formalized by the Self-Anchored Condition (SAC), which ensures that the random seed rt = R(ut; k) and the partition Gt = P(omega; rt) depend exclusively on the current unit ut and the fixed key k

  2. A multi-channel hyperbolic scoring mechanism that amplifies robust watermark signals for improved detectability This mechanism uses a hyperbolic tangent transform to amplify candidates with strong channel alignment while suppressing near-zero noise

  3. A diversity-aware filtering strategy that maintains text quality without sacrificing robustness This strategy combines hard filtering (n-gram and semantic filters) with soft regularization terms (semantic diversity and vocabulary novelty bonuses) to encourage lexical novelty

Experimental Validation and Performance

Extensive empirical evaluations demonstrate that SAMARK achieves strong robustness under extreme paragraph-level paraphrasing attacks where existing baselines largely fail SAMARK maintains high detectability across various attack scenarios, such as Doc-P II on Mistral-BOOKSUM, achieving 88.1% TP@FP1% Furthermore, the results show that SAMARK preserves generation quality competitive with that of unwatermarked text, effectively narrowing the traditional robustness-quality trade-off The authors demonstrate that SAMARK maintains TP@FP1% above 72% under all attack scenarios across both backbone models

Efficiency and Sensitivity Analysis

SAMARK achieves a low overall computation overhead among semantic-level methods Its generation latency is 0.22s per token, and its detection latency is only 0. p. 8

Where the paper says it

Within the semantic-level group, SAMARK achieves a generation latency of 0. 22s per token and 4.

0014s per token, which is over 130 times faster than PMark The authors also conduct a systematic sensitivity analysis on key hyperparameters, confirming that the hard filtering and soft regularization mechanisms are complementary in improving text quality Increasing the sample budget N from 64 to 200 consistently improves detection rates under all attack scenarios, and increasing diversity weights like λdiv and λnov steadily improves metrics such as Distinct-2

Conclusion

Current token-level and semantic-level watermarking methods are vulnerable to paragraph-level paraphrasing attacks due to their reliance on context-aware random seeders SAMARK is the first watermarking framework to achieve robustness against paragraph-level paraphrasing, consistently surpassing existing SWM baselines in robustness while maintaining competitive generation quality The self-anchored encoding strategy captures fundamental linguistic invariants rather than model-specific or domain-specific artifacts

References

[1] J. Kirchenbauer, J. Geiping, Y. Wen, J. Katz, I. Miers, and T. Goldstein, “A watermark for large language models,” in International Conference on Machine Learning

[2] X. Zhao, P. Ananth, L. Li, and Y.-X. Wang, “Provable robust watermarking for ai-generated text,” arXiv preprint arXiv:2306. p. 0

Where the paper says it

Yet the growing ability of these models to produce realistic and persuasive content has also raised concerns about authenticity, attribution, and misuse. LLM watermarking, which embeds imperceptible yet algorithmically detectable signals into model outputs to identify AI-generated text, has emerged as a promising way to mitigate such risks.

17439

[3] Z. Hu, L. Chen, X. Wu, Y. Wu, H. Zhang, and H. p. 0

Where the paper says it

SAMARK: A Self-Anchored Text Watermarking with Paragraph-Level Paraphrase Robustness Jiahao Huo∗‡, Wenjie Qu§ , Yibo Yan∗†, Kening Zheng‡ , Jiaheng Zhang§ , Xuming Hu∗†, Philip S. Yu‡ , Mingxun Zhou†B ∗The Hong Kong University of Science and Technology (Guangzhou) †The Hong Kong University of Science and Technology ‡University of Illinois Chicago §National University of Singapore Emails: jiahaohuotj@gmail.

Huang, “Unbiased watermark for large language models,” arXiv preprint arXiv:2310. p. 6
Where the paper says it

4 provides more details. Although perplexity (PPL) is widely used in prior work, it is insufficient for our setting: low-quality outputs with repeated sentences can receive artificially low PPL because repetitive patterns are easy for language models to predict.

10669

[4] S. Aaronson, “Simons institute talk on watermarking of large language models, 2023,” URL https://simons. p. 6

Where the paper says it

4 provides more details. Although perplexity (PPL) is widely used in prior work, it is insufficient for our setting: low-quality outputs with repeated sentences can receive artificially low PPL because repetitive patterns are easy for language models to predict.

berkeley.edu/talks/scott-aaronsonut-austin-openai-2023-08-17, 2023

[5] M. Christ and S. Gunn, “Pseudorandom error-correcting codes,” in Annual International Cryptology Conference. p. 0

Where the paper says it

This mechanism provides a simple statistical signal, but it changes the original sampling distribution of the LLM and can degrade text quality [3]. Distortion-free methods, including Gumbel Watermarking [4] and PRC-based pseudorandom error-correcting schemes [5], reduce this distributional distortion and provide theoretical guarantees on text quality.

Springer, 2024, pp. 325–347

[6] A. B. Hou, J. Zhang, T. He, Y.- Wang, Y.-S. Chuang, H. Wang, L. Shen, B. Van Durme, D. Khashabi, and Y. Tsvetkov, “Semstamp: A semantic watermark with paraphrastic robustness for text generation,” arXiv preprint arXiv:2310. p. 7

Where the paper says it

Among semantic-level methods, SAMARK ranks comparably to or better than SemStamp and k-SemStamp in most settings while delivering substantially higher robustness. On Nemotron, most watermarking methods rank above the unwatermarked baseline, suggesting that watermark-induced sampling diversity can occasionally improve generation quality.

03991

[7] A. B. Hou, J. Zhang, Y.-Wang, D. Khashabi, and T. He, “k-semstamp: A clustering-based semantic watermark for detection of machinegenerated text,” arXiv preprint arXiv:2402. p. 0

Where the paper says it

The watermark can later be detected from the generated output, enabling verification without relying on inherent statistical artifacts of the language model and offering a more resilient way to distinguish machinegenerated content from human-authored work. In practical use, AI-generated text is rarely kept unchanged.

11399

[8] A. Dabiriaghdam and L. Wang, “Simmark: A robust sentence-level similarity-based watermarking algorithm for large language models,” arXiv preprint arXiv:2502. p. 6

Where the paper says it

Although perplexity (PPL) is widely used in prior work, it is insufficient for our setting: low-quality outputs with repeated sentences can receive artificially low PPL because repetitive patterns are easy for language models to predict. We therefore include three diversity-oriented reference metrics: Sentence Duplicate percentage (SD), which is lower when generation is less redundant; Distinct-2 (D-2), which is higher when lexical variety is greater; and 4-gram Repeat percentage (4g), which is lower when text is less repetitive.

02787

[9] J. Huo, S. Liu, B. Wang, J. Zhang, Y. Yan, A. Liu, X. Hu, and M. Zhou, “PMark: Towards robust and distortion-free semanticlevel watermarking with channel constraints,” in The Fourteenth International Conference on Learning Representations

[10] S. Dathathri, A. See, S. Ghaisas, P.-S. Huang, R. McAdam, J. Welbl, V. Bachani, A. Kaskasoli, R. Stanforth, T. Matejovicova et al., “Scalable watermarking for identifying large language model outputs,” Nature

[11] E. Giboulot and T. Furon, “Watermax: breaking the llm watermark detectability-robustness-quality trade-off,” Advances in Neural Information Processing Systems, vol. p. 3

Where the paper says it

This pushes the frontier of the robustness-quality trade-off. SAMark: Self-anchored Watermark Building on the insights from Section 2, we propose SAMARK, a self-anchored watermarking framework that achieves robustness against paragraph-level paraphrasing by making each sentence’s watermark signal depend solely on its own semantics.

37, pp. 18 848–18 881, 2024

[12] L. Pan, A. Liu, Z. He, Z. Gao, X. Zhao, Y.-X Wang et al., “Markllm: An open-source toolkit for llm watermarking,” arXiv preprint arXiv:2405. p. 0

Where the paper says it

Yet the growing ability of these models to produce realistic and persuasive content has also raised concerns about authenticity, attribution, and misuse. LLM watermarking, which embeds imperceptible yet algorithmically detectable signals into model outputs to identify AI-generated text, has emerged as a promising way to mitigate such risks.

10051

[13] C. Raffel, N. Shazeer, A. Roberts, K. Lee, S. Narang, M. Matena, Y. Zhou, W. Li, and P J Liu, “Exploring the limits of transfer learning with a unified text-to-text transformer,” Journal of machine learning research

[14] W Krysci nski, N Rajani, D Agarwal, C Xiong, and D Radev, “Booksum: A collection of datasets for long-form narrative summarization,” arXiv preprint arXiv:2105.08209

[15] A Dubey, A Jauhri et al., “The llama 3 herd of models,” arXiv e-prints, pp. p. 6

Where the paper says it

Experiment Setup Dataset and Baselines. Following previous work [6], [9], we evaluate SAMARK on 500 samples from C4 [13] and BOOKSUM [14], using Llama-3.

arXiv–2407, 2024

[16] Mistral AI, “Mistral small 3.1: The best model in its weight class,” Mistral AI, Tech. p. 8

Where the paper says it

Hyperparameter Sensitivity Analysis (RQ4) To answer RQ4, we conduct a systematic sensitivity analysis on the key hyperparameters of SAMARK using Mistral on BOOKSUM. We examine the four diversityrelated parameters, namely the semantic diversity weight λdiv, the vocabulary novelty weight λnov, the semantic similarity threshold θsem, and the n-gram overlap threshold θngram, as well as the sample budget N.

Rep., 2025

[17] Z Wang, T Gu, B Wu, and Y Yang, “Morphmark: Flexible adaptive watermarking for large language models,” arXiv preprint arXiv:2505.11541

[18] OpenAI, “ChatGPT,” 2022

[19] Y Lu, A Liu, D Yu, J Li, and I King, “An entropy-based text watermarking detection method,” arXiv preprint arXiv:2403.13485

[20] J. Kirchenbauer, J. Geiping, Y. Wen, M Shu et al., “On the reliability of watermarks for large language models,” arXiv preprint arXiv:2306. p. 6

Where the paper says it

4 provides more details. Although perplexity (PPL) is widely used in prior work, it is insufficient for our setting: low-quality outputs with repeated sentences can receive artificially low PPL because repetitive patterns are easy for language models to predict.

04634

[21] R Kuditipudi, J Thickstun, T Hashimoto, and P Liang, “Robust distortion-free watermarks for language models,” arXiv preprint arXiv:2307.15593

[22] B Wouters, “Optimizing watermarks for large language models,” arXiv preprint arXiv:2312.17295

[23] L Chen, Y Bian, Y Deng, D Cai et al., “Watme: Towards lossless watermarking through lexical redundancy,” in Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), 2024

[24] Y Fu, D Xiong, and Y Dong, “Watermarking conditional text generation for ai detection: Unveiling challenges and a semanticaware watermark remedy,” in Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 16, 2024

[25] R Chen, Y Wu, Y Chen et al., “A watermark for order-agnostic language models,” in International Conference on Learning Representations, vol. p. 7

Where the paper says it

SAMARK shows architecture-agnostic and distribution-agnostic consistency. SAMARK maintains TP@FP1% above 72% under all attack scenarios across both backbone models, while baselines show high variance.

2025, 2025

[31] X Xu, J Jia, Y Yao et al., “Robust multi-bit text watermark with llm-based paraphrasers,” arXiv preprint arXiv:2412. p. 9

Where the paper says it

Related Work In recent years, LLM watermarking techniques have advanced rapidly, with KGW [1] being a seminal contribution that embeds statistically detectable signals into text by introducing logit biases to pseudorandomly selected tokens. Following the taxonomy adopted in prior work, existing approaches can be broadly categorized into three types: (1) zero-bit watermarking, (2) multi-bit watermarking, and (3) semantic-level watermarking.

03123

[34] J Ren, H Xu, Y Liu et al., “A robust semantics-based watermark for large language model against paraphrasing,” arXiv preprint arXiv:2311. p. 3

Where the paper says it

This pushes the frontier of the robustness-quality trade-off. SAMark: Self-anchored Watermark Building on the insights from Section 2, we propose SAMARK, a self-anchored watermarking framework that achieves robustness against paragraph-level paraphrasing by making each sentence’s watermark signal depend solely on its own semantics.

08721

[35] J Zhang, S Liu, A Liu et al., “Cohemark: A novel sentence-level watermark for enhanced text quality,” arXiv preprint arXiv:2504. p. 1

Where the paper says it

EFFICIENCY – SAMPLED TOKENS PER OUTPUT TOKEN RELATIVE TO KGW; LOWER IS BETTER. Method Text Quality Robustness Token Cost KGW [1] ★ ★★ 1x SynthID [10] ★★★ ★ 1x SemStamp [6] ★★ ★★ 64x PMark [9] ★★★ ★★ 100x SAMARK (Ours) ★★★ ★★★ 47x level paraphrasing attacks (PPA), which can globally disrupt watermark signals by changing sentence order.

17309

[36] Y Zhang, P Lv, Y Liu et al., “Personamark: Personalized llm watermarking for model protection and user attribution,” arXiv preprint arXiv:2409. p. 0

Where the paper says it

Yet the growing ability of these models to produce realistic and persuasive content has also raised concerns about authenticity, attribution, and misuse. LLM watermarking, which embeds imperceptible yet algorithmically detectable signals into model outputs to identify AI-generated text, has emerged as a promising way to mitigate such risks.

09739

[37] Z Yu, X Jiang, W Gu, Y Wang et al., “SAEMark: Steering personalized multilingual LLM watermarks with sparse autoencoders,” in The Thirty-ninth Annual Conference on Neural Information Processing Systems, 2026

[38] M Christ and S Gunn, “Undetectable watermarks for language models,” in The Thirty Seventh Annual Conference on Learning Theory. PMLR, 2024

[39] T Zhou, X Zhao, X Xu et al., “Bileve: Securing text provenance in large language models against spoofing with bi-level signature,” Advances in Neural Information Processing Systems, vol. p. 6

Where the paper says it

Although perplexity (PPL) is widely used in prior work, it is insufficient for our setting: low-quality outputs with repeated sentences can receive artificially low PPL because repetitive patterns are easy for language models to predict. We therefore include three diversity-oriented reference metrics: Sentence Duplicate percentage (SD), which is lower when generation is less redundant; Distinct-2 (D-2), which is higher when lexical variety is greater; and 4-gram Repeat percentage (4g), which is lower when text is less repetitive.

37, pp. 56 054–56 075, 2024

[40] J Fairoze, S Garg, S Jha et al., “Publicly-detectable watermarking for language models,” arXiv preprint arXiv:2310. p. 0

Where the paper says it

Yet the growing ability of these models to produce realistic and persuasive content has also raised concerns about authenticity, attribution, and misuse. LLM watermarking, which embeds imperceptible yet algorithmically detectable signals into model outputs to identify AI-generated text, has emerged as a promising way to mitigate such risks.

18491

[41] A Liu, L Pan, X Hu et al., “An unforgeable publicly verifiable watermark for large language models,” arXiv preprint arXiv:2307. p. 0

Where the paper says it

During generation, watermarking subtly modifies model outputs while preserving meaning and fluency, embedding a hidden, consistent signal that serves as a verifiable marker of GenAI origin. The watermark can later be detected from the generated output, enabling verification without relying on inherent statistical artifacts of the language model and offering a more resilient way to distinguish machinegenerated content from human-authored work.

16230

[42] N Reimers and I Gurevych, “Sentence-bert: Sentence embeddings using siamese bert-networks,” in Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 11 2019

[43] J Achiam, S Adler et al., “Gpt-4 technical report,” arXiv preprint arXiv:2303. p. 1

Where the paper says it

Self-anchored Paradigm. Building on these insights, our main technical contribution is SAMARK, a novel selfanchored watermarking framework.

08774, 2023

--- Page 1 ---

SAMARK: A Self-Anchored Text Watermarking with Paragraph-Level Paraphrase Robustness

Abstract—Semantic-level watermarking (SWM) improves robustness against text modifications by treating sentences as the basic unit. However, robustness to paragraph-level paraphrasing remains difficult because such attacks globally disrupt watermark signals by changing sentence order In this work, we propose SAMARK, a self-anchored watermarking framework that removes the dependency on sentence order by establishing a step-independent green region in semantic space To improve detectability, we introduce a multi-channel hyperbolic scoring mechanism that amplifies watermark signals while suppressing noise from weakly aligned candidates We further propose a diversity-aware filtering strategy that combines hard filtering with soft regularization, extending beyond simple n-gram repetition filters to address semantic redundancy Experimental results show that SAMARK achieves up to 90. p. 0

Where the paper says it

To improve detectability, we introduce a multi-channel hyperbolic scoring mechanism that amplifies watermark signals while suppressing noise from weakly aligned candidates. We further propose a diversity-aware filtering strategy that combines hard filtering with soft regularization, extending beyond simple n-gram repetition filters to address semantic redundancy.

2% TP@FP1% under typical paragraph-level paraphrasing attacks, outperforming the strongest prior baseline by more than 30% on average, while maintaining generation quality competitive with unwatermarked text and breaking the robustness-quality tradeoff that limits prior methods

Pruning redundant reasoning tokens

The vulnerability to paragraphlevel paraphrasing attacks of most existing watermarking schemes and their variants [1], [6], [9], [10] stems from their reliance on step-dependent random seeds The authors show that the intrinsic semantic content of each unit is the most reliable invariant under such attacks, motivating a shift away from step-dependent seed generation

How the training signal is built

The core of SAMARK is to eliminate step dependence by establishing a stepindependent green region within semantic space The authors define the Self-Anchored Condition (SAC) as rt = R(ut; k), Gt = P(omega; rt), and ut = G(π, u<t, Gt) ∼ p w π(· u<t, k) ∈ Gt This condition is mathematically equivalent to establishing a globally static green region within the entire space omega per response

Where the gains come from

The authors introduce a multi-channel hyperbolic scoring mechanism that amplifies robust watermark signals while suppressing noise from weakly aligned candidates They also propose a diversity-aware filtering strategy that combines hard filtering with soft regularization to address semantic redundancy Experimental results show that SAMARK achieves up to 90.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Self-anchored watermarking framework SAMARK can be implemented to achieve robustness against paragraph-level paraphrasing attacks (PPA) by establishing a step-independent green region in semantic space, which removes the dependency on sentence order.

  2. The multi-channel hyperbolic scoring mechanism in SAMARK can be used to amplify robust watermark signals while suppressing noise from weakly aligned candidates during generation, improving detectability.

  3. A diversity-aware filtering strategy combining hard filtering with soft regularization can be incorporated into the generation process to maintain text quality by preventing redundant generation and encouraging lexical novelty.

  4. The SAMARK detector can perform blind, sentence-level detection without prior knowledge of target flags R by inferring them via majority voting over directional responses and aligning the transformed alignment matrix using a z-test.

  5. The system can be optimized to maintain competitive generation quality with unwatermarked text while achieving up to 90.2% TP at FP1% under typical paragraph-level paraphrasing attacks, effectively narrowing the robustness-quality tradeoff.

Abstract

Semantic-level watermarking (SWM) improves robustness against text modifications by treating sentences as the basic unit. However, robustness to paragraph-level paraphrasing remains difficult because such attacks globally disrupt watermark signals by changing sentence order. In this work, we propose SAMark, a self-anchored watermarking framework that removes the dependency on sentence order by establishing a step-independent green region in semantic space. To improve detectability, we introduce a multi-channel hyperbolic scoring mechanism that amplifies watermark signals while suppressing noise from weakly aligned candidates. We further propose a diversity-aware filtering strategy that combines hard filtering with soft regularization, extending beyond simple n-gram repetition filters to address semantic redundancy. Experimental results show that SAMark achieves up to 90.2% TP@FP1% under typical paragraph-level paraphrasing attacks, outperforming the strongest prior baseline by more than 30% on average, while maintaining generation quality competitive with unwatermarked text and breaking the robustness-quality trade-off that limits prior methods. Our code will be released at [this URL](https://github.com/Z1zs/SAMark).

Sources

Related papers