{"as_of":"2026-08-04T10:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4cf1643f63af8b7a37c1a63f048de820120ca341c204662c049375afc769daab","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":8,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":8,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-04T06:34:03.388597+00:00","state":"measured"},{"denominator":8,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T01:47:05.422162Z","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-10T12:15:01.137692Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-07-06T21:48:59.271767Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":"2506.22716","doi":"10.48550/arxiv.2506.22716","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"arXiv preprint arXiv:2506.22716 , year=","venue":null,"work_id":"3b9abf2d-f47b-4a37-aef4-36823462365b","year":2025},"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":8,"source":"pdf_text","source_observed_at":"2026-05-10T16:36:25.868623Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2604.10907"},"observation_digest":"sha256:1ee704e53aa7b04c2f0116bbb3f22bca4116a5cc20a84a153f0ca3140b27f95f","observation_id":"16371b17-ba7f-4162-b281-00204b7e2ab2","resolution":{"observed_at":"2026-05-10T21:25:52.116718Z","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":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-07-06T21:48:59.271767Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":"2506.22716","doi":"10.48550/arxiv.2506.22716","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"arXiv preprint arXiv:2506.22716 , year=","venue":null,"work_id":"3b9abf2d-f47b-4a37-aef4-36823462365b","year":2025},"citing_paper":{"arxiv_id":"2605.07180","last_updated":"2026-05-08T03:18:40Z","snapshot_observed_at":"2026-07-06T23:19:35.885430Z","submitted_at":"2026-05-08T03:18:40Z","title":"Learning Agent Routing From Early Experience","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-05-11T01:15:07.381414Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2605.07180"},"observation_digest":"sha256:958745b8f67b336f4d4a82470a0f7da73190359f250a4ef8c917ee40a085f963","observation_id":"9b338d22-0e31-42f9-a942-f67d0b5cab59","resolution":{"observed_at":"2026-05-11T04:35:57.654049Z","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":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-07-06T21:48:59.271767Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":"2506.22716","doi":"10.48550/arxiv.2506.22716","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"arXiv preprint arXiv:2506.22716 , year=","venue":null,"work_id":"3b9abf2d-f47b-4a37-aef4-36823462365b","year":2025},"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":6,"source":"pdf_text","source_observed_at":"2026-05-11T03:13:56.150348Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2605.07805"},"observation_digest":"sha256:3af794e99778cf04c87110fd49ba753b122d9f44ee49113bda75592f352c5110","observation_id":"1f88acf9-40ba-49f8-b071-524beb463d64","resolution":{"observed_at":"2026-05-11T03:15:54.498162Z","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":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-07-06T21:48:59.271767Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":"2506.22716","doi":"10.48550/arxiv.2506.22716","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"arXiv preprint arXiv:2506.22716 , year=","venue":null,"work_id":"3b9abf2d-f47b-4a37-aef4-36823462365b","year":2025},"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":4,"source":"pdf_text","source_observed_at":"2026-05-12T01:10:03.459912Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2605.08686"},"observation_digest":"sha256:a634fb45d42976f32bbc9376c235376e2169f11ac798fe250c765c97bd0cd070","observation_id":"6c891bea-10e9-4840-bfb5-d0d3a1ea542a","resolution":{"observed_at":"2026-05-12T08:26:24.483387Z","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":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-07-06T21:48:59.271767Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":"2506.22716","doi":"10.48550/arxiv.2506.22716","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"arXiv preprint arXiv:2506.22716 , year=","venue":null,"work_id":"3b9abf2d-f47b-4a37-aef4-36823462365b","year":2025},"citing_paper":{"arxiv_id":"2605.14241","last_updated":"2026-05-28T16:43:00Z","snapshot_observed_at":"2026-08-03T02:26:08.646714Z","submitted_at":"2026-05-14T01:14:13Z","title":"Latency-Quality Routing for Functionally Equivalent Tools in LLM Agents","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-15T02:58:57.083265Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2605.14241"},"observation_digest":"sha256:d40b18f53015fde15aa89289b9d5f6792af959a78943227bdfb7ea6e4e0fbba5","observation_id":"a0fade84-ec4c-454b-bf07-fcefec970714","resolution":{"observed_at":"2026-05-15T02:59:40.605334Z","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":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-07-06T21:48:59.271767Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":"2506.22716","doi":"10.48550/arxiv.2506.22716","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"arXiv preprint arXiv:2506.22716 , year=","venue":null,"work_id":"3b9abf2d-f47b-4a37-aef4-36823462365b","year":2025},"citing_paper":{"arxiv_id":"2605.22873","last_updated":"2026-05-20T03:15:46Z","snapshot_observed_at":"2026-08-01T10:03:51.429507Z","submitted_at":"2026-05-20T03:15:46Z","title":"When Do LLMs Reason? A Dynamical Systems View via Entropy Phase Transitions","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-05-25T06:14:49.430548Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2605.22873"},"observation_digest":"sha256:7571af63859c29c94488ed207920e82be7fa14b9d2445b588ea0a4da41d400f9","observation_id":"d3747aa6-d08d-45c7-baa0-0168dd35a7cc","resolution":{"observed_at":"2026-05-25T06:15:23.488450Z","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":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-07-06T21:48:59.271767Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":"2506.22716","doi":"10.48550/arxiv.2506.22716","metadata_source":"arxiv_reference","pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-07-10T12:15:01.137692Z","title":"arXiv preprint arXiv:2506.22716 , year=","venue":null,"work_id":"3b9abf2d-f47b-4a37-aef4-36823462365b","year":2025},"citing_paper":{"arxiv_id":"2606.29424","last_updated":"2026-06-28T14:39:06Z","snapshot_observed_at":"2026-08-02T07:55:28.979451Z","submitted_at":"2026-06-28T14:39:06Z","title":"EntroRouter: Learning Efficient Model Routing via Entropy Regulation","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-06-30T07:42:35.962864Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2606.29424"},"observation_digest":"sha256:02920185e4a463c6636c6025e09e221b98750753ba90cecd506686dfc1fb40f5","observation_id":"467fc727-cd90-4c62-9efd-16e97a2f5a1a","resolution":{"observed_at":"2026-06-30T07:44:21.615810Z","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":"2506.22716","last_updated":"2025-06-28T01:52:50Z","snapshot_observed_at":"2026-07-06T21:48:59.271767Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.22716","snapshot_observed_at":"2026-08-04T01:47:05.422162Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2608.00030","last_updated":"2026-07-15T11:11:39Z","snapshot_observed_at":"2026-08-04T09:07:29.619071Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:05.422162Z"},"links":{"cited_paper":"/paper/2506.22716","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:c70fe9e30fb93e9d15fd04a22a5b1d11fecb70f5e2ab0207868183cb0eabd788","observation_id":"1b1901da-cf11-4cba-9206-7e4b1dc29e0f","resolution":{"observed_at":"2026-08-04T01:47:05.422162Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.22716/citation-record","integrity":"/paper/2506.22716/integrity","json":"/paper/2506.22716/citation-record.json","paper":"/paper/2506.22716"},"outbound":[],"paper":{"arxiv_id":"2506.22716","last_updated":"2025-06-28T01:52:50Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T21:48:59.271767Z","submitted_at":"2025-06-28T01:52:50Z","title":"BEST-Route: Adaptive LLM Routing with Test-Time Optimal Compute"},"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 8 inbound Pith citation observations for arXiv:2506.22716."}