Recoverable Identifier

arXiv:2604.24134 · detector doi_compliance · incontrovertible · 2026-05-19 22:24:01.382386+00:00

advisory doi_compliance recoverable_identifier

DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.4230/LIPIcs.ICALP.2021.79.19) was visible in the surrounding text but could not be confirmed against doi.org as printed.

Paper page Integrity report arXiv Try DOI

Evidence text

Schloss Dagstuhl – Leibniz-Zentrum für Informatik.doi:10.4230/LIPIcs. ICALP.2021.79. 19 John Iacono. Improved upper bounds for pairing heaps. InScandinavian Workshop on Algorithm Theory, pages 32–45. Springer, 2000.doi:10.5555/645900.672600. 20 John Iacono. Alternatives to splay trees with o(log n) worst-case access times. InSymposium on Discrete Algorithms SODA, pages 516–522. ACM/SIAM,

Evidence payload

{
  "printed_excerpt": "Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik.doi:10.4230/LIPIcs. ICALP.2021.79. 19 John Iacono. Improved upper bounds for pairing heaps. InScandinavian Workshop on Algorithm Theory, pages 32\u201345. Springer, 2000.doi:10.5555/645900.672600",
  "reconstructed_doi": "10.4230/LIPIcs.ICALP.2021.79.19",
  "ref_index": 9,
  "resolved_title": null,
  "verdict_class": "incontrovertible"
}