Integrity report for A Practical O(Rloglog n+n) time Algorithm for Computing the Longest Common Subsequence

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

arXiv:1508.05553 · pith:2015:F6WHY6PWAH4NT2XYM5DAJU4SZG

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/F6WHY6PWAH4NT2XYM5DAJU4SZG/integrity.json. Pith Number bundles also include signed pith.integrity.v1 events where a Pith Number exists.