{"total":23,"rows":[{"id":"2508.21141","title":"Adaptive LLM Routing under Budget Constraints","created":"2025-08-28","cited_by_count":24,"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":"2510.08439","title":"xRouter: Training Cost-Aware LLMs Orchestration System via Reinforcement Learning","created":"2025-10-09","cited_by_count":17,"area":null},{"id":"2603.22161","title":"Causal Evidence that Language Models use Confidence to Drive Behavior","created":"2026-03-23","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":"2604.05306","title":"LLMs Should Express Uncertainty Explicitly","created":"2026-04-07","cited_by_count":6,"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":"2509.24988","title":"Generalized Correctness Models: Learning Calibrated and Model-Agnostic Correctness Predictors from Historical Patterns","created":"2025-09-29","cited_by_count":5,"area":null},{"id":"2601.03511","title":"IntroLM: Introspective Language Models via Prefilling-Time Self-Evaluation","created":"2026-01-07","cited_by_count":3,"area":null},{"id":"2601.04544","title":"TCAndon-Router: Adaptive Reasoning Router for Multi-Agent Collaboration","created":"2026-01-08","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":"2608.02528","title":"Uncertainty Is Not Enough: Value-of-Information Routing for Mixtures of LoRA Experts","created":"2026-08-03","cited_by_count":2,"area":null},{"id":"2509.07309","title":"PIE: Performance Interval Estimation for Free-Form Generation Tasks","created":"2025-09-09","cited_by_count":1,"area":null},{"id":"2509.25535","title":"Meta-Router: Bridging Gold-standard and Preference-based Evaluations in Large Language Model Routing","created":"2025-09-29","cited_by_count":1,"area":null},{"id":"2603.19149","title":"Optimal Splitting of Language Models from Mixtures to Specialized Domains","created":"2026-03-19","cited_by_count":1,"area":null},{"id":"2606.00251","title":"Capability Self-Assessment in Large Language Models","created":"2026-05-29","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":"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":"2601.02574","title":"Fact-Checking with Large Language Models via Probabilistic Certainty and Consistency","created":"2026-01-05","cited_by_count":0,"area":null},{"id":"2602.12005","title":"LaCy: What Small Language Models Can and Should Learn is Not Just a Question of Loss","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2607.12273","title":"Code-MUE: Measuring Code LLMs' Uncertainty through Execution-based Semantic Interaction Graphs","created":"2026-07-14","cited_by_count":0,"area":null},{"id":"2608.26121","title":"Can a Model Catch Its Own Hallucinations for Free?: Label-Free Doubt Signals Hold Their Own Against a Labelled Dataset for Abstention","created":"2026-06-19","cited_by_count":0,"area":null},{"id":"2609.38006","title":"HARISSA: Inference-Time Self-Checks for Efficient and Safe Local Language Model Deployment","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}