{
  "annotation_id": "c4d0f23d-ac5c-47de-8492-0e2a6c118dcd",
  "date_created": "2026-03-02T18:01:42.534000Z",
  "date_modified": "2026-03-02T18:01:42.534000Z",
  "file_hash": "f5540ad2aaadd31478b67a0ca3ce1aa2965332ed55e72a6417f281d99fa0b60b",
  "private": false,
  "record": {
    "abstract": "The difference between ideal experiments to test Bell\u0027s weak nonlocality and\nthe real experiments leads to loopholes. Ideal experiments involve either\ninequalities (Bell) or equalities (Greenberger, Horne, Zeilinger). Every real\nexperiment has its own critical inequalities, which are almost all more\ncomplicated than the corresponding ideal inequalities and equalities. If one of\nthese critical inequalities is violated, then the detection loophole is closed,\nwith no further assumptions. If all the critical inequalities are satisfied,\nthen it remains open, unless further assumptions are made. The computer program\ndescribed here and published on the website\nhttp://www.strings.ph.qmw.ac.uk/QI/main.htm obtains the critical inequalities\nfor any real experiment, given the number of allowed settings of the angles and\nthe corresponding possible output signals for a single run. Given all the\nnecessary conditional probabilities or rates, it tests whether all these\ninequalities are satisfied.",
    "arxiv_id": "quant-ph/0012024",
    "authors": [
      "Roberto M. Basoalto",
      "Ian C. Percival"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/S0375-9601(01)00035-4",
    "title": "A general computer program for the Bell detection loophole",
    "url": "https://arxiv.org/abs/quant-ph/0012024"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7ca8cb25-ec97-4350-87ef-dbd3fbd4848e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}