Recoverable Identifier

arXiv:2604.24571 · detector doi_compliance · incontrovertible · 2026-05-19 21:56:09.064917+00:00

advisory doi_compliance recoverable_identifier

DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-45078-8\_41) 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

Elena Prieto - Rodriguez and Christian Sloper. Either/or: Using vertex cover structure in designing fpt-algorithms - the case of k-internal spanning tree. In Frank K. H. A. Dehne, J \" o rg - R \" u diger Sack, and Michiel H. M. Smid, editors, Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings , volume 2748 of Lecture Notes in Computer Science , pages 474--483. Springer, 2003. https://doi.org/10.1007/978-3-540-45078-8\_41 doi:10.1007/978-3-540-45078-8\_41

Evidence payload

{
  "printed_excerpt": "Elena Prieto - Rodriguez and Christian Sloper. Either/or: Using vertex cover structure in designing fpt-algorithms - the case of k-internal spanning tree. In Frank K. H. A. Dehne, J \\\" o rg - R \\\" u diger Sack, and Michiel H. M. Smid, edito",
  "reconstructed_doi": "10.1007/978-3-540-45078-8\\_41",
  "ref_index": 42,
  "resolved_title": null,
  "verdict_class": "incontrovertible"
}