Recoverable Identifier

arXiv:2605.04465 · detector doi_compliance · incontrovertible · 2026-05-19 14:23:13.458481+00:00

advisory doi_compliance recoverable_identifier

DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1137/16m1082018Anja) 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

AND Subset Sum is Hard: Tight Conditional Lower Bounds for Scheduling, Matching, and Related Problems.SIAM J. Comput.48, 2 (2019), 539–579. doi:10.1137/16M1082018 Anja Becker, Jean-Sébastien Coron, and Antoine Joux

Evidence payload

{
  "printed_excerpt": "AND Subset Sum is Hard: Tight Conditional Lower Bounds for Scheduling, Matching, and Related Problems.SIAM J. Comput.48, 2 (2019), 539\u2013579. doi:10.1137/16M1082018 Anja Becker, Jean-S\u00e9bastien Coron, and Antoine Joux",
  "reconstructed_doi": "10.1137/16m1082018Anja",
  "ref_index": 1,
  "resolved_title": null,
  "verdict_class": "incontrovertible"
}