{
  "protocol": "Blind: the hidden permutation is generated per trial and read only for scoring. Each solver is scored as returned and again after exact steepest-descent refinement.",
  "rows": [
    {
      "field": "omit-size-BOUND0.997",
      "method": "PATH convex-concave",
      "raw": 0.005208333333333333,
      "refined": 0.00390625,
      "seconds": 3.187158743540446,
      "failures": []
    },
    {
      "field": "omit-size-BOUND0.997",
      "method": "moment ladder tr(M^k)",
      "raw": 0.006510416666666667,
      "refined": 0.01171875,
      "seconds": 0.5490624109903971,
      "failures": []
    },
    {
      "field": "rank8-BOUND0.93",
      "method": "PATH convex-concave",
      "raw": 0.8046875,
      "refined": 0.8658854166666666,
      "seconds": 3.164182504018148,
      "failures": []
    },
    {
      "field": "rank8-BOUND0.93",
      "method": "moment ladder tr(M^k)",
      "raw": 0.09375,
      "refined": 0.21354166666666666,
      "seconds": 0.5453250408172607,
      "failures": []
    },
    {
      "field": "synth-full-BOUND0.99",
      "method": "PATH convex-concave",
      "raw": 0.9583333333333334,
      "refined": 0.9609375,
      "seconds": 3.1100974082946777,
      "failures": []
    },
    {
      "field": "synth-full-BOUND0.99",
      "method": "moment ladder tr(M^k)",
      "raw": 0.03515625,
      "refined": 0.11197916666666667,
      "seconds": 0.46936917304992676,
      "failures": []
    }
  ]
}