Paper Citation Record · LEDGER

Heaps and Their Working Sets

As of 16 August 2026, this Paper Citation Record lists 33 of 33 outbound references and 0 inbound Pith citation observations for arXiv:2607.24621.

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

pith.paper-citation-record.v1
2607.24621 v1

Coverage vector

measured 33 of 33 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-31T10:35:56.183336Z

measured 33 of 33 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 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

33 of 33 outbound references displayed

verified exact11
verified fuzzy0
unresolved22
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 7e901745-c521-41f4-9aab-a89f2ad1862e · outbound

This paper cites Fredman and Robert Endre Tarjan , title =.

Heaps and Their Working Sets Fredman and Robert Endre Tarjan , title =

Reference 1

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f658350d-15b0-43a6-b0df-4c487afa6211 · outbound

This paper cites Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps , booktitle =.

Heaps and Their Working Sets Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps , booktitle =

Reference 2

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9d66f0c7-30e3-4727-9fa7-b43ed1fe2f81 · outbound

This paper cites Fast and Simple Sorting Using Partial Information , journal =.

Heaps and Their Working Sets Fast and Simple Sorting Using Partial Information , journal =

Reference 3

Resolution: verified exact; doi, observed 2026-07-31T10:36:18.237415Z

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 5e6686b3-a8c5-41b7-b609-450fc2cea303 · outbound

This paper cites Improved Upper Bounds for Pairing Heaps , booktitle =.

Heaps and Their Working Sets Improved Upper Bounds for Pairing Heaps , booktitle =

Reference 4

Resolution: verified exact; doi, observed 2026-07-31T10:36:18.124108Z

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 f82b7660-4c34-4ba8-8edf-b0aea22eed9a · outbound

This paper cites Fredman and Robert Sedgewick and Daniel Dominic Sleator and Robert Endre Tarjan , title =.

Heaps and Their Working Sets Fredman and Robert Sedgewick and Daniel Dominic Sleator and Robert Endre Tarjan , title =

Reference 5

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e80a349-6abe-4b29-b7fa-77c56b95e2a7 · outbound

This paper cites Soviet Mathematics Doklady , volume =.

Heaps and Their Working Sets Soviet Mathematics Doklady , volume =

Reference 6

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 98a84983-c23e-4c18-995a-7bb57015cb25 · outbound

This paper cites Guibas and Robert Sedgewick , title =.

Heaps and Their Working Sets Guibas and Robert Sedgewick , title =

Reference 7

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ca898748-c340-4825-b388-5b30801244ca · outbound

This paper cites an unresolved cited work.

Heaps and Their Working Sets Unresolved cited work

Reference 8

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e793a13-f949-4fc8-9444-034851d05c03 · outbound

This paper cites Tarjan and Uri Zwick , title =.

Heaps and Their Working Sets Tarjan and Uri Zwick , title =

Reference 9

Resolution: verified exact; doi, observed 2026-07-31T10:36:17.958666Z

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 e57ffef6-e904-4e08-931f-68adff0d4d07 · outbound

This paper cites Worst-Case Efficient Priority Queues , booktitle =.

Heaps and Their Working Sets Worst-Case Efficient Priority Queues , booktitle =

Reference 10

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 46f43288-f852-473e-832e-7e511caccefd · outbound

This paper cites Funnel Heap --.

Heaps and Their Working Sets Funnel Heap --

Reference 11

Resolution: verified exact; doi, observed 2026-07-31T10:36:17.835730Z

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 3d26c8a0-1ff1-4a5d-a1cc-80ce5b36afde · outbound

This paper cites an unresolved cited work.

Heaps and Their Working Sets Unresolved cited work

Reference 12

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 51fa9f9f-ba8d-4f75-b7d7-6a3ffcc0668c · outbound

This paper cites an unresolved cited work.

Heaps and Their Working Sets Unresolved cited work

Reference 13

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68281d4b-7a05-44e3-8223-7e0cab1c1cab · outbound

This paper cites Smooth Heaps and a Dual View of Self-Adjusting Data Structures , journal =.

Heaps and Their Working Sets Smooth Heaps and a Dual View of Self-Adjusting Data Structures , journal =

Reference 14

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

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

This paper cites Dynamic Optimality Refuted -- For Tournament Heaps.

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 f40b901e-4d90-4a44-920a-164283baa1b9 · outbound

This paper cites Acta Informatica , volume =.

Heaps and Their Working Sets Acta Informatica , volume =

