diff --git a/CITATION.bib b/CITATION.bib
index a3863aa4..46031b63 100644
--- a/CITATION.bib
+++ b/CITATION.bib
@@ -1,4 +1,4 @@
-@article{Čufar2020,
+@article{cufar2020ripserer,
   doi = {10.21105/joss.02614},
   url = {https://doi.org/10.21105/joss.02614},
   year = {2020},
@@ -10,3 +10,13 @@ @article{Čufar2020
   title = {Ripserer.jl: flexible and efficient persistent homology computation in Julia},
   journal = {Journal of Open Source Software}
 }
+
+@misc{cufar2021fast,
+      title = {Fast computation of persistent homology representatives with involuted persistent homology},
+      author = {Matija Čufar and Žiga Virk},
+      year = {2021},
+      url = {https://arxiv.org/abs/2105.03629},
+      eprint = {2105.03629},
+      archivePrefix = {arXiv},
+      primaryClass = {math.AT}
+}
diff --git a/Project.toml b/Project.toml
index 9a51bd0c..c692d53f 100644
--- a/Project.toml
+++ b/Project.toml
@@ -1,7 +1,7 @@
 name = "Ripserer"
 uuid = "aa79e827-bd0b-42a8-9f10-2b302677a641"
 authors = ["mtsch <matijacufar@gmail.com>"]
-version = "0.16.7"
+version = "0.16.8"
 
 [deps]
 Compat = "34da2185-b29b-5c13-b0c7-acf172513d20"
diff --git a/docs/src/examples/cocycles.jl b/docs/src/examples/cocycles.jl
index 81e264f8..b0278fb6 100644
--- a/docs/src/examples/cocycles.jl
+++ b/docs/src/examples/cocycles.jl
@@ -104,7 +104,7 @@ plot!(cocycle, data; label="cocycle")
 # this increases the running time somewhat, it is still usually much more efficient than
 # computing persistent homology directly. The difference is especially large for filtrations
 # where the number of simplices increases quickly with dimension, such as Vietoris-Rips
-# filtrations.
+# filtrations. See [this paper](https://arxiv.org/abs/2105.03629) for more information.
 
 # Involuted homology is computed by passing the argument `alg=:involuted` to `ripserer`. If
 # we wanted direct homology computation, we would use `alg=:homology`. The results for both
diff --git a/docs/src/references.md b/docs/src/references.md
index aa0de434..69247c9e 100644
--- a/docs/src/references.md
+++ b/docs/src/references.md
@@ -33,3 +33,7 @@ Computational Geometry, 33(2), 249-274.
 
 Edelsbrunner, H. (1993, July). The union of balls and its dual shape. In Proceedings of the
 ninth annual symposium on Computational geometry (pp. 218-231).
+
+Čufar, M. & Virk, Ž. (2021). Fast computation of persistent homology representatives with
+involuted persistent homology. arXiv preprint
+[arxiv:2105.03629](https://arxiv.org/abs/2105.03629)
diff --git a/src/computation/ripserer.jl b/src/computation/ripserer.jl
index 78d0cbeb..de1a8a25 100644
--- a/src/computation/ripserer.jl
+++ b/src/computation/ripserer.jl
@@ -81,8 +81,8 @@ diagram, and the last is the (`dim_max`)-dimensional diagram.
     cycles. Does not find infinite intervals beyond dimension 0.
 
   - `:involuted`: Use cohomology result to compute representative cycles. Can be extremely
-    efficient compared to `:homology`, especially with `Rips` filtrations. Unlike
-    `:homology`, this algorithm finds infinite intervals.
+    efficient compared to `:homology`, especially with `Rips` filtrations. See [this
+    paper](https://arxiv.org/abs/2105.03629) for more information.
 
 * `implicit`: If `true`, an implicit reduction algorithm is used. Defaults to `true` for
   :cohomology and `:involuted`, and `false` for `:homology`. `implicit=false` is not