Data and verification package for "New Lower Bounds for C4-Free Subgraphs of the Hypercubes Q6, Q7, and Q8: Constructions, Structure, and Computational Method"

Reproducibility package for the C4-free hypercube lower-bound constructions. Contains: explicit edge lists for the record C4-free subgraphs of Q6 (132 edges), Q7 (304 edges) and Q8 (680 edges); machine-verifiable certificates (SHA-256 hashes, edge counts, and a complete enumeration of all four-cycles establishing C4-freeness); and a dependency-free verification script that re-checks every certificate from scratch. Each construction can be independently re-verified without external libraries.