Paper Citation Record · LEDGER

Hardness Amplification for Dynamic Binary Search Trees

As of 13 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2411.14387.

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

pith.paper-citation-record.v1
2411.14387 v1

Coverage vector

measured 43 of 43 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-12T15:23:46.177760Z

measured 43 of 43 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

43 of 43 outbound references displayed

verified exact17
verified fuzzy5
unresolved19
parse uncertain0
malformed identifier0
metadata mismatch2

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation e6b8f2af-c01a-458c-b0ae-bcefb6e3de20 · outbound

This paper cites Self-organizing binary search trees.

Hardness Amplification for Dynamic Binary Search Trees Self-organizing binary search trees

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.384086Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8749303c-17b9-48e2-b07d-e07d39ac44dd · outbound

This paper cites Direct sums in randomized communication complexity.

Hardness Amplification for Dynamic Binary Search Trees Direct sums in randomized communication complexity

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:23:48.166553Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 45675e3f-3467-46c6-bf3c-0256da69382a · outbound

This paper cites Optimization with pattern-avoiding input.

Hardness Amplification for Dynamic Binary Search Trees Optimization with pattern-avoiding input

Reference 3

Resolution: verified exact; doi, observed 2026-08-12T15:23:47.178811Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3260b575-42ee-4e04-8c66-f1204145e28e · outbound

This paper cites Blelloch and Magdalen Dobson.

Hardness Amplification for Dynamic Binary Search Trees Blelloch and Magdalen Dobson

Reference 4

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.972426Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation f9499b42-684c-4aa0-9f45-fe71b29c9bd5 · outbound

This paper cites An O(log log n)-competitive binary search tree with optimal worst-case access times.

Hardness Amplification for Dynamic Binary Search Trees An O(log log n)-competitive binary search tree with optimal worst-case access times

Reference 5

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.957821Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e35b4045-fd53-49c5-8fbf-150d54f41ad1 · outbound

This paper cites Pinning down the strong wilber 1 bound for binary search trees.

Hardness Amplification for Dynamic Binary Search Trees Pinning down the strong wilber 1 bound for binary search trees

Reference 6

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.913424Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e13d35fb-2f2e-4ef9-bb49-02e491368f01 · outbound

This paper cites Greedy is an almost optimal deque.

Hardness Amplification for Dynamic Binary Search Trees Greedy is an almost optimal deque

Reference 7

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.846325Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 338a7ae9-220c-4d71-947d-164dfe2eeba4 · outbound

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

Hardness Amplification for Dynamic Binary Search Trees Pattern-avoiding access in binary search trees

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.634673Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b02bc093-3e47-4e72-9863-9b7401c75d1b · outbound

This paper cites The landscape of bounds for binary search trees.

Hardness Amplification for Dynamic Binary Search Trees The landscape of bounds for binary search trees

Reference 9

Resolution: verified exact; local_arxiv, observed 2026-08-12T15:23:47.839559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 99070036-bc7e-4425-a526-62bb19010105 · outbound

This paper cites Improved pattern-avoidance bounds for greedy bsts via matrix decomposition.

Hardness Amplification for Dynamic Binary Search Trees Improved pattern-avoidance bounds for greedy bsts via matrix decomposition

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.752543Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da117c9d-4f8e-445a-bd6b-08fb2294766c · outbound

This paper cites The Group Access Bounds for Binary Search Trees.

Hardness Amplification for Dynamic Binary Search Trees The Group Access Bounds for Binary Search Trees

Reference 11

Resolution: verified exact; local_arxiv, observed 2026-08-12T15:23:46.809216Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 1f7bebe0-2041-4ed6-b243-9e7ac40e3701 · outbound

This paper cites New binary search tree bounds via geometric inversions.

Hardness Amplification for Dynamic Binary Search Trees New binary search tree bounds via geometric inversions

Reference 12

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.746490Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 04f512d2-ec2d-4b9b-9cce-3c2708f2beca · outbound

This paper cites Sorting pattern-avoiding permutations via 0-1 matrices forbidding product patterns.

Hardness Amplification for Dynamic Binary Search Trees Sorting pattern-avoiding permutations via 0-1 matrices forbidding product patterns

