Unresolvable Identifier

arXiv:2604.20786 · detector doi_compliance · cross_source · 2026-05-20 01:34:50.668835+00:00

critical doi_compliance unresolvable_identifier

Identifier '10.1007/bfb0028814https://doi.org/10.1007/bfb0028814' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.

Paper page Integrity report arXiv Try DOI

Evidence text

Burkhard Monien. The complexity of embedding graphs into binary trees. In Lothar Bu- dach, editor,Proceedings of Fundamentals of Computation Theory, FCT ’85, volume 199 ofLNCS, pages 300–309. Springer, 1985. URL: https://doi.org/10.1007/BFb0028814https://doi.org/10.1007/BFb0028814, doi:10.1007/BFB0028814doi:10.1007/BFB0028814

Evidence payload

{
  "arxiv_id": null,
  "checked_sources": [
    "crossref_by_doi",
    "openalex_by_doi",
    "doi_org_head"
  ],
  "doi": "10.1007/bfb0028814https://doi.org/10.1007/bfb0028814",
  "raw_excerpt": "Burkhard Monien. The complexity of embedding graphs into binary trees. In Lothar Bu- dach, editor,Proceedings of Fundamentals of Computation Theory, FCT \u201985, volume 199 ofLNCS, pages 300\u2013309. Springer, 1985. URL: https://doi.org/10.1007/BFb0028814https://doi.org/10.1007/BFb0028814, doi:10.1007/BFB0028814doi:10.1007/BFB0028814",
  "ref_index": 10,
  "verdict_class": "cross_source"
}