{"as_of":"2026-08-10T23:22:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4bf2b262c84122452f8bf0ac6a7a618e4eada0104a12144ea03a950ac74c519f","coverage":[{"denominator":16,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":16,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T20:40:24.656530Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T01:47:06.006371Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.07793","last_updated":"2025-01-14T02:27:06Z","snapshot_observed_at":"2026-08-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.07793","snapshot_observed_at":"2026-08-04T01:47:06.006371Z","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-09T01:33:10.902039Z","submitted_at":"2026-07-15T11:11:39Z","title":"SLMs as Multi-Agent Routers: A Progressive SFT and Reinforcement Learning Approach","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T01:47:06.006371Z"},"links":{"cited_paper":"/paper/2501.07793","citing_paper":"/paper/2608.00030"},"observation_digest":"sha256:544da2414c784d190d9514f50a304ddb594e7aae5aedbed593aebdf113cecd07","observation_id":"6369dc63-9656-481d-b9ff-d8bc01428622","resolution":{"observed_at":"2026-08-04T01:47:06.006371Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2501.07793/citation-record","integrity":"/paper/2501.07793/integrity","json":"/paper/2501.07793/citation-record.json","paper":"/paper/2501.07793"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2306.02561","last_updated":"2023-06-30T21:39:54Z","snapshot_observed_at":"2026-08-10T19:14:51.255301Z","submitted_at":"2023-06-05T03:32:26Z","title":"LLM-Blender: Ensembling Large Language Models with Pairwise Ranking and Generative Fusion","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.02561","snapshot_observed_at":"2026-08-10T20:40:24.598741Z","title":"arXiv preprint arXiv:2306.02561","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.598741Z"},"links":{"cited_paper":"/paper/2306.02561","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:eae04bb1f394a8fdf250ac83634fcab08d367d3c0881a83a2ad02ea13d5bbf8f","observation_id":"c428b437-5410-42b5-bdbd-cd65cfca8680","resolution":{"observed_at":"2026-08-10T20:40:24.598741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.03281","last_updated":"2023-08-07T03:52:59Z","snapshot_observed_at":"2026-08-04T23:10:23.964516Z","submitted_at":"2023-08-07T03:52:59Z","title":"Towards General Text Embeddings with Multi-stage Contrastive Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.03281","snapshot_observed_at":"2026-08-10T20:40:24.604160Z","title":"arXiv preprint arXiv:2308.03281","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.604160Z"},"links":{"cited_paper":"/paper/2308.03281","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:ae17281d943c9d94831b45c15d763638e273040b596b0e2d0141f9ae88fb95c1","observation_id":"a06c8dda-35f4-48aa-a2ab-bdd318579d28","resolution":{"observed_at":"2026-08-10T20:40:24.604160Z","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-09T17:54:32.510507Z","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-10T20:33:24.268103Z","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:ceeca740fd915f3dfe53cd1666a434c63fc3165fba4e57a329448f79e956584e","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":"2311.08692","last_updated":"2023-11-15T04:40:43Z","snapshot_observed_at":"2026-07-06T16:47:45.504109Z","submitted_at":"2023-11-15T04:40:43Z","title":"Routing to the Expert: Efficient Reward-guided Ensemble of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.08692","snapshot_observed_at":"2026-08-10T20:40:24.614688Z","title":"arXiv preprint arXiv:2311.08692","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.614688Z"},"links":{"cited_paper":"/paper/2311.08692","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:728e898208c5b7c9bd94bf9f5d7a7944858cd6ed09b5785000f2cae2127d6208","observation_id":"7b5a381e-a7cc-4c01-8216-a741e5be06f6","resolution":{"observed_at":"2026-08-10T20:40:24.614688Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12429","last_updated":"2024-09-30T06:04:05Z","snapshot_observed_at":"2026-08-05T01:14:35.293065Z","submitted_at":"2024-06-18T09:24:09Z","title":"Query Routing for Homogeneous Tools: An Instantiation in the RAG Scenario","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12429","snapshot_observed_at":"2026-08-10T20:40:24.619277Z","title":"arXiv preprint arXiv:2406.12429v3","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.619277Z"},"links":{"cited_paper":"/paper/2406.12429","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:0a8ccd5124428e428d355c5201704afc4d0d714a9254c43902d4d724813e9ff6","observation_id":"acbcdc6e-0669-4628-ad54-9917be890090","resolution":{"observed_at":"2026-08-10T20:40:24.619277Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.08774","last_updated":"2024-03-04T06:01:33Z","snapshot_observed_at":"2026-08-07T07:30:12.213965Z","submitted_at":"2023-03-15T17:15:04Z","title":"GPT-4 Technical Report","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.08774","snapshot_observed_at":"2026-08-10T20:40:24.624118Z","title":"arXiv preprint arXiv:2303.08774","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.624118Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:7213ee5cbbee850796626c6b49d3f5f9797a429667751552b273c7550560cdc2","observation_id":"a205ab19-0650-448a-b0f8-d2760474014f","resolution":{"observed_at":"2026-08-10T20:40:24.624118Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.15789","last_updated":"2023-09-27T17:08:40Z","snapshot_observed_at":"2026-08-06T08:57:12.331150Z","submitted_at":"2023-09-27T17:08:40Z","title":"Large Language Model Routing with Benchmark Datasets","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15789","snapshot_observed_at":"2026-08-10T20:40:24.633361Z","title":"arXiv preprint arXiv:2309.15789","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.633361Z"},"links":{"cited_paper":"/paper/2309.15789","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:fbf3a6e71392f815b39e010321fdd7894cff76e6b72432bff2f9c2efa9dc70f0","observation_id":"e839877a-f8a3-476a-a0dc-d6b5d7c059c1","resolution":{"observed_at":"2026-08-10T20:40:24.633361Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.3215","last_updated":"2014-12-14T20:59:51Z","snapshot_observed_at":"2026-08-02T03:58:50.109606Z","submitted_at":"2014-09-10T19:55:35Z","title":"Sequence to Sequence Learning with Neural Networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.3215","snapshot_observed_at":"2026-08-10T20:40:24.638102Z","title":"ArXiv, abs/1409.3215","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.638102Z"},"links":{"cited_paper":"/paper/1409.3215","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:390b5e82d4d58504f36653b1370d55406ed55ea3f536a2c552e6f5545c4804c6","observation_id":"a6e5ef61-90d9-4bc0-b97b-ea6c5990f004","resolution":{"observed_at":"2026-08-10T20:40:24.638102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.17645","last_updated":"2024-01-31T07:58:54Z","snapshot_observed_at":"2026-07-06T17:22:57.755410Z","submitted_at":"2024-01-31T07:58:54Z","title":"ReSLLM: Large Language Models are Strong Resource Selectors for Federated Search","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.17645","snapshot_observed_at":"2026-08-10T20:40:24.642904Z","title":"arXiv preprint arXiv:2401.17645","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.642904Z"},"links":{"cited_paper":"/paper/2401.17645","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:69d9d040b2738bda93d4aa342d6dcdc5192137c7034fe4bca679a7d0452513a6","observation_id":"ff236ec8-a455-4eee-ab04-2d833e152c6c","resolution":{"observed_at":"2026-08-10T20:40:24.642904Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19248","last_updated":"2024-03-02T04:37:37Z","snapshot_observed_at":"2026-08-10T04:59:01.750584Z","submitted_at":"2024-02-29T15:22:13Z","title":"Let LLMs Take on the Latest Challenges! A Chinese Dynamic Question Answering Benchmark","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19248","snapshot_observed_at":"2026-08-10T20:40:24.647507Z","title":"ArXiv, abs/2402.19248","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.647507Z"},"links":{"cited_paper":"/paper/2402.19248","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:e15cef18e8d57ae5479fe649ad72d8cfe3321cfe6c9325baf5e93b94ded0fe95","observation_id":"789b1871-2765-4793-881e-421e2c0ef0e8","resolution":{"observed_at":"2026-08-10T20:40:24.647507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-10T20:40:24.652215Z","title":"ArXiv, abs/2407.10671","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.652215Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:7bb742d97afa3acd498b0cea10e62e0bdf49427583a28d1d115a767927024eed","observation_id":"f2326b8f-10e3-4f5c-88de-5f10071c1b74","resolution":{"observed_at":"2026-08-10T20:40:24.652215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09675","last_updated":"2020-02-24T18:59:28Z","snapshot_observed_at":"2026-07-29T15:42:51.774083Z","submitted_at":"2019-04-21T23:08:53Z","title":"BERTScore: Evaluating Text Generation with BERT","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1904.09675","snapshot_observed_at":"2026-08-10T20:40:24.656530Z","title":"ArXiv, abs/1904.09675","venue":null,"work_id":null,"year":1904},"citing_paper":{"arxiv_id":"2501.07793","last_updated":"2025-01-14T02:27:06Z","snapshot_observed_at":"2026-08-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.656530Z"},"links":{"cited_paper":"/paper/1904.09675","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:eb9b147673db22818f5ec43d10273db83544c96c12a16973efecec26066682c7","observation_id":"713a01ad-205e-4177-8e68-bc7c08364bb6","resolution":{"observed_at":"2026-08-10T20:40:24.656530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1409.0473","last_updated":"2016-05-19T21:53:22Z","snapshot_observed_at":"2026-07-06T03:53:10.336430Z","submitted_at":"2014-09-01T16:33:02Z","title":"Neural Machine Translation by Jointly Learning to Align and Translate","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.0473","snapshot_observed_at":"2026-08-10T20:40:24.576919Z","title":"CoRR, abs/1409.0473","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.576919Z"},"links":{"cited_paper":"/paper/1409.0473","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:f539c7b3850f9d52f9e19da3dac26a9dd4a42624e43eb59c690bda9b29356081","observation_id":"86868958-4710-4d1c-912f-e16ffe347956","resolution":{"observed_at":"2026-08-10T20:40:24.576919Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1903.02188","last_updated":"2019-05-28T18:51:14Z","snapshot_observed_at":"2026-07-06T07:37:21.405055Z","submitted_at":"2019-03-06T06:09:02Z","title":"Bidirectional Attentive Memory Networks for Question Answering over Knowledge Bases","version":3},"cited_work":{"arxiv_id":"1903.02188","doi":null,"metadata_source":"pith","pith_arxiv_id":"1903.02188","snapshot_observed_at":"2026-08-10T20:40:24.904301Z","title":"Bidirectional Attentive Memory Networks for Question Answering over Knowledge Bases","venue":"cs.CL","work_id":"b103c62b-1658-466b-a2e2-e80beb0fe657","year":2019},"citing_paper":{"arxiv_id":"2501.07793","last_updated":"2025-01-14T02:27:06Z","snapshot_observed_at":"2026-08-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.583076Z"},"links":{"cited_paper":"/paper/1903.02188","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:c89d3e89d79d0533a751458473bde0a3fee0e5a4abb30823d73a1fd53eb52333","observation_id":"fb5bafe5-481a-4f8e-8134-7f9dfe744367","resolution":{"observed_at":"2026-08-10T20:40:24.911349Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-10T20:40:24.593777Z","title":"arXiv preprint arXiv:2312.10997","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.593777Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:60123792d2ed7201c886a02eb458ff5123a057eb553c0f1fd679a7ad901ce623","observation_id":"a81c0f6f-a350-4756-bf74-f2a896858966","resolution":{"observed_at":"2026-08-10T20:40:24.593777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-08-10T16:40:37.411115Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-10T20:40:24.588455Z","title":"arXiv preprint arXiv:2407.21783","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-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-10T20:40:24.588455Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2501.07793"},"observation_digest":"sha256:c6dcf0c20bb394a9f378d7c2ab080b751fbeeaffbb9c452582ec68eebe68feb3","observation_id":"4b168ec6-cdb2-4805-9458-91c8e312c4a6","resolution":{"observed_at":"2026-08-10T20:40:24.588455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.07793","last_updated":"2025-01-14T02:27:06Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-10T20:33:24.268103Z","submitted_at":"2025-01-14T02:27:06Z","title":"Unsupervised Query Routing for Retrieval Augmented Generation"},"reference_resolution":{"displayed":16,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":16},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 16 of 16 outbound references and 1 inbound Pith citation observation for arXiv:2501.07793."}