Reference 13

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.632640Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 992a6f55-2d3b-47b3-a402-cf6f45747e65 · outbound

This paper cites On the dynamic finger conjecture for splay trees.

Hardness Amplification for Dynamic Binary Search Trees On the dynamic finger conjecture for splay trees

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.895051Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e29a1f5-6242-47c6-a137-edcad88a7e99 · outbound

This paper cites Demaine, Dion Harmon, John Iacono, Daniel M.

Hardness Amplification for Dynamic Binary Search Trees Demaine, Dion Harmon, John Iacono, Daniel M

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.912513Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 870d72cc-f8d0-41eb-ba9a-74ce4a5c9779 · outbound

This paper cites Demaine, Dion Harmon, John Iacono, and Mihai Patrascu.

Hardness Amplification for Dynamic Binary Search Trees Demaine, Dion Harmon, John Iacono, and Mihai Patrascu

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.917359Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 27bceb35-04be-4afd-94fb-714021a3d4b0 · outbound

This paper cites A lower bound framework for binary search trees with rotations.

Hardness Amplification for Dynamic Binary Search Trees A lower bound framework for binary search trees with rotations

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:23:48.151119Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b3a3e4f1-e733-4199-8a27-c3e09e608818 · outbound

This paper cites On the sequential access theorem and deque conjecture for splay trees.

Hardness Amplification for Dynamic Binary Search Trees On the sequential access theorem and deque conjecture for splay trees

Reference 18

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.548584Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation fbac721e-f520-4c6d-9a60-ceb924688219 · outbound

This paper cites Upper bounds for maximally greedy binary search trees.

Hardness Amplification for Dynamic Binary Search Trees Upper bounds for maximally greedy binary search trees

Reference 19

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.533271Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 3035905f-116f-4f26-bf7e-f2bce7054a11 · outbound

This paper cites On yao's xor-lemma.

Hardness Amplification for Dynamic Binary Search Trees On yao's xor-lemma

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.936142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3bde396a-9374-428c-bfbc-ce80a81369be · outbound

This paper cites Better analysis of greedy binary search tree on decomposable sequences.

Hardness Amplification for Dynamic Binary Search Trees Better analysis of greedy binary search tree on decomposable sequences

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.940303Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5b74b970-603a-4762-8819-a022f32def23 · outbound

This paper cites In pursuit of the dynamic optimality conjecture.

Hardness Amplification for Dynamic Binary Search Trees In pursuit of the dynamic optimality conjecture

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.944589Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c253f260-f3c7-470c-954e-12ba6203fb49 · outbound

This paper cites Super-logarithmic depth lower bounds via the direct sum in communication complexity.

Hardness Amplification for Dynamic Binary Search Trees Super-logarithmic depth lower bounds via the direct sum in communication complexity

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.949400Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de96596f-b079-466c-98e7-e5ab2d98cd17 · outbound

This paper cites Log-rank and lifting for and-functions.

Hardness Amplification for Dynamic Binary Search Trees Log-rank and lifting for and-functions

Reference 24

Resolution: metadata mismatch; raw_fallback, observed 2026-08-12T15:23:47.676021Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation e3a4919f-5bbe-4cc0-8277-7439d9c3811d · outbound

This paper cites Binary search trees, rectangles and patterns.

Hardness Amplification for Dynamic Binary Search Trees Binary search trees, rectangles and patterns

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:23:48.049203Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 8fb4a26e-96bc-4223-8244-0fedac13a078 · outbound

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

Hardness Amplification for Dynamic Binary Search Trees Smooth heaps and a dual view of self-adjusting data structures

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.963398Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5149fa69-f1e8-4a90-9554-379e7934298b · outbound

This paper cites Settling the relationship between wilber's bounds for dynamic optimality.

Hardness Amplification for Dynamic Binary Search Trees Settling the relationship between wilber's bounds for dynamic optimality

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.967985Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a20a259c-8191-4bda-ba01-c1f57b5934cf · outbound

This paper cites A direct product theorem for discrepancy.

