{"as_of":"2026-08-10T23:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:158fc73b7845173adaa5b2727fce5f78ea88d517fe036009d3c73cbc5d8fd19a","coverage":[{"denominator":34,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T14:39:29.472886Z","state":"measured"},{"denominator":43,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":43,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":9,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T10:31:57.696695Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T23:09:01.795037Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"cited_work":{"arxiv_id":"2508.21141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21141","snapshot_observed_at":"2026-07-03T23:09:01.795037Z","title":"Pan, H., Tennenholtz, G., Mannor, S., Chi, C.-W., Brekel- mans, R., Shah, P., and Tewari, A","venue":null,"work_id":"86cd33f5-f0be-4d28-b775-10e356b31e74","year":2025},"citing_paper":{"arxiv_id":"2604.00136","last_updated":"2026-04-14T01:43:21Z","snapshot_observed_at":"2026-07-06T22:51:22.254518Z","submitted_at":"2026-03-31T18:41:53Z","title":"ParetoBandit: Budget-Paced Adaptive Routing for Non-Stationary LLM Serving","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-13T23:36:00.002010Z"},"links":{"cited_paper":"/paper/2508.21141","citing_paper":"/paper/2604.00136"},"observation_digest":"sha256:253ce7d39b0686448cbeeac83f7ad1ae1938c6ad9bcb937f5373fb1f0dc0582c","observation_id":"632b370b-d1bf-42d8-8e8a-a187e07da721","resolution":{"observed_at":"2026-05-13T23:38:26.684450Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"cited_work":{"arxiv_id":"2508.21141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21141","snapshot_observed_at":"2026-07-03T23:09:01.795037Z","title":"Pan, H., Tennenholtz, G., Mannor, S., Chi, C.-W., Brekel- mans, R., Shah, P., and Tewari, A","venue":null,"work_id":"86cd33f5-f0be-4d28-b775-10e356b31e74","year":2025},"citing_paper":{"arxiv_id":"2604.14853","last_updated":"2026-04-16T10:39:22Z","snapshot_observed_at":"2026-07-06T23:02:31.717911Z","submitted_at":"2026-04-16T10:39:22Z","title":"Adaptive Test-Time Compute Allocation for Reasoning LLMs via Constrained Policy Optimization","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-10T11:57:44.680423Z"},"links":{"cited_paper":"/paper/2508.21141","citing_paper":"/paper/2604.14853"},"observation_digest":"sha256:c4531a131d147e4c9fdcbbcbf97d2fe3484a9854a6a84b4497c9012de8f93533","observation_id":"5358fd06-c1f4-4570-b08f-91a2aaf559b1","resolution":{"observed_at":"2026-05-10T12:00:22.108398Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"cited_work":{"arxiv_id":"2508.21141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21141","snapshot_observed_at":"2026-07-03T23:09:01.795037Z","title":"Pan, H., Tennenholtz, G., Mannor, S., Chi, C.-W., Brekel- mans, R., Shah, P., and Tewari, A","venue":null,"work_id":"86cd33f5-f0be-4d28-b775-10e356b31e74","year":2025},"citing_paper":{"arxiv_id":"2605.02241","last_updated":"2026-05-07T16:11:01Z","snapshot_observed_at":"2026-07-06T23:15:23.301944Z","submitted_at":"2026-05-04T05:33:03Z","title":"Zero-Shot Confidence Estimation for Small LLMs: When Supervised Baselines Aren't Worth Training","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-09T16:32:51.205764Z"},"links":{"cited_paper":"/paper/2508.21141","citing_paper":"/paper/2605.02241"},"observation_digest":"sha256:71feee70d8c4655238aff5f76796940ee358bf83515cca52a78c407ce312f101","observation_id":"5dae9797-ac0d-439c-9e95-f97c26f681d0","resolution":{"observed_at":"2026-05-11T16:31:07.401368Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"cited_work":{"arxiv_id":"2508.21141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21141","snapshot_observed_at":"2026-07-03T23:09:01.795037Z","title":"Pan, H., Tennenholtz, G., Mannor, S., Chi, C.-W., Brekel- mans, R., Shah, P., and Tewari, A","venue":null,"work_id":"86cd33f5-f0be-4d28-b775-10e356b31e74","year":2025},"citing_paper":{"arxiv_id":"2605.05657","last_updated":"2026-05-07T04:18:53Z","snapshot_observed_at":"2026-07-06T23:18:12.631820Z","submitted_at":"2026-05-07T04:18:53Z","title":"Retrieval-Conditioned Topology Selection with Provable Budget Conservation for Multi-Agent Code Generation","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-05-08T11:55:43.558721Z"},"links":{"cited_paper":"/paper/2508.21141","citing_paper":"/paper/2605.05657"},"observation_digest":"sha256:07622aee53df1b734ba29ec2d1707639816eaa3e9b5e411c61f8f285f8340712","observation_id":"20ef37a7-dc5c-4844-938f-be93db96dfbc","resolution":{"observed_at":"2026-05-11T19:26:09.670350Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"cited_work":{"arxiv_id":"2508.21141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21141","snapshot_observed_at":"2026-07-03T23:09:01.795037Z","title":"Pan, H., Tennenholtz, G., Mannor, S., Chi, C.-W., Brekel- mans, R., Shah, P., and Tewari, A","venue":null,"work_id":"86cd33f5-f0be-4d28-b775-10e356b31e74","year":2025},"citing_paper":{"arxiv_id":"2605.06110","last_updated":"2026-05-08T14:07:34Z","snapshot_observed_at":"2026-08-08T09:29:34.106054Z","submitted_at":"2026-05-07T12:24:21Z","title":"On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-08T10:39:39.482599Z"},"links":{"cited_paper":"/paper/2508.21141","citing_paper":"/paper/2605.06110"},"observation_digest":"sha256:f52ad0a8450baa03a3a2b8a9da76d6ad025191cab882eccf07f0e57401002dfc","observation_id":"04a03cf7-a868-4654-8a20-053003b5a9b3","resolution":{"observed_at":"2026-05-11T19:56:09.042025Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"cited_work":{"arxiv_id":"2508.21141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21141","snapshot_observed_at":"2026-07-03T23:09:01.795037Z","title":"Pan, H., Tennenholtz, G., Mannor, S., Chi, C.-W., Brekel- mans, R., Shah, P., and Tewari, A","venue":null,"work_id":"86cd33f5-f0be-4d28-b775-10e356b31e74","year":2025},"citing_paper":{"arxiv_id":"2605.06110","last_updated":"2026-05-08T14:07:34Z","snapshot_observed_at":"2026-08-08T09:29:34.106054Z","submitted_at":"2026-05-07T12:24:21Z","title":"On Time, Within Budget: Constraint-Driven Online Resource Allocation for Agentic Workflows","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-11T02:14:55.216480Z"},"links":{"cited_paper":"/paper/2508.21141","citing_paper":"/paper/2605.06110"},"observation_digest":"sha256:de0c90f31bb272523f7da22fb901299d16d43e06dc73528581db936607759b1b","observation_id":"67ed51e2-4d4b-49e0-a899-049852d7d42e","resolution":{"observed_at":"2026-05-11T03:50:54.983955Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"cited_work":{"arxiv_id":"2508.21141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21141","snapshot_observed_at":"2026-07-03T23:09:01.795037Z","title":"Pan, H., Tennenholtz, G., Mannor, S., Chi, C.-W., Brekel- mans, R., Shah, P., and Tewari, A","venue":null,"work_id":"86cd33f5-f0be-4d28-b775-10e356b31e74","year":2025},"citing_paper":{"arxiv_id":"2605.07180","last_updated":"2026-05-08T03:18:40Z","snapshot_observed_at":"2026-08-10T21:41:30.191085Z","submitted_at":"2026-05-08T03:18:40Z","title":"Learning Agent Routing From Early Experience","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-11T01:15:07.381414Z"},"links":{"cited_paper":"/paper/2508.21141","citing_paper":"/paper/2605.07180"},"observation_digest":"sha256:a3d5b37ae1592fa54f6c4c8b27c2e7dcf72e67a041e0a90bdb56d07a021682a2","observation_id":"67161235-3b09-43dd-bf49-f3dfb43f213e","resolution":{"observed_at":"2026-05-11T04:35:57.457609Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"cited_work":{"arxiv_id":"2508.21141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21141","snapshot_observed_at":"2026-07-03T23:09:01.795037Z","title":"Pan, H., Tennenholtz, G., Mannor, S., Chi, C.-W., Brekel- mans, R., Shah, P., and Tewari, A","venue":null,"work_id":"86cd33f5-f0be-4d28-b775-10e356b31e74","year":2025},"citing_paper":{"arxiv_id":"2605.27999","last_updated":"2026-05-27T05:45:47Z","snapshot_observed_at":"2026-08-02T07:13:55.557664Z","submitted_at":"2026-05-27T05:45:47Z","title":"Learning to Assign Prediction Tasks to Agents with Capacity Constraints","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-29T10:31:57.696695Z"},"links":{"cited_paper":"/paper/2508.21141","citing_paper":"/paper/2605.27999"},"observation_digest":"sha256:9d2325936e8deae29e3b013a74a4ff5a491dd9eb27fe474affe0e44ef8ca2675","observation_id":"15d2ac0f-c174-4552-916d-9f804ce0e51f","resolution":{"observed_at":"2026-06-29T10:33:18.725397Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"cited_work":{"arxiv_id":"2508.21141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.21141","snapshot_observed_at":"2026-07-03T23:09:01.795037Z","title":"Pan, H., Tennenholtz, G., Mannor, S., Chi, C.-W., Brekel- mans, R., Shah, P., and Tewari, A","venue":null,"work_id":"86cd33f5-f0be-4d28-b775-10e356b31e74","year":2025},"citing_paper":{"arxiv_id":"2606.17949","last_updated":"2026-06-16T14:02:34Z","snapshot_observed_at":"2026-07-06T23:53:25.839293Z","submitted_at":"2026-06-16T14:02:34Z","title":"RouteBalance: Fused Model Routing and Load Balancing for Heterogeneous LLM Serving","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-06-26T22:47:46.425636Z"},"links":{"cited_paper":"/paper/2508.21141","citing_paper":"/paper/2606.17949"},"observation_digest":"sha256:2ee30dd8815b25ed59e08d60330c734f45b59dd64fcdafc752cda8db07855704","observation_id":"8b70e346-fcbc-4ad4-8913-1a0165a2e83e","resolution":{"observed_at":"2026-07-03T23:09:01.796753Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2508.21141/citation-record","integrity":"/paper/2508.21141/integrity","json":"/paper/2508.21141/citation-record.json","paper":"/paper/2508.21141"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:34.816555Z","title":null,"venue":null,"work_id":"b9dadeda-b679-49a5-8230-3e30345dde5c","year":2011},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:26.930593Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:c3e939d14ce7a5adf3354edef2ba8eb602386026d36ad06295b511db88e0eb18","observation_id":"86c66b63-cfac-4318-a915-feb89b559a53","resolution":{"observed_at":"2026-08-05T14:39:35.001275Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1102.2670","last_updated":"2011-02-14T04:06:31Z","snapshot_observed_at":"2026-07-06T02:23:26.911229Z","submitted_at":"2011-02-14T04:06:31Z","title":"Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1102.2670","snapshot_observed_at":"2026-08-05T14:39:27.008442Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.008442Z"},"links":{"cited_paper":"/paper/1102.2670","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:43c49c4d033a3eed46006ced85627db067b4f09251b86753ec22885d7ed584c3","observation_id":"a051fd81-ac6d-4d1e-a7d3-b9e0432ab4a2","resolution":{"observed_at":"2026-08-05T14:39:27.008442Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:34.548030Z","title":null,"venue":null,"work_id":"2901f7aa-047b-48fd-8907-42460b1b6d0d","year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.080873Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:0437934d6f630a4ae480f52671181b9a064f238016e14f53e5416cfb464a94b1","observation_id":"e98ec16c-e9e7-423b-821e-42ce30863f73","resolution":{"observed_at":"2026-08-05T14:39:34.629623Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:34.137937Z","title":null,"venue":null,"work_id":"6085a155-a03e-4e08-9b50-39bb4a194551","year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.152838Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:de4410a45833303402e596e5812ebde75816ceb0a7635a96d9b08a6e5424c7a9","observation_id":"01864480-99fa-4eef-b081-a779ba488f76","resolution":{"observed_at":"2026-08-05T14:39:34.336002Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.10040","last_updated":"2019-04-02T14:17:40Z","snapshot_observed_at":"2026-08-03T12:17:10.040125Z","submitted_at":"2019-04-02T14:17:40Z","title":"A Survey on Practical Applications of Multi-Armed and Contextual Bandits","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.10040","snapshot_observed_at":"2026-08-05T14:39:27.237540Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.237540Z"},"links":{"cited_paper":"/paper/1904.10040","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:5814a2c5bedb190552d1bfdaa2874564b8b8e30bfcb7a1675668bd42e2cc0e11","observation_id":"69307f3f-eaf5-47fa-8818-fd4a016c9421","resolution":{"observed_at":"2026-08-05T14:39:27.237540Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:33.834007Z","title":null,"venue":null,"work_id":"b2247de8-ec7e-4b7d-9c14-5dd55c07dc11","year":2008},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.300127Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:6351876b1371795d3769a3b2a846cea57605dd4a953d031766e7ebef62636594","observation_id":"5fd9f15f-f940-4a7d-a248-52a32e2d2a60","resolution":{"observed_at":"2026-08-05T14:39:34.006984Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:33.542550Z","title":null,"venue":null,"work_id":"3cd364a0-5a80-4df1-8084-82772afb244d","year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.380758Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:094c64cecea98cd7beb99bda5cab0291964e2ac535d6ff1e7c750fbd9f399e7f","observation_id":"bc515af8-38a5-4d45-9de3-405e68ebcf8f","resolution":{"observed_at":"2026-08-05T14:39:33.662132Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:33.239190Z","title":null,"venue":null,"work_id":"483a552f-9a5f-4a2d-b51f-9d8a1c01f1d1","year":2022},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.468180Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:7f70385cfb854c48d11d2362c79e3ed195184f02c7ca597267da220a29353ae5","observation_id":"e77790e1-5f88-4f25-b1ef-1e70251ed14e","resolution":{"observed_at":"2026-08-05T14:39:33.350685Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-08-10T11:59:11.481480Z","submitted_at":"2023-05-09T05:11:02Z","title":"FrugalGPT: How to Use Large Language Models While Reducing Cost and Improving Performance","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.05176","snapshot_observed_at":"2026-08-05T14:39:27.552664Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.552664Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:dec9a0b30c7a3aaf28edd1595033ab35db2f0a4f4c323b2d35ca43db16787bd7","observation_id":"ef65deea-2ec1-4090-8702-f902e6733cb8","resolution":{"observed_at":"2026-08-05T14:39:27.552664Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.04132","last_updated":"2024-03-07T01:22:38Z","snapshot_observed_at":"2026-08-02T17:55:33.750637Z","submitted_at":"2024-03-07T01:22:38Z","title":"Chatbot Arena: An Open Platform for Evaluating LLMs by Human Preference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.04132","snapshot_observed_at":"2026-08-05T14:39:27.621782Z","title":"Gonzalez, and Ion Stoica","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.621782Z"},"links":{"cited_paper":"/paper/2403.04132","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:95b4d5ebcdcbff47675134192ca9a0b9ef7f785b6d03f3e5dd64df76043d4029","observation_id":"207567d2-ab48-45a3-bde0-4bd78601166b","resolution":{"observed_at":"2026-08-05T14:39:27.621782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.13284","last_updated":"2025-06-19T22:52:45Z","snapshot_observed_at":"2026-08-07T19:53:57.315695Z","submitted_at":"2024-10-17T07:28:18Z","title":"Learning to Route LLMs with Confidence Tokens","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.13284","snapshot_observed_at":"2026-08-05T14:39:27.717082Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.717082Z"},"links":{"cited_paper":"/paper/2410.13284","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:55b8ac8b9bb3f677ab349052a824ae332e41fd4c044d9745760afa5beacc9d3b","observation_id":"1b34a330-3df0-4b24-be36-94402824379a","resolution":{"observed_at":"2026-08-05T14:39:27.717082Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:32.925593Z","title":null,"venue":null,"work_id":"271d5a4f-f862-4873-8349-723c32e97a0e","year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.790844Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:fc3e17946f0cbbd1e618aa182acfc1dce0bcbc3fd84875b52bdad11a5e452d8d","observation_id":"3f510305-dc09-48b7-b635-12fb6bd6f65b","resolution":{"observed_at":"2026-08-05T14:39:33.092185Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-08-08T18:42:25.777499Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-08-05T14:39:27.856593Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.856593Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:bc766b0793d82e385a4314364af790d3d0cbbff912e3da859077a01a80ba26cc","observation_id":"d39c3808-a077-4ff5-b007-37eca2617bec","resolution":{"observed_at":"2026-08-05T14:39:27.856593Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.03834","last_updated":"2025-03-17T15:08:47Z","snapshot_observed_at":"2026-08-05T19:53:12.719014Z","submitted_at":"2024-10-04T18:02:48Z","title":"GraphRouter: A Graph-based Router for LLM Selections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.03834","snapshot_observed_at":"2026-08-05T14:39:27.930913Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.930913Z"},"links":{"cited_paper":"/paper/2410.03834","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:df4509fe7e15428c2c8f101ca7c54d7f4fe380304e2ddab6909c5824c0a45caf","observation_id":"2ab951b5-5652-4376-a0ea-efd51075db77","resolution":{"observed_at":"2026-08-05T14:39:27.930913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.02531","last_updated":"2015-03-09T15:44:49Z","snapshot_observed_at":"2026-07-06T04:11:24.157003Z","submitted_at":"2015-03-09T15:44:49Z","title":"Distilling the Knowledge in a Neural Network","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.02531","snapshot_observed_at":"2026-08-05T14:39:27.988159Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:27.988159Z"},"links":{"cited_paper":"/paper/1503.02531","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:0d2e3181746afda9af629ac286dc6a6bd15eea42fcb0ebf0411382639005bce1","observation_id":"b9b3850e-29c2-4bb5-848c-ba36615c9797","resolution":{"observed_at":"2026-08-05T14:39:27.988159Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:32.593730Z","title":null,"venue":null,"work_id":"8f36e0aa-964b-4e85-9f4f-17869dac77f2","year":2021},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.062347Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:34eeaa63430e069a377bf4ccb72b739e90c495bc08bba7c7f47a0b7c806f02dc","observation_id":"d9f51ab4-d04d-4229-814f-6773cc330ed5","resolution":{"observed_at":"2026-08-05T14:39:32.750716Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.12031","last_updated":"2024-03-28T17:56:28Z","snapshot_observed_at":"2026-08-09T22:21:33.340392Z","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-08-05T14:39:28.142053Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.142053Z"},"links":{"cited_paper":"/paper/2403.12031","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:4cd5088e2287a1d99ab3bc3ccf772a096def81aeaeb9a4b808681f1510b46227","observation_id":"9151aae2-da75-4845-8f8d-42ac4fe5aa6f","resolution":{"observed_at":"2026-08-05T14:39:28.142053Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:32.263478Z","title":null,"venue":null,"work_id":"ed0d30c5-e0e0-4d05-a737-9ab94bb565be","year":2018},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.208487Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:59e63a4eee3bcde31b154ac2cc6ed3d7b098c80753fceda265d83ac0da1330eb","observation_id":"7b51bf4e-4087-4cc3-881b-802601f2afee","resolution":{"observed_at":"2026-08-05T14:39:32.405681Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:31.959376Z","title":null,"venue":null,"work_id":"ea8d7c7c-7e15-4db7-aa0f-69bf36620032","year":2023},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.287081Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:a0a7be758ed308334af0970582428ac3c0ba1078322eb861e3f1d4ebf12d9852","observation_id":"436a5729-164c-4ab7-b578-f9168b7861fe","resolution":{"observed_at":"2026-08-05T14:39:32.083009Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:31.628444Z","title":null,"venue":null,"work_id":"5cdbcc94-0a03-4353-8d39-e89c51ddb296","year":2007},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.361552Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:9907af524eab02b3e6230a7977518a8e306492180f9262fd92634bc3c8848484","observation_id":"9040eea5-e1de-483e-a7b1-accb5e83bb22","resolution":{"observed_at":"2026-08-05T14:39:31.819511Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:31.316236Z","title":null,"venue":null,"work_id":"137532e1-172b-4e02-9406-cec4e8b06112","year":2020},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.451626Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:e178a335f021410aac4c9bdb2aa59512c48f9cd67f0441578ae709c554dcca72","observation_id":"f4e1bf5c-6dd0-4f0a-b0aa-232503e2ad9c","resolution":{"observed_at":"2026-08-05T14:39:31.475373Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:30.945592Z","title":null,"venue":null,"work_id":"2cbc03df-45ed-4e30-8e85-2e4d0d619841","year":1989},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.543529Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:9d9a22dfb88388a692ebb734b47719bcdba225b7528d2dea92c330b784e2405a","observation_id":"8d53ed4f-4120-42b0-b62c-2641a749e151","resolution":{"observed_at":"2026-08-05T14:39:31.152899Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12391","last_updated":"2024-07-17T08:11:47Z","snapshot_observed_at":"2026-07-06T18:47:37.971415Z","submitted_at":"2024-07-17T08:11:47Z","title":"LLM Inference Serving: Survey of Recent Advances and Opportunities","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12391","snapshot_observed_at":"2026-08-05T14:39:28.604793Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.604793Z"},"links":{"cited_paper":"/paper/2407.12391","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:f7256ba6eac11a21ffed1fedd760bf4ae30de766658d614f45b9fa14a97a671f","observation_id":"e101a446-4e05-498d-bbb0-4694925301fa","resolution":{"observed_at":"2026-08-05T14:39:28.604793Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:30.763856Z","title":null,"venue":null,"work_id":"6bf46f82-6b3d-4fa3-af61-da2287095a6e","year":2010},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.667423Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:9bf9f4c24704b3ce90707d18c00e4a9e4320bf5654c635cef0679285f5f9fd68","observation_id":"fdcf5838-bced-4017-9c86-8b7d66de42de","resolution":{"observed_at":"2026-08-05T14:39:30.862533Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:30.594833Z","title":null,"venue":null,"work_id":"a5ccb8e0-53d0-4e18-8904-6d858e18ab19","year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.752482Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:68b0d1196ed6fc8db0713ff1f8ae7d45019c8c98a4a962aa841ba9605cb3bf23","observation_id":"b7a1b287-ef61-41e6-8320-aa455150ec1d","resolution":{"observed_at":"2026-08-05T14:39:30.679912Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.02994","last_updated":"2024-01-23T04:43:56Z","snapshot_observed_at":"2026-08-10T04:50:02.980492Z","submitted_at":"2024-01-04T07:45:49Z","title":"Blending Is All You Need: Cheaper, Better Alternative to Trillion-Parameters LLM","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.02994","snapshot_observed_at":"2026-08-05T14:39:28.853072Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.853072Z"},"links":{"cited_paper":"/paper/2401.02994","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:5964d7b8f8937b7a2997f3dd9fff9545f1b1c1c0adad6875f681efbe96fe2928","observation_id":"60be94f3-7e0c-4476-8291-77649cad4790","resolution":{"observed_at":"2026-08-05T14:39:28.853072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18665","last_updated":"2025-02-23T08:50:33Z","snapshot_observed_at":"2026-07-30T15:06:18.011623Z","submitted_at":"2024-06-26T18:10:22Z","title":"RouteLLM: Learning to Route LLMs with Preference Data","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18665","snapshot_observed_at":"2026-08-05T14:39:28.921879Z","title":"Gonzalez, M Waleed Kadous, and Ion Stoica","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.921879Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:f7488bbf3c3837cd45c05aefd8856e1c4d8636d68fedbd1fc58839bcc0e96b9f","observation_id":"a265223e-b164-4fc8-b23b-f1e81e017b67","resolution":{"observed_at":"2026-08-05T14:39:28.921879Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:30.436834Z","title":null,"venue":null,"work_id":"da211f61-9db8-4fa0-92e1-c20921f90588","year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:28.982482Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:85425581d3169c90f4427c3dade85817041f94582c6c35f2bb630a124bc375c6","observation_id":"dc2c07e0-12fe-4f4c-9b4f-a66a472be77a","resolution":{"observed_at":"2026-08-05T14:39:30.523548Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:30.266677Z","title":null,"venue":null,"work_id":"14f245f2-afcc-4ac0-829d-22aa647df9fd","year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:29.069863Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:c5ce141ef15dcab602377176c72ca4a8237e6225bde25d3e3295dd86eed09bd0","observation_id":"5139bb6c-9f78-4af4-a25d-b115bc4e4979","resolution":{"observed_at":"2026-08-05T14:39:30.344435Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:30.117620Z","title":null,"venue":null,"work_id":"407b5f56-fd2b-4aaf-872d-5b8248e80d85","year":2023},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:29.136489Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:d0214223b65566798331a8de2c2cf3d54f5f4c0900cebd464892dcb1e7caca06","observation_id":"face6a63-c5ea-47d8-a4d3-8a74a1663063","resolution":{"observed_at":"2026-08-05T14:39:30.193020Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:29.953545Z","title":null,"venue":null,"work_id":"a82d42f2-d0ae-447a-88e3-e26dab9c3604","year":2024},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:29.192653Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:3645f8d96c9a4f59e44a0acfee16beab7575daa16cdbad32fa1d96665f9377e9","observation_id":"29f46e73-c8e1-4a51-bd56-9651afa03bd1","resolution":{"observed_at":"2026-08-05T14:39:30.048794Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:29.776718Z","title":null,"venue":null,"work_id":"780b8c31-55a2-468f-b38b-97b4b9f305ea","year":2008},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:29.279157Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:841261e59351217e1a29419f905a412ecb3dd4fffbc6b3e44dcaeef105c17390","observation_id":"7b412163-c631-4a1e-9b2e-f6e4b6745a03","resolution":{"observed_at":"2026-08-05T14:39:29.877561Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T14:39:29.376786Z","title":"online\" 'onlinestring :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:29.376786Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:a33e19c160b8f0e1680d788bb944a899b288f0ddddf5a15b9173893459538ec4","observation_id":"3d072697-c2cd-4ef7-b7c0-5d353e989c66","resolution":{"observed_at":"2026-08-05T14:39:29.376786Z","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-08-05T14:39:29.472886Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T14:39:29.472886Z"},"links":{"citing_paper":"/paper/2508.21141"},"observation_digest":"sha256:a30cc445714e0bccca384d9da6976ccc3f9cc94385e5cf218248122bd4ef1b1f","observation_id":"7dcb12ed-13db-4654-a8a5-aef75a670676","resolution":{"observed_at":"2026-08-05T14:39:29.472886Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2508.21141","last_updated":"2025-09-09T09:54:15Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T22:21:22.305016Z","submitted_at":"2025-08-28T18:18:19Z","title":"Adaptive LLM Routing under Budget Constraints"},"reference_resolution":{"displayed":34,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":34,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":34},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 9 inbound Pith citation observations for arXiv:2508.21141."}