arXiv AI

Version- and Scope-Aware Question Answering over Normative Documents: A Deployed System and an End-to-End Evaluation at Production Scale

The paper presents a deployed system for answering questions over normative documents that is aware of document version and scope. It evaluates a hosted retrieval service against a governed system that applies explicit rules for version and scope resolution, finding the governed system achieves a higher score (97.7 vs 88.1). The study includes a public benchmark, evaluation scripts, and reports commercial deployment metrics, such as 1,126 users and 100,000 calls per day by April 2026.

arXiv Computation and Language
Sep 1

Cloud and On-Premises Deployment of Uzbek Legal RAG via Targeted Retriever Fine-Tuning

The paper reports on building a retrieval‑augmented legal assistant for Uzbek that operates in both a managed cloud service and an on‑premises deployment. It introduces two new domain benchmarks—one for retrieval and one for end‑to‑end QA—and shows that fine‑tuning an open‑weight text embedder (UTE‑1) can close the performance gap with proprietary models under tight cost and latency constraints. The authors also provide negative results for a QLoRA experiment and release the benchmarks, evaluation code, and the fine‑tuned embedder for future low‑resource legal NLP work.

By Tatul Danielyan, Mariam Avetisyan, Hrant Davtyan
arXiv AI
Sep 25

Ingest-Time Fact Compilation for Cost-Efficient and Reliable Question Answering over Revised Corpora

The paper introduces ingest‑time fact compilation, an architecture that preprocesses and compiles corpus data into self‑contained facts with resolved revisions, deletions, and source trust. By storing this compiled state, query‑time models can retrieve answers directly, avoiding costly reconstruction from raw passages. Experiments show that this approach reduces read cost per question by 12.89× and token usage by 21.6× while maintaining accuracy.

By Kyle Wild, Yusuke Takahashi, Asako Uraki
arXiv AI
Aug 11

Time Present and Time Past: Benchmarking Large Language Models on Temporally Evolving Document Understanding

arXiv:2608. 08512v1 Announce Type: new Abstract: Evolving documents, such as laws, tax codes, and software documentation, are amended, replaced, and sometimes reverted over time, so a question has different correct answers at different dates.

By Mahbub E Sobhani, Md. Faiyaz Abdullah Sayeedi, Fahmid Hasan Chowdhury, Md Adnan Arefeen, Farig Sadeque, Md. Faizul Bari, Swakkhar Shatabda
arXiv AI
Aug 28

Why RAGs Hallucinate: Penalty-Aware Evaluation of Retrieval-Augmented Generation Systems with Knowledge-Gap Canaries

The paper introduces a penalty‑aware evaluation framework for Retrieval‑Augmented Generation (RAG) systems that uses asymmetric scoring, knowledge‑gap canaries, and a failure‑attribution pipeline. Applying this framework to three commercial RAG products and a baseline on SimpleQA‑Verified, the authors find that while overall accuracy is similar across systems, canary violation rates vary dramatically, showing that systems differ more in when they answer than in what they answer. The study demonstrates that penalty‑aware scoring can reorder system rankings and is robust across different penalty settings.

By Alden Do Rosario, Hussein Younes, Felipe Pires
arXiv Computation and Language
Sep 2

Staged Linguistic Seeding: Grounded Query Expansion for Verified-Unit QA in AI Contact Centers

The paper presents a system for AI contact centers that answers questions only from a closed set of verified QA units, returning the unit verbatim or routing to clarification, abstention, or handoff. The index is enriched offline using staged linguistic seeding (SLS), where human-authored slot recipes are expanded by GPT‑4.1‑mini and lightly filtered by humans, enabling a single retrieval pass without query-time generation. On held‑out data from two industrial domains, SLS improves hybrid retrieval recall at rank 1 to 0.881/0.930 and outperforms doc2query by 0.20/0.32, while also reducing unsupported content from 7‑13% to near 0%.

By Hyeonseop Yoon, Jeong-Eun Park
arXiv AI
Aug 24

Clarify-Then-Search: A Clarification Benchmark for Deep Search with End-to-End Nugget Restoration

Clarify-Then-Search is a benchmark that tests whether large language models can ask clarification questions to improve the usefulness of deep search results. It uses 518 real-world query pairs from Baidu, where each intent query is paired with an underspecified version. The evaluation involves a clarifier asking up to three questions, a user answerer providing only explicit information, and a rewriter generating a new query that is then searched; performance is measured by a weighted nugget-recall score.

By Deqiang Huang, Jingbo Zhou, Xinjiang Lu, Tong Xu, Hua Wu, Enhong Chen
arXiv AI
Jul 3

ContextNest: Verifiable Context Governance for Autonomous AI Agent

arXiv:2607. 02116v1 Announce Type: new Abstract: Autonomous AI agents increasingly depend on external knowledge stores, yet most retrieval pipelines provide relevance without durable guarantees of provenance, version identity, integrity, traceability, or point-in-time reconstruction.

By Misha Sulpovar (PromptOwl, LLC), Benn R. Konsynski (Goizueta Business School, Emory University), Qaish Kanchwala (IBM Research), Gabe Goodhart (IBM Research)