{"as_of":"2026-08-19T03:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92d8b57777d3c859d212014390d71356d74dd6ede1450f627d8df3b19826e8bd","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:40:24.609293Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T14:13:30.240148Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","snapshot_observed_at":"2026-08-16T13:49:57.255172Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15130","snapshot_observed_at":"2026-08-10T20:40:24.609293Z","title":"arXiv preprint arXiv:2405.15130","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.07793","last_updated":"2025-01-14T02:27:06Z","snapshot_observed_at":"2026-08-18T12:08:03.825959Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.609293Z"},"links":{"cited_paper":"/paper/2405.15130","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:2a7e816f502fbed0d9c8376424f231212e1039c383c5aa14e8157164aa7f8086","observation_id":"172152f7-197c-40ad-940c-c6b6110ecd22","resolution":{"observed_at":"2026-08-10T20:40:24.609293Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","snapshot_observed_at":"2026-08-16T13:49:57.255172Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15130","snapshot_observed_at":"2026-08-07T19:40:07.526867Z","title":"(2024).OptLLM: Optimal Assignment of Queries to Large Language Models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.10051","last_updated":"2025-02-17T15:30:22Z","snapshot_observed_at":"2026-08-08T15:22:06.356585Z","submitted_at":"2025-02-14T10:00:20Z","title":"ORI: O Routing Intelligence","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T19:40:07.526867Z"},"links":{"cited_paper":"/paper/2405.15130","citing_paper":"/paper/2502.10051"},"observation_digest":"sha256:021866269aaaf0d75ab3bdefb4ea3bc356fadbb0a7a41b0a5f1edd09cca14545","observation_id":"7d929815-5c15-4dd3-ba47-416a6795dd12","resolution":{"observed_at":"2026-08-07T19:40:07.526867Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","snapshot_observed_at":"2026-08-16T13:49:57.255172Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15130","snapshot_observed_at":"2026-08-08T18:11:31.722170Z","title":"Bone, 190:117326","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.18482","last_updated":"2025-02-09T02:26:15Z","snapshot_observed_at":"2026-08-18T12:33:10.662436Z","submitted_at":"2025-02-09T02:26:15Z","title":"MixLLM: Dynamic Routing in Mixed Large Language Models","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-08T18:11:31.722170Z"},"links":{"cited_paper":"/paper/2405.15130","citing_paper":"/paper/2502.18482"},"observation_digest":"sha256:f9bc34eb9a2d48e5dd594a7e45f94ed07817d71628c0bdea88477dd6a4c56c28","observation_id":"f11c25a7-5954-4fb7-be69-bc7025aa6fbd","resolution":{"observed_at":"2026-08-08T18:11:31.722170Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","snapshot_observed_at":"2026-08-16T13:49:57.255172Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15130","snapshot_observed_at":"2026-08-07T12:00:11.551666Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.01048","last_updated":"2025-06-21T03:39:58Z","snapshot_observed_at":"2026-08-14T06:42:06.024205Z","submitted_at":"2025-06-01T15:14:58Z","title":"IRT-Router: Effective and Interpretable Multi-LLM Routing via Item Response Theory","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T12:00:11.551666Z"},"links":{"cited_paper":"/paper/2405.15130","citing_paper":"/paper/2506.01048"},"observation_digest":"sha256:451c7220f9842696b7c878012fa06f14016a5a97517b90af49a4eaa3adb077c4","observation_id":"b7cf453a-8332-446e-a685-7435de5c41db","resolution":{"observed_at":"2026-08-07T12:00:11.551666Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","snapshot_observed_at":"2026-08-16T13:49:57.255172Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.15130","snapshot_observed_at":"2026-08-07T05:56:56.940328Z","title":"Optllm: Optimal assignment of queries to large language models,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.06579","last_updated":"2025-06-06T23:13:08Z","snapshot_observed_at":"2026-08-13T00:55:48.528355Z","submitted_at":"2025-06-06T23:13:08Z","title":"Towards Efficient Multi-LLM Inference: Characterization and Analysis of LLM Routing and Hierarchical Techniques","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T05:56:56.940328Z"},"links":{"cited_paper":"/paper/2405.15130","citing_paper":"/paper/2506.06579"},"observation_digest":"sha256:4d7d9f94558db40648f89efe043ab181a52f93000bc37d74e9e33be28e1d0152","observation_id":"df27739d-3704-40bb-8686-deff835a0c54","resolution":{"observed_at":"2026-08-07T05:56:56.940328Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","snapshot_observed_at":"2026-08-16T13:49:57.255172Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models","version":1},"cited_work":{"arxiv_id":"2405.15130","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.15130","snapshot_observed_at":"2026-06-29T14:13:30.240148Z","title":"Optllm: Optimal assignment of queries to large language models","venue":null,"work_id":"22cb0c59-d46e-43b4-a13c-8e7713b66019","year":2024},"citing_paper":{"arxiv_id":"2602.07303","last_updated":"2026-04-17T15:29:54Z","snapshot_observed_at":"2026-08-14T21:05:38.732634Z","submitted_at":"2026-02-07T01:30:19Z","title":"KRONE: Scalable LLM-Augmented Log Anomaly Detection via Hierarchical Abstraction","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-05-16T06:59:23.030671Z"},"links":{"cited_paper":"/paper/2405.15130","citing_paper":"/paper/2602.07303"},"observation_digest":"sha256:0d53e5f2053a57b87a1509aafb5049433ad315a6ab3bab8a6cc3c3097c6fdfa0","observation_id":"8f89dd84-8a1e-4e30-8103-53099dd8b63d","resolution":{"observed_at":"2026-05-16T07:00:42.952848Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","snapshot_observed_at":"2026-08-16T13:49:57.255172Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models","version":1},"cited_work":{"arxiv_id":"2405.15130","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.15130","snapshot_observed_at":"2026-06-29T14:13:30.240148Z","title":"Optllm: Optimal assignment of queries to large language models","venue":null,"work_id":"22cb0c59-d46e-43b4-a13c-8e7713b66019","year":2024},"citing_paper":{"arxiv_id":"2606.07587","last_updated":"2026-05-27T19:29:01Z","snapshot_observed_at":"2026-08-12T13:24:01.057284Z","submitted_at":"2026-05-27T19:29:01Z","title":"The Routing Plateau: Understanding and Breaking the Accuracy Limits of LLM Routers","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-06-29T14:07:26.366172Z"},"links":{"cited_paper":"/paper/2405.15130","citing_paper":"/paper/2606.07587"},"observation_digest":"sha256:01ddfb01e5fc927ac1078e38a270ee7decaa8a0796e58f89c50788dc90eacece","observation_id":"972b2cba-4e82-4c2f-baec-a25f6a0eee4a","resolution":{"observed_at":"2026-06-29T14:13:30.241493Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2405.15130/citation-record","integrity":"/paper/2405.15130/integrity","json":"/paper/2405.15130/citation-record.json","paper":"/paper/2405.15130"},"outbound":[],"paper":{"arxiv_id":"2405.15130","last_updated":"2024-05-24T01:05:37Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-16T13:49:57.255172Z","submitted_at":"2024-05-24T01:05:37Z","title":"OptLLM: Optimal Assignment of Queries to Large Language Models"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2405.15130."}