Recoverable Identifier

arXiv:2605.12893 · detector doi_compliance · incontrovertible · 2026-05-20 21:58:12.678457+00:00

advisory doi_compliance recoverable_identifier

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

N. Glover and J. Hoffmann 29 19 Martin Hofmann. The strength of non-size increasing computation. InProceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL ’02, page 260–269. Association for Computing Machinery, January 2002.doi:10.1145/503272.5 03297. 20 Martin Hofmann. Linear types and non-size-increasing polynomial time computation.Infor- mation and Computation, 183(1):57–85, May 2003.doi:10.1016/S0890-5401(03)00009-9. 21 Neil D. Jones. The expressive power of higher-order types or, life without cons.Journal of Functional Programming, 11(1):55–94, March 2001.doi:10.1017/S0956796800003889. 22 Ugo Lago and Martin Hofmann. Bounded linear logic, revisited. InProceedings of the 9th International Conference on Typed Lambda Calculi and Applications, TLCA ’09, page 80–94. Springer-Verlag, 2009.doi:10.1007/978-3-642-02273-9_8. 23 Runming Li, Yue Yao, and Robert Harper. Mechanizing synthetic tait computability in Istari. InProceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP ’26, page 231–247. Association for Computing Machinery, January

Evidence payload

{
  "printed_excerpt": "N. Glover and J. Hoffmann 29 19 Martin Hofmann. The strength of non-size increasing computation. InProceedings of the 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201902, page 260\u2013269. Association for Computin",
  "reconstructed_doi": "10.1145/503272.503297.20",
  "ref_index": 8,
  "resolved_title": null,
  "verdict_class": "incontrovertible"
}