OURMODEL: Adversarial Perturbation Resistant LLM Fingerprinting


Abstract

While many AI-generated text (AIGT) detectors achieve strong performance on clean inputs, their accuracy degrades significantly under light paraphrasing, word substitutions, character edits, and distribution shifts. We present OURMODEL, an extension to the T5-Sentinel framework that keeps the original next-token prediction objective for source attribution while introducing an auxiliary margin-based triplet loss over decoder embeddings. This contrastive style regularization encourages the learning of compact, perturbation-resistant stylistic representations, offering a lightweight yet effective alternative to prior approaches that rely on architectural modifications, adversarial training, or complex multi-task objectives without altering the underlying T5-small backbone. OURMODEL achieves state-of-the-art multiclass source attribution and binary human-vs-LLM detection on OpenLLMText and HC3 AIGT benchmarks. More importantly, OURMODEL demonstrates enhanced robustness to word and character level adversarial perturbations of up to 90% intensity, achieving state-of-the-art on the challenging MAGE/Deepfake stress-test suite—including unseen models, unseen domains, and extreme paraphrasing scenarios. Our results highlight that explicitly regularizing stylistic embeddings via contrastive learning is a practical and effective strategy for building more robust LLM fingerprinting systems in real-world adversarial settings.

AI-generated text detection, LLM fingerprinting, contrastive style regularization, adversarial perturbation robustness, paraphrasing robustness, out-of-distribution detection, stylistic representations

1 Introduction↩︎

The rapid advancement of large language models has enabled widespread generation of human-like text [1][4]. As AI-generated text (AIGT) becomes increasingly indistinguishable from human text, reliable detection is critical for academic integrity, moderation, misinformation analysis, and provenance tracking.

A large body of prior work has shown that clean-text AIGT detection is possible, but robustness remains a major bottleneck. Many detectors rely on statistical regularities, token-level artifacts, or fine-tuned transformer classifiers [5], [6]. These systems can degrade sharply under paraphrasing, synonym substitution, or small character edits [1], [7], [8]. In practice, generated text is often lightly edited before use, which makes clean-only accuracy an incomplete measure of detector quality. Unfortunately, most detectors fail to capture the nuanced stylistic differences distinguishing human vs. machine authors [7], and paraphrasing attacks can easily bypass most detectors [1]. Such vulnerabilities, exacerbated by commercial "humanizers", render current systems brittle for practical deployment [4], [7], [9].

Our work is motivated by a simple observation: source attribution should rely less on brittle surface cues and more on stylistic regularities that survive modest editing. Recent contrastive and style-based approaches already suggest that such signals are useful. We therefore present OURMODEL, a modest but effective extension of T5-Sentinel [6]. The model retains T5-Sentinel’s next-token prediction formulation, but augments training with a margin-based triplet loss over style embeddings so that texts from the same source class are pulled together while texts from different source classes are pushed apart.

We use lightweight perturbations as scalable proxies for real-world editing. Our approach is based on prior work that shows AIGT detectors such as DetectGPT and ‘OpenAI Text Classifier’ exhibit greater AuROC degradation under word-substitution, often pushing performance below random guessing (50% AuROC), while paraphrasing is less potent and has a milder effect [1], [10]. Furthermore, word substitution is a commonly used strategy in generating textual adversarial examples [10] Thus, in this work we focus on the harder task of AIGT detection in the presence of word and character-level perturbations (including synonym replacements up to 80% intensity). We consider these as effective [8] lightweight realistic [11] proxies for real-world text polishing  [8] and paraphrasing, as they mimic the lexical substitutions common in evasion attacks while enabling scalable ablation across large test suits.

Our experiments consider synonym substitutions and character-level operations (swap, replace, insert, delete). These perturbations do not cover the full space of human rewriting, but they are useful stress tests because they isolate lexical and orthographic changes that frequently appear in evasion attempts [8], [11].

Our contributions

  • We introduce OURMODEL, a style-aware extension of T5-Sentinel that combines next-token prediction with a margin-based triplet loss over pooled decoder representations for AIGT detection.

  • State-of-the-art binary/multiclass AIGT detection on OpenLLMText & HC3 datasets.

  • Robustness analyses across word-level and character-level adversarial attacks at varying intensities, with ablation studies isolating the role of contrastive learning/training.

  • State-of-the-art in out-of-distribution tasks (both unseen-model, and unseen-domain) with no additional adaptation, as well as state-of-the-art in the most extreme paraphrasing task on MAGE dataset.

2 Related Works↩︎

AIGT detection methods range from statistical and zero-shot approaches to fully supervised classifiers. Early systems based on n-gram statistics, entropy, or distributional features were reasonably interpretable, but they struggle with modern LLMs that produce fluent and diverse text [1]. DetectGPT [2] uses curvature under perturbation for zero-shot detection; RADAR [12] improves paraphrase robustness through adversarial training; SCRN [3] uses reconstruction-based robustness; and PAWN [13] reweights suspicious tokens by perplexity-derived signals. T5-Sentinel [6] is particularly close to our work: it reframes detection as next-token prediction with author tokens, but it does not explicitly regularize style representations or enforce style consistency. However, both Commercial and open-source methods (TurnItIn [9], GPTZero [14], ZeroGPT [15]) reporting highly varying accuracies [4].

Contrastive and style-aware learning has been widely used to learn discriminative representations for sentences, semantics, and writing style [16][20]. In AIGT detection, TopFormer [21] applies triplet loss to deepfake text attribution. NBCSoftmax uses block contrastive loss [20] for style based author detection in micro text samples. DeTeCtive [22] employs multi-task and multi-layer contrastive learning, and can optionally incorporate training-free incremental adaptation (TFIA) for certain out-of-distribution scenarios.

While these works already support the broader idea that style cues are useful they have shortcomings, current AIGT detectors struggle with minor adversarial perturbations such as word substitutions or character swaps [3]. For example, mimicking paraphrasing by shortening "California" to "Calif." can cause misclassifications, highlighting the limits of brittle token-level features. Simple word substitution attacks degrade DetectGPT [2] and ‘OpenAI Text Classifier’ [23] dropping AUROC below random guessing (of 50%) [10]. Although paraphrasing has a milder effect [10], the accuracy of DetectGPT drops from 70.3% to 4.6% and the accuracy of OpenAI text classifier drops from 30.0% to 15.6%  [1]. AIGT detectors in general misclassify perturbed texts as human, resulting in accuracy \(\approx50\%\) [8].

