\ifverbose{
\subsection{Contributions}

The major results of this paper are as follows.
\begin{enumerate}
\item We give empirical measurements showing strong evidence that
reuse of subroutines from software libraries follows a Zipf-like
distribution.
\item We prove that under reasonable assumptions the reuse
rates $\lambda(n)$ of software components (of any sort, not just
subroutines) are asymptotically bounded by $(n \log_2 n)^{-1}$.
\item We investigate the proportion of code that one might 
expect to reuse from libraries.  Adopting ideas from Kolmogorov
complexity, we associate with a given problem domain a
\emph{randomness deficit rate} that measures how diverse
software is within the problem domain.  This randomness
deficit governs how much library code we can expect to
reuse in implementing programs.  If software within a
domain is highly diverse, libraries are of little use:
asymptotically the number of components we may usefully
reuse is bounded by a constant, and the fraction of code
we can reuse from libraries tends to zero as program
size increases.  On the other hand if software is not
very diverse,  \editor{...}
\end{enumerate}
}

