Recoverable Identifier

arXiv:2605.07523 · detector doi_compliance · incontrovertible · 2026-05-19 11:42:56.137400+00:00

advisory doi_compliance recoverable_identifier

DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.20382/jocg.v2i1a3ff.ffinria-00595823.13) 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

doi:10.20382/jocg. v2i1a3ff.ffinria-00595823. 13 Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, and Zhijun Zhang. Universally Optimal Streaming Algorithm for Random Walks in Dense Graphs. InInnovations in Theoretical Computer Science Conference (ITCS), volume 362 ofLeibniz International Proceedings in Informatics (LIPIcs), pages 55:1–55:20. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026.doi:10.4230/LIPIcs.ITCS.2026.55. 14 David Eppstein, Michael T. Goodrich, Abraham M. Illickan, and Claire A. To. Entropy- Bounded Computational Geometry Made Easier and Sensitive to Sortedness. InCanadian Conference on Computational Geometry (CCCG), 2025.doi:10.48550/arXiv.2508.20489. 15 William Evans and Jeff Sember. The Possible Hull of Imprecise Points.Canadian Conference on Computational Geometry (CCCG),

Evidence payload

{
  "printed_excerpt": "doi:10.20382/jocg. v2i1a3ff.ffinria-00595823. 13 Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, and Zhijun Zhang. Universally Optimal Streaming Algorithm for Random Walks in Dense Graphs. InInnovations in Theoretical Computer Science Con",
  "reconstructed_doi": "10.20382/jocg.v2i1a3ff.ffinria-00595823.13",
  "ref_index": 5,
  "resolved_title": null,
  "verdict_class": "incontrovertible"
}