Add paper 2: information-theoretic unification of workspace graph metrics

Introduces a 21-page paper focused exclusively on the Copycat Workspace,
proposing three graph-metric substitutions for hardcoded constants and
unifying them under a common information-theoretic framework:

- Clustering coefficient as support vector (replaces 0.6^(1/n^3) factor)
- Betweenness centrality as salience weights (replaces fixed 0.2/0.8 ratios)
- Subgraph density as length factors (replaces step function {5,20,60,90})

Central contribution: all three metrics are ratios actual/maximum in [0,1],
interpretable as probabilities, yielding Shannon self-information in bits.
This common unit enables principled arithmetic via workspace entropy
H(W) = sum(I_C) + sum(I_B) + sum(I_rho), with the conjecture T ∝ H(W).

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>

LaTeX/paper2/paper.bbl

@@ -0,0 +1,87 @@
+\begin{thebibliography}{10}
+
+\bibitem{bianconi2009entropy}
+Ginestra Bianconi.
+\newblock Entropy of network ensembles.
+\newblock {\em Physical Review E}, 79(3):036114, 2009.
+
+\bibitem{boccaletti2006complex}
+Stefano Boccaletti, Vito Latora, Yamir Moreno, Martin Chavez, and D.-U. Hwang.
+\newblock Complex networks: Structure and dynamics.
+\newblock {\em Physics Reports}, 424(4):175--308, 2006.
+
+\bibitem{brandes2001faster}
+Ulrik Brandes.
+\newblock A faster algorithm for betweenness centrality.
+\newblock {\em Journal of Mathematical Sociology}, 25(2):163--177, 2001.
+
+\bibitem{cover2006elements}
+Thomas~M. Cover and Joy~A. Thomas.
+\newblock {\em Elements of Information Theory}.
+\newblock Wiley-Interscience, Hoboken, NJ, 2nd edition, 2006.
+
+\bibitem{dehmer2011history}
+Matthias Dehmer and Abbe Mowshowitz.
+\newblock A history of graph entropy measures.
+\newblock {\em Information Sciences}, 181(1):57--78, 2011.
+
+\bibitem{erdos1959random}
+Paul Erd\"{o}s and Alfr\'{e}d R\'{e}nyi.
+\newblock On random graphs.
+\newblock {\em Publicationes Mathematicae Debrecen}, 6:290--297, 1959.
+
+\bibitem{gentner1983structure}
+Dedre Gentner.
+\newblock Structure-mapping: A theoretical framework for analogy.
+\newblock {\em Cognitive Science}, 7(2):155--170, 1983.
+
+\bibitem{hofstadter1995fluid}
+Douglas~R. Hofstadter and FARG.
+\newblock {\em Fluid Concepts and Creative Analogies: Computer Models of the
+  Fundamental Mechanisms of Thought}.
+\newblock Basic Books, New York, NY, 1995.
+
+\bibitem{jaynes1957information}
+Edwin~T. Jaynes.
+\newblock Information theory and statistical mechanics.
+\newblock {\em Physical Review}, 106(4):620--630, 1957.
+
+\bibitem{linhares2025graph}
+Alex Linhares.
+\newblock From hardcoded heuristics to graph-theoretical constructs: A
+  principled reformulation of the copycat architecture.
+\newblock {\em Manuscript}, 2025.
+\newblock Paper 1 in this series.
+
+\bibitem{mitchell1993analogy}
+Melanie Mitchell.
+\newblock {\em Analogy-Making as Perception: A Computer Model}.
+\newblock MIT Press, Cambridge, MA, 1993.
+
+\bibitem{mowshowitz1968entropy}
+Abbe Mowshowitz.
+\newblock Entropy and the complexity of graphs: I. an index of the relative
+  complexity of a graph.
+\newblock {\em Bulletin of Mathematical Biophysics}, 30(1):175--204, 1968.
+
+\bibitem{newman2018networks}
+Mark E.~J. Newman.
+\newblock {\em Networks}.
+\newblock Oxford University Press, Oxford, UK, 2nd edition, 2018.
+
+\bibitem{rashevsky1955life}
+Nicolas Rashevsky.
+\newblock Life, information theory, and topology.
+\newblock {\em Bulletin of Mathematical Biophysics}, 17(3):229--235, 1955.
+
+\bibitem{shannon1948mathematical}
+Claude~E. Shannon.
+\newblock A mathematical theory of communication.
+\newblock {\em Bell System Technical Journal}, 27(3):379--423, 1948.
+
+\bibitem{watts1998collective}
+Duncan~J. Watts and Steven~H. Strogatz.
+\newblock Collective dynamics of 'small-world' networks.
+\newblock {\em Nature}, 393(6684):440--442, 1998.
+
+\end{thebibliography}