Integrity report for The computational complexity of Kauffman nets and the P versus NP problem

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

arXiv:cond-mat/0510840 · pith:2005:YZKNKW4JF7Z6PS6NZQUOUOMFPI

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