{"as_of":"2026-08-09T13:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cdfb1f57ead840907f14f162b71abbf4f7284df271694cef08105330106fafcf","coverage":[{"denominator":25,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":25,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T12:35:32.259601Z","state":"measured"},{"denominator":26,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":26,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-30T11:21:14.735936Z","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-06-30T11:24:38.048227Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"cited_work":{"arxiv_id":"2505.24643","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.24643","snapshot_observed_at":"2026-06-30T11:24:38.048227Z","title":"arXiv preprint arXiv:2505.24643 (2025)","venue":null,"work_id":"aa638475-da47-4d6e-9d42-64bb00387841","year":2025},"citing_paper":{"arxiv_id":"2606.15623","last_updated":"2026-06-29T10:36:22Z","snapshot_observed_at":"2026-08-08T23:25:05.443929Z","submitted_at":"2026-06-14T06:11:42Z","title":"Surprise-Guided MergeSort: Budget-Efficient Human-in-the-Loop Ranking via Adaptive Comparison Scheduling","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-30T11:21:14.735936Z"},"links":{"cited_paper":"/paper/2505.24643","citing_paper":"/paper/2606.15623"},"observation_digest":"sha256:7e97839f1a94a3a6c398689c6ef797d8affdc6e8d95922f1c2b63971b3f1a5f1","observation_id":"d1426d81-3fb9-4ddf-9589-14b5ab448073","resolution":{"observed_at":"2026-06-30T11:24:38.049742Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.24643/citation-record","integrity":"/paper/2505.24643/integrity","json":"/paper/2505.24643/citation-record.json","paper":"/paper/2505.24643"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.00749","last_updated":"2023-11-01T18:00:03Z","snapshot_observed_at":"2026-08-07T22:54:52.062598Z","submitted_at":"2023-11-01T18:00:03Z","title":"Sorting with Predictions","version":1},"cited_work":{"arxiv_id":"2311.00749","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.00749","snapshot_observed_at":"2026-08-07T12:35:33.112296Z","title":"Sorting with Predictions","venue":"cs.DS","work_id":"6e693786-cfa5-4690-b199-4b947bf0fbc1","year":2023},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.007205Z"},"links":{"cited_paper":"/paper/2311.00749","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:c3253dbe81fa0a0d1728b991b814640705c99314ea52484cc4061e74e131797b","observation_id":"2544d9db-17e7-4d53-b4bd-6747c17c79d9","resolution":{"observed_at":"2026-08-07T12:35:33.188410Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2005.14165","last_updated":"2020-07-22T19:47:17Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2020-05-28T17:29:03Z","title":"Language Models are Few-Shot Learners","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.14165","snapshot_observed_at":"2026-08-07T12:35:30.113783Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.113783Z"},"links":{"cited_paper":"/paper/2005.14165","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:d311bf792a46d698fb72ae424730ffffa4d1df2aba90954358670e1c81707c35","observation_id":"0b6f0807-2792-4e7b-9292-0c9a3b6eb329","resolution":{"observed_at":"2026-08-07T12:35:30.113783Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.11416","last_updated":"2022-12-06T21:39:48Z","snapshot_observed_at":"2026-07-06T14:08:18.855958Z","submitted_at":"2022-10-20T16:58:32Z","title":"Scaling Instruction-Finetuned Language Models","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.11416","snapshot_observed_at":"2026-08-07T12:35:30.206062Z","title":"Chi, Jeff Dean, Jacob Devlin, Adam Roberts, Denny Zhou, Quoc V","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.206062Z"},"links":{"cited_paper":"/paper/2210.11416","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:200b3b77a55067aabef3483e793844aeeaa8ce3fb16af63f786e38ef437542a9","observation_id":"ad4eb806-8642-4b68-b13f-3d4c83ef0e59","resolution":{"observed_at":"2026-08-07T12:35:30.206062Z","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-08-09T09:26:16.401552Z","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-07T12:35:30.312828Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.312828Z"},"links":{"cited_paper":"/paper/2102.07662","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:ae0e0f30ccff601b309b877714050199689c175cadb1c555c289a8ea09bacce4","observation_id":"1bcbf8b6-98e7-48c7-9a5c-2dfbefa5acd7","resolution":{"observed_at":"2026-08-07T12:35:30.312828Z","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-07T12:35:30.383061Z","title":"Voorhees","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.383061Z"},"links":{"cited_paper":"/paper/2003.07820","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:42b5a5988f4ffe9070a327a4fcb3ab67055df51f32bc3f723af3046ecbfdbebf","observation_id":"2a314860-2e9e-4cd2-9735-dac2d252714e","resolution":{"observed_at":"2026-08-07T12:35:30.383061Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21783","last_updated":"2024-11-23T23:27:33Z","snapshot_observed_at":"2026-07-06T18:55:11.576666Z","submitted_at":"2024-07-31T17:54:27Z","title":"The Llama 3 Herd of Models","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.21783","snapshot_observed_at":"2026-08-07T12:35:30.451370Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.451370Z"},"links":{"cited_paper":"/paper/2407.21783","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:c079eb62bdab7398e4c2174f2804460e03d3878ce25741b986ba376d53986e23","observation_id":"8807302f-7c53-4419-a7e9-fba8747f31dc","resolution":{"observed_at":"2026-08-07T12:35:30.451370Z","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-07T12:35:33.751806Z","title":null,"venue":null,"work_id":"545a0436-d16c-4f2e-a7bc-c012024de1b5","year":1962},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.578293Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:877c663376c991b4ad0534cfeb5295c2f3bdc5da12a01f9a969ad8420fd7f3cb","observation_id":"18a73348-9d50-4a88-ad16-258ae6f271bd","resolution":{"observed_at":"2026-08-07T12:35:33.820094Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T12:35:30.670163Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.670163Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:ef3f70ce63022fc05572e85dc0d1e857cf4a64ba9b1d4150fc23448ba74adc0f","observation_id":"3d1482aa-e0a4-4c9e-8266-7568d7de8649","resolution":{"observed_at":"2026-08-07T12:35:30.670163Z","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-07T12:35:30.786576Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.786576Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:bc190473593c3871ea491184c5a556625babb0c6bd155633544e8a8452b599c7","observation_id":"33089719-18fd-40ba-a3b2-26e9764b634e","resolution":{"observed_at":"2026-08-07T12:35:30.786576Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"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-07T12:35:30.868909Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.868909Z"},"links":{"cited_paper":"/paper/2305.02156","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:92866bef5ef536cd70be8bd4c247192d705d83ea35402d63e9bafb6de574d730","observation_id":"e1977e87-93b0-417a-9ef7-172ca30c0ae0","resolution":{"observed_at":"2026-08-07T12:35:30.868909Z","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-07T12:35:33.555890Z","title":null,"venue":null,"work_id":"39ded7ba-1c26-4cdd-974a-d1bdebd64e4b","year":2004},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:30.976348Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:6c1423eb7864e94e75483f89898f5e494911919b7cd07b43b65e479c3e6bcde7","observation_id":"334a71e8-aa3b-4045-8612-792769723af7","resolution":{"observed_at":"2026-08-07T12:35:33.646898Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T12:35:31.064072Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.064072Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:20e108eb4c967b0cb17b4cc7d1e87faeb21adf4819453d706ecdee0c03c4381f","observation_id":"509d60ff-e1bc-4a0b-89f6-aae02c792423","resolution":{"observed_at":"2026-08-07T12:35:31.064072Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.05691","last_updated":"2020-04-12T20:48:10Z","snapshot_observed_at":"2026-07-06T09:11:47.606220Z","submitted_at":"2020-04-12T20:48:10Z","title":"Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization","version":1},"cited_work":{"arxiv_id":"2004.05691","doi":null,"metadata_source":"pith","pith_arxiv_id":"2004.05691","snapshot_observed_at":"2026-08-07T12:35:32.784142Z","title":"Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization","venue":"cs.LG","work_id":"f34663da-e446-4563-a7c4-1816660e198a","year":2020},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.133015Z"},"links":{"cited_paper":"/paper/2004.05691","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:a15e07842e4f297095076fa49b70ad38581edb2852267db1a9a4426be21d2c1c","observation_id":"72ea86f8-1e86-48ec-b3ab-b0da8bf04d44","resolution":{"observed_at":"2026-08-07T12:35:32.852618Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.06713","last_updated":"2020-03-14T22:29:50Z","snapshot_observed_at":"2026-08-07T22:52:48.176856Z","submitted_at":"2020-03-14T22:29:50Z","title":"Document Ranking with a Pretrained Sequence-to-Sequence Model","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.06713","snapshot_observed_at":"2026-08-07T12:35:31.216580Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.216580Z"},"links":{"cited_paper":"/paper/2003.06713","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:842e79c28f238a8d6128ee27325691d5a66064db61a9e78edc07c88de1597165","observation_id":"b8defab9-4347-41c6-8c6c-779ecc21e298","resolution":{"observed_at":"2026-08-07T12:35:31.216580Z","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-07T12:35:31.300378Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.300378Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:e86b17264cd4cb72c2e6dee39c9503c09f654584cf5df684cc1a489ca292007d","observation_id":"db9c9808-984d-4ba7-965a-e4ecc48cdf06","resolution":{"observed_at":"2026-08-07T12:35:31.300378Z","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-07T12:35:33.431326Z","title":"Robertson and Hugo Zaragoza","venue":null,"work_id":"a753c7ac-b429-42c7-9bdc-fb5528dc1b8e","year":2009},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.363207Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:5ea740b149228e4851f7641673d94d073973395df96703776c292108c6a013af","observation_id":"c298e99d-5ea1-4f1f-ac3c-cb3af83d41be","resolution":{"observed_at":"2026-08-07T12:35:33.482893Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+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-07T12:35:33.321462Z","title":null,"venue":null,"work_id":"9ad49ee0-1e9d-4554-ae96-7965594f0b94","year":1975},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.447429Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:c166572494faf9efcd4d44b2f15d6f7444fd50f018e3a13775f5ba886839150e","observation_id":"2941e92a-04ec-41fe-abff-c5cb296587ca","resolution":{"observed_at":"2026-08-07T12:35:33.363437Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2304.09542","last_updated":"2024-12-28T06:20:54Z","snapshot_observed_at":"2026-08-06T00:21:17.259026Z","submitted_at":"2023-04-19T10:16:03Z","title":"Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2304.09542","snapshot_observed_at":"2026-08-07T12:35:31.545191Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.545191Z"},"links":{"cited_paper":"/paper/2304.09542","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:87f08c5d1deed0213779312b1ca6504b590e6a9c561adca3555f9b84d1ce0a59","observation_id":"c94db398-7e04-431e-91a5-a984f614f83a","resolution":{"observed_at":"2026-08-07T12:35:31.545191Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2104.08663","last_updated":"2021-10-21T01:18:28Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2021-04-17T23:29:55Z","title":"BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2104.08663","snapshot_observed_at":"2026-08-07T12:35:31.622512Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.622512Z"},"links":{"cited_paper":"/paper/2104.08663","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:96e1c416805845370affab99a49e61b1ca633aa12f32a91c3a9abc6b3c146cfd","observation_id":"28418bb7-d21b-43ce-a51d-01f9119ec6ee","resolution":{"observed_at":"2026-08-07T12:35:31.622512Z","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-07T12:35:31.673772Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.673772Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:c9018ee5c883931e9d1b2656f7caec9c847269dc7a6c97d639b4bffa4d2646c8","observation_id":"12af46f5-2ec7-4f08-8739-9758777b7369","resolution":{"observed_at":"2026-08-07T12:35:31.673772Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.03771","last_updated":"2020-07-14T03:42:34Z","snapshot_observed_at":"2026-07-06T08:27:58.343233Z","submitted_at":"2019-10-09T03:23:22Z","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.03771","snapshot_observed_at":"2026-08-07T12:35:31.753968Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.753968Z"},"links":{"cited_paper":"/paper/1910.03771","citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:5b3b30577297b0b20b56e9321c2270cfccc0b70415add7a71cc16ac4d068c34e","observation_id":"c8e687f2-7a2f-4634-8327-38836513ff0f","resolution":{"observed_at":"2026-08-07T12:35:31.753968Z","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-07T12:35:31.894872Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:31.894872Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:dbb319542b94b7e57924876d046bc82e6af28436cfbba576615a4a1580f84ec3","observation_id":"25ab1a34-0d68-4438-b2c2-b1d2964aa7d2","resolution":{"observed_at":"2026-08-07T12:35:31.894872Z","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-07T12:35:32.016046Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:32.016046Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:e6de77235dda16d5c6f77c6b0846c5fd1f661655cd43c9677db678cd2d398959","observation_id":"e20f04f8-035e-4c6e-9cd7-a6fa94723fe9","resolution":{"observed_at":"2026-08-07T12:35:32.016046Z","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-07T12:35:32.131471Z","title":"URL: \" 'urlintro :=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:32.131471Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:db3bab3cc54f1f984298dcf688e9cf913bad41490d973a18d33a1eb7e5c416ba","observation_id":"018c8fb5-b7be-470b-b5ff-2b88e61e6856","resolution":{"observed_at":"2026-08-07T12:35:32.131471Z","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-07T12:35:32.259601Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:32.259601Z"},"links":{"citing_paper":"/paper/2505.24643"},"observation_digest":"sha256:93634ee0466379d3e3a66e6e79773e31c30197a1bdaeb4e5e371dd53836731a3","observation_id":"d1378ea2-79ed-4c93-9305-b8b9b6a64f6f","resolution":{"observed_at":"2026-08-07T12:35:32.259601Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.24643","last_updated":"2025-05-30T14:29:55Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T07:58:50.389935Z","submitted_at":"2025-05-30T14:29:55Z","title":"Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching"},"reference_resolution":{"displayed":25,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":22,"verified_exact":2,"verified_fuzzy":1},"total_outbound_references":25},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2505.24643."}