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.1137/1.9781611977912.170.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.170) 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

Barna Saha and Christopher Ye. “Faster Approximate All Pairs Shortest Paths”. In:Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). siam, 2023, pp. 4758–4827.doi:10.1137/ 1.9781611977912.170. eprint:https://epubs.siam.org/doi/pdf/10.1137/1.9781611977912.170.url: https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.170

Evidence payload

{
  "printed_excerpt": "Barna Saha and Christopher Ye. \u201cFaster Approximate All Pairs Shortest Paths\u201d. In:Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). siam, 2023, pp. 4758\u20134827.doi:10.1137/ 1.9781611977912.170. eprint:https://epu",
  "reconstructed_doi": "10.1137/1.9781611977912.170.url:https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.170",
  "ref_index": 26,
  "resolved_title": null,
  "verdict_class": "incontrovertible"
}