Searcharxiv⌕ Search

arXiv · 2610.29669

Conflicted Records: Typed Adversarial Contracts for Auditable LLM Output Quality Enforcement

Abstract

LLM-generated records increasingly populate production information systems where they are treated as data assets subject to the same quality expectations as records from operational databases. A single such record can simultaneously satisfy and violate a quality rule: a grounded fact adjacent to a hallucination, a useful answer adjacent to a stereotype. Classical data cleaning cannot resolve this because the two judgments are incompatible over the same span; a single LLM judge cannot either, since it shares the training biases that produced the conflict. Existing interventions such as prompt engineering, chain-of-thought, and RLHF reduce surface error rates but provide no audit trail and cannot distinguish genuine remediation from blanket suppression. The question is whether a deterministic check over structured inter-agent records can catch the defects that referential checks alone miss. We present BiasGuard-D: two adversarial roles drawn from distinct model families exchange typed claim documents, a three-model quorum adjudicates by majority vote, and a combined referential-plus-semantic invariant validates the verdict. The semantic component fires on verdicts referential checks miss; removing the iterative loop drops invariant satisfaction sharply. The deliberation layer transfers from stereotype to hallucination remediation on HaluEval QA with only role-framing changes, raising right-answer recovery by 49 percentage points; the triage gate required a cross-family second auditor to maintain recall on objective hallucination. Every claim, vote, and instruction is stored as a typed record giving operators a provenance trail auditable under emerging AI regulations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kardelen Subasi, Jarosław A. Chudziak. 2026-10-21. Conflicted Records: Typed Adversarial Contracts for Auditable LLM Output Quality Enforcement. https://arxiv.org/abs/2610.29669

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Resilience for Regular Path Queries: Towards a Complexity Classification

The resilience problem for a query and an input set or bag database is to compute the minimum number of facts to remove from the database to make the query false. In this paper, we study how to compute the resilience of Regular Path Queries (RPQs) over graph databases. Our goal is to characterize the regular languages L for which it is tractable to compute the resilience of the existentially-quantified RPQ built from L. We show that computing the resilience in this sense is tractable (even in combined complexity) for all RPQs defined from so-called local languages. By contrast, we show hardness in data complexity for RPQs defined from the following language classes (after reducing the languages to eliminate redundant words): all finite languages featuring a word containing a repeated letter, and all languages featuring a specific kind of counterexample to being local (which we call four-legged languages). The latter include in particular all languages that are not star-free. Our results also imply a dichotomy on all languages with a so-called neutral letter. We last show tractability for some classes of non-local languages, namely the so-called bipartite chain languages and one-dangling languages, and highlight some remaining obstacles towards a full dichotomy.

cs.DB↗

Efficient Path Query Processing in Relational Database Systems

Path queries are crucial for property graphs, and there is growing interest in queries that combine regular expressions over labels with constraints on property values of vertices and edges. Efficient evaluation of such general path queries requires that intermediate results be eliminated early when there is no possible completion to a full result path. Neither state-of-the-art (SOA) graph DBMS nor relational DBMS currently can do this effectively for a large class of queries. We show that this problem can be addressed by giving a relational optimizer ``a little help'' by specifying early filtering opportunities explicitly in the query. To this end, we propose ReCAP, an abstraction that greatly simplifies the implementation of early filtering techniques for any type of property constraint for which such early filtering can be derived. No matter how complex the constraint, one only needs to implement (1) an NFA-style state transition function and (2) a handful of functions that mirror those needed for user-defined aggregates. We show that when using ReCAP, a standard relational DBMS like DuckDB can effectively push property constraints deep into the query plan, beating the SOA graph and relational DBMS by a factor up to 400,000 over a variety of queries and input graphs.

cs.DB↗

Ozone: A Unified Platform for Transportation Research

Transportation research increasingly depends on heterogeneous data from roadside cameras, UAV imagery, LiDAR, and in-vehicle sensors. Differences in data representations, model interfaces, and evaluation protocols complicate cross-dataset benchmarking and reproducibility. We present Ozone, a unified transportation research platform organized around Hardware, Data, Model, and Evaluation layers, with a Prototype layer supporting deployment-oriented applications. Its data layer links vehicle trajectories, traffic conflicts, reconstructed crashes, and digital-twin maps through a shared trajectory schema. The source inventory spans 19 trajectory datasets recorded at 59 sites in eight countries, with completed converters for 12 sources and adaptation ongoing for seven. The converters align coordinate systems, object classes, oriented bounding boxes, and kinematic fields. A shared implementation of surrogate safety measures supports conflict extraction, while map and motion constraints link crash reports to reconstructed trajectories. CARLA digital-twin maps and SUMO traffic logic connect these records to simulation, model development, and evaluation. Validation on 500 vehicles from four datasets reports mean position, heading, and speed errors below 0.15 m, 2.5°, and 0.3 m/s. A workflow study reports an 85 % reduction in experiment setup time. Case studies demonstrate human-factor experiments and automated-driving safety testing, while the model interfaces support traffic modeling and world-model research. The source code and datasets are publicly available.

cs.DB↗