{
  "annotation_id": "1e2d366a-0edc-44d0-a5d1-b28a714eb44c",
  "date_created": "2026-02-17T05:53:24.227000Z",
  "date_modified": "2026-02-17T05:53:24.227000Z",
  "file_hash": "a36c4cb2aeb7bf45d24eda47f5b2d5acc975d084aee6f8fe780fd84238864f8c",
  "private": false,
  "record": {
    "abstract": "A holographic entropy inequality (HEI) is a linear inequality obeyed by Ryu-Takayanagi holographic entanglement entropies, or equivalently by the minimum cut function on weighted graphs. We establish a new combinatorial framework for studying HEIs, and use it to prove several properties they share, including two majorization-related properties as well as a necessary and sufficient condition for an inequality to be an HEI. We thereby resolve all the conjectures presented in [arXiv:2508.21823], proving two of them and disproving the other two. In particular, we show that the null reduction of any superbalanced HEI passes the majorization test defined in [arXiv:2508.21823], thereby providing strong new evidence that all HEIs are obeyed in time-dependent holographic states.",
    "arxiv_id": "2601.09987",
    "authors": [
      "Guglielmo Grimaldi",
      "Matthew Headrick",
      "Veronika E. Hubeny",
      "Pavel Shteyner"
    ],
    "categories": [
      "hep-th",
      "quant-ph"
    ],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "title": "Combinatorial properties of holographic entropy inequalities",
    "url": "https://arxiv.org/abs/2601.09987",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7eac85e7-44d5-4ff9-a9b9-d61a93f9c93e",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}