{"as_of":"2026-07-24T23:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0cd06f04738560e1325a224db63c001e98f574ee05c92889ef14c415b7eecd49","coverage":[{"denominator":41,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":41,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-20T03:45:30.682693Z","state":"measured"},{"denominator":41,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":41,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-07-24T06:31:00.690269+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2605.20123/citation-record","integrity":"/paper/2605.20123/integrity","json":"/paper/2605.20123/citation-record.json","paper":"/paper/2605.20123"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"A Survey on Hallucination in Large Language Models: Principles, Taxonomy, Challenges, and Open Questions","venue":null,"work_id":"b91c0e7d-bfeb-400d-83ca-1fcafec29cf2","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:2c49a32769b792bbec9fec46a548ab5f2e0b195de041d582e1dd9db856792e73","observation_id":"d7355d74-cd73-43c3-82e1-af473165a367","resolution":{"observed_at":"2026-05-20T03:53:23.568331Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"A survey on large language model (LLM) security and privacy: The Good, The Bad, and The Ugly","venue":null,"work_id":"64c0ca6b-fd8d-492d-8822-acf33f476c13","year":2024},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:0065cbeaea780fbbe6627d625ab116cbed2f30980665ea12f17d50e1d9f5327e","observation_id":"699f703a-839c-44ec-b6a5-59fb26e7c9c0","resolution":{"observed_at":"2026-05-20T03:53:23.522152Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","venue":null,"work_id":"e08c2a93-d83f-41fd-b42f-5881a36fe8ec","year":2024},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:b536fff41c633c46e8a228fd810a0b459d4c0051a2b870b41f84843c569a115c","observation_id":"d729af47-4868-4164-b751-c53a2add323f","resolution":{"observed_at":"2026-05-20T03:53:23.550107Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"PoisonedRAG: Knowledge Corruption Attacks to Retrieval-Augmented Generation of Large Language Models","venue":null,"work_id":"81637a9b-86a5-47df-b31d-c49df8c772b7","year":2024},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:2a02d0c3310ca767785ffb96d477dc32cc25974d116727d1c072d5b6e9dcba61","observation_id":"80efa60f-5620-47c7-ba66-f1d4379396e3","resolution":{"observed_at":"2026-05-20T03:53:23.541475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Poisoning Retrieval Corpora by Injecting Adversarial Passages","venue":null,"work_id":"e95aa075-178b-4c7a-b927-a81444638b1e","year":2023},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:adf8df00efd48953e4c4ad0c521c9454f605d9d24a09251a64cdbfee6684dca4","observation_id":"bf9c9063-299c-41ec-8d6b-e1601328c4a6","resolution":{"observed_at":"2026-05-20T03:53:23.559456Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"GASLITEing the Retrieval: Exploring Vulnerabilities in Dense Embedding-based Search","venue":null,"work_id":"f8df971b-0ac0-49fe-a369-80cfd98fbefe","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:6b35f2863a0fce4c0e8942e731d6267607b751fa76eb49bd61e1319a7f043c11","observation_id":"229ce550-a542-4cc5-bd29-e5cf6dffc74f","resolution":{"observed_at":"2026-05-20T03:53:23.595142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"The Silent Saboteur: Impercepti- ble Adversarial Attacks against Black-Box Retrieval- Augmented Generation Systems","venue":null,"work_id":"53901770-86c3-43c3-90da-ddc15a8718a0","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:e032ffa8eae7a3a6b4f54c0eb053039c12d011d25c14313bc9cae9762996d6e8","observation_id":"6c8555da-71a2-42a1-96e7-8693209ec59d","resolution":{"observed_at":"2026-05-20T03:53:23.664273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Topic-FlipRAG: Topic-Orientated Adversarial Opinion Manipulation Attacks to Retrieval- Augmented Generation Models","venue":null,"work_id":"a056963b-d68c-41c9-8b38-52a6e4357bde","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:363723b3626830817811b7d99a3612e36c89cd27710272954739f1e4088d35fc","observation_id":"182c7aac-ffa7-4d32-aa43-cbfdb698ada0","resolution":{"observed_at":"2026-05-20T03:53:23.578413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Your RAG is Unfair: Exposing Fairness Vulnerabilities in Retrieval-Augmented Gener- ation via Backdoor Attacks","venue":null,"work_id":"a55c5115-4dea-4c50-a2f8-04048c0839a9","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:7315d45469c17d6655aaed57dc4545d1d8b1877aa10f14635c3f21f26f8a1795","observation_id":"ba85041d-d20d-4b69-8e44-749187c2e6d6","resolution":{"observed_at":"2026-05-20T03:53:23.532368Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"SeCon-RAG: A Two- Stage Semantic Filtering and Conflict-Free Framework for Trustworthy RAG","venue":null,"work_id":"fa83be5c-10bf-4780-b8d7-015f54c4bcec","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:edc31ad61cc69d3ae35a9e96fba7f25120056d6b66d425ac134edaee114b1d9a","observation_id":"98cdeffb-48bf-4668-a73d-8b57405d4558","resolution":{"observed_at":"2026-05-20T03:53:23.623783Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"TrustRAG: Enhancing Ro- bustness and Trustworthiness in Retrieval-Augmented Generation","venue":null,"work_id":"878468f6-9f9b-40e3-9ff3-fc7bd5c9fcdf","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:72809a39cea580a8a090fbcb92fbedda2b6143676109795137e3b831109f7b2d","observation_id":"1c346c53-c19c-46d3-b684-fdc42daa6e93","resolution":{"observed_at":"2026-05-20T03:53:23.545430Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"ReliabilityRAG: Effective and Provably Robust Defense for RAG-based Web-Search","venue":null,"work_id":"9be56001-b946-40f8-b6c8-b0151c316f44","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:cba600e97a028d35bc992ea8e7566202349c7467986338479ab0bf7c48288b1b","observation_id":"3ce359fa-9e09-4e17-8828-87a9d75267b5","resolution":{"observed_at":"2026-05-20T03:53:23.615235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Certifiably Robust RAG against Retrieval Corruption","venue":null,"work_id":"f4c7d60f-20b5-4b95-aa3a-e57f0914efc8","year":2024},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:1c3cce2c786cda80d478d7f82e8e79366c833c04c7297215214e066b5fa808a4","observation_id":"81b7ef0e-702c-4887-bd86-1f0bfcc02da9","resolution":{"observed_at":"2026-05-20T03:53:23.610363Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"On the Vulnerabil- ity of Applying Retrieval-Augmented Generation within Knowledge-Intensive Application Domains","venue":null,"work_id":"cf0dec8d-0a57-48ae-af4e-a04a2eaedef7","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:30e31b8e438b4d353ed3022967e02e6af840e85104b1433a38e7cb1b46aee50d","observation_id":"7b95bc66-57e0-456b-8bf9-837dce823d90","resolution":{"observed_at":"2026-05-20T03:53:23.555176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Astute RAG: Overcoming Imperfect Retrieval Augmen- tation and Knowledge Conflicts for Large Language Models","venue":null,"work_id":"7b3648ac-ccca-4492-945f-fed35b9ee70e","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:a56199f723eaa26664ec42e8b542c2d786f964bec6adf32c79226da16c3e55f7","observation_id":"addc0ac6-eaaa-4f8d-9f84-1a199ecf97d1","resolution":{"observed_at":"2026-05-20T03:53:23.581524Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"InstructRAG: Instructing Retrieval-Augmented Generation via Self- Synthesized Rationales","venue":null,"work_id":"9f41df2d-2fe1-4c46-9085-f3ac6d0eb4ff","year":2024},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:d46df2e4e4d807a251c7cb1d6de805d8f312bcbf696fbb43ecc108546820050e","observation_id":"fc42a34d-3854-48ac-ad88-670d0e1c16bd","resolution":{"observed_at":"2026-05-20T03:53:23.637211Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Query Rewriting in Retrieval-Augmented Large Language Models","venue":null,"work_id":"56cf751f-6c0d-46fe-b719-9108ec7a3e7b","year":2023},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:9190eef59ebb84470000d24a2c6e08705f130e648ae48e4643dc6180f990139b","observation_id":"04077063-4af7-4fb9-be10-62fda4ed535e","resolution":{"observed_at":"2026-05-20T03:53:23.585920Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","venue":null,"work_id":"added3b1-f2ac-44d2-bd88-df21dc12f7be","year":2020},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:3e9a7626828e742e51f81053354f8800abba7d9280377f25465adfabf0194229","observation_id":"12149eb3-a835-42cd-9180-542e9ef2d763","resolution":{"observed_at":"2026-05-20T03:53:23.632934Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Siren’s Song in the AI Ocean: A Survey on Hallucination in Large Language Models","venue":null,"work_id":"d9cbf3b1-ce18-435e-9b76-0443b77ffb23","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:61341d4183db67feb0feea71fd2ad527ae3473fcba77adeca4c95fe84ed73666","observation_id":"9e12a3a7-073e-4c02-a48d-cffd37f9538b","resolution":{"observed_at":"2026-05-20T03:53:23.590030Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"SimRAG: Self- Improving Retrieval-Augmented Generation for Adapt- ing Large Language Models to Specialized Domains","venue":null,"work_id":"2c1d5a73-1cff-4817-b1b5-e371a7916d41","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:89460a13dd3514639b76f5ed84da31cbb0a8c5d840da1eb13a270e4d6b0bbeba","observation_id":"191aaf59-8fa1-4f11-8bd0-6940b094f166","resolution":{"observed_at":"2026-05-20T03:53:23.576794Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"HijackRAG: Hijacking Attacks against Retrieval-Augmented Large Language Models","venue":null,"work_id":"be8947d3-a01a-40f2-bb54-1967ffddb3a7","year":2024},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:abf538b6329d2464be6e6d83eeeee7d29d9980af1dab1f21a86f50da431aacd5","observation_id":"4f4ba46b-5085-4b72-89be-c19c9c6d1050","resolution":{"observed_at":"2026-05-20T03:53:23.559176Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"PR-Attack: Coordi- nated Prompt-RAG Attacks on Retrieval-Augmented Generation in Large Language Models via Bilevel Opti- mization","venue":null,"work_id":"81268934-57bf-43e8-b190-55180eec16be","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:58aa66025ae0a407cc4485e20352e397973be3953274b7cc80a4bd9987ee3471","observation_id":"b2b4027a-21ae-4524-9f89-d04f32dcdc1c","resolution":{"observed_at":"2026-05-20T03:53:23.540234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Maximal independent sets in bipartite graphs","venue":null,"work_id":"f51aee2d-e5b6-441b-afad-421d9199f8ff","year":null},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:6958a09974b0086f25eaf901031aaa415c3a1f3cc259bd1c3b38b738c70c5394","observation_id":"245033c9-bed2-4635-9086-243ba502f95e","resolution":{"observed_at":"2026-05-20T03:53:23.599841Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/jgt.3190170407","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Available: https://onlinelibrary.wiley","venue":null,"work_id":"368518ff-bb23-48d5-ae67-20032ad629cc","year":null},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:7df7bb63ed0e9d72523972fba469c3d9bfa2bd6095c56bc5d5b066b955ad9fe1","observation_id":"3ff3537c-f208-41e3-b188-761ca6889726","resolution":{"observed_at":"2026-05-20T03:48:02.141086Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Bidi- rectional ranking for person re-identification","venue":null,"work_id":"11113eac-08d7-45ee-aa9a-0a819e21b085","year":2013},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:c9e96185861201f0881a378708a595dd9ee6eb1aa34b064bdcbf83b788a2e1f7","observation_id":"b4336b8c-e48e-4206-9e53-e9124c19fb44","resolution":{"observed_at":"2026-05-20T03:53:23.668698Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Bidirectional Attention Flow for Machine Comprehen- sion","venue":null,"work_id":"f308c520-bdad-49be-864a-138120eb9cff","year":2018},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:ddaa06d5217e343934fe9759e1be4b35dd81be380c2a5a0a87618f62acb43716","observation_id":"1e20326f-2219-48e9-9c68-539be2874f58","resolution":{"observed_at":"2026-05-20T03:53:23.604915Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Query2doc: Query Expansion with Large Language Models","venue":null,"work_id":"1c905944-67a7-403d-99f4-4126e9e3b71c","year":2023},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:70141c26a1501378e98560d377193b9d79e220e2c8cfa82754979d6524bb358e","observation_id":"4ba8eb80-a4b3-491e-91f9-c324fcab840b","resolution":{"observed_at":"2026-05-20T03:53:23.537222Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Hello neighbor: Accurate object retrieval with k-reciprocal nearest neighbors","venue":null,"work_id":"952e6a56-ec90-4e26-a39f-021dc9bba50d","year":2011},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:a58bfba589ee40c3554366abf9198502d6c28c1c730aa4e275e7c0819590e62a","observation_id":"60c1279f-47a8-493c-bb28-638564fa95a9","resolution":{"observed_at":"2026-05-20T03:53:23.587555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"A contextual dissimilarity measure for accurate and efficient image search","venue":null,"work_id":"65355cbe-e286-42aa-a287-08857fbf9dcb","year":2007},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:fd4a2bfa55c22a599b939ce6c78a515fb3f6833a5a414864e46098607cbb7db1","observation_id":"d2c23adc-1222-4df2-9fa7-ad65c7bc1499","resolution":{"observed_at":"2026-05-20T03:53:23.650962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Re-ranking Person Re-identification with k-reciprocal Encoding","venue":null,"work_id":"52ae8080-9957-44ca-b53d-433830a5057e","year":2017},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:11491ce02828d43f865cee4663801a3e9b64fa2fcf8c43c0b118f73ebdb02f73","observation_id":"488baa1a-1bf5-46b7-b116-6dfc7c218568","resolution":{"observed_at":"2026-05-20T03:53:23.681229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Natural Questions: A Benchmark for Question Answer- ing Research","venue":null,"work_id":"16ec02d4-df18-4750-bc9f-e1f771809c14","year":2019},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:8c994867b177067c018eb9e67415b1332f208fb4d1b2a1e23e6eec726cac5ae1","observation_id":"97cb3b27-e1c0-4513-8d5a-90136eac35de","resolution":{"observed_at":"2026-05-20T03:53:23.628737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"MS MARCO: A Human Generated MAchine Reading COmprehension Dataset","venue":null,"work_id":"e521bb26-1427-4bc2-8a14-51461d25ac5f","year":2018},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:37d1b1658c078c824b592f3d950309b2b5a70d37e5293f83e622fd902bf59f48","observation_id":"30a9af10-2ef5-4eae-9e1d-ac53ccc4db7b","resolution":{"observed_at":"2026-05-20T03:53:23.659672Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answering","venue":null,"work_id":"31e26ba9-fa64-4ba5-a722-2cbf35588692","year":2018},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:1f3915a6129dec61a36e84ed5a4ec3e4216a8e9bfbc00f51671366f1d550a78d","observation_id":"7d2a00ae-b291-4cd8-a91a-0db638733b5a","resolution":{"observed_at":"2026-05-20T03:53:23.677292Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Unsupervised Dense Information Retrieval with Contrastive Learning","venue":null,"work_id":"e71360b6-0adf-423d-854b-00036ae8317b","year":2022},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:027cba3996dcc2bbbfa6d15b72ca777809f259f06801ad68c1b8c3067cabb209","observation_id":"7f552f9a-6a98-4d8f-8155-c7f0e0efcff9","resolution":{"observed_at":"2026-05-20T03:53:23.619231Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval","venue":null,"work_id":"776248ec-fbd5-4ec7-ac3f-48572af38c58","year":2020},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:094d60b757bd10b920af5fab68c7c3e3420eaed4ae2ac92c2cbd102a2236397f","observation_id":"14790bc8-a078-4c3b-a7f7-795676e7b5f9","resolution":{"observed_at":"2026-05-20T03:53:23.646661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Dense Passage Re- trieval for Open-Domain Question Answering","venue":null,"work_id":"a1e81fd7-234b-4042-aae6-155ab7b1615c","year":2020},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:798ea8d489faa6f25eca6bdd8980b60d9eb926bafaa43383f9a3eacc27baf658","observation_id":"ab2b6fe6-a4bc-4024-bd61-5cd728ae7bd8","resolution":{"observed_at":"2026-05-20T03:53:23.642215Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Qwen2.5 Technical Re- port","venue":null,"work_id":"6463ba02-1db5-4dff-9fa1-77ca09e3fd88","year":2025},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:53c510628203603bdf9da6480820272aff6e56204747ee2e9e05b9da056567c6","observation_id":"d63aebc0-845c-4ddb-8b65-be8d6e81705d","resolution":{"observed_at":"2026-05-20T03:53:23.654909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"Mistral 7B","venue":null,"work_id":"cac70278-374e-4938-a50d-a0cc7b1733fa","year":2023},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:ea93690469054c1288e83e6c4e530cfcd92df94cfab4bd74bb48f493e11a2c2f","observation_id":"5f4fa41c-c3f1-4160-887c-b397291c9a69","resolution":{"observed_at":"2026-05-20T03:53:23.505998Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"8137.1912","doi":"10.1111/j.1469-8137.1912.tb05611.x","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"The distribution of the flora in the alpine zone","venue":null,"work_id":"0d0931e1-76ea-4d2e-a739-00d0f5358f94","year":1912},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:f18c42e433ce0de3607794297fd9988c381b5ac5ed475e3cec5bf11883bf439c","observation_id":"5edb6535-ea03-42e4-8cb3-f820e0204fdb","resolution":{"observed_at":"2026-05-20T03:48:02.136507Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-12T12:50:00.632978+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-12T12:50:00.632978+00:00","source":"openalex_status_cache"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"TESTS FOR RANK CORRELATION COEFFI- CIENTS. I","venue":null,"work_id":"8ed3c714-bd8d-4f0e-b014-3b6108c579f0","year":1957},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:700092b70e5079e60c3161d462b6e9a6058aa022ede46b4f715d49f78ee2ae37","observation_id":"62f66b33-e0af-4906-8d69-c2dc093051ac","resolution":{"observed_at":"2026-05-20T03:53:23.673328Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+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-06-05T21:23:00.469572Z","title":"A similarity mea- sure for indefinite rankings","venue":null,"work_id":"928c7744-6536-4bde-89d1-ccd3e50eb115","year":2010},"citing_paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-20T03:45:30.682693Z"},"links":{"citing_paper":"/paper/2605.20123"},"observation_digest":"sha256:97b4c0573e95d91a2d7d9c09cc15f12277f6cbe71ec53fd06ebf2dcf986363fa","observation_id":"446ea82c-ca9b-485a-bf1c-85d901d3701b","resolution":{"observed_at":"2026-05-20T03:53:23.572369Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-07-24T06:31:00.690269+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2605.20123","last_updated":"2026-05-19T17:11:00Z","latest_version":1,"primary_category":"cs.CR","snapshot_observed_at":"2026-07-06T23:30:44.092395Z","submitted_at":"2026-05-19T17:11:00Z","title":"BiRD: A Bidirectional Ranking Defense Mechanism for Retrieval Augmented Generation"},"reference_resolution":{"displayed":41,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":2,"verified_fuzzy":39},"total_outbound_references":41},"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-07-24T06:31:00.690269+00:00","source":"crossref"},{"observed_at":"2026-07-24T06:30:55.483554+00:00","source":"retraction_watch"}],"thesis":"As of 24 July 2026, this Paper Citation Record lists 41 of 41 outbound references and 0 inbound Pith citation observations for arXiv:2605.20123."}