Tidying

paper/paper.tex

@@ -72,7 +72,7 @@ Each node shows its partial prefix annotated with $(max,point,range)$.
 
 \subsection{Checking point reads}
 
-The algorithm for checking point reads follows directly from the definitions of the \emph{point} and \emph{range}.
+The algorithm for checking point reads follows directly from the definitions of the \emph{point} and \emph{range} fields.
 Our input is a key $k$ and a read version $r$, and we must report whether or not the write version $v_{k}$ of $k$ is less than or equal to $r$.
 In order to find $v_{k}$, we search for the node whose prefix matches $k$.
 If such a node exists and has \emph{point} set, then $v_{k}$ is its \emph{point} field.