{"total":35,"rows":[{"id":"2505.19797","title":"The Avengers: A Simple Recipe for Uniting Smaller Language Models to Challenge Proprietary Giants","created":"2025-05-26","cited_by_count":38,"area":null},{"id":"2502.20576","title":"OmniRouter: Budget and Performance Controllable Multi-LLM Routing","created":"2025-02-27","cited_by_count":35,"area":null},{"id":"2510.00202","title":"RouterArena: An Open Platform for Comprehensive Comparison of LLM Routers","created":"2025-09-30","cited_by_count":22,"area":null},{"id":"2508.12491","title":"Cost-Aware Contrastive Routing for LLMs","created":"2025-08-17","cited_by_count":16,"area":null},{"id":"2509.24496","title":"LLM DNA: Tracing Model Evolution via Functional Representations","created":"2025-09-29","cited_by_count":15,"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":"2604.12385","title":"From Myopic Selection to Long-Horizon Awareness: Sequential LLM Routing for Multi-Turn Dialogue","created":"2026-04-14","cited_by_count":4,"area":null},{"id":"2506.17254","title":"Near-Optimal Online Deployment and Routing for Streaming LLMs","created":"2025-06-08","cited_by_count":3,"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":"2603.26796","title":"Robust Batch-Level Query Routing for Large Language Models under Cost and Capacity Constraints","created":"2026-03-25","cited_by_count":3,"area":null},{"id":"2504.15300","title":"Collaborative Learning of On-Device Small Model and Cloud-Based Large Model: Advances and Future Directions","created":"2025-04-17","cited_by_count":2,"area":null},{"id":"2511.09373","title":"Routesplain: Towards Faithful and Intervenable Routing for Software-related Tasks","created":"2025-11-12","cited_by_count":2,"area":null},{"id":"2601.21082","title":"LOCUS: Low-Dimensional Model Embeddings for Efficient Model Exploration, Comparison, and Selection","created":"2026-01-28","cited_by_count":2,"area":null},{"id":"2604.01418","title":"Cost-Efficient Estimation of General Abilities Across Benchmarks","created":"2026-04-01","cited_by_count":2,"area":null},{"id":"2604.17827","title":"Local-First Intelligence via Proactive SLM Collaborating with Feedback-Providing LLM","created":"2026-04-20","cited_by_count":2,"area":null},{"id":"2606.09668","title":"Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret","created":"2026-06-08","cited_by_count":2,"area":null},{"id":"2608.20316","title":"Pandora's AI Model Routing Box: Efficient Allocation with Costly Value Estimation","created":"2026-08-20","cited_by_count":2,"area":null},{"id":"2512.09386","title":"CONCUR: A Framework for Continual Constrained and Unconstrained Routing","created":"2025-12-10","cited_by_count":1,"area":null},{"id":"2601.01330","title":"Beyond Gemini-3-Pro: Revisiting LLM Routing and Aggregation at Scale","created":"2026-01-04","cited_by_count":1,"area":null},{"id":"2604.15728","title":"Privacy-Preserving LLMs Routing","created":"2026-04-17","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":"2607.06145","title":"Prompting Complexity: Shortest Prompts for Texts and Behaviors in LLMs","created":"2026-07-07","cited_by_count":1,"area":null},{"id":"2607.18253","title":"Mind the Delay: Latency-aware Query Routing for Heterogeneous LLM pools","created":"2026-05-13","cited_by_count":1,"area":null},{"id":"2608.12719","title":"Error-Aware Reverse Auction Mechanism for Large Language Model Routing","created":"2026-08-13","cited_by_count":1,"area":null},{"id":"2609.38585","title":"FlexRouter: Learning Complementary Model Sets for Flexible LLM Routing","created":"2026-09-29","cited_by_count":1,"area":null},{"id":"2603.24376","title":"GeoRouter: Dynamic Paradigm Routing for Worldwide Image Geolocalization","created":"2026-03-25","cited_by_count":0,"area":null},{"id":"2605.30018","title":"Latent Performance Profiling of Large Language Models","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2606.04378","title":"DLLG: Dynamic Logit-Level Gating of LLM Experts","created":"2026-06-03","cited_by_count":0,"area":null},{"id":"2609.11656","title":"Learnware and AI Model Management System","created":"2026-09-10","cited_by_count":0,"area":null},{"id":"2609.34736","title":"SeLMRoute: Probabilistic Semantic Evidence for Large Language Model Routing","created":"2026-09-28","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.13276","title":"CopRoute: Dependence-Aware Conformal Routing for Language Models","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}