Authorship attribution and style-based source attribution is closely related to our task. However, it differs in one important respect: all human authors are collapsed into a single heterogeneous Human class, while each LLM is treated as one source class. This makes the human class intrinsically broader and harder to separate than any individual machine source. This perspective is important when interpreting class-wise performance and when comparing AIGT detection to classical authorship attribution.

In positioning our work, OURMODEL should be viewed as a lightweight yet effective enhancement to the T5-Sentinel framework [6] employing an auxiliary style-aware contrastive regularization on the decoder’s final hidden-layer embeddings. The core contribution lies in demonstrating that a simple batched margin-based triplet loss, when combined with the original next-token prediction objective, is sufficient to learn perturbation-resistant stylistic signatures without requiring architectural modifications, adversarial training, or multi-task objectives. This yields consistent gains in both in-distribution accuracy and robustness to word/character substitution attacks, while simultaneously achieving state-of-the-art out-of-distribution and paraphrasing performance on the challenging MAGE benchmark.

3 sec:Proposed32Model↩︎

Figure 1: OURMODEL combines cross-entropy loss with a batched margin-based contrastive triplet loss for supervised fine-tuning of the T5-small backbone. We enforced an additional author style constraint on the mean-pooled final decoder embeddings, immediately prior to projecting to token space. We predict the author, represented by an extra token, as the next word.

3.1 Model Architecture.↩︎

OURMODEL is based on the T5-small encoder-decoder, enhanced for perturbation resistant AIGT detection via contrastive style learning. Following [6], we reformulate detection as a next-token prediction task, but incorporate author stylistic semantics. Each label is represented by an author token, representing a source class rather than an individual person: for example, <Human>, <GPT-3.5>, <LLaMA>, <PaLM>, <GPT2> on OpenLLMText. This formulation lets us reuse T5’s text-to-text interface, its pre-training and avoids the need for an explicit classification head. Given an input text \(s\), the encoder processes the sequence and the decoder generates the most likely author token. Our key innovation lies in the training procedure, where we apply a additional constraint on last decoder embedding layer, immediately before the linear projection to vocabulary logits, which is able enhance rich stylistic signals shaped by both the encoder context and the decoder’s auto-regressive processing.

3.2 Loss Function.↩︎

The training objective combines two complementary losses: cross-entropy for accurate classification and margin-based triplet loss for stylistic discrimination Let \(\texttt{LM}: \Sigma^* \times \Sigma \to \mathbb{R}\) represent our language model, where \(\texttt{LM}(s, \sigma)\) estimates the probability of token \(\sigma\) following input string \(s\). We establish a mapping \(f: Y \to \mathcal{Y}\) from label set \(Y\) to proxy tokens \(\mathcal{Y} \subset \Sigma\), reformulating classification as: \[\hat{y} = f^{-1}\left( \arg\max_{y \in \mathcal{Y}} \texttt{LM}(s, y) \right)\]

The cross-entropy loss, where \(G(F(s))\) denotes the logits produced from the decoder embedding \(F(s)\), is:

\[\mathcal{L}_{CE} = -\sum_{i \in \mathcal{Y}} y_i \log(G(F(s))_i)\] where \(y_i=1\) if correct label and 0 otherwise. However, under lexical edits (synonym substitution, character swap/insert/delete), these surface cues are disrupted, causing the decoder states \(F(s)\) to shift in ways that can flip the argmax over author tokens.

Our key addition is augmenting the objective with a margin-based triplet loss applied directly on the decoder embeddings to encourage robust stylistic representations:

\[\begin{align} \mathcal{L}_{triplet} = \sum \max \Big( 0,\; &d(F(s_{a}), F(s_{p})) \\ &- d(F(s_{a}), F(s_{n})) + m \Big) \end{align}\] where \(s_a\) is the anchor sample, \(s_p\) is a positive sample from the same author class, \(s_n\) is a negative sample from a different class and \(d(\cdot, \cdot)\) denotes Euclidean distance. The margin \(m=1.0\) acts as a safety buffer around the decision boundary, ensuring that even under perturbations of magnitude up to \(m/2\), the relative ordering of distances is preserved.

The final training loss is the weighted combination \[\mathcal{L} = (1-\lambda)\mathcal{L}_{CE} + \lambda \mathcal{L}_{triplet},\] where \(\lambda = 0.5\) balances classification accuracy and stylistic discrimination.

3.3 Theoretical Analysis.↩︎

We analyze why augmenting next-token prediction objective with a margin-based triplet loss on decoder embeddings improves both accuracy and robustness in source attribution and AIGT detection. Pure cross-entropy training encourages accurate prediction of the correct author token but primarily optimizes surface-level token prediction. Under lexical edits (synonym substitution, character swap/insert/delete), these surface cues are disrupted, causing the decoder states \(F(s)\) to shift in ways that can flip the argmax over author tokens.

Minimizing \(\mathcal{L}_{triplet}\) explicitly pulls decoder representations of same authors closer while pushing representations from different authors apart by at least margin \(m\). As the embeddings are extracted from the decoder’s final layer, after cross attention, they encode more global stylistic signals to aid predict the author token. The triplet term regularizes this space so that stylistic regularities (such as patterns in conjunctions, transitional phrases, and topic-invariant function words) become more dominant and compact within each author cluster.

This geometric regularization directly impacts classification error through the Bhattacharyya bound. Consider the class-conditional distributions of decoder embeddings \(p_c(z)\) with means \(\mu_c\) and covariances \(\Sigma_c\). For any pair of classes \(c\) and \(c'\), the Bhattacharyya bound on the pairwise Bayes error is: \[\epsilon_{c,c'} \leq \sqrt{P(c)P(c')} \exp\left(-\frac{d^2(\mu_c, \mu_{c'})}{8\sigma^2}\right),\]

