Most routing rulebooks are built as precedence lists. When two sources disagree, the higher-ranked source wins, and latency shows up nowhere in the rules. That works until the slow source is the accurate one. Precedence lists in production systems often follow a fixed order of specificity or scope, and the order is chosen for determinism, not for expected value (see how Archer resolves conflicting data-driven event actions: section-level settings outrank field-level ones regardless of anything else).
The first search result on "routing by latency" will tell you to optimize time to first token, cache aggressively, and route cheap queries to cheap models. That framing treats latency as a user-experience metric. For conflicting-source routing it is something else: latency is the price you pay to reduce the chance of a wrong answer. Waiting three seconds for a reconciled record is a cost you incur to lower the probability that you act on stale or partial data.
Once you see latency that way, the decision stops being "fast versus slow" and becomes "expected cost of the fast answer versus expected cost of the slow answer." That is a comparison you can compute, argue about with numbers, and put in a policy file.
The research on conflicting evidence supports treating the two as one problem. Work on retrieval with ambiguity, noise and misinformation finds that systems handling these conflicts at once still leave a substantial gap, and that performance degrades as supporting evidence and misinformation become more imbalanced (RAG with Conflicting Evidence). A routing rule that always prefers the fast source is a bet that the fast source is usually right. That bet is measurable.



