{"as_of":"2026-08-12T14:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:72fb17e2ef63956669f684d1fa1575df1ee14a243182e09f8ca6cd2ca1fbab41","coverage":[{"denominator":44,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":44,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-13T18:32:24.536273Z","state":"measured"},{"denominator":44,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":44,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"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":[],"links":{"evidence":"/evidence","html":"/paper/2606.02581/citation-record","integrity":"/paper/2606.02581/integrity","json":"/paper/2606.02581/citation-record.json","paper":"/paper/2606.02581"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"Retrieval- augmented generation for knowledge-intensive NLP tasks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:338344387fceb163dcca1c0c6c8681147cd5f27c56df8e5158d4170be28ea95a","observation_id":"001d3413-de8a-4e1b-bde6-5533ae37a2c8","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07-13T18:32:24.536273Z","title":"Retrieval-augmented generation for large language models: A survey,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:c887262ea0fdad7fd2e953afcfede7f86b0ead9d28af649c839815141a3d5f66","observation_id":"89416405-145f-4057-9ad9-875061cd307f","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2007.01282","last_updated":"2021-02-03T09:18:34Z","snapshot_observed_at":"2026-08-03T22:53:08.799163Z","submitted_at":"2020-07-02T17:44:57Z","title":"Leveraging Passage Retrieval with Generative Models for Open Domain Question Answering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.01282","snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"Leveraging passage retrieval with gener- ative models for open domain question answering,","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"cited_paper":"/paper/2007.01282","citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:7b5da0f6a2fff24c971611e0c79bc93d6117ad4a65126c637384e7d0d5054be0","observation_id":"c27cb6f3-4721-4373-b23f-02ef7bcf1486","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","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-07-13T18:32:24.536273Z","title":"GPT-4 technical report,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"cited_paper":"/paper/2303.08774","citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:2c95eab6cbb8ef264168f49c6694acb1ec6e224fcc53989177f38366840bc1c5","observation_id":"d543c342-4a8f-449d-97ba-e6d29ae92003","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"Dense passage retrieval for open-domain question an- swering,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:0fddb4daba24dc982aed6a28b9f6c5ee29d8eb7cf0bb06c3ad1cd73b809dec36","observation_id":"0f0bc801-b29b-4ed8-b812-2ab04194b25e","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"ColBERT: Efficient and effective passage search via contextualized late interaction over BERT,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:90cde4785cb691ea104dfecb13ea481256b55cd805fa567cd3ddcf742252f6cd","observation_id":"d4d21ace-e727-4b55-892b-47f9eed570f8","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"REALM: Retrieval-augmented language model pre-training,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:3e67ae4f0f9c073cf963481c2cb839a8ff32115655b9d24a554bed88bbb30597","observation_id":"f7080468-f764-4054-9d4b-e77a04c86b99","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"The probabilistic relevance framework: BM25 and beyond,","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:6a14be248b8a788132aecff33719e9c7770d4a12db93034b839c3c98054389f2","observation_id":"c9a97625-eb35-4736-b80f-977c0dcc061c","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"Billion-scale similarity search with GPUs,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:707a48fb4b65f9967b5562e2d1f6abd35640c8aaf92a7b22af0e5dc19761bcb1","observation_id":"940de438-4fee-4070-9110-4e3ed139376b","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"A contextual-bandit approach to personalized news article recommendation,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:2dfcfabb54f87673f939ccce17fbe2a890fac01b88969a4cca94163caea12dca","observation_id":"078ed004-9ae3-4378-ac09-8d6a6847635f","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"Lattimore and C","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:aecd0ea1e913d53500bac8318c4cdfc7904a5f58bf68508c384c69504a9d8f4d","observation_id":"66e11ed1-9560-4fae-b529-65a0c6998bd8","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:f6859283c271441cc7553271441539c70b32ea1c172dd031c59534bddbf47fc7","observation_id":"1a5b3c37-a952-4812-afc3-7a4670572a8e","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:706418da2d1b48a50b268f4c0ef7978b637075dc1e6ae5a1a568ae182cf893b3","observation_id":"8d511432-6dcc-43f4-b323-9beca6afcb76","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:0820fb38406dcd9a67431bebb6cb853600794a7803eb14d10658490397816996","observation_id":"acf26dc6-9082-4e5c-acb8-7466f7c89a45","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:d90b9073ce367ddec4555dd83566e80dd4cdef016688f53a75c7486813d0b908","observation_id":"796e3c03-bad1-4ced-b565-4489abb2a905","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"quality” and “utility","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:24471c3c35c0e17150cf18357d056129a858b66bdf1e6dbe94d791c68fb47438","observation_id":"a896a008-6695-499a-b6b1-ec21db0c8e3d","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:5de87e27697410cf4036ba2ea38e83b421559ff85d895734c4fa88261cfb4066","observation_id":"bac57108-25f6-4544-8974-887799d2c2ba","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:bf9f3048269b4edfd47bc69faa2edaf4abcc91f6eea4eeb0aff066d3d610a9cb","observation_id":"60ebfe3c-b1a7-49a0-8240-8933f3ef7c5e","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:6520073117e8b17caad36415069793ae1ec116c42df5c9dae439737481066afd","observation_id":"506560cd-8469-40a4-843f-1f2e112ec079","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:501c107312cf955cac2bc778f12c8ee52bf02169beed6695083e994e4d305397","observation_id":"0d591112-d55d-4a7e-bd75-644aba612dff","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"=> medium_rag","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:db6803937149349253f369d2afd4804fdbc222ea50bd5f175fc2f97939820df1","observation_id":"2aaa0cc6-c187-450f-9629-657bbcabfd9c","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:31711869a830ab904fa709e30233d1571f2461114a7622a22b47205f66ac8574","observation_id":"4d88295d-7261-4460-99d6-f4acd1074159","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"=> medium_rag","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:0c00401efc46b9f37336e762407199956dce5baebc58f69c5081769c284827d7","observation_id":"b6b2e6e4-484f-4273-be2f-b53dd7de3e89","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:66227278937f4da99574e24a44e8388406aeffe4173793221a9eba7df2d99fe3","observation_id":"bff16538-1a62-4158-a77b-003e3740df28","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:39253b20c49bc96e0e967b480a6d4da32b88214f9a2af4c439bd533f9960379d","observation_id":"db552e56-4425-4889-b331-ada4ed4633c9","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:d45b2bc3d6d5bdb200c0bdc4c56ee584bf46e3676df8568f81dc47edb17cc93b","observation_id":"adb26633-0240-42f7-b3f3-d16b8c096aec","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"heavy retrieval => medium_rag","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:181e6b363e2686caa3d5c95ce357441c1cb8a2b58e16ae73d98d6406eca8027d","observation_id":"d9beae2f-6a5e-4839-a56e-ab266dcafac4","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:3a5ebbfecc8d9da086ce2908bcc43f82de8f701046c8390efeec2c2110903435","observation_id":"2c0636cb-3a46-4abe-ab4c-2c6b19b7e8fd","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:188118d567ee736072222bd5a94af73f56a541958cbd5c78611e5ccf7e2249b7","observation_id":"13c498c8-f21d-4d66-922b-8c130009088f","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:1621dd78bb9e83dce03b8710bab8aaa499e4390c97782c0d26e6f65223befb15","observation_id":"149eff6f-46fa-4083-b491-0fb76c78454f","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:78977fab24b9128a02c620d637d456373987879ca6b4fc0eb77d2db933bdaf1d","observation_id":"b7670ae5-320c-498d-9b50-47a55ded7a28","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:c128abbb30a83122080d19a77500a5b755ecf0742f73849bad460c7988f02fcd","observation_id":"f6029442-0ec9-4c03-93a4-f4fddb7bba4c","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:ce21fd630851af3ff21623c4de733f1d1b73587289ad632c6a7eafae1106322c","observation_id":"0a1f3248-ea1e-4c12-a27c-382a52bfc843","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:54e0620c82899ee0a72d8721d2308270d6bad7ac81804ee97fc2fee64ce998ea","observation_id":"42fdacfd-cafb-4246-a963-f024ea3301e1","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:1b8ded883105cf00563d781a5f94780abdc612b45b54d5e2cfaef4cdb071a325","observation_id":"96a90546-c1e2-44af-aa01-f1d318981bbb","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:26ab8289f83040155ec47aae8b912c75a4c3383c1d3d9abf43315c67767c5f77","observation_id":"acbddd6f-eaf1-4c1e-aacd-99905d34ee56","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:81dadffcc142bad28956ba9e98a64027c1adbb9f60604b8d84b048ec1e8b2e0e","observation_id":"7feb5f90-48e9-46e1-8c6b-cd39b95c233f","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:2b2d97fec6e8267e40eafc766e4bed36ac8ab4a1a9fe30065f89f7cc592cd32a","observation_id":"a7646903-4f49-4036-895c-1b53132c68b2","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":"retrieval-grounded answers => medium_rag","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:4ccc44e9829c2ad54f3ffbd1ac78eca1ffb1807c537bf4a9df88758b5ce2b42f","observation_id":"1f4f095a-7f43-41af-a0cc-468fad4acc66","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:0332372ad909ad50159698bc8d3ddbaa94a65d184d78ef56c228ad158a182cf3","observation_id":"fc7fd0fa-ca37-448a-8e32-77058e067c11","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:268c78f6ab2e2c62de828092df12fd394bdd3e307a7ad3de2f56af2af4975ed5","observation_id":"9288f592-b8f7-40ec-8d6b-82ccb667fd4a","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:3ccfbd0bb154de875bd55f2fb751441dd3377a49716fecd5c900cb9c9c092b0e","observation_id":"e4143448-0211-4691-a72c-617e17a73452","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:0fb40886a4ffd63a955f6a34d88b3b3ac0098a052a250e248be1580d94db50d7","observation_id":"357d4f9e-7424-44d1-a687-69ee608aa80c","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-13T18:32:24.536273Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-13T18:32:24.536273Z"},"links":{"citing_paper":"/paper/2606.02581"},"observation_digest":"sha256:ccbbc38ae2f4963b41b17a031757ab04408fda9cb65ddbd429788025b4eb3209","observation_id":"7984fd0e-ceb8-4037-b5ca-ad871ad4e5ef","resolution":{"observed_at":"2026-07-13T18:32:24.536273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.02581","last_updated":"2026-03-26T02:53:39Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-09T22:05:49.716966Z","submitted_at":"2026-03-26T02:53:39Z","title":"Cost-Aware Query Routing in RAG: Empirical Analysis of Retrieval Depth Tradeoffs"},"reference_resolution":{"displayed":44,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":44,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":44},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 44 of 44 outbound references and 0 inbound Pith citation observations for arXiv:2606.02581."}