Paper recorded by Signals 4 on 2026-10-05 in cs.CL. Abstract reproduced from arXiv; link to the original below.
Published 2026-10-05 on arXiv · recorded by Signals 4 on 2026-10-06
Category: cs.CL · 自然语言处理 · first seen 2026-10-06
We present T-Search, an open-weight agentic retriever for hard multi-step search. Given a question and a search tool over a fixed corpus, it runs a bounded multi-round search and returns a ranked list of evidence chunks with short justifications, leaving answer generation to a downstream model, so backend and generator can be swapped without retraining. T-Search is built on Qwen3.6-35B-A3B and tra