Prior threshold-pruned beam summing methods for TLMs produce lower bounds with unknown error

Prior work uses a computational shortcut based on source prefix probabilities, then approximates the resulting sum with threshold-pruned beam summing. This produces a lower bound with unknown error.

http://arxiv.org/abs/2608.27428v1