{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NFLFPT4JOSI5XWKLTBRUCRSYGL","short_pith_number":"pith:NFLFPT4J","schema_version":"1.0","canonical_sha256":"695657cf897491dbd94b986341465832d83e5b233e5a3865453b9a6c5f745c05","source":{"kind":"arxiv","id":"2502.03261","version":2},"attestation_state":"computed","paper":{"title":"CARROT: A Cost Aware Rate Optimal Router","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NI","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Allysson Flavio Melo de Oliveira, Felipe Maia Polo, Mikhail Yurochkin, M\\'irian Silva, Onkar Bhardwaj, Prattyush Mangal, Seamus Somerstep, Subha Maity","submitted_at":"2025-02-05T15:17:25Z","abstract_excerpt":"With the rapid growth in the number of Large Language Models (LLMs), there has been a recent interest in LLM routing, or directing queries to the cheapest LLM that can deliver a suitable response. We conduct a minimax analysis of the routing problem, providing a lower bound and finding that a simple router that predicts both cost and accuracy for each question can be minimax optimal. Inspired by this, we introduce CARROT, a Cost AwaRe Rate Optimal rouTer that selects a model based on estimates of the models' cost and performance. Alongside CARROT, we also introduce the Smart Price-aware ROUTin"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.03261","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2025-02-05T15:17:25Z","cross_cats_sorted":["cs.LG","cs.NI","math.ST","stat.TH"],"title_canon_sha256":"28b34c9a80b51a96661c5491f4135e4b93007721ea6afc448b83f9d5fb7ba8a3","abstract_canon_sha256":"d8bdda827d433fc858b74b2762c673232dece3681e07e96174d8a3f6217dd516"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:39.713484Z","signature_b64":"PX/Ug6jAG2xcqIKROjoOFvDb8Pk/VJ/cntPdC/M50IiQW3iIi224RvuCbz1vANczLrAzaDC32UdPzrgDLOpcAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"695657cf897491dbd94b986341465832d83e5b233e5a3865453b9a6c5f745c05","last_reissued_at":"2026-07-05T11:05:39.713004Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:39.713004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CARROT: A Cost Aware Rate Optimal Router","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.NI","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Allysson Flavio Melo de Oliveira, Felipe Maia Polo, Mikhail Yurochkin, M\\'irian Silva, Onkar Bhardwaj, Prattyush Mangal, Seamus Somerstep, Subha Maity","submitted_at":"2025-02-05T15:17:25Z","abstract_excerpt":"With the rapid growth in the number of Large Language Models (LLMs), there has been a recent interest in LLM routing, or directing queries to the cheapest LLM that can deliver a suitable response. We conduct a minimax analysis of the routing problem, providing a lower bound and finding that a simple router that predicts both cost and accuracy for each question can be minimax optimal. Inspired by this, we introduce CARROT, a Cost AwaRe Rate Optimal rouTer that selects a model based on estimates of the models' cost and performance. Alongside CARROT, we also introduce the Smart Price-aware ROUTin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.03261","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.03261/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.03261","created_at":"2026-07-05T11:05:39.713061+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.03261v2","created_at":"2026-07-05T11:05:39.713061+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.03261","created_at":"2026-07-05T11:05:39.713061+00:00"},{"alias_kind":"pith_short_12","alias_value":"NFLFPT4JOSI5","created_at":"2026-07-05T11:05:39.713061+00:00"},{"alias_kind":"pith_short_16","alias_value":"NFLFPT4JOSI5XWKL","created_at":"2026-07-05T11:05:39.713061+00:00"},{"alias_kind":"pith_short_8","alias_value":"NFLFPT4J","created_at":"2026-07-05T11:05:39.713061+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00053","citing_title":"SWE-Router: Routing in Multi-turn Agentic Software Engineering Tasks","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17110","citing_title":"Capturing LLM Capabilities via Evidence-Calibrated Query Clustering","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27361","citing_title":"Natural Language Query to Configuration for Retrieval Agents","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07587","citing_title":"The Routing Plateau: Understanding and Breaking the Accuracy Limits of LLM Routers","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17110","citing_title":"Capturing LLM Capabilities via Evidence-Calibrated Query Clustering","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07112","citing_title":"Switchcraft: AI Model Router for Agentic Tool Calling","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07805","citing_title":"Flexible Routing via Uncertainty Decomposition","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NFLFPT4JOSI5XWKLTBRUCRSYGL","json":"https://pith.science/pith/NFLFPT4JOSI5XWKLTBRUCRSYGL.json","graph_json":"https://pith.science/api/pith-number/NFLFPT4JOSI5XWKLTBRUCRSYGL/graph.json","events_json":"https://pith.science/api/pith-number/NFLFPT4JOSI5XWKLTBRUCRSYGL/events.json","paper":"https://pith.science/paper/NFLFPT4J"},"agent_actions":{"view_html":"https://pith.science/pith/NFLFPT4JOSI5XWKLTBRUCRSYGL","download_json":"https://pith.science/pith/NFLFPT4JOSI5XWKLTBRUCRSYGL.json","view_paper":"https://pith.science/paper/NFLFPT4J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.03261&json=true","fetch_graph":"https://pith.science/api/pith-number/NFLFPT4JOSI5XWKLTBRUCRSYGL/graph.json","fetch_events":"https://pith.science/api/pith-number/NFLFPT4JOSI5XWKLTBRUCRSYGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NFLFPT4JOSI5XWKLTBRUCRSYGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NFLFPT4JOSI5XWKLTBRUCRSYGL/action/storage_attestation","attest_author":"https://pith.science/pith/NFLFPT4JOSI5XWKLTBRUCRSYGL/action/author_attestation","sign_citation":"https://pith.science/pith/NFLFPT4JOSI5XWKLTBRUCRSYGL/action/citation_signature","submit_replication":"https://pith.science/pith/NFLFPT4JOSI5XWKLTBRUCRSYGL/action/replication_record"}},"created_at":"2026-07-05T11:05:39.713061+00:00","updated_at":"2026-07-05T11:05:39.713061+00:00"}