Integrity report for On the Complexity of the Minimum-(k,rho)-Shortcut Problem

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

arXiv:2605.13474 · pith:2026:MLJM6BMX43ZRUG73UH4F5N46FF

0Critical

0Advisory

4Detectors run

2026-05-26Last checked

Paper page arXiv integrity.json bundle.json

Detector runs

ai_meta_artifact completed v1.0.0 · findings 0 · 2026-05-26 09:45:31.040224+00:00

doi_title_agreement completed v1.0.0 · findings 0 · 2026-05-21 14:01:43.011477+00:00

doi_compliance completed v1.0.0 · findings 0 · 2026-05-20 07:06:09.077804+00:00

claim_evidence completed v1.0.0 · findings 0 · 2026-05-19 19:41:56.618488+00:00

Findings

No public integrity findings for this paper.

Signed record

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