Paper Citation Record · LEDGER

Dynamic Optimality Refuted -- For Tournament Heaps

As of 16 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 3 inbound Pith citation observations for arXiv:1908.00563.

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

pith.paper-citation-record.v1
1908.00563 v1

Coverage vector

measured 37 of 37 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T15:58:38.214357Z

measured 40 of 40 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 3 of 3 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-12T00:16:16.268144Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-24T02:33:47.790333Z

Reference resolution

37 of 37 outbound references displayed

verified exact8
verified fuzzy13
unresolved16
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 5225e4c1-2315-45e9-9c85-0709ab7ce30c · outbound

This paper cites A polylogarithmic- competitive algorithm for the k-server problem.

Dynamic Optimality Refuted -- For Tournament Heaps A polylogarithmic- competitive algorithm for the k-server problem

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.077936Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe8ff23c-af8f-4fe5-af46-6bcdea3a604c · outbound

This paper cites Online computation and competitive analysis.

Dynamic Optimality Refuted -- For Tournament Heaps Online computation and competitive analysis

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.137612Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 57b53f14-526e-4f57-a443-6ccdd5444b83 · outbound

This paper cites Dyn amic optimality for skip lists and B-trees.

Dynamic Optimality Refuted -- For Tournament Heaps Dyn amic optimality for skip lists and B-trees

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:40.225383Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation e434d577-fd11-4a11-924a-c494ba30829c · outbound

This paper cites Cohen, Yin Tat Lee, James R.

Dynamic Optimality Refuted -- For Tournament Heaps Cohen, Yin Tat Lee, James R

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.219187Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee1636c4-c21b-4cf7-a577-35a2332c1424 · outbound

This paper cites Pattern-avoiding access in binary search trees.

Dynamic Optimality Refuted -- For Tournament Heaps Pattern-avoiding access in binary search trees

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.259285Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7fdb91ce-7197-4f92-ad9b-23d7862ed48b · outbound

This paper cites Cohen, Rasmus Kyng, Gary L.

Dynamic Optimality Refuted -- For Tournament Heaps Cohen, Rasmus Kyng, Gary L

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:40.203434Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation cd532d34-84fe-42dc-9f54-c4025d0f087e · outbound

This paper cites Demaine, Dion Harmon, John Iacono, Daniel Kane, a nd Mihai Pˇ atraşcu.

Dynamic Optimality Refuted -- For Tournament Heaps Demaine, Dion Harmon, John Iacono, Daniel Kane, a nd Mihai Pˇ atraşcu

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:40.045389Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation f9ee7d13-fab7-4370-93ab-8de6dd5497b5 · outbound

This paper cites Demaine, Dion Harmon, John Iacono, and Mihai Pˇ at raşcu.

Dynamic Optimality Refuted -- For Tournament Heaps Demaine, Dion Harmon, John Iacono, and Mihai Pˇ at raşcu

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.331750Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3e900dc2-ecfa-475d-93c1-c7a2fea2fc0b · outbound

This paper cites Demaine, John Iacono, Stefan Langerman, and Özgü r Özkan.

Dynamic Optimality Refuted -- For Tournament Heaps Demaine, John Iacono, Stefan Langerman, and Özgü r Özkan

Reference 9

Resolution: verified exact; doi, observed 2026-08-14T15:58:38.780159Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 2125fc83-f02c-41a6-909f-d7cc8038624e · outbound

This paper cites Non-blocking binary search trees.

Dynamic Optimality Refuted -- For Tournament Heaps Non-blocking binary search trees

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:40.021819Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 0b75471a-ac7a-4e67-9643-ac07f8dbb045 · outbound

This paper cites Oﬄine algorithms for dynamic minimum s panning tree problems.

Dynamic Optimality Refuted -- For Tournament Heaps Oﬄine algorithms for dynamic minimum s panning tree problems

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:39.980450Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation e9363691-ff89-4adc-990b-94dabcafed23 · outbound

This paper cites an unresolved cited work.

Dynamic Optimality Refuted -- For Tournament Heaps Unresolved cited work