Reference 16

Resolution: verified exact; doi, observed 2026-07-31T10:36:17.565724Z

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 508b81d0-c4fa-43df-8b18-a57b333e4329 · outbound

This paper cites A History of Distribution-Sensitive Data Structures , booktitle =.

Heaps and Their Working Sets A History of Distribution-Sensitive Data Structures , booktitle =

Reference 17

Resolution: verified exact; doi, observed 2026-07-31T10:36:17.486596Z

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 1ff618c8-504f-4eb8-bad6-6def79faaccc · outbound

This paper cites 2023 , eprint =.

Heaps and Their Working Sets 2023 , eprint =

Reference 18

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cdfd2277-154f-43f4-8858-cb157f8c97ff · outbound

This paper cites 2015 , url =.

Heaps and Their Working Sets 2015 , url =

Reference 19

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0591fbf4-34ba-4612-a7db-981e791e9389 · outbound

This paper cites Simpler Optimal Sorting from a Directed Acyclic Graph , booktitle =.

Heaps and Their Working Sets Simpler Optimal Sorting from a Directed Acyclic Graph , booktitle =

Reference 20

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b5faa384-25e0-4d0b-9fd7-e7d94f3b0141 · outbound

This paper cites 2011 , url =.

Heaps and Their Working Sets 2011 , url =

Reference 21

Resolution: verified exact; doi, observed 2026-07-31T10:36:17.377379Z

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 be404456-413a-4663-ae41-417c20dc4408 · outbound

This paper cites Alternatives to splay trees with O(log n) worst-case access times , booktitle =.

Heaps and Their Working Sets Alternatives to splay trees with O(log n) worst-case access times , booktitle =

Reference 22

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9832091c-2930-4947-b757-4b8b118b54a3 · outbound

This paper cites 2007 , publisher =.

Heaps and Their Working Sets 2007 , publisher =

Reference 23

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ad8afa5d-9549-4141-bea4-a55d503903b0 · outbound

This paper cites Schmidt and Alan Siegel , title =.

Heaps and Their Working Sets Schmidt and Alan Siegel , title =

Reference 24

Resolution: verified exact; doi, observed 2026-07-31T10:36:17.247322Z

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 d1a7c119-5446-43cc-8c6d-6a35b6cf1523 · outbound

This paper cites 2000 , url =.

Heaps and Their Working Sets 2000 , url =

Reference 25

Resolution: verified exact; doi, observed 2026-07-31T10:36:17.091004Z

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 8a4bd4f6-e0ee-463a-9b5b-ea651d89c82e · outbound

This paper cites Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines.

Heaps and Their Working Sets Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines

Reference 26

Resolution: verified exact; local_arxiv, observed 2026-07-31T10:36:16.856157Z

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 a4b89bbb-4ed0-4f55-80ed-f2573dc86508 · outbound

This paper cites Simpler Universally Optimal Dijkstra , booktitle =.

Heaps and Their Working Sets Simpler Universally Optimal Dijkstra , booktitle =

Reference 27

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a62f22ef-cc95-4bfa-b5de-3d1cd9607fbf · outbound

This paper cites Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps.

Heaps and Their Working Sets Sorting under Partial Information with Optimal Preprocessing Time via Unified Bound Heaps

Reference 28

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 85821afa-b961-4c75-8743-8e17ba4d1106 · outbound

This paper cites 2023 , eprint =.

Heaps and Their Working Sets 2023 , eprint =

Reference 29

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 85d22a74-9a0f-4458-b615-9456e0e32299 · outbound

This paper cites 2024 , eprint =.

Heaps and Their Working Sets 2024 , eprint =

Reference 30

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 64da913c-8e5f-48f4-9c2c-406872e801ed · outbound

This paper cites Algorithmica , volume =.

Heaps and Their Working Sets Algorithmica , volume =

Reference 31

Resolution: verified exact; doi, observed 2026-07-31T10:36:16.684382Z

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 68b99511-07bd-4b2a-8fb8-11dac16736fd · outbound

This paper cites 1977 , publisher =.

Heaps and Their Working Sets 1977 , publisher =

Reference 32

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d328cf29-ff13-4e8b-8b3c-fb614c2adc84 · outbound

This paper cites Purely Functional Representations of Catenable Sorted Lists , booktitle =.

Heaps and Their Working Sets Purely Functional Representations of Catenable Sorted Lists , booktitle =

Reference 33

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.