Paper Citation Record · LEDGER

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching

As of 10 August 2026, this Paper Citation Record lists 25 of 25 outbound references and 1 inbound Pith citation observation for arXiv:2505.24643.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.24643 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-07T12:35:32.259601Z

measured 26 of 26 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-06-30T11:21:14.735936Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: arxiv_reference, observed 2026-06-30T11:24:38.048227Z

Reference resolution

25 of 25 outbound references displayed

verified exact2
verified fuzzy1
unresolved22
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 2544d9db-17e7-4d53-b4bd-6747c17c79d9 · outbound

This paper cites Sorting with Predictions.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Sorting with Predictions

Reference 1

Resolution: verified exact; local_arxiv, observed 2026-08-07T12:35:33.188410Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 0b6f0807-2792-4e7b-9292-0c9a3b6eb329 · outbound

This paper cites Language Models are Few-Shot Learners.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Language Models are Few-Shot Learners

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:30.113783Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ad4eb806-8642-4b68-b13f-3d4c83ef0e59 · outbound

This paper cites Scaling Instruction-Finetuned Language Models.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Scaling Instruction-Finetuned Language Models

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:30.206062Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bcbf8b6-98e7-48c7-9a5c-2dfbefa5acd7 · outbound

This paper cites Overview of the TREC 2020 deep learning track.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Overview of the TREC 2020 deep learning track

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:30.312828Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a314860-2e9e-4cd2-9735-dac2d252714e · outbound

This paper cites Overview of the TREC 2019 deep learning track.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Overview of the TREC 2019 deep learning track

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:30.383061Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8807302f-7c53-4419-a7e9-fba8747f31dc · outbound

This paper cites The Llama 3 Herd of Models.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching The Llama 3 Herd of Models

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:30.451370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18a73348-9d50-4a88-ad16-258ae6f271bd · outbound

This paper cites an unresolved cited work.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Unresolved cited work

Reference 7

Resolution: unresolved; raw_fallback, observed 2026-08-07T12:35:33.820094Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 3d1482aa-e0a4-4c9e-8266-7568d7de8649 · outbound

This paper cites Mistral 7B.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Mistral 7B

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:30.670163Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 33089719-18fd-40ba-a3b2-26e9764b634e · outbound

This paper cites an unresolved cited work.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:30.786576Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e1977e87-93b0-417a-9ef7-172ca30c0ae0 · outbound

This paper cites Zero-Shot Listwise Document Reranking with a Large Language Model.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Zero-Shot Listwise Document Reranking with a Large Language Model

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:30.868909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 334a71e8-aa3b-4045-8612-792769723af7 · outbound

This paper cites an unresolved cited work.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Unresolved cited work

Reference 11

Resolution: unresolved; raw_fallback, observed 2026-08-07T12:35:33.646898Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 509d60ff-e1bc-4a0b-89f6-aae02c792423 · outbound

This paper cites an unresolved cited work.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Unresolved cited work

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:31.064072Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 72ea86f8-1e86-48ec-b3ab-b0da8bf04d44 · outbound

This paper cites Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization

Reference 13

Resolution: verified exact; local_arxiv, observed 2026-08-07T12:35:32.852618Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation b8defab9-4347-41c6-8c6c-779ecc21e298 · outbound

This paper cites Document Ranking with a Pretrained Sequence-to-Sequence Model.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Document Ranking with a Pretrained Sequence-to-Sequence Model

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:31.216580Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation db9c9808-984d-4ba7-965a-e4ecc48cdf06 · outbound

This paper cites an unresolved cited work.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Unresolved cited work

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:31.300378Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c298e99d-5ea1-4f1f-ac3c-cb3af83d41be · outbound

This paper cites Robertson and Hugo Zaragoza.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Robertson and Hugo Zaragoza

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-07T12:35:33.482893Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 2941e92a-04ec-41fe-abff-c5cb296587ca · outbound

This paper cites an unresolved cited work.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Unresolved cited work

Reference 17

Resolution: unresolved; raw_fallback, observed 2026-08-07T12:35:33.363437Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation c94db398-7e04-431e-91a5-a984f614f83a · outbound

This paper cites Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Is ChatGPT Good at Search? Investigating Large Language Models as Re-Ranking Agents

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:31.545191Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 28418bb7-d21b-43ce-a51d-01f9119ec6ee · outbound

This paper cites BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Models

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:31.622512Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12af46f5-2ec7-4f08-8739-9758777b7369 · outbound

This paper cites an unresolved cited work.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Unresolved cited work

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:31.673772Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c8e687f2-7a2f-4634-8327-38836513ff0f · outbound

This paper cites HuggingFace's Transformers: State-of-the-art Natural Language Processing.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching HuggingFace's Transformers: State-of-the-art Natural Language Processing

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:31.753968Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 25ab1a34-0d68-4438-b2c2-b1d2964aa7d2 · outbound

This paper cites an unresolved cited work.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Unresolved cited work

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:31.894872Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e20f04f8-035e-4c6e-9cd7-a6fa94723fe9 · outbound

This paper cites an unresolved cited work.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:32.016046Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 018c8fb5-b7be-470b-b5ff-2b88e61e6856 · outbound

This paper cites URL: " 'urlintro :=.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching URL: " 'urlintro :=

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:32.131471Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d1378ea2-79ed-4c93-9305-b8b9b6a64f6f · outbound

This paper cites write newline.

Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching write newline

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-07T12:35:32.259601Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation d1426d81-3fb9-4ddf-9589-14b5ab448073 · inbound

Surprise-Guided MergeSort: Budget-Efficient Human-in-the-Loop Ranking via Adaptive Comparison Scheduling cites this paper.

Surprise-Guided MergeSort: Budget-Efficient Human-in-the-Loop Ranking via Adaptive Comparison Scheduling Are Optimal Algorithms Still Optimal? Rethinking Sorting in LLM-Based Pairwise Ranking with Batching and Caching

Reference 11

Resolution: verified exact; arxiv_id, observed 2026-06-30T11:24:38.049742Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.