{"as_of":"2026-08-06T18:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:51271baf15eeb3e150913ba968a5baf2a980c8be7572b7625ecf3513bcaac454","coverage":[{"denominator":53,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":53,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-17T23:41:47.052697Z","state":"measured"},{"denominator":56,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":56,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-06T06:34:29.942622+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-15T03:05:04.196270Z","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-05-15T03:09:44.148621Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"cited_work":{"arxiv_id":"2511.11653","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.11653","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","venue":"cs.IR","work_id":"d45093a4-2628-4934-9ecd-f367e49789ff","year":2025},"citing_paper":{"arxiv_id":"2605.00063","last_updated":"2026-04-30T08:35:06Z","snapshot_observed_at":"2026-07-06T23:13:33.799847Z","submitted_at":"2026-04-30T08:35:06Z","title":"A Survey of Reasoning-Intensive Retrieval: Progress and Challenges","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-05-09T20:53:05.314601Z"},"links":{"cited_paper":"/paper/2511.11653","citing_paper":"/paper/2605.00063"},"observation_digest":"sha256:d419aff4ca162f8b94707e777e05d519cf7b15b09bd870b423d6a97daf3011a6","observation_id":"4153188a-2a29-4c7a-94e9-4087d07adf48","resolution":{"observed_at":"2026-05-11T14:56:04.956973Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"cited_work":{"arxiv_id":"2511.11653","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.11653","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","venue":"cs.IR","work_id":"d45093a4-2628-4934-9ecd-f367e49789ff","year":2025},"citing_paper":{"arxiv_id":"2605.13137","last_updated":"2026-05-14T05:15:13Z","snapshot_observed_at":"2026-07-06T23:24:42.799888Z","submitted_at":"2026-05-13T08:04:57Z","title":"LeanSearch v2: Global Premise Retrieval for Lean 4 Theorem Proving","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-14T18:32:24.957899Z"},"links":{"cited_paper":"/paper/2511.11653","citing_paper":"/paper/2605.13137"},"observation_digest":"sha256:96c7a88ef55bd7a0c04d364732ad332948e418a7d35c89217dc4db36f937587f","observation_id":"056667c5-bad4-47a1-8ccc-a9dbe823d6da","resolution":{"observed_at":"2026-05-14T18:32:34.188116Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"cited_work":{"arxiv_id":"2511.11653","doi":null,"metadata_source":"pith","pith_arxiv_id":"2511.11653","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","venue":"cs.IR","work_id":"d45093a4-2628-4934-9ecd-f367e49789ff","year":2025},"citing_paper":{"arxiv_id":"2605.13137","last_updated":"2026-05-14T05:15:13Z","snapshot_observed_at":"2026-07-06T23:24:42.799888Z","submitted_at":"2026-05-13T08:04:57Z","title":"LeanSearch v2: Global Premise Retrieval for Lean 4 Theorem Proving","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-15T03:05:04.196270Z"},"links":{"cited_paper":"/paper/2511.11653","citing_paper":"/paper/2605.13137"},"observation_digest":"sha256:5c8f8af3ac52e795a53a212d3fcd85ca48d5a617f301be4cf734c77d77105fc3","observation_id":"52fc1d7b-5834-4b2b-8a34-c7eacd06365b","resolution":{"observed_at":"2026-05-15T03:09:44.151174Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2511.11653/citation-record","integrity":"/paper/2511.11653/integrity","json":"/paper/2511.11653/citation-record.json","paper":"/paper/2511.11653"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2312.10997","last_updated":"2024-03-27T09:16:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-12-18T07:47:33Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","version":5},"cited_work":{"arxiv_id":"2312.10997","doi":"10.1186/1476-072x-8-72","metadata_source":"pith","pith_arxiv_id":"2312.10997","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Retrieval-Augmented Generation for Large Language Models: A Survey","venue":"cs.CL","work_id":"b80d2790-6cd9-4c87-b3c4-de404f99a80e","year":2023},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2312.10997","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:e5ac96f10629687427de01ade9d136b14ed93031951f3a27fa094877b12034c7","observation_id":"ea2f2110-4905-4d81-956a-9d0a0172e516","resolution":{"observed_at":"2026-05-17T23:42:13.080561Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-04T13:06:14.768886Z","submitted_at":"2020-05-22T21:34:34Z","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","version":4},"cited_work":{"arxiv_id":"2005.11401","doi":"10.1145/3626772.3657717","metadata_source":"pith","pith_arxiv_id":"2005.11401","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks","venue":"cs.CL","work_id":"27eaec54-c105-4969-8188-da5f0fca3688","year":2020},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2005.11401","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:2e9c2e628db0fad2cb1ef2213f39f7362b451c6d28d0d5033d59447367cda2ac","observation_id":"1049af90-0969-4a6e-a4ae-9ff416b92504","resolution":{"observed_at":"2026-05-17T23:42:13.066335Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.10677","last_updated":"2026-07-20T09:35:34Z","snapshot_observed_at":"2026-08-06T12:44:27.513654Z","submitted_at":"2025-03-11T01:59:35Z","title":"A Survey on Knowledge-Oriented Retrieval-Augmented Generation","version":3},"cited_work":{"arxiv_id":"2503.10677","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.10677","snapshot_observed_at":"2026-07-11T00:47:42.809035Z","title":"A survey on knowledge-oriented retrieval-augmented generation","venue":"cs.CL","work_id":"1d864806-4249-4818-9098-90d2bf36536f","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2503.10677","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:d8c44f1878130cc1321899c68384c3f7163f0f82126940f2e18d4e1da5d36f80","observation_id":"ec940bf7-b58e-4af3-9e2d-a45caa5d23d1","resolution":{"observed_at":"2026-05-17T23:42:13.075923Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19893","last_updated":"2024-05-30T09:50:38Z","snapshot_observed_at":"2026-07-06T18:22:36.012485Z","submitted_at":"2024-05-30T09:50:38Z","title":"Similarity is Not All You Need: Endowing Retrieval Augmented Generation with Multi Layered Thoughts","version":1},"cited_work":{"arxiv_id":"2405.19893","doi":"10.48550/arxiv.2405.19893","metadata_source":"arxiv_reference","pith_arxiv_id":"2405.19893","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Similarity is not all you need: Endowing retrieval augmented generation with multi layered thoughts","venue":"arXiv (Cornell University)","work_id":"23d9c533-b9f6-40b4-81f2-18435b92ec5b","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2405.19893","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:c66c9ab219570e9330abeb3415f6f5ab9365e5efa8970e43dca5a15115044741","observation_id":"1dbaaf3d-18ef-4328-877b-64233789c456","resolution":{"observed_at":"2026-05-17T23:42:13.069818Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.09388","last_updated":"2025-05-14T13:41:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-14T13:41:34Z","title":"Qwen3 Technical Report","version":1},"cited_work":{"arxiv_id":"2505.09388","doi":"10.1016/j.aiopen.2022.12","metadata_source":"pith","pith_arxiv_id":"2505.09388","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"Qwen3 Technical Report","venue":"cs.CL","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2505.09388","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:28d00419ce541383299601017428fbbcc0a624feb81036efb8357323ba6fb658","observation_id":"7bc3ea98-872b-48c3-b73c-bc0976d45361","resolution":{"observed_at":"2026-05-17T23:42:13.018467Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Deepseek-r1: Incentivizing reasoning capability in llms via reinforcement learning","venue":null,"work_id":"8ec84b0e-0bd4-44ea-8750-8504fcd568eb","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:d8f22264e15ff1075567886ce4fd4a2b9df440fe2d122cc2ab0afe534e0ac920","observation_id":"ce297b79-8fbf-474e-be77-8a99158cbf1e","resolution":{"observed_at":"2026-05-17T23:42:13.337135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10671","last_updated":"2024-09-10T13:25:53Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-07-15T12:35:42Z","title":"Qwen2 Technical Report","version":4},"cited_work":{"arxiv_id":"2407.10671","doi":"10.18653/v1/2024.naacl-long.246","metadata_source":"pith","pith_arxiv_id":"2407.10671","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen2 Technical Report","venue":"cs.CL","work_id":"a1857881-ab9b-4b80-9b5f-9ae4b5c2566d","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2407.10671","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:b2e5f07dfa8b8a237a4196fe881831050449f8f6c2c422900034263ac922fcde","observation_id":"83c05f19-2120-4d9a-af4f-19c382ec1b75","resolution":{"observed_at":"2026-05-17T23:42:13.053466Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":"2412.15115","doi":"10.1145/3581783.3612503","metadata_source":"pith","pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Qwen2.5 Technical Report","venue":"cs.CL","work_id":"d8432992-4980-4a81-85c7-9fa2c2b87f85","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:aff63bf546b229707f8c9b40b4c1035fbe637a8103a996241c57f9a08713b2bb","observation_id":"3bef04f2-03c3-43f1-8f51-0ee8d00dc83f","resolution":{"observed_at":"2026-05-17T23:42:12.981617Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2501.09686","last_updated":"2025-01-23T08:44:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-16T17:37:58Z","title":"Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Models","version":3},"cited_work":{"arxiv_id":"2501.09686","doi":"10.48550/arxiv.2501.09686","metadata_source":"pith","pith_arxiv_id":"2501.09686","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Towards Large Reasoning Models: A Survey of Reinforced Reasoning with Large Language Models","venue":"cs.AI","work_id":"9b0d5273-2b7c-477e-b49b-2e0edab55456","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2501.09686","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:6f0b2f15e2e086a4e75beafa5f04359ffbbfd022e99a6ece2eb841696cf6c613","observation_id":"48893c14-9784-4b97-b740-8d755c109f2c","resolution":{"observed_at":"2026-05-17T23:42:12.956901Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Polyrag: Integrating polyviews into retrieval-augmented generation for medical applications","venue":null,"work_id":"6da5c798-b8b3-4dca-9e57-8ce823437129","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:587356be3adad4925154b2b798ce86dfb9b47c7f14d075dc8eeaebbc83556068","observation_id":"1302f45b-e2bb-4c2f-93ca-b4144c3e9be5","resolution":{"observed_at":"2026-05-17T23:42:13.281356Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.14917","last_updated":"2025-04-21T07:35:24Z","snapshot_observed_at":"2026-07-06T21:12:23.428174Z","submitted_at":"2025-04-21T07:35:24Z","title":"POLYRAG: Integrating Polyviews into Retrieval-Augmented Generation for Medical Applications","version":1},"cited_work":{"arxiv_id":"2504.14917","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2504.14917","snapshot_observed_at":"2026-06-29T23:24:01.666676Z","title":"Available: https://arxiv.org/abs/2504.14917","venue":null,"work_id":"34b3d90e-dc25-4693-9a33-4f82e63bee40","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2504.14917","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:696cb19111940887f11160276f6e1f392b16951c335069e44309a9fac3533492","observation_id":"6bfffe61-b62a-4e1c-9f6c-7ab8799bc7ab","resolution":{"observed_at":"2026-05-17T23:42:12.994266Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"78891e16-07f6-4417-9838-9a0d9bd80d3f","year":2020},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:eeb2d9dee324a3b5ce1c9e1d9b3fdb7beec34b931b91afc694a9fca018068aaf","observation_id":"4cea3406-518c-4fe1-9313-3ce79665742b","resolution":{"observed_at":"2026-05-17T23:42:13.295543Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Learning to plan for retrieval-augmented large language models from knowledge graphs","venue":null,"work_id":"28a0b34d-6645-4495-9dc9-9ab0b81f16ad","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:b17b4520265eed6626b9b985cd72c602fb0157cb8424954763e93f24432ba96f","observation_id":"8a86c9f9-a74b-4052-8465-8e46f2d1eacc","resolution":{"observed_at":"2026-05-17T23:42:13.288575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-based language models and applications","venue":null,"work_id":"415e5cda-42e9-462d-a6f8-fe6740b21a8d","year":2023},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:2c120cac642e8b1d15945666ede8e28553325f900fc11bb64a5722baa9486526","observation_id":"9dcf565a-1281-43ae-b4b1-2e2275493185","resolution":{"observed_at":"2026-05-17T23:42:13.291871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.05714","last_updated":"2025-09-10T03:00:18Z","snapshot_observed_at":"2026-07-06T21:53:46.656981Z","submitted_at":"2025-07-08T06:53:28Z","title":"HIRAG: Hierarchical-Thought Instruction-Tuning Retrieval-Augmented Generation","version":3},"cited_work":{"arxiv_id":"2507.05714","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.05714","snapshot_observed_at":"2026-07-03T03:37:35.708363Z","title":"Hirag: Hierarchical-thought instruction-tuning retrieval-augmented generation","venue":null,"work_id":"1f2eb904-8b9d-4e0e-8ae9-00480ea4c489","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2507.05714","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:39137800bdbbd8ca66ab7eb6ce350efd6fb378bb225ed383e38cdcf934ca80f2","observation_id":"b134669c-86b4-4150-abd2-128c5497525b","resolution":{"observed_at":"2026-05-17T23:42:13.034968Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2507.22927","last_updated":"2025-07-23T16:14:08Z","snapshot_observed_at":"2026-08-06T14:42:01.510777Z","submitted_at":"2025-07-23T16:14:08Z","title":"PRGB Benchmark: A Robust Placeholder-Assisted Algorithm for Benchmarking Retrieval-Augmented Generation","version":1},"cited_work":{"arxiv_id":"2507.22927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2507.22927","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Prgb benchmark: A robust placeholder-assisted algorithm for benchmarking retrieval-augmented generation","venue":null,"work_id":"e4f972e5-2e3f-45e1-8510-1dc02a5e1c8a","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2507.22927","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:9340bde67333219e462447818b2acc9b9c867edfc03df081b95fbdd4b609d622","observation_id":"143e0469-e3e8-4d35-b769-d6625f159e2e","resolution":{"observed_at":"2026-05-17T23:42:12.951325Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"7528.367147","doi":"10.1145/3637528.3671470","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A Survey on RAG Meeting LLMs: Towards Retrieval- Augmented Large Language Models","venue":null,"work_id":"8b2d773e-6931-4bb1-8ff3-335639890e4b","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:8d30f48bcf936ce618c482f053097b3d2ad3d980d8d7d0279b9a8569f9d08260","observation_id":"f83dcf6e-b3bc-49bf-872c-a1a3f423e4e9","resolution":{"observed_at":"2026-05-17T23:42:12.778649Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-07-13T15:49:55.878304+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-13T15:49:55.878304+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Lost in the middle: How language models use long contexts","venue":null,"work_id":"5d1c11c8-e3ae-498e-bd10-ce16559c1ce7","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:09339609f8de30e563c0f85c4606b9cbb95f5cc403bb7e878097639766de0ef3","observation_id":"0b189779-5a2d-4996-ace9-f1ecb40204dd","resolution":{"observed_at":"2026-05-17T23:42:13.318514Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"DynRank: Improve passage retrieval with dynamic zero-shot prompting based on question classification","venue":null,"work_id":"e51826f2-7db0-4300-a4f8-849c7fa19758","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:4c7b442b83359fbd067de39761c5400ee5d6c5e4a1e090fc4da0b889ad2db2df","observation_id":"eb47ca0a-3aec-4617-aabb-870d0a640e89","resolution":{"observed_at":"2026-05-17T23:42:13.346887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Rankrag: unifying context ranking with retrieval-augmented generation in llms","venue":null,"work_id":"c48a8198-6294-4019-8eff-c7debd9a9745","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:426c448fc18a64102c368e92a81aaa7f48381e43ec72f13f031ff59a6ce78193","observation_id":"251b2052-3f09-48cf-a845-7c9398ec33e7","resolution":{"observed_at":"2026-05-17T23:42:13.332468Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.10634","last_updated":"2022-10-12T20:51:49Z","snapshot_observed_at":"2026-08-02T05:13:27.824453Z","submitted_at":"2022-10-12T20:51:49Z","title":"RankT5: Fine-Tuning T5 for Text Ranking with Ranking Losses","version":1},"cited_work":{"arxiv_id":"2210.10634","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2210.10634","snapshot_observed_at":"2026-07-02T02:46:29.357896Z","title":"Rankt5: Fine-tuning t5 for text ranking with ranking losses","venue":null,"work_id":"2c38f45e-9aee-44b8-9f6a-fb09bf10a13a","year":2022},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2210.10634","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:4c4d929dfab6f0052cde82bcd5ec39f18f9ea8bc4883f47b68344eef1158b05e","observation_id":"0eae7849-2a42-43a8-b9f8-2f8243aedffe","resolution":{"observed_at":"2026-05-17T23:42:13.045062Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Rankzephyr: Effective and robust zero-shot listwise reranking is a breeze!","venue":null,"work_id":"db3dd589-1226-4d4d-927a-b448c98d76e9","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:03b668e262f645b5154926f314a9660c8eb6e3d51870ca4c5f618d1613dc0e32","observation_id":"a7814a39-f999-4bfe-aa9e-c6bd4a059799","resolution":{"observed_at":"2026-05-17T23:42:13.341272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.02724","last_updated":"2023-12-05T12:39:00Z","snapshot_observed_at":"2026-07-06T16:57:09.664139Z","submitted_at":"2023-12-05T12:39:00Z","title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","version":1},"cited_work":{"arxiv_id":"2312.02724","doi":"10.1609/aaai.v37i8.26128","metadata_source":"pith","pith_arxiv_id":"2312.02724","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"RankZephyr: Effective and Robust Zero-Shot Listwise Reranking is a Breeze!","venue":"cs.IR","work_id":"0d9b3ad1-b405-412f-81ee-fd6f941d2367","year":2023},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2312.02724","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:3d6fb5f69904eb7e1b0310e74cc77445179439aa6007416034d79ff4f05513e7","observation_id":"434a6e00-1349-4890-bd26-ae17270fe9ce","resolution":{"observed_at":"2026-05-17T23:42:13.039479Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06034","last_updated":"2025-03-08T03:14:26Z","snapshot_observed_at":"2026-08-02T20:32:46.584854Z","submitted_at":"2025-03-08T03:14:26Z","title":"Rank-R1: Enhancing Reasoning in LLM-based Document Rerankers via Reinforcement Learning","version":1},"cited_work":{"arxiv_id":"2503.06034","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.06034","snapshot_observed_at":"2026-07-02T08:06:48.410299Z","title":"arXiv:2503.06034 [cs.IR] https://arxiv.org/abs/2503","venue":null,"work_id":"c1662504-ab91-42d3-9cdc-1f4969ef9343","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2503.06034","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:5f59e0b865cbf673105895435efcb97caf22f69f4040f8c2d62db41846d3e04f","observation_id":"592cbb22-38df-4dd1-80ce-4f975876a0a5","resolution":{"observed_at":"2026-05-17T23:42:13.059244Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.00520","last_updated":"2025-08-30T14:56:53Z","snapshot_observed_at":"2026-08-05T13:36:33.270300Z","submitted_at":"2025-08-30T14:56:53Z","title":"ERank: Fusing Supervised Fine-Tuning and Reinforcement Learning for Effective and Efficient Text Reranking","version":1},"cited_work":{"arxiv_id":"2509.00520","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.00520","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Erank: Fusing supervised fine-tuning and reinforcement learning for effective and efficient text reranking","venue":null,"work_id":"a3584562-6785-49f7-8122-e3fb6381b67d","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2509.00520","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:3f61249bb68c6ea8f1e96a7947ad085f6f580035341aa49d0de9f109c3b1968b","observation_id":"977843c7-3091-4048-9be3-a13e9ccfd589","resolution":{"observed_at":"2026-05-17T23:42:12.994940Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2508.09539","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Tfrank: Think-free reasoning enables practical pointwise llm ranking","venue":null,"work_id":"26bbd2e2-14aa-4898-a2ca-d08cdb794652","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:e7c5cb2f17079327622e0461a98f4f8c9b42642f8a4c5555c0b054da684984a2","observation_id":"6b91e877-6321-453c-8435-c12b36c309a9","resolution":{"observed_at":"2026-05-17T23:42:13.008553Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.23427","last_updated":"2025-08-30T15:02:00Z","snapshot_observed_at":"2026-07-06T21:01:00.397040Z","submitted_at":"2025-03-30T13:00:52Z","title":"CoRanking: Collaborative Ranking with Small and Large Ranking Agents","version":3},"cited_work":{"arxiv_id":"2503.23427","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.23427","snapshot_observed_at":"2026-07-03T14:38:29.046848Z","title":"Coranking: Collaborative ranking with small and large ranking agents","venue":null,"work_id":"1587f586-bc5e-4d18-b21f-65bdced9cbbd","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2503.23427","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:124d8e2dd342a1b7b503d5615c54340315dd3b7234b3a7fdef05a5e7f73cca8c","observation_id":"9f55bff7-9006-4eeb-9301-13d1dd2d6b01","resolution":{"observed_at":"2026-05-17T23:42:13.012479Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Large language models are effective text rankers with pairwise ranking prompting","venue":null,"work_id":"240ed632-0930-4615-8536-8834266855ed","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:1762ff25f672af521e201a2489a61485c41547b407408014be6fe9bbccc3714d","observation_id":"ee7f2a66-acd4-4cdd-a8e5-8406db9c5303","resolution":{"observed_at":"2026-05-17T23:42:13.308963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2506.11603","last_updated":"2025-06-16T03:35:12Z","snapshot_observed_at":"2026-07-06T21:41:38.400347Z","submitted_at":"2025-06-13T09:17:36Z","title":"TongSearch-QR: Reinforced Query Reasoning for Retrieval","version":2},"cited_work":{"arxiv_id":"2506.11603","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.11603","snapshot_observed_at":"2026-06-29T21:43:59.839553Z","title":"Tongsearch-qr: Reinforced query reasoning for retrieval","venue":null,"work_id":"099256f8-e1dc-4ef8-9add-37e3604e309d","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2506.11603","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:165a916701eac5e587f21a7f36285e040c8105798727d6ca796793b9ac95dc34","observation_id":"3b6a966c-143a-4524-af00-98b06bf21132","resolution":{"observed_at":"2026-05-17T23:42:13.013461Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2508.07050","last_updated":"2026-04-22T03:08:54Z","snapshot_observed_at":"2026-07-06T22:10:31.258024Z","submitted_at":"2025-08-09T17:26:18Z","title":"ReasonRank: Empowering Passage Ranking with Strong Reasoning Ability","version":3},"cited_work":{"arxiv_id":"2508.07050","doi":null,"metadata_source":"pith","pith_arxiv_id":"2508.07050","snapshot_observed_at":"2026-07-04T05:49:36.512655Z","title":"ReasonRank: Empowering Passage Ranking with Strong Reasoning Ability","venue":"cs.IR","work_id":"0b6808b1-8daf-4f46-a1bc-6dd18c2857f2","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2508.07050","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:09e9984d155fca75bcdd0bbc22afafea6f1b02ab8bcc50eb2572ae7c737d78c4","observation_id":"e4338214-538c-4f38-b1b0-d811772f88c6","resolution":{"observed_at":"2026-05-17T23:42:13.003811Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02156","last_updated":"2023-05-03T14:45:34Z","snapshot_observed_at":"2026-07-06T15:22:47.702437Z","submitted_at":"2023-05-03T14:45:34Z","title":"Zero-Shot Listwise Document Reranking with a Large Language Model","version":1},"cited_work":{"arxiv_id":"2305.02156","doi":"10.48550/arxiv.2305.02156","metadata_source":"arxiv_reference","pith_arxiv_id":"2305.02156","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Yao Meng, Chenyan Xiong, Zhenghao Liu, Zhiyuan Liu, and Jiawei Han","venue":"arXiv (Cornell University)","work_id":"d00110ef-6ed4-4d60-93d9-2108f45f7e09","year":2023},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2305.02156","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:8c9c724234db7e662dba9d1a1a8902fc22464d91b8f63a32112e5c9c4c4038d2","observation_id":"49eae76d-cc01-4a6d-894a-69347bcac2dd","resolution":{"observed_at":"2026-05-17T23:42:13.038817Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2508.07995","doi":"10.48550/arxiv.2508.07995","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Diver: A multi-stage approach for reasoning-intensive information retrieval","venue":"arXiv (Cornell University)","work_id":"eafaead9-867b-43d3-ae44-1c8a2e1d8e1c","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:97784bc21198cf55c423ac94595a1a5067323e50c98ab5c7a3def1bf378fb3ec","observation_id":"b36eb106-c7d0-4a5b-b118-cf9228fbed8f","resolution":{"observed_at":"2026-05-17T23:42:13.018713Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Deepseekmath: Pushing the limits of mathematical reasoning in open language models","venue":null,"work_id":"fda475f4-950d-404f-953d-10036dd72e85","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:6eb421a3e29b4f9697389ce435396b867febcb452da607f2b377fd1732b5b016","observation_id":"71e5a02a-870f-4ed0-8fb0-81f72626f506","resolution":{"observed_at":"2026-05-17T23:42:13.284775Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"2402.03300","doi":"10.1016/0004-3702(73)90011-8","metadata_source":"pith","pith_arxiv_id":"2402.03300","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models","venue":"cs.CL","work_id":"c5006563-f3ec-438a-9e35-b7b484f34828","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2402.03300","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:ad1de2733ced2a361fd68366ff3e6da9743cf92497cd7d7d5d5886871043f916","observation_id":"1c57b248-e7d5-4e50-91a2-cc7bd960ac17","resolution":{"observed_at":"2026-05-17T23:42:12.967932Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.12883","last_updated":"2025-03-26T07:37:26Z","snapshot_observed_at":"2026-07-06T18:48:04.031944Z","submitted_at":"2024-07-16T17:58:27Z","title":"BRIGHT: A Realistic and Challenging Benchmark for Reasoning-Intensive Retrieval","version":4},"cited_work":{"arxiv_id":"2407.12883","doi":"10.48550/arxiv.2407.12883","metadata_source":"arxiv_reference","pith_arxiv_id":"2407.12883","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"11 Qwen Team","venue":"arXiv (Cornell University)","work_id":"e852bdf5-55e0-4238-937e-a1542b797282","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2407.12883","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:48eb24ec14d59d6b809f5e1f2cc60ce1116b1843b1237a57d21a6c8b61724dd0","observation_id":"2992265e-56b4-433c-b760-cca24f3eb372","resolution":{"observed_at":"2026-05-17T23:42:13.049596Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14558","last_updated":"2026-04-03T16:04:57Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-05-20T16:15:30Z","title":"R2MED: A Benchmark for Reasoning-Driven Medical Retrieval","version":2},"cited_work":{"arxiv_id":"2505.14558","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.14558","snapshot_observed_at":"2026-07-04T11:59:51.264581Z","title":"R2MED: A Benchmark for Reasoning-Driven Medical Retrieval","venue":"cs.IR","work_id":"a5811f7f-bc28-4a0c-b19d-17015acb420e","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2505.14558","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:56a60f1f8fe2af51b5dee873eafdf3c6f807616a44ba1b17640f5cb4465da79f","observation_id":"61171d3a-c751-4c41-9114-783d313073a2","resolution":{"observed_at":"2026-05-17T23:42:13.085365Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08663","last_updated":"2021-10-21T01:18:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-17T23:29:55Z","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","version":4},"cited_work":{"arxiv_id":"2104.08663","doi":"10.48550/arxiv.2104.08663","metadata_source":"pith","pith_arxiv_id":"2104.08663","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","venue":"cs.IR","work_id":"c5f7f027-ac36-4b07-b824-0eca2f310641","year":2021},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2104.08663","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:c9e363c55188d9c367c4a36d0f6283b9743e415e4dd459b0f0feabb39e3c4a62","observation_id":"c250fddc-3797-489d-a1db-75d174b08160","resolution":{"observed_at":"2026-05-17T23:42:12.968950Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-06-02T00:57:45.853409+00:00","source":"crossref_status_cache"},{"observed_at":"2026-06-02T00:57:45.853409+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Rank-k: Test-time reasoning for listwise reranking","venue":null,"work_id":"486a27e7-86f3-46b5-ae30-783f760a5437","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:dd99da80df2900782c2e5e28f9716e21ac37ee5546abf5bb58fe2e64b2ac5741","observation_id":"06c9974b-94f0-40e8-b240-fc466c4b365c","resolution":{"observed_at":"2026-05-17T23:42:13.314704Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-06T02:47:50.267552Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"cited_work":{"arxiv_id":"2505.14432","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.14432","snapshot_observed_at":"2026-07-03T06:47:42.689949Z","title":"Available: https://arxiv.org/abs/2505.14432","venue":null,"work_id":"24ea37c8-1aad-453b-a120-3aec87358b9e","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2505.14432","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:c91d5a130b76e41a7ba20887da19d18c95d7a3ff61c565c82c415dce7121218c","observation_id":"06079408-979e-4b1f-87a2-f92970b54855","resolution":{"observed_at":"2026-05-17T23:42:12.933833Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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-swift: A comprehensive framework for training and deploying large language and multimodal models","venue":null,"work_id":"030cc56a-8700-4d75-88cc-3dd71170daf8","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:b95b030cbb8f13f4bf02f5967fa09411456d496c033978760f41fed0fd69e5a0","observation_id":"a5438758-d4f4-4dbd-bf51-3bdb01fcfe65","resolution":{"observed_at":"2026-05-17T23:42:13.283645Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"Available: https://github.com/modelscope/ ms-swift","venue":null,"work_id":"5aa51803-5073-4def-8806-682affbcb7d8","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:7541332912236250dddd84166cfbf4071917f09459809b5819e68bd11bc4d5c8","observation_id":"cb4d3c27-c603-473b-984e-9dcb187a8c02","resolution":{"observed_at":"2026-05-17T23:42:13.322098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.19256","last_updated":"2024-10-02T04:01:47Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-28T06:20:03Z","title":"HybridFlow: A Flexible and Efficient RLHF Framework","version":2},"cited_work":{"arxiv_id":"2409.19256","doi":"10.1145/3689031.3696075.url:","metadata_source":"pith","pith_arxiv_id":"2409.19256","snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"HybridFlow: A Flexible and Efficient RLHF Framework","venue":"cs.LG","work_id":"7eb9c9f4-b322-4bba-8011-09ff8d6ad801","year":2024},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2409.19256","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:120497b5934d30a545d3780f8a68f352940995753384177ce38cc5f0a8c70496","observation_id":"34822f8d-a24a-43da-a18a-9e1800367827","resolution":{"observed_at":"2026-05-17T23:42:13.025568Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":"2106.09685","doi":"10.4088/pcc.v03n0609","metadata_source":"pith","pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","venue":"cs.CL","work_id":"0426219a-789e-4964-adc8-a04538510818","year":2021},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:b55d4e9e5aa2575fca3b3a692ec68c687fd31c1dff7e9206f9ad953f402f4cac","observation_id":"e0844400-3a3e-47eb-ab46-602c2417c44f","resolution":{"observed_at":"2026-05-17T23:42:12.961493Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.09713","last_updated":"2025-09-08T06:22:38Z","snapshot_observed_at":"2026-08-04T23:41:17.256993Z","submitted_at":"2025-09-08T06:22:38Z","title":"HANRAG: Heuristic Accurate Noise-resistant Retrieval-Augmented Generation for Multi-hop Question Answering","version":1},"cited_work":{"arxiv_id":"2509.09713","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.09713","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Hanrag: Heuristic accurate noise-resistant retrieval-augmented generation for multi-hop question answering","venue":null,"work_id":"07eeb050-dfc5-4de8-8673-21d4981a1f14","year":2025},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"cited_paper":"/paper/2509.09713","citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:e713243aaccf4e27d3b07980552ae81d154c7ffb2e79ac8808eb38bca1c844e0","observation_id":"a525c347-bb8b-4750-9e79-091b1de4d72b","resolution":{"observed_at":"2026-05-17T23:42:13.032853Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":null,"venue":null,"work_id":"1fb62464-c79a-47ca-9dd6-4a4eb1359102","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:2ec2126ecec7ec3103df9c3b1718bd09ef43cfd3f2514f64b8382797ea53534d","observation_id":"2fab77c8-6689-45bd-823e-1a82954637b8","resolution":{"observed_at":"2026-05-17T23:42:13.328066Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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 passage is **valuable** if it directly and effectively helps answer the query","venue":null,"work_id":"b65680c6-aed9-4fd0-8dcc-58b82e7775be","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:85cf30bfa3dd54be4d2f30f8068ab91ac96e09659fda1dbc01c1e948c4730579","observation_id":"36f0fd77-7245-4ecf-a80f-91f1e7886632","resolution":{"observed_at":"2026-05-17T23:42:13.302533Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"* Then, output a single JSON array containing the integer IDs of **all** provided passages","venue":null,"work_id":"7b55559c-1e88-4859-b22f-21bf020b9219","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:b70e4be35291fdd9df9a3bca172ba4f448fb8595fbcb8a0dae5cdcd1c3d9cd65","observation_id":"1e76246a-edb7-4213-bf1c-aad96a2648f0","resolution":{"observed_at":"2026-05-17T23:42:13.269962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":null,"venue":null,"work_id":"11d6059a-0847-46a8-a04b-2eb1188506e0","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:a41b144b891bb3bcb8fe8f1f697e9bbdd25b70236e7bb81761b5f951a1ceeaf2","observation_id":"1f53ff7f-fc3d-4fbd-bd40-500faf80d587","resolution":{"observed_at":"2026-05-17T23:42:13.323722Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":null,"venue":null,"work_id":"ccd46a5e-87c5-4965-9437-c91b186b26cc","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:22029ddbf174fde25e5f055b706023d777bdad8b27e9a577a31eca60b035c543","observation_id":"9fcad6e2-48d5-4d8e-89b4-a8707e65e26c","resolution":{"observed_at":"2026-05-17T23:42:13.325272Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":null,"venue":null,"work_id":"79ff1870-0fab-44df-baac-e3ec0fb601d5","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:fb53400c9e8b072f784e5ed529667a461ce397e098bc8c78b7b05d23d676cbf2","observation_id":"84d36076-fd4e-4b75-b2c1-aa16f2e17496","resolution":{"observed_at":"2026-05-17T23:42:13.310378Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":null,"venue":null,"work_id":"431775c2-0af5-47fa-bf6e-595875114c1c","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:1ccf89b060ca1bda3df6851bd225fe5b6fd865e894f4c6b57d1e6ffcd794ed35","observation_id":"bcf1f35f-6487-425f-856d-9cdefbb9f511","resolution":{"observed_at":"2026-05-17T23:42:13.350431Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":null,"venue":null,"work_id":"1ac2657d-bb1b-4d54-80e1-5753520834a6","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:64886ae070f8681a89e8be158206764b5ebbeec97c042a374a5e8cfc57153098","observation_id":"cc80c0a2-719e-46c4-a8fc-b2e102b7d5e7","resolution":{"observed_at":"2026-05-17T23:42:13.298679Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+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":"‘json {”[1]","venue":null,"work_id":"c6c694a8-556b-496f-a5c2-92f8df8d1364","year":null},"citing_paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-17T23:41:47.052697Z"},"links":{"citing_paper":"/paper/2511.11653"},"observation_digest":"sha256:3ea1a45da3ddcf248d30054536e3d613f960e9e8ac9b6db82396985924e9853c","observation_id":"bd1cd302-28f1-4c2b-a8e5-807fad24c6a7","resolution":{"observed_at":"2026-05-17T23:42:13.307051Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-06T06:34:29.942622+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2511.11653","last_updated":"2026-04-30T09:50:26Z","latest_version":3,"primary_category":"cs.IR","snapshot_observed_at":"2026-07-06T22:35:51.341917Z","submitted_at":"2025-11-10T15:25:31Z","title":"GroupRank: A Groupwise Paradigm for Effective and Efficient Passage Reranking with LLMs"},"reference_resolution":{"displayed":53,"state_counts":{"malformed_identifier":0,"metadata_mismatch":5,"parse_uncertain":0,"unresolved":6,"verified_exact":25,"verified_fuzzy":17},"total_outbound_references":53},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 53 of 53 outbound references and 3 inbound Pith citation observations for arXiv:2511.11653."}