{"as_of":"2026-08-09T06:21:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cfd26fb8148a6d86b510ba4cbe5dbd7c7c085feea0580e35cd15bbd719bf2e80","coverage":[{"denominator":45,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":45,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-05T21:01:55.012735Z","state":"measured"},{"denominator":48,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":48,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-03T18:49:00.598034Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T20:17:21.469409Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.09497","snapshot_observed_at":"2026-08-03T18:49:00.598034Z","title":"From ranking to selection: A simple but efficient dynamic passage selector for retrieval augmented generation.arXiv preprint arXiv:2508.09497, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2512.03627","last_updated":"2026-06-02T03:13:58Z","snapshot_observed_at":"2026-08-03T18:48:56.892789Z","submitted_at":"2025-12-03T10:06:14Z","title":"MemVerse: Multimodal Memory for Lifelong Learning Agents","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-03T18:49:00.598034Z"},"links":{"cited_paper":"/paper/2508.09497","citing_paper":"/paper/2512.03627"},"observation_digest":"sha256:2bb09652e1a3bd4cf00343832f3f26cef6081615ea6a5fe503f9ff26351d506d","observation_id":"918d30f1-b925-4e26-aa32-432ba0b6eb79","resolution":{"observed_at":"2026-08-03T18:49:00.598034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"cited_work":{"arxiv_id":"2508.09497","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.09497","snapshot_observed_at":"2026-07-02T20:17:21.469409Z","title":"From ranking to selection: A simple but efficient dynamic passage selector for retrieval augmented generation","venue":null,"work_id":"4ef17b35-593e-40e7-828b-7ea205b59cca","year":2025},"citing_paper":{"arxiv_id":"2605.24660","last_updated":"2026-06-07T02:58:55Z","snapshot_observed_at":"2026-08-06T13:09:07.919381Z","submitted_at":"2026-05-23T17:02:56Z","title":"How Many Tools Should an LLM Agent See? A Chance-Corrected Answer","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-06-30T12:22:59.494989Z"},"links":{"cited_paper":"/paper/2508.09497","citing_paper":"/paper/2605.24660"},"observation_digest":"sha256:973e820d004c809c3db76a9a3951d9d25fdaf75726859752b46a6988434184fd","observation_id":"f21c91fd-9504-4766-893a-5502410ec697","resolution":{"observed_at":"2026-06-30T12:24:39.606040Z","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":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"cited_work":{"arxiv_id":"2508.09497","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2508.09497","snapshot_observed_at":"2026-07-02T20:17:21.469409Z","title":"From ranking to selection: A simple but efficient dynamic passage selector for retrieval augmented generation","venue":null,"work_id":"4ef17b35-593e-40e7-828b-7ea205b59cca","year":2025},"citing_paper":{"arxiv_id":"2606.07235","last_updated":"2026-06-08T12:31:09Z","snapshot_observed_at":"2026-07-06T23:46:55.970997Z","submitted_at":"2026-06-05T13:05:00Z","title":"FLOWREADER: Min-Cost Flow Optimization for Multi-Modal Long Document Q&A","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-06-27T20:47:31.149251Z"},"links":{"cited_paper":"/paper/2508.09497","citing_paper":"/paper/2606.07235"},"observation_digest":"sha256:435574fa304880fa3cf4b76be343f17d2fd080876a9035600cd2e6d48b631733","observation_id":"641513f4-4cc7-4ca0-b8e8-34448e0a81e2","resolution":{"observed_at":"2026-07-02T20:17:21.471071Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2508.09497/citation-record","integrity":"/paper/2508.09497/integrity","json":"/paper/2508.09497/citation-record.json","paper":"/paper/2508.09497"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:53.665505Z","title":", \" * write output.state after.block = add.period write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:53.665505Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:5d0dc411a282be57b2fe948c05e741a7d48c06a69291cce8934b1305c8b5d7c0","observation_id":"0fd3e83a-9f49-4c2a-8aa6-1649e3b71c35","resolution":{"observed_at":"2026-08-05T21:01:53.665505Z","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-05T21:01:53.696544Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:53.696544Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:7281d8c8f3ad42d79e6541f79827c8efb36018bf3b32e76cd346ba4b153aa021","observation_id":"29cf194a-7ed2-4495-8dd5-9d7e40c2eda8","resolution":{"observed_at":"2026-08-05T21:01:53.696544Z","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-05T21:01:55.733875Z","title":"F.; Craswell, N.; Deng, L.; Gao, J.; Liu, X.; Majumder, R.; McNamara, A.; Mitra, B.; Nguyen, T","venue":null,"work_id":"6049cd03-2257-4d93-86a6-5ca66dc34cb0","year":2016},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:53.748536Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:005648cb001b610c671e50d31a5311eb4e8f26e44942edcdbc54a56c7f735daa","observation_id":"bbfaed54-3cee-4c21-9adf-a222c25400f4","resolution":{"observed_at":"2026-08-05T21:01:55.738390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2402.03216","last_updated":"2025-12-12T11:26:32Z","snapshot_observed_at":"2026-07-06T17:25:35.493362Z","submitted_at":"2024-02-05T17:26:49Z","title":"M3-Embedding: Multi-Linguality, Multi-Functionality, Multi-Granularity Text Embeddings Through Self-Knowledge Distillation","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03216","snapshot_observed_at":"2026-08-05T21:01:53.803914Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:53.803914Z"},"links":{"cited_paper":"/paper/2402.03216","citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:722febfce6375bf1179ae4bb290302dff08b691c6a283a281155bdd122fd4806","observation_id":"b9016d8e-2d50-4908-871f-e313e65a3ac8","resolution":{"observed_at":"2026-08-05T21:01:53.803914Z","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-05T21:01:55.720047Z","title":null,"venue":null,"work_id":"f285f023-fb6b-46d8-b8ca-8187998a8b09","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:53.901381Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:9b0b418cf57a24c4a0424b9f87df7cacf04c91ec5a09ed435b52120506fdcf24","observation_id":"9736797a-da24-4d21-b229-fe02b3894a44","resolution":{"observed_at":"2026-08-05T21:01:55.724183Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.705699Z","title":null,"venue":null,"work_id":"58e8c973-4d09-49fe-a8fa-448d4303f856","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:53.953949Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:7e3713f42790d5b82374bca06e7c957080bdce467399b0f259ffaaaee022d22c","observation_id":"c0e9bf8f-431c-4343-9c90-f70c79901a50","resolution":{"observed_at":"2026-08-05T21:01:55.710630Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.691951Z","title":null,"venue":null,"work_id":"fd89e1bf-2fcf-41bf-a720-0d1cd0ffd821","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.013658Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:e3b7a3a06e562d4e20afc2a4ca4e128fbca3e1f44a1130936c142179cc7a1567","observation_id":"71bfcd96-7efd-4264-89ae-cc5f4b43246c","resolution":{"observed_at":"2026-08-05T21:01:55.695958Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.16130","snapshot_observed_at":"2026-08-05T21:01:54.064023Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.064023Z"},"links":{"cited_paper":"/paper/2404.16130","citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:290e2f7b1d502e8c688cafa43c91889b5dd3777912cbdd3c919afd3a5ecf734b","observation_id":"6bd7e674-beff-43c4-8434-1cd532dc770b","resolution":{"observed_at":"2026-08-05T21:01:54.064023Z","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-05T21:01:55.676820Z","title":null,"venue":null,"work_id":"426b8cd5-d43d-4f8a-94c1-e0398602af00","year":2025},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.134890Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:ae9e97059e6188184a8ecc15f3b5d2b19c3a1cc90a2e0d07ccb5b7d4280c21e7","observation_id":"88e08036-c4ac-407c-a316-9544fbfbc15e","resolution":{"observed_at":"2026-08-05T21:01:55.681585Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.660941Z","title":"A.; and Proença, H","venue":null,"work_id":"53ed38c3-b2d3-47fa-aaf8-77b4b27bb5b8","year":2023},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.225753Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:9391efdc04e5ddd42fc7ccfb56ee8013a3527dcb709d93e539dfc94e284a58df","observation_id":"fa3e6592-92c5-4394-9cd1-6466e6ef6c10","resolution":{"observed_at":"2026-08-05T21:01:55.665121Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":{"arxiv_id":"2011.01060","last_updated":"2020-11-12T07:47:48Z","snapshot_observed_at":"2026-07-06T10:10:56.466018Z","submitted_at":"2020-11-02T15:42:40Z","title":"Constructing A Multi-hop QA Dataset for Comprehensive Evaluation of Reasoning Steps","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.01060","snapshot_observed_at":"2026-08-05T21:01:54.268174Z","title":"D.; Sugawara, S.; and Aizawa, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.268174Z"},"links":{"cited_paper":"/paper/2011.01060","citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:3a7b73c557d18e117d8e7b88aa6fab7fab03c6256ee4939dacc6646fc64a097c","observation_id":"7aa075bc-2c36-413a-8e52-3d98c125f4a6","resolution":{"observed_at":"2026-08-05T21:01:54.268174Z","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-05T21:01:55.646662Z","title":null,"venue":null,"work_id":"6112e10c-4633-4393-af4b-c347ca60eb28","year":2025},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.325761Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:cd4512c37fccc9170aeeb17f1bcc591e834448e68a5072da81ceee228701ccf0","observation_id":"0fb2a819-7335-4505-a073-613adcbcf4a2","resolution":{"observed_at":"2026-08-05T21:01:55.650805Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.632091Z","title":"u ttler, H.; Lewis, M.; Yih, W.-t.; Rockt\\","venue":null,"work_id":"5f72ec15-bb55-4a1c-bf0c-20c4e7eea134","year":2020},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.386721Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:22c078878d8f3e9e51a46d410bbd025da4e56a0f08cd6768e2dff04a19c75a13","observation_id":"8ea59922-68f3-41fd-ad9c-b1b1a3d0c2e7","resolution":{"observed_at":"2026-08-05T21:01:55.636295Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.618499Z","title":null,"venue":null,"work_id":"96994f7e-1759-469a-bda0-c1bf1e1dfdeb","year":2023},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.475089Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:19b33064e413b5e5987a451d3dea23d67a45afcf4e433ad141cb2b13a5d04b26","observation_id":"dadb02dc-0a37-4600-87bd-bb7674c413c2","resolution":{"observed_at":"2026-08-05T21:01:55.622666Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.603942Z","title":null,"venue":null,"work_id":"6c3d0894-1708-4cc0-9399-462703d66260","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.566896Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:ec5eddfe6a504e6043db88474caa86b2fdcb8946a14c33f65a0b488ba4657319","observation_id":"9322b70a-e485-4ed4-9dc5-6f6440f9730d","resolution":{"observed_at":"2026-08-05T21:01:55.608434Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08-05T21:01:54.645635Z","title":"D.; Re, C.; Acosta-Navas, D.; Hudson, D","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.645635Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:a9555cc3bcd2c57512d147a7858a22cef83c778a2a0b767d1693d370af5d1b40","observation_id":"859589fb-9aa6-4ea4-9edd-eb1a3a6184e3","resolution":{"observed_at":"2026-08-05T21:01:54.645635Z","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-05T21:01:55.580066Z","title":null,"venue":null,"work_id":"20d27fef-ffa8-4155-b6e0-098506780e64","year":2021},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.712486Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:7df24915a3cfbd49356f70d4021439619509dcc82f871cd853ab777a2e84c9a4","observation_id":"92c210d6-7dbc-4293-9bf9-448eb605294a","resolution":{"observed_at":"2026-08-05T21:01:55.584289Z","resolver_source":"raw_fallback","status":"unresolved"},"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-08-05T21:01:54.782476Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.782476Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:ac49e59da1316f3bda110d4d51a90a1941fffd23df7d507ffbfeb2f9d24b159e","observation_id":"0684e14b-0a49-4790-9759-978145b3d1af","resolution":{"observed_at":"2026-08-05T21:01:54.782476Z","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-05T21:01:55.565948Z","title":null,"venue":null,"work_id":"83282f53-f3da-4e0d-8c01-a87805b6b6fd","year":2025},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.855413Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:2e447654ceaf7c0b02bffce5dec739001f2621caec69656cd56d585827f41ebb","observation_id":"8ee7cd55-50b0-4bdc-99dd-802327ea1d4a","resolution":{"observed_at":"2026-08-05T21:01:55.570302Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.552231Z","title":null,"venue":null,"work_id":"ff9d946b-cb5b-4283-b551-9b987b93b198","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.907016Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:88bffad1c1169f58be19a8564206d82ce58554a9e9087267f7db590ec07cb782","observation_id":"6ea73005-304b-44f9-bf18-79052678fa05","resolution":{"observed_at":"2026-08-05T21:01:55.556490Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2305.02156","last_updated":"2023-05-03T14:45:34Z","snapshot_observed_at":"2026-08-07T22:52:50.160521Z","submitted_at":"2023-05-03T14:45:34Z","title":"Zero-Shot Listwise Document Reranking with a Large Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02156","snapshot_observed_at":"2026-08-05T21:01:54.911786Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.911786Z"},"links":{"cited_paper":"/paper/2305.02156","citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:5ea7286f14e7b4fd7e3e0b0a9c848556bd196552323e228481e839a8ad51d9aa","observation_id":"052a49b4-8e66-47d4-b6e1-f743fd81b8d7","resolution":{"observed_at":"2026-08-05T21:01:54.911786Z","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-05T21:01:55.537732Z","title":null,"venue":null,"work_id":"24bb6311-5b80-4b8e-b4e3-6f3a07699a80","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.916642Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:664f571ef1d4dda6374fc1c0f5567c0af13b2570fea1836fac95fb33046038cb","observation_id":"73d05096-ec5b-48dc-8214-f5f062473f62","resolution":{"observed_at":"2026-08-05T21:01:55.541939Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.523262Z","title":null,"venue":null,"work_id":"56684730-37bc-4ee0-bbf7-9a7cab7274c6","year":2020},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.920801Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:e2a483f35688c8692140425221187aa056ffe62b1dec346d39d2ee76e5d2fa14","observation_id":"40e23922-aad4-4ca4-aa27-10b788e048f9","resolution":{"observed_at":"2026-08-05T21:01:55.527474Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.510365Z","title":null,"venue":null,"work_id":"527a218a-a12c-4332-b41e-6606dfb33613","year":2020},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.924883Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:8e945d8cd90165b5824bfdc495db4474a251bc4cb8e03d3ccd1f2bcefa5e24ec","observation_id":"2668c721-84e1-4b33-bbe0-ca41f86149e4","resolution":{"observed_at":"2026-08-05T21:01:55.514323Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.496572Z","title":null,"venue":null,"work_id":"99f5a8b6-15f4-4219-96e2-03cd60f474f4","year":2025},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.928894Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:b475e8c5090b70583eb38a729e6015c7b2e8b5debfaadb7c5a83b31fbdb90d3f","observation_id":"5faa7ca1-13ae-463a-90bd-96e47fdd97b8","resolution":{"observed_at":"2026-08-05T21:01:55.501011Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2309.15088","last_updated":"2023-09-26T17:31:57Z","snapshot_observed_at":"2026-07-06T16:23:57.143116Z","submitted_at":"2023-09-26T17:31:57Z","title":"RankVicuna: Zero-Shot Listwise Document Reranking with Open-Source Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2309.15088","snapshot_observed_at":"2026-08-05T21:01:54.932781Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.932781Z"},"links":{"cited_paper":"/paper/2309.15088","citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:35ff42cd5905e37c00c1a932144ea040ca25ccb09c990d3c57b2a7bfbf4975a4","observation_id":"4240758f-19c9-4d5d-bd8f-68b690ed6d0f","resolution":{"observed_at":"2026-08-05T21:01:54.932781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.02724","last_updated":"2023-12-05T12:39:00Z","snapshot_observed_at":"2026-07-06T16:57:09.664139Z","submitted_at":"2023-12-05T12:39:00Z","title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.02724","snapshot_observed_at":"2026-08-05T21:01:54.937347Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.937347Z"},"links":{"cited_paper":"/paper/2312.02724","citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:039daccb9766ae8e13c633413ad1d65e503ad30a3673f3a3ea9c668a2613c89f","observation_id":"f9b3f7af-e398-44a5-a48b-92bfa7a1a0e6","resolution":{"observed_at":"2026-08-05T21:01:54.937347Z","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-05T21:01:55.483096Z","title":null,"venue":null,"work_id":"b8022986-0165-44b6-accf-2398b65194bf","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.941787Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:97828bcc5d78f34bde03382edf7aaefdb68ee661c1f93356ef1510ce6e5447ac","observation_id":"bae60f4f-22d4-4020-8062-4466dd6865ae","resolution":{"observed_at":"2026-08-05T21:01:55.487111Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.469489Z","title":null,"venue":null,"work_id":"3b24ae4c-0f41-479c-b8b5-84904036145b","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.945583Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:16899889f38726dd65915b1a841d84d5e3f184e239bb868b9583ca04923d06cb","observation_id":"a64d8485-8662-4876-94d6-c0425aaa1eb0","resolution":{"observed_at":"2026-08-05T21:01:55.473754Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.454767Z","title":"E.; Walker, S.; Jones, S.; Hancock-Beaulieu, M","venue":null,"work_id":"54f4c67a-e321-4e67-8e0f-a17052bbf85d","year":1995},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.949507Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:4eed6f5c38026e4e8878f91b74f0a7cacd0f128a5aa76b768513f1bff05bf203","observation_id":"26d1639c-d285-4216-8c8b-3f05f6904329","resolution":{"observed_at":"2026-08-05T21:01:55.459788Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.441291Z","title":"G.; Gaussier, E.; Li, M.; and Renders, J.-M","venue":null,"work_id":"6ee9a7a1-c0e7-4adf-bf28-7a9b13040978","year":2022},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.953525Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:e8bcd3c644a3fa04e68df386fbdb128e38c468e408e82e7c74f5de2054849571","observation_id":"bf4297d2-b0c8-4c9a-8440-eadd4f44c299","resolution":{"observed_at":"2026-08-05T21:01:55.445408Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.427757Z","title":null,"venue":null,"work_id":"cdc34cb6-0a19-4cac-8232-56121892b362","year":2022},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.957806Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:dce050583a699c39b832680b6eca3729e0bdfc85a853598dce1d42a5a83d149b","observation_id":"a8be383c-4e22-48c4-8be7-dad621fc90c9","resolution":{"observed_at":"2026-08-05T21:01:55.431961Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.414063Z","title":null,"venue":null,"work_id":"83535dcd-e693-4eed-bbcb-2a97999172b7","year":1999},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.961729Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:6c6d21a661a696d684d2f925b2f4595a434986ff7ba96aaf25c1a6134c721368","observation_id":"1bb488fe-5ebf-421f-a86c-25232a79517e","resolution":{"observed_at":"2026-08-05T21:01:55.418333Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.399888Z","title":"X.; Tu, X.; Wang, J.; Huang, A","venue":null,"work_id":"4adaed10-f840-4380-8509-e3f9ae51ad8f","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.965808Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:9be6ebcee3b95915fd97381f41b7412810332eed687beb9ec0be2ee67e4e5369","observation_id":"e099d892-7f7f-46ff-ba31-72dde7e850ff","resolution":{"observed_at":"2026-08-05T21:01:55.404390Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.385240Z","title":null,"venue":null,"work_id":"4762e94f-cf16-4b86-9f57-85992756bdfc","year":2025},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.970465Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:037ad5076318bfac1ea4f8f48fb133d4ce92238f75838c7477982f5190f08c93","observation_id":"d28f9c19-02cf-4565-b03b-cc689eb92eb4","resolution":{"observed_at":"2026-08-05T21:01:55.389808Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"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-05T21:01:54.974621Z","title":"W.; Salakhutdinov, R.; and Manning, C","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.974621Z"},"links":{"cited_paper":"/paper/1809.09600","citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:a98a0e11e1fdcd7192cd362d33d8639b1ffe1ee570c68476eaa61ef1c5ae976b","observation_id":"bbba07f4-5db6-4d42-99d8-689ba07645b6","resolution":{"observed_at":"2026-08-05T21:01:54.974621Z","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-05T21:01:55.371889Z","title":null,"venue":null,"work_id":"c768e702-ae56-4800-a9ab-806b6a9f253b","year":2021},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.978727Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:4c68d569af0b38dcb60848998923f6bf40624527503119ce55667a4fd590c86a","observation_id":"509188a2-8951-4909-a746-7555e6352b22","resolution":{"observed_at":"2026-08-05T21:01:55.375968Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.356705Z","title":null,"venue":null,"work_id":"04f1a565-407c-4ab0-94dc-f329679054bd","year":2018},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.982625Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:163d3e2e1ecb172b32625a453eaa19f6fc49eb4948a446d5174db5a69550a593","observation_id":"148f8a56-f4fc-4794-8b98-a11c35c9e653","resolution":{"observed_at":"2026-08-05T21:01:55.361594Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2407.02485","last_updated":"2024-07-02T17:59:17Z","snapshot_observed_at":"2026-08-07T22:02:41.295637Z","submitted_at":"2024-07-02T17:59:17Z","title":"RankRAG: Unifying Context Ranking with Retrieval-Augmented Generation in LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.02485","snapshot_observed_at":"2026-08-05T21:01:54.986520Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.986520Z"},"links":{"cited_paper":"/paper/2407.02485","citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:f430aa90ef989734a0ce0ef1363f0349f5c227f5d2d2a5a127c87f5f50453e3a","observation_id":"b6e0af97-b611-473b-8cc7-c6eae4c1234e","resolution":{"observed_at":"2026-08-05T21:01:54.986520Z","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-05T21:01:55.340831Z","title":"Q.; Guo, W.; Wang, H.; Li, Y.; Guo, H.; Liu, Y.; Lian, D.; and Chen, E","venue":null,"work_id":"55f72b3b-c9ba-4c35-bdbb-6457c05a544b","year":2025},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.990980Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:c981a8a6aab4cb2e611c8acf9d36189752a8a580f2acc7ecd668b16dbc2f8c01","observation_id":"9baa650e-0bcc-4d2b-9969-3639c76ecd39","resolution":{"observed_at":"2026-08-05T21:01:55.345137Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.326685Z","title":null,"venue":null,"work_id":"7cbebf4d-4fa6-4304-8735-bb56b35a51e5","year":2023},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.995398Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:c76f60e07ddd76dae357963ec3900776bde278f2748fecb8cb83c91025e00377","observation_id":"9ed6c8ea-7be1-4b70-9ae0-449d47ef6a9f","resolution":{"observed_at":"2026-08-05T21:01:55.330861Z","resolver_source":"raw_fallback","status":"unresolved"},"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":{"arxiv_id":"2506.05176","last_updated":"2025-06-11T02:54:49Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-06-05T15:49:48Z","title":"Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.05176","snapshot_observed_at":"2026-08-05T21:01:54.999703Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:54.999703Z"},"links":{"cited_paper":"/paper/2506.05176","citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:2a5511c3a4b86efc1cec561994e82fae830041d370326f066d54bc893344ddc7","observation_id":"b6211e31-d65d-43cb-9012-194a26aba94a","resolution":{"observed_at":"2026-08-05T21:01:54.999703Z","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-05T21:01:55.312185Z","title":null,"venue":null,"work_id":"c90c81da-c2bd-4890-b493-59a4a6d12d52","year":2023},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:55.004054Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:2e5fcc7941e07dec8bdb3643d0d533d8db67439007edce4138a8c775e8d21644","observation_id":"09902765-4cbc-438d-b114-fec356746553","resolution":{"observed_at":"2026-08-05T21:01:55.316441Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.296107Z","title":null,"venue":null,"work_id":"599d341f-ba3d-42e7-ae89-a7aa7a53dce7","year":2024},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:55.008523Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:887d714627d1f28766b9c90b8c90545025b35d80e824ada093f435efab3f53f2","observation_id":"f3d9e065-3c19-4576-aa48-3ce1f8dfc7aa","resolution":{"observed_at":"2026-08-05T21:01:55.300776Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T21:01:55.280180Z","title":null,"venue":null,"work_id":"037a414d-5044-494f-b3db-8643bc57d75b","year":2025},"citing_paper":{"arxiv_id":"2508.09497","last_updated":"2025-08-13T05:05:34Z","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-05T21:01:55.012735Z"},"links":{"citing_paper":"/paper/2508.09497"},"observation_digest":"sha256:637155ae1b25119f822293936e2673bd609cfb3122e7924d751a2dc518c57ae6","observation_id":"cfb4c94e-3243-42d7-a24a-fe8606e11584","resolution":{"observed_at":"2026-08-05T21:01:55.285217Z","resolver_source":"raw_fallback","status":"unresolved"},"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":"2508.09497","last_updated":"2025-08-13T05:05:34Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T22:02:44.475024Z","submitted_at":"2025-08-13T05:05:34Z","title":"From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation"},"reference_resolution":{"displayed":45,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":38,"verified_exact":0,"verified_fuzzy":7},"total_outbound_references":45},"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 45 of 45 outbound references and 3 inbound Pith citation observations for arXiv:2508.09497."}