Integrity report for On 2-connected graphs without cycles of length 1 modulo 3

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

arXiv:2606.02356 · pith:2026:HFH4JUKA6G5HSDQQPLXXQTL67S

0Critical

0Advisory

5Detectors run

2026-06-05Last checked

Paper page arXiv integrity.json bundle.json

Detector runs

claim_evidence completed v1.0.0 · findings 0 · 2026-06-05 08:29:21.404374+00:00

shingle_duplication skipped v0.1.0 · findings 0 · 2026-06-02 21:50:20.306893+00:00

citation_quote_validity skipped v0.1.0 · findings 0 · 2026-06-02 07:50:52.265913+00:00

cited_work_retraction completed v1.0.0 · findings 0 · 2026-06-02 06:56:09.016716+00:00

ai_meta_artifact skipped v1.0.0 · findings 0 · 2026-06-02 03:35:16.016196+00:00

Findings

No public integrity findings for this paper.

Signed record

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