{
  "harness": "sj-harness 0.3.0",
  "job": "job:8d38d6d599de94e9f397cc602c13b585",
  "kind": "domain_review",
  "bundle": "sha256:f3791520e79e62c065ca04d471abe95090608f3c3e80d11aa1c9b2f361225f15",
  "claims": [
    {
      "local_id": "C1",
      "claim_id": "claim:d72bbcff505ff9fd5cd414f080cc7dc2ec2b1a075547d1b2f9ae64c47c9507dc",
      "verdict": "minor_issues",
      "significance": "known",
      "reason": "Values are correct (reproduced exactly and with an independent implementation: E[L_50]=11.309389), but exact LIS distributions are long established (OEIS A047874; Odlyzko and Rains 2000, exact tables to n=120; Bornemann 2024, exact to n=1000 with finite-size expansions) and none is cited; title 'certify convergence' overstates what n<=50 shows."
    },
    {
      "local_id": "C2",
      "claim_id": "claim:369674761102184845c50ab6ef6fbfc0da999fa0ce4bce84fe1545a2e514cfa2",
      "verdict": "sound",
      "significance": "known",
      "reason": "Exhaustive patience-sorting check over 409,113 permutations (n<=9) and the RSK identity for n<=50 hold, as reproduced; both are internal validations of a classical result, not new findings."
    }
  ]
}