{
  "vertices": 4,
  "edges": 3,
  "input_record_sha256": "01cacd002744949fb4c665580ad6548a65fa42255d69551ddc3b31db2c7c08f7",
  "matching_feasible": true,
  "matching_size": 1,
  "candidate_issues": [],
  "barrier": [
    0
  ],
  "component_sizes": [
    1,
    1,
    1
  ],
  "odd_components": 3,
  "cardinality_upper_bound": 1,
  "maximum_cardinality_certificate_verified": true,
  "optimality_status": "certified_by_matching_and_upper_bound",
  "upper_bound_gap": 0,
  "objective": "unweighted_maximum_cardinality",
  "arithmetic": "exact_integer_graph_operations",
  "limits": {
    "vertices": 100000,
    "edges": 500000
  },
  "source_connection": {
    "family": "120",
    "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
    "new_source_matching_algorithm_implemented": false,
    "source_proof_verification": "not_run"
  },
  "formal_program_verification": "not_run",
  "interpretation": "A feasible matching attaining the checked odd-component or vertex bound is maximum cardinality. A nonzero gap is inconclusive. Weight, fairness, multiway assignment and source algorithm correctness are outside this audit."
}