{
  "annotation_id": "0aae4dbd-3a8d-4864-b087-39543e75af72",
  "date_created": "2026-03-02T18:02:17.210000Z",
  "date_modified": "2026-03-02T18:02:17.210000Z",
  "file_hash": "ef23deaecc6381857e0e3751a5354f659ce53c046270f6c1b8e0c90ffac37364",
  "private": false,
  "record": {
    "abstract": "We establish a relation between the two-party Bell inequalities for\ntwo-valued measurements and a high-dimensional convex polytope called the cut\npolytope in polyhedral combinatorics. Using this relation, we propose a method,\ntriangular elimination, to derive tight Bell inequalities from facets of the\ncut polytope. This method gives two hundred million inequivalent tight Bell\ninequalities from currently known results on the cut polytope. In addition,\nthis method gives general formulas which represent families of infinitely many\nBell inequalities. These results can be used to examine general properties of\nBell inequalities.",
    "arxiv_id": "quant-ph/0505060",
    "authors": [
      "David Avis",
      "Hiroshi Imai",
      "Tsuyoshi Ito",
      "Yuuya Sasaki"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/0305-4470/38/50/007",
    "title": "Two-Party Bell Inequalities Derived from Combinatorics via Triangular   Elimination",
    "url": "https://arxiv.org/abs/quant-ph/0505060"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "78729ba6-0688-4cb2-b3b2-0e836c6181b0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}