Reference 12

Resolution: verified exact; doi, observed 2026-08-14T15:58:38.698426Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a24808b9-d136-48e2-b6aa-7fdfe6d9f02f · outbound

This paper cites an unresolved cited work.

Dynamic Optimality Refuted -- For Tournament Heaps Unresolved cited work

Reference 13

Resolution: verified exact; doi, observed 2026-08-14T15:58:38.628318Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 37bcd859-1350-4087-a3a9-24d9f8b7386e · outbound

This paper cites an unresolved cited work.

Dynamic Optimality Refuted -- For Tournament Heaps Unresolved cited work

Reference 14

Resolution: verified exact; doi, observed 2026-08-14T15:58:38.601882Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 62d11510-b2f1-4267-8aff-369c4348a2cb · outbound

This paper cites New bounds on optimal binary search trees.

Dynamic Optimality Refuted -- For Tournament Heaps New bounds on optimal binary search trees

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:39.893377Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c4bc41da-4b4c-488c-811e-9f6de274d9b3 · outbound

This paper cites Introduction to online convex optimizatio n.

Dynamic Optimality Refuted -- For Tournament Heaps Introduction to online convex optimizatio n

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.597232Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b533d451-d0d6-493c-9f2e-7c5d5e2e10ab · outbound

This paper cites Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spann ing tree, 2-edge, and biconnectiv- ity.

Dynamic Optimality Refuted -- For Tournament Heaps Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spann ing tree, 2-edge, and biconnectiv- ity

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:39.807463Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation c835dce2-6894-4eb4-b720-6e0b27a61c8a · outbound

This paper cites Key-independent optimality.

Dynamic Optimality Refuted -- For Tournament Heaps Key-independent optimality

Reference 18

Resolution: verified exact; doi, observed 2026-08-14T15:58:38.554926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation f43cf0b6-483e-4e27-90a5-99339b59db5e · outbound

This paper cites In pursuit of the dynamic optimality conje cture.

Dynamic Optimality Refuted -- For Tournament Heaps In pursuit of the dynamic optimality conje cture

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.680446Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2039d3b1-1c99-45a7-997b-2feb697025ae · outbound

This paper cites Weighted dynamic ﬁng er in binary search trees.

Dynamic Optimality Refuted -- For Tournament Heaps Weighted dynamic ﬁng er in binary search trees

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:39.768430Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation f94a8139-0b4b-4286-9abc-0015dddefe62 · outbound

This paper cites Kelner, Lorenzo Orecchia, Aaron Sidford, a nd Zeyuan Allen Zhu.

Dynamic Optimality Refuted -- For Tournament Heaps Kelner, Lorenzo Orecchia, Aaron Sidford, a nd Zeyuan Allen Zhu

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:39.704788Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 91859d21-a80f-45df-a6f7-976d63f2f264 · outbound

This paper cites The art of computer programming, Volume III.

Dynamic Optimality Refuted -- For Tournament Heaps The art of computer programming, Volume III

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:39.658559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation de5485d9-2552-45d4-9a5f-8ada7eedd9dc · outbound

This paper cites Binary search trees, rectangles and patterns.

Dynamic Optimality Refuted -- For Tournament Heaps Binary search trees, rectangles and patterns

Reference 23

Resolution: verified exact; doi, observed 2026-08-14T15:58:38.478684Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 581f4067-253b-40d0-9a83-1315a0ab2ce7 · outbound

This paper cites Smooth heaps a nd a dual view of self-adjusting data structures.

Dynamic Optimality Refuted -- For Tournament Heaps Smooth heaps a nd a dual view of self-adjusting data structures

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.812728Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9622c311-27ce-4ce9-b45b-cead4f39fe11 · outbound

This paper cites an unresolved cited work.

Dynamic Optimality Refuted -- For Tournament Heaps Unresolved cited work

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.904472Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6d30040-1574-4461-b5a5-caf67f8705e2 · outbound

This paper cites A new path from splay to dyn amic optimality.

