During generation, each query starts at the top of the tree and recursively follows promising branches to the original keys.
While top-K routing must discard evidence as context grows, top-p adapts: precise lookups explore few branches, but complex queries can explore more.
