pith. sign in

Integrity report for A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs

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

arXiv:1607.02986 · pith:2016:P2C6NWCLCGT23HVN3TZNIUGF4T

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