{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:TYHCSVL6FVYMZXBGMMUKLN7OPG","short_pith_number":"pith:TYHCSVL6","schema_version":"1.0","canonical_sha256":"9e0e29557e2d70ccdc266328a5b7ee79a8739cc2fc2ad6346c0ed8f2be92b160","source":{"kind":"arxiv","id":"2607.23765","version":1},"attestation_state":"computed","paper":{"title":"WISERouter: LLM Routing with Workload Budget Constraint","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Laks V.S. Lakshmanan, Yifei Li, Zihui Gao","submitted_at":"2026-07-26T17:20:39Z","abstract_excerpt":"Large language models (LLMs) achieve impressive performance across multiple domains, but using the most capable model for every query is prohibitive at scale. LLM routing exploits diversity in model capability and cost by assigning each query to a suitable model to balance utility and budget. Current methods have two limitations: (i) they either use heuristics that do not always enforce the budget constraint or impose a fixed per-query budget that cannot adapt across the workload and leads to suboptimal performance; (ii) they require supervised learning on a dense dataset with statistics for e"},"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":"2607.23765","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-26T17:20:39Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"bf0d1426c00040badc6d3e692e58eaccb12ca4269f9cd8cf523f693cd210adf7","abstract_canon_sha256":"be29461e99755dba9a2f85eb8037fff0eeea80336177fe7017d694006aa3ad08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-28T01:23:10.141613Z","signature_b64":"dMC4S3ZWQQWRQGjRsPyWCTIlU8Ucco3/H/Rnb/pA7RbcyiCdUZ2MKB7DE5nKJgjlpg+7J07p9GwEmgbGb0yTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e0e29557e2d70ccdc266328a5b7ee79a8739cc2fc2ad6346c0ed8f2be92b160","last_reissued_at":"2026-07-28T01:23:10.140761Z","signature_status":"signed_v1","first_computed_at":"2026-07-28T01:23:10.140761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"WISERouter: LLM Routing with Workload Budget Constraint","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Laks V.S. Lakshmanan, Yifei Li, Zihui Gao","submitted_at":"2026-07-26T17:20:39Z","abstract_excerpt":"Large language models (LLMs) achieve impressive performance across multiple domains, but using the most capable model for every query is prohibitive at scale. LLM routing exploits diversity in model capability and cost by assigning each query to a suitable model to balance utility and budget. Current methods have two limitations: (i) they either use heuristics that do not always enforce the budget constraint or impose a fixed per-query budget that cannot adapt across the workload and leads to suboptimal performance; (ii) they require supervised learning on a dense dataset with statistics for e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.23765","kind":"arxiv","version":1},"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/2607.23765/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":"2607.23765","created_at":"2026-07-28T01:23:10.141194+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.23765v1","created_at":"2026-07-28T01:23:10.141194+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.23765","created_at":"2026-07-28T01:23:10.141194+00:00"},{"alias_kind":"pith_short_12","alias_value":"TYHCSVL6FVYM","created_at":"2026-07-28T01:23:10.141194+00:00"},{"alias_kind":"pith_short_16","alias_value":"TYHCSVL6FVYMZXBG","created_at":"2026-07-28T01:23:10.141194+00:00"},{"alias_kind":"pith_short_8","alias_value":"TYHCSVL6","created_at":"2026-07-28T01:23:10.141194+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG","json":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG.json","graph_json":"https://pith.science/api/pith-number/TYHCSVL6FVYMZXBGMMUKLN7OPG/graph.json","events_json":"https://pith.science/api/pith-number/TYHCSVL6FVYMZXBGMMUKLN7OPG/events.json","paper":"https://pith.science/paper/TYHCSVL6"},"agent_actions":{"view_html":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG","download_json":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG.json","view_paper":"https://pith.science/paper/TYHCSVL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.23765&json=true","fetch_graph":"https://pith.science/api/pith-number/TYHCSVL6FVYMZXBGMMUKLN7OPG/graph.json","fetch_events":"https://pith.science/api/pith-number/TYHCSVL6FVYMZXBGMMUKLN7OPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/action/storage_attestation","attest_author":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/action/author_attestation","sign_citation":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/action/citation_signature","submit_replication":"https://pith.science/pith/TYHCSVL6FVYMZXBGMMUKLN7OPG/action/replication_record"}},"created_at":"2026-07-28T01:23:10.141194+00:00","updated_at":"2026-07-28T01:23:10.141194+00:00"}