Verification data and code for "A 32-leaf tree requiring six coordinates for an isometric ℓ∞ embedding"

Ancillary material for the paper “A 32-leaf tree requiring six coordinates for an isometric ℓ∞ embedding.” The deposit contains the explicit 32-leaf tree, a six-orientation cover, the induced integer embedding, an exact exclusion of five-orientation covers, and census records and verification procedures establishing that the leaf bound holds through 31 leaves and first fails at 32. Two Jupyter notebooks reproduce the principal checks.