arXiv:2606. 00402v1 Announce Type: cross Abstract: We propose a distribution-free statistical framework that converts arbitrary rewrite-based detectors into detectors with finite-sample FDR guarantees without retraining.
arXiv:2610.09976v1 Announce Type: new Abstract: AI-generated text (AIGT) detection can be sensitive to the decoding choices of the source large language model (LLM). We observe that perturbing next-t...
The paper introduces a new metric, Relative Peak Prominence Rate (RelPPR), to detect black-box LLM-generated text by measuring localized entropy fluctuations. It shows that existing dual-model and resampling-based detectors fail on instruction-conditioned text, and that RelPPR outperforms them across diverse models and datasets. The authors provide code for their detector on GitHub.
arXiv:2605.12890v2 Announce Type: replace-cross Abstract: The rapid advancement of large language models (LLMs) has made machine-generated text increasingly difficult to distinguish from human-writte...
arXiv:2607. 29539v1 Announce Type: cross Abstract: Standard AI-text detection benchmarks compare human-written text against text generated directly by large language models (LLMs).
Distinguishing machine-generated text (MGT) from human-written text (HWT) becomes increasingly important due to potential misuse. However, most supervised detectors often degrade out-of-domain (OOD) a...
arXiv:2608.29903v1 Announce Type: cross Abstract: The rapid advancement of large language models (LLMs) has made AI-generated text detection increasingly critical. Existing zero-shot detectors assume...
arXiv:2606. 06315v1 Announce Type: new Abstract: Recent advances in interpretability suggest that large language models (LLMs) implicitly encode signals in their generated text that enable self-recognition of their outputs.
The paper investigates how to detect text generated by large language models (LLMs) when the data has been edited or contaminated. By modeling human and machine text as finite-order Markov processes with Huber contamination, the authors derive an exact boundary that determines when reliable detection is possible. They show that a clipped likelihood-ratio test can achieve vanishing worst‑case errors below this boundary and that clipping improves robustness across several detectors and datasets, yielding significant gains in true‑positive rates at a fixed false‑positive rate.
The paper investigates training‑free detection of machine‑generated text using spectral analysis. It shows that spectral energy correlates with variance in token probability trajectories and that human writing produces characteristic fluctuations, termed "generative vitality." The authors find that spectral signals are strongest for long, continuous, constrained generations, while shorter or mixed texts require additional confidence‑based metrics.
The paper introduces a test‑time adaptation (TTA) method for AI text detection that addresses continual distribution shifts such as adversarial humanization, new large language models, and temporal drift in human writing. By exploiting inference‑time homogeneity among unlabeled samples, the TTA approach achieves robust performance, outperforming state‑of‑the‑art supervised detectors—e.g., improving detection of adversarial AI‑generated text from 27.0% to 93.3%. The study demonstrates that TTA can maintain high detection accuracy in real‑world, evolving deployment scenarios.
arXiv:2607. 04061v1 Announce Type: cross Abstract: Distinguishing Large Language Model (LLM) generated text from human writing is a critical and difficult challenge.
The study evaluates machine‑generated text detectors on scientific literature, finding that many detectors perform near perfectly on certain benchmarks due to superficial formatting cues rather than genuine linguistic differences. A logistic regression using 27 superficial features achieved macro‑F1 scores between 0.833 and 0.997, outperforming other detectors on arXiv subsets. The most powerful cue was the PDF extraction artifact—human texts preserve line breaks while generated texts appear as a single block—allowing classification at 0.996 AUC. By introducing format counterfactuals and normalizing formatting, the authors demonstrate that re‑wrapping machine‑written abstracts can flip 20–27% of detector decisions, reducing the generalization gap and improving out‑of‑domain performance.