Skip to content

Confining Nondeterminism: AI-Driven Research Systems as DBMSs for Reliable, Non-Wasteful, Transparent, and Collaborative Research [Vision]

Jul 2026 · arXiv.org · Vol abs/2607.10508 · 0 citations · 21 references
Computer Science

TL;DR

Five design rules at this boundary turn familiar database machinery, from versioning and provenance to incremental maintenance and cost-based scheduling, into guarantees that make research reliable, non-wasteful, transparent, and collaborative.

Abstract

LLM agents that conduct research (proposing ideas, writing and running code, analyzing results) can already carry a study from research question to figures, yet cannot be fully trusted. The same question asked twice in a row returns different answers; the agent announces a number that no execution produced, and tool use does not prevent this, because nothing binds what the agent reports to what its tools returned; a small upstream change leaves downstream results silently stale, with no way to list which ones; and the agent re-runs preprocessing and rewrites code it has already produced. We argue these failures share one root: every step of today's agent loop is a stochastic LLM call whose internal state nobody, including the agent, can check. Rather than trying to see inside the LLM, we take a lesson from databases, which earn trust without being watched, because deterministic operators over well-defined state make their guarantees hold by construction. We propose organizing a research project the same way. The project lives in a deterministic, versioned dataflow engine (in effect, a query plan over materialized views), and the LLM, together with the user, is a stochastic compiler that may only edit that plan. The executor never calls the LLM; LLM output enters only as versioned code and data that the executor then runs, and any asserted result enters the record only with an execution behind it. Five design rules at this boundary turn familiar database machinery, from versioning and provenance to incremental maintenance and cost-based scheduling, into guarantees that make research reliable, non-wasteful, transparent, and collaborative. This report presents the diagnosis, the requirements, and the design; the guarantee walkthrough, a prototype, and the research agenda appear in the full version, in preparation. The LLM, we argue, should be the query compiler, never the executor.

View source

Similar papers

Preprint Aug 2026

SilentProbe: Measuring Silent Failure in Production APIs Used as Agent Tools

An LLM agent calling a production API cannot distinguish a query that matched nothing from a query the server did not understand, and what predicts which one occurred, and what it does to the agent.

Zong-Rong Li, Sheng-Kun Ye, Fei-You Guo et al. · 2 citations
Preprint Sep 2026

ChurnBench: A Drift-Aware Benchmark Demonstrating That Refresh Scheduling, Not Cache Age, Governs Staleness in Agentic AI

In production, agentic systems answer questions over data that lives in several places and keeps changing: licenses are reassigned, users offboarded, prices changed, contracts renewed. Existing retrieval benchmarks freeze the data, so they cannot ask whether an agent's answer is still true, only whether it found the ri...

V. Singh, Preeti Priyam, Gautam Bhowmick · 0 citations
Review Aug 2026

Can MCP Clients Decide What to Do After Failure? A Result-Only Actionability Audit

What deterministic software can learn from a completed MCP failure result alone is studied; request arguments, schemas, discovery history, authen- tication state, transport metadata, host policy, and host policy, and host policy, and ap- plication state are outside that boundary.

Rishabh Mehan · 1 citation
Open access Sep 2026

EviGuard: Machine-Verifiable Evidence Grounding for LLM-Based Industrial Incident Reasoning

EviGuard is presented, a system that decides when an LLM’s understanding is trustworthy enough to act on and has an ensemble of deterministic verifiers label every claim supported, contradicted, or unknown against the graph—honoring interval time, event-time policy and credential versions, network reachability, and phy...

Hao-Zhe Zhou, Hang Lei, Mao-Lin Yang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.