{"as_of":"2026-08-09T02:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:62c43e2c5fd11f4edc78a23de8d8cb8a51ed27546085636fb16e40774ac812b2","coverage":[{"denominator":29,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":29,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T02:31:02.908220Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+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.29328/citation-record","integrity":"/paper/2606.29328/integrity","json":"/paper/2606.29328/citation-record.json","paper":"/paper/2606.29328"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:31:02.908220Z","title":"Retrieval-augmented generation for knowledge-intensive NLP tasks","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:4f64f4756e1e4499f86054570157c9d05106ccdd32342f606f22e4433815cb70","observation_id":"3b8c291b-201c-49dd-a050-f4b707cca987","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Dense passage retrieval for open-domain question an- swering,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:e4c605fbccf8d7e216fd164afc9db2302829d0a2e1d96e5c73e08ec85b58029e","observation_id":"4e2625f5-cd74-476a-b504-b097f40f3392","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Approximate nearest neighbor negative contrastive learning for dense text retrieval,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:f3e94a83dff9019e1a001ed93d5b8c23ec1c6f4082c3b82a4b6ced8a2d77c8ce","observation_id":"7504308e-bbc0-40a0-aa12-7cf490966fdb","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Milvus: A purpose-built vector data management system,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:aef757780c8ba6d786baa9d7ffdd6e95c0b57a8edc66fe924d1529f81435dd06","observation_id":"43605ec1-a84a-4ab9-9c97-a27b8ee0270e","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Survey of vector database management systems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:0f89b5fd9c597d1f54bbea853dd7f47a62c8284a07e079f5da4578809cc65ffa","observation_id":"3ac112f2-4b69-4b2f-ac81-7a6f73629ddc","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"SeRF: Segment graph for range-filtering approximate nearest neighbor search,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:231e0c56b54fc7078078c235e914d54ead0e251e07c69466e38865c64e30d0fc","observation_id":"ed932cc5-d2e4-4bb6-ba92-b3df708c5eff","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Cracking vector search indexes,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:79b43bef105f1f01881e2f865aba87984b43fc4462d604bbb722ccbb1f5fc89e","observation_id":"61eeeb80-e72d-41e3-8bb1-439c339307ee","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"VDTuner: Automated performance tuning for vector data management systems,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:b5bc10756dcd639d338ca779c907bec9d55bc162b3e4d7ec7b36d5e07a82f24a","observation_id":"fac1d167-7d62-4c81-9bce-0f22770939e2","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.07597","last_updated":"2024-09-24T03:01:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-09-14T10:57:50Z","title":"C-Pack: Packed Resources For General Chinese Embeddings","version":5},"cited_work":{"arxiv_id":"2309.07597","doi":"10.48550/arxiv.2309.07597","metadata_source":"pith","pith_arxiv_id":"2309.07597","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"C-Pack: Packed Resources For General Chinese Embeddings","venue":"cs.CL","work_id":"5d8d3efd-bb5b-4a30-8457-28f190c026e9","year":2023},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"cited_paper":"/paper/2309.07597","citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:4931e1ef5b6bbec6c3fefef85d10fabaec255fbe392386622f2429b331d188da","observation_id":"11d19308-97ab-456a-b918-81be3ee9854b","resolution":{"observed_at":"2026-06-30T02:34:13.443393Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:31:02.908220Z","title":"RankRAG: Unifying context ranking with retrieval- augmented generation in LLMs,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:35c3a4618c68fde65347f1806e573a3b67d8be8d6e3e7a70ccad4e47898d86cd","observation_id":"87db302e-4f1e-4d5d-b6ca-0a142f13f45d","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"The use of MMR, diversity-based rerank- ing for reordering documents and producing summaries,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:7cb9ac625ead3c51b306cff05ce4c62b36b3e7df933a11c83d76f952c7a6f99b","observation_id":"167b2e9d-0907-4dcd-9688-63b1e9996311","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Determinantal point processes for machine learning,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:1769c8898f084c476067f772f836083c5a397685dd7fa9a6f4eea27699dd2963","observation_id":"79c051f8-f62f-4ff6-acb4-32b7604a65bb","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.13992","last_updated":"2024-09-21T03:03:09Z","snapshot_observed_at":"2026-08-04T15:12:16.965697Z","submitted_at":"2024-09-21T03:03:09Z","title":"SMART-RAG: Selection using Determinantal Matrices for Augmented Retrieval","version":1},"cited_work":{"arxiv_id":"2409.13992","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2409.13992","snapshot_observed_at":"2026-07-02T20:17:21.499801Z","title":"Smart-rag: Selection using determinantal matrices for augmented retrieval","venue":null,"work_id":"28d46fb8-a4c7-4dd6-b5f1-8c5962061f18","year":2024},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"cited_paper":"/paper/2409.13992","citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:69b8fcd24f363d91f67c709a369f6f58ab2c728fbd33f3e4d84021ab9b3a4120","observation_id":"21d14c60-20b8-43b6-b2d5-f41edc52960e","resolution":{"observed_at":"2026-06-30T02:34:13.440014Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2512.25052","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T04:47:38.762838Z","title":"://arxiv.org/abs/2512.25052","venue":null,"work_id":"6c2a4db5-462f-418f-ad38-e58fe1527216","year":2025},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:41ff50b7986697d735a3f4a493cd4ea12bb4812e94137e5446db452aeb747983","observation_id":"f38d2772-7c55-4ec0-9d8c-bbaac9182ae9","resolution":{"observed_at":"2026-06-30T02:34:13.446693Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:31:02.908220Z","title":"InfoGain-RAG: Boosting retrieval-augmented generation through document information gain-based reranking and filtering,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:4a652a210479fd245a43bd6e6ad1ead86c95f7ecbfcb9917a132cf87c7f1d276","observation_id":"61aa30ef-414c-480a-8e6d-31dcac59affa","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Search result diversification,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:7edc547f0fe703e692608ff716307a546d443926c92ed418188fb9c504a8ec52","observation_id":"4d7dab42-bcc0-40b5-a0bb-fc41fc0f5722","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"On query result diversifi- cation,","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:73c65c5e3410b4ceb5fe7e1f981b5d088b92786fc0b579034a989e7b8228cf30","observation_id":"44604406-5223-4e86-b3d3-319acd6282b8","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Diversifying top-kresults,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:62e1bf767396b285551fd6875bef5250aa8843b83d586174948aedac0e4acdad","observation_id":"50a2ded9-9d09-40f1-ac21-b5162bd66982","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.03240","last_updated":"2026-02-04T07:37:07Z","snapshot_observed_at":"2026-08-02T01:36:20.407295Z","submitted_at":"2026-02-04T07:37:07Z","title":"Scaling DPPs for RAG: Density Meets Diversity","version":1},"cited_work":{"arxiv_id":"2604.03240","doi":null,"metadata_source":"pith","pith_arxiv_id":"2604.03240","snapshot_observed_at":"2026-06-30T02:34:13.455631Z","title":"Scaling DPPs for RAG: Density Meets Diversity","venue":"cs.LG","work_id":"918b9755-9c9c-4226-964e-bd96be58d6c8","year":2026},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"cited_paper":"/paper/2604.03240","citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:8ea0ca387f152a40938dc1904479e8e25c6bab416ca7abddb6d479c2295cf98f","observation_id":"3e475b1a-5e95-4eff-b61e-a94cf7c32521","resolution":{"observed_at":"2026-06-30T02:34:13.457273Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:31:02.908220Z","title":"Precise zero-shot dense retrieval without relevance labels,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:cb1cf0065cf41d87f2c2715a1aa0142e662ef762383d49a9efe5249b46040366","observation_id":"f9552cc9-b9b5-4362-b61e-7b610eb3a16b","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Multi-query retrieval,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:bf2123ecc51832b1dedba02cdbd015c18e669649bab841d5fc7cdd4344ddc391","observation_id":"b7f13ac3-abbf-4ddd-9297-bf60c4cf1b63","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03367","last_updated":"2024-02-21T21:19:39Z","snapshot_observed_at":"2026-08-08T11:51:10.597187Z","submitted_at":"2024-01-31T22:06:07Z","title":"RAG-Fusion: a New Take on Retrieval-Augmented Generation","version":2},"cited_work":{"arxiv_id":"2402.03367","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.03367","snapshot_observed_at":"2026-07-03T15:28:33.951262Z","title":"Rag-fusion: a new take on retrieval-augmented gener- ation","venue":null,"work_id":"9c3289bf-e626-46b3-ae35-fd8ceadf1742","year":2024},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"cited_paper":"/paper/2402.03367","citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:5920182fb972fbba97f62dac2ac6c0ba70c89372649e8b4dea16187de05bed8b","observation_id":"1e07ea7c-b9c9-4bb8-b4fb-ff5c7e802a59","resolution":{"observed_at":"2026-06-30T02:34:13.460788Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2601.05027","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:34:13.462165Z","title":"OptiSet: Unified Optimizing Set Selection and Ranking for Retrieval-Augmented Generation,","venue":null,"work_id":"57a3e831-63ef-447a-8465-b25a99eb9c19","year":2026},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:4f66c4d0087c4ddcb0989e15fc0162db1fa17837a0c28d8246c91f2c2f087e25","observation_id":"ebe9abbe-f1b0-4f3c-a1df-c8128e9cce51","resolution":{"observed_at":"2026-06-30T02:34:13.464004Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-30T02:31:02.908220Z","title":"From word embeddings to document distances,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:34c82ca3d8f73f711df310481cec8f07a4a5882218a2f6a86a300a552b0c3f5c","observation_id":"565beea2-ed5c-41a2-bf62-0a14568cc35c","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Wass- Rank: Listwise Document Ranking Using Optimal Transport Theory,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:c816cb6334552de1934a98867943595310df4e9369a9dcaac40251c0723abcdd","observation_id":"f722f9ed-69d9-40a0-8b69-d587fe304f96","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"Sinkhorn distances: Lightspeed computation of optimal transport,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:70d398611411cce5281bd27157bf654f4a6a616c222cd8deb53af4418f2c037a","observation_id":"9a3cea12-edb4-4a8e-9996-2dd1bf70d824","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","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-06-30T02:31:02.908220Z","title":"An analysis of approximations for maximizing submodular set functions—I,","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:054f8b2b9df2a525fd424b0afd31fa1d5993f8249e53e0daa2f6debdd9ce9ceb","observation_id":"995c4373-757d-4476-9cea-f35324109d1b","resolution":{"observed_at":"2026-06-30T02:31:02.908220Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.16130","last_updated":"2025-02-19T10:49:41Z","snapshot_observed_at":"2026-07-06T18:05:11.700127Z","submitted_at":"2024-04-24T18:38:11Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","version":2},"cited_work":{"arxiv_id":"2404.16130","doi":"10.48550/arxiv.2404.16130","metadata_source":"pith","pith_arxiv_id":"2404.16130","snapshot_observed_at":"2026-07-10T06:15:00.866473Z","title":"From Local to Global: A Graph RAG Approach to Query-Focused Summarization","venue":"cs.CL","work_id":"588618d7-fd41-4053-b34d-a981f8793039","year":2024},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:f64629f9dd0434ebb9e295cf0b870086210f11e795326da301a5432055559032","observation_id":"3ee81960-d171-4a96-86cd-84d9af688f2b","resolution":{"observed_at":"2026-06-30T02:34:13.450923Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-07-11T05:49:57.694079+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T05:49:57.694079+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.13576","last_updated":"2025-02-24T02:46:52Z","snapshot_observed_at":"2026-08-08T09:22:36.004067Z","submitted_at":"2024-05-22T12:12:40Z","title":"FlashRAG: A Modular Toolkit for Efficient Retrieval-Augmented Generation Research","version":2},"cited_work":{"arxiv_id":"2405.13576","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2405.13576","snapshot_observed_at":"2026-06-30T02:34:13.452264Z","title":"Flashrag: A modular toolkit for efficient retrieval-augmented generation research","venue":null,"work_id":"a2038327-4d1b-4caf-b7f0-eb2b996d4e1e","year":2024},"citing_paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-06-30T02:31:02.908220Z"},"links":{"cited_paper":"/paper/2405.13576","citing_paper":"/paper/2606.29328"},"observation_digest":"sha256:29bfa0eea9621c0ab58baf2303e54c1ab4aa1432a2cccbe003eaf28dba0075dd","observation_id":"5612efb8-6d18-4379-8d07-8f82cc2c8911","resolution":{"observed_at":"2026-06-30T02:34:13.454021Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2606.29328","last_updated":"2026-06-28T10:49:04Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-02T13:15:40.351137Z","submitted_at":"2026-06-28T10:49:04Z","title":"Covering the Unseen: Information Demand Coverage Optimization for Retrieval-Augmented Generation"},"reference_resolution":{"displayed":29,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":21,"verified_exact":7,"verified_fuzzy":0},"total_outbound_references":29},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2606.29328."}