{"as_of":"2026-08-08T22:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3f306e364419b0db2e133be0f35f7052dc8ee8cf42969ba7bb9af6f0f9c251f3","coverage":[{"denominator":39,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":39,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:40:12.195943Z","state":"measured"},{"denominator":46,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":46,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T21:06:42.966698Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T06:47:42.689949Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","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:065c88e9742ed99a2aa9dbf852a84f59dd879e0b457c7a083eb2c05742cfbe33","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-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.14432","snapshot_observed_at":"2026-08-02T21:06:42.966698Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21456","last_updated":"2026-06-19T07:08:02Z","snapshot_observed_at":"2026-08-08T07:05:09.926952Z","submitted_at":"2026-02-25T00:18:07Z","title":"Revisiting Text Ranking in Deep Research","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-02T21:06:42.966698Z"},"links":{"cited_paper":"/paper/2505.14432","citing_paper":"/paper/2602.21456"},"observation_digest":"sha256:63e98cb7c4fb1c395f433eae8023a94aa8e3178e3a078c4f6c63b9ee1d2577f5","observation_id":"21bff691-e053-44b0-aa52-ec93ec63a1f4","resolution":{"observed_at":"2026-08-02T21:06:42.966698Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","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":"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":81,"source":"arxiv_source","source_observed_at":"2026-05-09T20:53:05.314601Z"},"links":{"cited_paper":"/paper/2505.14432","citing_paper":"/paper/2605.00063"},"observation_digest":"sha256:7138908cb2e5c64019b4ebd264a63c03a237081d22d976de7d43cd8e6e8384d1","observation_id":"4425a11d-6530-4c6b-9a35-64698cd6a0d9","resolution":{"observed_at":"2026-05-11T14:56:04.983901Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","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":"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":35,"source":"pdf_text","source_observed_at":"2026-05-21T00:25:45.061229Z"},"links":{"cited_paper":"/paper/2505.14432","citing_paper":"/paper/2605.18767"},"observation_digest":"sha256:f1542b23e981d9b8dd78f9a3014a521209306fef43cf91840c36f1c18d9987f5","observation_id":"e79a398f-43d7-45e1-b78f-1a26e07daa44","resolution":{"observed_at":"2026-05-21T00:29:17.438018Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","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":"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":46,"source":"pdf_text","source_observed_at":"2026-05-21T03:02:34.320850Z"},"links":{"cited_paper":"/paper/2505.14432","citing_paper":"/paper/2605.20683"},"observation_digest":"sha256:629d81820a252eea9cbc44d68d6f6e06511999b6cdbfb91f4f4b5878dd0025ca","observation_id":"3956b93f-c92b-4082-9221-28244549a373","resolution":{"observed_at":"2026-05-21T03:03:55.880050Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","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":"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":46,"source":"pdf_text","source_observed_at":"2026-05-22T09:18:39.895672Z"},"links":{"cited_paper":"/paper/2505.14432","citing_paper":"/paper/2605.20683"},"observation_digest":"sha256:ab22b4896ecbca758326253ee7f238ef60fab71ff5a68ff7eca489bde234a72a","observation_id":"b694f52f-3dfc-4748-a782-91e0a40e9ed8","resolution":{"observed_at":"2026-05-22T09:21:21.597687Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","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":"2607.02387","last_updated":"2026-07-02T16:24:16Z","snapshot_observed_at":"2026-07-07T00:07:52.110955Z","submitted_at":"2026-07-02T16:24:16Z","title":"Bringing Agentic Search to Earth Observation Data Discovery","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-07-03T06:43:42.486772Z"},"links":{"cited_paper":"/paper/2505.14432","citing_paper":"/paper/2607.02387"},"observation_digest":"sha256:2f612597129db829224b3d04b92fdfa450208df36a49c0048ec8dfef34aa9ebe","observation_id":"1aba2038-6e6f-48ae-9235-9504197e35b6","resolution":{"observed_at":"2026-07-03T06:47:42.691290Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.14432/citation-record","integrity":"/paper/2505.14432/integrity","json":"/paper/2505.14432/citation-record.json","paper":"/paper/2505.14432"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"1712.05877","last_updated":"2017-12-15T23:56:52Z","snapshot_observed_at":"2026-07-06T06:14:38.280461Z","submitted_at":"2017-12-15T23:56:52Z","title":"Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inference","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.05877","snapshot_observed_at":"2026-08-07T15:40:09.281407Z","title":"antization and training of neural networks for e cient integer-arithmetic-only inference.arXiv preprint arXiv:1712.05877,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.281407Z"},"links":{"cited_paper":"/paper/1712.05877","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:1f9356f1faae575eb762ac0437dc40e4b1f6679770fb8dfc662f6bbc252c9d6f","observation_id":"b8a36729-3368-4bc4-857f-17b87b47c847","resolution":{"observed_at":"2026-08-07T15:40:09.281407Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.13962","last_updated":"2025-07-18T01:01:54Z","snapshot_observed_at":"2026-08-07T22:55:54.779077Z","submitted_at":"2025-02-19T18:58:31Z","title":"Is That Your Final Answer? Test-Time Scaling Improves Selective Question Answering","version":2},"cited_work":{"arxiv_id":"2502.13962","doi":null,"metadata_source":"pith","pith_arxiv_id":"2502.13962","snapshot_observed_at":"2026-08-07T15:40:13.157265Z","title":"Is That Your Final Answer? Test-Time Scaling Improves Selective Question Answering","venue":"cs.CL","work_id":"2135d180-45d5-4879-990c-c01dab79b6b1","year":2025},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.642809Z"},"links":{"cited_paper":"/paper/2502.13962","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:14b7b1735f87e7884bb485dc3c269d85a74cfc94b059966008635839308ccd98","observation_id":"74fb4a49-60ef-4f58-84e3-b02c02300940","resolution":{"observed_at":"2026-08-07T15:40:13.228905Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.04906","last_updated":"2020-09-30T21:27:13Z","snapshot_observed_at":"2026-07-06T09:11:26.109763Z","submitted_at":"2020-04-10T04:53:17Z","title":"Dense Passage Retrieval for Open-Domain Question Answering","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.04906","snapshot_observed_at":"2026-08-07T15:40:09.716087Z","title":"Dense passage retrieval for open-domain question answer- ing.arXiv preprint arXiv:2004.04906,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.716087Z"},"links":{"cited_paper":"/paper/2004.04906","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:2e552d732476e643011cc0d18a4813792370ef6c499f35eb719758f79c86ae6a","observation_id":"0a60c796-6eb4-4dbb-a35f-22c905ef5a9a","resolution":{"observed_at":"2026-08-07T15:40:09.716087Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.06789","last_updated":"2024-03-11T15:04:55Z","snapshot_observed_at":"2026-08-06T04:34:33.497904Z","submitted_at":"2024-03-11T15:04:55Z","title":"SPLADE-v3: New baselines for SPLADE","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.06789","snapshot_observed_at":"2026-08-07T15:40:09.786453Z","title":"Splade-v3: New baselines for splade.arXiv preprint arXiv:2403.06789, 2024a","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.786453Z"},"links":{"cited_paper":"/paper/2403.06789","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:9a233f90d9a471e302cb7db530df97be756fc8a7afd110201ae4e825021096b9","observation_id":"633dda2b-8632-4db6-b6ce-a3dcc5f3628b","resolution":{"observed_at":"2026-08-07T15:40:09.786453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:14.201527Z","title":"Dawn Lawrie, Sean MacAvaney, James Mayfield, Paul McNamee, Douglas W","venue":null,"work_id":"edefd039-705e-40c6-8656-be2d92bfc138","year":2022},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.838312Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:d8377cd4622683232163e1cb68b75b0831b6ba3728654d7da4e268830e9f58bc","observation_id":"4007e1ac-ec0e-4228-86ff-788198211d71","resolution":{"observed_at":"2026-08-07T15:40:14.292272Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:14.057290Z","title":"Oard, Luca Soldanini, and Eugene Yang","venue":null,"work_id":"3151014b-71a9-4b68-8842-9399f823eb43","year":2023},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.912060Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:cdec5d033ad6a6cc84a2e37bef13c3ba12b15348d6eef0c1cb2c3a68369931f2","observation_id":"3512c01e-2c50-4fc7-91c7-f490d69184f7","resolution":{"observed_at":"2026-08-07T15:40:14.102556Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2305.02156","last_updated":"2023-05-03T14:45:34Z","snapshot_observed_at":"2026-08-07T22:52:50.160521Z","submitted_at":"2023-05-03T14:45:34Z","title":"Zero-Shot Listwise Document Reranking with a Large Language Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.02156","snapshot_observed_at":"2026-08-07T15:40:10.007942Z","title":"Zero-shot listwise document reranking with a large language model.arXiv preprint arXiv:2305.02156,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.007942Z"},"links":{"cited_paper":"/paper/2305.02156","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:6fe815f080c50f233571ba79220e458c161a7cdb90afff23e6f35d57b1870396","observation_id":"4a2a0886-6085-4156-aa7b-09c888139590","resolution":{"observed_at":"2026-08-07T15:40:10.007942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.07316","last_updated":"2023-03-19T13:37:01Z","snapshot_observed_at":"2026-07-06T14:04:58.943383Z","submitted_at":"2022-10-13T19:42:08Z","title":"MTEB: Massive Text Embedding Benchmark","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.07316","snapshot_observed_at":"2026-08-07T15:40:10.096608Z","title":"Mteb: Massive text embedding benchmark.arXiv preprint arXiv:2210.07316,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.096608Z"},"links":{"cited_paper":"/paper/2210.07316","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:c40fe419da32cbfc45ce83ce45ab1130bf81e742b789381befa6aa19e751fad8","observation_id":"58561c39-0b0c-4e3b-958f-deff794c97bd","resolution":{"observed_at":"2026-08-07T15:40:10.096608Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.19393","last_updated":"2025-03-01T06:07:39Z","snapshot_observed_at":"2026-07-06T20:29:11.710285Z","submitted_at":"2025-01-31T18:48:08Z","title":"s1: Simple test-time scaling","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.19393","snapshot_observed_at":"2026-08-07T15:40:10.193996Z","title":"s1: Simple test-time scaling.arXiv preprint arXiv:2501.19393,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.193996Z"},"links":{"cited_paper":"/paper/2501.19393","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:e5a2583c7d1b77d7806a7a33953286fc4bedc310520e69445f5d36fed37e9dab","observation_id":"abf1b265-0d9c-436a-804d-40b2d9723155","resolution":{"observed_at":"2026-08-07T15:40:10.193996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.20937","last_updated":"2025-05-21T11:54:57Z","snapshot_observed_at":"2026-08-07T17:40:12.481199Z","submitted_at":"2025-02-28T10:46:56Z","title":"Variations in Relevance Judgments and the Shelf Life of Test Collections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.20937","snapshot_observed_at":"2026-08-07T15:40:10.383996Z","title":"doi: 10.18653/v1/2020.findings-emnlp.63","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.383996Z"},"links":{"cited_paper":"/paper/2502.20937","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:079bf4d6a5335646efff4bfa9512090e9c6f0975bc482ef818146bbb99bd3cf9","observation_id":"5c3d3f6f-16a0-4c27-bc69-bb246a35d117","resolution":{"observed_at":"2026-08-07T15:40:10.383996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2101.05667","last_updated":"2021-01-14T15:29:54Z","snapshot_observed_at":"2026-08-07T23:48:38.118363Z","submitted_at":"2021-01-14T15:29:54Z","title":"The Expando-Mono-Duo Design Pattern for Text Ranking with Pretrained Sequence-to-Sequence Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2101.05667","snapshot_observed_at":"2026-08-07T15:40:10.495352Z","title":"The expando-mono-duo design pattern for text ranking with pretrained sequence-to-sequence models.arXiv preprint arXiv:2101.05667, 2021a","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.495352Z"},"links":{"cited_paper":"/paper/2101.05667","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:065d5ab9e0d66ac8487d0ce5fa9a562b7f65af48fef2f83ac402db7e9bbe919f","observation_id":"fc5b7e21-7127-4c29-83eb-ade653d8c518","resolution":{"observed_at":"2026-08-07T15:40:10.495352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:10.589612Z","title":"doi: 10.18653/v1/2024.findings-naacl.97","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.589612Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:c8ddb810b89d998e27e50ec2b31e04bee30f2d8c81114fcfefc34096f316186a","observation_id":"58c82ef4-61bf-4829-ab88-495b4068e206","resolution":{"observed_at":"2026-08-07T15:40:10.589612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:13.882102Z","title":"13 Preprint","venue":null,"work_id":"7636ec2c-ec26-41ab-8a86-b453f1a62ec1","year":2024},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.723237Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:f2ce49b645f69665c5226de2462a887df410a3f8a46d768b2e7277992f813d90","observation_id":"32cfd83d-ed15-4725-bf79-273678c0baff","resolution":{"observed_at":"2026-08-07T15:40:13.958045Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:13.714020Z","title":"Improving passage retrieval with zero-shot question generation","venue":null,"work_id":"6113cf40-00b1-405d-ab42-125abee2bf52","year":2022},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.842971Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:3b7547508bcb0377a6ca2118bef51264691ac55f4594dc3a962cce339d350db7","observation_id":"10f7195c-2938-46a7-8940-e5d0a944661e","resolution":{"observed_at":"2026-08-07T15:40:13.782060Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2504.03947","last_updated":"2025-06-29T18:22:03Z","snapshot_observed_at":"2026-08-07T16:08:31.752517Z","submitted_at":"2025-04-04T21:27:48Z","title":"Distillation and Refinement of Reasoning in Small Language Models for Document Re-ranking","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.03947","snapshot_observed_at":"2026-08-07T15:40:10.941659Z","title":"Distillation and refinement of reasoning in small language models for document re-ranking.arXiv preprint arXiv:2504.03947,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.941659Z"},"links":{"cited_paper":"/paper/2504.03947","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:b081db06c5cff0bb6015f4c36fa5f248dc202f16c125e3f86ca58ddcfe0b41bc","observation_id":"1454ef70-ada0-482b-aefc-204306a6a2ae","resolution":{"observed_at":"2026-08-07T15:40:10.941659Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.20595","last_updated":"2025-04-29T09:49:28Z","snapshot_observed_at":"2026-08-07T15:58:18.063496Z","submitted_at":"2025-04-29T09:49:28Z","title":"ReasonIR: Training Retrievers for Reasoning Tasks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.20595","snapshot_observed_at":"2026-08-07T15:40:11.034095Z","title":"PLAID: an efficient engine for late interaction retrieval","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.034095Z"},"links":{"cited_paper":"/paper/2504.20595","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:a168eb5311dcf8b8f7500638d6c81b416c0826eece32b36a1a46fd814103163c","observation_id":"4f9ee11f-bba8-4cb0-8167-b5e51ccd8087","resolution":{"observed_at":"2026-08-07T15:40:11.034095Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:13.563780Z","title":"Distilling reasoning capabilities into smaller language models","venue":null,"work_id":"1a14904b-5fd7-48e1-8b08-86fcefbc6af6","year":2023},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.092902Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:8dae8e1578b5d8cf6ab2edb8cddd5c2ae80d5523785fc3115406ab3be89d4062","observation_id":"42e76df8-9790-4d61-94ab-6a994600eaf6","resolution":{"observed_at":"2026-08-07T15:40:13.631281Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.03314","last_updated":"2024-08-06T17:35:05Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-08-06T17:35:05Z","title":"Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.03314","snapshot_observed_at":"2026-08-07T15:40:11.184624Z","title":"Scaling llm test-time compute opti- mally can be more effective than scaling model parameters.arXiv preprint arXiv:2408.03314,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.184624Z"},"links":{"cited_paper":"/paper/2408.03314","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:8488e2f38153028e718752fe65efef2a1ee0504be336d7f5043417f01d840f20","observation_id":"f36b3bb7-83e3-43e4-b106-e8d7d7b7654d","resolution":{"observed_at":"2026-08-07T15:40:11.184624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.12883","snapshot_observed_at":"2026-08-07T15:40:11.273656Z","title":"Bright: A realistic and challenging benchmark for reasoning-intensive retrieval.arXiv preprint arXiv:2407.12883,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.273656Z"},"links":{"cited_paper":"/paper/2407.12883","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:8519051e930d32d3a36120a0754b6de11dcfa97085be0ebb939f833ea80015e4","observation_id":"210b77af-d5c0-4675-a004-4bc94d01512d","resolution":{"observed_at":"2026-08-07T15:40:11.273656Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:13.401821Z","title":"Is chatgpt good at search? investigating large language models as re-ranking agents","venue":null,"work_id":"cf09bf81-1e92-42de-a588-c154e29fba4b","year":2023},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.388522Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:31aae1502528fef2812f7f66107e40815b8242adcdda82846fdd6b21128882d3","observation_id":"5a60f1d8-29eb-449a-85f5-7802fb78b26f","resolution":{"observed_at":"2026-08-07T15:40:13.478694Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.16098","last_updated":"2023-12-26T15:53:25Z","snapshot_observed_at":"2026-07-06T17:08:08.775293Z","submitted_at":"2023-12-26T15:53:25Z","title":"Scaling Down, LiTting Up: Efficient Zero-Shot Listwise Reranking with Seq2seq Encoder-Decoder Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2312.16098","snapshot_observed_at":"2026-08-07T15:40:11.506379Z","title":"Scaling down, litting up: Effi- cient zero-shot listwise reranking with seq2seq encoder-decoder models.arXiv preprint arXiv:2312.16098,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.506379Z"},"links":{"cited_paper":"/paper/2312.16098","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:183952c8d52a11d00b656daacce80c54cbcb61129e66d85ca9f00e35c4234045","observation_id":"a10e5d2c-2b05-4480-8f4b-85417550c32b","resolution":{"observed_at":"2026-08-07T15:40:11.506379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2209.07662","last_updated":"2024-08-12T23:42:17Z","snapshot_observed_at":"2026-07-06T13:52:51.358104Z","submitted_at":"2022-09-16T00:54:44Z","title":"NELLIE: A Neuro-Symbolic Inference Engine for Grounded, Compositional, and Explainable Reasoning","version":5},"cited_work":{"arxiv_id":"2209.07662","doi":null,"metadata_source":"pith","pith_arxiv_id":"2209.07662","snapshot_observed_at":"2026-08-07T15:40:12.722272Z","title":"NELLIE: A Neuro-Symbolic Inference Engine for Grounded, Compositional, and Explainable Reasoning","venue":"cs.CL","work_id":"ed4a099f-aeb6-4967-97bf-e618efcaf5d3","year":2022},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.662629Z"},"links":{"cited_paper":"/paper/2209.07662","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:038e075ce1fa7ceebcd53fbd6180ac27db0609e0d9d1505e6119ad0a9d38ccaa","observation_id":"82cf868e-4b1e-4c41-b18b-990e4799c28f","resolution":{"observed_at":"2026-08-07T15:40:12.829165Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.14798","last_updated":"2024-08-12T23:47:48Z","snapshot_observed_at":"2026-08-06T00:09:25.374343Z","submitted_at":"2024-02-22T18:55:17Z","title":"Enhancing Systematic Decompositional Natural Language Inference Using Informal Logic","version":3},"cited_work":{"arxiv_id":"2402.14798","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.14798","snapshot_observed_at":"2026-08-07T15:40:12.593646Z","title":"Enhancing Systematic Decompositional Natural Language Inference Using Informal Logic","venue":"cs.CL","work_id":"0e3f9fdc-386b-42fd-b41d-c394220d0945","year":2024},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.719990Z"},"links":{"cited_paper":"/paper/2402.14798","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:e759d4c9cb806dc0a78d2402b5388befd5948e7aa580441cfd1837d983c9cd48","observation_id":"53248d6f-45c4-47f9-aaef-701e9844bb74","resolution":{"observed_at":"2026-08-07T15:40:12.647044Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2403.15246","last_updated":"2024-05-07T14:25:15Z","snapshot_observed_at":"2026-08-08T21:08:26.423448Z","submitted_at":"2024-03-22T14:42:29Z","title":"FollowIR: Evaluating and Teaching Information Retrieval Models to Follow Instructions","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.15246","snapshot_observed_at":"2026-08-07T15:40:11.806255Z","title":"Followir: Evaluating and teaching infor- mation retrieval models to follow instructions.arXiv preprint arXiv:2403.15246, 2024a","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.806255Z"},"links":{"cited_paper":"/paper/2403.15246","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:b50357eb4b997dfd42ed0d25a37e7b8610a7299892851d16d8d12b17a1a66baa","observation_id":"a2a8c6dd-c448-4388-ba5b-ca0af78b8ce2","resolution":{"observed_at":"2026-08-07T15:40:11.806255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-07T15:40:11.860228Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.860228Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:dcf82e1109d123a0e8180990c2efd8fb8c29c88fd8fb02fb6bceb31b307a2fab","observation_id":"61f2d8ef-37a0-47df-b3c8-c6b4fbffa758","resolution":{"observed_at":"2026-08-07T15:40:11.860228Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.18653/v1/2024.findings-acl.706","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:12.350575Z","title":"doi: 10.18653/v1/2024.findings-acl.706","venue":null,"work_id":"48fa1c35-be4f-46bf-8d5c-6f3d490d73dd","year":2024},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.960392Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:fa2ee2a2de368dc1ab67fbfcf7817836af73a64d12cbae63a8c46e3372906ec8","observation_id":"9c9cdaf5-b745-48d6-a285-916906432e4c","resolution":{"observed_at":"2026-08-07T15:40:12.427059Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:12.017982Z","title":"doi: 10.18653/v1/2024.acl-demos.38","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:12.017982Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:b7e71025a9fcf0e7967dc7ec365afc0da69b459c184d69852238da9cf20eb385","observation_id":"9550d00c-f9a6-41d4-9339-0656ba2b6dd9","resolution":{"observed_at":"2026-08-07T15:40:12.017982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:12.113338Z","title":"doi: 10.18653/v1/2023.findings-emnlp.590","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:12.113338Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:033268b0c1ce5953eb1ad1ce948ba42514ad027fb8618b596788425bde2c483d","observation_id":"5c41a9cf-a9f0-4a53-9a26-d29cdf67a1bb","resolution":{"observed_at":"2026-08-07T15:40:12.113338Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.06034","last_updated":"2025-03-08T03:14:26Z","snapshot_observed_at":"2026-08-07T17:20:46.152437Z","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":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.06034","snapshot_observed_at":"2026-08-07T15:40:12.195943Z","title":"Rank-r1: Enhancing reasoning in llm-based document rerankers via reinforcement learning.arXiv preprint arXiv:2503.06034,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:12.195943Z"},"links":{"cited_paper":"/paper/2503.06034","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:33447d11809a9b683809b49c4b3a0e0aef40c871f7e66fa1816f6cc2f63c59ba","observation_id":"9f067771-3887-4b5f-b26d-40da7dc8c1f6","resolution":{"observed_at":"2026-08-07T15:40:12.195943Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.07820","last_updated":"2020-03-18T16:56:56Z","snapshot_observed_at":"2026-07-06T09:05:23.015957Z","submitted_at":"2020-03-17T17:12:36Z","title":"Overview of the TREC 2019 deep learning track","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.07820","snapshot_observed_at":"2026-08-07T15:40:08.989273Z","title":"Overview of the trec 2019 deep learning track.arXiv preprint arXiv:2003.07820,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:08.989273Z"},"links":{"cited_paper":"/paper/2003.07820","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:17b78b613e14eef2d4ab17b210cbe23383c8f51d5da8b8247b654e6e7d8e6d6d","observation_id":"370952e5-9b8c-44e9-b366-57c725342e4b","resolution":{"observed_at":"2026-08-07T15:40:08.989273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2212.03533","last_updated":"2024-02-22T06:21:51Z","snapshot_observed_at":"2026-07-06T14:27:46.217000Z","submitted_at":"2022-12-07T09:25:54Z","title":"Text Embeddings by Weakly-Supervised Contrastive Pre-training","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2212.03533","snapshot_observed_at":"2026-08-07T15:40:11.566868Z","title":"Text embeddings by weakly-supervised contrastive pre-training","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:11.566868Z"},"links":{"cited_paper":"/paper/2212.03533","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:5f9bd4905f2dc4630bc893211a3481d427c90db64f6b6b5c221af634d5b671bc","observation_id":"fe903f5f-16a3-432f-a551-8c7f812a3528","resolution":{"observed_at":"2026-08-07T15:40:11.566868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.14424","last_updated":"2019-10-31T12:45:40Z","snapshot_observed_at":"2026-08-07T15:38:16.188847Z","submitted_at":"2019-10-31T12:45:40Z","title":"Multi-Stage Document Ranking with BERT","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.14424","snapshot_observed_at":"2026-08-07T15:40:10.299926Z","title":"Multi-stage document ranking with BERT.arXiv preprint arXiv:1910.14424, 2019a","venue":null,"work_id":null,"year":1910},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:10.299926Z"},"links":{"cited_paper":"/paper/1910.14424","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:4dca44229f17047f7ba1a9644398a949981bcc6fce44ab8ce071e0fb3c231b65","observation_id":"73220b7c-cf3e-46e4-95db-b385a746086a","resolution":{"observed_at":"2026-08-07T15:40:10.299926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.16720","last_updated":"2026-04-30T02:46:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-21T18:04:31Z","title":"OpenAI o1 System Card","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.16720","snapshot_observed_at":"2026-08-07T15:40:09.380987Z","title":"Openai o1 system card","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.380987Z"},"links":{"cited_paper":"/paper/2412.16720","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:f708434023c835b31bc6c7f9e2a5564941b35033c13abfd0a330719d896a98c3","observation_id":"55e8cde1-5629-4076-b828-419b0520c172","resolution":{"observed_at":"2026-08-07T15:40:09.380987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2102.07662","last_updated":"2021-02-15T16:47:00Z","snapshot_observed_at":"2026-07-06T10:41:31.563193Z","submitted_at":"2021-02-15T16:47:00Z","title":"Overview of the TREC 2020 deep learning track","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.07662","snapshot_observed_at":"2026-08-07T15:40:09.035993Z","title":"Overview of the trec 2020 deep learning track","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.035993Z"},"links":{"cited_paper":"/paper/2102.07662","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:4ee148ab08d92e7fd0f903277f82401d9b61248d018e8528f580d5cd08415121","observation_id":"962338b3-8827-42a4-b7f4-8db8153a4c4d","resolution":{"observed_at":"2026-08-07T15:40:09.035993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:14.521030Z","title":"Overview of the trec 2022 deep learning track","venue":null,"work_id":"eeaa2da2-5af8-4369-ad49-75836ea58019","year":2022},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.089983Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:53a747ec244497a70ce707cc05fdcc36f702c78919325e5ea9e14ffe3010a18b","observation_id":"c663431e-3c25-43e0-b41b-6ea8a397c622","resolution":{"observed_at":"2026-08-07T15:40:14.594838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:40:14.372338Z","title":"Sparse pairwise re- ranking with pre-trained transformers","venue":null,"work_id":"5c08f7d9-0de7-4e80-b299-d6173a354c29","year":2022},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.195971Z"},"links":{"citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:69b8817e002a7453c6ee4193961b44bc532d2368ff1e489aa09006e13e240242","observation_id":"8f2e84ab-72e9-4660-ab57-f7cebf7fbb7d","resolution":{"observed_at":"2026-08-07T15:40:14.416252Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-07T15:40:09.572284Z","title":"Mistral 7b.arXiv preprint arXiv:2310.06825, 10,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.572284Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:5be0cd6d2c74dc3dd1ac6ba9a2977f11e7ba69e7248c28e2cbc115ddf952d42f","observation_id":"da9c5bdd-69d2-4a3c-b79e-30038acf7036","resolution":{"observed_at":"2026-08-07T15:40:09.572284Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.16145","last_updated":"2023-03-28T17:10:48Z","snapshot_observed_at":"2026-07-06T15:09:04.920735Z","submitted_at":"2023-03-28T17:10:48Z","title":"NeuralMind-UNICAMP at 2022 TREC NeuCLIR: Large Boring Rerankers for Cross-lingual Retrieval","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.16145","snapshot_observed_at":"2026-08-07T15:40:09.467128Z","title":"Neuralmind-unicamp at 2022 trec neuclir: Large boring rerankers for cross-lingual retrieval.arXiv preprint arXiv:2303.16145,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.467128Z"},"links":{"cited_paper":"/paper/2303.16145","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:8acf4060796c90f5ecd9109a3df18ef122eb254a51dd49d6839f2dfb3f929742","observation_id":"fd0a1abc-49ea-4ec5-b671-26bd0d002794","resolution":{"observed_at":"2026-08-07T15:40:09.467128Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.12948","last_updated":"2026-01-04T03:57:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2025-01-22T15:19:35Z","title":"DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.12948","snapshot_observed_at":"2026-08-07T15:40:09.144188Z","title":"Kenneth Enevoldsen, Isaac Chung, Imene Kerboua, M´arton Kardos, Ashwin Mathur, David Stap, Jay Gala, Wissam Siblini, Dominik Krzemi´nski, Genta Indra Winata, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-07T15:40:09.144188Z"},"links":{"cited_paper":"/paper/2501.12948","citing_paper":"/paper/2505.14432"},"observation_digest":"sha256:b806d81f7758afe4500d7adbba084f881f5560a2faf54c53c797654464905af8","observation_id":"69331247-240c-4cf7-9b56-7d74911cda48","resolution":{"observed_at":"2026-08-07T15:40:09.144188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.14432","last_updated":"2025-05-20T14:39:34Z","latest_version":1,"primary_category":"cs.IR","snapshot_observed_at":"2026-08-07T22:55:53.682042Z","submitted_at":"2025-05-20T14:39:34Z","title":"Rank-K: Test-Time Reasoning for Listwise Reranking"},"reference_resolution":{"displayed":39,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":27,"verified_exact":4,"verified_fuzzy":8},"total_outbound_references":39},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 39 of 39 outbound references and 7 inbound Pith citation observations for arXiv:2505.14432."}