REVIEW 2 major objections 3 minor 25 references
Reviewed by Pith at T0; open to challenge.
T0 means a machine referee read the full paper against a public rubric. The mark states how deep the mechanical check went, never who wrote it. the ladder, T0–T4 →
T0 review · grok-4.3
Embedding-based shortlisting recovers 10 to 11 percentage points of routing F1 when scaling from 10 to 110 agents.
2026-06-27 01:18 UTC pith:GQR4WE3N
load-bearing objection The paper quantifies a 16-23pp F1 drop in routing as the catalog scales to 110 agents and shows embedding shortlisting recovers 10-11pp, but the drop may partly reflect unmatched request distributions rather than scale alone. the 2 major comments →
Scaling Enterprise Agent Routing: Degradation, Diagnosis, and Recovery
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Routing F1 on under-specified requests drops 16--23 percentage points across models when the catalog expands from 10 to 110 agents. The drop decomposes into a retrieval gap and a confusion gap that lowers the oracle ceiling by 10 points. Embedding-based shortlisting recovers +10--11pp F1 at full scale across three models and two providers; a production annotation study on real traffic confirms +10--17pp recovery despite 10--15pp lower absolute scores.
What carries the argument
Embedding-based shortlisting, which retrieves a reduced candidate set of agents via vector similarity before the LLM performs final routing.
Load-bearing premise
The observed drop in routing accuracy is driven primarily by catalog scale rather than shifts in request distribution or differences between the 10-agent and 110-agent evaluation regimes.
What would settle it
Re-running the 110-agent evaluation on the exact request distribution used for the 10-agent regime and finding no F1 degradation would falsify the scale attribution.
If this is right
- Catalogs of 110 agents become feasible for production use without proportional accuracy loss when shortlisting precedes routing.
- Even perfect retrieval leaves a 10-point confusion ceiling, indicating single-step routing has inherent limits at large scale.
- The recovery holds across three different frontier models and two providers.
- Gains observed in controlled tests translate to real production traffic at comparable magnitude.
Where Pith is reading between the lines
- The same shortlisting step may reduce error rates in multi-turn or hierarchical routing setups that the paper does not test.
- Combining shortlisting with model fine-tuning on routing examples could close part of the remaining confusion gap.
- Scaling the catalog beyond 110 agents would test whether the recovered performance plateaus or continues to degrade.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies single-step routing degradation in a production enterprise assistant as the agent catalog scales from 10 to 110 agents (584 tools). It reports 16-23pp F1 drops on under-specified requests across three frontier models, decomposes the drop via oracle analysis into retrieval and confusion gaps, shows embedding-based shortlisting recovers +10-11pp F1 at full scale (across models and providers), and confirms +10-17pp recovery on 1,435 real-traffic utterances via a three-annotator production study.
Significance. If the observed degradation is attributable to catalog scale rather than distributional confounds, the work supplies concrete empirical measurements, a diagnostic decomposition, and a practical mitigation (embedding shortlisting) for scaling agent routing. The multi-model evaluation and human-validated production study are strengths that would make the findings directly useful to deployed systems.
major comments (2)
- [Evaluation methodology and results (abstract and § on scaling experiments)] The central attribution of the 16-23pp F1 drop to catalog growth (rather than request-distribution shifts between the 10-agent and 110-agent regimes) is load-bearing for interpreting the embedding-shortlisting recovery as a scale remedy. The manuscript provides no evidence that the test sets are matched (identical utterances, same distribution, or controlled sampling) across regimes; both the oracle gap decomposition and the production annotation results inherit this issue.
- [Production annotation study] The production annotation study (1,435 utterances) is presented as confirmation on real traffic, but without details on how the 10-agent vs. 110-agent subsets were sampled or whether request distributions were balanced, the +10-17pp recovery cannot be cleanly attributed to the shortlisting intervention versus other factors.
minor comments (3)
- [Methods] Dataset construction, exact prompt templates, and request-sampling procedures for the 10-agent and 110-agent regimes are not fully specified, limiting reproducibility.
- [Results tables/figures] F1 scores and recovery deltas are reported without error bars, confidence intervals, or statistical tests; adding these would strengthen the claims.
- [Shortlisting experiments] Clarify whether the embedding shortlisting uses the same embedding model across all three evaluated LLMs and both providers.
Simulated Author's Rebuttal
We thank the referee for the careful reading and for highlighting the need to strengthen the attribution of performance changes to catalog scale. We address each major comment below and will revise the manuscript accordingly to provide the requested details on test-set construction and sampling.
read point-by-point responses
-
Referee: [Evaluation methodology and results (abstract and § on scaling experiments)] The central attribution of the 16-23pp F1 drop to catalog growth (rather than request-distribution shifts between the 10-agent and 110-agent regimes) is load-bearing for interpreting the embedding-shortlisting recovery as a scale remedy. The manuscript provides no evidence that the test sets are matched (identical utterances, same distribution, or controlled sampling) across regimes; both the oracle gap decomposition and the production annotation results inherit this issue.
Authors: The requests used for the scaling experiments were drawn once from the same enterprise query log and then held fixed while the agent catalog was expanded from 10 to 110 agents; the 10-agent regime simply omits the additional agents. This design isolates catalog size as the variable. We agree that the manuscript does not state this procedure explicitly and will add a dedicated paragraph in the scaling-experiments section describing the fixed-request sampling, confirming identical utterances across regimes, and noting the controlled addition of agents. The oracle decomposition and shortlisting results will be re-stated with this clarification. revision: yes
-
Referee: [Production annotation study] The production annotation study (1,435 utterances) is presented as confirmation on real traffic, but without details on how the 10-agent vs. 110-agent subsets were sampled or whether request distributions were balanced, the +10-17pp recovery cannot be cleanly attributed to the shortlisting intervention versus other factors.
Authors: The 1,435 utterances were sampled from live traffic on the deployed 110-agent system. The 10-agent comparison was obtained by restricting the catalog available to the model during annotation while using the identical utterances. We acknowledge that the current text does not describe this restriction or any balancing steps. We will expand the production-study subsection to specify the sampling frame, the catalog-restriction method used for the 10-agent baseline, and any stratification applied to maintain request-type balance. This will make the attribution of the observed recovery to shortlisting explicit. revision: yes
Circularity Check
No circularity: purely empirical measurements with no derivations or self-referential reductions
full rationale
The paper presents direct empirical measurements of F1 degradation from 10 to 110 agents, oracle decomposition into retrieval vs. confusion gaps, recovery via embedding shortlisting, and confirmation on 1,435 human-labeled utterances. No equations, fitted parameters renamed as predictions, ansatzes, uniqueness theorems, or self-citations appear in the provided text. All reported quantities are observations on held-out or annotated data rather than quantities that reduce to their inputs by construction. The attribution of degradation to scale (vs. possible distribution shifts) is a validity concern, not a circularity issue per the evaluation rules.
Axiom & Free-Parameter Ledger
read the original abstract
Production LLM assistants route user requests to growing libraries of specialized tools, but how does routing accuracy degrade as the catalog scales? We study single-step routing on a 110-agent, 584-tool catalog from a deployed enterprise productivity assistant, evaluating three frontier models from 10 to 110 agents. Routing F1 on under-specified requests drops 16--23 percentage points across models. An oracle analysis decomposes the degradation into a \emph{retrieval} gap (the model cannot surface the right tool) and a \emph{confusion} gap (even with perfect retrieval, the oracle ceiling drops 10pp). Embedding-based shortlisting recovers +10--11pp F1 at full scale across all three models and two providers. A production annotation study (1,435 human-labeled utterances, three annotators) confirms the recovery on real traffic at +10--17pp despite 10--15pp lower absolute performance.
Figures
Reference graph
Works this paper leans on
-
[1]
LongFuncEval: Measuring the Effectiveness of Long Context Models for Function Calling , author =. 2025 , journal =. 2505.10570 , archivePrefix=
-
[2]
LiveMCPBench: Evaluating Tool-Using Agents with Real-World
Mo, Guozhao and Zhong, Wenliang and Chen, Jiawei and Yuan, Qianhao and Chen, Xuanang and Lu, Yaojie and Lin, Hongyu and He, Ben and Han, Xianpei and Sun, Le , year =. LiveMCPBench: Evaluating Tool-Using Agents with Real-World. arXiv preprint arXiv:2508.01780 , eprint =
-
[3]
2024 , booktitle =
Adaptive and Hierarchy-Aware Reranking for Tool Retrieval , author =. 2024 , booktitle =
2024
-
[4]
2024 , booktitle =
Re-Invoke: Tool Invocation Rewriting for Zero-Shot Tool Retrieval , author =. 2024 , booktitle =
2024
-
[5]
and Honaganahalli Basavaraju, Pradeep and Huber, Austin , year =
Lumer, Elias and Subbiah, Vamse Kumar and Burke, James A. and Honaganahalli Basavaraju, Pradeep and Huber, Austin , year =. Toolshed: Advanced. Proceedings of ICAART 2025 , url =
2025
- [6]
-
[7]
Towards a Science of Scaling Agent Systems
Towards a Science of Scaling Agent Systems , author =. 2026 , journal =. 2512.08296 , archivePrefix=
work page internal anchor Pith review Pith/arXiv arXiv 2026
-
[8]
2025 , booktitle =
Retrieval Models Aren't Tool-Savvy: Benchmarking Tool Retrieval for Large Language Models , author =. 2025 , booktitle =
2025
-
[9]
2025 , booktitle =
ToolGen: Unified Tool Retrieval and Calling via Generation , author =. 2025 , booktitle =
2025
-
[10]
arXiv preprint arXiv:2603.22455 , year=
Zheng, YanZhao and Zhang, ZhenTao and Ma, Chao and Yu, YuanQiang and Zhu, JiHuai and Wu, Yong and Xu, Tianze and Dong, Baohua and Zhu, Hangcheng and Huang, Ruohui and Yu, Gang , year =. SkillRouter: Skill Routing for. arXiv preprint arXiv:2603.22455 , eprint =
-
[11]
ToolScope: Enhancing
Liu, Marianne Menglin and Garcia, Daniel and Parllaku, Fjona and Upadhyay, Vikas and Shah, Syed Fahad Allam and Roth, Dan , year =. ToolScope: Enhancing. Proceedings of ACL 2026 , url =
2026
-
[12]
MonoScale: Scaling Multi-Agent System with Monotonic Improvement
Scaling Multi-Agent System with Monotonic Improvement , author =. 2026 , journal =. 2601.23219 , archivePrefix=
work page internal anchor Pith review Pith/arXiv arXiv 2026
-
[13]
RAG-MCP: Mitigating Prompt Bloat in LLM Tool Selection via Retrieval-Augmented Generation
Gan, Tiantian and Sun, Qiyao , year =. arXiv preprint arXiv:2505.03275 , eprint =
-
[14]
Qin, Yujia and Liang, Shihao and Ye, Yining and Zhu, Kunlun and Yan, Lan and Lu, Yaxi and Lin, Yankai and Cong, Xin and Tang, Xiangru and Qian, Bill and Zhao, Sihan and Hong, Lauren and Tian, Runchu and Xie, Ruobing and Zhou, Jie and Gerstein, Mark and Li, Dahai and Liu, Zhiyuan and Sun, Maosong , year =. Tool. Proceedings of the International Conference ...
-
[15]
AnyTool: Self-Reflective, Hierarchical Agents for Large-Scale
Du, Yu and Wei, Fangyun and Zhang, Hongyang , year =. AnyTool: Self-Reflective, Hierarchical Agents for Large-Scale. Proceedings of the International Conference on Machine Learning (ICML) , url =
-
[16]
ScaleCall: Agentic Tool Calling at Scale for Fintech , author =. 2025 , journal =. 2511.00074 , archivePrefix=
-
[17]
Tools are Under-Documented: Simple Document Expansion Boosts Tool Retrieval , author =. 2025 , journal =. 2510.22670 , archivePrefix=
-
[18]
Benchmark of Agentic Configurations for Enterprise Tasks , author =. 2025 , journal =. 2509.10769 , archivePrefix=
-
[19]
2025 , booktitle =
Berkeley Function Calling Leaderboard , author =. 2025 , booktitle =
2025
-
[20]
and Zhang, Tianjun and Wang, Xin and Gonzalez, Joseph E
Patil, Shishir G. and Zhang, Tianjun and Wang, Xin and Gonzalez, Joseph E. , year =. Gorilla: Large Language Model Connected with Massive
-
[21]
Hao, Shibo and Liu, Tianyang and Wang, Zhen and Hu, Zhiting , year =
-
[22]
2023 , booktitle =
Toolformer: Language Models Can Teach Themselves to Use Tools , author =. 2023 , booktitle =
2023
-
[23]
Shen, Yongliang and Song, Kaitao and Tan, Xu and Li, Dongsheng and Lu, Weiming and Zhuang, Yueting , year =
-
[24]
Liu, Zuxin and Hoang, Thai and Zhang, Jianguo and Zhu, Ming and Lan, Tian and Kokane, Shirley and Tan, Juntao and Yao, Weiran and Liu, Zhiwei and Feng, Yihao and Murthy, Rithesh and Yang, Liangwei and Savarese, Silvio and Niebles, Juan Carlos and Wang, Huan and Heinecke, Shelby and Xiong, Caiming , year =
-
[25]
2024 , journal =
Seal-Tools: Self-Instruct Tool Learning Dataset for Agent Tuning and Detailed Benchmark , author =. 2024 , journal =
2024
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.