{
  "checks": [
    {
      "name": "parallel-unit-flow existing solver gives checked feasible vector",
      "passed": true
    },
    {
      "name": "parallel-unit-flow proposal belongs to exact reference support",
      "passed": true
    },
    {
      "name": "two-route-unit-flow existing solver gives checked feasible vector",
      "passed": true
    },
    {
      "name": "two-route-unit-flow proposal belongs to exact reference support",
      "passed": true
    },
    {
      "name": "signed-loop-flow existing solver gives checked feasible vector",
      "passed": true
    },
    {
      "name": "signed-loop-flow proposal belongs to exact reference support",
      "passed": true
    },
    {
      "name": "binary-capacity-flow existing solver gives checked feasible vector",
      "passed": true
    },
    {
      "name": "binary-capacity-flow count unknown does not mean infeasible",
      "passed": true
    },
    {
      "name": "existing solver agrees on generated infeasibility",
      "passed": true
    },
    {
      "name": "public capacity/demand model existing solver checked",
      "passed": true
    },
    {
      "name": "public model reduction is 14-by-14 and preserves binary data",
      "passed": true
    },
    {
      "name": "public model count stays unknown beyond finite reference",
      "passed": true
    },
    {
      "name": "cost optimization not relabeled uniform scenario generation",
      "passed": true
    }
  ],
  "passed": 13,
  "failed": 0,
  "scope": "NetworkX 3.4.2 single-vector feasibility proposal/independent integer validation on four generated cases and one public documented model, plus generated infeasibility. No OR-Tools execution, count/FPRAS, source proof, independent optimality, customer value or performance comparison."
}