Integrity report for Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth 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.27998 · pith:2026:2UDHCBFQUAD25G2CMVNJCDCH7P

0Critical

0Advisory

4Detectors run

2026-06-02Last checked

Paper page arXiv integrity.json bundle.json

Detector runs

claim_evidence completed v1.0.0 · findings 0 · 2026-06-02 15:07:48.371872+00:00

citation_quote_validity skipped v0.1.0 · findings 0 · 2026-05-28 21:50:28.941858+00:00

cited_work_retraction completed v1.0.0 · findings 0 · 2026-05-28 14:54:02.416500+00:00

ai_meta_artifact skipped v1.0.0 · findings 0 · 2026-05-28 01:34:19.044563+00:00

Findings

No public integrity findings for this paper.

Signed record

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