Recoverable Identifier

arXiv:2604.26831 · detector doi_compliance · incontrovertible · 2026-05-19 19:45:16.033333+00:00

advisory doi_compliance recoverable_identifier

DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1145/380752.380797.url:https://doi.org/10.1145/380752.380797) 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

Michael Elkin and David Peleg. “(1 +ε·β)-spanner constructions for general graphs”. In:Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing. STOC ’01. Hersonissos, Greece: Association for Computing Machinery, 2001, pp. 173–182.isbn: 1581133499.doi:10.1145/380752.380797.url:https: //doi.org/10.1145/380752.380797

Evidence payload

{
  "printed_excerpt": "Michael Elkin and David Peleg. \u201c(1 +\u03b5\u00b7\u03b2)-spanner constructions for general graphs\u201d. In:Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing. STOC \u201901. Hersonissos, Greece: Association for Computing Machinery, 2001, pp",
  "reconstructed_doi": "10.1145/380752.380797.url:https://doi.org/10.1145/380752.380797",
  "ref_index": 19,
  "resolved_title": null,
  "verdict_class": "incontrovertible"
}