diff --git a/content/blog/haskell_lazy_evaluation/index.md b/content/blog/haskell_lazy_evaluation/index.md
index b9db216..5e2ba6f 100644
--- a/content/blog/haskell_lazy_evaluation/index.md
+++ b/content/blog/haskell_lazy_evaluation/index.md
@@ -386,7 +386,8 @@ later read from, and future state, from which you can
 read values before your write them. Check out
 [his complete example](https://kcsongor.github.io/time-travel-in-haskell-for-dummies/#a-single-pass-assembler-an-example) here.
 
-Alternatively, here's an example from my research. I'll be fairly
+Alternatively, here's an example from my research, which my
+coworker and coauthor Kai helped me formulate. I'll be fairly
 vague, since all of this is still in progress. The gist is that
 we have some kind of data structure (say, a list or a tree),
 and we want to associate with each element in this data