{"as_of":"2026-08-07T08:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e74ac4f1de56fe5dac887305f7151e7f9b1dc1bc3cef5e0de46f1c32550c04a1","coverage":[{"denominator":35,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":35,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T18:57:33.669725Z","state":"measured"},{"denominator":35,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":35,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2507.06838/citation-record","integrity":"/paper/2507.06838/integrity","json":"/paper/2507.06838/citation-record.json","paper":"/paper/2507.06838"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.16214","last_updated":"2025-01-27T17:06:56Z","snapshot_observed_at":"2026-08-07T07:01:25.924838Z","submitted_at":"2025-01-27T17:06:56Z","title":"Provence: efficient and robust context pruning for retrieval-augmented generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16214","snapshot_observed_at":"2026-08-06T18:57:33.567975Z","title":"arXiv preprint arXiv:2501.16214","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.567975Z"},"links":{"cited_paper":"/paper/2501.16214","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:5e855d16b33adbbdb90dd08995b4b46f21030982e7d79b3c2a5bb5597259b5f3","observation_id":"17bca2c9-7134-4c0f-a7fd-39e5efea9a6b","resolution":{"observed_at":"2026-08-06T18:57:33.567975Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.00367","last_updated":"2024-07-01T01:34:09Z","snapshot_observed_at":"2026-08-05T02:20:52.778218Z","submitted_at":"2024-02-01T06:11:49Z","title":"Don't Hallucinate, Abstain: Identifying LLM Knowledge Gaps via Multi-LLM Collaboration","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.00367","snapshot_observed_at":"2026-08-06T18:57:33.578068Z","title":"Preprint, arXiv:2402.00367","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.578068Z"},"links":{"cited_paper":"/paper/2402.00367","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:4c5eb3106f09fd9f4f6ac15fc3c8db7902ed6179df81c51ee89c561bc95f647d","observation_id":"fd0292a0-fb8f-401a-a60b-1bea886ec8c1","resolution":{"observed_at":"2026-08-06T18:57:33.578068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.01579","last_updated":"2024-06-09T23:42:48Z","snapshot_observed_at":"2026-07-06T15:22:25.008777Z","submitted_at":"2023-05-02T16:28:10Z","title":"Why So Gullible? Enhancing the Robustness of Retrieval-Augmented Models against Counterfactual Noise","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.01579","snapshot_observed_at":"2026-08-06T18:57:33.581971Z","title":"Preprint, arXiv:2305.01579","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.581971Z"},"links":{"cited_paper":"/paper/2305.01579","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:6ebfd9e41207df671966f044dca7a10fb9c027a7991ff6314393c1a736369da9","observation_id":"d3e4d5d1-b728-48da-b9e1-7fa30e70fc2d","resolution":{"observed_at":"2026-08-06T18:57:33.581971Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.14403","last_updated":"2024-03-28T06:45:11Z","snapshot_observed_at":"2026-08-04T09:23:59.079378Z","submitted_at":"2024-03-21T13:52:30Z","title":"Adaptive-RAG: Learning to Adapt Retrieval-Augmented Large Language Models through Question Complexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.14403","snapshot_observed_at":"2026-08-06T18:57:33.585373Z","title":"Preprint, arXiv:2403.14403","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.585373Z"},"links":{"cited_paper":"/paper/2403.14403","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:fc8cd57496173caa30a053e2d2306493fa63ef8c74c6ed37204c13d1d8c26104","observation_id":"2680f6e5-00aa-4cf8-a986-1a31615f08ca","resolution":{"observed_at":"2026-08-06T18:57:33.585373Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-06T18:57:33.588478Z","title":"Preprint, arXiv:2310.06825","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.588478Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:8ce84fc8384e02b5dc1fb4bb84c2514bf4000411e476f8ca98f657a766bf94a9","observation_id":"42691430-e65d-4a17-9b06-f330064e15b2","resolution":{"observed_at":"2026-08-06T18:57:33.588478Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04906","last_updated":"2020-09-30T21:27:13Z","snapshot_observed_at":"2026-07-06T09:11:26.109763Z","submitted_at":"2020-04-10T04:53:17Z","title":"Dense Passage Retrieval for Open-Domain Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04906","snapshot_observed_at":"2026-08-06T18:57:33.591685Z","title":"arXiv preprint arXiv:2004.04906","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.591685Z"},"links":{"cited_paper":"/paper/2004.04906","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:65828331c5506ada7428374f280f36df36a1f77d0729231d0e89191383728fad","observation_id":"90bde8a5-c1d4-46f2-833c-aa61e25f0a2d","resolution":{"observed_at":"2026-08-06T18:57:33.591685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.11401","last_updated":"2021-04-12T15:42:18Z","snapshot_observed_at":"2026-08-07T05:44:30.677502Z","submitted_at":"2020-05-22T21:34:34Z","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.11401","snapshot_observed_at":"2026-08-06T18:57:33.595140Z","title":"Preprint, arXiv:2005.11401","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.595140Z"},"links":{"cited_paper":"/paper/2005.11401","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:5346ac951b28c0868ca6378f5010273500dcf6a0ca158d06c48d5b758fdb3a4b","observation_id":"c757cc2f-4550-4393-a0c3-c0cb28e3d359","resolution":{"observed_at":"2026-08-06T18:57:33.595140Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.00142","last_updated":"2024-10-31T18:43:12Z","snapshot_observed_at":"2026-07-06T19:43:14.670881Z","submitted_at":"2024-10-31T18:43:12Z","title":"JudgeRank: Leveraging Large Language Models for Reasoning-Intensive Reranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.00142","snapshot_observed_at":"2026-08-06T18:57:33.601899Z","title":"arXiv preprint arXiv:2411.00142","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.601899Z"},"links":{"cited_paper":"/paper/2411.00142","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:bff20e61baad4adb2cb336695fbc92c6c42be871cf798bf55a7f04a78be8d065","observation_id":"3f13f3b9-f177-4405-b6a1-24c6e3956c63","resolution":{"observed_at":"2026-08-06T18:57:33.601899Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1901.04085","last_updated":"2020-04-14T14:57:40Z","snapshot_observed_at":"2026-08-02T11:18:37.014004Z","submitted_at":"2019-01-13T23:27:58Z","title":"Passage Re-ranking with BERT","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.04085","snapshot_observed_at":"2026-08-06T18:57:33.605010Z","title":"arXiv preprint arXiv:1901.04085","venue":null,"work_id":null,"year":1901},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.605010Z"},"links":{"cited_paper":"/paper/1901.04085","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:19efa0515f9eaf83452b790df23e11ae66a91a59e6d76e1c8d410b961f9cdf7d","observation_id":"93f43c6f-1864-435e-8464-8ec7f7cf4f42","resolution":{"observed_at":"2026-08-06T18:57:33.605010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.17563","last_updated":"2024-03-28T13:59:09Z","snapshot_observed_at":"2026-07-06T15:48:44.267376Z","submitted_at":"2023-06-30T11:32:25Z","title":"Large Language Models are Effective Text Rankers with Pairwise Ranking Prompting","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.17563","snapshot_observed_at":"2026-08-06T18:57:33.609045Z","title":"arXiv preprint arXiv:2306.17563","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.609045Z"},"links":{"cited_paper":"/paper/2306.17563","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:08984b3e4b1dedce6b98605b9631e1cbb32dc59c694cf8861a785761dcecc66b","observation_id":"46f1c541-15aa-454a-9b66-0864fb417106","resolution":{"observed_at":"2026-08-06T18:57:33.609045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00083","last_updated":"2023-08-01T12:10:15Z","snapshot_observed_at":"2026-07-06T14:46:48.605674Z","submitted_at":"2023-01-31T20:26:16Z","title":"In-Context Retrieval-Augmented Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00083","snapshot_observed_at":"2026-08-06T18:57:33.612325Z","title":"Preprint, arXiv:2302.00083","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.612325Z"},"links":{"cited_paper":"/paper/2302.00083","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:5f5589f29e1c1bb70eca868f1d67a7ed1f369eee35ed084463d4fbb79c9108dc","observation_id":"e6572969-1979-4a75-91a6-b76a38ae753c","resolution":{"observed_at":"2026-08-06T18:57:33.612325Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.18059","last_updated":"2024-01-31T18:30:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-01-31T18:30:21Z","title":"RAPTOR: Recursive Abstractive Processing for Tree-Organized Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.18059","snapshot_observed_at":"2026-08-06T18:57:33.615383Z","title":"Preprint, arXiv:2401.18059","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.615383Z"},"links":{"cited_paper":"/paper/2401.18059","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:4234f3f4bfc8024a21b2d0295f2ed52356faee7d762374999566698b5fceab6c","observation_id":"ad2e8268-a2f0-4682-8046-c5ef44459795","resolution":{"observed_at":"2026-08-06T18:57:33.615383Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.15294","last_updated":"2023-10-23T09:58:13Z","snapshot_observed_at":"2026-08-03T16:18:57.922065Z","submitted_at":"2023-05-24T16:17:36Z","title":"Enhancing Retrieval-Augmented Large Language Models with Iterative Retrieval-Generation Synergy","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.15294","snapshot_observed_at":"2026-08-06T18:57:33.618591Z","title":"Preprint, arXiv:2305.15294","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.618591Z"},"links":{"cited_paper":"/paper/2305.15294","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:154fef2690283982d7d6181fff6eac339d256b6664a1f57b5c8ee029b666acc8","observation_id":"44b8da4f-440f-4de6-a303-364d8ba23a69","resolution":{"observed_at":"2026-08-06T18:57:33.618591Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.00093","last_updated":"2023-06-06T08:36:20Z","snapshot_observed_at":"2026-07-06T14:46:48.605674Z","submitted_at":"2023-01-31T20:48:57Z","title":"Large Language Models Can Be Easily Distracted by Irrelevant Context","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.00093","snapshot_observed_at":"2026-08-06T18:57:33.622224Z","title":"Preprint, arXiv:2302.00093","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.622224Z"},"links":{"cited_paper":"/paper/2302.00093","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:269f46f345ac71a06c65b7dcfc6927ddd46fb82bdecfe84555097157f89d8fbd","observation_id":"68292781-2f4f-4b83-a404-38d0e03bfaf3","resolution":{"observed_at":"2026-08-06T18:57:33.622224Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.09542","last_updated":"2024-12-28T06:20:54Z","snapshot_observed_at":"2026-08-06T00:21:17.259026Z","submitted_at":"2023-04-19T10:16:03Z","title":"Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.09542","snapshot_observed_at":"2026-08-06T18:57:33.626119Z","title":"Preprint, arXiv:2304.09542","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.626119Z"},"links":{"cited_paper":"/paper/2304.09542","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:25084e52ee96ef0121d486ec55d2a22bfe5e189b82abcc7b49032b5b5026dafe","observation_id":"56b81bb3-1916-4bf7-8c32-d01441492d52","resolution":{"observed_at":"2026-08-06T18:57:33.626119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.15391","last_updated":"2024-01-27T11:41:48Z","snapshot_observed_at":"2026-08-02T18:59:01.488566Z","submitted_at":"2024-01-27T11:41:48Z","title":"MultiHop-RAG: Benchmarking Retrieval-Augmented Generation for Multi-Hop Queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.15391","snapshot_observed_at":"2026-08-06T18:57:33.630029Z","title":"Preprint, arXiv:2401.15391","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.630029Z"},"links":{"cited_paper":"/paper/2401.15391","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:416863f513537351e19fe333b979f616463f47b9b0a63ff803bcbddd23e2880a","observation_id":"002ae8b1-5ac5-40e9-b7b1-2e67d9fc5c0a","resolution":{"observed_at":"2026-08-06T18:57:33.630029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-02T11:57:18.735747Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-06T18:57:33.633044Z","title":"Preprint, arXiv:2307.09288","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.633044Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:2cb30ce4ba8cf1a0deb502e2ea4b60f417fb880a45d0c0474b66311a259fb404","observation_id":"6c16b8ff-11bf-4665-b428-2764aa5243ec","resolution":{"observed_at":"2026-08-06T18:57:33.633044Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.10509","last_updated":"2023-06-23T00:59:13Z","snapshot_observed_at":"2026-07-06T14:33:08.041820Z","submitted_at":"2022-12-20T18:26:34Z","title":"Interleaving Retrieval with Chain-of-Thought Reasoning for Knowledge-Intensive Multi-Step Questions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.10509","snapshot_observed_at":"2026-08-06T18:57:33.636094Z","title":"Preprint, arXiv:2212.10509","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.636094Z"},"links":{"cited_paper":"/paper/2212.10509","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:7dbd5b74ddd2cc4d8aa5ccb9c86c424487dd20863fc68bd47aa03371db3491e8","observation_id":"c8b0663b-b9d1-4789-a4d3-efcf0b4316ad","resolution":{"observed_at":"2026-08-06T18:57:33.636094Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.16944","last_updated":"2023-10-25T19:25:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-25T19:25:16Z","title":"Zephyr: Direct Distillation of LM Alignment","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.16944","snapshot_observed_at":"2026-08-06T18:57:33.639110Z","title":"Preprint, arXiv:2310.16944","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.639110Z"},"links":{"cited_paper":"/paper/2310.16944","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:5a5cf124073f733c4b3fb5e22cb3ad654a14541c14dccdaa430a7b0c007747bb","observation_id":"46e7c7f6-098b-4bcd-b2f7-278860f6a0e9","resolution":{"observed_at":"2026-08-06T18:57:33.639110Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.12824","last_updated":"2024-06-18T17:46:08Z","snapshot_observed_at":"2026-08-03T01:16:14.932582Z","submitted_at":"2024-06-18T17:46:08Z","title":"From RAGs to rich parameters: Probing how language models utilize external knowledge over parametric information for factual queries","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.12824","snapshot_observed_at":"2026-08-06T18:57:33.641998Z","title":"Preprint, arXiv:2406.12824","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.641998Z"},"links":{"cited_paper":"/paper/2406.12824","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:7a658e737776157edf3971653a4fc62703968ef50de1f909cca0dfba0076a7d0","observation_id":"576ee7e7-5cfd-4f60-a3c5-1dbef723472b","resolution":{"observed_at":"2026-08-06T18:57:33.641998Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2304.06762","last_updated":"2023-12-21T00:18:48Z","snapshot_observed_at":"2026-08-04T23:54:26.076579Z","submitted_at":"2023-04-13T18:04:19Z","title":"Shall We Pretrain Autoregressive Language Models with Retrieval? A Comprehensive Study","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.06762","snapshot_observed_at":"2026-08-06T18:57:33.645211Z","title":"Preprint, arXiv:2304.06762","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.645211Z"},"links":{"cited_paper":"/paper/2304.06762","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:ef9e898cb9f4c9bfda2fda7b72b8f4a55db07fad221140cb443a788acdab72d9","observation_id":"ce5ca023-3694-46ac-996c-6e4c05308835","resolution":{"observed_at":"2026-08-06T18:57:33.645211Z","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-08-06T18:57:33.648791Z","title":"Preprint, arXiv:2411.00744","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.648791Z"},"links":{"citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:2c441439ef8c648f6988f946fea666274738bf92522ca51a3e422855793424bf","observation_id":"c392362e-0628-472f-849e-62011e8be68b","resolution":{"observed_at":"2026-08-06T18:57:33.648791Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.07597","snapshot_observed_at":"2026-08-06T18:57:33.651568Z","title":"Preprint, arXiv:2309.07597","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.651568Z"},"links":{"cited_paper":"/paper/2309.07597","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:276a230366c9b6b83fea076ea44afa4a983ff09a863b4525253b3221f623c06c","observation_id":"af4d9c32-ca74-4631-8175-a51ae23cd208","resolution":{"observed_at":"2026-08-06T18:57:33.651568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.15838","last_updated":"2024-06-06T17:32:45Z","snapshot_observed_at":"2026-07-06T17:34:57.509162Z","submitted_at":"2024-02-24T15:31:59Z","title":"ListT5: Listwise Reranking with Fusion-in-Decoder Improves Zero-shot Retrieval","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.15838","snapshot_observed_at":"2026-08-06T18:57:33.657516Z","title":"arXiv preprint arXiv:2402.15838","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.657516Z"},"links":{"cited_paper":"/paper/2402.15838","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:9e88098c951d59a8239a5dd30067f9ac561977dee59fe5f9e5bc71b794165afd","observation_id":"1f02081f-0221-489b-b7e2-b57ce046af80","resolution":{"observed_at":"2026-08-06T18:57:33.657516Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2306.05685","last_updated":"2023-12-24T02:01:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-06-09T05:55:52Z","title":"Judging LLM-as-a-Judge with MT-Bench and Chatbot Arena","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2306.05685","snapshot_observed_at":"2026-08-06T18:57:33.660576Z","title":"Preprint, arXiv:2306.05685","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.660576Z"},"links":{"cited_paper":"/paper/2306.05685","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:16b9db6ce98261c21318f96e8c38af6ee6284519cd4bb0566ac6ebe3a3a1bb77","observation_id":"12ed2db3-f5b7-4121-a353-a1d994ff2c2e","resolution":{"observed_at":"2026-08-06T18:57:33.660576Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:57:34.015489Z","title":"Given a query and a can- didate passage, it outputs a score to reorder retrieved documents by their relevance","venue":null,"work_id":"36982aa4-d166-4403-94b0-9b8b25ee4a05","year":2023},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.663560Z"},"links":{"citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:7ec48782e730de2f9c34aa8ae95cd8b160d788ace473253999f97c924baab9e6","observation_id":"4c69d6a8-a089-401e-b56f-1363cd139eff","resolution":{"observed_at":"2026-08-06T18:57:34.018627Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:57:34.005772Z","title":"It reframes reranking as a single- token decoding task, enabling fast and ef- ficient passage selection","venue":null,"work_id":"51fd6973-7e6d-4067-a105-4a60548602b3","year":2023},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.666941Z"},"links":{"citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:d959bea0876dbace2c9540a2fbbaf28803e1112e57cf81cdeb6d91c7223e3c00","observation_id":"9793ff2e-67d1-4d17-9303-6e15dee991ad","resolution":{"observed_at":"2026-08-06T18:57:34.009818Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T18:57:33.995741Z","title":"Let’s think step by step","venue":null,"work_id":"8d9a560c-ed01-4280-9e62-943b449956f9","year":2024},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.669725Z"},"links":{"citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:e120d1edff33dbaace3a8c8275cc7fc8f2cce411b84c3c1bd731aa8319cba7c1","observation_id":"4978cecb-fd90-4476-b3e4-7f319a9e2354","resolution":{"observed_at":"2026-08-06T18:57:33.999790Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.09600","last_updated":"2018-09-25T17:28:20Z","snapshot_observed_at":"2026-07-31T11:19:06.421362Z","submitted_at":"2018-09-25T17:28:20Z","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.09600","snapshot_observed_at":"2026-08-06T18:57:33.654515Z","title":"Preprint, arXiv:1809.09600","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.654515Z"},"links":{"cited_paper":"/paper/1809.09600","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:542d6463a0f084b5b4b46bda54aa4b6e77e4e9b3d31856eed991e0dd4968d16d","observation_id":"391a39fc-eb21-4642-8a89-2c543d7284d6","resolution":{"observed_at":"2026-08-06T18:57:33.654515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.05101","last_updated":"2019-01-04T21:01:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2017-11-14T14:24:06Z","title":"Decoupled Weight Decay Regularization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1711.05101","snapshot_observed_at":"2026-08-06T18:57:33.598933Z","title":"Preprint, arXiv:1711.05101","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.598933Z"},"links":{"cited_paper":"/paper/1711.05101","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:3cd92012b7a45c2e6b4bdf47a621edb5a34d126551f67ce33f62aa943536eff6","observation_id":"985e42f8-4358-4fbf-a5c8-b4946596fd49","resolution":{"observed_at":"2026-08-06T18:57:33.598933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.07820","last_updated":"2020-03-18T16:56:56Z","snapshot_observed_at":"2026-07-06T09:05:23.015957Z","submitted_at":"2020-03-17T17:12:36Z","title":"Overview of the TREC 2019 deep learning track","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.07820","snapshot_observed_at":"2026-08-06T18:57:33.574728Z","title":"Preprint, arXiv:2003.07820","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.574728Z"},"links":{"cited_paper":"/paper/2003.07820","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:abef12adbba5a9df1e2344f3a0061c5c677180f810727fb548677a1f82a7f3e5","observation_id":"953be654-07ec-47c2-b19d-22849632f697","resolution":{"observed_at":"2026-08-06T18:57:33.574728Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07662","last_updated":"2021-02-15T16:47:00Z","snapshot_observed_at":"2026-07-06T10:41:31.563193Z","submitted_at":"2021-02-15T16:47:00Z","title":"Overview of the TREC 2020 deep learning track","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07662","snapshot_observed_at":"2026-08-06T18:57:33.571316Z","title":"Preprint, arXiv:2102.07662","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.571316Z"},"links":{"cited_paper":"/paper/2102.07662","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:c8507588f1f65845ad255bb8aeac004f5ad9c460b7e5438725aaffc6a89ac424","observation_id":"142fec3f-3728-4f17-8cac-4b01366916a6","resolution":{"observed_at":"2026-08-06T18:57:33.571316Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.11511","last_updated":"2023-10-17T18:18:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-17T18:18:32Z","title":"Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.11511","snapshot_observed_at":"2026-08-06T18:57:33.560989Z","title":"Preprint, arXiv:2310.11511","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.560989Z"},"links":{"cited_paper":"/paper/2310.11511","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:b4a63730ea7312ef732a95f38b6cbd0239f79baf707bebae8cedc9d69f99f49f","observation_id":"27127e96-871e-462d-94db-4364bd9b75f8","resolution":{"observed_at":"2026-08-06T18:57:33.560989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.05508","last_updated":"2024-11-12T15:36:04Z","snapshot_observed_at":"2026-08-06T09:15:33.449348Z","submitted_at":"2024-11-08T12:08:17Z","title":"An Early FIRST Reproduction and Improvements to Single-Token Decoding for Fast Listwise Reranking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.05508","snapshot_observed_at":"2026-08-06T18:57:33.564436Z","title":"Preprint, arXiv:2411.05508","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.564436Z"},"links":{"cited_paper":"/paper/2411.05508","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:9c403c85e8af066a3beae6b0360a7e5b1987574879e4da338e355993a5e7ce7a","observation_id":"b2acb541-8b4b-46f9-882f-0fd807bd20c5","resolution":{"observed_at":"2026-08-06T18:57:33.564436Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.02464","last_updated":"2025-02-19T22:46:25Z","snapshot_observed_at":"2026-07-06T20:31:03.484385Z","submitted_at":"2025-02-04T16:33:25Z","title":"Rankify: A Comprehensive Python Toolkit for Retrieval, Re-Ranking, and Retrieval-Augmented Generation","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.02464","snapshot_observed_at":"2026-08-06T18:57:33.556980Z","title":"arXiv preprint arXiv:2502.02464","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation","version":2},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-06T18:57:33.556980Z"},"links":{"cited_paper":"/paper/2502.02464","citing_paper":"/paper/2507.06838"},"observation_digest":"sha256:ecb8c8d0e00481c54c413e25cc0d7e6963d9b144ac2927df5a1895277650052c","observation_id":"7ae4d162-8231-4a87-a6e6-8ee712c9b55c","resolution":{"observed_at":"2026-08-06T18:57:33.556980Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2507.06838","last_updated":"2025-07-10T01:36:33Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-06T21:08:25.425418Z","submitted_at":"2025-07-09T13:35:36Z","title":"Shifting from Ranking to Set Selection for Retrieval Augmented Generation"},"reference_resolution":{"displayed":35,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":32,"verified_exact":0,"verified_fuzzy":3},"total_outbound_references":35},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 7 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 0 inbound Pith citation observations for arXiv:2507.06838."}