Hardness Amplification for Dynamic Binary Search Trees A direct product theorem for discrepancy

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:45.995584Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8eca54fb-f81e-44cc-915e-104a00497ee3 · outbound

This paper cites Levy and Robert E.

Hardness Amplification for Dynamic Binary Search Trees Levy and Robert E

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:46.029130Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2198a924-9c8a-4cc8-a8bc-29d1625e6e99 · outbound

This paper cites Canonical forms for competitive binary search tree algorithms.

Hardness Amplification for Dynamic Binary Search Trees Canonical forms for competitive binary search tree algorithms

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:23:48.032938Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation b0186d62-62d9-4aaf-a075-fd71cd2ab889 · outbound

This paper cites Ian Munro.

Hardness Amplification for Dynamic Binary Search Trees Ian Munro

Reference 31

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.463473Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation c297430e-60c1-49f3-b57a-cd88e7e1c4c6 · outbound

This paper cites Splay trees, davenport-schinzel sequences, and the deque conjecture.

Hardness Amplification for Dynamic Binary Search Trees Splay trees, davenport-schinzel sequences, and the deque conjecture

Reference 32

Resolution: metadata mismatch; raw_fallback, observed 2026-08-12T15:23:47.463818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a72ac13f-681b-4b20-ac15-448fd222e74f · outbound

This paper cites Higher lower bounds for near-neighbor and further rich problems.

Hardness Amplification for Dynamic Binary Search Trees Higher lower bounds for near-neighbor and further rich problems

Reference 33

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.447557Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 559d9564-c420-4431-8c3c-a5336836c253 · outbound

This paper cites A counterexample to strong parallel repetition.

Hardness Amplification for Dynamic Binary Search Trees A counterexample to strong parallel repetition

Reference 34

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.431504Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation a5f28035-cdee-487d-a859-d984a78ded2e · outbound

This paper cites Separation of the monotone NC hierarchy.

Hardness Amplification for Dynamic Binary Search Trees Separation of the monotone NC hierarchy

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:46.141141Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 48c8d1ca-edd1-4523-9ad0-b26f25405e7c · outbound

This paper cites Dynamic binary search trees: Improved lower bounds for the greedy-future algorithm.

Hardness Amplification for Dynamic Binary Search Trees Dynamic binary search trees: Improved lower bounds for the greedy-future algorithm

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:46.146126Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ee14a028-dd42-4458-810e-eea235aceca0 · outbound

This paper cites Towards proving strong direct product theorems.

Hardness Amplification for Dynamic Binary Search Trees Towards proving strong direct product theorems

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-08-12T15:23:47.992190Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 66a001e7-4a3b-4936-983c-6f0e1d30d076 · outbound

This paper cites Sherstov.

Hardness Amplification for Dynamic Binary Search Trees Sherstov

Reference 38

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.349287Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 5c639acf-e591-42ba-9335-52677b093410 · outbound

This paper cites A counterexample to comon's conjecture.

Hardness Amplification for Dynamic Binary Search Trees A counterexample to comon's conjecture

Reference 39

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.285984Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation caecae26-c4c3-44dd-818d-52e36044cdd3 · outbound

This paper cites Self-adjusting binary search trees.

Hardness Amplification for Dynamic Binary Search Trees Self-adjusting binary search trees

Reference 40

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:46.164082Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 223fdbd1-3234-4245-8006-eb2319df1381 · outbound

This paper cites On the deque conjecture for the splay algorithm.

Hardness Amplification for Dynamic Binary Search Trees On the deque conjecture for the splay algorithm

Reference 41

Resolution: verified exact; doi, observed 2026-08-12T15:23:46.227118Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.

Observation 0fd9b68a-21a2-4c11-80ae-140b25ff7698 · outbound

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

Hardness Amplification for Dynamic Binary Search Trees O(log log n)-competitive dynamic binary search trees

Reference 42

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:46.173235Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9b1a381f-e021-4779-b60b-25835d405fc9 · outbound

This paper cites an unresolved cited work.

Hardness Amplification for Dynamic Binary Search Trees Unresolved cited work

Reference 43

Resolution: unresolved; no resolver link, observed 2026-08-12T15:23:46.177760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.