Integrity report for Algorithm for finding vertex-edge domination number on graphs with bounded treewidth and related problems on planar graphs

A machine-verified record of the checks Pith has run against this paper: detector runs, findings, signed bundle events, and canonical identifiers.

arXiv:2605.10487

0Critical

0Advisory

4Detectors run

2026-05-20Last checked

Paper page arXiv integrity.json

Detector runs

claim_evidence completed v1.0.0 · findings 0 · 2026-05-20 05:42:01.090221+00:00

ai_meta_artifact completed v1.0.0 · findings 0 · 2026-05-19 14:42:50.842754+00:00

doi_title_agreement completed v1.0.0 · findings 0 · 2026-05-19 11:01:18.029690+00:00

doi_compliance completed v1.0.0 · findings 0 · 2026-05-19 09:15:09.984685+00:00

Findings

No public integrity findings for this paper.

Signed record

The machine-readable record for this paper lives at /pith/2605.10487/integrity.json. Pith Number bundles also include signed pith.integrity.v1 events where a Pith Number exists.