{"as_of":"2026-08-09T15:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e08e37e007049f4bea06afceeccaeca7b8d92c4b6b74464d89216d7abe5eec76","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T18:11:31.776617Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:29:05.839242Z","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-04T00:19:13.484324Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-08-07T15:29:05.839242Z","title":"Mixllm: Dynamic routing in mixed large language models.arXiv preprint arXiv:2502.18482, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.15076","last_updated":"2025-05-21T03:49:24Z","snapshot_observed_at":"2026-08-08T23:22:42.007781Z","submitted_at":"2025-05-21T03:49:24Z","title":"Agentic Feature Augmentation: Unifying Selection and Generation with Teaming, Planning, and Memories","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:29:05.839242Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2505.15076"},"observation_digest":"sha256:2a160f8ce27b36b43a6e641e433c6c2f433442798672f7af4ddb0b01ac8f2377","observation_id":"3d4c2133-19f2-433d-b710-4201dc0dcc70","resolution":{"observed_at":"2026-08-07T15:29:05.839242Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-08-07T14:16:55.463687Z","title":"Mixllm: Dynamic routing in mixed large language models,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.19435","last_updated":"2025-05-26T02:53:17Z","snapshot_observed_at":"2026-08-08T23:22:50.432987Z","submitted_at":"2025-05-26T02:53:17Z","title":"Route to Reason: Adaptive Routing for LLM and Reasoning Strategy Selection","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:16:55.463687Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2505.19435"},"observation_digest":"sha256:753658b7b2716d47e5251b384147ec7e44aecadea61058222335747036e43052","observation_id":"72657502-70ab-4b33-8161-a54e7c9666a2","resolution":{"observed_at":"2026-08-07T14:16:55.463687Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-08-07T05:14:57.338457Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.09085","last_updated":"2025-06-10T08:10:16Z","snapshot_observed_at":"2026-08-09T05:50:10.011776Z","submitted_at":"2025-06-10T08:10:16Z","title":"LLM-ML Teaming: Integrated Symbolic Decoding and Gradient Search for Valid and Stable Generative Feature Transformation","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T05:14:57.338457Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2506.09085"},"observation_digest":"sha256:d9d5e738e30f2b42bffb01f105a44991cd82ef93e4f0a7655560cf163b92d39e","observation_id":"cd092c58-6dd9-4911-b1ea-ec8db2c5f8af","resolution":{"observed_at":"2026-08-07T05:14:57.338457Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-08-06T21:29:05.777078Z","title":"Mixllm: Dynamic routing in mixed large language models","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.24124","last_updated":"2025-07-01T03:40:22Z","snapshot_observed_at":"2026-08-08T13:48:41.128139Z","submitted_at":"2025-06-30T17:59:14Z","title":"Teaching Time Series to See and Speak: Forecasting with Aligned Visual and Textual Perspectives","version":2},"reference_index":105,"source":"pdf_text","source_observed_at":"2026-08-06T21:29:05.777078Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2506.24124"},"observation_digest":"sha256:3b0461e196a89b9c62cdaf0cb57ce7ee50425f55b67ecc4175f5a33183b31a72","observation_id":"d52a2482-b6ba-42a3-ab82-bec3c423681c","resolution":{"observed_at":"2026-08-06T21:29:05.777078Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.18482","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-07-04T00:19:13.484324Z","title":"Mixllm: Dynamic routing in mixed large language models","venue":null,"work_id":"bcd58e09-2a3c-4a26-824f-2d80eee2514b","year":2025},"citing_paper":{"arxiv_id":"2603.21354","last_updated":"2026-04-08T22:31:39Z","snapshot_observed_at":"2026-07-06T22:50:05.914888Z","submitted_at":"2026-03-22T18:30:11Z","title":"The Workload-Router-Pool Architecture for LLM Inference Optimization: A Vision Paper from the vLLM Semantic Router Project","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-15T06:40:27.945478Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2603.21354"},"observation_digest":"sha256:f09ba2319a0fa057500a1480c226547e86bdb63ddd7ec856d47d35362ee9a3af","observation_id":"b56dd0a4-56ba-4b2d-8d5d-52f18db75492","resolution":{"observed_at":"2026-05-15T06:45:12.095512Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.18482","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-07-04T00:19:13.484324Z","title":"Mixllm: Dynamic routing in mixed large language models","venue":null,"work_id":"bcd58e09-2a3c-4a26-824f-2d80eee2514b","year":2025},"citing_paper":{"arxiv_id":"2605.17288","last_updated":"2026-05-17T06:59:43Z","snapshot_observed_at":"2026-08-02T11:50:03.814042Z","submitted_at":"2026-05-17T06:59:43Z","title":"When Efficiency Backfires: Cascading LLMs Trigger Cascade Failure under Adversarial Attack","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-19T23:58:53.524203Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2605.17288"},"observation_digest":"sha256:d57efc4d5a44607af29f2e9e4072dd23a9fd31225bf37c9aed6c1c822a31a080","observation_id":"3951754e-0523-472d-93d3-3ff75557c887","resolution":{"observed_at":"2026-05-20T00:02:53.775589Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.18482","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-07-04T00:19:13.484324Z","title":"Mixllm: Dynamic routing in mixed large language models","venue":null,"work_id":"bcd58e09-2a3c-4a26-824f-2d80eee2514b","year":2025},"citing_paper":{"arxiv_id":"2605.25424","last_updated":"2026-05-25T04:52:10Z","snapshot_observed_at":"2026-08-06T09:20:38.905278Z","submitted_at":"2026-05-25T04:52:10Z","title":"SeqRoute: Global Budget-Aware Sequential LLM Routing via Offline Reinforcement Learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T23:13:41.456647Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2605.25424"},"observation_digest":"sha256:d3fa53097322495af5c3a19b046c2e11893d26f618e4417cf63ae2a565200030","observation_id":"d7019603-4fcb-4229-b3bd-9919e270f04e","resolution":{"observed_at":"2026-06-29T23:14:01.066563Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.18482","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-07-04T00:19:13.484324Z","title":"Mixllm: Dynamic routing in mixed large language models","venue":null,"work_id":"bcd58e09-2a3c-4a26-824f-2d80eee2514b","year":2025},"citing_paper":{"arxiv_id":"2606.06924","last_updated":"2026-06-05T05:42:00Z","snapshot_observed_at":"2026-08-06T11:49:12.989321Z","submitted_at":"2026-06-05T05:42:00Z","title":"From Sampled Outcomes to Capability Distributions: Rethinking Supervision for LLM Routing","version":1},"reference_index":126,"source":"arxiv_source","source_observed_at":"2026-06-27T22:54:28.452796Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2606.06924"},"observation_digest":"sha256:16c955d12d67546deb986145ef3e7de78c6ee1af2b8f8dc6e571dbf548f36560","observation_id":"f64520b5-f021-44ab-9ed9-65aea75244f8","resolution":{"observed_at":"2026-07-02T16:17:08.781794Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":"2502.18482","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-07-04T00:19:13.484324Z","title":"Mixllm: Dynamic routing in mixed large language models","venue":null,"work_id":"bcd58e09-2a3c-4a26-824f-2d80eee2514b","year":2025},"citing_paper":{"arxiv_id":"2606.18774","last_updated":"2026-06-19T09:33:33Z","snapshot_observed_at":"2026-08-06T18:36:21.111914Z","submitted_at":"2026-06-17T07:35:10Z","title":"RouteJudge: An Open Platform for Reproducible and Preference-Aware LLM Routing","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-26T21:17:29.543901Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2606.18774"},"observation_digest":"sha256:98848a802c3645b84cb557346439b639974cffd39ac681bdcb626d71105c157c","observation_id":"fc5268af-5d35-4b3b-adf2-8217fdfa76bc","resolution":{"observed_at":"2026-07-04T00:19:13.485946Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18482","snapshot_observed_at":"2026-08-01T10:14:14.711685Z","title":"Jason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma, Brian Ichter, Fei Xia, Ed H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.20327","last_updated":"2026-07-22T16:14:26Z","snapshot_observed_at":"2026-08-07T18:49:46.472241Z","submitted_at":"2026-07-22T16:14:26Z","title":"PyroDash: Cost-Efficient Token-Level Small-Large Language Model Collaborative Inference","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:14.711685Z"},"links":{"cited_paper":"/paper/2502.18482","citing_paper":"/paper/2607.20327"},"observation_digest":"sha256:fd1290aa4ae3cf92dfcc8bdbe0b3ac73e961ad859d9cf9b8c2147c5d5ad383c6","observation_id":"723212a3-74bc-4b8a-a9ae-27150fab658f","resolution":{"observed_at":"2026-08-01T10:14:14.711685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.18482/citation-record","integrity":"/paper/2502.18482/integrity","json":"/paper/2502.18482/citation-record.json","paper":"/paper/2502.18482"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.05176","last_updated":"2023-05-09T05:11:02Z","snapshot_observed_at":"2026-07-31T18:33:34.529799Z","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-08T18:11:31.678214Z","title":"arXiv preprint arXiv:2305.05176","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.678214Z"},"links":{"cited_paper":"/paper/2305.05176","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:e26458a4291250e091eb99d35473f00b6103ded67ab26279ff8d956ff266859e","observation_id":"5276fc76-8e3d-40bf-9ce9-b85dd3053bc3","resolution":{"observed_at":"2026-08-08T18:11:31.678214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.16203","last_updated":"2024-12-18T10:25:12Z","snapshot_observed_at":"2026-08-07T22:49:49.753466Z","submitted_at":"2024-05-25T12:27:21Z","title":"Evolutionary Large Language Model for Automated Feature Transformation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.16203","snapshot_observed_at":"2026-08-08T18:11:31.695600Z","title":"arXiv preprint arXiv:2405.16203","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.695600Z"},"links":{"cited_paper":"/paper/2405.16203","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:71dca8b83566093bc36f5fdfe3fd2c1670c69d9f224865e04575324dc9d61fe4","observation_id":"4d9ce9e3-6a4c-4072-b6d4-02946c3eeddf","resolution":{"observed_at":"2026-08-08T18:11:31.695600Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03182","last_updated":"2024-02-05T16:46:35Z","snapshot_observed_at":"2026-08-05T06:52:11.042766Z","submitted_at":"2024-02-05T16:46:35Z","title":"Empowering Time Series Analysis with Large Language Models: A Survey","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03182","snapshot_observed_at":"2026-08-08T18:11:31.700662Z","title":"arXiv preprint arXiv:2402.03182","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.700662Z"},"links":{"cited_paper":"/paper/2402.03182","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:46d6339a9fc9f7ebf4d74e81fdfe3cac07fb9cfef5c04886f5622d6d36801a99","observation_id":"e183fd72-1609-44f5-975b-b56fccf2d5bd","resolution":{"observed_at":"2026-08-08T18:11:31.700662Z","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-08T18:11:32.098815Z","title":"In ICASSP 2024-2024 IEEE Inter- national Conference on Acoustics, Speech and Signal Processing (ICASSP), pages 12712–12716","venue":null,"work_id":"71e8d5ef-6b90-4de2-b5dc-e18a350c8115","year":2024},"citing_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.710983Z"},"links":{"citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:02574c78c7e024c3153ec728e569d1bc84c848d1d3b8c3480888bde27fcc83f1","observation_id":"1471e6ef-52c4-48f0-862a-3c68fb39324d","resolution":{"observed_at":"2026-08-08T18:11:32.104427Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T18:11:32.081851Z","title":null,"venue":null,"work_id":"ce6a45ca-96d8-4579-8085-7bbef5da9bf3","year":2024},"citing_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.728588Z"},"links":{"citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:7b59c0663abb7282605cc7802d9f229c9bf6962557951bdaa62a2c21c540c5d8","observation_id":"f2c78b87-b6c4-4d35-9bf8-ef0961f2b7de","resolution":{"observed_at":"2026-08-08T18:11:32.087637Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.12963","last_updated":"2025-01-19T15:59:56Z","snapshot_observed_at":"2026-07-06T16:35:48.413898Z","submitted_at":"2023-10-19T17:57:39Z","title":"AutoMix: Automatically Mixing Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.12963","snapshot_observed_at":"2026-08-08T18:11:31.734433Z","title":"arXiv preprint arXiv:2310.12963","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.734433Z"},"links":{"cited_paper":"/paper/2310.12963","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:782e440eb52547ec0bed832b3342c9b16ec5613d3d70563c5a0401c733ed3e8f","observation_id":"29e44bef-f0c6-42ec-8f38-4bf121f13adf","resolution":{"observed_at":"2026-08-08T18:11:31.734433Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10834","last_updated":"2025-04-22T03:55:14Z","snapshot_observed_at":"2026-08-02T06:57:44.337097Z","submitted_at":"2024-07-15T15:45:07Z","title":"MetaLLM: A High-performant and Cost-efficient Dynamic Framework for Wrapping LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10834","snapshot_observed_at":"2026-08-08T18:11:31.739955Z","title":"arXiv preprint arXiv:2407.10834","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.739955Z"},"links":{"cited_paper":"/paper/2407.10834","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:67813fdd64b79209efa6df53000655782130648f2c42936b70b23d8bc53842b6","observation_id":"ed11a720-976f-4f3c-aa41-f1ece7de6d72","resolution":{"observed_at":"2026-08-08T18:11:31.739955Z","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-08T18:11:31.745315Z","title":"arXiv preprint arXiv:2406.18665","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.745315Z"},"links":{"cited_paper":"/paper/2406.18665","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:fb7b0b13acb7fbcd52ad3546d357c0e53b6ef8d5faf084f909853dcd73f36502","observation_id":"fa36fb99-37fc-4b42-a60d-b903ed9974d0","resolution":{"observed_at":"2026-08-08T18:11:31.745315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.10938","last_updated":"2024-10-01T23:38:10Z","snapshot_observed_at":"2026-07-06T18:15:54.402568Z","submitted_at":"2024-05-17T17:49:44Z","title":"Observational Scaling Laws and the Predictability of Language Model Performance","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.10938","snapshot_observed_at":"2026-08-08T18:11:31.750552Z","title":"arXiv preprint arXiv:2405.10938","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.750552Z"},"links":{"cited_paper":"/paper/2405.10938","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:1494a17470556ed8297c5bf8fc3c924077cb5105ffeb0f4a6143dee3c5cbcde3","observation_id":"02581296-63ea-4e73-b75e-a5660839a9fe","resolution":{"observed_at":"2026-08-08T18:11:31.750552Z","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-06T08:57:12.331150Z","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-08T23:22:32.437222Z","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:0797e1f25d172dde5f664ba4bb6882d8fc9461e146ccc78061e68548f3a7b14c","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":"2302.13971","last_updated":"2023-02-27T17:11:15Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-02-27T17:11:15Z","title":"LLaMA: Open and Efficient Foundation Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.13971","snapshot_observed_at":"2026-08-08T18:11:31.766421Z","title":"arXiv preprint arXiv:2302.13971","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.766421Z"},"links":{"cited_paper":"/paper/2302.13971","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:c71c93bcbe141dc21e487725885a41d28bec671b30b844dbdb6cb9358afa4f05","observation_id":"a4cf8b36-6e40-4d0d-a768-8301a03c799b","resolution":{"observed_at":"2026-08-08T18:11:31.766421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.09617","last_updated":"2025-07-17T07:51:28Z","snapshot_observed_at":"2026-07-06T17:30:21.100876Z","submitted_at":"2024-02-14T23:12:09Z","title":"LLM-Enhanced User-Item Interactions: Leveraging Edge Information for Optimized Recommendations","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.09617","snapshot_observed_at":"2026-08-08T18:11:31.770777Z","title":"In 2022 China Au- tomation Congress (CAC), pages 3705–3710","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.770777Z"},"links":{"cited_paper":"/paper/2402.09617","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:ee036823554b8c364c111a15593127f77ec3d2817d3a6240681726c73ebeee08","observation_id":"7ef58c58-6f97-4180-a9a5-7f379ad5636b","resolution":{"observed_at":"2026-08-08T18:11:31.770777Z","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-08T18:11:32.065079Z","title":"In 2024 IEEE 20th International Conference on Automation Science and Engineering (CASE) , pages 1331–1336","venue":null,"work_id":"178d84a4-f63b-4566-9d1a-7085a93cf916","year":2024},"citing_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.776617Z"},"links":{"citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:f7414e242bc3550a68f690547f644183f1593d6350c58e2cf8b05a8aef32a23f","observation_id":"1eda3569-e769-4eb7-b726-a4e6b85d17fe","resolution":{"observed_at":"2026-08-08T18:11:32.070989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2406.09041","last_updated":"2024-10-26T15:55:49Z","snapshot_observed_at":"2026-07-06T18:30:15.196556Z","submitted_at":"2024-06-13T12:27:55Z","title":"ME-Switch: A Memory-Efficient Expert Switching Framework for Large Language Models","version":2},"cited_work":{"arxiv_id":"2406.09041","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.09041","snapshot_observed_at":"2026-08-08T18:11:31.967164Z","title":"ME-Switch: A Memory-Efficient Expert Switching Framework for Large Language Models","venue":"cs.CL","work_id":"36740166-8c91-4368-b17e-7be78e447065","year":2024},"citing_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":2010,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.716759Z"},"links":{"cited_paper":"/paper/2406.09041","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:19964fa6d17b2dc2fac9077809636ea1c757bbc355c5064fa1d9cd534dfbb92b","observation_id":"865ec000-8662-46b1-8231-eae42f316187","resolution":{"observed_at":"2026-08-08T18:11:31.973764Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T18:11:32.115704Z","title":null,"venue":null,"work_id":"b5918924-0e96-4aee-b300-3bdf098fbebe","year":2019},"citing_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.684870Z"},"links":{"citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:40afe4397bb5f87fa69175ef0c8236b0a15f6bca0a87805f70bbe58d4ebf0d9a","observation_id":"98be2290-ea23-435b-bd55-9f636e87204f","resolution":{"observed_at":"2026-08-08T18:11:32.120789Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-08T18:11:32.131768Z","title":"Advances in neural information processing systems, 33:1877–1901","venue":null,"work_id":"027a5f95-4406-407a-980e-fb8db17f6a5c","year":1901},"citing_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.672133Z"},"links":{"citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:a4ac38c9b127cb04dcca511885be1d7c2b6c34e219957e9baacf4b1dc790af84","observation_id":"f39a04a0-ff2b-47e9-b25e-a558bd9ccdfc","resolution":{"observed_at":"2026-08-08T18:11:32.136532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.05131","last_updated":"2023-02-28T17:20:36Z","snapshot_observed_at":"2026-08-08T23:22:00.655876Z","submitted_at":"2022-05-10T19:32:20Z","title":"UL2: Unifying Language Learning Paradigms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.05131","snapshot_observed_at":"2026-08-08T18:11:31.761021Z","title":"arXiv preprint arXiv:2205.05131","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.761021Z"},"links":{"cited_paper":"/paper/2205.05131","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:40b0e7dd419423ceeff6933c048adf3c791ecc67d0dd073466fa545ae79d842e","observation_id":"59689c2a-16ec-4b75-ac8c-4313ab5dbf0a","resolution":{"observed_at":"2026-08-08T18:11:31.761021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-08T18:11:31.666244Z","title":"arXiv preprint arXiv:2303.08774","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.666244Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:2d09785264430fd7776bd86495a1572736354708564dd9da623e9382baf7ca60","observation_id":"b37121ad-a7b9-4aac-97f7-2a8d0e82a531","resolution":{"observed_at":"2026-08-08T18:11:31.666244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-08T18:11:31.690286Z","title":"arXiv preprint arXiv:2404.14618","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.690286Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:b529c6c7b47431f016efbedacd9436776e649d17210ddccf16ea9154a1a50ea0","observation_id":"3dd1f6a2-1801-489f-9db0-1ee819644210","resolution":{"observed_at":"2026-08-08T18:11:31.690286Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","snapshot_observed_at":"2026-08-05T23:59:37.767283Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15130","snapshot_observed_at":"2026-08-08T18:11:31.722170Z","title":"Bone, 190:117326","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-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.722170Z"},"links":{"cited_paper":"/paper/2405.15130","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:63c7316b4af0dda0587c4966a2c22ee82b8cbb2d5e5c87a278932f052b150927","observation_id":"f11c25a7-5954-4fb7-be69-bc7025aa6fbd","resolution":{"observed_at":"2026-08-08T18:11:31.722170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-08T23:22:32.437222Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":16,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":20},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 20 of 20 outbound references and 10 inbound Pith citation observations for arXiv:2502.18482."}