{"total":18,"rows":[{"id":"2601.07206","title":"LLMRouterBench: A Massive Benchmark and Unified Framework for LLM Routing","created":"2026-01-12","cited_by_count":38,"area":null},{"id":"2511.07885","title":"Intelligence per Watt: Measuring Intelligence Efficiency of Local AI","created":"2025-11-11","cited_by_count":14,"area":null},{"id":"2602.03478","title":"When Routing Collapses: On the Degenerate Convergence of LLM Routers","created":"2026-02-03","cited_by_count":10,"area":null},{"id":"2510.00841","title":"LLM Routing with Dueling Feedback","created":"2025-10-01","cited_by_count":7,"area":null},{"id":"2602.03584","title":"$V_0$: A Generalist Value Model for Any Policy at State Zero","created":"2026-02-03","cited_by_count":7,"area":null},{"id":"2510.09852","title":"ProxRouter: Proximity-Weighted LLM Query Routing for Improved Robustness to Outliers","created":"2025-10-10","cited_by_count":6,"area":null},{"id":"2608.08265","title":"Opportunity Is Not Realizability: Selection-Valid Diagnostics for Multi-LLM Routing","created":"2026-08-08","cited_by_count":4,"area":null},{"id":"2601.22318","title":"Federate the Router: Learning Language Model Routers with Sparse and Decentralized Evaluations","created":"2026-01-29","cited_by_count":3,"area":null},{"id":"2604.10332","title":"From GPT-3 to GPT-5: Mapping their capabilities, scope, limitations, and consequences","created":"2026-04-11","cited_by_count":3,"area":null},{"id":"2605.17106","title":"HyDRA: Hybrid Dynamic Routing Architecture for Heterogeneous LLM Pools","created":"2026-05-16","cited_by_count":1,"area":null},{"id":"2606.07587","title":"The Routing Plateau: Understanding the Accuracy Limits of LLM Routers","created":"2026-05-27","cited_by_count":1,"area":null},{"id":"2606.18774","title":"RouteJudge: An Open Platform for Reproducible and Preference-Aware LLM Routing","created":"2026-06-17","cited_by_count":1,"area":null},{"id":"2610.02762","title":"Dynamic LLM Routers are Often Misguided","created":"2026-10-02","cited_by_count":1,"area":null},{"id":"2606.06178","title":"Learning to Route LLMs from Implicit Cost-Performance Preferences via Meta-Learning","created":"2026-06-04","cited_by_count":0,"area":null},{"id":"2609.25047","title":"AIBuildAI-2.5: Efficient Autonomous AI Model Development Through LLM-Guided Tree Search","created":"2026-09-06","cited_by_count":0,"area":null},{"id":"2609.37362","title":"Pretrain Once, Route Anywhere: Towards a Foundation Model for LLM Routing","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.37402","title":"Routing Should Pay for Itself: Sparse Supervision for Economical LLM Routing","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.19198","title":"Embedding Geometry Shapes LLM Routing: Tracing Failure Modes and Improving Generalization","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}