{"as_of":"2026-08-22T02:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0a3acf7c34f10235210121a88ab6ff82cd5a904f9b08b8fc66c15ded0e137aa6","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":61,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":61,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:35:47.705888Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-11T02:27:47.646520Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-12T20:20:59.569933Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.09837","last_updated":"2025-06-02T14:54:12Z","snapshot_observed_at":"2026-08-17T16:26:07.621276Z","submitted_at":"2024-11-14T23:02:30Z","title":"Real-time Adapting Routing (RAR): Improving Efficiency Through Continuous Learning in Software Powered by Layered Foundation Models","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-12T20:20:59.569933Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2411.09837"},"observation_digest":"sha256:ca3ae885c8c0c010e73440184dfb29a5c49cd92b513e0ac5b343216d2f819d6a","observation_id":"6e13b4bf-a177-41ae-a8b6-f34c1d225274","resolution":{"observed_at":"2026-08-12T20:20:59.569933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-12T16:16:26.285312Z","title":"Large language model routing with benchmark datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.13787","last_updated":"2025-08-21T05:25:55Z","snapshot_observed_at":"2026-08-17T19:07:22.154741Z","submitted_at":"2024-11-21T02:18:06Z","title":"Adaptive Routing of Text-to-Image Generation Requests Between Large Cloud Model and Light-Weight Edge Model","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-12T16:16:26.285312Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2411.13787"},"observation_digest":"sha256:2abca3b401895ad3ddfb757e33b92e957eca701353e5cc5858b6fcae2fb23663","observation_id":"a52b7294-7e76-4cd7-88fe-e41f15149a60","resolution":{"observed_at":"2026-08-12T16:16:26.285312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-11T17:29:02.823345Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.12170","last_updated":"2024-12-12T06:27:12Z","snapshot_observed_at":"2026-08-17T07:18:03.520995Z","submitted_at":"2024-12-12T06:27:12Z","title":"PickLLM: Context-Aware RL-Assisted Large Language Model Routing","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T17:29:02.823345Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2412.12170"},"observation_digest":"sha256:463744b1b8a4cac027087b0b37d843088ea1d9230cdc3b1b18df67db74050ee8","observation_id":"0b0839e5-062e-4df4-bf73-6f9ea9487b7e","resolution":{"observed_at":"2026-08-11T17:29:02.823345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-11T12:40:16.249758Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.15283","last_updated":"2024-12-18T16:07:44Z","snapshot_observed_at":"2026-08-15T15:00:21.498650Z","submitted_at":"2024-12-18T16:07:44Z","title":"Channel Merging: Preserving Specialization for Merged Experts","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-11T12:40:16.249758Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2412.15283"},"observation_digest":"sha256:e30bde8d5a9a36bea9c9fc158b8b09bd200874a0792420008329235b9fdcd9be","observation_id":"a3799d27-2204-447f-9b4c-7a9b5b48e471","resolution":{"observed_at":"2026-08-11T12:40:16.249758Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-11T05:08:18.164866Z","title":"Large language model routing with benchmark datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.18072","last_updated":"2024-12-24T00:59:16Z","snapshot_observed_at":"2026-08-16T02:56:20.537702Z","submitted_at":"2024-12-24T00:59:16Z","title":"MMFactory: A Universal Solution Search Engine for Vision-Language Tasks","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T05:08:18.164866Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2412.18072"},"observation_digest":"sha256:7b2e3af17f2879e907bd0431bad44dab46ecbae495d328d0de685dd3cab90ffb","observation_id":"41a29bdf-f416-48bc-a48b-88829c5bac19","resolution":{"observed_at":"2026-08-11T05:08:18.164866Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-10T22:24:45.601077Z","title":"Large language model routing with benchmark datasets,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.01818","last_updated":"2025-01-03T14:03:14Z","snapshot_observed_at":"2026-08-14T06:31:57.081126Z","submitted_at":"2025-01-03T14:03:14Z","title":"Rerouting LLM Routers","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T22:24:45.601077Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2501.01818"},"observation_digest":"sha256:1716dafe7eeffd11df55cbc0b3eda9be87e7256fc1c534bc54077ea256c20df6","observation_id":"a5eec80e-aa3a-40ad-98b3-5e83961766ed","resolution":{"observed_at":"2026-08-10T22:24:45.601077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-10T21:04:33.654944Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2501.06471","last_updated":"2025-01-11T08:00:24Z","snapshot_observed_at":"2026-08-16T23:44:57.425741Z","submitted_at":"2025-01-11T08:00:24Z","title":"The Internet of Large Language Models: An Orchestration Framework for LLM Training and Knowledge Exchange Toward Artificial General Intelligence","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T21:04:33.654944Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2501.06471"},"observation_digest":"sha256:bc6f3789b32b9383f79020b37b2c2dea5c50093bf5fd34e93546eaa61d5255dc","observation_id":"7805cc62-99ee-4d2c-a397-61815d53b200","resolution":{"observed_at":"2026-08-10T21:04:33.654944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-10T20:40:24.633361Z","title":"arXiv preprint arXiv:2309.15789","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.07793","last_updated":"2025-01-14T02:27:06Z","snapshot_observed_at":"2026-08-18T12:08:03.825959Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.633361Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:0e87011bed277abc12534d3baa74d63648c371a8fe842097f0d6e8927abab57b","observation_id":"e839877a-f8a3-476a-a0dc-d6b5d7c059c1","resolution":{"observed_at":"2026-08-10T20:40:24.633361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-09T19:10:53.818852Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.00409","last_updated":"2025-07-21T12:20:06Z","snapshot_observed_at":"2026-08-19T22:44:53.516876Z","submitted_at":"2025-02-01T12:08:38Z","title":"Doing More with Less: A Survey on Routing Strategies for Resource Optimisation in Large Language Model-Based Systems","version":3},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:53.818852Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.00409"},"observation_digest":"sha256:722f8bc212ec2d8ca04379549feaa9699e900afab7c1bf00425db8515f993edb","observation_id":"78e5c89e-c851-4207-ad6c-b33768be7c0a","resolution":{"observed_at":"2026-08-09T19:10:53.818852Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-09T11:22:28.965591Z","title":"Large language model routing with benchmark datasets","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02743","last_updated":"2025-02-04T22:09:43Z","snapshot_observed_at":"2026-08-14T11:59:50.011836Z","submitted_at":"2025-02-04T22:09:43Z","title":"LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routing","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T11:22:28.965591Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.02743"},"observation_digest":"sha256:4e7b74d7f7865e8baed4d1e4d3a31f03f77e0160298d188a98c03105b5223381","observation_id":"1c83dd08-bb53-46d1-9d34-4656e4372d80","resolution":{"observed_at":"2026-08-09T11:22:28.965591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-09T05:30:40.777328Z","title":"prompt\" contains the model queries, the","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.03261","last_updated":"2025-05-19T19:40:22Z","snapshot_observed_at":"2026-08-17T03:23:21.487254Z","submitted_at":"2025-02-05T15:17:25Z","title":"CARROT: A Cost Aware Rate Optimal Router","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-09T05:30:40.777328Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.03261"},"observation_digest":"sha256:dbcbd867c083e56e3762471b02c5dc9ed868f67c6cb684c3f40fdb28fcb92dd9","observation_id":"a47a39aa-60f6-40a7-8a9d-5726d5beedf1","resolution":{"observed_at":"2026-08-09T05:30:40.777328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-08T22:33:09.569628Z","title":"Large language model routing with benchmark datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04506","last_updated":"2025-02-06T21:13:44Z","snapshot_observed_at":"2026-08-17T17:08:21.269360Z","submitted_at":"2025-02-06T21:13:44Z","title":"When One LLM Drools, Multi-LLM Collaboration Rules","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-08T22:33:09.569628Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.04506"},"observation_digest":"sha256:72e3c874944b215aa942f369387fcaa2b568d0d67f61ea70a7c0d2e7c2529d5f","observation_id":"6ca23ba2-abe0-417c-95e4-86650fd24b10","resolution":{"observed_at":"2026-08-08T22:33:09.569628Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-08T13:08:22.860161Z","title":"Large language model routing with benchmark datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.07350","last_updated":"2025-09-06T07:54:06Z","snapshot_observed_at":"2026-08-21T22:56:50.404094Z","submitted_at":"2025-02-11T08:22:12Z","title":"KABB: Knowledge-Aware Bayesian Bandits for Dynamic Expert Coordination in Multi-Agent Systems","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-08T13:08:22.860161Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.07350"},"observation_digest":"sha256:433aabb92d0b6ca70117d1343161fbd55c97c5edd304360952dc3974f71ea6a7","observation_id":"ad300be5-6e99-466f-a7c1-287776bce70f","resolution":{"observed_at":"2026-08-08T13:08:22.860161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-07T23:48:01.195895Z","title":"Large language model routing with benchmark datasets, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.08773","last_updated":"2025-07-22T15:27:33Z","snapshot_observed_at":"2026-08-18T13:29:57.105910Z","submitted_at":"2025-02-12T20:30:28Z","title":"Universal Model Routing for Efficient LLM Inference","version":2},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-07T23:48:01.195895Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.08773"},"observation_digest":"sha256:6117e731c3714062992fb993323660269cc736eeac98048919f2a61945afee4e","observation_id":"b8ad597c-0628-4c00-916d-e6b708978b48","resolution":{"observed_at":"2026-08-07T23:48:01.195895Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-07T19:40:07.685952Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-19T13:32:42.712584Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.685952Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:ba18bbf22e7fd585b256b3466989c00b4176bce636cf41d455b0556cc3adea8a","observation_id":"91febde8-3983-47fe-8c9f-78dcbfbc7317","resolution":{"observed_at":"2026-08-07T19:40:07.685952Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-08T18:11:31.755725Z","title":"arXiv preprint arXiv:2309.15789","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-18T12:33:10.662436Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.755725Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:bcd223c5cbd6c1b56d0f10e893aba23526155d04ced95ccf9e1649d03731365a","observation_id":"21d7468d-333f-458d-9e1f-5cf5d4d4e9de","resolution":{"observed_at":"2026-08-08T18:11:31.755725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-16T11:35:47.705888Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.15188","last_updated":"2025-04-22T04:22:09Z","snapshot_observed_at":"2026-08-18T11:39:59.885729Z","submitted_at":"2025-04-21T15:57:33Z","title":"Synergistic Weak-Strong Collaboration by Aligning Preferences","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-16T11:35:47.705888Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2504.15188"},"observation_digest":"sha256:07831e83160e8fecb4036cff87ab9e868430c984ee5242063e48435a423abbff","observation_id":"816d9674-4c4c-46bb-adf8-a62a8ad099e6","resolution":{"observed_at":"2026-08-16T11:35:47.705888Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-16T04:39:14.102815Z","title":"Sorscher, B., Geirhos, R., Shekhar, S., Ganguli, S., and Morcos, A","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.00985","last_updated":"2025-05-25T14:53:34Z","snapshot_observed_at":"2026-08-17T19:26:39.886279Z","submitted_at":"2025-05-02T04:13:27Z","title":"Position: Enough of Scaling LLMs! Lets Focus on Downscaling","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T04:39:14.102815Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2505.00985"},"observation_digest":"sha256:660e5491d8d150ff2e79a961694e65c5b4d0b7ff830ce8dc5536a36ae500ad3e","observation_id":"225c167e-0476-4fab-9693-2ce3afb99e54","resolution":{"observed_at":"2026-08-16T04:39:14.102815Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-16T05:17:37.877990Z","title":"Large language model routing with benchmark datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.01449","last_updated":"2025-04-30T02:06:26Z","snapshot_observed_at":"2026-08-19T08:34:59.378341Z","submitted_at":"2025-04-30T02:06:26Z","title":"COSMOS: Predictable and Cost-Effective Adaptation of LLMs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T05:17:37.877990Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2505.01449"},"observation_digest":"sha256:b6bd3fd5b71fe8d14673794fc0f3adf72f83b9f1c226cd3fe6ab01531a415df5","observation_id":"1c8cc3be-1655-41f4-b1a2-7e0348838187","resolution":{"observed_at":"2026-08-16T05:17:37.877990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2505.12601","last_updated":"2026-05-14T18:08:42Z","snapshot_observed_at":"2026-08-15T04:53:18.316921Z","submitted_at":"2025-05-19T01:33:41Z","title":"Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:28.927880Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2505.12601"},"observation_digest":"sha256:81c4c5cb63a770529f8a4b9949aacd50569316834d9ea6ed5c39dd5cfa846d8b","observation_id":"9982a506-e2c8-4f43-b448-471ac80e3c30","resolution":{"observed_at":"2026-05-22T15:14:57.489330Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-07T15:11:17.471621Z","title":"Large language model routing with benchmark datasets.arXiv preprint arXiv:2309.15789,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16221","last_updated":"2025-05-22T04:46:04Z","snapshot_observed_at":"2026-08-16T01:21:23.505699Z","submitted_at":"2025-05-22T04:46:04Z","title":"LightRouter: Towards Efficient LLM Collaboration with Minimal Overhead","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T15:11:17.471621Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2505.16221"},"observation_digest":"sha256:f8f634331ff77164397f73af5818ca055c5bd05743b789d776577297a0d17b67","observation_id":"af962790-1ffa-4c39-adfc-edd5e37800f7","resolution":{"observed_at":"2026-08-07T15:11:17.471621Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-07T12:00:12.633894Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.01048","last_updated":"2025-06-21T03:39:58Z","snapshot_observed_at":"2026-08-14T06:42:06.024205Z","submitted_at":"2025-06-01T15:14:58Z","title":"IRT-Router: Effective and Interpretable Multi-LLM Routing via Item Response Theory","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:12.633894Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2506.01048"},"observation_digest":"sha256:2ed4e707e2fdfb19f01f3c8b22baa4baba39dcc452c82eba4071e256f978fd71","observation_id":"bb1c22a6-e046-4ced-a12c-14f4376625e3","resolution":{"observed_at":"2026-08-07T12:00:12.633894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-06T22:05:28.537741Z","title":"Shnitzer, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-08-14T16:20:26.515800Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T22:05:28.537741Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2506.22716"},"observation_digest":"sha256:259474afb01be175293e66548ccaeed8cee1ff12c721c044619b8976a1a6fee5","observation_id":"70055641-08b0-4c1e-9321-2a0d1f2c50d8","resolution":{"observed_at":"2026-08-06T22:05:28.537741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-06T20:05:20.568823Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.03834","last_updated":"2025-07-04T23:16:02Z","snapshot_observed_at":"2026-08-20T15:23:09.410095Z","submitted_at":"2025-07-04T23:16:02Z","title":"Economic Evaluation of LLMs","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T20:05:20.568823Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2507.03834"},"observation_digest":"sha256:0e09304e0b12b8bdac3c9cbb417ac739731fa8af5e223cf125e4292d62fd7c05","observation_id":"a4f0b94f-746f-47be-8b7d-d34bb373a31f","resolution":{"observed_at":"2026-08-06T20:05:20.568823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2507.14200","last_updated":"2026-05-15T13:08:04Z","snapshot_observed_at":"2026-08-13T18:37:34.518584Z","submitted_at":"2025-07-14T16:17:11Z","title":"A Scalable Multi-LLM Collaboration System with Retrieval-based Selection and Exploration-Exploitation-Driven Enhancement","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-21T23:26:38.457193Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2507.14200"},"observation_digest":"sha256:bd99798a96f6c6305489d5e90036faa172fc2f3919df03432743fdb8794c79be","observation_id":"0e86fc1e-68b0-4693-b1f5-11000a7e6aa1","resolution":{"observed_at":"2026-05-21T23:30:46.025838Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-15T18:09:39.596918Z","title":"& Yurochkin, M","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.22937","last_updated":"2025-07-25T06:17:11Z","snapshot_observed_at":"2026-08-20T10:32:57.175766Z","submitted_at":"2025-07-25T06:17:11Z","title":"CoE-Ops: Collaboration of LLM-based Experts for AIOps Question-Answering","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T18:09:39.596918Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2507.22937"},"observation_digest":"sha256:8921927d8bf10ad31bde0b45f11a60a0bb92662f93c4ed0f1b7913f9d7e8bbf9","observation_id":"3a668f14-3ade-4c91-b6da-70ac284b91a5","resolution":{"observed_at":"2026-08-15T18:09:39.596918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-06T10:22:42.536535Z","title":"Large language model routing with benchmark datasets,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.00234","last_updated":"2025-08-01T00:45:15Z","snapshot_observed_at":"2026-08-14T16:49:58.885655Z","submitted_at":"2025-08-01T00:45:15Z","title":"Quality-of-Service Aware LLM Routing for Edge Computing with Multiple Experts","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T10:22:42.536535Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2508.00234"},"observation_digest":"sha256:bd2d7aa502c165c865269f463f60b9ba47db7e15b70a00272b7603f9b7d08751","observation_id":"972eceb0-f50d-4179-990e-02817071252e","resolution":{"observed_at":"2026-08-06T10:22:42.536535Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-05T16:18:47.579114Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.18763","last_updated":"2025-08-26T07:41:33Z","snapshot_observed_at":"2026-08-14T14:50:31.988086Z","submitted_at":"2025-08-26T07:41:33Z","title":"Dynamic Collaboration of Multi-Language Models based on Minimal Complete Semantic Units","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T16:18:47.579114Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2508.18763"},"observation_digest":"sha256:27dff3e843e1ace816679a9c4ee825336ef34b8b199d1549dfcc10dc7ecce208","observation_id":"4704b8da-bcbc-4778-857b-96d69ea5f566","resolution":{"observed_at":"2026-08-05T16:18:47.579114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-15T16:32:08.566431Z","title":"Large language model routing with benchmark datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.04442","last_updated":"2025-09-04T17:59:06Z","snapshot_observed_at":"2026-08-18T16:53:16.130640Z","submitted_at":"2025-09-04T17:59:06Z","title":"Delta Activations: A Representation for Finetuned Large Language Models","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T16:32:08.566431Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2509.04442"},"observation_digest":"sha256:4aeb9f6a0a0c8fde8b392a781cf789f69d1a470f93149422cf875c05cee8924a","observation_id":"c9ac31a0-0410-4bcd-8bd4-0b886abd2d9a","resolution":{"observed_at":"2026-08-15T16:32:08.566431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2509.24814","last_updated":"2026-05-07T06:47:05Z","snapshot_observed_at":"2026-08-13T11:27:33.387352Z","submitted_at":"2025-09-29T14:02:27Z","title":"A Greedy PDE Router for Blending Neural Operators and Classical Methods","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-18T12:32:13.577474Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2509.24814"},"observation_digest":"sha256:d3f3f284f1cb291d0e894157bf28c63be4b2b79d2a79e093daa8359e556c54ac","observation_id":"03653d5c-f96c-492a-a913-364dbb49efd1","resolution":{"observed_at":"2026-05-18T12:32:36.206591Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2512.23213","last_updated":"2026-04-25T15:41:44Z","snapshot_observed_at":"2026-08-11T13:29:42.093503Z","submitted_at":"2025-12-29T05:25:49Z","title":"Scoring, Reasoning, and Selecting the Best! Ensembling Large Language Models via a Peer-Review Process","version":3},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-16T19:57:03.999154Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2512.23213"},"observation_digest":"sha256:d2312459bb071ad48c8cf01c5a9c5d775d87920befdd04aec8aa720cf7bfcb9c","observation_id":"b1ac5cf7-af69-42a9-9bc6-3c9c1e730a8f","resolution":{"observed_at":"2026-05-16T19:58:22.758141Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-03T11:01:24.791849Z","title":"Large language model routing with benchmark datasets.arXiv preprint arXiv:2309.15789,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2601.07965","last_updated":"2026-06-28T07:55:15Z","snapshot_observed_at":"2026-08-09T08:33:13.501013Z","submitted_at":"2026-01-12T19:59:03Z","title":"When Models Know When They Do Not Know: Calibration, Cascading, and Cleaning","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T11:01:24.791849Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2601.07965"},"observation_digest":"sha256:2403bb8bdd1d3d10793cd2fef685aa46d553eb8ebc8ed0523f29872839e33210","observation_id":"3c26f859-c714-42a7-92d5-b3401e2a6eb9","resolution":{"observed_at":"2026-08-03T11:01:24.791849Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-15T14:06:05.916377Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2603.05973","last_updated":"2026-06-30T10:14:33Z","snapshot_observed_at":"2026-08-17T16:49:52.815126Z","submitted_at":"2026-03-06T07:13:04Z","title":"Vanishing orders, suspensions and zero degree Tur\\'an densities","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-15T14:06:05.916377Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2603.05973"},"observation_digest":"sha256:ee81800a6bfe29aabd62601d2687d4d82c98c3be40f9233ce441089c89a28547","observation_id":"e49410a8-c9cc-4eee-bc69-8028edb320e5","resolution":{"observed_at":"2026-07-15T14:06:05.916377Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2604.06753","last_updated":"2026-04-08T07:20:23Z","snapshot_observed_at":"2026-08-17T01:38:36.259934Z","submitted_at":"2026-04-08T07:20:23Z","title":"Select-then-Solve: Paradigm Routing as Inference-Time Optimization for LLM Agents","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-10T18:32:37.703624Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2604.06753"},"observation_digest":"sha256:efdcf40aabab63d28eaf6b462848dee0bbf06d06004e31bb91c1e8324e4339de","observation_id":"99cffbfd-f1de-4523-82fe-5a4a72f9132f","resolution":{"observed_at":"2026-05-11T00:25:50.940194Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2604.15728","last_updated":"2026-04-17T06:02:27Z","snapshot_observed_at":"2026-08-17T08:58:03.554759Z","submitted_at":"2026-04-17T06:02:27Z","title":"Privacy-Preserving LLMs Routing","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-10T08:32:43.015370Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2604.15728"},"observation_digest":"sha256:5fbf9316158dcb90dfe39f1a7a5cb537b92f1fb50d569cbb7570271733f034fe","observation_id":"408f98f7-f8fe-419a-bf0d-6146ddcdc010","resolution":{"observed_at":"2026-05-10T08:32:51.631114Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2604.17112","last_updated":"2026-04-18T19:00:27Z","snapshot_observed_at":"2026-08-17T18:05:17.720999Z","submitted_at":"2026-04-18T19:00:27Z","title":"Complementing Self-Consistency with Cross-Model Disagreement for Uncertainty Quantification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-10T06:29:24.974157Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2604.17112"},"observation_digest":"sha256:3383927cfcc80f8a8e47f32830a2bab838f86e6e0f7514977bd016a7257c2efc","observation_id":"09088afb-b329-470f-973a-b20d7261380a","resolution":{"observed_at":"2026-05-10T06:31:30.556747Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2604.22819","last_updated":"2026-04-16T13:04:52Z","snapshot_observed_at":"2026-08-16T12:10:47.756443Z","submitted_at":"2026-04-16T13:04:52Z","title":"A pragmatic approach to regulating AI agents","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-10T10:00:09.382458Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2604.22819"},"observation_digest":"sha256:2fe22ae1c117ebe679ecbede330a72047576b99b144462497b358cd86c1c77ac","observation_id":"3a59a700-103e-4e48-b2d6-62018296c485","resolution":{"observed_at":"2026-05-10T10:04:06.892210Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2604.26940","last_updated":"2026-06-11T12:55:10Z","snapshot_observed_at":"2026-08-17T17:34:20.926536Z","submitted_at":"2026-04-29T17:51:39Z","title":"Select to Think: Unlocking SLM Potential with Local Sufficiency","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-07T08:45:14.083901Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2604.26940"},"observation_digest":"sha256:2044898219bb7fb67b97a33eeae5dd1451b9a0e079327ba463b808292574e026","observation_id":"28f81a53-049e-495b-a861-bf9d946d2d01","resolution":{"observed_at":"2026-05-12T09:56:27.679355Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2604.26940","last_updated":"2026-06-11T12:55:10Z","snapshot_observed_at":"2026-08-17T17:34:20.926536Z","submitted_at":"2026-04-29T17:51:39Z","title":"Select to Think: Unlocking SLM Potential with Local Sufficiency","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-01T08:31:11.645634Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2604.26940"},"observation_digest":"sha256:4bf54aa0b5d4c1bf04923b828e3225469dac4edadcb1ed63bc01b24d6c35ccaa","observation_id":"836a5707-bedb-4b93-8643-c8f392ceb373","resolution":{"observed_at":"2026-07-01T08:35:33.655820Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2605.07112","last_updated":"2026-05-08T01:41:31Z","snapshot_observed_at":"2026-07-06T23:19:30.387067Z","submitted_at":"2026-05-08T01:41:31Z","title":"Switchcraft: AI Model Router for Agentic Tool Calling","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-11T01:02:55.275359Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2605.07112"},"observation_digest":"sha256:524079bab7a2a1b2e12f237de88e4419dc4256a4f15cc9c62d939ef98d5d8b7f","observation_id":"af6a6529-063a-4551-ab01-de5bc3c29ca5","resolution":{"observed_at":"2026-05-11T04:50:56.424966Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2605.07180","last_updated":"2026-05-08T03:18:40Z","snapshot_observed_at":"2026-08-17T08:11:02.869781Z","submitted_at":"2026-05-08T03:18:40Z","title":"Learning Agent Routing From Early Experience","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-05-11T01:15:07.381414Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2605.07180"},"observation_digest":"sha256:1d641eee138b4fdf9741fd4161920e60dd24e845046cbd1e8578e27c88b686fe","observation_id":"df4ea24e-22cd-4406-aaf6-2e59531e8a9a","resolution":{"observed_at":"2026-05-11T04:35:57.726716Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2605.11317","last_updated":"2026-05-11T23:07:33Z","snapshot_observed_at":"2026-08-14T04:29:49.634822Z","submitted_at":"2026-05-11T23:07:33Z","title":"SOMA: Efficient Multi-turn LLM Serving via Small Language Model","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-13T01:37:27.361504Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2605.11317"},"observation_digest":"sha256:9935c08481b6f31bc1995bcf9f5781b1820d2fbc016fca681db88867632793d3","observation_id":"d4acec10-909f-41d0-b34a-85ad5f824e85","resolution":{"observed_at":"2026-05-13T01:42:04.172785Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2605.17288","last_updated":"2026-05-17T06:59:43Z","snapshot_observed_at":"2026-08-15T09:10:37.221931Z","submitted_at":"2026-05-17T06:59:43Z","title":"When Efficiency Backfires: Cascading LLMs Trigger Cascade Failure under Adversarial Attack","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-19T23:58:53.524203Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2605.17288"},"observation_digest":"sha256:e3bbcd3201eaa8e20318ceb19cfe2fc4f8c03e8e95956f67d91cac2f9474420e","observation_id":"bd19b844-c83b-4adb-82d7-a35763ad4ef3","resolution":{"observed_at":"2026-05-20T00:02:53.769343Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2605.25558","last_updated":"2026-05-25T08:12:58Z","snapshot_observed_at":"2026-08-17T19:52:43.550271Z","submitted_at":"2026-05-25T08:12:58Z","title":"Beyond Query Memorization: Large Language Model Routing with Query Decomposition and Historical Matching","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-29T21:53:00.365846Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2605.25558"},"observation_digest":"sha256:aeea7cc4ccb7af64d713c0218e2cd2617b02d85d5fea59bc425237b6c522d644","observation_id":"2243d093-ddec-4e02-887a-858734bff88a","resolution":{"observed_at":"2026-06-29T21:53:59.027419Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2605.30736","last_updated":"2026-05-29T01:59:07Z","snapshot_observed_at":"2026-08-16T16:39:00.226019Z","submitted_at":"2026-05-29T01:59:07Z","title":"OrcaRouter: A Production-Oriented LLM Router with Hybrid Offline-Online Learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-28T23:24:21.996709Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2605.30736"},"observation_digest":"sha256:58ed72e0f50ed032cc8fcfd168886bced8b4da945b28ff24faa65e326de529d0","observation_id":"7db48d68-b818-4564-9196-75c398856f96","resolution":{"observed_at":"2026-06-29T00:02:50.203892Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2606.20295","last_updated":"2026-07-24T07:54:17Z","snapshot_observed_at":"2026-08-12T21:06:03.093786Z","submitted_at":"2026-06-18T14:33:09Z","title":"Token-Operations-Oriented Inference Optimization Techniques for Large Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T16:15:22.543601Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2606.20295"},"observation_digest":"sha256:3c4c0aa3b77b8cf9713440465e55afd7fbe180179e7a4c20139293ba1d4ae43b","observation_id":"a56c8fc2-12ae-49ba-bb6f-8b8150bbba6d","resolution":{"observed_at":"2026-07-04T05:09:36.668050Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-02T10:48:59.419755Z","title":"Large Language Model Routing with Benchmark Datasets","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.20295","last_updated":"2026-07-24T07:54:17Z","snapshot_observed_at":"2026-08-12T21:06:03.093786Z","submitted_at":"2026-06-18T14:33:09Z","title":"Token-Operations-Oriented Inference Optimization Techniques for Large Models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T10:48:59.419755Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2606.20295"},"observation_digest":"sha256:3f7e2a09813d6955303eee774a8db94b1b9770ccc65a1c122688f9ea730160d1","observation_id":"c03313af-a61b-45f0-baf8-60dd239c29ea","resolution":{"observed_at":"2026-08-02T10:48:59.419755Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2606.21929","last_updated":"2026-06-20T07:52:46Z","snapshot_observed_at":"2026-08-17T13:23:48.568158Z","submitted_at":"2026-06-20T07:52:46Z","title":"Selective Ensemble Based on Preference-Directed Multi-Objective Bandits","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-06-26T12:20:27.240829Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2606.21929"},"observation_digest":"sha256:51bd7b3ed7a23d0c87011f8987f805cdea5f5dc6de3e130448caf187e3ee0b63","observation_id":"3d54517e-1696-4032-8e7f-13755167caff","resolution":{"observed_at":"2026-07-04T07:59:40.316543Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":"2309.15789","doi":null,"metadata_source":"pith","pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-11T02:27:47.646520Z","title":"Large language model routing with benchmark datasets","venue":"cs.CL","work_id":"56d9bd9c-33d3-4d15-80bf-a522f51610b7","year":2023},"citing_paper":{"arxiv_id":"2607.05761","last_updated":"2026-07-07T02:38:41Z","snapshot_observed_at":"2026-08-20T22:01:21.439243Z","submitted_at":"2026-07-07T02:38:41Z","title":"Synthetic Consumer Insight Generation with Large Language Models","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-11T02:22:45.862673Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2607.05761"},"observation_digest":"sha256:bd5d23686d933a728e7b67b899dcd696d917b7c56f70ead044df83e7a8cb3faf","observation_id":"b58efa20-1425-4456-a538-006d4ec3398b","resolution":{"observed_at":"2026-07-11T02:27:47.667921Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-13T05:38:27.357469Z","title":"Large language model routing with benchmark datasets.arXiv preprint arXiv:2309.15789,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08940","last_updated":"2026-07-18T17:05:31Z","snapshot_observed_at":"2026-08-18T10:36:09.131665Z","submitted_at":"2026-07-09T21:09:05Z","title":"TSRouter: Dynamic Modality-Model Selection for Time Series Reasoning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-13T05:38:27.357469Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2607.08940"},"observation_digest":"sha256:0c95829e7913ebe7a9f42b8611e6f9814052ffa9622f42a8b06d098e0aa8e132","observation_id":"80a98334-e248-4cab-920b-61c054a2e505","resolution":{"observed_at":"2026-07-13T05:38:27.357469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-02T07:51:14.388178Z","title":"Large language model routing with benchmark datasets.arXiv preprint arXiv:2309.15789,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.08940","last_updated":"2026-07-18T17:05:31Z","snapshot_observed_at":"2026-08-18T10:36:09.131665Z","submitted_at":"2026-07-09T21:09:05Z","title":"TSRouter: Dynamic Modality-Model Selection for Time Series Reasoning","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T07:51:14.388178Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2607.08940"},"observation_digest":"sha256:29635e028e34bf21b76766a29917483a9bcb24439eb4b577617c085b8bba4dc6","observation_id":"83fbe965-1f97-443c-be53-ccb8d86110cd","resolution":{"observed_at":"2026-08-02T07:51:14.388178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-14T14:41:04.979785Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.09908","last_updated":"2026-07-10T18:58:52Z","snapshot_observed_at":"2026-08-14T20:49:01.598952Z","submitted_at":"2026-07-10T18:58:52Z","title":"RouteRec: Strict Evaluation of Recommender-Agent Selection and Aggregation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-14T14:41:04.979785Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2607.09908"},"observation_digest":"sha256:39764953d7c303d2a3c0b63a1dc3a42eef725b15c391a0593eca36e04ba9a8b9","observation_id":"fe8b1ad9-a7e7-4a7d-a425-3af0879ef6a5","resolution":{"observed_at":"2026-07-14T14:41:04.979785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-14T05:52:07.869069Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11399","last_updated":"2026-07-13T11:05:55Z","snapshot_observed_at":"2026-08-16T07:55:27.311265Z","submitted_at":"2026-07-13T11:05:55Z","title":"Agentic Routing: The Harness-Native Data Flywheel","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-14T05:52:07.869069Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2607.11399"},"observation_digest":"sha256:c634c14db2606ea8718ffa077f0e4d21e61132028be8aaa0e033a17f2fe46493","observation_id":"fe41bf20-c903-4283-908a-6f52e49ce7da","resolution":{"observed_at":"2026-07-14T05:52:07.869069Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-01T11:45:22.255870Z","title":"Large language model routing with benchmark datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.19794","last_updated":"2026-07-22T06:20:32Z","snapshot_observed_at":"2026-08-19T19:33:33.314856Z","submitted_at":"2026-07-22T06:20:32Z","title":"TriAgent: Divergence-Aware Multi-Agent Committees for Cost-Efficient Financial Sentiment Analysis","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-01T11:45:22.255870Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2607.19794"},"observation_digest":"sha256:d7034e21ab50c39356a53b0caf6709f5586bfc1b44c3b3a8b1f82b415603ae2d","observation_id":"de173938-26a7-4d79-ba08-1aff4cdf4cfc","resolution":{"observed_at":"2026-08-01T11:45:22.255870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-02T12:49:14.475806Z","title":"Large language model routing with benchmark datasets.arXiv preprint arXiv:2309.157892023,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.22561","last_updated":"2026-05-29T03:13:24Z","snapshot_observed_at":"2026-08-21T11:35:19.144623Z","submitted_at":"2026-05-29T03:13:24Z","title":"Codifying the Judge: Scalable Evaluation via Program Distillation","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-02T12:49:14.475806Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2607.22561"},"observation_digest":"sha256:d0d88c667f460b072eeff79f1dbe049b483312c0a378f7f6967d139cfc1031cc","observation_id":"ec40c102-8d13-4c0a-9139-057f0720bb22","resolution":{"observed_at":"2026-08-02T12:49:14.475806Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-07-31T03:38:02.059763Z","title":"Large language model routing with benchmark datasets.arXiv preprint arXiv:2309.15789,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25018","last_updated":"2026-07-31T02:55:33Z","snapshot_observed_at":"2026-08-19T01:25:03.793586Z","submitted_at":"2026-07-27T19:19:58Z","title":"Conformal Cascade: Distribution-Free Accuracy Guarantees for Multi-Tier LLM Inference","version":2},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-07-31T03:38:02.059763Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2607.25018"},"observation_digest":"sha256:95e403a0ac83bc8db7e18cda1769c38574af432839dc6398c8ea92a8e81e60b6","observation_id":"b4948b6a-3262-4088-917c-79cd546de45d","resolution":{"observed_at":"2026-07-31T03:38:02.059763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-03T01:49:18.939443Z","title":"Large language model routing with benchmark datasets.arXiv preprint arXiv:2309.15789,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25018","last_updated":"2026-07-31T02:55:33Z","snapshot_observed_at":"2026-08-19T01:25:03.793586Z","submitted_at":"2026-07-27T19:19:58Z","title":"Conformal Cascade: Distribution-Free Accuracy Guarantees for Multi-Tier LLM Inference","version":3},"reference_index":2008,"source":"pdf_text","source_observed_at":"2026-08-03T01:49:18.939443Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2607.25018"},"observation_digest":"sha256:513f2e1b7b3050ca9630a57032650de6c28e4d1deb4e03491cafcc86d63b4699","observation_id":"7b7bedb2-9a35-47f7-bd3b-327574934817","resolution":{"observed_at":"2026-08-03T01:49:18.939443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-06T16:21:11.026627Z","title":"Large language model routing with benchmark datasets,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.04804","last_updated":"2026-08-05T13:11:31Z","snapshot_observed_at":"2026-08-17T20:07:13.050707Z","submitted_at":"2026-08-05T13:11:31Z","title":"Scrouting: Cost-Aware Routing of Coding Agents by Scouting the Repository First","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T16:21:11.026627Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2608.04804"},"observation_digest":"sha256:89ae780e0d67269f8cfa517b74b9a78e601b6097c9e0f3898abf43cca6376a31","observation_id":"8b09e4e5-502f-4dd1-b6aa-9b1d780a376f","resolution":{"observed_at":"2026-08-06T16:21:11.026627Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-15T14:34:14.029724Z","title":"arXiv preprint arXiv:2309.15789 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.06867","last_updated":"2026-08-07T06:46:58Z","snapshot_observed_at":"2026-08-20T04:51:28.575652Z","submitted_at":"2026-08-07T06:46:58Z","title":"LLMRouter: Unified Infrastructure for Developing, Evaluating, and Deploying LLM Routers","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-15T14:34:14.029724Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2608.06867"},"observation_digest":"sha256:75b076a80a3b2a792d2f43830b94d0c9722dce670bf6c3b3371f2ff26e8171de","observation_id":"7b83d6a5-bad3-47a1-842e-b2926fc4cc41","resolution":{"observed_at":"2026-08-15T14:34:14.029724Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-14T04:36:54.854111Z","title":"Large Language Model Routing with Benchmark Datasets","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.08528","last_updated":"2026-08-09T06:57:53Z","snapshot_observed_at":"2026-08-20T10:59:31.117893Z","submitted_at":"2026-08-09T06:57:53Z","title":"Task-to-Model Optimization for Enterprise LLM Coding Assistants: A Data-Driven Framework for Cost-Optimal Routing","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T04:36:54.854111Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2608.08528"},"observation_digest":"sha256:23b7a9ae31b3811b8e61e4dee8f695c7dc1c7e4cc60170b85c068d74c52007a8","observation_id":"2f57e2d6-804d-47f0-98e9-a51b9c707e97","resolution":{"observed_at":"2026-08-14T04:36:54.854111Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-16T00:18:49.945835Z","title":"Shnitzer, A","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.12150","last_updated":"2026-08-12T15:11:35Z","snapshot_observed_at":"2026-08-21T16:38:51.711083Z","submitted_at":"2026-08-12T15:11:35Z","title":"Who Thinks Best Depends on How Long You Let Them: Budget-Dependent Rankings in LLM Evaluation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T00:18:49.945835Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2608.12150"},"observation_digest":"sha256:a69de0dd3acf19216c853632b5c2277a4e8b5bb2659cf7582e42e980c7844795","observation_id":"ec991bd0-fbc5-4833-97ac-63935795d2ae","resolution":{"observed_at":"2026-08-16T00:18:49.945835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2309.15789/citation-record","integrity":"/paper/2309.15789/integrity","json":"/paper/2309.15789/citation-record.json","paper":"/paper/2309.15789"},"outbound":[],"paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-19T20:05:00.057234Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 61 inbound Pith citation observations for arXiv:2309.15789."}