{"total":61,"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":"2601.07206","title":"LLMRouterBench: A Massive Benchmark and Unified Framework for LLM Routing","created":"2026-01-12","cited_by_count":38,"area":null},{"id":"2508.12631","title":"Beyond GPT-5: Making LLMs Cheaper and Better via Performance-Efficiency Optimized Routing","created":"2025-08-18","cited_by_count":34,"area":null},{"id":"2505.07176","title":"Internet of Agents: Fundamentals, Applications, and Challenges","created":"2025-05-12","cited_by_count":31,"area":"agents"},{"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":"2603.04445","title":"Dynamic Model Routing and Cascading for Efficient LLM Inference: A Survey","created":"2026-02-23","cited_by_count":19,"area":"inference"},{"id":"2504.02051","title":"Self-Resource Allocation in Multi-Agent LLM Systems","created":"2025-04-02","cited_by_count":15,"area":"agents"},{"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.02823","title":"R2-Router: A New Paradigm for LLM Routing with Reasoning","created":"2026-02-02","cited_by_count":14,"area":"lr"},{"id":"2601.17814","title":"MMR-Bench: A Comprehensive Benchmark for Multimodal LLM Routing","created":"2026-01-25","cited_by_count":13,"area":"mllm"},{"id":"2607.00053","title":"SWE-Router: Routing in Multi-turn Agentic Software Engineering Tasks","created":"2026-06-30","cited_by_count":11,"area":"agents"},{"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":"2602.21227","title":"Budget-Aware Agentic Routing via Boundary-Guided Training","created":"2026-02-04","cited_by_count":10,"area":"agents"},{"id":"2512.23562","title":"VL-RouterBench: A Benchmark for Vision-Language Model Routing","created":"2025-12-29","cited_by_count":8,"area":"mllm"},{"id":"2601.11340","title":"Neural Chain-of-Thought Search: Searching the Optimal Reasoning Path to Enhance Large Language Models","created":"2026-01-16","cited_by_count":8,"area":"lr"},{"id":"2608.08239","title":"The Replay Gap: Static Evaluation of Model Switching in LLM Agents Scores the Wrong World","created":"2026-08-08","cited_by_count":8,"area":"agents"},{"id":"2603.06616","title":"RACER: Risk-Aware Calibrated Efficient Routing for Large Language Models","created":"2026-02-20","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":"2506.06579","title":"Towards Efficient Multi-LLM Inference: Characterization and Analysis of LLM Routing and Hierarchical Techniques","created":"2025-06-06","cited_by_count":5,"area":null},{"id":"2509.06274","title":"IPR: Intelligent Prompt Routing with User-Controlled Quality-Cost Trade-offs","created":"2025-09-08","cited_by_count":5,"area":null},{"id":"2604.15022","title":"Route to Rome Attack: Directing LLM Routers to Expensive Models via Adversarial Suffix Optimization","created":"2026-04-16","cited_by_count":5,"area":"safety"},{"id":"2607.03436","title":"What Does a Routing Oracle Measure Under Stochastic Decoding? Coupling, Scorer Choice, and Single-Commit Ceilings","created":"2026-07-03","cited_by_count":5,"area":null},{"id":"2601.19402","title":"PROTEUS: SLA-Aware Routing via Lagrangian RL for Multi-LLM Serving Systems","created":"2026-01-27","cited_by_count":4,"area":null},{"id":"2608.06867","title":"LLMRouter: Unified Infrastructure for Developing, Evaluating, and Deploying LLM Routers","created":"2026-08-07","cited_by_count":4,"area":null},{"id":"2608.23023","title":"Most of the LLM Routing Gap Is Task Type","created":"2026-08-24","cited_by_count":4,"area":null},{"id":"2601.05903","title":"HAPS: Hierarchical LLM Routing with Joint Architecture and Parameter Search","created":"2026-01-09","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":"2602.01240","title":"Minimizing Mismatch Risk: A Prototype-Based Routing Framework for Zero-shot LLM-generated Text Detection","created":"2026-02-01","cited_by_count":3,"area":null},{"id":"2602.11877","title":"Towards Fair and Comprehensive Evaluation of Routers in Collaborative LLM Systems","created":"2026-02-12","cited_by_count":3,"area":null},{"id":"2603.03761","title":"AgentSelect: Benchmark for Narrative Query-to-Agent Recommendation","created":"2026-03-04","cited_by_count":3,"area":"agents"},{"id":"2604.27366","title":"Judge, Then Drive: A Critic-Centric Vision Language Action Framework for Autonomous Driving","created":"2026-04-30","cited_by_count":3,"area":"vla"},{"id":"2606.06924","title":"From Sampled Outcomes to Capability Distributions: Rethinking Supervision for LLM Routing","created":"2026-06-05","cited_by_count":3,"area":"lr"},{"id":"2505.14524","title":"Guarded Query Routing for Large Language Models","created":"2025-05-20","cited_by_count":2,"area":"safety"},{"id":"2603.11011","title":"Task-Aware Delegation Cues for LLM Agents","created":"2026-03-11","cited_by_count":2,"area":"agents"},{"id":"2604.23623","title":"Tandem: Riding Together with Large and Small Language Models for Efficient Reasoning","created":"2026-04-26","cited_by_count":2,"area":"lr"},{"id":"2605.25424","title":"SeqRoute: Global Budget-Aware Sequential LLM Routing via Offline Reinforcement Learning","created":"2026-05-25","cited_by_count":2,"area":"offlinerl"},{"id":"2609.05824","title":"Beyond Top-$k$ Skill Retrieval: Diversity-Aware Skill Routing for LLM Agents","created":"2026-09-05","cited_by_count":2,"area":"agents"},{"id":"2505.16221","title":"LightRouter: Towards Efficient LLM Collaboration with Minimal Overhead","created":"2025-05-22","cited_by_count":1,"area":null},{"id":"2506.21638","title":"R1-Ranker: Teaching LLM Rankers to Reason","created":"2025-06-25","cited_by_count":1,"area":"lr"},{"id":"2508.05585","title":"DART: Dual Adaptive Refinement Transfer for Open-Vocabulary Multi-Label Recognition","created":"2025-08-07","cited_by_count":1,"area":null},{"id":"2605.07075","title":"ModelLens: Finding the Best for Your Task from Myriads of Models","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2606.08684","title":"BLUE: Toward Better Language Use in Efficient Vision-Language-Action Models for Autonomous Driving","created":"2026-06-07","cited_by_count":1,"area":"vla"},{"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.08665","title":"Resample or Reroute? Recoverable Stopping Debt Without Identified Action Selection","created":"2026-07-09","cited_by_count":1,"area":null},{"id":"2609.00482","title":"Are Near-Tied LLM Rankings Robust to Family-DIF-Guided Benchmark Recomposition?","created":"2026-08-31","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":"2509.14171","title":"AssoCiAm: A Benchmark for Evaluating Association Thinking while Circumventing Ambiguity","created":"2025-09-17","cited_by_count":0,"area":"lr"},{"id":"2509.24814","title":"A Greedy PDE Router for Blending Neural Operators and Classical Methods","created":"2025-09-29","cited_by_count":0,"area":null},{"id":"2512.05542","title":"RoBoN: Routed Online Best-of-n for Test-Time Scaling with Multiple LLMs","created":"2025-12-05","cited_by_count":0,"area":"lr"},{"id":"2601.11792","title":"A self-evolving multi-role collaborative framework with fine-grained difficulty guidance for innovative mathematical problem generation","created":"2026-01-16","cited_by_count":0,"area":"synth"},{"id":"2603.29206","title":"Route-Induced Density and Stability (RIDE): Controlled Intervention and Mechanism Analysis of Routing-Style Meta Prompts on LLM Internal States","created":"2026-03-31","cited_by_count":0,"area":"moe"},{"id":"2604.06296","title":"AgentOpt v0.1 Technical Report: Client-Side Optimization for LLM-Based Agent","created":"2026-04-07","cited_by_count":0,"area":"agents"},{"id":"2608.15817","title":"RLCascadeRouter: Quality-Estimator-Free Cascade Routing via Reinforcement Learning","created":"2026-08-16","cited_by_count":0,"area":"lr"},{"id":"2609.15992","title":"Optimal Model Activation Policies for Inference Networks of Large Language Models","created":"2026-07-07","cited_by_count":0,"area":null},{"id":"2609.30017","title":"Canopy: Exploiting Piecewise Smooth Tree Priors for Multi-Fidelity Bandits","created":"2026-09-24","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":"2610.01627","title":"What Makes Something Hard(er)? Explaining Question Difficulty in Natural Language","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.05982","title":"Breaking the Tie: A Cluster-Aware Routing Framework for Large Language Models","created":"2026-10-05","cited_by_count":0,"area":null},{"id":"2610.12242","title":"TokenRouter: Efficient Serving System for Token-Level LLM Routing","created":"2026-10-08","cited_by_count":0,"area":"inference"},{"id":"2610.13276","title":"CopRoute: Dependence-Aware Conformal Routing for Language Models","created":"2026-10-09","cited_by_count":0,"area":null},{"id":"2610.17816","title":"Empowering Edge Agents: A Systematic Analysis of Edge-Cloud Collaboration in LLM Agent Execution","created":"2026-10-13","cited_by_count":0,"area":"agents"}],"next_cursor":null}