What does this equation mean?

A separate, applied study on enterprise agent routing gives a way to decompose exactly what breaks as a real tool catalogue scales, rather than only that something does. Scaling from 10 to 110 candidate agents or tools, the authors report routing F1 on under-specified requests dropping 16 to 23 percentage points across the models tested, and split that drop with an oracle analysis into two distinct components: a retrieval gap , the model’s failure to surface the correct tool at all, and a confusion gap , a roughly 10-percentage-point reduction in the theoretical best-case score that persists even when retrieval is assumed perfect [ 11 ] . Written as a decomposition of the error a shortlist of size m drawn from a full catalogue of n tools produces, where $\mathrm{tool}^\star$ is the one the request actually calls for and $S_m$ is the shortlist shown to the model: $\mathrm{error}(m) \;=\; \underbrace{\Pr[\mathrm{tool}^\star \notin S_m]}_{\text{retrieval gap, shrinks as } m \text{ grows}} \;+\; \underbrace{\Pr[\text{miscall} \mid \mathrm{tool}^\star \in S_m]}_{\text{confusion gap, grows as } m \text{ grows}}$. Widening the shortlist drives the first term toward zero and the second term upward; narrowing it does the reverse. There is no value of m that eliminates both terms at once, which is exactly why the paper reports a design fix rather than a single ideal m : embedding-based shortlisting recovered 10 to 11 percentage points of F1 at full scale, consistently across three model families and two providers, and 10 to 17 percentage points on live production traffic, validated against 1,435 human-labeled utterances [ 11 ] . The fix is not “show fewer tools” as a blanket rule. It is choosing which few to show, per request, well.