Certificate artifact for "Certified Finite-State Induction for a Perturbed Hofstadter Recursion"

This record contains the compressed finite symbolic and arithmeticcertificate used in the computer-assisted proof of globalwell-definedness for the perturbed Hofstadter recursion Q(1)=Q(2)=1,Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2))+(-1)^n. The main artifact is certificate.txt.zst. After decompression it yieldscertificate.txt, the machine-readable certificate consumed by theverification programs in the accompanying GitHub repository. The certificate contains the finite word systems, symbolic contexts,extension records, realization records, arithmetic recurrence records,dependency offsets, recurrence values, and parity data used by theverification checkers. The accompanying HASHES.txt file records SHA256 hashes of the compressedand uncompressed certificate and representative verification logs.