arXiv:2608.31082v1 Announce Type: new
Abstract: Valuable data remains embedded in unstructured sources: web pages, reports, contracts, filings, earnings calls, and PDFs. The big bet in enterprise AI...
By Milad Rezaei Hajidehi, Qitong Wang, Stratos Idreos
The paper introduces Librarian Agents, a framework that trains large language models to proactively curate long-context workspaces by reorganizing raw documents into a hierarchical filesystem of synthetic files and reference links. This builder agent, optimized via reinforcement learning, aims to maximize downstream answering accuracy by anticipating future queries rather than reacting to them. Experiments show that Librarian Agents outperform leading retrieval and precomputation methods, achieving a 33‑point accuracy gain on BrowseComp‑Plus and a 31‑point improvement on BRIGHT in zero‑shot settings.
By Anikait Singh, Teresa Zhang, Yoonho Lee, Roshen Sanjay Nair, Aviral Kumar, Chelsea Finn
arXiv:2609.09410v1 Announce Type: new
Abstract: While autonomous agents have made significant strides in "deep research" by iteratively navigating the open web to synthesize information, real-world p...
By Ruofan Wu, Peiran Xu, Xiaolong Li, Fan Shu, Soyoung Yoon, Yite Wang, Xiaodong Yu, Boyi Liu, Feng Yan, Debiao Li, Yuxiong He, Zhewei Yao
arXiv:2609.37226v1 Announce Type: cross
Abstract: Answering questions and completing tasks over large document collections often requires connecting evidence spread across multiple documents, such as...
By Soyeong Jeong, Sujay Kumar Jauhar, Sung Ju Hwang, Andrew Joohun Nam
Large language models are increasingly deployed as agents that reason over documents rather than answer from parametric knowledge. We study archive-grounded reasoning: locating sparse evidence across a large, messy collection of workplace files, reconciling inconsistent terminology, units, and time conventions, and computing an answer.
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