{"as_of":"2026-08-09T11:58:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7a850ea647fff5322467d0891d9d4f76f69a76c8f832a6dc4a5dba33ae6df72b","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":21,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":21,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":21,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":21,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T11:22:28.917976Z","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-06-29T14:13:30.213537Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":"2311.08692","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-06-29T14:13:30.213537Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models","venue":null,"work_id":"89173a24-d667-424c-a60d-26ca252602c6","year":2023},"citing_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},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-11T23:27:40.397360Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2406.18665"},"observation_digest":"sha256:6a50458c52973bcb25ca6f7b08693ac280cc9eae59b314d7623a5a97ea325ab2","observation_id":"9926eabf-7770-43fb-ab6f-df1b602d0f6f","resolution":{"observed_at":"2026-05-11T23:27:40.641302Z","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":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-09T11:22:28.917976Z","title":"Routing to the expert: Efficient reward- guided ensemble of large language models.arXiv preprint arXiv:2311.08692,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.02743","last_updated":"2025-02-04T22:09:43Z","snapshot_observed_at":"2026-08-09T11:14:34.154309Z","submitted_at":"2025-02-04T22:09:43Z","title":"LLM Bandit: Cost-Efficient LLM Generation via Preference-Conditioned Dynamic Routing","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T11:22:28.917976Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2502.02743"},"observation_digest":"sha256:649e13c89e88d0b1fd35408aa4bb39a1e25c5ed82356dab19b52c841ec59f36d","observation_id":"7118ebd6-14d2-4dce-838f-52385c04b611","resolution":{"observed_at":"2026-08-09T11:22:28.917976Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-08T22:33:09.450594Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.04506","last_updated":"2025-02-06T21:13:44Z","snapshot_observed_at":"2026-08-09T04:44:07.719948Z","submitted_at":"2025-02-06T21:13:44Z","title":"When One LLM Drools, Multi-LLM Collaboration Rules","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-08T22:33:09.450594Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2502.04506"},"observation_digest":"sha256:9c65729bae31f1cb30e32b5a3985e617652117c0e63515625873a8a49171e236","observation_id":"f85f4faa-ccea-41f0-a253-87dd79a6ca6e","resolution":{"observed_at":"2026-08-08T22:33:09.450594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-08T13:08:22.741204Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.07350","last_updated":"2025-09-06T07:54:06Z","snapshot_observed_at":"2026-08-08T12:59:48.269781Z","submitted_at":"2025-02-11T08:22:12Z","title":"KABB: Knowledge-Aware Bayesian Bandits for Dynamic Expert Coordination in Multi-Agent Systems","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-08T13:08:22.741204Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2502.07350"},"observation_digest":"sha256:df9c459c6b7b4e472e1a9f59d1a71a30a855b3f5648ef6c6336aaf3fc496c864","observation_id":"abb4ff25-5c78-44c5-8e4d-d0fa3d6d76a8","resolution":{"observed_at":"2026-08-08T13:08:22.741204Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":"2311.08692","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-06-29T14:13:30.213537Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models","venue":null,"work_id":"89173a24-d667-424c-a60d-26ca252602c6","year":2023},"citing_paper":{"arxiv_id":"2505.12601","last_updated":"2026-05-14T18:08:42Z","snapshot_observed_at":"2026-08-02T11:09:30.375825Z","submitted_at":"2025-05-19T01:33:41Z","title":"Rethinking Predictive Modeling for LLM Routing: When Simple kNN Beats Complex Learned Routers","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:28.927880Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2505.12601"},"observation_digest":"sha256:b0392b8a36f0aab342c0e5abfea70c6da555d3e1fc0829b37d45cee99327b4d3","observation_id":"2272bea2-deb1-4b2b-94ca-5171387e14df","resolution":{"observed_at":"2026-05-22T15:14:57.357049Z","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":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-07T15:11:17.453059Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models.arXiv preprint arXiv:2311.08692,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.16221","last_updated":"2025-05-22T04:46:04Z","snapshot_observed_at":"2026-08-08T05:31:07.480386Z","submitted_at":"2025-05-22T04:46:04Z","title":"LightRouter: Towards Efficient LLM Collaboration with Minimal Overhead","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T15:11:17.453059Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2505.16221"},"observation_digest":"sha256:17255c5abfcab576a83f00daf84667916f35ddd58ce977bf8f69cf182fe721f1","observation_id":"b2f5239e-f702-4185-8ac9-c9ea9028a953","resolution":{"observed_at":"2026-08-07T15:11:17.453059Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-07T13:10:01.189304Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models.arXiv preprint arXiv:2311.08692, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.23844","last_updated":"2025-05-28T16:24:50Z","snapshot_observed_at":"2026-08-07T13:02:19.278484Z","submitted_at":"2025-05-28T16:24:50Z","title":"Enabling Flexible Multi-LLM Integration for Scalable Knowledge Aggregation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:01.189304Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2505.23844"},"observation_digest":"sha256:ac65aa752f4d10d22d4ea3d07bcb50e04902664777152857aea975d4543a24bb","observation_id":"f2c06686-1f11-4f30-95ad-ab6ad3ccc422","resolution":{"observed_at":"2026-08-07T13:10:01.189304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-07T12:02:17.457767Z","title":"arXiv preprint arXiv:2311.08692","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.00817","last_updated":"2025-06-01T03:48:54Z","snapshot_observed_at":"2026-08-09T04:25:32.006657Z","submitted_at":"2025-06-01T03:48:54Z","title":"One for All: Update Parameterized Knowledge Across Multiple Models","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T12:02:17.457767Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2506.00817"},"observation_digest":"sha256:2c1dd650106828c3f6b68509174c3ec5006eddfcf30eecc6d4f55e6af3f2d3ed","observation_id":"11edae38-5819-4987-b16c-6c22dc203e40","resolution":{"observed_at":"2026-08-07T12:02:17.457767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-07T12:00:11.691257Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.01048","last_updated":"2025-06-21T03:39:58Z","snapshot_observed_at":"2026-08-09T00:38:43.055341Z","submitted_at":"2025-06-01T15:14:58Z","title":"IRT-Router: Effective and Interpretable Multi-LLM Routing via Item Response Theory","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:11.691257Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2506.01048"},"observation_digest":"sha256:b99f3a4abbbb95d643fcf0978edd8668b68569835244cc715e6015309438554e","observation_id":"15ecc7a5-f4da-4959-a30b-e16fd330591c","resolution":{"observed_at":"2026-08-07T12:00:11.691257Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-07T11:04:06.892322Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.03637","last_updated":"2025-07-07T09:53:22Z","snapshot_observed_at":"2026-08-08T03:23:19.289933Z","submitted_at":"2025-06-04T07:30:16Z","title":"RewardAnything: Generalizable Principle-Following Reward Models","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T11:04:06.892322Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2506.03637"},"observation_digest":"sha256:e138a15c67d74a50dcff486fa844a9c6a731416ed95c168fbd673d4d2e1ac92b","observation_id":"9a17a9eb-7e34-45b2-871d-73a3db0b36cf","resolution":{"observed_at":"2026-08-07T11:04:06.892322Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-07T05:56:56.738323Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06579","last_updated":"2025-06-06T23:13:08Z","snapshot_observed_at":"2026-08-07T05:51:34.237166Z","submitted_at":"2025-06-06T23:13:08Z","title":"Towards Efficient Multi-LLM Inference: Characterization and Analysis of LLM Routing and Hierarchical Techniques","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T05:56:56.738323Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2506.06579"},"observation_digest":"sha256:49b69fe1c9217d54895990b32f4f7b7b70ff4680018c7961f40f7ddd33b2b6af","observation_id":"c53fac9d-a16e-49b1-9c65-099db0fc7b9b","resolution":{"observed_at":"2026-08-07T05:56:56.738323Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-06T22:05:28.010601Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-08-06T21:57:22.791105Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T22:05:28.010601Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2506.22716"},"observation_digest":"sha256:de7de24c00f1fa2fd1fbea076e71b27d094c21a17dfcbc92f0c9bc380accb283","observation_id":"f41a9391-1486-46d8-94a4-5e0be6c5c641","resolution":{"observed_at":"2026-08-06T22:05:28.010601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-06T17:48:07.159727Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2507.09973","last_updated":"2025-07-14T06:43:00Z","snapshot_observed_at":"2026-08-08T02:31:23.778902Z","submitted_at":"2025-07-14T06:43:00Z","title":"Tiny Reward Models","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T17:48:07.159727Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2507.09973"},"observation_digest":"sha256:f20562fe40420244b2147913ad3ce83606c4138f1009c095fc574aa5e9bb6987","observation_id":"e8578aff-60bd-4b87-a2f6-fbdf9c4f6b1c","resolution":{"observed_at":"2026-08-06T17:48:07.159727Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":"2311.08692","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-06-29T14:13:30.213537Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models","venue":null,"work_id":"89173a24-d667-424c-a60d-26ca252602c6","year":2023},"citing_paper":{"arxiv_id":"2507.14200","last_updated":"2026-05-15T13:08:04Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-07-14T16:17:11Z","title":"A Scalable Multi-LLM Collaboration System with Retrieval-based Selection and Exploration-Exploitation-Driven Enhancement","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-05-21T23:26:38.457193Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2507.14200"},"observation_digest":"sha256:ce0500a4611995ceb35f8778a612b7ea39f1d2571cd80de4f1ccfa8838113387","observation_id":"46054713-9086-4374-8f76-8573af26b08a","resolution":{"observed_at":"2026-05-21T23:30:46.038352Z","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":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-06T10:22:42.487916Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.00234","last_updated":"2025-08-01T00:45:15Z","snapshot_observed_at":"2026-08-07T06:39:47.908705Z","submitted_at":"2025-08-01T00:45:15Z","title":"Quality-of-Service Aware LLM Routing for Edge Computing with Multiple Experts","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T10:22:42.487916Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2508.00234"},"observation_digest":"sha256:f8fa0af73c93b93de0e607bb28114be92320067c7bfb91a3e2999efaa5f21e80","observation_id":"c3c4b001-6546-45ba-b1e2-86507aa5b3cd","resolution":{"observed_at":"2026-08-06T10:22:42.487916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-04T22:03:02.028525Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models.arXiv preprint arXiv:2311.08692,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.07571","last_updated":"2025-09-11T02:09:54Z","snapshot_observed_at":"2026-08-09T10:55:33.372063Z","submitted_at":"2025-09-09T10:15:42Z","title":"Towards Generalized Routing: Model and Agent Orchestration for Adaptive and Efficient Inference","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T22:03:02.028525Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2509.07571"},"observation_digest":"sha256:86042ff01bbc6f28efcdaa1754845331f9c622b1d87a80bbbd6a0fda7bdad7f1","observation_id":"0fad8384-2d4d-479b-a8f4-f7cce359867c","resolution":{"observed_at":"2026-08-04T22:03:02.028525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-04T00:16:18.050879Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02200","last_updated":"2026-07-06T06:58:54Z","snapshot_observed_at":"2026-08-08T02:59:41.703931Z","submitted_at":"2025-11-04T02:41:14Z","title":"Optimal-Agent-Selection: State-Aware Routing Framework for Efficient Multi-Agent Collaboration","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T00:16:18.050879Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2511.02200"},"observation_digest":"sha256:151e7c0a97cc4be0227f2da59d039fa50d7b68e26d340cf0759abfcb4e099f8e","observation_id":"83ae4ec0-33b2-43a8-b6f3-21c18cddb81c","resolution":{"observed_at":"2026-08-04T00:16:18.050879Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":"2311.08692","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-06-29T14:13:30.213537Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models","venue":null,"work_id":"89173a24-d667-424c-a60d-26ca252602c6","year":2023},"citing_paper":{"arxiv_id":"2605.07395","last_updated":"2026-05-08T07:49:24Z","snapshot_observed_at":"2026-07-06T23:19:46.018236Z","submitted_at":"2026-05-08T07:49:24Z","title":"Unsolvability Ceiling in Multi-LLM Routing: An Empirical Study of Evaluation Artifacts","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-11T01:52:18.146336Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2605.07395"},"observation_digest":"sha256:72e15001fd390a317ef1eb40fc679999afff969de0ed2dc5e095a40fe8294c06","observation_id":"aa594b17-438f-4f74-8416-1572d79643b2","resolution":{"observed_at":"2026-05-11T04:15:58.238171Z","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":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":"2311.08692","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-06-29T14:13:30.213537Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models","venue":null,"work_id":"89173a24-d667-424c-a60d-26ca252602c6","year":2023},"citing_paper":{"arxiv_id":"2605.17106","last_updated":"2026-05-16T18:19:30Z","snapshot_observed_at":"2026-07-06T23:28:12.114488Z","submitted_at":"2026-05-16T18:19:30Z","title":"HyDRA: Hybrid Dynamic Routing Architecture for Heterogeneous LLM Pools","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T15:13:27.898371Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2605.17106"},"observation_digest":"sha256:421d86700e0eab0bebfefb8f97e4df9a5d625796d9eb918f81cd4ce822d77c65","observation_id":"cf8f819a-950d-4d29-95bd-392273c2a11c","resolution":{"observed_at":"2026-05-20T15:13:31.966933Z","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":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":"2311.08692","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-06-29T14:13:30.213537Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models","venue":null,"work_id":"89173a24-d667-424c-a60d-26ca252602c6","year":2023},"citing_paper":{"arxiv_id":"2606.07587","last_updated":"2026-05-27T19:29:01Z","snapshot_observed_at":"2026-07-31T18:45:52.517819Z","submitted_at":"2026-05-27T19:29:01Z","title":"The Routing Plateau: Understanding and Breaking the Accuracy Limits of LLM Routers","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-29T14:07:26.366172Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2606.07587"},"observation_digest":"sha256:09bbd2f48436b1753f609349246e8ebb9541c949ea2d811cbb5bb83fa292b67f","observation_id":"d566c921-c088-4506-8af4-2f340298a794","resolution":{"observed_at":"2026-06-29T14:13:30.214907Z","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":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-07-11T19:31:58.491532Z","title":"Routing to the expert: Efficient reward-guided ensemble of large language models.arXiv preprint arXiv:2311.08692, 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.04389","last_updated":"2026-07-05T16:34:54Z","snapshot_observed_at":"2026-08-09T01:23:04.531945Z","submitted_at":"2026-07-05T16:34:54Z","title":"Decentralized Aggregation of LLM Predictions via Wagering Mechanisms","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-11T19:31:58.491532Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2607.04389"},"observation_digest":"sha256:76e5bd656d2c8096da2eaaab8b3750006fe84ec6cb343df5bfd97f8ace9779d9","observation_id":"80f544e5-6b27-4710-96f9-7482b70a38db","resolution":{"observed_at":"2026-07-11T19:31:58.491532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2311.08692/citation-record","integrity":"/paper/2311.08692/integrity","json":"/paper/2311.08692/citation-record.json","paper":"/paper/2311.08692"},"outbound":[],"paper":{"arxiv_id":"2311.08692","last_updated":"2023-11-15T04:40:43Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-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 0 of 0 outbound references and 21 inbound Pith citation observations for arXiv:2311.08692."}