Chain-in-Tree: Back to Sequential Reasoning in LLM Tree Search

ArXi:2509.25835v4 Announce Type: replace Test-time scaling improves large language models (LLMs) on long-horizon reasoning tasks by allocating compute at inference. LLM inference via tree search (LITS) achieves strong performance but is highly inefficient. We propose Chain-in-Tree (CiT), a plug-in framework that decides when to branch during search instead of expanding at every step. CiT