diff --git a/signed_cylinder_marked_polygons_v2.txt b/signed_cylinder_marked_polygons_v2.txt
index ae2083d..659bf3a 100644
--- a/signed_cylinder_marked_polygons_v2.txt
+++ b/signed_cylinder_marked_polygons_v2.txt
@@ -17,7 +17,7 @@ established by
     honeycomb lattice equals sqrt(2+sqrt(2)), Annals of Mathematics 175
     (2012), 1653--1665.
 
-./signed_cylinder_pdfs/duminil-copin-smirnov-2012-1202.5523-honeycomb-connective.pdf
+./pdf/signed_cylinder_pdfs/duminil-copin-smirnov-2012-1202.5523-honeycomb-connective.pdf
 
 A polygon is a simple closed unoriented cycle on H; its length |lambda| is its
 number of edges. Two polygons are incompatible when they share a vertex; each
@@ -46,7 +46,7 @@ by Beaton, Bousquet-Melou, de Gier, Duminil-Copin and Guttmann in
     walks on the honeycomb lattice is 1+sqrt(2), Communications in
     Mathematical Physics 326 (2014), 727--754.
 
-./signed_cylinder_pdfs/beaton-bousquet-melou-de-gier-duminil-copin-guttmann-2014-1406.3163.pdf
+./pdf/signed_cylinder_pdfs/beaton-bousquet-melou-de-gier-duminil-copin-guttmann-2014-1406.3163.pdf
 
 For honeycomb bridges Glazman and Manolescu obtained a logarithmic
 subsequence bound, and for columnwise rhombic half-plane tilings they proved