The paper introduces Relational Over-Regularization (ROR), a new way to detect AI‑generated text by examining sentence‑pair transition variance rather than token‑level cues. It proposes the Cross‑Source Stylometric Fingerprint Graph (CSFG), a graph‑based model that encodes positional, sequential, semantic, and transition deviation signals as learnable edge features, achieving 97.14% accuracy on binary detection and outperforming existing graph baselines by 11.14 percentage points. The approach shows strong generalization to unseen large language models in the inflated‑variance regime while maintaining a low false‑positive rate of 1.57%.
Sentence-level AI-generated text detection (S-AGTD) for hybrid documents, where humans and LLMs co-author one text, faces two gaps: existing methods classify each sentence in isolation, discarding inter-sentence dependencies, and existing benchmarks omit the newest generation of generators. We construct MOSAIC, a benchmark of 16,000 hybrid documents over PubMed and XSum, generated by DeepSeek-V3.
The paper introduces MOSAIC, a large adversarial benchmark for detecting AI-generated text, and presents NeuroStat, a new framework that combines token‑level probabilistic logits with deep semantic hidden states from a single language model. NeuroStat fuses these signals via Macro‑State Residual Modulation and uses orthogonal and contrastive losses to learn complementary representations. Experiments show that NeuroStat outperforms existing methods on MOSAIC, achieving superior robustness against adversarial attacks.
By Peiming Li, Yifan Wang, Zhiyuan Hu, Shiyu Li, Zheng Wei, Yang Tang
The paper introduces a context‑aware neural grapheme‑to‑phoneme (G2P) system for unsegmented languages like Japanese, using a discriminative conditional random field over a word lattice built from dictionaries. It addresses data scarcity by generating over two million sentences with large language models. Experiments show the method surpasses traditional morphological analyzers and neural sequence models, achieving 99.62% target word reading accuracy and very low phoneme error rates on the Joyo‑Kanji‑Yomi benchmark.
By Rui Hu, Zhenpeng Zhan, Xiaolong Lin
The paper introduces a context‑aware neural grapheme‑to‑phoneme (G2P) system for unsegmented languages like Japanese, combining a discriminative conditional random field over a dictionary‑based word lattice with large language model‑generated training data. By generating over two million synthetic sentences, the method addresses data scarcity and achieves superior performance compared to traditional morphological analyzers and neural sequence models. On the Joyo‑Kanji‑Yomi benchmark, it attains 99.62% target word reading accuracy, 0.32% target word phoneme error rate, and 0.14% sentence phoneme error rate.
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:2604. 25860v2 Announce Type: replace-cross Abstract: Machine-generated text (MGT) detection requires identifying structurally invariant signals across generation models, rather than relying on model-specific fingerprints.
By Lucio La Cava, Andrea Tagarelli
arXiv:2606. 06481v1 Announce Type: cross Abstract: As AI writing assistants become increasingly integrated into real-world drafting and revision workflows, many documents are no longer purely human-written or AI-generated, but instead result from progressive human-AI co-editing.
By Sondos Mahmoud Bsharat, Jiacheng Liu, Xiaohan Zhao, Tianjun Yao, Xinyi Shang, Yi Tang, Jiacheng Cui, Ahmed Elhagry, Salwa K. Al Khatib, Hao Li, Salman Khan, Zhiqiang Shen
The paper introduces Pattern Stability Score (PSS), a watermark detection framework that uses local statistical features and stability dynamics across paraphrased variants to identify machine-generated text. PSS combines global and local z‑score features with higher‑order run‑length statistics, autocorrelation signals, and stability scores over paraphrase depth. Experiments on PG‑19, CNN/DailyMail, and WikiText with Llama‑3‑8B, Qwen2‑7B, and multiple paraphrasers show that PSS improves detection AUC by 10‑15 percentage points and a single universal classifier achieves over 87.8% AUC across diverse LLMs, paraphrasers, and domains without retraining.
By Sina Mansouri, Mohit Marvania, Abolfazl Safikhani
arXiv:2607. 14113v1 Announce Type: cross 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.
By Gayan K. Kulatilleke, Mahsa Baktashmotlagh, Siamak Layeghy, Marius Portmann
arXiv:2510. 04567v3 Announce Type: replace-cross Abstract: Graph Neural Networks (GNNs) are powerful tools for processing relational data but often struggle to generalize to unseen graphs, giving rise to the development of Graph Foundational Models (GFMs).
By Weishuo Ma, Yanbo Wang, Xiyuan Wang, Lei Zou, Muhan Zhang
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.
By Haitong Luo, Xuying Meng, Weiyao Zhang, Wenji Zou, Shengfeng Lou, Xuefeng Jiang, Chungang Lin, Yujun Zhang