Integrity report for Revisiting the Maximum Defective Clique Problem: Faster Branching and a Tighter Upper Bound

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

arXiv:2605.16948 · pith:2026:S6YQVOIWFW3Q6O7VB6INVRTSP5

0Critical

0Advisory

5Detectors 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 18:36:45.407720+00:00

doi_title_agreement completed v1.0.0 · findings 0 · 2026-05-25 19:32:48.449108+00:00

doi_compliance completed v1.0.0 · findings 0 · 2026-05-24 19:51:39.049174+00:00

claim_evidence completed v1.0.0 · findings 0 · 2026-05-22 19:42:55.205835+00:00

cited_work_retraction completed v1.0.0 · findings 0 · 2026-05-19 20:21:56.552627+00:00

Findings

No public integrity findings for this paper.

Signed record

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