The triplet loss optimizes embedding geometry by: (1) reducing the average intra-class variance \(\Sigma_c\) (related to \(\text{tr}(\Sigma_c)\)), and (2) maximizing inter-class separation \(d(\mu_c, \mu_{c'})\) for \(c \neq c'\). Both effects tighten the exponent in the Bhattacharyya bound, lowering the upper bound on pairwise error. In the multiclass setting with a heterogeneous “Human” class, improved separation across all pairs contributes to better overall source attribution. While this bound applies to pairwise classification, improved separation between all class pairs contributes to better overall multiclass performance.

3.4 Robustness Analysis↩︎

The geometric regularization induced by the triplet loss provides a principled explanation for the observed robustness of OURMODEL under adversarial perturbations. When a text \(s\) undergoes realistic perturbations such as synonym substitution of adjectives or nouns, or character-level operations (swap, replace, insert, delete), the input to the encoder changes, yet the decoder embeddings of same-author texts remain relatively close in the regularized space. The margin \(m\) provides a robustness buffer: even if a perturbation moves an embedding by up to roughly \(m/2\), the relative ordering (same-author closer than different-author) is likely preserved. In contrast, a CE-only model has no explicit geometric constraint on \(F(s)\); its decoder states are optimized solely for token likelihood and are thus more sensitive to local token alterations. This explains why OURMODEL maintains high accuracy even at high perturbation intensities (up to 80–90% word-level replacements), whereas CE-only baselines suffer significant degradation. In summary, the auxiliary triplet loss on T5 decoder embeddings encourages a geometry in which source-specific stylistic signatures are compact and well-separated, thus robust to perturbations. Combined with the original next-token objective, this yields representations that are simultaneously accurate.

For optimal margin selection, we want: \[m \geq 2\sigma_n + \delta\] where \(\sigma_n\) is the expected perturbation magnitude in embedding space and \(\delta > 0\) provides additional robustness buffer.

Empirical support appears in our embedding visualizations (t-SNE and PCA of decoder states): OURMODEL produces tighter intra-class clusters and clearer inter-class separation than the CE baseline, both for seen and unseen LLMs. Qualitatively, integrated gradients further confirm that OURMODEL assigns higher importance to stylometric markers (e.g., conjunctions and transitional phrases) rather than isolated content tokens, i.e. signals that survive light editing better than brittle token-level artifacts. Essentially, by compacting same-author decoder embeddings and enforcing separation between classes, the auxiliary triplet loss makes the model inherently more resilient to the types of light editing and adversarial perturbations commonly encountered in real-world AIGT detection scenarios.

Furthermore, contrastive learning maximizes the mutual information \(I(Z; C)\) between the decoder embeddings \(Z = F(s)\) and the class labels \(C\): \[I(Z; C) = H(Z) - H(Z|C)\] Thus, by reducing the conditional entropy \(H(Z|C)\) through embedding compactness, the triplet loss produces more informative representations. This combination of geometric optimization (via triplet loss), error bound minimization (Bhattacharyya), and information maximization provides strong theoretical justification for why contrastive style embeddings improve both accuracy and robustness compared to approaches relying solely on cross-entropy optimization.

4 Experiments↩︎

Datasets. We benchmark on 3 datasets.

OpenLLMText dataset [6] consists of 340K text samples from five sources: Human, GPT3.5 [24], PaLM [25], LLaMA-7B [26], and GPT2-1B (GPT2 extra-large) [27]. Human text comes from OpenWebText [28], a pre‑2019 Reddit‑based user content dataset. LLaMA, GPT3.5, and PaLM text was generated by paraphrasing human texts. GPT2 texts originate from the GPT2-Output dataset [29]. The dataset’s diverse prompting strategies and generation methods mirror real-world LLM usage.

HC3 dataset [30] comprises Q & A from ChatGPT and human experts, including domain-specific professionals from web users, Wikipedia and Baidu Baike. Following [8], we exclude unsuitable samples, such as instances where ChatGPT declined to provide an answer and use the same test/train splits.

MAGE/Deepfake [31] has 448K samples, generated by 27 mainstream LLMs from 7 sources alongside human-text across 10 distinct domains/tasks (news article writing, story generation, scientific writing). It has 3 types of prompts: continuation (ask LLM to continue based on the previous 30 words of human text), topical (ask LLMs to generate texts based on a topic) and specified prompts (topical prompts with specified information about the text sources such as BBC news, Reddit Post, etc.). We focus on the stress-test tasks that are most relevant to robustness: cross-domain/cross-model in-distribution evaluation, unseen-model and unseen-domain OOD evaluation, and paraphrasing.

Experimental Setup and Hyper-parameters.

Unless otherwise stated, we use the published train/dev/test splits from [6], [8], and [22]. OURMODEL uses T5-small with maximum length 512 and truncation, Adam, learning rate \(1.0\times10^{-4}\), weight decay \(5.0\times10^{-5}\), batch size 32, \(\lambda=0.5\), and margin \(m=1.0\). For OpenLLMText and MAGE/Deepfake we use same pre-processing from  [6], [22]. For the HC3 dataset, while using the same splits, settings and synonym selection mechanism as in [8], we corrected an extra space added during synonym replacement. Our code and datasets will be public.

5 Results↩︎

In Section 5.1, we evaluate OURMODEL on multiclass source attribution and binary human-vs-LLM detection. Section 5.2 presents ablations. Section 5.3 provides qualitative diagnostics. Section 5.4 studies perturbation robustness in character and word-level adversarial attacks across different severities, and Section 5.5 evaluates OOD and paraphrasing performance on MAGE/Deepfake.

5.1 Multiclass AIGT Detection↩︎

Table 1: OpenLLMText Multi class classification. First is our OURMODEL. Second is T5-Sentinel [6] w/o contrastive loss.
Author Class Precision Recall F1-Score Support
ChatGPT 0.95/0.95 0.96/0.95 0.96/0.95 7385
GPT2 0.95/0.93 0.98/0.98 0.97/0.95 7385
Human 0.94/0.94 0.88/0.83 0.91/0.89 7367
LLaMA 1.00/1.00 0.99/0.94 1.00/0.97 5452
PaLM 0.91/0.86 0.93/0.95 0.92/0.90 7400
Accuracy 0.95/0.93 34989
Macro Avg 0.95/0.94 0.95/0.93 0.95/0.93 34989
Weighted Avg 0.95/0.93 0.95/0.93 0.95/0.93 34989
Figure 2: OURMODEL vs benchmark (T5-Sentinel; no contrastive loss), on OpenLLMText.
Figure 3: OURMODEL ROC curves for each one-vs-rest classification task on the test dataset

Table 1, on OpenLLMText, shows that OURMODEL, with contrastive loss, excels in identifying LLaMA-generated text (F1-score 1.00), reflecting its ability to capture distinct stylistic patterns in LLaMA’s text completions. High F1-scores for ChatGPT (0.96) and GPT2 (0.97) indicate robust performance across diverse LLMs, while the slightly lower F1-score for Human (0.91) suggests challenges in detecting human texts, likely due to their stylistic variability. The balanced macro and weighted averages (0.95) highlight the model’s consistency across classes. These results imply that OURMODEL’s contrastive style embeddings are effective for multiclass LLM detection.

The confusion matrix in Figure 2 shows that OURMODEL excels on Human, ChatGPT and LLaMA (much higher true positives), while benchmark is marginally better on GPT-2, and PaLM. However, OURMODEL has fewer overall errors, especially on harder-to-distinguish LLaMA (near-perfect) and lower off-diagonals such as Human → PaLM misclassifications (413 vs. 717) making it superior multiclass AIGT detection.

Figure 3 summarizes one-vs-rest ROC curves. Figure [fig95det95comp] shows that OURMODEL generally traces a better false-positive/false-negative trade-off than the CE-only baseline at matched thresholds.

Detection Error Trade-off (DET) curves plot the false negative rate against the false positive rate to evaluate the performance of binary classifiers across various thresholds. For comparison with and without the contrastive style information, we also compare the DET curves on each one-vs-rest task in figure [fig95det95comp], using a log scale. OURMODEL’s DET curve consistently shows a lower false negative rate for similar false positive rate compared to benchmark.

Table 2: Human-LLM binary classification on the OpenLLMText dataset.
AUC Acc F1 Recall Precision
OpenAI [23] 0.795 0.434 0.415 0.985 0.263
ZeroGPT [15] 0.533 0.336 0.134 0.839 0.148
T5-Hidden [6] 0.924 0.894 0.766 0.849 0.698
T5-Sentinel [6] 0.965 0.956 0.886 0.832 0.946
DeTeCtive [22] 0.951 0.871 0.787 0.976
OURMODEL 0.884 0.941
Table 3: Human-to-specific-LLM binary classification on the OpenLLMText dataset.
Task Human v. GPT3.5 Human v. PaLM Human v. LLaMA Human v. GPT2
2-4 (r)5-7 (r)8-10 (r)11-13 Metric AUC Acc F1 AUC Acc F1 AUC Acc F1 AUC Acc F1
OpenAI .761 .569 .694 .829 .659 .743 .676 .573 .709 .901 .768 .809
ZeroGPT .576 .493 .555 .735 .662 .649 .367 .375 .519 .435 .382 .504
Solaiman et al. .501 .499 .005 .508 .501 .013 .524 .533 .027 .870 .748 .666
T5-Hidden .971 .922 .916 .964 .914 .908 .806 .746 .779 .965 .910 .903
T5-Sentinel .970 .914 .906 .962 .906 .898 .964 .903 .901 .965 .912 .904
DeTeCtive .893 .880 .885 .872 .877 .881 .893 .880
OURMODEL

Human-LLM Binary Classification Our evaluation demonstrates that OURMODEL significantly outperforms existing baselines. In the overall human-LLM binary classification task (Table 2), OURMODEL achieves an AUC of 0.974, an accuracy of 0.964, and an F1 score of 0.912, surpassing T5-Sentinel (AUC 0.965, accuracy 0.956, F1 0.886) and other baselines like OpenAI’s classifier and ZeroGPT. In terms of precision-recall, DeTeCtive is recall-heavy. While Sentinel is balanced, the high precision (0.941) and balanced recall (0.884) indicate that our model effectively identifies both human and AIGT with minimal false positives, providing an optimal trade-off.

In specific human-to-LLM classification tasks (Table 3), OURMODEL consistently excels. For instance, in the Human vs. LLaMA task, it achieves near-perfect performance (AUC 0.999, accuracy 0.999, F1 0.998), highlighting its ability to distinguish LLaMA’s text completions from human writing. Similarly, in the Human vs. GPT3.5 task, OURMODEL delivers an accuracy of 0.990 and an F1 score of 0.982, outperforming both T5-Hidden (accuracy 0.922, F1 0.916) and T5-Sentinel (accuracy 0.914, F1 0.906) benchmarks, that do not use the contrastive style embeddings for model training. These results underscore the model’s robustness across different LLMs, even when generation methods vary (e.g., paraphrasing for GPT3.5 and PaLM vs. text completion for LLaMA).

5.2 Ablation Study↩︎

To understand the contribution of contrastive style embeddings at train time, we conduct ablations on multiple training scenarios and key hyper-parameters, including systematic evaluation of other forms of contrastive loss, sample mining and different as well as learnable \(\lambda\) values.

Table 4: Human-vs-LLM detection accuracy on OpenLLMText for alternative contrastive losses. Epoch* is the epoch of best validation accuracy. Train time is minutes:seconds per epoch. Lowering \(\lambda\) hurts our model in this ablation.
\(\lambda\)=0.5 \(\lambda\)=0.25
Acc Epoch* Train Test Acc
OURMODEL 96.40 8 31:32 1:32 94.07 \(\nabla\)
InfoNCE 94.52 11 31:56 1:32 94.60
Margin 93.41 9 40:34 1:33 93.74
ArcCon 94.31 9 33:25 1:32 94.50
NBCSoftmax 94.40 14 32:04 1:32 94.00 \(\nabla\)

Alternative contrastive losses. Table 4 shows that the triplet-loss formulation used in OURMODEL is more effective than the other tested losses under the same T5-small backbone. It also reaches its best validation with the fewest epochs and shortest training time.

Table 5: Sample mining and margin options for author style contrastive learning.bold: OURMODEL is robust across different strategies for multi/singleclass.\(\oplus\) Initialized to 1.0, reaches 0.015 after 15 epochs.Hard positives/negatives slightly improve multiclass accuracy, while random sampling is the default because it is cheaper and equally strong on the binary task.
Ablation - sample mining and margin hyperparameters Multiclass Acc Human Vs AI Acc
Random Positives Random Negatives margin=1.0 0.935 0.964
Random positive Hard Negatives margin=1.0 0.939 0.964
Hard Positives Hard Negative margin=1.0 0.943 0.962
Random Positives Random Negatives learnable margin\(\oplus\) 0.922 0.941
Table 6: The balanced CE+triplet objective works best overall.Mean‑pooled decoder last layer embeddings perform best.
Ablation - \(\lambda\) and style embedding source hyperparameters Multiclass Acc Human Vs AI Acc
Balanced: 50% Cross entropy, 50% triplet loss 0.935 0.964
Cross entropy loss only [6] 0.919 0.956
Triplet loss only 0.317 0.320
\(\lambda=50\%\) triplet loss on decoder last (mean pool) 0.935
\(\lambda=50\%\) triplet loss on decoder last (CLS token) 0.913
\(\lambda=50\%\) triplet loss on encoder & decoder last 0.927

Hard Negative and Positive Mining. Table 5 evaluates the impact of sampling strategies on performance. The multiclass accuracy (across all author classes in OpenLLMText) improves from 0.935 with random sampling to 0.943 with hard positives and negatives, indicating that hard sampling can enhance multiclass classification by learning more nuanced stylistic features. However, the human vs. AI single class accuracy slightly decreases from 0.964 to 0.962 with hard sampling. This suggests that while hard sampling improves multiclass discrimination, it may introduce noise in binary tasks by focusing on edge cases that are less representative of typical human-AI differences. Another aspect is human authors form a more diverse set with varying characteristics [32]. Hard positives and negatives are specifically selected samples that are challenging for the model to distinguish and therefore can improve its discriminative power [33]. Selecting these and the pairwise comparison is computationally expensive, needing \(\mathcal{O}(n^2)\) operations. OURMODEL uses random sampling for efficiency over hard sampling’s marginal gains and high computational cost.

Effect of the contrastive style embeddings. Table 6 highlights the critical role of contrastive style embeddings in OURMODEL. The balanced approach, combining cross-entropy and contrastive loss, achieves the highest performance (0.935 multiclass, 0.964 human-AI), surpassing the cross-entropy-only baseline (0.919, 0.956 respectively) inspired by [6], demonstrating that style embeddings enhance stylistic differentiation. However, using only contrastive loss yields poor results (0.317 multiclass, 0.320 human-AI), indicating that cross-entropy loss is essential for effective classification. These findings imply that OURMODEL’s hybrid loss strategy enhances the model’s ability to capture author-specific patterns.

5.3 Qualitative Analysis↩︎

Integrated Gradients (IG) attributions highlight the input tokens most responsible for the model’s output, with brighter colors indicating stronger influence (yellow, green, down to blue), facilitating interpretability. We use IG only as an illustrative diagnostic to show how the CE-only T5-Sentinel baseline and OURMODEL distribute salience on a few example cases from the OpenLLMText test set.

In Box 1, without style, peak yellows are limited to 5 single/short token sequences. Box 2, with style, spreads over 7 semantically pivotal longer token sequences, making it harder to exploit via word/character tweaking or simple punctuation injection. Specifically, OURMODEL attributes more significance to joining words, also known as conjunctions and transitional phrases, which establish the flow and stylistic identity of a text [5]. Such stylometric features identify authorship or author styles [32], Unlike content words, which are tied to specific topics, conjunctions provide stable stylistic markers that remain consistent across different themes [5]. This stability makes them reliable for detecting shifts in writing style, as variations in their usage can indicate a change in authorship or intentional stylistic adjustments. OURMODEL picks up on topic-invariant conjunctions such as ‘yet’, ‘that’ capturing the author’s unique stylistic fingerprint.

Box 1. True positive, human; CE-only T5-Sentinel baseline.

Out going US President Barack Obama said that he did not expect President - e lect Donald Trump to follow his administration s blueprint s in dealing with Russia , yet hoped that Trump would " stand up " to Moscow . " My hope is that the president - e lect coming in takes a similarly constructive approach , finding areas where we can cooperate with Russia where our values and interests align , but that the president - e lect also is willing

Box 2. True positive, human; OURMODEL.

Out going US President Barack Obama said that he did not expect President - e lect Donald Trump to follow his administration s blueprint s in dealing with Russia , yet hoped that Trump would " stand up " to Moscow . " My hope is that the president - e lect coming in takes a similarly constructive approach , finding areas where we can cooperate with Russia where our values and interests align , but that the president - e lect also is willing

Box 3. Short example comparing the CE-only baseline and OURMODEL.

CE-only : Did you hear about the guy who s afraid of esc al ators ? He takes steps to avoid them . </s>

OURMODEL: Did you hear about the guy who s afraid of esc al ators ? He takes steps to avoid them . </s>

Box 3 shows the IG for a micro text sample, confirming the broader focus OURMODEL applies on all the tokens.

Box 4. Perturbed sample (He\(\rightarrow\)he)

CE-only: Did you hear about the guy who s afraid of esc al ators ? he takes steps to avoid them . </s>

OURMODEL: Did you hear about the guy who s afraid of esc al ators ? he takes steps to avoid them . </s>

Box 4 shows the IG for the perturbed micro text sample, where the ‘He’ from sample 3 text is changed to ‘he’. OURMODEL’s prediction probability changes 2% (97% to 99%) while CE-only changes 9% (88% to 97%).

Figure 4: Perturbation effect on OpenLLMText, for multi class classification accuracy over adjectives (left:); nouns (center:) replaced. Right shows typos replaced randomly with one of 4 (swap, replace, insert, delete) with equal probability, if the word was selected to be perturbed.
Figure 5: Perturbation effect on the full OpenLLMText test set, for different types of typos; swap, replace, insert, delete; measured in multi class classification accuracy over different % of words.
Figure 6: Perturbation effect on OpenLLMText, for other grammar constructs, measured in multi class classification accuracy over different % of words.
Figure 7: Embedding visualization of CE-only T5-Sentinel baseline (left panels in each image) vs OURMODEL (right panels in each image). Top: t-SNE (perplexity = 30), bottom : PCA from the T5 decoder’s last hidden layer. For seen authors, OURMODEL yields tighter, and more separated clusters. For unseen authors, both models still show substantial overlap.
Table 7: Accuracy vs. perturbation% based on word-level synonym replacement (synonyms for adjectives) on the HC3. \(^{a}\)Common model SemEval-2024. \(^{b}\)Winner in PAN. * Results from [8].
Model Perturbation %
2-6 0% 5% 10% 20% 30%
RoBERTa [34]\(^{*a}\) 0.9380 0.5800 0.5570 0.5270 0.5080
DetectGPT [2]\(^{*b}\) 0.8350 0.8010 0.7720 0.7030 0.6580
CoCo [7]* 0.9981 0.5432 0.5421 0.5356 0.5333
PRDetect [8] 0.9878 0.9878 0.9872 0.9874 0.9876
T5-Sentinel 0.9980 0.9980 0.9980 0.9970 0.9980
OURMODEL (margin=0.1) 0.9960 0.9970 0.9970 0.9980 0.9990
OURMODEL (margin=1.0)

Box 5. Perturbed sample 8.

Original, CE-only:
E vol ve Politic s secret ly in fil t rated the To ries imitation - M o ment um group Activ ate , gaining </s>

Original, OURMODEL:
E vol ve Politic s secret ly in fil t rated the To ries imitation - M o ment um group Activ ate , gaining </s>

Typo added, CE-only:
E vol ve Politic s secret ly in fil t rated the To ries imitation - M o ment um group Activ a e t , gaining </s>

Typo added, OURMODEL:
E vol ve Politic s secret ly in fil t rated the To ries imitation - M o ment um group Activ a e t , gaining </s>

Box 5 is another illustrative case. Under a swap perturbation, changing Activate to Activaet), OURMODEL remains more stable than the CE-only baseline and places less relative mass on punctuation-like artifacts. IG is broader, focuses on ‘Politic’ token, sustains ‘secret’, and is consistent across the perturbation despite noise, indicating a more comprehensive model understanding. Furthermore, w/o styles, superficial </s> and "’" represent higher IG, indicating shallow understanding.

We compare decoder embeddings from the benchmark and OURMODEL to investigate the effect of the respective loss functions during training. In Figure 7 (a), the benchmark exhibits dense clustering in both t-SNE (top left) and PCA (bottom left), with notable overlap among model types (e.g., ChatGPT, PaLM, Human, GPT2, LLaMA). In contrast, OURMODEL displays a more clustered distribution.

Clear clustering in PCA and t-SNE are strong indications of well-separated structure in the original high-dimensional space. While t-SNE emphasizes local structure preservation, it is sensitive to hyperparameters like perplexity (which balances local and global structure) and prone to artifacts such as false separations or compressions. PCA, conversely, captures global variance through linear projections, highlighting directions of maximum spread but potentially missing non-linear relationships. t-SNE (top right) shows that OURMODEL clusters are markedly more compact and distinct; points are uniformly dense within clusters and sparsely distributed between them, suggesting enhanced intra-class cohesion and inter-class distance—likely due to the contrastive loss encouraging repulsive forces between classes with superior local structure preservation. PCA visualization on OURMODEL (bottom right) shows compact ovals with strong separation, minimal, with clear inter class gaps, indicating that variance directions now better align with class distinctions, lower intra-class variance and reinforces t-SNE’s findings through a linear lens, suggesting the improvements are not just non-linear artifacts but reflect genuine variance restructuring for better separability.

In relation to recent unseen LLM authors (Figure 7 (b)), both PCA and t-SNE embeddings are intermixed, suggesting these unseen AI authors (LLaMA variants, Deepseek, OpenAi, Qwen) generate highly similar embeddings, possibly due to shared architectures, training data, or fine-tuning. However, the benchmark’s distributions are more compact/less structured (especially in t-SNE), suggesting uniformity or less variability, while OURMODEL shows elongation/spread, potentially indicating richer dynamics.

The benchmark prioritizes capturing a wide range of contextual features, due to cross-entropy loss optimized for likelihood, resulting in denser embeddings with significant inter-class overlap, learning a rich but less separable representation. This aids nuanced feature preservation but could reduce classification performance due to lower distinguishability. On the other hand, the sparser and more distinct embeddings in OURMODEL, especially in the decoder states, imply that its loss function incorporates mechanisms to enhance class separability, due to the margin-based contrastive loss. This approach regularizes the latent space, leading to clearer cluster boundaries.

Figure 8: Perturbation effect on HC3, for multi class classification accuracy over adjectives (left:); nouns (center:) replaced. Right shows typos replaced randomly with one of 4 (swap, replace, insert, delete) with equal probability, if the word was selected to be perturbed.
Figure 9: Perturbation effect, on the full HC3 test set, for different types of typos; swap, replace, insert, delete; measured in multi class classification accuracy over different % of words.
Figure 10: Perturbation effects on the full HC3 test set, for other grammar constructs, measured in multi class classification accuracy over different % of words.

5.4 Perturbation Resilience.↩︎

We benchmark OURMODEL on word-level and character-level adversarial attacks at varying intensities. Such simple perturbations emulate simple real-world text polishing  [8], but can significantly interfere with popular AIGT detectors [1], [3].

Table 7 shows AIGT detection accuracy on HC3 under increasing perturbation levels from 0% to 30%. PRDetect [8] is a perturbation-robust model for detecting LLM-generated text by analysing syntax tree structures, enhancing its ability to identify synthetic content even when modified. OURMODEL outperforms all models, maintaining accuracy above 0.9980 even at 30% perturbation and above (shown later). We attribute the robustness to the margin-based contrastive loss, which enhances feature separability in the embedding space, complementing the cross-entropy loss. Cross-entropy loss alone typically struggles with robustness, as seen in RoBERTa and DetectGPT.

Experiments on the OpenLLMText dataset for word-level (Figure 4) and character-level (Figure 5) perturbations show OURMODEL’s resilience even at up to 90% intensity. Part-of-Speech (POS) distributions are consistent within LLM families, yet distinct across families (e.g., LLaMA vs. GPT), enabling reliable model identification [35]. Fig. 6 breaks down perturbations by POS tags for different grammatical constructs, confirming OURMODEL’s robustness. We provide further results on the HC3 dataset for word-level (Figure 8) and character-level (Figure 9) perturbations, confirming OURMODEL’s effectiveness against perturbations.

The superior performance of OURMODEL suggests that the margin-based contrastive loss effectively regularizes the model against perturbations, likely by enforcing distinct class boundaries in the latent space, as shown and discussed later in Figure 7 (a). Reliance on cross-entropy loss alone is insufficient for performance under distortion, aligning with the observed declines in other cross-entropy-based models (CoCo, RoBERTa and T5-Sentinel).

Human-LLM classification on tasks 3,4,5,6,8 proposed in MAGE/Deepfake.Best AvgRec is in bold, second best underlined.DeTeCtive left: regular result; right: with TFIA, a few-shot re-training strategy for OOD.\(^{un}\) unsupervised.\(^\bullet\) source: [13], IF (Information Fusion).\(^\partial\) source: [31].\(^\sharp\) results from our experiments.All other results from [22].
Distribution In-distribution Out-of-distribution In the wild Average
MAGE Testbed and \(^ {task \#}\) Cross-domains, Cross-models\(^4\) Cross-domains, Model-specific\(^2\) Domain-specific, Cross-models\(^3\) Domain-specific, Model-specific\(^1\) Unseen Models\(^5\) Unseen Domains\(^6\) Paraphrasing\(^8\) tasks 4,3,5,6,8
RoBERTa 87.30
SCL (ICLR 2021) 90.59
Binoculars (ICML 2024) 64.96
Longformer (ACL 2024) 90.53 96.10 93.51 96.60 86.61 68.40 66.94\(^\partial\) 81.20
GLTR (ACL 2019) 55.42 77.58 63.08 87.45 57.49 56.48 49.61\(^\partial\) 56.42
DetectGPT (PMLR, 2023)\(^{un}\) 60.48 62.31 60.48 86.37 62.31 60.48 60.94 3,4,5,6
FastText (TACL 2017) 78.80 83.02 81.67 94.54 68.61 63.54 60.89\(^\partial\) 70.70
RADAR (NeurIPS 2023)\(^\bullet\) 60.32 59.25 60.77 59.25 60.77 63.77 60.98
PAWN-GPT2 (IF 2026)\(^\bullet\) 92.86 95.05 91.74 87.70 80.31 63.06 83.13
PAWN-Llama3-1b (IF 2026)\(^\bullet\) 93.26 95.82 92.17 90.42 81.54 66.70 84.82
DeTeCtive (NeurIPS 2024) 96.15 96.73 96.11 99.77 92.19/93.03 82.60/89.63 63.97\(^\sharp\) 86.20/87.78
T5-Sentinel (EMNLP 2023)\(^\sharp\) 92.71 xx 92.56 xx 92.75 89.55 63.87 86.29
OURMODEL (Ours)\(^\sharp\) 93.83 xx 93.61 xx 93.05 93.67 68.19

5.5 Deepfake/MAGE Testbed↩︎

In AIGT detection, robust performance across multiple domains, out-of-domain texts, unseen models, and diverse prompting strategies is essential. The MAGE/Deepfake testbed is designed to evaluate how well models can detect AIGT under different realistic generation and editing scenarios. Its 1-8 tasks correspond to increasingly challenging threat models, from obvious AIGT(1), to unseen models(5)/domains(6) to subtle human-in-the-loop edits(8, paraphrasing) with 3 prompting strategies: continuation, topical and stylistic. Table ¿tbl:tab:32deepfake32all? presents Average Recall (AvgRec, i.e. averaging human-written and AIGT recall) for tasks 3,4,5,6 and 8, plus the overall average, underscoring OURMODEL’s superior efficacy.

Table ¿tbl:tab:32deepfake32all? reports AvgRec for the selected tasks. On the easier in-distribution tasks (4 and 3), OURMODEL surpasses all benchmarks, except DeTeCtive. On the harder out-of-distribution (OOD) tasks on unseen models (5), unseen domains (6), and paraphrasing (8), OURMODEL achieves state-of-the-art, surpassing even DeTeCtive’s Training-Free Incremental Adaptation (TFIA), a few-shot trained OOD adaptation strategy by up to 4-13%.

Robustness to Unseen Data/Models. OURMODEL demonstrates superior OOD performance (93%+ AvgRec on unseen models/domains), attributed to contrastive style embeddings capturing perturbation-invariant signatures. While OURMODEL trails DeTeCtive slightly in in-distribution (3-4% gap), likely due to DeTeCtive’s multi-layer/task contrasts, it demonstrates practical deployability for real-world AIGT detection in diverse, unseen scenarios like news/story generation, without retraining.

Robustness to Paraphrasing. Many detectors (DeTeCtive: 99.77%,T5-Sentinel) that score >95% on task 1 collapse to 55–65% on task 8. OURMODEL sets the state-of-the-art in this most adversarial task, significantly outperforming others, including more recent architectures, underscoring our method’s ability learn deeper resilient representations in the presence of superficial stylistic obfuscation, a common evasion tactic.

Implications on Jailbroken LLMs. Jailbreaking techniques such as token manipulation/paraphrasing [36], prompt engineering, many-shot demonstrations, log-prob manipulation may shift output conditional log probabilities, making restricted/harmful content more likely. Such LLMs could produce outputs with noticeably different styles, such as more direct, unfiltered, concise, or role-play oriented, compared to their aligned counterparts. While the performance of AIGT detection methods under such distributional shifts remain underexplored, making it a crucial and challenging direction for future exploration, we hope our findings on task 8 offers new insights.

In summery, OURMODEL achieves the highest average AvgRec (88.47) with contrastive learning vs T5-Sentinel (86.29) without, showing our approach is an effective solution for challenging AIGT detection and validating contrastive learning for resilient durable LLM fingerprinting.

6 Conclusion↩︎

OURMODEL addresses critical vulnerabilities of existing AI-generated text (AIGT) detectors to adversarial attacks. We present (1) a theoretically robust detector, grounded in embedding geometry, Bayes error bounds, and mutual information maximization, that leverages contrastive learning to enhance resilience without explicit adversarial training; (2) state-of-the-art performance in binary (AUC 0.974) and multiclass (accuracy 0.95) detection on OpenLLMText and HC3 datasets, outperforming baselines like T5-Sentinel and DeTeCtive; (3) rigorous evaluation of robustness against word- and character-level perturbations up to 80% intensity, with ablation studies confirming the importance of batched margin-based triplet loss; and (4) state-of-the-art in both out-of-distribution tasks of the MAGE/Deepfake benchmark (15% gains over priors without domain adaptation) as well as state-of-the-art in paraphrasing, the most extreme task(8). We hope this work inspires new insights in to robust perturbation-resilient AIGT detection.

Acknowledgments↩︎

Dedicated to Sugandi.

References↩︎

[1]
K. Krishna, Y. Song, M. Karpinska, J. Wieting, and M. Iyyer, “Paraphrasing evades detectors of ai-generated text, but retrieval is an effective defense,” Advances in Neural Information Processing Systems, vol. 36, pp. 27469–27500, 2023.
[2]
E. Mitchell, Y. Lee, A. Khazatsky, C. D. Manning, and C. Finn, “Detectgpt: Zero-shot machine-generated text detection using probability curvature,” in International conference on machine learning, 2023, pp. 24950–24962.
[3]
G. Huang, Y. Zhang, Z. Li, Y. You, M. Wang, and Z. Yang, “Are AI-generated text detectors robust to adversarial perturbations?” in Proceedings of the 62nd annual meeting of the association for computational linguistics (volume 1: Long papers), 2024, pp. 6005–6024.
[4]
E. Masrour, B. Emi, and M. Spero, “Damage: Detecting adversarially modified ai generated text,” arXiv preprint arXiv:2501.03437, 2025.
[5]
V. A. Oloo, C. Otieno, and L. A. Wanzare, “A literature survey on writing style change detection based on machine learning: State-of-the-art–review,” Int. J. Comput. Trends Technol., vol. 70, no. 5, pp. 15–32, 2022.
[6]
Y. Chen, H. Kang, V. Zhai, L. Li, R. Singh, and B. Raj, “Token prediction as implicit classification to identify LLM-generated text,” in Proceedings of the 2023 conference on empirical methods in natural language processing, Dec. 2023, pp. 13112–13120, doi: 10.18653/v1/2023.emnlp-main.810.
[7]
X. Liu, Z. Zhang, Y. Wang, H. Pu, Y. Lan, and C. Shen, “Coco: Coherence-enhanced machine-generated text detection under low resource with contrastive learning,” in Proceedings of the 2023 conference on empirical methods in natural language processing, 2023, pp. 16167–16188.
[8]
X. Li et al., “PRDetect: Perturbation-robust LLM-generated text detection based on syntax tree,” in Findings of the association for computational linguistics: NAACL 2025, 2025, pp. 8290–8301.
[9]
T. A. T. Staff, Technical report“Turnitin AI writing detection: Model architecture and testing protocol,” Turnitin, 2024. [Online]. Available: https://www.turnitin.com/whitepapers/turnitin-ai-writing-detection-model-architecture-and-testing-protocol.
[10]
Z. Shi, Y. Wang, F. Yin, X. Chen, K.-W. Chang, and C.-J. Hsieh, “Red teaming language model detectors with language models,” Transactions of the Association for Computational Linguistics, vol. 12, pp. 174–189, 2024.
[11]
N. Levy, A. Ashrov, and G. Katz, “Towards robust LLMs: An adversarial robustness measurement framework,” arXiv preprint arXiv:2504.17723, 2025.
[12]
X. Hu, P.-Y. Chen, and T.-Y. Ho, “Radar: Robust ai-text detection via adversarial learning,” Advances in neural information processing systems, vol. 36, pp. 15077–15095, 2023.
[13]
P. Miralles-González, J. Huertas-Tato, A. Martı́n, and D. Camacho, “Not all tokens are created equal: Perplexity attention weighted networks for AI-generated text detection,” Information Fusion, vol. 125, p. 103465, 2026.
[14]
E. Tian and A. Cui, Accessed: 2025-08-12“GPTZero: Towards detection of AI-generated text using zero-shot and supervised methods.” https://gptzero.me, 2023.
[15]
ZeroGPT, AI Detector.” https://www.zerogpt.com, Jan. 2023.
[16]
G. K. Kulatilleke, M. Portmann, and S. S. Chandra, “SCGC: Self-supervised contrastive graph clustering,” Neurocomputing, vol. 611, p. 128629, 2025.
[17]
T. Gao, X. Yao, and D. Chen, “Simcse: Simple contrastive learning of sentence embeddings,” arXiv preprint arXiv:2104.08821, 2021.
[18]
X. L. Li et al., “Contrastive decoding: Open-ended text generation as optimization,” arXiv preprint arXiv:2210.15097, 2022.
[19]
Y. Zhang, H. Zhu, Y. Wang, N. Xu, X. Li, and B. Zhao, “A contrastive framework for learning sentence representations from pairwise and triple-wise perspective in angular space,” in Proceedings of the 60th annual meeting of the association for computational linguistics (volume 1: Long papers), 2022, pp. 4892–4903.
[20]
G. K. Kulatilleke, M. Portmann, and S. S. Chandra, “Efficient block contrastive learning via parameter-free meta-node approximation,” Neurocomputing, vol. 561, p. 126850, 2023.
[21]
A. Uchendu, T. Le, and D. Lee, “Topformer: Topology-aware authorship attribution of deepfake texts with diverse writing styles,” in ECAI 2024, IOS Press, 2024, pp. 1446–1454.
[22]
X. Guo et al., “Detective: Detecting ai-generated text via multi-level contrastive learning,” Advances in Neural Information Processing Systems, vol. 37, pp. 88320–88347, 2024.
[23]
[24]
T. Brown et al., “Language models are few-shot learners,” Advances in neural information processing systems, vol. 33, pp. 1877–1901, 2020.
[25]
A. C. et. al., “PaLM: Scaling language modeling with pathways.” 2022, [Online]. Available: https://arxiv.org/abs/2204.02311.
[26]
H. Touvron et al., “LLaMA: Open and efficient foundation language models.” 2023, [Online]. Available: https://arxiv.org/abs/2302.13971.
[27]
A. Radford, J. Wu, R. Child, D. Luan, D. Amodei, and I. Sutskever, “Language models are unsupervised multitask learners,” 2019.
[28]
A. Gokaslan and V. Cohen, “OpenWebText corpus.” http://Skylion007.github.io/OpenWebTextCorpus, 2019.
[29]
OpenAI, “GPT2-output dataset.” https://github.com/openai/gpt-2-output-dataset, 2019.
[30]
B. Guo et al., “How close is ChatGPT to human experts,” Comparison corpus, evaluation, and detection, vol. 2301, 2023.
[31]
Y. Li et al., “MAGE: Machine-generated text detection in the wild,” in Proceedings of the 62nd annual meeting of the association for computational linguistics (volume 1: Long papers), 2024, pp. 36–53.
[32]
G. K. Kulatilleke, S. S. Chandra, and M. Portmann, “NBC-softmax: Darkweb author fingerprinting and migration tracking,” arXiv preprint arXiv:2212.08184, 2022.
[33]
N. Naranpanawa et al., “A tiered quadruplet network with patient-specific mining and dynamic margin for improved ugly duckling lesion classification,” in 2024 IEEE international symposium on biomedical imaging (ISBI), 2024, pp. 1–5.
[34]
I. Solaiman et al., “Release strategies and the social impacts of language models,” arXiv preprint arXiv:1908.09203, 2019.
[35]
H. E. McGovern, R. Stureborg, Y. Suhara, and D. Alikaniotis, “Your large language models are leaving fingerprints,” in Proceedings of the 1stWorkshop on GenAI content detection (GenAIDetect), 2025, pp. 85–95.
[36]
Y. Zeng, H. Lin, J. Zhang, D. Yang, R. Jia, and W. Shi, “How johnny can persuade llms to jailbreak them: Rethinking persuasion to challenge ai safety by humanizing llms,” in Proceedings of the 62nd annual meeting of the association for computational linguistics (volume 1: Long papers), 2024, pp. 14322–14350.