Integrity report for An O(nlog n)-Time Algorithm for the k-Center Problem in Trees

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

arXiv:1705.02752 · pith:2017:JWJJJHOWSUC2BSRER3NTH5DAMG

0Critical

0Advisory

0Detectors run

—Last checked

Paper page arXiv integrity.json bundle.json

Detector runs

Findings

No public integrity findings for this paper.

Signed record

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