{"as_of":"2026-08-18T02:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:952644de1d3188463689b3f143496c167c9d9d1a002126ac00db40a2b88818cf","coverage":[{"denominator":46,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":46,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-30T13:22:26.549695Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.23765/citation-record","integrity":"/paper/2607.23765/integrity","json":"/paper/2607.23765/citation-record.json","paper":"/paper/2607.23765"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.326263Z","title":"Claude Team","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.326263Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:d90a2bc802f32243048e984fc226a075fd7226ca5849213f22f6ee352b7a008d","observation_id":"6157cfea-848d-40ea-a984-a86905a5ba4a","resolution":{"observed_at":"2026-07-30T13:22:26.326263Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.332693Z","title":"Finite-time analysis of the multiarmed bandit problem.Mach","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.332693Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:e170be4912fcd8b165140bdbbfab6d3b62a4031d9e377fadd5bcbed04ec3eea2","observation_id":"c87c259d-172b-49f7-93e3-903428f5e513","resolution":{"observed_at":"2026-07-30T13:22:26.332693Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.338553Z","title":"Resourceful contextual bandits","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.338553Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:959a9025b964d1230aef33c3aca8776b52b47804dc0145bdf72899b07cf07250","observation_id":"73ebde2d-dbe8-49bc-a698-80e9b5730862","resolution":{"observed_at":"2026-07-30T13:22:26.338553Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.343443Z","title":"PyramidKV: Dynamic KV cache compression based on pyramidal information funneling","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.343443Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:43e572c2dc43ab9d2c04b3f90ad58b73e1359ca52d70961dd969711b43752a49","observation_id":"6b1354f5-8ca4-476a-9c60-d0278b27b88f","resolution":{"observed_at":"2026-07-30T13:22:26.343443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.01318","last_updated":"2023-02-02T18:44:11Z","snapshot_observed_at":"2026-08-13T23:55:57.074762Z","submitted_at":"2023-02-02T18:44:11Z","title":"Accelerating Large Language Model Decoding with Speculative Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.01318","snapshot_observed_at":"2026-07-30T13:22:26.348583Z","title":"Accelerating large language model decoding with speculative sampling.arXiv preprint arXiv:2302.01318, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.348583Z"},"links":{"cited_paper":"/paper/2302.01318","citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:4a7f3864521bca711eebfe35c16668d26db39d403db7740acf35a4448a891efb","observation_id":"a0d38439-e768-4665-a593-569b0fbd405f","resolution":{"observed_at":"2026-07-30T13:22:26.348583Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.354717Z","title":"FrugalGPT: How to use large language models while reducing cost and improving performance.Transactions on Machine Learning Research,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.354717Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:5d3e1e20527127cf6c2dbb26f6b1d46e51ae739858225c6e6e6d36a447898d02","observation_id":"e9b22623-879c-4fa0-8e12-08af8d38fc75","resolution":{"observed_at":"2026-07-30T13:22:26.354717Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.360172Z","title":"Angelopoulos, Tianle Li, Dacheng Li, Banghua Zhu, Hao Zhang, Michael I","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.360172Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:40950e6bdd90e87ddff9b410ff78be0ab19e818f838c36effe7beccca0d93532","observation_id":"f164f021-514c-4db3-8565-ca227134f6c4","resolution":{"observed_at":"2026-07-30T13:22:26.360172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.365989Z","title":"A unified approach to routing and cascading for LLMs","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.365989Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:659ceb929c3a5c81215bb247dc5d2bb8d5c299f9b16117072f06b62758e10bfc","observation_id":"abdabdd8-dd39-4afe-a562-f30216a990f8","resolution":{"observed_at":"2026-07-30T13:22:26.365989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.370608Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.370608Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:dde6c758e1b670d1cd15ae787a94cffafe74a64fa8aded67a5eb0935777b0946","observation_id":"ab9271d7-06a1-4a72-87ae-f3ea6f36620e","resolution":{"observed_at":"2026-07-30T13:22:26.370608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.379705Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.379705Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:957f6d667bad1bd7e017eb6f3364dfcc22cda147d10de09618b247c41fac2df0","observation_id":"c1c6e06e-f362-453d-802f-e66aed12fc0b","resolution":{"observed_at":"2026-07-30T13:22:26.379705Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.384551Z","title":"Multi-armed bandit with budget constraint and variable costs","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.384551Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:2a36e03e6d0f0d20ae1c153cecfbec840f2c8598fb48ce01b5fe8afcd9a1caf6","observation_id":"e71a8140-c20b-47c3-8231-f6cf76225dfe","resolution":{"observed_at":"2026-07-30T13:22:26.384551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.389822Z","title":"Switch transformers: scaling to trillion parameter models with simple and efficient sparsity.J","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.389822Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:1d0fa2c5bdf082a1ab977080222e0e0ebbec22c2c1d7c4e6857b52d365e1f7d2","observation_id":"4f6266aa-9a6d-4f87-bf7f-50c9b5f1d503","resolution":{"observed_at":"2026-07-30T13:22:26.389822Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.395184Z","title":"Language model cascades: Token-level uncertainty and beyond","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.395184Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:ef2fdee7fda67200c8793ad74113ac2e3ad855f6fec92a925e0ccdda02b3f716","observation_id":"a051189d-d407-4e0e-8216-5188d79e6eee","resolution":{"observed_at":"2026-07-30T13:22:26.395184Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.399808Z","title":"Hassibi, D.G","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.399808Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:c02d5b6052f20b77e0ff2fa5b077475e6ab13be4b55b1ca19afeb89c4d84444b","observation_id":"8e9a03f7-8371-4dd0-abb6-0a971a61c6ae","resolution":{"observed_at":"2026-07-30T13:22:26.399808Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12031","last_updated":"2024-03-28T17:56:28Z","snapshot_observed_at":"2026-08-16T16:38:21.205977Z","submitted_at":"2024-03-18T17:59:04Z","title":"RouterBench: A Benchmark for Multi-LLM Routing System","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.12031","snapshot_observed_at":"2026-07-30T13:22:26.404224Z","title":"Routerbench: A benchmark for multi-llm routing system.CoRR, abs/2403.12031, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.404224Z"},"links":{"cited_paper":"/paper/2403.12031","citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:6ab6d875781f413421718a7685cc4ac69b1d6e69c8ec658e4193b2500689252d","observation_id":"a4b57038-3a2f-4a13-9ba7-297e3cd80e20","resolution":{"observed_at":"2026-07-30T13:22:26.404224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.410072Z","title":"Thriftllm: On cost-effective selection of large language models for classification queries.Proc","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.410072Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:1daeed9faffab0fee4941ccfb8e8b31e17b5bdd523a2c359c8d1183092c3d66c","observation_id":"24c8f8cc-a47e-44d0-b123-da7e6ae1b05a","resolution":{"observed_at":"2026-07-30T13:22:26.410072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.414608Z","title":"Ensemble learning for heterogeneous large language models with deep parallel collaboration","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.414608Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:c3d8de5197eb50450c8e90113f27a6ad83dfefbc3873e1494e1abdfe0bee13f1","observation_id":"4f8cd809-9e60-4429-900d-78e90afd16ee","resolution":{"observed_at":"2026-07-30T13:22:26.414608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.419110Z","title":"Quantization and training of neural networks for efficient integer-arithmetic-only inference","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.419110Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:14a5a6f08f6dd75d442e380563bbc52b2cc74f548c1ddea414c272d0431f9377","observation_id":"8c9a615e-e484-4234-9abf-03fcea3314a9","resolution":{"observed_at":"2026-07-30T13:22:26.419110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.423689Z","title":"LLM-blender: Ensembling large language models with pairwise ranking and generative fusion","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.423689Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:2013357c4ccf2f72d05cdb3fcdf4e19ad5be8a6009813ea2e04f958c0740cca1","observation_id":"fb4e4039-6ba0-42ad-a356-c15db5edc452","resolution":{"observed_at":"2026-07-30T13:22:26.423689Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.428855Z","title":"SWE-bench: Can language models resolve real-world github issues? InThe Twelfth International Conference on Learning Representations, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.428855Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:767b2ae355df1a5824b5ca7c7973ec017e86746fa05173dc08fe188605ba3962","observation_id":"fc880653-fa57-4340-a49f-0f85ac892905","resolution":{"observed_at":"2026-07-30T13:22:26.428855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.433185Z","title":"S3: increasing gpu utilization during generative inference for higher throughput","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.433185Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:d595b9e0602da486647a9742df0c5af22624592b5b47e0cd7596df23f1905f03","observation_id":"531a21b4-db68-4adb-85ec-3d61759d1a26","resolution":{"observed_at":"2026-07-30T13:22:26.433185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.438110Z","title":"Optimal brain damage","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.438110Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:eb009512da2616484beb38cda554e8aa47d2eedd033c95e157d64fdfa5b8b573","observation_id":"33aadfe1-961c-40f4-9892-f426b015e3fe","resolution":{"observed_at":"2026-07-30T13:22:26.438110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.442489Z","title":"Fast inference from transformers via speculative decoding","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.442489Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:57fba683d3f9cb58da4c54b3aeae07e88f1c0b8f5309c0e338f392dd010e005f","observation_id":"23ead905-e1a8-4e9e-ba99-ab6fc76bfbe3","resolution":{"observed_at":"2026-07-30T13:22:26.442489Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.447172Z","title":"Schapire","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.447172Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:ac781931024695cd475f76c90ea79401a051b0726b1b5bb1c0224e29fb6266bf","observation_id":"c677f288-27bd-435e-90c9-65711a876cf5","resolution":{"observed_at":"2026-07-30T13:22:26.447172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.451868Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.451868Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:9c393dc7ad66cb6b514890b30c80f1f66044f7f8af6420f7d1b9cf0dabbe288c","observation_id":"823c6d9f-0479-4cbd-811f-c9105a97e1cb","resolution":{"observed_at":"2026-07-30T13:22:26.451868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.457024Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.457024Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:61f2aa6e3ce4aec7af50a5ac36a3bf151f46e160832ddd830dd479c6c30bd3fc","observation_id":"6eadf7ac-a212-43a7-87ce-b06701d20eef","resolution":{"observed_at":"2026-07-30T13:22:26.457024Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.462470Z","title":"Some methods of classification and analysis of multivariate observations","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.462470Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:78eceb9f3c1c4e019127b844d00e7e6beeacfb129e7a7a125d9bbef07066bb3c","observation_id":"4df0415e-66a3-49f5-a4a9-3b0ccbd43088","resolution":{"observed_at":"2026-07-30T13:22:26.462470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.466989Z","title":"Omnirouter: Budget and performance controllable multi-llm routing.SIGKDD Explor","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.466989Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:e7f61ff73cd66c9110ca45b88cf7121fc6127ea3ab8c6f0b8563c383130d21a9","observation_id":"1c42c363-88a6-4f6b-a2cc-99759ee07bd7","resolution":{"observed_at":"2026-07-30T13:22:26.466989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10834","last_updated":"2025-04-22T03:55:14Z","snapshot_observed_at":"2026-08-16T23:11:13.304764Z","submitted_at":"2024-07-15T15:45:07Z","title":"MetaLLM: A High-performant and Cost-efficient Dynamic Framework for Wrapping LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10834","snapshot_observed_at":"2026-07-30T13:22:26.471647Z","title":"Nguyen, Thinh Dao, Duy C","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.471647Z"},"links":{"cited_paper":"/paper/2407.10834","citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:c0090b8a8833c85f9c9ac37143e1ccada49e9861dfbcc26e5fb8d7536940eb45","observation_id":"fb4429e6-9fcd-4b27-be13-1b36cd14cd95","resolution":{"observed_at":"2026-07-30T13:22:26.471647Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.477127Z","title":"Gonzalez, M Waleed Kadous, and Ion Stoica","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.477127Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:6cffd4fd42d677edef80f37d2dbe750183d10821ebb547ea7d36eacf3071f462","observation_id":"10aab095-3e61-4f80-903a-6f17a401d499","resolution":{"observed_at":"2026-07-30T13:22:26.477127Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.481594Z","title":"API Pricing","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.481594Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:bcc8510cc6a167990a19a5a1d3a66b9878bec8b8a8ccdccad78c444d8795dd78","observation_id":"227d0c2b-5a21-44f0-94da-03eeef5c20f5","resolution":{"observed_at":"2026-07-30T13:22:26.481594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.486471Z","title":"Adaptive LLM routing under budget constraints","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.486471Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:0a46b0caff95b84e8b05cfee7a2976699f42ae2734769bbe2297b7ac2e9c6344","observation_id":"e4fcdf4b-42a5-471c-a25e-07d25996e8b5","resolution":{"observed_at":"2026-07-30T13:22:26.486471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.491755Z","title":"Lui, and Jinhang Zuo","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.491755Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:9452525c408d7d5c496f96005158268f0ce4133cadfb1a2be3d92a756b0080b9","observation_id":"29d1b6fb-e2b1-46d1-a7b0-5c17b8a807ec","resolution":{"observed_at":"2026-07-30T13:22:26.491755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.495922Z","title":"Le, Geoffrey E","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.495922Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:09d3256c3cc733069232b212df339e8de0f3bfec90d9b48e400e2c3ae17ab60f","observation_id":"0907c8da-d8d0-4cbe-92fb-8337fe5e1949","resolution":{"observed_at":"2026-07-30T13:22:26.495922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.500955Z","title":"Sutton and Andrew G","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.500955Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:0fe3010400d40d43e18cd25d1d9120a091e0c05eae50a5e51c908a6ed40f764f","observation_id":"fc24717a-edce-44a6-8ce1-48f7e46ebdca","resolution":{"observed_at":"2026-07-30T13:22:26.500955Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.505373Z","title":"Jennings","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.505373Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:1f185772848e9409f729d35c959e0384aafaf582f865518d047fa6ce1490d4ff","observation_id":"cc427e67-d7b3-4223-953f-aa26e66dbaa0","resolution":{"observed_at":"2026-07-30T13:22:26.505373Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.510049Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.510049Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:607111bc9633f60628ba7517f8bc30f59f4d8b1a5f0b97084b8da91228afedec","observation_id":"c1345b62-a929-47f5-9d42-716ff365d466","resolution":{"observed_at":"2026-07-30T13:22:26.510049Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.514323Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.514323Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:32773f08bd7715bba853ddecf343fa913f7f001bd578cbaeb4ce04849611259f","observation_id":"a8dc9bda-42e2-4570-b231-1db171bb75da","resolution":{"observed_at":"2026-07-30T13:22:26.514323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.523719Z","title":"Livebench: A challenging, contamination-free LLM benchmark","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.523719Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:44c421ec1796462fa40c33bc28cd7e979ab2d6e3bb1258e1edb0c795adfc645b","observation_id":"655f112b-10cf-4070-b37c-11408b35bf67","resolution":{"observed_at":"2026-07-30T13:22:26.523719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.528661Z","title":"Srikant, Xin Liu, and Chong Jiang","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.528661Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:f967e3d6e02e6448c3874bce4d1df6c5d93a0dda7f2161c7f03c109190e4430b","observation_id":"f29f457b-6ecf-48ea-8416-731a43e33d76","resolution":{"observed_at":"2026-07-30T13:22:26.528661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.533012Z","title":"Large language model cascades with mixture of thought representations for cost-efficient reasoning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.533012Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:ff7277652aa3117db6c37561ab20b132ec809384fc63319b2facc74aae2cadb1","observation_id":"ead4238e-8fe0-4fa1-9967-6ca01bd9d111","resolution":{"observed_at":"2026-07-30T13:22:26.533012Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.538269Z","title":"TX t=1 St # = JX j=1 KX k=1 E","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.538269Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:8a9ac3663661c38413adc915da7b5f4b14bb8c4b3bd7595f2098afdd9fc13613","observation_id":"2ed37940-1858-4f1f-9777-3f5a5f64ef53","resolution":{"observed_at":"2026-07-30T13:22:26.538269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.543782Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.543782Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:75d096e6a296838a9c9fb45daf96c4915b511d41ec08abee046f7491f7651f22","observation_id":"37452d89-7065-4dc2-ab18-b4468c1224da","resolution":{"observed_at":"2026-07-30T13:22:26.543782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.549695Z","title":"Intuitively, the first part of Lemma E.1 shows that if an action has small normalized and original expected reward, then it can be removed","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.549695Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:98dfca7a94436013f2b45b4cb4e0b7f3f7573792a8e6d4988b8af9dfcb80f482","observation_id":"a7d0ed20-5f67-43b0-a78b-5cdc830f5f08","resolution":{"observed_at":"2026-07-30T13:22:26.549695Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.375275Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.375275Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:3215b3d1928024b3431617b7eac9e4fa5eb881f00778ffcdf92d77824ef5ee6d","observation_id":"e248490a-3c8d-4cff-adc5-dba4ea15ff85","resolution":{"observed_at":"2026-07-30T13:22:26.375275Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-30T13:22:26.519033Z","title":"ISBN 979-8-89176-189-6","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-07-30T13:22:26.519033Z"},"links":{"citing_paper":"/paper/2607.23765"},"observation_digest":"sha256:a988738a9e7f3fa8c4e800ab830c5240ac833070948c852e6b574479bf4dafd9","observation_id":"a1575f25-eb39-4c36-82eb-83968f3adb9b","resolution":{"observed_at":"2026-07-30T13:22:26.519033Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.23765","last_updated":"2026-07-26T17:20:39Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T22:22:05.758966Z","submitted_at":"2026-07-26T17:20:39Z","title":"WISERouter: LLM Routing with Workload Budget Constraint"},"reference_resolution":{"displayed":46,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":46},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 0 inbound Pith citation observations for arXiv:2607.23765."}