Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-12T00:16:17.284749Z
Paper Citation Record · LEDGER
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$
As of 16 August 2026, this Paper Citation Record lists 29 of 29 outbound references and 0 inbound Pith citation observations for arXiv:2608.08348.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
29 of 29 outbound references displayed
- verified exact9
- verified fuzzy7
- unresolved4
- parse uncertain1
- malformed identifier0
- metadata mismatch8
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 9f45c851-844e-4f17-9e2a-70e54e742f7b · outbound
This paper cites European Symposium on Algorithms (ESA) , year =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ European Symposium on Algorithms (ESA) , year =
Reference 1
- Resolution
- verified exact
- doi, observed 2026-08-12T00:16:18.074744Z
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 0785d278-d2ee-421f-aa40-69ad65980c9f · outbound
This paper cites Adaptive Shivers Sort: An Alternative Sorting Algorithm , volume =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Adaptive Shivers Sort: An Alternative Sorting Algorithm , volume =
Reference 2
- Resolution
- verified exact
- doi, observed 2026-08-12T00:16:17.974827Z
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 4fa7a59c-e2fb-4cb3-b7b3-c5b5964479a0 · outbound
This paper cites an unresolved cited work.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Unresolved cited work
Reference 3
- Resolution
- parse uncertain
- raw_fallback, observed 2026-08-12T00:16:22.414756Z
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 5ed100e2-1c14-4c03-a733-32d24fbd9457 · outbound
This paper cites 2009 , note =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ 2009 , note =
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T00:16:22.265115Z
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 02dd29db-ecb3-423b-84e3-ccf0fa013fbd · outbound
This paper cites Algorithmica , volume =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Algorithmica , volume =
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T00:16:22.114750Z
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 2a3c095f-7670-4df2-84d8-c5844943fcb2 · outbound
This paper cites 2019 , publisher =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ 2019 , publisher =
Reference 6
- Resolution
- verified exact
- doi, observed 2026-08-12T00:16:17.824831Z
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 aff3077b-fb7e-4e84-8855-25c69e2035ac · outbound
This paper cites Dynamic Optimality Refuted -- For Tournament Heaps.
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.
Observation b7146d2e-a05a-4412-8201-91fbd88e4fd2 · outbound
This paper cites Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space
Reference 8
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-12T00:16:20.757648Z
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 e69f2071-e8fb-4bc0-b3ef-1b0fc9e80ed6 · outbound
This paper cites an unresolved cited work.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Unresolved cited work
Reference 9
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T00:16:21.914764Z
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 4bdf3016-7413-402d-a75d-99262beb2815 · outbound
This paper cites Median-of-k Jumplists and Dangling-Min BSTs.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Median-of-k Jumplists and Dangling-Min BSTs
Reference 10
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-12T00:16:20.682991Z
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 7552f9f8-4235-4bd4-8284-ef38cefdc2f5 · outbound
This paper cites Sesquickselect: One and a half pivots for cache-efficient selection.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Sesquickselect: One and a half pivots for cache-efficient selection
Reference 11
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-12T00:16:20.530612Z
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 d83bd7aa-c7ea-4bba-aa90-4305d4ad65b6 · outbound
This paper cites QuickXsort - A Fast Sorting Scheme in Theory and Practice.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ QuickXsort - A Fast Sorting Scheme in Theory and Practice
Reference 12
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-12T00:16:20.356853Z
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 892ebc4b-c086-4aae-bf8a-7d637e8cab90 · outbound
This paper cites it - Information Technology , year =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ it - Information Technology , year =
Reference 13
- Resolution
- verified exact
- doi, observed 2026-08-12T00:16:17.634751Z
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 e1407978-9642-48a3-8845-c3c04c8faad4 · outbound
This paper cites European Symposium on Algorithms (ESA) , pages =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ European Symposium on Algorithms (ESA) , pages =
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T00:16:21.714828Z
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 418085e5-2185-4e8f-b858-d373c25cc285 · outbound
This paper cites Average Cost of.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Average Cost of
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T00:16:16.664772Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5594769b-b86a-4013-a078-2db4a446a43b · outbound
This paper cites Quicksort Is Optimal For Many Equal Keys.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Quicksort Is Optimal For Many Equal Keys
Reference 16
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-12T00:16:20.125137Z
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 a4f79b1c-5e74-46aa-aeda-b724aa88f95a · outbound
This paper cites A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment
Reference 17
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-12T00:16:19.894740Z
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 7ca4db05-f978-4ffd-9b00-b183499b22b1 · outbound
This paper cites Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Efficient Algorithms for Envy-Free Stick Division With Fewest Cuts
Reference 18
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T00:16:19.674749Z
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 5ba6ea79-3f8b-4b1a-9a9a-0374ebfc3ca1 · outbound
This paper cites 2016 , isbn =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ 2016 , isbn =
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T00:16:21.544750Z
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 497b955f-64de-4f78-9121-14f46bcf0113 · outbound
This paper cites Analysis of Pivot Sampling in Dual-Pivot Quicksort.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Analysis of Pivot Sampling in Dual-Pivot Quicksort
Reference 20
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T00:16:19.454838Z
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 2c0b5855-1962-467b-bc72-6304bff77551 · outbound
This paper cites Average Case and Distributional Analysis of Dual-Pivot Quicksort.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Average Case and Distributional Analysis of Dual-Pivot Quicksort
Reference 21
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T00:16:19.214852Z
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 8e166a2b-8b39-4750-a5e4-089313bc4159 · outbound
This paper cites Analysis of Branch Misses in Quicksort.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Analysis of Branch Misses in Quicksort
Reference 22
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T00:16:18.966380Z
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 f9dda184-56b1-4430-b02e-b61e10018f28 · outbound
This paper cites Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm
Reference 23
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-12T00:16:18.755951Z
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 25699139-21d8-4982-9ad7-8124580ede5c · outbound
This paper cites Pivot Sampling in Dual-Pivot Quicksort.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Pivot Sampling in Dual-Pivot Quicksort
Reference 24
- Resolution
- metadata mismatch
- local_arxiv, observed 2026-08-12T00:16:18.514845Z
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 9b6a9e57-6784-4e08-a560-af3537d0aa9e · outbound
This paper cites and Reitzig, Raphael and Laube, Ulrich , booktitle =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ and Reitzig, Raphael and Laube, Ulrich , booktitle =
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T00:16:21.365944Z
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 0e704151-efee-446d-979a-50a7e00c55e0 · outbound
This paper cites Average Case Analysis of Java 7's Dual Pivot Quicksort.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Average Case Analysis of Java 7's Dual Pivot Quicksort
Reference 26
- Resolution
- verified exact
- local_arxiv, observed 2026-08-12T00:16:18.314744Z
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 1cc2ebe4-98a1-4cbe-9657-fa7403ed98fa · outbound
This paper cites 2012 , type =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ 2012 , type =
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T00:16:21.194752Z
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 174c00cc-29b0-48b8-981d-d62f5a2262ab · outbound
This paper cites Journal of Bioinformatics and Computational Biology , doi =.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Journal of Bioinformatics and Computational Biology , doi =
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-12T00:16:21.056305Z
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 ddfdbb3b-8986-4051-9041-3327c3724180 · outbound
This paper cites an unresolved cited work.
Top-Down Mergesort with Sorted Check Has Mergecost $\le(\mathcal H+3)n$ Unresolved cited work
Reference 29
- Resolution
- unresolved
- raw_fallback, observed 2026-08-12T00:16:20.924895Z
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.
Pith citing papers
No inbound Pith citation observations are available.