{"as_of":"2026-08-10T08:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e28eee8e5613e7b94dc5948dc1d4b659ab7b37aec5aa35a06815c5a593e7bfa","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":30,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:54:53.882165Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":1,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-07T14:54:53.882165Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.16886","last_updated":"2025-05-22T16:41:37Z","snapshot_observed_at":"2026-08-08T07:18:33.490788Z","submitted_at":"2025-05-22T16:41:37Z","title":"Don't \"Overthink\" Passage Reranking: Is Reasoning Truly Necessary?","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T14:54:53.882165Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2505.16886"},"observation_digest":"sha256:5f08c2c69873d9e07aeebe959468da0734c50f2545a9aab18780a422963e54b1","observation_id":"74538d28-c685-4bbf-88c4-f6b6c617b7dd","resolution":{"observed_at":"2026-08-07T14:54:53.882165Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-07T14:35:19.963051Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.18405","last_updated":"2025-05-27T04:20:31Z","snapshot_observed_at":"2026-08-09T09:27:17.241700Z","submitted_at":"2025-05-23T22:18:32Z","title":"RaDeR: Reasoning-aware Dense Retrieval Models","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-07T14:35:19.963051Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2505.18405"},"observation_digest":"sha256:5e875978fd07ccce37b001044ee2792b9dccff6e933e156910512cedd77345e9","observation_id":"26c5bb2c-98bc-43a0-abe8-6f352bb1e534","resolution":{"observed_at":"2026-08-07T14:35:19.963051Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-07T12:57:25.687515Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.23059","last_updated":"2025-05-29T04:04:25Z","snapshot_observed_at":"2026-08-09T07:17:21.514225Z","submitted_at":"2025-05-29T04:04:25Z","title":"From Token to Action: State Machine Reasoning to Mitigate Overthinking in Information Retrieval","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T12:57:25.687515Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2505.23059"},"observation_digest":"sha256:42d118452fc5f977e720bf334eb677b82ede399bad4b9359b55a74564c26a979","observation_id":"8e788f6b-9314-48e4-b0d3-b780e58e4c50","resolution":{"observed_at":"2026-08-07T12:57:25.687515Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2506.03487","last_updated":"2026-04-15T22:31:00Z","snapshot_observed_at":"2026-08-07T20:50:07.727866Z","submitted_at":"2025-06-04T02:00:44Z","title":"ProRank: Prompt Warmup via Reinforcement Learning for Small Language Models Reranking","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-19T11:57:59.100971Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2506.03487"},"observation_digest":"sha256:b6401bae456e65b5400d2e9cb492da3f1b7ea56321c3b9264481b340d0077f3f","observation_id":"017179e2-8c96-4aeb-bcc7-67b45be02014","resolution":{"observed_at":"2026-05-19T12:02:16.830713Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-07T04:07:19.443757Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.11603","last_updated":"2025-06-16T03:35:12Z","snapshot_observed_at":"2026-08-09T16:27:43.938825Z","submitted_at":"2025-06-13T09:17:36Z","title":"TongSearch-QR: Reinforced Query Reasoning for Retrieval","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T04:07:19.443757Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2506.11603"},"observation_digest":"sha256:06272f20aa22922da4f8de8fd0756aee79fb502726a49842be402b681759f4de","observation_id":"76c7ff2b-7f30-4014-86bd-96075cc57ae5","resolution":{"observed_at":"2026-08-07T04:07:19.443757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T13:36:39.787176Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.00520","last_updated":"2025-08-30T14:56:53Z","snapshot_observed_at":"2026-08-08T13:53:31.107432Z","submitted_at":"2025-08-30T14:56:53Z","title":"ERank: Fusing Supervised Fine-Tuning and Reinforcement Learning for Effective and Efficient Text Reranking","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-05T13:36:39.787176Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2509.00520"},"observation_digest":"sha256:c655e2c841279df0bb2c67f29a83cadff6114df7a483d9c353d1d735c59d8b2e","observation_id":"fe9669c1-e180-4caa-91b6-d52881ecb1e1","resolution":{"observed_at":"2026-08-05T13:36:39.787176Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-04T22:49:21.955993Z","title":"Rank1: Test-time compute for reranking in information retrieval.arXiv preprint arXiv:2502.18418, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07163","last_updated":"2025-09-08T19:24:09Z","snapshot_observed_at":"2026-08-08T16:43:29.648337Z","submitted_at":"2025-09-08T19:24:09Z","title":"Beyond Sequential Reranking: Reranker-Guided Search Improves Reasoning Intensive Retrieval","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T22:49:21.955993Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2509.07163"},"observation_digest":"sha256:544a45747a63f4e9ea5d52142d806be7d50cb8b64e7a3ced580b51509aabeae8","observation_id":"b01b800f-c41e-45cf-9306-92a21c779fb0","resolution":{"observed_at":"2026-08-04T22:49:21.955993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-04T22:37:58.322861Z","title":"Lawrie, and Benjamin Van Durme","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.07253","last_updated":"2025-09-08T22:11:10Z","snapshot_observed_at":"2026-08-09T12:46:22.534535Z","submitted_at":"2025-09-08T22:11:10Z","title":"Benchmarking Information Retrieval Models on Complex Retrieval Tasks","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-04T22:37:58.322861Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2509.07253"},"observation_digest":"sha256:4aee9b124b739f1fd1f1f366fcb4782e35aec3b8d37a3c9b6bc188d944c8c370","observation_id":"83c493c8-7327-4827-9d3f-758fcd58c3f3","resolution":{"observed_at":"2026-08-04T22:37:58.322861Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2603.08819","last_updated":"2026-06-20T21:46:17Z","snapshot_observed_at":"2026-08-10T00:08:38.383483Z","submitted_at":"2026-03-09T18:20:20Z","title":"Beyond Relevance: On the Relationship Between Retrieval and RAG Information Coverage","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-15T13:10:06.367994Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2603.08819"},"observation_digest":"sha256:1fe773beb4edcc9fb07307fb31cf62d8ffb5bcf57cf6c47876f5ba678f248c95","observation_id":"c279fc37-a368-4dc0-8362-e5e431a02377","resolution":{"observed_at":"2026-05-15T13:10:49.387832Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2604.07079","last_updated":"2026-04-08T13:35:09Z","snapshot_observed_at":"2026-07-06T22:55:24.459130Z","submitted_at":"2026-04-08T13:35:09Z","title":"MARVEL: Multimodal Adaptive Reasoning-intensiVe Expand-rerank and retrievaL","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-05-10T17:51:16.675856Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2604.07079"},"observation_digest":"sha256:6e0b4c087b67975a0bae80ef6c87bc6ed908a32b59d5c47a2c5a936fa49839f6","observation_id":"8e3828a5-dac6-4367-8dbf-053133845920","resolution":{"observed_at":"2026-05-11T06:00:58.332087Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2604.07220","last_updated":"2026-04-08T15:41:42Z","snapshot_observed_at":"2026-07-06T22:55:33.502756Z","submitted_at":"2026-04-08T15:41:42Z","title":"HIVE: Query, Hypothesize, Verify An LLM Framework for Multimodal Reasoning-Intensive Retrieval","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-05-10T17:22:21.682534Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2604.07220"},"observation_digest":"sha256:d19bd8620cae02de17f4035a4b4f9f69acccf582d7fcdb0545e9cf7ab03b9b4f","observation_id":"b026acfb-06cd-4c88-a3b1-d9d59cd76451","resolution":{"observed_at":"2026-05-11T06:56:02.608016Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2604.11025","last_updated":"2026-08-02T20:03:04Z","snapshot_observed_at":"2026-08-06T23:24:25.912298Z","submitted_at":"2026-04-13T05:49:04Z","title":"Test-time Scaling over Perception: Resolving the Grounding Paradox in Thinking with Images","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-05-10T16:38:11.785469Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2604.11025"},"observation_digest":"sha256:418fc69cc4ddbf0d0f72e38aab4ea1d337b584c2ca21d44f5a98b1ad31879e76","observation_id":"686f1e93-c69e-41ba-9395-468792fa3e37","resolution":{"observed_at":"2026-05-11T08:26:01.606395Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-04T05:31:43.656075Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2604.11025","last_updated":"2026-08-02T20:03:04Z","snapshot_observed_at":"2026-08-06T23:24:25.912298Z","submitted_at":"2026-04-13T05:49:04Z","title":"Test-time Scaling over Perception: Resolving the Grounding Paradox in Thinking with Images","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T05:31:43.656075Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2604.11025"},"observation_digest":"sha256:beb104da9f5be952da84fdbad42a74fef0494c2c0cccab6f00d258f2945260ed","observation_id":"6aaeb496-6546-42b3-83db-5ab317e78ab9","resolution":{"observed_at":"2026-08-04T05:31:43.656075Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2604.27577","last_updated":"2026-04-30T08:30:09Z","snapshot_observed_at":"2026-07-06T23:13:02.921765Z","submitted_at":"2026-04-30T08:30:09Z","title":"Reproducing Adaptive Reranking for Reasoning-Intensive IR","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-05-07T08:08:06.342207Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2604.27577"},"observation_digest":"sha256:43a9d1ff41f39d5dc5b0c68231930a96beadc36f3d81948b6eb1c902769de73b","observation_id":"626f8a30-387e-4133-9fcc-86edbcc33c2d","resolution":{"observed_at":"2026-05-12T10:01:29.384766Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","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":76,"source":"arxiv_source","source_observed_at":"2026-05-09T20:53:05.314601Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.00063"},"observation_digest":"sha256:4e3021e1beed2ad0c8c99689f3a9838d56912a5eb03c7a56657909bfedab355e","observation_id":"b589996f-4ed3-4d32-a015-4621b2480d07","resolution":{"observed_at":"2026-05-11T14:56:05.074047Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2605.00400","last_updated":"2026-05-01T04:42:13Z","snapshot_observed_at":"2026-07-06T23:13:52.304925Z","submitted_at":"2026-05-01T04:42:13Z","title":"FollowTable: A Benchmark for Instruction-Following Table Retrieval","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-05-09T19:13:05.189604Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.00400"},"observation_digest":"sha256:2069bd2645703478c456c64264f9572cae13f6fd429f6eb008b6793d40d1e098","observation_id":"34d47b37-8113-4373-821f-881591e87e4a","resolution":{"observed_at":"2026-05-09T19:15:11.299682Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2605.01399","last_updated":"2026-05-02T11:43:23Z","snapshot_observed_at":"2026-07-06T23:14:38.379875Z","submitted_at":"2026-05-02T11:43:23Z","title":"Verbal-R3: Verbal Reranker as the Missing Bridge between Retrieval and Reasoning","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-05-09T14:40:23.170932Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.01399"},"observation_digest":"sha256:21c97201fbac340a7d2267f5a99c40122d8d9cf6779ddbddad266e4890698884","observation_id":"fd7102b7-5faf-4f85-a0e4-ba10dbc3f817","resolution":{"observed_at":"2026-05-11T16:51:08.867341Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2605.04018","last_updated":"2026-05-05T17:42:50Z","snapshot_observed_at":"2026-07-06T23:16:49.553583Z","submitted_at":"2026-05-05T17:42:50Z","title":"Rethinking Reasoning-Intensive Retrieval: Evaluating and Advancing Retrievers in Agentic Search Systems","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-07T16:06:51.876295Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.04018"},"observation_digest":"sha256:2bfa1c7a293aeed921c42ba686fd50c345722ee8c7cb980e1a0bba2389842aa0","observation_id":"0cde14d7-9efa-475c-837f-64417ff7351b","resolution":{"observed_at":"2026-05-11T23:51:42.116546Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","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":24,"source":"pdf_text","source_observed_at":"2026-05-14T18:32:24.957899Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.13137"},"observation_digest":"sha256:503bfe0d94962f08ada88702a8098603a110107910808151cdc70271568ea46e","observation_id":"fc4018e7-4a94-4d0e-b35a-b2a88c78b690","resolution":{"observed_at":"2026-05-14T18:32:34.111262Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","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":24,"source":"pdf_text","source_observed_at":"2026-05-15T03:05:04.196270Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.13137"},"observation_digest":"sha256:1b88b93146dd2adf69710ee56c4286183542e09a7b0b03b076c508fed497ddfd","observation_id":"049db4ec-8522-4ad3-b59f-7ae2f15ba3a4","resolution":{"observed_at":"2026-05-15T03:09:44.086713Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2605.18767","last_updated":"2026-04-13T08:56:09Z","snapshot_observed_at":"2026-07-06T23:29:33.702647Z","submitted_at":"2026-04-13T08:56:09Z","title":"DualView: Adaptive Local-Global Fusion for Multi-Hop Document Reranking","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-21T00:25:45.061229Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.18767"},"observation_digest":"sha256:9d8ed649693ccac5481a8516e4e46a9a8b620e08ae1fb0258f74e8a42995d1ea","observation_id":"b57f1736-03bf-4483-af84-011314b094f2","resolution":{"observed_at":"2026-05-21T00:29:17.174985Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2605.20683","last_updated":"2026-05-21T04:53:43Z","snapshot_observed_at":"2026-08-03T20:30:59.841300Z","submitted_at":"2026-05-20T03:52:31Z","title":"Layer-wise Token Compression for Efficient Document Reranking","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-21T03:02:34.320850Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.20683"},"observation_digest":"sha256:c1febddbb801a229f4294f03674bb93a99a3cf7f23141059fe068858b4dd9d2f","observation_id":"6fb815c6-8120-412d-81f5-389bf8da64b0","resolution":{"observed_at":"2026-05-21T03:03:55.891422Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2605.20683","last_updated":"2026-05-21T04:53:43Z","snapshot_observed_at":"2026-08-03T20:30:59.841300Z","submitted_at":"2026-05-20T03:52:31Z","title":"Layer-wise Token Compression for Efficient Document Reranking","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-05-22T09:18:39.895672Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.20683"},"observation_digest":"sha256:179196b1962d2b38be5c66fb03c0f90397f9bfacc3f3f764cea9a3a33e15c841","observation_id":"bd5e15ab-e842-4443-a4a1-48f8147694f0","resolution":{"observed_at":"2026-05-22T09:21:21.683276Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2605.22478","last_updated":"2026-07-18T11:55:12Z","snapshot_observed_at":"2026-08-03T06:10:22.493856Z","submitted_at":"2026-05-21T13:36:38Z","title":"DeliCIR: Memory-Guided Test-Time Deliberation via Multi-Agent Collaboration for Composed Image Retrieval","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-05-22T06:40:58.445504Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.22478"},"observation_digest":"sha256:b50963d9b714f75a1f8e7aa2a6dbff38325836882ee1ba4029ac5fbe6156da93","observation_id":"25fa40db-b03c-4a11-aa6a-e58d3b469901","resolution":{"observed_at":"2026-05-22T06:41:10.239541Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2605.22478","last_updated":"2026-07-18T11:55:12Z","snapshot_observed_at":"2026-08-03T06:10:22.493856Z","submitted_at":"2026-05-21T13:36:38Z","title":"DeliCIR: Memory-Guided Test-Time Deliberation via Multi-Agent Collaboration for Composed Image Retrieval","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-06-30T17:10:54.790735Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.22478"},"observation_digest":"sha256:e0ed976200a99dd56a6cbb83302eabc00c8aa2ea38f71a49386805521d8513b6","observation_id":"1c373670-0a4e-428b-98d1-441bc939a563","resolution":{"observed_at":"2026-06-30T17:14:56.875920Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-02T13:28:25.167268Z","title":"Rank1: Test-time compute for reranking in information retrieval,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.22478","last_updated":"2026-07-18T11:55:12Z","snapshot_observed_at":"2026-08-03T06:10:22.493856Z","submitted_at":"2026-05-21T13:36:38Z","title":"DeliCIR: Memory-Guided Test-Time Deliberation via Multi-Agent Collaboration for Composed Image Retrieval","version":4},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-02T13:28:25.167268Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.22478"},"observation_digest":"sha256:d972808a7c50b9cfc3c195a5b73e3969f9eec5c809a145113b2ff18c0584c44b","observation_id":"eb815006-76b9-4b6e-8b72-5800139dc01e","resolution":{"observed_at":"2026-08-02T13:28:25.167268Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2605.26352","last_updated":"2026-08-06T01:35:38Z","snapshot_observed_at":"2026-08-09T23:09:45.111534Z","submitted_at":"2026-05-25T21:56:29Z","title":"RICE-PO: Turning Retrieval Interactions into Credit Signals for Reasoning Agents","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-06-29T21:24:11.882268Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.26352"},"observation_digest":"sha256:dbf975da1e527d90daa1725e627de9403c0624c0fddeea21f8fba3f611a13ea8","observation_id":"8855eef4-aeec-4f27-8878-d8d61eb7e263","resolution":{"observed_at":"2026-06-29T21:43:59.831955Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-04T05:01:26.226102Z","title":"Rank1: Test-time compute for reranking in information retrieval.arXiv preprint arXiv:2502.18418, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.26352","last_updated":"2026-08-06T01:35:38Z","snapshot_observed_at":"2026-08-09T23:09:45.111534Z","submitted_at":"2026-05-25T21:56:29Z","title":"RICE-PO: Turning Retrieval Interactions into Credit Signals for Reasoning Agents","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T05:01:26.226102Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2605.26352"},"observation_digest":"sha256:dbf5dd442f162550ae45610c36c66971d35189658625c8ff1e2bfbb46bfbf113","observation_id":"78147363-8cab-4cfb-940a-91fbc75db77d","resolution":{"observed_at":"2026-08-04T05:01:26.226102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":"2502.18418","doi":"10.48550/arxiv.2502.18418","metadata_source":"arxiv_reference","pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Rank1: Test-time compute for reranking in information retrieval","venue":"ArXiv.org","work_id":"b9cc9a44-3c1f-44b1-9e33-e06dd8b37152","year":2025},"citing_paper":{"arxiv_id":"2606.01070","last_updated":"2026-05-31T07:26:40Z","snapshot_observed_at":"2026-08-05T16:59:56.884564Z","submitted_at":"2026-05-31T07:26:40Z","title":"Test-Time Training for Zero-Resource Dense Retrieval Reranking","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-06-28T16:49:36.972275Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2606.01070"},"observation_digest":"sha256:3a964e9024d893d2dc34478cc24804120ebef37936488e114cd7e4dd5ca67531","observation_id":"5dfa548b-46ee-4206-ad86-2fe56101e6d4","resolution":{"observed_at":"2026-07-01T21:36:14.715986Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.18418","snapshot_observed_at":"2026-08-01T03:15:28.906829Z","title":"arXiv preprint arXiv:2502.18418 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.25182","last_updated":"2026-07-28T01:23:04Z","snapshot_observed_at":"2026-08-09T13:22:29.575856Z","submitted_at":"2026-07-28T01:23:04Z","title":"TabRank: Chain-of-Thought Distillation for Table Re-Rankers","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T03:15:28.906829Z"},"links":{"cited_paper":"/paper/2502.18418","citing_paper":"/paper/2607.25182"},"observation_digest":"sha256:fcec36483fbc2277936a3a7ed9805cbc84293f66f09bb023613043339240e1f7","observation_id":"3d4e2e48-1f7b-4370-85c7-8de414bac40f","resolution":{"observed_at":"2026-08-01T03:15:28.906829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2502.18418/citation-record","integrity":"/paper/2502.18418/integrity","json":"/paper/2502.18418/citation-record.json","paper":"/paper/2502.18418"},"outbound":[],"paper":{"arxiv_id":"2502.18418","last_updated":"2025-08-08T14:48:31Z","latest_version":2,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T17:49:24.521806Z","submitted_at":"2025-02-25T18:14:06Z","title":"Rank1: Test-Time Compute for Reranking in Information Retrieval"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 30 inbound Pith citation observations for arXiv:2502.18418."}