arXiv — NLP / Computation & Language · · 3 min read

Two Conformal Constructions for Adaptive Within-Document AI-Text Screening

Mirrored from arXiv — NLP / Computation & Language for archival readability. Support the source by reading on the original site.

Statistics > Methodology

arXiv:2609.31547 (stat)
[Submitted on 25 Sep 2026]

Title:Two Conformal Constructions for Adaptive Within-Document AI-Text Screening

View a PDF of the paper titled Two Conformal Constructions for Adaptive Within-Document AI-Text Screening, by Marco Mandap and 6 other authors
View PDF HTML (experimental)
Abstract:We study false-alert control when screening for text generated by artificial intelligence (AI). The screening procedure selects document prefixes and detectors from observed evidence and may stop before exhausting its inspection budget. We give two finite-sample constructions under document-level exchangeability between human calibration documents and a new null document, with no restriction on dependence among tokens within a document. Construction A registers a finite family of prefix-detector scores and allocates a false-alert budget across their conformal ranks. A union bound protects any executed subset of that family. Construction B calibrates the complete-path maximum of a development-fixed adaptive policy. Each partial-path maximum is bounded by the complete maximum, so a terminal conformal rank protects early stopping without splitting the error budget. We prove marginal control of any false alert across the permitted inspection path and derive necessary calibration counts for rejection. We also state oracle testing, distribution-shift, and independent-audit bounds with their additional assumptions. Both constructions protect stopping within their specified scope; neither proof constructs an e-process or justifies multiplying conformal ranks. Detection power and computational savings remain questions for empirical evaluation.
Comments: 16 pages, 0 figures; theoretical manuscript; no empirical evaluation
Subjects: Methodology (stat.ME); Computation and Language (cs.CL)
MSC classes: 62G10, 62L10, 62J15, 68T50
ACM classes: G.3; I.2.7
Cite as: arXiv:2609.31547 [stat.ME]
  (or arXiv:2609.31547v1 [stat.ME] for this version)
  https://doi.org/10.48550/arXiv.2609.31547
arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Marco Mandap PhD [view email]
[v1] Fri, 25 Sep 2026 17:18:39 UTC (30 KB)
Full-text links:

Access Paper:

Current browse context:

stat.ME
< prev   |   next >
Change to browse by:

References & Citations

Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — NLP / Computation & Language