{
  "annotation_id": "c56452e4-ec58-41f6-b4b3-4053659c5c40",
  "date_created": "2026-03-02T18:02:44.898000Z",
  "date_modified": "2026-03-02T18:02:44.898000Z",
  "file_hash": "7a040af16f9008ccb0b6d3b4c8eb22bdd3187b69b136690305d04d3acb478a8f",
  "private": false,
  "record": {
    "abstract": "Bell inequalities are derived for any number of observers, any number of\nalternative setups for each one of them, and any number of distinct outcomes\nfor each experiment. It is shown that if a physical system consists of several\ndistant subsystems, and if the results of tests performed on the latter are\ndetermined by local variables with objective values, then the joint\nprobabilities for triggering any given set of distant detectors are convex\ncombinations of a finite number of Boolean arrays, whose components are either\n0 or 1 according to a simple rule. This convexity property is both necessary\nand sufficient for the existence of local objective variables. It leads to a\nsimple graphical method which produces a large number of generalized Clauser-\nHorne inequalities corresponding to the faces of a convex polytope. It is\nplausible that quantum systems whose density matrix has a positive partial\ntransposition satisfy all these inequalities, and therefore are compatible with\nlocal objective variables, even if their quantum properties are essentially\nnonlocal.",
    "arxiv_id": "quant-ph/9807017",
    "authors": [
      "Asher Peres"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Foundations of Physics 29 (1999) 589-614",
    "title": "All the Bell inequalities",
    "url": "https://arxiv.org/abs/quant-ph/9807017"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "41debb37-c6a6-4c12-a62f-e0cee7d9b207",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}