{"as_of":"2026-08-04T11:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d9f9094267da0b9779a34541bf14f27aa7b63359b18db3c28f22f198432d0a40","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":39,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":39,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":39,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:16:17.237087Z","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-10T06:15:00.866473Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2410.15761","last_updated":"2026-06-03T09:17:37Z","snapshot_observed_at":"2026-08-01T14:18:40.066269Z","submitted_at":"2024-10-21T08:21:00Z","title":"Optimal Query Allocation in Extractive QA with LLMs: A Learning-to-Defer Framework with Theoretical Guarantees","version":4},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-23T18:49:39.718108Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2410.15761"},"observation_digest":"sha256:99c359269a1812d3b2fb7a080a9a309ca167df81a9ba41c63cb2704ccfc7b443","observation_id":"6fe7d8a4-dcff-4e04-9d3b-c9b7afcb8f1e","resolution":{"observed_at":"2026-05-23T18:53:21.456777Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"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":11,"source":"pdf_text","source_observed_at":"2026-05-22T15:13:28.927880Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2505.12601"},"observation_digest":"sha256:061d547e1537f4cac4514c969de5febd1afe8cbc714badf3f388f49bd4757883","observation_id":"366a8899-7733-4dba-b62c-f194f34143e2","resolution":{"observed_at":"2026-05-22T15:14:57.444574Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2509.24814","last_updated":"2026-05-07T06:47:05Z","snapshot_observed_at":"2026-07-30T12:36:06.124222Z","submitted_at":"2025-09-29T14:02:27Z","title":"A Greedy PDE Router for Blending Neural Operators and Classical Methods","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-18T12:32:13.577474Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2509.24814"},"observation_digest":"sha256:31d3ca96a06621f931808a629e5ceabffb566ea5bb5d485f82ac2140aef6c16b","observation_id":"ad557b72-5018-4611-9602-92a160538a6e","resolution":{"observed_at":"2026-05-18T12:32:36.186197Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","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-04T00:16:17.237087Z","title":"V.; and Awadallah, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02200","last_updated":"2026-07-06T06:58:54Z","snapshot_observed_at":"2026-08-04T00:16:15.629576Z","submitted_at":"2025-11-04T02:41:14Z","title":"Optimal-Agent-Selection: State-Aware Routing Framework for Efficient Multi-Agent Collaboration","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T00:16:17.237087Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2511.02200"},"observation_digest":"sha256:207302a02e84a7e9ecb9cd87ba6aac628562245ed628126a5a42f1c3ce84e2ad","observation_id":"44a14727-bea3-4317-881d-e25744decb6b","resolution":{"observed_at":"2026-08-04T00:16:17.237087Z","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-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2601.05110","last_updated":"2026-04-28T12:22:24Z","snapshot_observed_at":"2026-07-06T22:41:10.836235Z","submitted_at":"2026-01-08T16:58:07Z","title":"GlimpRouter: Efficient Collaborative Inference by Glimpsing One Token of Thoughts","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-16T15:53:07.496412Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2601.05110"},"observation_digest":"sha256:b1971a5095a3ee8dff74c764d649f3c4df2ba95d0cc5c1c0ee1ca40f24aea68e","observation_id":"7e7a120b-3b85-4949-ad5b-e459ff4360e2","resolution":{"observed_at":"2026-05-16T15:58:04.079256Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"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":109,"source":"pdf_text","source_observed_at":"2026-05-15T06:40:27.945478Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2603.21354"},"observation_digest":"sha256:69fc8c22e33ca283a9dd3c9c41d31751a8167419cadee36beb33b2f863b02d7d","observation_id":"7e868d7e-b58e-4fd7-b42f-1972f7ed8be8","resolution":{"observed_at":"2026-05-15T06:45:12.103211Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2604.07494","last_updated":"2026-04-08T18:34:44Z","snapshot_observed_at":"2026-07-06T22:55:41.978450Z","submitted_at":"2026-04-08T18:34:44Z","title":"Triage: Routing Software Engineering Tasks to Cost-Effective LLM Tiers via Code Quality Signals","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-10T17:15:39.613112Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2604.07494"},"observation_digest":"sha256:aaaa5d4828e54427116178886e5a4f29543354b1dc4d2168c903724ef9a7fbcc","observation_id":"0a38c288-737d-49b7-be35-e96195d62836","resolution":{"observed_at":"2026-05-11T07:15:59.510991Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2604.10907","last_updated":"2026-06-22T01:50:05Z","snapshot_observed_at":"2026-07-12T22:15:56.872005Z","submitted_at":"2026-04-13T02:13:13Z","title":"RouterWise: Joint Resource Allocation and Routing for Latency-Aware Multi-Model LLM Serving","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T16:36:25.868623Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2604.10907"},"observation_digest":"sha256:d07ebb6bbfcb0777f80a493d8b7084767508284b64ec4f32267191a23d063a04","observation_id":"640d6abd-6be1-4c70-918b-e97be19d732f","resolution":{"observed_at":"2026-05-10T21:25:52.318641Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2604.14853","last_updated":"2026-04-16T10:39:22Z","snapshot_observed_at":"2026-07-06T23:02:31.717911Z","submitted_at":"2026-04-16T10:39:22Z","title":"Adaptive Test-Time Compute Allocation for Reasoning LLMs via Constrained Policy Optimization","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-10T11:57:44.680423Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2604.14853"},"observation_digest":"sha256:f8104c76479e98dd98273401c3127b71ac463b87079c176aa03c4541b9c82ee7","observation_id":"f85d4c6c-da72-4428-bedd-6c8f196714c8","resolution":{"observed_at":"2026-05-10T12:00:22.103907Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2604.15728","last_updated":"2026-04-17T06:02:27Z","snapshot_observed_at":"2026-07-06T23:03:12.000381Z","submitted_at":"2026-04-17T06:02:27Z","title":"Privacy-Preserving LLMs Routing","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-10T08:32:43.015370Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2604.15728"},"observation_digest":"sha256:252c9a553d27eb6e65a741abf09727b900c0de076b24bc20013ac3912d0405d9","observation_id":"215646a6-d464-4d45-bcea-891b2adc732d","resolution":{"observed_at":"2026-05-10T08:32:51.615035Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2604.17950","last_updated":"2026-04-20T08:30:28Z","snapshot_observed_at":"2026-08-02T22:39:47.888438Z","submitted_at":"2026-04-20T08:30:28Z","title":"CADMAS-CTX: Contextual Capability Calibration for Multi-Agent Delegation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-10T05:31:27.700576Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2604.17950"},"observation_digest":"sha256:663df78b18a14084a37b079d020d6ba7c6c4c3af3d064181c4ce6070a8c2f7e1","observation_id":"f9c98f97-997b-4b6e-9584-7a9fdf3c970d","resolution":{"observed_at":"2026-05-10T05:36:02.103883Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2605.00334","last_updated":"2026-05-01T01:25:56Z","snapshot_observed_at":"2026-07-06T23:13:47.082550Z","submitted_at":"2026-05-01T01:25:56Z","title":"AgentFloor: How Far Up the tool use Ladder Can Small Open-Weight Models Go?","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-09T20:09:11.566825Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.00334"},"observation_digest":"sha256:039de952b600c89db50b85b94f200fcd56edf1848792fc8e83b753b5f548a59a","observation_id":"67bab197-44c1-45c8-96d4-b204ed01084b","resolution":{"observed_at":"2026-05-11T15:21:10.580723Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2605.01111","last_updated":"2026-05-01T21:31:59Z","snapshot_observed_at":"2026-07-06T23:14:24.758147Z","submitted_at":"2026-05-01T21:31:59Z","title":"When Less is Enough: Efficient Inference via Collaborative Reasoning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-09T19:27:04.267404Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.01111"},"observation_digest":"sha256:92e427ece23e0001ca1d703f23c289a0ae52e0403147db32efa2cc0925c1cc09","observation_id":"d695ccf2-cbaa-443f-a6e4-4ed6a6617e06","resolution":{"observed_at":"2026-05-11T15:41:42.435295Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","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":20,"source":"arxiv_source","source_observed_at":"2026-05-08T10:01:45.712230Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.06339"},"observation_digest":"sha256:30ab68999f2130ef042a844d45ef0fe46c6d2d137c6369da85208f18c2aeea15","observation_id":"23200814-c51d-4eaf-8b8b-43cd74594acc","resolution":{"observed_at":"2026-05-11T20:11:11.881896Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2605.08686","last_updated":"2026-05-09T04:51:42Z","snapshot_observed_at":"2026-07-06T23:20:52.521341Z","submitted_at":"2026-05-09T04:51:42Z","title":"Iterative Critique-and-Routing Controller for Multi-Agent Systems with Heterogeneous LLMs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-12T01:10:03.459912Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.08686"},"observation_digest":"sha256:ac6015d7bb5fc2642cfa858fcce975d2f5536427b94f298de48fcaf2ee2e030b","observation_id":"13de6052-996d-4b6d-afcb-5a5a0906fe41","resolution":{"observed_at":"2026-05-12T08:26:24.443387Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","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":11,"source":"pdf_text","source_observed_at":"2026-05-13T01:42:54.802658Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.11301"},"observation_digest":"sha256:9d1f45d415d268eb9458284f31ee9982babfb5f15f202fbc12d0f9a93e562ab1","observation_id":"34a1482e-0d75-4068-94ac-7316c4a03680","resolution":{"observed_at":"2026-05-13T01:47:04.430923Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2605.11317","last_updated":"2026-05-11T23:07:33Z","snapshot_observed_at":"2026-07-06T23:23:11.928199Z","submitted_at":"2026-05-11T23:07:33Z","title":"SOMA: Efficient Multi-turn LLM Serving via Small Language Model","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-13T01:37:27.361504Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.11317"},"observation_digest":"sha256:9221fd0fc7e6dc11329133c0708e307264f0bb75e0737f4803d9d262c25991c3","observation_id":"0625b803-2811-4448-918e-4e50b86d9a65","resolution":{"observed_at":"2026-05-13T01:42:04.202613Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2605.16604","last_updated":"2026-05-15T20:10:24Z","snapshot_observed_at":"2026-07-06T23:27:43.762904Z","submitted_at":"2026-05-15T20:10:24Z","title":"R2V Agent: Teaching SLMs When to Ask for Help","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-20T20:26:29.804427Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.16604"},"observation_digest":"sha256:08d986a931b1ca8bb9580a003e33702ea93acddc0c3358955a75b8d6fe6161fd","observation_id":"e84027dd-5522-42fb-b1ca-e88c90a796cd","resolution":{"observed_at":"2026-05-20T20:28:59.795014Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"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":3,"source":"pdf_text","source_observed_at":"2026-05-20T15:13:27.898371Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.17106"},"observation_digest":"sha256:27c121687ae360abf954fe9e2281796e14171a0b69160ca72db3ec1837bcee6e","observation_id":"ece29f62-8da1-4c0c-8045-1ae8155bbe94","resolution":{"observed_at":"2026-05-20T15:13:31.963292Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2605.18796","last_updated":"2026-05-11T07:06:57Z","snapshot_observed_at":"2026-07-06T23:29:38.069295Z","submitted_at":"2026-05-11T07:06:57Z","title":"UCCI: Calibrated Uncertainty for Cost-Optimal LLM Cascade Routing","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-05-20T23:23:45.561978Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.18796"},"observation_digest":"sha256:9030425fc6083e96e246afe7a06a79ca20b3bfa7ef8839289e9147380402ee34","observation_id":"f3cf284a-ea45-46f2-a226-f37bfd2022c1","resolution":{"observed_at":"2026-05-20T23:23:50.775746Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2605.19099","last_updated":"2026-05-18T20:37:14Z","snapshot_observed_at":"2026-07-31T05:54:44.970755Z","submitted_at":"2026-05-18T20:37:14Z","title":"DecisionBench: A Benchmark for Emergent Delegation in Long-Horizon Agentic Workflows","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T10:16:38.920528Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.19099"},"observation_digest":"sha256:9002dcbde42a3b975d1befd4e37a7b3bdf530aca19b28b96408324eac2b12e69","observation_id":"539a785e-176b-415a-8222-bf385bf10222","resolution":{"observed_at":"2026-05-20T10:18:11.676742Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2605.30693","last_updated":"2026-05-29T00:36:48Z","snapshot_observed_at":"2026-08-02T21:44:58.322249Z","submitted_at":"2026-05-29T00:36:48Z","title":"Triaging Threats to Specialized Guardrails","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-06-28T22:27:44.703466Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2605.30693"},"observation_digest":"sha256:579bcce86330869116dbda5efdac6d21ec1c377392e45f77c4e034e4462eae4e","observation_id":"cd027529-07cf-4176-ad26-7c88dcfe1cd4","resolution":{"observed_at":"2026-06-28T22:32:44.295622Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2606.03800","last_updated":"2026-07-07T21:08:01Z","snapshot_observed_at":"2026-08-01T03:27:17.690944Z","submitted_at":"2026-06-02T15:48:28Z","title":"Trading Human Curation for Synthetic Augmentation in RLVR","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-28T11:10:06.685591Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.03800"},"observation_digest":"sha256:52a9db65d0cb839925029c7b7020addcc88755cb26538c7996ee09f60e6e55f7","observation_id":"ce4b2b2f-585a-4198-abbe-6d24bf7ea9b6","resolution":{"observed_at":"2026-07-02T02:16:26.230031Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","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-07-12T15:15:09.675778Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.03800","last_updated":"2026-07-07T21:08:01Z","snapshot_observed_at":"2026-08-01T03:27:17.690944Z","submitted_at":"2026-06-02T15:48:28Z","title":"Trading Human Curation for Synthetic Augmentation in RLVR","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-12T15:15:09.675778Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.03800"},"observation_digest":"sha256:3f95c7d747909d93bb9ebf1c23b954b03168c5dadcc8278df10e060e367c1589","observation_id":"6236a340-eb67-4ff2-934c-52bd733986ff","resolution":{"observed_at":"2026-07-12T15:15:09.675778Z","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-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2606.04378","last_updated":"2026-06-03T02:51:56Z","snapshot_observed_at":"2026-08-02T09:31:55.745591Z","submitted_at":"2026-06-03T02:51:56Z","title":"DLLG: Dynamic Logit-Level Gating of LLM Experts","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-06-28T06:50:32.988192Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.04378"},"observation_digest":"sha256:0429e5289d7ccb2f3b861ff0491839ae76767669e5024f661052405386249dbc","observation_id":"9827fbc2-9381-49aa-b420-8dcac91c7e5c","resolution":{"observed_at":"2026-07-02T07:36:45.107785Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"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":15,"source":"pdf_text","source_observed_at":"2026-06-29T14:07:26.366172Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.07587"},"observation_digest":"sha256:98afc179a1941283257fa9063cdc57b16135f9d336dc3f6ef2404d97b89caac9","observation_id":"5a6e44bd-bbdd-4fe0-8f16-a3a86ab0e9b9","resolution":{"observed_at":"2026-06-29T14:13:30.262342Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2606.20295","last_updated":"2026-07-24T07:54:17Z","snapshot_observed_at":"2026-08-02T10:48:55.986116Z","submitted_at":"2026-06-18T14:33:09Z","title":"Token-Operations-Oriented Inference Optimization Techniques for Large Models","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-26T16:15:22.543601Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.20295"},"observation_digest":"sha256:62868f43ee218721c8640a8226f87eb0af4753245c6200ab4f7f30b7642e2ca9","observation_id":"bcf1baf2-c804-4f49-ae7b-3a4ed5bb9ae4","resolution":{"observed_at":"2026-07-04T05:09:36.573258Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","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-02T10:48:59.226127Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.20295","last_updated":"2026-07-24T07:54:17Z","snapshot_observed_at":"2026-08-02T10:48:55.986116Z","submitted_at":"2026-06-18T14:33:09Z","title":"Token-Operations-Oriented Inference Optimization Techniques for Large Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T10:48:59.226127Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.20295"},"observation_digest":"sha256:3ebb005e46eaa88fdfe16d14865b2f9d183137c33eb219767fecb2b5b363718d","observation_id":"3b1f1821-007f-48bc-98d3-e62ba70c0699","resolution":{"observed_at":"2026-08-02T10:48:59.226127Z","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-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2606.22902","last_updated":"2026-06-26T11:55:14Z","snapshot_observed_at":"2026-08-02T02:59:08.111195Z","submitted_at":"2026-06-22T06:37:31Z","title":"Agent-as-a-Router: Agentic Model Routing for Coding Tasks","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-26T08:40:26.716014Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.22902"},"observation_digest":"sha256:50794c601bd948d5b65c2b2e69da347a064376319ac1474f7d0f35b0f42ebce7","observation_id":"9a08753f-9fbc-403d-92ee-fa7e0a6dfbba","resolution":{"observed_at":"2026-07-04T10:39:45.010214Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2606.22902","last_updated":"2026-06-26T11:55:14Z","snapshot_observed_at":"2026-08-02T02:59:08.111195Z","submitted_at":"2026-06-22T06:37:31Z","title":"Agent-as-a-Router: Agentic Model Routing for Coding Tasks","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T05:02:40.616741Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.22902"},"observation_digest":"sha256:e2399616227cbbaf106b36b8811c11683ec44d12ccd0588205f8a341101a6995","observation_id":"d780ba3d-d21c-4904-96ee-b89148a5809c","resolution":{"observed_at":"2026-06-29T18:43:51.271659Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2606.31163","last_updated":"2026-07-01T08:21:43Z","snapshot_observed_at":"2026-08-03T16:56:44.974137Z","submitted_at":"2026-06-30T05:49:50Z","title":"ComplianceGate: Classifier-Gated Multi-Tier LLM Routing for Inference in Regulated Industries","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-01T06:50:19.566682Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.31163"},"observation_digest":"sha256:b2a04ce76058945076b2eab99c6cda7b2d029b3804c4ee27a323d1b726b95793","observation_id":"09f1b869-8e22-44f9-a043-2fcf0c1f6633","resolution":{"observed_at":"2026-07-01T08:55:35.898461Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2606.31163","last_updated":"2026-07-01T08:21:43Z","snapshot_observed_at":"2026-08-03T16:56:44.974137Z","submitted_at":"2026-06-30T05:49:50Z","title":"ComplianceGate: Classifier-Gated Multi-Tier LLM Routing for Inference in Regulated Industries","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-02T20:16:17.328340Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2606.31163"},"observation_digest":"sha256:a7f96d019d2fb9e70dc53e2a2840cc62e9e4065609be68e9fcb9623e8425f16b","observation_id":"1cede858-c685-4ad8-82c0-280dc5aa473f","resolution":{"observed_at":"2026-07-02T20:17:21.080725Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing","version":1},"cited_work":{"arxiv_id":"2404.14618","doi":"10.48550/arxiv.2404.14618","metadata_source":"arxiv_reference","pith_arxiv_id":"2404.14618","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing","venue":null,"work_id":"9dda325d-c570-4795-a95c-95c467dd09b4","year":2024},"citing_paper":{"arxiv_id":"2607.00053","last_updated":"2026-06-30T01:46:26Z","snapshot_observed_at":"2026-07-07T00:05:41.920778Z","submitted_at":"2026-06-30T01:46:26Z","title":"SWE-Router: Routing in Multi-turn Agentic Software Engineering Tasks","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-07-02T18:19:43.146102Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2607.00053"},"observation_digest":"sha256:9c6d709c5ad78b1235391e9ee3bf31becf38fb0e43b4aa606e04e27946860c0a","observation_id":"0f57acb1-dc03-44b9-b456-ca01bfbf72fa","resolution":{"observed_at":"2026-07-02T18:37:16.526121Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","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-07-12T05:56:18.797766Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.02942","last_updated":"2026-07-03T04:28:49Z","snapshot_observed_at":"2026-08-02T20:27:55.760321Z","submitted_at":"2026-07-03T04:28:49Z","title":"A Workflow-Aware Serving Layer for Agentic Applications","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-12T05:56:18.797766Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2607.02942"},"observation_digest":"sha256:93a260d90db1a87aeb4309fb1233f384af458e5f3bcd4e34154b9a91b1214064","observation_id":"d0ee6bea-867a-4ea6-b3cb-36eef49e6fd6","resolution":{"observed_at":"2026-07-12T05:56:18.797766Z","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-07-06T18:04:04.541434Z","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-07-13T05:38:27.357469Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing.arXiv preprint arXiv:2404.14618, 2024a","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08940","last_updated":"2026-07-18T17:05:31Z","snapshot_observed_at":"2026-08-02T07:51:10.193975Z","submitted_at":"2026-07-09T21:09:05Z","title":"TSRouter: Dynamic Modality-Model Selection for Time Series Reasoning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T05:38:27.357469Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2607.08940"},"observation_digest":"sha256:d13f6bfb5ee816a214f58870e0651a7a018ae32aa4b6fc84ccc2963357083cf1","observation_id":"0abf5307-53e6-4f11-9896-255fbb611be2","resolution":{"observed_at":"2026-07-13T05:38:27.357469Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","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-02T07:51:12.437343Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing.arXiv preprint arXiv:2404.14618, 2024a","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.08940","last_updated":"2026-07-18T17:05:31Z","snapshot_observed_at":"2026-08-02T07:51:10.193975Z","submitted_at":"2026-07-09T21:09:05Z","title":"TSRouter: Dynamic Modality-Model Selection for Time Series Reasoning","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T07:51:12.437343Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2607.08940"},"observation_digest":"sha256:2c0874ddf82cdb660f5ee89f8a0fc8b2260531bc4579f93e1bd6ab6a600892db","observation_id":"d8f93125-a4b0-41b5-afd2-83c97395bbed","resolution":{"observed_at":"2026-08-02T07:51:12.437343Z","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-07-06T18:04:04.541434Z","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-01T13:10:57.574431Z","title":"Hybrid LLM: Cost-efficient and quality- aware query routing.arXiv preprint arXiv:2404.14618, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.19215","last_updated":"2026-07-21T15:47:35Z","snapshot_observed_at":"2026-08-03T09:23:50.400772Z","submitted_at":"2026-07-21T15:47:35Z","title":"HACO: Hedged Agent Computing for Reliable LLM Systems","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T13:10:57.574431Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2607.19215"},"observation_digest":"sha256:eb8db8bc455ce40a756c5159c449586b7d09879072d29110d153483111885748","observation_id":"6c35e317-8fe3-411e-a74a-e67c2c7d133e","resolution":{"observed_at":"2026-08-01T13:10:57.574431Z","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-07-06T18:04:04.541434Z","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-01T10:14:13.051550Z","title":"Elias Frantar, Saleh Ashkboos, Torsten Hoefler, and Dan Alistarh","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-03T18:12:07.254553Z","submitted_at":"2026-07-22T16:14:26Z","title":"PyroDash: Cost-Efficient Token-Level Small-Large Language Model Collaborative Inference","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T10:14:13.051550Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2607.20327"},"observation_digest":"sha256:c9f7c324c7c0de2442914c2cb114fbdc80218b24ad8fa8af837f53e0b46f60bf","observation_id":"c7222c22-3a5e-4dda-9082-13cbf2705f88","resolution":{"observed_at":"2026-08-01T10:14:13.051550Z","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-07-06T18:04:04.541434Z","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-02T12:43:45.819592Z","title":"Hybrid llm: Cost-efficient and quality-aware query routing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.20481","last_updated":"2026-05-30T06:42:55Z","snapshot_observed_at":"2026-08-02T18:59:31.673651Z","submitted_at":"2026-05-30T06:42:55Z","title":"Routing Without Training: Controllable-Ratio LLM Offloading via Reliability Gating","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T12:43:45.819592Z"},"links":{"cited_paper":"/paper/2404.14618","citing_paper":"/paper/2607.20481"},"observation_digest":"sha256:e1f7f719229266250b810a9416d426b8eee6f847af33c846d0937157e10d9dea","observation_id":"72386a27-6641-4b6c-ade4-b975beebfc64","resolution":{"observed_at":"2026-08-02T12:43:45.819592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.14618/citation-record","integrity":"/paper/2404.14618/integrity","json":"/paper/2404.14618/citation-record.json","paper":"/paper/2404.14618"},"outbound":[],"paper":{"arxiv_id":"2404.14618","last_updated":"2024-04-22T23:06:42Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T18:04:04.541434Z","submitted_at":"2024-04-22T23:06:42Z","title":"Hybrid LLM: Cost-Efficient and Quality-Aware Query Routing"},"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-04T06:34:03.388597+00:00","source":"crossref"},{"observed_at":"2026-08-04T06:33:57.428241+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 39 inbound Pith citation observations for arXiv:2404.14618."}