{
  "annotation_id": "fe4b27b4-af29-43e6-b025-ebc6a2f57121",
  "date_created": "2026-02-17T05:53:11.937000Z",
  "date_modified": "2026-02-17T05:53:11.937000Z",
  "file_hash": "48037ab785448bf8ebeb81d38421fe2ad2d3bb290db14280ee54e3f6ce1686a9",
  "private": false,
  "record": {
    "abstract": "The metric MinDist, introduced recently to quantify the distance of an arbitrary Rummy hand from a valid declaration, plays a central role in algorithmic hand evaluation and optimal play. Existing results show that the MinDist of any $13$-card Rummy hand from a single deck is bounded above by $9$. In this paper, we sharpen this bound and prove that the MinDist of any hand is at most $7$. We further show that this bound is tight by explicitly exhibiting a hand whose MinDist equals $7$ for a suitable choice of wildcard joker. The proof combines elementary combinatorial arguments with structural properties of card partitions across suits and resolves the gap between the previously known upper bound and the true extremal value.",
    "arxiv_id": "2601.07746",
    "authors": [
      "Purushottam Saha",
      "Diganta Mukherjee"
    ],
    "categories": [
      "math.CO"
    ],
    "license": "http://creativecommons.org/licenses/by-sa/4.0/",
    "title": "MinDist is less than 7",
    "url": "https://arxiv.org/abs/2601.07746",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "60803bbc-252e-4b0a-a8c1-f5320b0563cb",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}