{
  "status": "complete",
  "rows": [
    2,
    2
  ],
  "columns": [
    2,
    2
  ],
  "effective_cell_bounds": [
    [
      2,
      2
    ],
    [
      2,
      2
    ]
  ],
  "total": 4,
  "exact_count": 3,
  "feasible": true,
  "tables": [
    {
      "rank": 0,
      "selection": "supplied",
      "table": [
        [
          0,
          2
        ],
        [
          2,
          0
        ]
      ]
    },
    {
      "rank": 1,
      "selection": "supplied",
      "table": [
        [
          1,
          1
        ],
        [
          1,
          1
        ]
      ]
    },
    {
      "rank": 2,
      "selection": "supplied",
      "table": [
        [
          2,
          0
        ],
        [
          0,
          2
        ]
      ]
    }
  ],
  "arithmetic": "exact_python_integers",
  "algorithm": "bounded_row_dynamic_program_and_lexicographic_unranking",
  "probability_law": "uniform_over_feasible_tables_if_rank_is_uniform",
  "random_source": "caller_supplied_ranks",
  "limits": {
    "maximum_dimension": 6,
    "maximum_total": 128,
    "memo_states": 50000,
    "count_work": 1000000,
    "sample_work": 500000
  },
  "research_connection": {
    "family": "115",
    "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
    "new_polynomial_bit_backend_implemented": false
  },
  "independent_proof_verification": "not_run",
  "privacy_guarantee": false,
  "interpretation": "This finite reference counts tables once each. Uniform tables differ from the conditional independence distribution. Budget exhaustion is unknown, never zero or infeasibility.",
  "memo_states": 5,
  "count_work": 21,
  "sample_work": 24
}