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.4230/LIPIcs.FSTTCS.2025.50.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.50) 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

Liam Roditty and Ariel Sapir. “Additive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms”. In:45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025). Ed. by C. Aiswarya, Ruta Mehta, and Subhajit Roy. Vol. 360. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum f¨ ur Informatik, 2025, 50:1–50:22.isbn: 978-3-95977-406-2.doi:10.4230/ LIPIcs.FSTTCS.2025.50.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS. 2025.50

Evidence payload

{
  "printed_excerpt": "Liam Roditty and Ariel Sapir. \u201cAdditive, Near-Additive, and Multiplicative Approximations for APSP in Weighted Undirected Graphs: Trade-Offs and Algorithms\u201d. In:45th IARCS Annual Conference on Foundations of Software Technology and Theoreti",
  "reconstructed_doi": "10.4230/LIPIcs.FSTTCS.2025.50.url:https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2025.50",
  "ref_index": 25,
  "resolved_title": null,
  "verdict_class": "incontrovertible"
}