{"as_of":"2026-08-10T05:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:71152748d36e05391e2bc1617b9f848b4eb67947a9351bdb4db9604744d53ae7","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":18,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":18,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":18,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":18,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T19:10:53.457922Z","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-04T20:50:12.595650Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-09T19:10:53.457922Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.00409","last_updated":"2025-07-21T12:20:06Z","snapshot_observed_at":"2026-08-10T00:34:58.507365Z","submitted_at":"2025-02-01T12:08:38Z","title":"Doing More with Less: A Survey on Routing Strategies for Resource Optimisation in Large Language Model-Based Systems","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T19:10:53.457922Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2502.00409"},"observation_digest":"sha256:b1564a724f4f07a7815f25c3d44d2581cd3e938d3bf2916d99e74c9b7148794e","observation_id":"bf3a444f-ac0d-4826-a183-2673feed53e5","resolution":{"observed_at":"2026-08-09T19:10:53.457922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-07T23:48:00.860004Z","title":"A unified approach to routing and cascading for LLMs , 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2502.08773","last_updated":"2025-07-22T15:27:33Z","snapshot_observed_at":"2026-08-08T01:13:01.972942Z","submitted_at":"2025-02-12T20:30:28Z","title":"Universal Model Routing for Efficient LLM Inference","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T23:48:00.860004Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2502.08773"},"observation_digest":"sha256:0755f74266c6f1eccbae16073ce1542b6d9a3e7655651535f7e625e51c13884b","observation_id":"e29ef9e6-4dec-4b58-a39d-fca55912f47f","resolution":{"observed_at":"2026-08-07T23:48:00.860004Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":"2410.10347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-07-04T20:50:12.595650Z","title":"A unified approach to routing and cascad- ing for llms.arXiv preprint arXiv:2410.10347","venue":null,"work_id":"2ea451d7-a030-479e-88d9-43b0e9d884d5","year":2024},"citing_paper":{"arxiv_id":"2502.18036","last_updated":"2026-04-22T02:19:48Z","snapshot_observed_at":"2026-08-02T22:41:05.099083Z","submitted_at":"2025-02-25T09:48:53Z","title":"Harnessing Multiple Large Language Models: A Survey on LLM Ensemble","version":6},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T02:22:28.649071Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2502.18036"},"observation_digest":"sha256:2fed1322801c00334f025bb86d0bca84151e122fe1a9df22bee6a80a83bb3bcb","observation_id":"5170ed3d-0940-4a12-8f23-f1c3eb9ec8c1","resolution":{"observed_at":"2026-05-23T02:25:19.644054Z","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":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-06T18:10:13.573310Z","title":"A unified approach to routing and cascading for llms.arXiv preprint arXiv:2410.10347, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.09003","last_updated":"2026-06-21T22:09:56Z","snapshot_observed_at":"2026-08-08T17:45:21.502689Z","submitted_at":"2025-07-11T20:11:04Z","title":"Orchestration for Domain-specific Edge-Cloud Language Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:10:13.573310Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2507.09003"},"observation_digest":"sha256:2f1adda86eecede3df15436eb798622fb1255eb101f62ed1e0940c9ccda6f74a","observation_id":"85b65157-666e-4a88-a896-97bad57b1485","resolution":{"observed_at":"2026-08-06T18:10:13.573310Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-06T15:06:48.854738Z","title":"A unified approach to routing and cascading for llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.16731","last_updated":"2025-07-22T16:13:43Z","snapshot_observed_at":"2026-08-07T22:15:08.576638Z","submitted_at":"2025-07-22T16:13:43Z","title":"Collaborative Inference and Learning between Edge SLMs and Cloud LLMs: A Survey of Algorithms, Execution, and Open Challenges","version":1},"reference_index":268,"source":"pdf_text","source_observed_at":"2026-08-06T15:06:48.854738Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2507.16731"},"observation_digest":"sha256:1dc5779593e593335f277a06dd04caf4302ffd848126e7f7c45b018a7adc3811","observation_id":"5e089811-0094-4037-9b11-3b855586d478","resolution":{"observed_at":"2026-08-06T15:06:48.854738Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-04T14:56:59.888525Z","title":"A unified approach to routing and cascading for llms","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.22992","last_updated":"2026-08-03T08:38:00Z","snapshot_observed_at":"2026-08-10T00:59:10.624197Z","submitted_at":"2025-09-26T23:08:03Z","title":"T-TAMER: Provably Taming Trade-offs in ML Serving","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T14:56:59.888525Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2509.22992"},"observation_digest":"sha256:2a92b92495c49ca1337b1dcdf82c3ce1eead733bf48d61ed40d3023c23ab08fd","observation_id":"0495b7d8-94ba-41f0-a6fd-cb33bca179a8","resolution":{"observed_at":"2026-08-04T14:56:59.888525Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":"2410.10347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-07-04T20:50:12.595650Z","title":"A unified approach to routing and cascad- ing for llms.arXiv preprint arXiv:2410.10347","venue":null,"work_id":"2ea451d7-a030-479e-88d9-43b0e9d884d5","year":2024},"citing_paper":{"arxiv_id":"2605.06339","last_updated":"2026-05-07T14:28:17Z","snapshot_observed_at":"2026-07-06T23:18:51.157048Z","submitted_at":"2026-05-07T14:28:17Z","title":"A Regime Theory of Controller Class Selection for LLM Action Decisions","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-08T10:01:45.712230Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2605.06339"},"observation_digest":"sha256:72d2f8b652f28802e02145858abd0d0b7d4f4840b2f50846fc3e8d368c3f3c67","observation_id":"4beb8f38-574d-439c-a419-e5a34e1019de","resolution":{"observed_at":"2026-05-11T20:11:11.820749Z","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":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":"2410.10347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-07-04T20:50:12.595650Z","title":"A unified approach to routing and cascad- ing for llms.arXiv preprint arXiv:2410.10347","venue":null,"work_id":"2ea451d7-a030-479e-88d9-43b0e9d884d5","year":2024},"citing_paper":{"arxiv_id":"2605.07805","last_updated":"2026-05-08T14:39:57Z","snapshot_observed_at":"2026-08-02T05:37:26.707132Z","submitted_at":"2026-05-08T14:39:57Z","title":"Flexible Routing via Uncertainty Decomposition","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-11T03:13:56.150348Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2605.07805"},"observation_digest":"sha256:ab13b6922a48de03efa17ceb58c99513672a32c982a7c2fac1b265085c386c39","observation_id":"ca1f1740-b07e-448d-a572-eb0d50228201","resolution":{"observed_at":"2026-05-11T03:15:54.447796Z","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":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":"2410.10347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-07-04T20:50:12.595650Z","title":"A unified approach to routing and cascad- ing for llms.arXiv preprint arXiv:2410.10347","venue":null,"work_id":"2ea451d7-a030-479e-88d9-43b0e9d884d5","year":2024},"citing_paper":{"arxiv_id":"2605.09121","last_updated":"2026-05-09T19:14:33Z","snapshot_observed_at":"2026-08-08T19:11:23.018391Z","submitted_at":"2026-05-09T19:14:33Z","title":"A Communication-Theoretic Framework for LLM Agents: Cost-Aware Adaptive Reliability","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-05-12T03:03:05.715652Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2605.09121"},"observation_digest":"sha256:be3911a071222cf8257ae6e694f03b4431b0bed744d4c1c14a821572d1290803","observation_id":"88b864dd-a925-4875-baae-f112e1237fe1","resolution":{"observed_at":"2026-05-12T03:06:19.505453Z","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":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":"2410.10347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-07-04T20:50:12.595650Z","title":"A unified approach to routing and cascad- ing for llms.arXiv preprint arXiv:2410.10347","venue":null,"work_id":"2ea451d7-a030-479e-88d9-43b0e9d884d5","year":2024},"citing_paper":{"arxiv_id":"2605.11301","last_updated":"2026-05-11T22:42:12Z","snapshot_observed_at":"2026-07-06T23:23:11.928199Z","submitted_at":"2026-05-11T22:42:12Z","title":"LatentRouter: Can We Choose the Right Multimodal Model Before Seeing Its Answer?","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-13T01:42:54.802658Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2605.11301"},"observation_digest":"sha256:288d00bfb6cc34e967c23ae1cf9c32e11331f538dc08bb941ec8695f2c56486e","observation_id":"455584a7-de0c-4fa9-86c2-de84fe374264","resolution":{"observed_at":"2026-05-13T01:47:04.299912Z","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":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":"2410.10347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-07-04T20:50:12.595650Z","title":"A unified approach to routing and cascad- ing for llms.arXiv preprint arXiv:2410.10347","venue":null,"work_id":"2ea451d7-a030-479e-88d9-43b0e9d884d5","year":2024},"citing_paper":{"arxiv_id":"2606.20713","last_updated":"2026-06-16T12:55:22Z","snapshot_observed_at":"2026-08-08T11:19:56.869341Z","submitted_at":"2026-06-16T12:55:22Z","title":"FairTutor: Equity-Aware Pedagogical LLM Routing for Budget-Constrained AI Tutoring","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T01:30:31.852194Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2606.20713"},"observation_digest":"sha256:546d6331c21902dedd9c1f98ecfcf906001348bdfd03ad214ed0e9d81e8319e8","observation_id":"5be70584-5b5a-44c4-b574-9e49fc99d014","resolution":{"observed_at":"2026-07-03T20:18:56.311800Z","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":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":"2410.10347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-07-04T20:50:12.595650Z","title":"A unified approach to routing and cascad- ing for llms.arXiv preprint arXiv:2410.10347","venue":null,"work_id":"2ea451d7-a030-479e-88d9-43b0e9d884d5","year":2024},"citing_paper":{"arxiv_id":"2606.25871","last_updated":"2026-06-24T14:20:30Z","snapshot_observed_at":"2026-08-08T19:27:38.105431Z","submitted_at":"2026-06-24T14:20:30Z","title":"AutoRelAnnotator: Calibrated Model Cascades for Cost-Efficient Relevance Evaluation in Sponsored Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-25T19:26:46.600337Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2606.25871"},"observation_digest":"sha256:cbe3363f73b573ee4db4c068ccd7de7c5388f7cae72d93808e5d87ef2896b369","observation_id":"b8abca49-d130-4554-b973-56ac168a41de","resolution":{"observed_at":"2026-07-04T20:50:12.597350Z","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":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":"2410.10347","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-07-04T20:50:12.595650Z","title":"A unified approach to routing and cascad- ing for llms.arXiv preprint arXiv:2410.10347","venue":null,"work_id":"2ea451d7-a030-479e-88d9-43b0e9d884d5","year":2024},"citing_paper":{"arxiv_id":"2606.27288","last_updated":"2026-06-25T17:06:06Z","snapshot_observed_at":"2026-08-06T18:40:51.405864Z","submitted_at":"2026-06-25T17:06:06Z","title":"When Does Combining Language Models Help? A Co-Failure Ceiling on Routing, Voting, and Mixture-of-Agents Across 67 Frontier Models","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-26T04:20:02.722108Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2606.27288"},"observation_digest":"sha256:834849da4bfc29120b28f176e1cc209974503edef792f2ac730e1a7de3e4cfdd","observation_id":"a0e6b167-2495-4d6e-b59d-072321e1e509","resolution":{"observed_at":"2026-07-04T14:19:53.608705Z","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":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-07-12T02:29:58.886380Z","title":"A unified approach to routing and cascading for LLMs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.03436","last_updated":"2026-07-07T05:35:41Z","snapshot_observed_at":"2026-08-08T02:51:48.231899Z","submitted_at":"2026-07-03T15:49:40Z","title":"How Much of the Routing Gap Is Real? Decomposing the Router-to-Oracle Gap into Reproducible Specialist Advantage and Single-Draw Label Noise","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-12T02:29:58.886380Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2607.03436"},"observation_digest":"sha256:e43cbaa5cfc77053075e222fee7360d7d298756c63db88ed3a12e54ee6a9182f","observation_id":"afe3de62-94d2-4188-97d6-7eb91f4155f7","resolution":{"observed_at":"2026-07-12T02:29:58.886380Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-02T02:42:01.941369Z","title":"Dekoninck, M","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.14277","last_updated":"2026-07-15T18:36:54Z","snapshot_observed_at":"2026-08-07T07:50:01.322857Z","submitted_at":"2026-07-15T18:36:54Z","title":"Multi-Head Latent Control: A Unified Interface for LLM Agent Decision Making","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T02:42:01.941369Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2607.14277"},"observation_digest":"sha256:f3bfda18abd6da711cb5ed910c259b0b67070e41e40ca6a92221c7f7e4ac911e","observation_id":"ec69dc22-646e-4174-953c-6065bab5cf2b","resolution":{"observed_at":"2026-08-02T02:42:01.941369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-01T23:14:54.415492Z","title":"25 Chenchen Gu, Xiang Lisa Li, Rohith Kuditipudi, Percy Liang, and Tatsunori Hashimoto","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.15516","last_updated":"2026-07-17T00:03:47Z","snapshot_observed_at":"2026-08-09T04:50:07.964882Z","submitted_at":"2026-07-17T00:03:47Z","title":"Cache-Aware Prompt Compression:A Two-Tier Cost Model for LLM API Caching","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T23:14:54.415492Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2607.15516"},"observation_digest":"sha256:10f000f4cba21fbac83f5d3ac12be7848cf75ea674a5ff60c252ce058997b4c0","observation_id":"19eeaa77-46ec-4283-8dda-3a9df4e977ba","resolution":{"observed_at":"2026-08-01T23:14:54.415492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-02T08:35:36.349471Z","title":"arXiv preprint arXiv:2410.10347 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.24801","last_updated":"2026-07-06T09:21:18Z","snapshot_observed_at":"2026-08-09T16:09:16.892654Z","submitted_at":"2026-07-06T09:21:18Z","title":"Influence of Prompt Engineering on Small Language Models for Guarded Query Routing","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T08:35:36.349471Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2607.24801"},"observation_digest":"sha256:951d802e0209c3493242ec222cd531a36aa327bf5b331c05365614adb195073f","observation_id":"6b7a0da2-e501-4d7c-b20f-59622395cda8","resolution":{"observed_at":"2026-08-02T08:35:36.349471Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.10347","snapshot_observed_at":"2026-08-04T07:49:39.961320Z","title":"arXiv preprint arXiv:2410.10347 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.02415","last_updated":"2026-08-03T15:53:49Z","snapshot_observed_at":"2026-08-08T15:56:39.139618Z","submitted_at":"2026-08-03T15:53:49Z","title":"Training-Free versus Training-Based Intent Classification in LLMs: Accuracy, Robustness, and Failure Modes","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-04T07:49:39.961320Z"},"links":{"cited_paper":"/paper/2410.10347","citing_paper":"/paper/2608.02415"},"observation_digest":"sha256:d79bc5fea1e42373b48b8d03a43682e2fb9be56fb07fab4d250105e4a38c6f9c","observation_id":"05af7e6c-6d0e-4d3d-b559-7f94ec36fb52","resolution":{"observed_at":"2026-08-04T07:49:39.961320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2410.10347/citation-record","integrity":"/paper/2410.10347/integrity","json":"/paper/2410.10347/citation-record.json","paper":"/paper/2410.10347"},"outbound":[],"paper":{"arxiv_id":"2410.10347","last_updated":"2025-05-22T12:34:14Z","latest_version":3,"primary_category":"cs.CL","snapshot_observed_at":"2026-07-06T19:32:56.002390Z","submitted_at":"2024-10-14T10:00:49Z","title":"A Unified Approach to Routing and Cascading for LLMs"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 18 inbound Pith citation observations for arXiv:2410.10347."}