A decodability criterion predicts when hidden-state selection beats majority voting in large language models

arXiv:2608.17124v1 Announce Type: new Abstract: Combining the answers a large language model LLM samples for a question into one decision is a testtime information fusion problem, usually solved by majority voting.