Merge pull request #1 from apozas/arXiv-ref

Add arxiv ref

Compatibility_with_bipartite_models.ipynb

@@ -4,9 +4,9 @@
    "cell_type": "markdown",
    "metadata": {},
    "source": [
-    "# Computational appendix of [arXiv:](www.arxiv.org/abs/).\n",
+    "# Computational appendix of [arXiv:1904.08943](https://arxiv.org/abs/1904.08943).\n",
     "---\n",
-    "In this appendix we describe with explicit formulas the *scalar extension* method presented in [arXiv:](www.arxiv.org/abs/) to impose relaxations of (non-convex) factorization constraints in semidefinite programs, and show how this method can be used to study correlations in complex causal networks.\n",
+    "In this appendix we describe with explicit formulas the *scalar extension* method presented in [arXiv:1904.08943](https://arxiv.org/abs/1904.08943) to impose relaxations of (non-convex) factorization constraints in semidefinite programs, and show how this method can be used to study correlations in complex causal networks.\n",
     "\n",
     "authors: Alejandro Pozas-Kerstjens\n",
     "\n",

README.md

@@ -1,8 +1,8 @@
 [![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.2646262.svg)](https://doi.org/10.5281/zenodo.2646262)
 
-## Computational appendix of *[Bounding the sets of classical and quantum correlations in networks](https://www.arxiv.org/abs/1904......)*
+## Computational appendix of *[Bounding the sets of classical and quantum correlations in networks](https://arxiv.org/abs/1904.08943)*
 
-This is a repository containing the computational appendix of the article "*Bounding the sets of classical and quantum correlations in networks*. Alejandro Pozas-Kerstjens, Rafael Rabelo, Lukasz Rudnicki, Rafael Chaves, Daniel Cavalcanti, Miguel Navascués, and Antonio Acín. [arXiv:1904......](https://www.arxiv.org/abs/1904......)." It provides tools for performing scalar extension of moment matrices in order to develop SDP hierarchies (in the spirit of the Navascués-Pironio-Acín hierarchy) that bound the set of correlations compatible with quantum causal networks with causally-independent parties.
+This is a repository containing the computational appendix of the article "*Bounding the sets of classical and quantum correlations in networks*. Alejandro Pozas-Kerstjens, Rafael Rabelo, Lukasz Rudnicki, Rafael Chaves, Daniel Cavalcanti, Miguel Navascués, and Antonio Acín. [arXiv:1904.08943](https://arxiv.org/abs/1904.08943)." It provides tools for performing scalar extension of moment matrices in order to develop SDP hierarchies (in the spirit of the Navascués-Pironio-Acín hierarchy) that bound the set of correlations compatible with quantum causal networks with causally-independent parties.
 
 All code is written both in Python. It requires [Ncpol2sdpa](https://ncpol2sdpa.readthedocs.io/en/stable/), NumPy, [PICOS](https://picos-api.gitlab.io/picos/) <= 1.1.3.post8, and SciPy.