SemDHT introduces a certified semantic index for discovering agent-accessible capabilities over exact-key distributed hash tables (DHTs). It uses a two-layer semantic sketch—coarse cells for grouping descriptors and residual codes for refining candidate selection—allowing providers to publish at a bounded set of derived keys while requesters probe precision keys first. Anchor committees certify descriptor-to-key consistency, enabling efficient, consistent discovery with fewer lookups and reduced publication fan‑out, as demonstrated by high recall and significant speedups over locality‑sensitive hashing in real‑world experiments.
arXiv:2608. 16502v1 Announce Type: new Abstract: Large-scale agents increasingly rely on retrieval to access external capabilities.
arXiv:2609.22486v1 Announce Type: cross Abstract: Large language models (LLMs) increasingly rely on external sources when answering questions that require proprietary information or up-to-date live w...
arXiv:2605. 28787v2 Announce Type: replace-cross Abstract: In the era of autonomous agents, machine-actionable data is critical for data-driven workflows.
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.
arXiv:2608.21375v1 Announce Type: new Abstract: Heterogeneous agentic retrieval-augmented generation (RAG) systems increasingly orchestrate external APIs, internal databases, vector stores, and graph...
arXiv:2605.05726v2 Announce Type: replace Abstract: As LLM agents are increasingly deployed with large libraries of reusable skills, selecting the right skill for a user request has become a critical...
arXiv:2607. 26766v1 Announce Type: cross Abstract: Code search in large-scale ecosystems is often hindered by the lexical gap between user queries and implementation details, alongside the trade-off between the low latency of traditional Information Retrieval (IR) and the precision of Deep Learning (DL).
arXiv:2606. 12451v1 Announce Type: new Abstract: Large language models deployed as agents over large tool catalogs face a critical tool-retrieval bottleneck.
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.
Spruce is a system that enables scalable private outsourced retrieval by learning compact binary embeddings and using efficient Hamming-distance computation under a two‑server multi‑party computation protocol. It replaces costly corpus‑wide embedding scoring with a fixed‑radius protocol that avoids multi‑round candidate selection, and introduces private cluster pruning and a one‑core dealer to reduce computation and eliminate OT preprocessing bottlenecks. Across corpora of 383K–5.42M documents, Spruce maintains original search quality while achieving up to 31.5× higher throughput and reducing query times to a few seconds.
The paper introduces Athena for Cloud Knowledge Base, a fully offline multi‑agent Retrieval Augmented Generation (RAG) system tailored for Vodafone Idea’s Telecom SNOC environment. It combines dense E5 Large V2 embeddings, BM25 sparse retrieval, and Knowledge Graph expansion, fusing results with Weighted CombSUM, cross‑encoder reranking, and MMR to produce a diverse evidence set. The framework further verifies each chunk with an LLM before response generation, discarding weak evidence and falling back to multi‑chunk evaluation when necessary, achieving an MRR@10 of 0.910 and an EM of 78.4% on a 4,200‑document corpus.
RENSA is a federated SPARQL query generation framework that extends SPARQL Builder Metadata to include class and authority information, enabling precise source selection and semantic constraint inference without runtime ASK queries. The generated metadata profiles occupy less than 1% of the original dataset triples, providing storage‑efficient insights. Evaluation on the LargeRDFBench benchmark shows that RENSA matches state‑of‑the‑art source selection performance while eliminating runtime communication overhead.