{"as_of":"2026-08-08T02:14:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d126894575c65397b20c0359d4fa80943ff53d05018a00e362d909f9c229063e","coverage":[{"denominator":56,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":56,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:14:49.782702Z","state":"measured"},{"denominator":57,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":57,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:23:22.052677Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T06:16:28.064256Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"cited_work":{"arxiv_id":"2505.16014","doi":"10.48550/arxiv.2505.16014","metadata_source":"pith","pith_arxiv_id":"2505.16014","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","venue":"cs.CL","work_id":"87402ae0-284c-42b8-92d9-4f656aa8aab3","year":2025},"citing_paper":{"arxiv_id":"2507.00355","last_updated":"2025-07-01T01:01:54Z","snapshot_observed_at":"2026-08-06T21:15:48.959874Z","submitted_at":"2025-07-01T01:01:54Z","title":"Question Decomposition for Retrieval-Augmented Generation","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T21:23:22.052677Z"},"links":{"cited_paper":"/paper/2505.16014","citing_paper":"/paper/2507.00355"},"observation_digest":"sha256:97ce8957ae9eb5440d962ee78ec8e8fad7fd8463dfed281b09de881905cf7f82","observation_id":"3ecf6f00-53bc-409d-ba4f-26cefd33541b","resolution":{"observed_at":"2026-08-06T21:23:23.751107Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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"}}],"links":{"evidence":"/evidence","html":"/paper/2505.16014/citation-record","integrity":"/paper/2505.16014/integrity","json":"/paper/2505.16014/citation-record.json","paper":"/paper/2505.16014"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.06300","last_updated":"2022-07-13T15:51:40Z","snapshot_observed_at":"2026-08-07T18:35:09.177735Z","submitted_at":"2022-07-13T15:51:40Z","title":"Re2G: Retrieve, Rerank, Generate","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.06300","snapshot_observed_at":"2026-08-07T15:14:44.768560Z","title":"Re2g: Retrieve, rerank, generate","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:44.768560Z"},"links":{"cited_paper":"/paper/2207.06300","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:5ed531935a9388d29fa21b112ecbcf0d097d4c6e4d6b85f773853604c8cbdd80","observation_id":"2dac81df-74c9-4720-bb49-d08fedf386b6","resolution":{"observed_at":"2026-08-07T15:14:44.768560Z","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-07T15:14:56.431638Z","title":"Sentence-bert: Sentence embeddings using siamese bert-networks","venue":null,"work_id":"01cec51e-250d-4b59-a113-f29836f7dd1d","year":2019},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:44.826674Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:4fd45d490f67e7c26dc5c7c4971df6a9df795b76134513215f5faec16f556877","observation_id":"9b68f71f-d093-4d16-847b-d407dae8fa19","resolution":{"observed_at":"2026-08-07T15:14:56.540241Z","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-07T15:14:56.256834Z","title":"Bert: Pre-training of deep bidirectional transformers for language understanding","venue":null,"work_id":"44aa01b4-993d-4e76-9883-67676f2b0da8","year":2019},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:44.866425Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:0e796de568859c6181af63b7ebec67f4e6b06363db93d6dd688d2b63d145537f","observation_id":"eb8dcca2-ce90-474e-bec3-4b6de8a5bac1","resolution":{"observed_at":"2026-08-07T15:14:56.343716Z","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-07T15:14:56.098678Z","title":"The trustworthiness of retrieval-augmented generation systems","venue":null,"work_id":"d3e81ab4-27b9-4d15-b068-3cbebb10dab8","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:44.982108Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:917ee86659e0ff7d7f7e1670e323ac2dd373013cc078e435444515f70cd73bf9","observation_id":"13defade-5629-4a59-8f79-fa8cfdcb5316","resolution":{"observed_at":"2026-08-07T15:14:56.167980Z","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-07T15:14:55.928435Z","title":"Domain-specific retrieval-augmented generation using expert-tuned llms","venue":null,"work_id":"2cdd9afa-f1b9-4f2b-829a-9a6201ba6a08","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.050012Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:4a935d18c6701cf0bdeefe7a3440180dfc0c053c04994352e615238e302fffb2","observation_id":"3cd4533d-7947-4aa6-8fd0-5f0cba2390b3","resolution":{"observed_at":"2026-08-07T15:14:56.019132Z","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":"2402.07867","last_updated":"2024-08-13T01:55:06Z","snapshot_observed_at":"2026-07-06T17:29:05.185768Z","submitted_at":"2024-02-12T18:28:36Z","title":"PoisonedRAG: Knowledge Corruption Attacks to Retrieval-Augmented Generation of Large Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.07867","snapshot_observed_at":"2026-08-07T15:14:45.122719Z","title":"Poisonedrag: Knowledge poisoning attacks to retrieval-augmented generation of large language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.122719Z"},"links":{"cited_paper":"/paper/2402.07867","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:da7372c38d6f316c225d5617d9b8316581d617234d478571c0a7a5f5252b89ac","observation_id":"f1b3446c-fa44-43ca-8929-8b1581af798e","resolution":{"observed_at":"2026-08-07T15:14:45.122719Z","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-07T15:14:55.748326Z","title":"Poison-rag: Adversarial data poisoning attacks on retrieval-augmented generation in recommender systems","venue":null,"work_id":"50eb21f7-03ba-48de-be32-1092c387b975","year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.196651Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:a793c4326a73382c251229cd2a7678eb6a4fda4d6e90cc887dd5dc43d1e11770","observation_id":"cae998a1-3683-432b-b716-2868fe6911e1","resolution":{"observed_at":"2026-08-07T15:14:55.831887Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:14:45.275027Z","title":"Phantom: General trigger attacks on retrieval augmented language generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.275027Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:65fdb2e0d5d9bdc2efe56424515563c38acd2ba02b29759c73425af71be5918f","observation_id":"2153e700-0029-45de-873c-4883c5b93f90","resolution":{"observed_at":"2026-08-07T15:14:45.275027Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.00281","last_updated":"2025-05-30T22:22:05Z","snapshot_observed_at":"2026-08-07T12:06:22.635673Z","submitted_at":"2025-05-30T22:22:05Z","title":"Adversarial Threat Vectors and Risk Mitigation for Retrieval-Augmented Generation Systems","version":1},"cited_work":{"arxiv_id":"2506.00281","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.00281","snapshot_observed_at":"2026-08-07T15:14:51.485538Z","title":"Adversarial Threat Vectors and Risk Mitigation for Retrieval-Augmented Generation Systems","venue":"cs.CR","work_id":"e473b0f8-07c9-46a9-9520-24d8e8abf019","year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.340582Z"},"links":{"cited_paper":"/paper/2506.00281","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:74873529b1cd064519ea2db702ffb77ee359569f7c44885daa206eea01535727","observation_id":"8a1afa82-2e9a-4833-80b1-567215b9281d","resolution":{"observed_at":"2026-08-07T15:14:51.551953Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-07T15:14:55.609775Z","title":"Rag data poisoning: Key concepts explained","venue":null,"work_id":"61121181-93ac-46f2-b9e8-d677cef9961f","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.423567Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:d4d56f26335e3f6bb1caa74806f118cd0d60eb476a2ce012873969a8c0fa621b","observation_id":"e2a92b18-5d39-4938-bcab-e00ac7e511fc","resolution":{"observed_at":"2026-08-07T15:14:55.678756Z","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-07T15:14:55.450890Z","title":"Rag poisoning in enterprise knowledge sources","venue":null,"work_id":"4f04aefe-493c-46a1-956d-88587cc060dc","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.520053Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:87e57d7356738f33c7d30ae397a3c8b9d5ddf828ae22dde8f4e691f9f31bfc81","observation_id":"fb136412-a8b2-4f6a-a03b-53a2b5b5f715","resolution":{"observed_at":"2026-08-07T15:14:55.533728Z","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-07T15:14:55.286118Z","title":"Rationale-guided retrieval augmented generation for medical question answering","venue":null,"work_id":"155ba70a-4f36-4dd5-8644-51aa6c1c7357","year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.587912Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:82a21e326eb0c2336fea721cd406bc3b80ad83c418cc7db3065efbaa0864d005","observation_id":"4de707b1-06c0-4c52-a2d9-6a74125a7f3e","resolution":{"observed_at":"2026-08-07T15:14:55.370649Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:14:45.663549Z","title":"Bridging relevance and reasoning: Rationale distillation in retrieval-augmented generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.663549Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:3643e7f90d6f1e0571e8bfebcaca5efccd56ce674d87d3db35175c6e9aa4743c","observation_id":"2bde3e47-1ed7-4d41-861b-afe069855647","resolution":{"observed_at":"2026-08-07T15:14:45.663549Z","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-07T15:14:55.104916Z","title":"Rankrag: Unifying context ranking with retrieval-augmented generation in llms","venue":null,"work_id":"91be3441-332b-4172-9d64-2107ee893823","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.723981Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:01ece2495b61c05fda9e6ca37265ed4873d24f8cc3928ae87772bd8e45c463bc","observation_id":"5f29f894-ee4a-4e2c-a853-4141de72abf3","resolution":{"observed_at":"2026-08-07T15:14:55.180986Z","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-07T15:14:54.915373Z","title":"Chain-of-thought prompting elicits reasoning in large language models","venue":null,"work_id":"39f81101-feb7-42c4-8973-7f228a29852d","year":2022},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.819241Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:409e8b018d9c13388fec78f95ba0ed6613ad48ac0b779d0307f2e2f98ac1d7d3","observation_id":"27eaa8a5-3c50-4543-b6ae-c045ad3758a9","resolution":{"observed_at":"2026-08-07T15:14:55.032427Z","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-07T15:14:54.765034Z","title":"Cotever: Chain of thought prompting annotation toolkit for explanation verification","venue":null,"work_id":"ec33b162-d131-4072-87c7-8097cd73539c","year":2023},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.909507Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:200e8c6a7b805bd472f14866c17fbdf680faa4ea43efbb01b0ca98535dc8362f","observation_id":"82df4756-fd17-456e-b90e-8466b0683d1c","resolution":{"observed_at":"2026-08-07T15:14:54.828808Z","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-07T15:14:54.588030Z","title":"annotator rationales","venue":null,"work_id":"dfc5c08d-3cfc-4076-b864-ff83d0a10064","year":2007},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:45.982085Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:37d696da38ff6811e8c8f122b5f58d54f4926414f312f442f61c2d7916170058","observation_id":"cc958856-5143-4597-b32a-66fb86b7329c","resolution":{"observed_at":"2026-08-07T15:14:54.680743Z","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-07T15:14:54.399584Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":"d2969ce7-47d7-4a8b-a679-2bcde6d13a8f","year":2023},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.075580Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:4c2540a842dee8dda6e30ad3e3982c908a36a4d008ad10dfa28d4f172eef4cdb","observation_id":"268276eb-4327-4cbe-b2c2-a0b6e6a85c56","resolution":{"observed_at":"2026-08-07T15:14:54.489434Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:14:46.083972Z","title":"The impact of chunking strategies on domain-specific information retrieval in rag systems","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.083972Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:61d5cc57aa837704e8ae52c77d27a467d1a21e772563249d7eb7664020275f6b","observation_id":"25ea17b2-2484-4b94-945f-9d687ed91da5","resolution":{"observed_at":"2026-08-07T15:14:46.083972Z","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-07T15:14:54.209328Z","title":"Gulavani, Alexey Tumanov, and Ramachandran Ramjee","venue":null,"work_id":"a3b01744-a8d9-417c-823a-6da8d6e4a221","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.152809Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:2b36f39f3b80d382415a9748cb262015220e5c8d231e7e3b1969fa775f6e0d15","observation_id":"85378d80-3868-4235-8c4f-db6770b5ed94","resolution":{"observed_at":"2026-08-07T15:14:54.299650Z","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":"2302.12173","last_updated":"2023-05-05T14:26:17Z","snapshot_observed_at":"2026-07-06T14:55:08.682906Z","submitted_at":"2023-02-23T17:14:38Z","title":"Not what you've signed up for: Compromising Real-World LLM-Integrated Applications with Indirect Prompt Injection","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.12173","snapshot_observed_at":"2026-08-07T15:14:46.317226Z","title":"Not what you've signed up for: Compromising LLM -integrated applications via indirect prompt injection","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.317226Z"},"links":{"cited_paper":"/paper/2302.12173","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:3d120732a9525d46954382cb3c9940c9b2ec525861aab7a3d883ac45a365c37d","observation_id":"ab7e62ad-0816-4590-bc33-f2d49ddecaa1","resolution":{"observed_at":"2026-08-07T15:14:46.317226Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2312.14197","last_updated":"2025-01-27T08:51:16Z","snapshot_observed_at":"2026-07-06T17:06:45.522731Z","submitted_at":"2023-12-21T01:08:39Z","title":"Benchmarking and Defending Against Indirect Prompt Injection Attacks on Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.14197","snapshot_observed_at":"2026-08-07T15:14:46.395816Z","title":"Benchmarking and defending against indirect prompt injection attacks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.395816Z"},"links":{"cited_paper":"/paper/2312.14197","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:5e026a9fe8b750f2d5ff39755ad8281753f0a60e286c92fbb50e408c642a49ad","observation_id":"ed10cf18-6a79-4b5b-bef3-d9087450a1c8","resolution":{"observed_at":"2026-08-07T15:14:46.395816Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14479","last_updated":"2024-10-18T14:02:34Z","snapshot_observed_at":"2026-07-06T19:35:57.222956Z","submitted_at":"2024-10-18T14:02:34Z","title":"Backdoored Retrievers for Prompt Injection Attacks on Retrieval Augmented Generation of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14479","snapshot_observed_at":"2026-08-07T15:14:46.434090Z","title":"Backdoored retrievers for prompt injection attacks on retrieval-augmented generation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.434090Z"},"links":{"cited_paper":"/paper/2410.14479","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:10816e16412e931de050a2c646434b4e3e4dc66076611a001abd9e98566588a9","observation_id":"1d6661f3-e445-4b1e-ae63-a333c08723e9","resolution":{"observed_at":"2026-08-07T15:14:46.434090Z","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-07T15:14:54.004961Z","title":"Gasliteing the retrieval: Poisoning knowledge dbs to game embedding-based search","venue":null,"work_id":"8843db36-d468-4bcc-9f73-fc43b9e708cf","year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.533488Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:2de770861cf3f7728e3e2573c131df9a14cb2069c5cbe30508f1f473c30db5bf","observation_id":"fce64b30-36c3-4011-bfbd-a522f21aeb00","resolution":{"observed_at":"2026-08-07T15:14:54.107480Z","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-07T15:14:53.786867Z","title":"Analyzing adversarial attacks on sequence-to-sequence relevance models","venue":null,"work_id":"d046bc95-7152-4e1b-a84c-fd5cf43c4369","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.640287Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:ca02d0004c174fd2a85773d14fb78fdc1e67f15c4a04ee9ede4f3bc7899e20c2","observation_id":"59700bd5-8db2-4ac9-bb5c-5777e5ae17d0","resolution":{"observed_at":"2026-08-07T15:14:53.889498Z","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":"2110.01799","last_updated":"2021-10-05T03:22:31Z","snapshot_observed_at":"2026-08-04T11:56:17.075426Z","submitted_at":"2021-10-05T03:22:31Z","title":"ContractNLI: A Dataset for Document-level Natural Language Inference for Contracts","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.01799","snapshot_observed_at":"2026-08-07T15:14:46.769058Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.769058Z"},"links":{"cited_paper":"/paper/2110.01799","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:7ea7d0223f620dd433a9c3fc6f7ff09469e8dcbe885ba8b4210ee904616bb899","observation_id":"95b571e5-92e5-4e29-a18d-a09990dce0cf","resolution":{"observed_at":"2026-08-07T15:14:46.769058Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.00841","last_updated":"2019-11-03T06:25:17Z","snapshot_observed_at":"2026-08-06T07:53:30.048185Z","submitted_at":"2019-11-03T06:25:17Z","title":"Question Answering for Privacy Policies: Combining Computational and Legal Perspectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1911.00841","snapshot_observed_at":"2026-08-07T15:14:46.873908Z","title":"Question answering for privacy policies: Combining computational and legal perspectives, 2019","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:46.873908Z"},"links":{"cited_paper":"/paper/1911.00841","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:71529ea34d81e4d59c73e3db79868ab07d86ac653d0c9955c019eef5106a8bd6","observation_id":"50e3f1db-29cc-4a5e-a069-69e1dd0027ac","resolution":{"observed_at":"2026-08-07T15:14:46.873908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.06268","last_updated":"2021-11-08T21:23:22Z","snapshot_observed_at":"2026-07-06T10:48:42.637397Z","submitted_at":"2021-03-10T18:59:34Z","title":"CUAD: An Expert-Annotated NLP Dataset for Legal Contract Review","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.06268","snapshot_observed_at":"2026-08-07T15:14:47.025028Z","title":"Cuad: An expert-annotated nlp dataset for legal contract review, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.025028Z"},"links":{"cited_paper":"/paper/2103.06268","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:76e26786adef30dd78364b895db0f2dd583bcd34ef592efb18b877383f574842","observation_id":"c6fdb067-008a-49a6-b863-f56ac4e0dfc1","resolution":{"observed_at":"2026-08-07T15:14:47.025028Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.10343","last_updated":"2024-08-19T18:30:18Z","snapshot_observed_at":"2026-07-06T19:03:09.004554Z","submitted_at":"2024-08-19T18:30:18Z","title":"LegalBench-RAG: A Benchmark for Retrieval-Augmented Generation in the Legal Domain","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.10343","snapshot_observed_at":"2026-08-07T15:14:47.100923Z","title":"Legalbench-rag: A benchmark for retrieval-augmented generation in the legal domain","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.100923Z"},"links":{"cited_paper":"/paper/2408.10343","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:3a1c7d85af1bfa4e49d6cd89638afec9f93ac27efc76eb715b572687b66af3d6","observation_id":"06a65c60-3484-4980-ba3a-55c9fcf0124f","resolution":{"observed_at":"2026-08-07T15:14:47.100923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.00122","last_updated":"2022-05-07T07:52:39Z","snapshot_observed_at":"2026-07-06T11:43:15.244747Z","submitted_at":"2021-09-01T00:08:14Z","title":"FinQA: A Dataset of Numerical Reasoning over Financial Data","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.00122","snapshot_observed_at":"2026-08-07T15:14:47.193446Z","title":"Finqa: A dataset of numerical reasoning over financial data","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.193446Z"},"links":{"cited_paper":"/paper/2109.00122","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:c752f7e4296550b6388cccab2d0f93ed3f6a086fe7370b376d56ffef105bb4cb","observation_id":"56224012-c7c0-4827-816d-66da43c7d919","resolution":{"observed_at":"2026-08-07T15:14:47.193446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.03011","last_updated":"2021-05-07T00:12:34Z","snapshot_observed_at":"2026-08-05T23:00:05.031488Z","submitted_at":"2021-05-07T00:12:34Z","title":"A Dataset of Information-Seeking Questions and Answers Anchored in Research Papers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.03011","snapshot_observed_at":"2026-08-07T15:14:47.281030Z","title":"A dataset of information-seeking questions and answers anchored in research papers","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.281030Z"},"links":{"cited_paper":"/paper/2105.03011","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:70dce6a32c796aa61da8a147b0f940a25b18c41cde67086c7293f92d3f50233c","observation_id":"cd370a05-548a-486d-9101-e88720774321","resolution":{"observed_at":"2026-08-07T15:14:47.281030Z","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-07T15:14:53.551377Z","title":"cross-encoder/ms-marco- M ini L M - L 4-v2 · H ugging F ace --- huggingface.co","venue":null,"work_id":"994f1817-10db-40a0-b290-355318b8c74b","year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.350038Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:edab582c8078b3c2b0dca33adba7e7a9a28ce663c9306b100bf9433ac71c0868","observation_id":"ff1f4d0d-c5e4-4ec5-b88b-411b4e3b9b82","resolution":{"observed_at":"2026-08-07T15:14:53.678187Z","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":"2112.09118","last_updated":"2022-08-29T12:17:32Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-12-16T18:57:37Z","title":"Unsupervised Dense Information Retrieval with Contrastive Learning","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2112.09118","snapshot_observed_at":"2026-08-07T15:14:47.413832Z","title":"Unsupervised dense information retrieval with contrastive learning, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.413832Z"},"links":{"cited_paper":"/paper/2112.09118","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:f9b5d03be855c028b782dcb6dd4cba0a3876199067445dc3784751080fa4d37e","observation_id":"4d00f422-3aef-4f1e-8399-5f9bcd7c177a","resolution":{"observed_at":"2026-08-07T15:14:47.413832Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.10084","last_updated":"2019-08-27T08:50:17Z","snapshot_observed_at":"2026-07-06T08:17:05.681370Z","submitted_at":"2019-08-27T08:50:17Z","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.10084","snapshot_observed_at":"2026-08-07T15:14:47.478962Z","title":"Sentence-bert: Sentence embeddings using siamese bert-networks, 2019 b","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.478962Z"},"links":{"cited_paper":"/paper/1908.10084","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:57daf6263e966b71eb3557c1cbdee5efb6482aa0153577fd4a9a81a3966720b7","observation_id":"9fb8a419-8e03-4375-ab60-7640f1d90290","resolution":{"observed_at":"2026-08-07T15:14:47.478962Z","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-07T15:14:53.343931Z","title":"S tern5497/sbert-legal-xlm-roberta-base · H ugging F ace --- huggingface.co","venue":null,"work_id":"41db023e-f93e-4ec1-8fc5-4759630495fb","year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.560354Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:030904c0112ceeadece5b7fec213b12d7eb44526c595075c5ced94faf463d309","observation_id":"50e523ab-aaca-4e20-b26a-17c9b6ee58c0","resolution":{"observed_at":"2026-08-07T15:14:53.469938Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:14:47.649393Z","title":"Fine-tuning llama for multi-stage text retrieval","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.649393Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:321f215f03083d0b91077fae91a438b50298d033b7c7a4fc7aa4893ca221b8a8","observation_id":"32f1aca7-d467-4c93-a43a-4744c6150502","resolution":{"observed_at":"2026-08-07T15:14:47.649393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.11136","last_updated":"2024-09-17T12:42:55Z","snapshot_observed_at":"2026-08-05T15:19:58.041605Z","submitted_at":"2024-09-17T12:42:55Z","title":"Promptriever: Instruction-Trained Retrievers Can Be Prompted Like Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.11136","snapshot_observed_at":"2026-08-07T15:14:47.749474Z","title":"Promptriever: Instruction-trained retrievers can be prompted like language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.749474Z"},"links":{"cited_paper":"/paper/2409.11136","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:6cc4f1eacf7bd73649085b330c97c18b8ff013209bf0a2d42c155e34e3fff5ea","observation_id":"762b0dfb-7a99-45a9-9491-0d69b637d8d7","resolution":{"observed_at":"2026-08-07T15:14:47.749474Z","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-07T15:14:53.126032Z","title":"The trustworthiness of retrieval-augmented generation systems","venue":null,"work_id":"2ddd2879-76b1-410a-a87e-210344d0297c","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.813766Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:5415588a1204143b10613ca74959f73b9aa5d3288e1aa06673b9888b8ec11c2c","observation_id":"46fff58d-8daf-445f-8521-653e1eb7f110","resolution":{"observed_at":"2026-08-07T15:14:53.225948Z","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":"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-07T15:14:47.881480Z","title":"Retrieval-augmented generation for knowledge-intensive nlp tasks, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.881480Z"},"links":{"cited_paper":"/paper/2005.11401","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:a4027049cdedd445d4a7a8fb9b243f46749cb47344909b3c90ad70322cdec571","observation_id":"bf59f14c-a1d2-4695-b006-1d9f7fa57334","resolution":{"observed_at":"2026-08-07T15:14:47.881480Z","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":"2502.00001","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:14:51.046349Z","title":"Lexrag: Retrieval-augmented generation for legal domain dialogue systems","venue":null,"work_id":"d37fc6ac-244f-4207-a869-910960dbca1f","year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:47.956373Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:ba674e62b5519d02debc34959c4b845652c78d32877158b3e80b6bce6f98db43","observation_id":"a5302cf1-f7f1-4840-beee-c60167d6aced","resolution":{"observed_at":"2026-08-07T15:14:51.116424Z","resolver_source":"raw_fallback","status":"verified_exact"},"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-07T15:14:52.942904Z","title":"Rationale-guided retrieval augmented generation for medical question answering","venue":null,"work_id":"4a904ff1-7baf-4e14-ac29-9e13681d5e10","year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.010781Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:935e84d137c6df59e70a1aefd2792e7c0721114680cb1e3d6ae9505e173de557","observation_id":"ab1d8c70-96cd-4732-80fc-8948fab9cd20","resolution":{"observed_at":"2026-08-07T15:14:53.040817Z","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":"2410.14353","last_updated":"2024-10-26T18:41:41Z","snapshot_observed_at":"2026-08-03T20:03:37.963786Z","submitted_at":"2024-10-18T10:16:07Z","title":"Assistive AI for Augmenting Human Decision-making","version":2},"cited_work":{"arxiv_id":"2410.14353","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.14353","snapshot_observed_at":"2026-08-07T15:14:50.652046Z","title":"Assistive AI for Augmenting Human Decision-making","venue":"cs.CY","work_id":"41fd07ac-684d-4a5b-b992-ad49fd4d4df4","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.097688Z"},"links":{"cited_paper":"/paper/2410.14353","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:d8ad0e76c9d6fdb36c40ab823a983e9f5dc92c63fa135d110be7ae584fee2af8","observation_id":"2f45edb6-3b19-4f07-8015-8f71053fb746","resolution":{"observed_at":"2026-08-07T15:14:50.798809Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-07T15:14:52.728925Z","title":"Domain-specific retrieval-augmented generation using expert-tuned llms","venue":null,"work_id":"08a7337a-cebb-4c4b-9727-976b2649c2fd","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.218752Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:5e8b944505ca8b612b05031f56e1d1fe8245776622f0a9a2f339f56cf06ab041","observation_id":"70d5e8c1-854d-4a73-97df-d2a7aacc0fa2","resolution":{"observed_at":"2026-08-07T15:14:52.834260Z","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-07T15:14:52.557543Z","title":"Systematic knowledge injection in large language models for scientific qa","venue":null,"work_id":"697d3db4-b336-464f-a809-33139a684906","year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.354443Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:315497bd9e111d5b90690bd4b4338e2c8f80a4d34eb78b74fe449e9182184fe1","observation_id":"903472ab-f90d-4322-ae62-4728df7c1a8d","resolution":{"observed_at":"2026-08-07T15:14:52.635921Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:14:48.488165Z","title":"The structural safety generalization problem","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.488165Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:3180d850d4f10fcb638d468470f926dae5138746a579ccdd7dd76dfb3b06685f","observation_id":"b6b7f933-45df-44e2-acf2-eb6503665ee4","resolution":{"observed_at":"2026-08-07T15:14:48.488165Z","resolver_source":null,"status":"malformed_identifier"},"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-07T15:14:52.364587Z","title":"Docent: Document-centric rag improves multi-hop qa","venue":null,"work_id":"82c10cf3-f0d5-41fc-bddf-125401c346b0","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.626537Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:72e5a007671d7837a454f5216864711184ce6a707d4189e31273e38192ef40d1","observation_id":"493b6e65-7fe6-4108-bdff-643eb8a08301","resolution":{"observed_at":"2026-08-07T15:14:52.470845Z","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-07T15:14:52.163022Z","title":"Self-rag: Learning to retrieve when answering questions","venue":null,"work_id":"333a7bbf-532d-4cd9-ab1b-1eacc6cbb322","year":2023},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.720707Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:48fa404452b320402c13b61f951e1928335d4aa8d119d49ccde2b66b480a4a28","observation_id":"6fbf069b-4792-475b-bfb6-c649b0ee5e1c","resolution":{"observed_at":"2026-08-07T15:14:52.274131Z","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":"1707.08238","last_updated":"2017-07-30T14:44:22Z","snapshot_observed_at":"2026-08-04T21:28:21.729217Z","submitted_at":"2017-07-25T22:03:21Z","title":"A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model","version":2},"cited_work":{"arxiv_id":"1707.08238","doi":null,"metadata_source":"pith","pith_arxiv_id":"1707.08238","snapshot_observed_at":"2026-08-07T15:14:50.300825Z","title":"A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model","venue":"cs.DS","work_id":"1c34efae-a626-47ed-b94d-4779020b67ff","year":2017},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.837341Z"},"links":{"cited_paper":"/paper/1707.08238","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:58cf2ba7e1885d7ac8987cad3c9537f21235ad81011730bfd550b23c2e85fbdb","observation_id":"ec571fcc-94b6-4142-b2d8-2b8a9fc174d9","resolution":{"observed_at":"2026-08-07T15:14:50.500721Z","resolver_source":"local_arxiv","status":"verified_exact"},"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":"2402.06871","last_updated":"2025-03-25T02:54:01Z","snapshot_observed_at":"2026-07-06T17:28:18.945477Z","submitted_at":"2024-02-10T03:21:13Z","title":"Non-autoregressive Generative Models for Reranking Recommendation","version":6},"cited_work":{"arxiv_id":"2402.06871","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.06871","snapshot_observed_at":"2026-08-07T15:14:50.010801Z","title":"Non-autoregressive Generative Models for Reranking Recommendation","venue":"cs.IR","work_id":"d6e4e151-faeb-42f5-8520-9fb401b0a4d0","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:48.934027Z"},"links":{"cited_paper":"/paper/2402.06871","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:70de54419c18def7946771a1a5dc66b5fe9dd4651307020c94dde5e19223920a","observation_id":"053bfd9f-13d3-402a-bd0d-2ae8736e09fa","resolution":{"observed_at":"2026-08-07T15:14:50.152757Z","resolver_source":"local_arxiv","status":"verified_exact"},"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-07T15:14:51.934421Z","title":"Rankrag: Unifying context ranking with retrieval-augmented generation in llms","venue":null,"work_id":"79e2649a-b44a-46fc-849c-ce8c7fb7a83a","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:49.074985Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:43bd12a1ecafadd841a348468e25038a2c38aeb84d424d26cc50f87b0d42c50d","observation_id":"43526880-e952-42b6-87aa-4e9f564b911e","resolution":{"observed_at":"2026-08-07T15:14:52.048254Z","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-07T15:14:51.750973Z","title":"Mirage: Faithful attribution in retrieval-augmented generation","venue":null,"work_id":"eff664ac-943d-4a5b-af19-81bda3c815d8","year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:49.165804Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:50b5208046c7b2d1a847396e995c86101c1c3dd93f3758e0e150a37c4c02c370","observation_id":"2ee86828-dc1b-4113-a6c6-7048beac3d14","resolution":{"observed_at":"2026-08-07T15:14:51.820561Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:14:49.289887Z","title":"Shifting from ranking to set selection for retrieval augmented generation","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:49.289887Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:05dfa3866e765657ba305cad4a9c5c29d550c3655db71dc981a5038f7e12af78","observation_id":"acb2edfa-4897-4294-a4df-5a3a69f23b06","resolution":{"observed_at":"2026-08-07T15:14:49.289887Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.00083","last_updated":"2024-06-06T13:38:42Z","snapshot_observed_at":"2026-08-06T22:05:18.163179Z","submitted_at":"2024-06-03T02:25:33Z","title":"BadRAG: Identifying Vulnerabilities in Retrieval Augmented Generation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.00083","snapshot_observed_at":"2026-08-07T15:14:49.451675Z","title":"Badrag: Identifying vulnerabilities in retrieval augmented generation of large language models, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:49.451675Z"},"links":{"cited_paper":"/paper/2406.00083","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:2527320deca4b4bbadadd78c4e8e3c09cb7754cf9333f3dab6849c1d29e585cc","observation_id":"54b84ce8-fc91-443f-846e-7b6b4fadf8e4","resolution":{"observed_at":"2026-08-07T15:14:49.451675Z","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-07T15:14:49.545194Z","title":"Training language models to follow instructions with human feedback","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:49.545194Z"},"links":{"citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:6c2e476856e5964f0c95427881b91498a490cb4690fbd3952f00fa98d5e0ea37","observation_id":"a9e60e52-bf6c-4ccc-9c92-25a4d98f7efc","resolution":{"observed_at":"2026-08-07T15:14:49.545194Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.03300","last_updated":"2024-04-27T15:25:53Z","snapshot_observed_at":"2026-08-06T14:58:42.911363Z","submitted_at":"2024-02-05T18:55:32Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-07T15:14:49.663776Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:49.663776Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:e402a386accf86b0035dea68e35be233b5d90e7d522873ae8d4707753a6ff93b","observation_id":"6e28b0ba-93c5-49de-942e-7ae4edd1b10f","resolution":{"observed_at":"2026-08-07T15:14:49.663776Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2305.18290","last_updated":"2024-07-29T22:26:36Z","snapshot_observed_at":"2026-08-01T16:34:38.795326Z","submitted_at":"2023-05-29T17:57:46Z","title":"Direct Preference Optimization: Your Language Model is Secretly a Reward Model","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.18290","snapshot_observed_at":"2026-08-07T15:14:49.782702Z","title":"Direct preference optimization: Your language model is secretly a reward model","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains","version":5},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-07T15:14:49.782702Z"},"links":{"cited_paper":"/paper/2305.18290","citing_paper":"/paper/2505.16014"},"observation_digest":"sha256:6c7f3cb2f11fe9de2a069fa0bb384584d5aaf5b336d1b078a48af57ed7b92c69","observation_id":"5c81b061-7f36-48bc-8bbb-45bc9d19af0b","resolution":{"observed_at":"2026-08-07T15:14:49.782702Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.16014","last_updated":"2026-06-02T10:15:17Z","latest_version":5,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-07T15:06:12.174579Z","submitted_at":"2025-05-21T20:57:16Z","title":"Ranking Free RAG: Replacing Re-ranking with Selection in RAG for Sensitive Domains"},"reference_resolution":{"displayed":56,"state_counts":{"malformed_identifier":1,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":24,"verified_exact":5,"verified_fuzzy":26},"total_outbound_references":56},"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 8 August 2026, this Paper Citation Record lists 56 of 56 outbound references and 1 inbound Pith citation observation for arXiv:2505.16014."}