Nonisomorphic colex shadow minimizers

Minimum-shadow families need not be unique up to permutation. Four edges of a four-cycle and the first four pairs in colexicographic order both have four vertices in their lower shadow, but the latter graph has a triangle. For triples, the six sets consisting of two points from $\{1,2,3\}$ and one from $\{4,5\}$ have a nine-pair shadow. The initial six colex triples also have shadow size nine, but their point degrees are $5,4,4,3,2$ instead of $4,4,4,3,3$.