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-45138-9\_20) 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

Paul S. Bonsma, Tobias Br \" u ggemann, and Gerhard J. Woeginger. A faster FPT algorithm for finding spanning trees with many leaves. In Branislav Rovan and Peter Vojt \' a s, editors, Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings , volume 2747 of Lecture Notes in Computer Science , pages 259--268. Springer, 2003. https://doi.org/10.1007/978-3-540-45138-9\_20 doi:10.1007/978-3-540-45138-9\_20

Evidence payload

{
  "printed_excerpt": "Paul S. Bonsma, Tobias Br \\\" u ggemann, and Gerhard J. Woeginger. A faster FPT algorithm for finding spanning trees with many leaves. In Branislav Rovan and Peter Vojt \\' a s, editors, Mathematical Foundations of Computer Science 2003, 28th",
  "reconstructed_doi": "10.1007/978-3-540-45138-9\\_20",
  "ref_index": 6,
  "resolved_title": null,
  "verdict_class": "incontrovertible"
}