diff --git a/README.md b/README.md
index 7886b9e..d2c948f 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,7 @@
-# Bisected graph matching improves automated neuron pairing between hemispheres in connectomes
+# Bisected graph matching improves automated pairing of bilaterally homologous neurons from connectomes
+Benjamin D. Pedigo, Michael Winding, Carey E. Priebe, Joshua T. Vogelstein
 
-[![Jupyter Book Badge](https://jupyterbook.org/badge.svg)](http://docs.neurodata.io/bgm/) [![DOI](https://zenodo.org/badge/475470258.svg)](https://zenodo.org/badge/latestdoi/475470258)
+[![bioRxiv Badge](https://img.shields.io/badge/bioRxiv-2022.05.19.492713-green)](https://www.biorxiv.org/content/10.1101/2022.05.19.492713) [![Jupyter Book Badge](https://jupyterbook.org/badge.svg)](http://docs.neurodata.io/bgm/) [![DOI](https://zenodo.org/badge/475470258.svg)](https://zenodo.org/badge/latestdoi/475470258)
 
 ## Abstract 
 Graph matching algorithms attempt to find the best correspondence between the nodes of two networks. These techniques have previously been used to match individual neurons in nanoscale connectomes; in particular, to find pairings of neurons across hemispheres. However, since graph matching techniques deal specifically with two networks, they have only utilized the ipsilateral (same hemisphere) subgraphs when performing the matching. Here, we present a modification to a state-of-the-art graph matching algorithm which allows it to solve what we call the bisected graph matching problem. This modification allows us to use connections between the brain hemispheres when predicting neuron pairs. We show in simulation as well as real connectome examples that when edge correlation is present between the contralateral (between hemisphere) subgraphs, this approach improves matching accuracy. We expect that our proposed method will improve future endeavors to accurately match neurons between hemispheres in connectomes, and be useful in other applications where the bisected graph matching problem arises.