diff --git a/posts/minimizer-review-comments.org b/posts/minimizer-review-comments.org
index e47d0fa..750c2ef 100644
--- a/posts/minimizer-review-comments.org
+++ b/posts/minimizer-review-comments.org
@@ -30,6 +30,8 @@ Recent investigations indicate that ordering algorithms can achieve a density va
 $1.8/(w + 1)$ [cite:@docks-wabi], well below the originally proposed lower bound of $2/(w + 1)$ [cite:@sketching-and-sublinear-datastructures;@minimizers].
 #+end_quote
 - I cannot find the $1.8/(w+1)$ in either [cite/t:@docks-wabi] or [cite/t:@docks].
+  - It turns out the followup paper [cite/t:@improved-minimizers] states that
+    DOCKS has density factor $1.737$ for $k=w=10$.
 - For which $k$? For $k=1$, this is impossible. For $k>w$, miniception [cite:@miniception] is
   better at $1.67/w$, and in fact, mod-minimizer [cite:@modmini] is even better and
   asymptotically reaches density $1/w$, so this $1.8/(w+1)$ is quite meaningless anyway.