Dynamic Optimality Refuted -- For Tournament Heaps A new path from splay to dyn amic optimality

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.954367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 680d483c-ddc2-4770-a4ae-5378c165b161 · outbound

This paper cites an unresolved cited work.

Dynamic Optimality Refuted -- For Tournament Heaps Unresolved cited work

Reference 27

Resolution: unresolved; raw_fallback, observed 2026-08-14T15:58:39.637648Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation cd698576-962b-4309-91c7-1f0985d61eda · outbound

This paper cites Com petitive algorithms for server problems.

Dynamic Optimality Refuted -- For Tournament Heaps Com petitive algorithms for server problems

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:39.545769Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 4a2d1ab6-aafc-466e-8d20-f3c1eca5cc09 · outbound

This paper cites On the competitiv eness of the move-to-front rule.

Dynamic Optimality Refuted -- For Tournament Heaps On the competitiv eness of the move-to-front rule

Reference 29

Resolution: verified exact; doi, observed 2026-08-14T15:58:38.373626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 9b7bd14a-7396-4ac5-b82c-78ddac778e90 · outbound

This paper cites Ian Munro.

Dynamic Optimality Refuted -- For Tournament Heaps Ian Munro

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:39.411762Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 78d5d41e-4674-4162-99a1-247164358ba8 · outbound

This paper cites Optimal Offline Dynamic $2,3$-Edge/Vertex Connectivity.

Dynamic Optimality Refuted -- For Tournament Heaps Optimal Offline Dynamic $2,3$-Edge/Vertex Connectivity

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:38.129877Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cd92de67-8c56-48d0-80ec-4ff2de5e3078 · outbound

This paper cites Self-a djusting binary search trees.

Dynamic Optimality Refuted -- For Tournament Heaps Self-a djusting binary search trees

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:38.166099Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b4ff7a8-4e08-4d59-af63-19f6c2ecefba · outbound

This paper cites O(log log n)- competitive dynamic binary search trees.

Dynamic Optimality Refuted -- For Tournament Heaps O(log log n)- competitive dynamic binary search trees

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:58:39.295108Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 6c821e56-2014-4e34-bf3d-f859bf16f8d3 · outbound

This paper cites Lower bounds for accessing binary searc h trees with rotations.

Dynamic Optimality Refuted -- For Tournament Heaps Lower bounds for accessing binary searc h trees with rotations

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:38.214357Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69566b91-0760-4a11-a1d0-239d86b77f84 · outbound

This paper cites an unresolved cited work.

Dynamic Optimality Refuted -- For Tournament Heaps Unresolved cited work

Reference 2000

Resolution: verified exact; doi, observed 2026-08-14T15:58:38.350914Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 87b4edbf-9434-4b1b-a687-090efdf1d697 · outbound

This paper cites an unresolved cited work.

Dynamic Optimality Refuted -- For Tournament Heaps Unresolved cited work

Reference 2010

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.449298Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f388f409-8235-4768-af7b-af4adb1da00f · outbound

This paper cites doi:10.1137/1.9781611974331.ch49.

Dynamic Optimality Refuted -- For Tournament Heaps doi:10.1137/1.9781611974331.ch49

Reference 2016

Resolution: unresolved; no resolver link, observed 2026-08-14T15:58:37.761023Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 69aa3be2-cf1b-4531-971c-0163654733eb · inbound

Fast and Simple Sorting Using Partial Information cites this paper.

Fast and Simple Sorting Using Partial Information Dynamic Optimality Refuted -- For Tournament Heaps

Reference 10

Resolution: verified exact; arxiv_id, observed 2026-05-24T02:33:47.795213Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation a2fc0bcd-9ad0-4879-b184-8e1cf89c97fc · inbound

Heaps and Their Working Sets cites this paper.

Heaps and Their Working Sets Dynamic Optimality Refuted -- For Tournament Heaps

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-31T10:35:54.762459Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation aff3077b-fb7e-4e84-8855-25c69e2035ac · inbound

Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ cites this paper.

Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Dynamic Optimality Refuted -- For Tournament Heaps

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-12T00:16:16.268144Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.