{
  "annotation_id": "38364230-829e-4cb0-9a59-9b70b2a0c25a",
  "date_created": "2026-03-02T18:01:52.353000Z",
  "date_modified": "2026-03-02T18:01:52.353000Z",
  "file_hash": "2a84636d29099a401548dcc44bbef82ade717b9b1f7a8727005b91b77a15e1bf",
  "private": false,
  "record": {
    "abstract": "Recently in Reference [ quant-ph/0202121] a computational criterion of\nseparability induced by greatest cross norm is proposed by Rudolph. There,\nRudolph conjectured that the new criterion is not weaker than positive partial\ntranspose criterion for separability. We show that there exist counterexample\nto this claim, that is, proposed criterion is weaker than the positive partial\ntranspose criterion.",
    "arxiv_id": "quant-ph/0208041",
    "authors": [
      "S. J. Akhtarshenas",
      "M. A. Jafarizadeh"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Remarks on the Cross Norm Criterion for Separability",
    "url": "https://arxiv.org/abs/quant-ph/0208041"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "46b103cb-80fc-4380-b152-638e515d5fd5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}