We present DG-CLF/H2, a governed discovery and certification pipeline for planar unit-distance graphs. The pipeline integrates Henneberg-style construction and H2-guided local rewiring near the Moser lattice, a Closing-Latent-Force (CLF) scoring heuristic for density guidance, rigidity gating, PSLQ-based algebraic exactification, and symbolic verification. We demonstrate the pipeline in two directions. In the positive direction, we produce a fully certified configuration of 24 planar points with 66 unit distances, with exact coordinates in the algebraic number field , a rigidity rank of , symbolic verification confirming exactly 66 unit pairs and zero extra pairs, and no isomorphic match after scanning all 310,323 entries of the local dbs-udg dataset for . In the negative direction, we conduct seven independent audits of routes toward , including local perturbation, scaffold attacks from witnesses, abstract graph generation, SDP with Cayley-Menger constraints, and a field-guided MILP search in . The field-guided MILP certifies that no 25-point configuration with 73 unit distances exists within the coefficient box of the Moser integer basis. DG-CLF/H2 is presented not as a record-breaking engine but as a governed pipeline capable of producing exact positive certificates and reproducible bounded negative audits in the same framework.
Danilo Quintero Rodriguez (2026) studied this question.