Prior Knowledge Makes It Possible: From Sublinear Graph Algorithms to LLM Test-Time Methods

In three linesTheoretical paper formulating multi-step reasoning as s-t connectivity on knowledge graphs. Shows phase transition: if pre-training knowledge is fragmented into small components, augmentation requires Ω(√n) queries; once density threshold is crossed forming a giant component, constant expected queries suffice.

Summary generated by Claude — human-verified