diff --git a/201-persist/Makefile b/201-persist/Makefile
index e314f5f55a2fff3b170f3a043f68aa6353116fdd..e1dec3f0d93f8eb13300b2280f1daa458593163a 100644
--- a/201-persist/Makefile
+++ b/201-persist/Makefile
@@ -1,4 +1,4 @@
-PICS=point-localization
+PICS=point-localization fat-nodes path-copying
 
 TOP=..
 
diff --git a/201-persist/persist.tex b/201-persist/persist.tex
index cdf82241bbbd7137a376aa599a39228af3d4217b..681867cbf9cde022fc94641b65f823c4becc1271 100644
--- a/201-persist/persist.tex
+++ b/201-persist/persist.tex
@@ -148,7 +148,7 @@ First B is inserted as a left child of A, then C is inserted as a left child of
 These operations are captured by a schema of fat vertices in figure \figref{taf-nodes}. 
 Inverse pointers for the latest version are dotted.
 
-\figure[fat-nodes]{fat-nodes.pdf}{Fat Nodes}
+\figure[fat-nodes]{fat-nodes.pdf}{}{Fat Nodes}
 
 To take advantage of fat nodes, we need the balancing algorithm to limit the number of vertices that change in one operation. 
 It is sufficient that the changes can be amortized to a constant number per update.