Topics — What a work is about. Nucleation holds whatever reading the owner files here, whether or not an Anthology of the SOTA topic could also hold it; instruction for ML practice belongs to the anthology (ADR-048). The words are seeded from the clusters the reading-time triage of 2026-09-25 found, and grow by decision.
Complex systems — emergence, information decomposition, individuality, self-organization — how collective behaviour arises from parts.
210 of 2004 LIT documents. Back to the full index.
| # | Title | Summary | Status |
|---|---|---|---|
| LIT-005 v3 | Adding causality to the information-theoretic perspective on individuality | Bourrat (2024), DOI-10.1007/s13194-023-00566-1. Of Krakauer et al.’s (2020) three mutual-information “individuality” terms (A* = I(S_{t+1}; S_t), A = I(S_{t+1}; S_t | E_t), nC = I(S_{t+1}; E_t | S_t)), Bourrat argues that nC and A* are not individuality measures. He then proposes the interventional  = I(S_{t+1}; Ŝ_t) (Eq. 6) and two ETI criteria: C1, a normalised Â_{S2}/H(Ŝ2) ≥ Â_{S1}/H(Ŝ1)|θ₀, and C2, low Var(Â_{S2} | Ê2 = ê2k). None of these is computed on any system. The paper’s claim that  ≡ I(S_{t+1}; S_t | E_t) = A in Krakauer’s model is false in general. | Proposed — read in full 2026-09-25 (NOTE-027); a clear conceptual argument that information-theoretic individuality should be interventional. It is unproven as a measure. Three things would settle it: a worked computation of Â, C1 and C2 on an explicit model (for example Black et al.’s ecological-scaffolding model); a corrected account of how  relates to the observational A; and a correct adjustment set for its own Fig. 3 example. |
| LIT-021 v3 | From the origin of life to pandemics: emergent phenomena in complex systems | Artime & De Domenico (2022), ARXIV-2205.11595. An editorial review with no new result. Its one formal item (§4, Eq. 4.1: x(t+1) = f[x(t)], x(0) = x₀) sorts phenomena three ways. Non-emergent: local rules plus initial conditions let you deduce the “expected” high-level pattern. Weakly emergent: they let you deduce an “unexpected” one by computation. Strongly emergent: no deduction is possible even in principle. “Unexpected” is never defined. The rest is a cross-domain survey (§3), a 16-paper map of the theme issue (§5), and an outlook (§6). | Active — read in full 2026-09-25 (NOTE-007); worth reading as the table of contents and framing of the Phil. Trans. A theme issue that holds LIT-025 and LIT-027 (§5), and as a quick survey of emergence examples. Do not cite it for a definition of emergence, because its “mathematical” definition leaves the deciding criterion (“unexpected”) informal. |
| LIT-025 v4 | Greater than the parts: a review of the information decomposition approach to causal emergence | Mediano et al. (2022), ARXIV-2111.06518. A review, with no new theorem, of the ΦID theory of causal emergence. A supervenient feature V_t is k-th-order causally emergent iff Un⁽ᵏ⁾(V_t; X_t′ | X_t) > 0. A system hosts such features iff Syn⁽ᵏ⁾(X_t; X_t′) > 0 (cited as Rosas et al. 2020, Theorem 1), and Syn⁽ᵏ⁾ = D⁽ᵏ⁾ + G⁽ᵏ⁾ (downward causation plus causal decoupling). The review’s own additions are interpretive: the formalism is neutral between Granger and Pearl, coordinate dependence is defended as a feature, and it rebuts the charge that the theory makes no macro-versus-micro comparison. | Active — read in full 2026-09-25 (NOTE-010); a short, accurate map of the ΦID emergence formalism and the right entry point to Rosas et al. 2020, which a reader will still need for the proofs, the assumptions and the redundancy-free practical criteria. None of these is stated in the review. |
| LIT-027 v4 | Emergence as the conversion of information: a unifying theory | Varley & Hoel (2022), ARXIV-2104.13368. Varley and Hoel apply a PID, with the Williams–Beer I_min redundancy, to past→future mutual information and summarise it with a new layer-weighted “synergy bias” B_syn ∈ [0,1]. Coarse-graining can raise B_syn at the macroscale. A macroscale XOR reaches 0.833, against 0.52 for its NAND/AND/OR implementation. In 200 random 3-node “Gaussian” TPMs expanded into equivalence-class micro/mesoscales with identical MI, every macroscale had higher B_syn, by ≈ 0.01–0.07 (r = 0.819 against macroscale B_syn). In 185 near-deterministic systems the change was mostly negative, down to ≈ −0.1. | Active — read in full 2026-09-25 (NOTE-020); a clear, small-scale demonstration that coarse-graining can change the redundant/synergistic composition of information and not just its amount. It is worth reading as the explicit cross-scale counterpoint to the ΦID account (item 21). Its “unifying theory” is a framing: the EI section re-describes a known decomposition and contains no new result. |
| LIT-035 v2 | The ergodicity solution of the cooperation puzzle | Peters & Adamou (2022), DOI-10.1098/rsta.2020.0425. If N entities’ resources follow GBM (drift μ, volatility σ, independent noise), then pooling and sharing equally every step leaves the drift at μ, cuts the volatility to σ/√N (Eq. 3.9), and raises each member’s time-average growth rate from μ − σ²/2 to μ − σ²/(2N) (Eq. 4.1). The premium is (σ²/2)(1 − 1/N) (Eq. 4.2). With pairwise correlation ρ the effective volatility is σ√((1 + (N−1)ρ)/N), and the large-N limit is μ − σ²ρ/2 (Eqs. 5.12–5.13). | Active — read in full 2026-09-25 (NOTE-059); worth reading as the clearest short derivation of the risk-pooling (geometric-mean) advantage of sharing under multiplicative noise. The mathematics is correct and self-contained. The framing claim, that this “solves” the cooperation puzzle and makes cooperation the default, rests on the model’s zero-cost, no-cheating assumptions, and the paper’s own citations (McCloskey, Winterhalder, Uitdehaag, Kennedy et al.) show the core result was already known. |
| LIT-036 v2 | Self-organization of primitive metabolic cycles due to non-reciprocal interactions | Ouazan-Reboul et al. (2023), ARXIV-2303.09832. For M chemotactic catalyst species in a closed cycle, where species m converts chemical m into chemical m+1, the linearised long-wavelength interaction matrix is circulant, so its eigenvalues are Re λ_ℓ = −(αρ0/D)(μ(p)−μ(s))[1−cos(2πℓ/M)] and Im λ_ℓ = (αρ0/D)(μ(s)+μ(p)) sin(2πℓ/M) (Eq. 5). The homogeneous state is unstable exactly when the species are self-attracting, μ(p) − μ(s) < 0 (Eq. 6). For even M the leading mode is real, with stoichiometry (1,−1,1,…), so same-parity species co-aggregate. For odd M the leading mode is a complex pair, and with chasing interactions this gives persistent “invasion–explosion” oscillations. The nonlinear phases were checked by Brownian dynamics at M = 5 and M = 6 only. | Active — read in full 2026-09-25 (NOTE-079); Worth reading as a clean, fully analytic example of how cyclic non-reciprocal coupling produces a circulant spectrum and an odd/even dichotomy. The origin-of-life framing is a proposal the paper does not test, and the authors concede in the peer-review file that the chemotactic mobilities of real prebiotic catalysts are unknown. |
| LIT-042 v2 | Shannon invariants: A scalable approach to information decomposition | Gutknecht et al. (2025), ARXIV-2504.15779. For any set of quantities Π(α) satisfying the PID consistency equation (A7), whatever the redundancy measure, two averages are fixed by Shannon quantities alone. They are the average degree of redundancy, r̄ = Σᵢ I(Xᵢ;Y)/I(X;Y) (Prop. 1), and the average degree of vulnerability, v̄ = Σⱼ I(Xⱼ;Y|X₋ⱼ)/I(X;Y) (Prop. 2). Two identities follow: RSI = (r̄ − 1)·I(X;Y) (Cor. 1), and a new “dual” index DRSI = I(X;Y) − Σⱼ I(Xⱼ;Y|X₋ⱼ) = (1 − v̄)·I(X;Y) (Prop. 4, Cor. 2). In small, stochastically quantised (8-level) networks analysed on their own training set, r̄ about the label rises with depth and v̄ falls with depth and training. In a face autoencoder, decoder layers are more redundant than size-matched encoder layers, and r̄ rises with bottleneck width. | Active — read in full 2026-09-25 (NOTE-045); the theory (§II–III, App. B) is short, correct and redundancy-measure-free. It gives the right reading of the old redundancy–synergy index and is worth reading for that. The “scalable” deep-learning half is a demonstration on tiny, quantised networks with information computed on the training set as the population. Read it as a proof of concept, not as evidence about realistic models. |
| LIT-046 v3 | The Computational Foundations of Collective Intelligence | Pilgrim et al. (2025), ARXIV-2509.07999. A conceptual framework, with no model, data or derivation. It sets out individual and collective computational resources in four dimensions: sensing ΣI_i, states S_c × ∏S_i, processes F_c + ΣF_i, and actions ∏A_i (Table 1). It then maps the collective’s surplus onto familiar mechanisms (aggregation with noise σ_i²/n, distributional beliefs P(H), memory persistence T_c, division of labour). Coordination and cooperation are given as the constraints that make the trade-off, and three animal case studies are retold in these terms. | Proposed — read in full 2026-09-25 (NOTE-055); a clear, well-referenced vocabulary for collective intelligence (Marr’s levels run bottom-up). Its central claim, that the known forms of collective intelligence are “aspects of a single unifying principle”, is asserted and illustrated, not derived. It would be settled by one case where the resource-and-constraint accounting yields a quantitative prediction that existing mechanism-specific models do not. |
| LIT-049 v2 | A coarse-graining account of individuality: how the emergence of individuals represents a summary of lower-level evolutionary processes | Bourrat (2023), DOI-10.1007/s10539-023-09917-x. Bourrat proposes that a partition of particles into collectives defines individuals when the “projected” prediction (coarse-grain at t1, then evolve the coarse-grained state) differs from the “truthful” one (evolve at the fine grain, then coarse-grain at t2) by δC = C_T − C_P < θ, across many traits (Eqs. 1–2). He argues that, because measurement and computation are finite, coarse-graining can be the only way to predict at all: in his example, 100 operations predict 10 entities for 10 timesteps or 2 collectives for 50. That indispensability is his whole case for the “quasi-ontological” status of collectives at Godfrey-Smith and Kerr’s fifth stage. Nothing is computed on any model. | Proposed — read in full 2026-09-25 (NOTE-064); a lucid philosophical statement of “individual = a coarse-graining worth its cost”. Its formal criterion is informal and, as written, degenerate: minimal δC picks the finest partition, and the cost term the argument depends on is never put into the criterion. It would be settled by a worked ETI model in which an explicit accuracy–cost objective is computed and picks out the collectives. |
| LIT-057 v2 | Effect of delay on the emergent stability patterns in generalized Lotka–Volterra ecological dynamics | Saeedian et al. (2021), ARXIV-2110.11914. The paper studies random delayed generalized Lotka–Volterra dynamics, ẋ_i = x_i(r_i + Σ_j b_ij x_j(t−τ)), with instantaneous interactions switched off (A = 0) in every delay result. A feasible, stable equilibrium loses stability by a Hopf bifurcation at τ_c = min over eig(J) of (1/|j|) arctan(Re j/Im j) (Eq. 14), where J = diag(−B⁻¹r)B, and this matches simulation (Fig. 5b; S = 100 is stable at τ = 12 and oscillates at τ = 18). In the oscillatory regime, at τ = 20 and 22 for S ≲ 70, community-level CV falls with S while mean species-level CV rises (Fig. 6). The paper reads this as a positive diversity–stability relation but tests it against no averaging null. | Proposed — read in full 2026-09-25 (NOTE-061); A modest, partly numerical preprint whose critical-delay formula is the standard linear delay result applied to a random community matrix. Its diversity–stability claim would be settled by comparing CV_c(S) against the √S averaging expected from weakly correlated oscillators (the “statistical inevitability” null of Tilman et al. 1998, which the paper cites as ref. 40), and by resolving whether the “divergent” phase is numerical or real. |
| LIT-070 v2 | Dynamics of collectives with opinionated agents: The case of scrambling connectivity | Somarakis et al. (2016), DOI-10.1109/ECC.2016.7810493. For networks of agents that each have their own independently evolving opinion dynamics and communicate cooperatively with neighbours, non-negative matrix theory gives sufficient conditions for stability and convergence to a common synchronized opinion, for both identical and non-identical agents. The “scrambling” connectivity condition is presumably what the title names; I have not verified this from the full text. | Unavailable — seeded 2026-09-25 from the abstract; on 2026-10-14 a search for a lawful full text reached none, so it is not read and no NOTE is filed. OpenAlex lists it as closed with no repository copy, and Unpaywall reports no open location. arXiv has no preprint under the authors’ names or the title. Crossref’s only full-text link is IEEE’s similarity-checking PDF, not a reading copy. A web search shows a record of the paper on John Baras’s group site at the University of Maryland (baras.isr.umd.edu/node/866), described as carrying a full-text link, but the site could not be reached: HTTPS failed with a certificate that does not name the host, HTTP returned 404, a fetch returned 503, and the Internet Archive refused the lookup (429). So an author-posted copy may exist, and this failed on access, not availability. It stays Unavailable until a copy is supplied. |
| LIT-075 v3 | Comparing cooperative geometric puzzle solving in ants versus humans | Dreyer et al. (2024), DOI-10.1073/pnas.2414274121. On one T-shaped piano-movers puzzle, the CDF of solved attempts against normalized path length shows large ant groups (≈80 carriers, n=28) well ahead of small groups (≈7, n=48) and a 3-run composite single-ant series. An agent-based model with group-size-independent rules reproduces the difference. Human groups of 6–26 barred from talking or gesturing needed more attempted state transitions than single people (−32% relative to the individuals’ median; n=48 groups vs 61 individuals), and talking groups were only slightly better (+7%). No significance test is reported anywhere: “significantly” rests on overlapping-or-not ±1 SE bands. | Active — read in full 2026-09-25 (NOTE-040); worth reading, and unusually well instrumented: force meters on every human handle, a calibrated physics model for the ants, and a like-for-like puzzle across species and scales. Its mechanism stories for the humans (majority vote with greediness P=0.2; “follow a random leader”; groupthink) are fitted or observed informally rather than tested, and should be read as hypotheses. |
| LIT-080 v2 | Understanding brain states across spacetime informed by whole-brain modelling | Vohryzek et al. (2022), DOI-10.1098/rsta.2021.0247. This is a narrative review with no new data, model or quantitative synthesis. It argues that healthy waking brain dynamics sit in a metastable regime near criticality, which whole-brain models (connectome-coupled Hopf oscillators, weakly coupled, at the edge of instability) reproduce. On its “activity landscape” picture, depression deepens particular attractors and psychedelics flatten the landscape. The depression side rests on three cited fMRI studies, one of them in remitted patients, and the review itself says “further studies will be required”. | Active — read in full 2026-09-25 (NOTE-054); a short, readable map of the Deco/Kringelbach whole-brain-modelling programme and its psychedelic/depression framing, worth reading as an entry point. It is a perspective, not evidence: the landscape picture is a hypothesis resting on small primary studies that it neither sizes nor weighs. |
| LIT-091 v2 | Networks beyond pairwise interactions: Structure and dynamics | Battiston et al. (2020), ARXIV-2006.01764. The review sets out the representation hierarchy for group interactions (graph and clique complex, bipartite graph, motifs, simplicial complex, hypergraph) with their operators (incidence, adjacency tensor, boundary B_k, Hodge Laplacian L_k = B_kᵀB_k + B_{k+1}B_{k+1}ᵀ with ker L_k ≅ H_k). It surveys the random models and the dynamics built on them. Its own §V makes the key qualification: linear diffusion with three-body terms “can always be reduced to” a weighted pairwise Laplacian (Eq. 35). A random walk with edge-independent vertex weights is equivalent to one on a weighted projected graph (Chitra–Raphael). Qualitatively new node-level behaviour needs nonlinear group coupling or edge-dependent weights. With those, it reports explosive or abrupt transitions and bistability: Kuramoto with triadic coupling, simplicial SIS with a discontinuous transition, and higher-order ecological models that stabilise coexistence. | Active — read in full 2026-09-25 (NOTE-057); the standard entry point to higher-order network science, worth reading for §II–§III (definitions and operators) and as a map of the 2020 literature. Read it for definitions and pointers, not as evidence: the dynamical claims are one-paper summaries, several formulas carry typos (listed below), and the conclusion’s “profoundly change” list includes linear cases that §V itself shows reduce to pairwise. |
| LIT-141 v3 | Emergence: from physics to biology, sociology, and computer science | McKenzie (2025), ARXIV-2508.08548. Sole-authored survey by a condensed-matter physicist. It takes novelty (a property the parts lack) as the defining mark of emergence and sets it against twelve other characteristics in §2. The six “objective” ones are discontinuities, order, modification of parts, universality, diversity and mesoscale modularity. The six “subjective” ones are self-organisation, unpredictability, irreducibility, contextuality/downward causation, complexity and intra-stratum closure. Case studies from the Ising model to Schelling segregation and LLMs show that each can come apart from novelty: novelty without discontinuity (Kondo, Fermi liquids, spin ice), without unpredictability (BKT, spin ice), and with reduction (Butterfield). §22 sides with weak emergence and argues that strong-emergence claims from molecular structure are weak. | Active — read in full 2026-09-26 (NOTE-124); worth reading as a hub reference and example catalogue on emergence from physics outward, with unusually concrete case studies and a sceptical physicist’s §15 on molecular structure. It is a survey and a position, not a proof. Its definitional framework is stipulated and its logical relations between characteristics are left open by its own account (§24). |
| LIT-150 v3 | What is emergence, after all? | Rizi (2025), ARXIV-2507.04951. A perspective, not an argument with results. Rizi proposes that emergence is present when a many-to-one coarse-graining F (Eq. 1, N′ < N) keeps the macro description predictive after most micro detail is discarded. He says the onset of emergence is located by order parameters, diverging susceptibility and correlation length, and RG fixed points, and that dualities show macro behaviour is not dictated by micro “stuff”. Herd immunity on networks (percolation, the S–R interface density ρ_SR) is offered as a social case. The paper then asserts that science needs only weak emergence, and that invoking strong emergence “steps outside the scope of scientific method”. | Active — read in full 2026-09-26 (NOTE-153); worth reading as a compact, well-referenced statement of the physicist’s weak-emergence view and a reading list into it (Carroll & Parola, Hoel, Rosas, Witten, De Haro & Butterfield, Dennett). Its framework is stated, not developed: no distortion measure is given for F, and “predictive” is never quantified. |
| LIT-219 v2 | Patterns All the Way Up: Prolegomena to a Future Naturalized Metaphysics | Ladyman (2026), DOI-10.7551/mitpress/15550.003.0006. Ladyman restates the Ladyman–Ross metaphysics as fifteen theses drawn from scientific practice. The existence criterion is “to be is to be a real pattern”, a pattern that “indispensibly figures in projectible generalisations” (p. 2). Realism is realism about natural modal structure, which is “absolute” in formal mode but “domain and scale-dependent” in material mode (thesis 4). There is no single hierarchy of levels and no assumed fundamental level (theses 10–11, fn. 9). Ontology is effective and scale-relative (thesis 12). Scientific real patterns are lossy compressions, unlike the Game of Life’s; the ideal gas laws use 3 degrees of freedom for ~10²³ (thesis 14). He quotes ETMG’s Principle of Naturalistic Closure verbatim and calls it “problematic” because it refers to fundamental physics (p. 8). | Active — read in full 2026-09-26 (NOTE-191); Worth reading as the most recent and most compact statement of rainforest realism by one of its two authors, and the one that explicitly revises Every Thing Must Go. It weakens the PNC, denies that “relational structure is fundamental” was meant as fundamentalism, and recasts real patterns modally and statistically as well as information-theoretically. Its fifteen theses are asserted and illustrated, not argued. It presupposes the book’s definitions, which it does not restate. |
| LIT-399 | Plain Talk About Neurodevelopmental Epistemology | Minsky (1977), MIT AI Memo 430, also IJCAI-77 pp. 1083–1092. Takes the mind as an organised society of simple “agents”, a theory credited to joint work with Papert, and asks how such agents could communicate without language. The proposal: no messages at all, since each argument lives at a fixed location on shared channels (“c-lines”) that the agents themselves constitute as short-term memory. A specificity gradient confines low-level agents to local sub-societies, and a case-shift moves an object of attention into a better-described slot. The paper conjectures that these internal cases precede, and shape, the cases of natural language. Openly speculative. | Active — read in full 2026-10-01 (NOTE-344); worth reading as the earliest of Minsky’s own papers in this record to state the society-of-agents view, then called “The Society of Minds” (Note 1), and as its first worked mechanism: agents communicate by fixed-location channels (“c-lines”) instead of messages. It is openly speculative (“a model of scientific irresponsibility”, p. 1085), with no data and no program. Read it for the communication scheme, the “specificity gradient”, the case-shift mechanism and the conjecture that cognitive cases precede and shape linguistic ones; do not read it as evidence for any of them. That it is the first published statement of the idea is the usual attribution, and this reading could not confirm it (see NOTE-344). |
| LIT-402 | K-Lines: A Theory of Memory | Minsky (1979/1980), MIT AI Memo 516; Cognitive Science 4(2):117–133. “The function of a memory is to re-create a state of mind.” On a memorable event a K-node is made, and its K-line attaches to the agents then active. Reactivated, it re-imposes that partial mental state, but by the level-band principle only on an intermediate band of levels, so the present is seen as an instance of the past without hallucinating the old answer. K-lines attach mainly to earlier K-nodes, forming a K-pyramid against the perceptual P-pyramid, and cross-exclusion lets conflicting details cancel into abstraction. Read from the memo; a programme statement, with no simulation. | Active — read in full 2026-10-01 from the MIT AI Memo 516 text (NOTE-352), not the Cognitive Science version, which was not reachable; worth reading as the society-of-mind programme’s theory of memory and the first place Minsky’s own text uses the phrase “Society of Mind”. The idea to take away is that a memory re-creates a partial mental state rather than retrieving a stored description, and its level-band principle: re-enact only an intermediate band of the original state, so the present problem is seen as an instance of the remembered one. The second half is, by its author’s account, not constructive (“from this point, the reader can assume that difficulties in understanding are my fault”), and nothing is simulated or measured. |
| LIT-414 | High-level perception, representation, and analogy: A critique of artificial intelligence methodology | Chalmers, French & Hofstadter (1992), DOI-10.1080/09528139208953747. Traditional AI hands its programs representations built by people who already know the answer, so models like BACON (Kepler’s third law) and the Structure-Mapping Engine (atom and solar system) skip the hard part, high-level perception: deciding what is relevant and how to organise it. Nor can the gap be filled later by a separate “representation module”, because analogy shapes perception and the task decides which representation is right. Copycat, in a microdomain of letter strings, is offered as an architecture that builds representations and mappings together. | Active — read in full 2026-10-01 (NOTE-359), from the authors’ preprint (CRCC Technical Report 49, March 1991) that Chalmers posts; the published text was not seen. Worth reading as the clearest short statement of the Fluid Analogies Research Group’s case against hand-coded representations, and as the most accessible description of Copycat. It is an argument, not a result: its two arguments against a separate “representation module” are informal and good, its case studies (BACON, SME) are fair as far as they go, and the evidence it offers for Copycat is a description of the architecture and one worked problem, with nothing measured in the paper itself. |
| LIT-418 v2 | Society of mind: A response to four reviews | Minsky (1991), Artificial Intelligence 48(3):371–396. Minsky’s reply, closing a review symposium, to four reviews of The Society of Mind in the same issue: by Michael G. Dyer, Matthew Ginsberg, George N. Reeke and Stephen W. Smoliar. Unread: the article is closed access and no copy was reached. Singh (2003) quotes it on why Minsky kept the words “agent” and “agency”, and draws on it for a mechanism by which agents with different representations could communicate. | Unavailable — seeded 2026-10-01 from the Crossref and Elsevier metadata of the article and of the issue it closes, not read: the article is closed access (Unpaywall and OpenAlex find no open copy, Semantic Scholar marks it closed, ScienceDirect refused the request), and no author copy was found. It stays Unavailable until a copy is supplied. The four reviews it answers are listed below from the issue’s contents, and are not filed. |
| LIT-427 | Pandemonium: A Paradigm for Learning | Selfridge (1959), Mechanisation of Thought Processes Vol. I (HMSO), pp. 513–526 plus discussion to p. 531. Pattern recognition by a “pandemonium”: data demons hold the input, computational subdemons compute features, each cognitive demon “shrieks” a weighted sum of them, and a decision demon picks the loudest. The system learns by hill-climbing on the weights and by “natural selection” on the subdemons, culling those of low worth and breeding new ones by mutation and by “conjugation” of pairs. It is applied to telling dots from dashes in hand-keyed Morse. In the discussion McCarthy proposes reading the demons’ private computation as unconscious and their public shouting as conscious thought. | Active — read in full 2026-10-02 (NOTE-360); worth reading as the first published architecture of a mind-like process built from many quasi-independent “demons”, each doing one narrow job, with no part holding the whole’s competence. That is the decomposition template that Minsky’s agents inherit. Cite it as an engineering proposal with a preliminary result reported only in discussion, not as a theory of mind. Its one remark on consciousness is McCarthy’s, in the discussion, and it is an aside. |
| LIT-428 v2 | Fluid Concepts and Creative Analogies: Computer Models of the Fundamental Mechanisms of Thought | Hofstadter & the Fluid Analogies Research Group (1995), Basic Books. The group’s programme gathered in one volume: models of perception-driven analogy-making in microdomains (Seek-Whence, Jumbo, Numbo, Copycat, Tabletop, Letter Spirit, and the proposed Metacat), each chapter with a preface by Hofstadter, plus a critique of AI methodology and of how AI research is evaluated. Its contemporary reviewer in AI Magazine names two ideas under it: cognition as high-level perception, and the parallel terraced scan, by which coherent structure emerges from many probabilistic codelets without top-level control. Unread: registered from the description, the catalogue and that review. | Unavailable — registered 2026-10-01 from the publisher’s description, the Library of Congress catalogue record and a catalogue contents note, not read: no lawful full text could be reached. The Internet Archive scan is lending-only, HathiTrust is search-only, and no publisher or author copy of the book is posted. It stays Unavailable until a copy is supplied. |
| LIT-429 v2 | The Society of Mind | Minsky (1986), Simon & Schuster. The book-length statement of the Society of Mind programme, begun with Seymour Papert in the early 1970s. A mind is a society of many small agents, each mindless by itself, and intelligence comes from their diversity and organisation, not from one principle. The publisher presents it as a puzzle of self-contained one-page pieces that assemble into a theory. Unread: no lawful full text was reachable, so it is registered from the publisher’s description and the contents list. | Unavailable — seeded 2026-10-01 from the publisher’s description, the Library of Congress catalogue record and the Google Books contents list, not read: no lawful full text could be reached. The Internet Archive copies are lending-only, HathiTrust is search-only, and Minsky’s web page did not post the book. It stays Unavailable until a copy is supplied. Its programme is read here at second hand through Singh’s exposition (LIT-444) and at first hand through the draft of its sequel (LIT-432). |
| LIT-435 v2 | The emergence of understanding in a computer model of concepts and analogy-making | Mitchell & Hofstadter (1990), DOI-10.1016/0167-2789(90)90086-5. The Physica D statement of Copycat, the Fluid Analogies Research Group’s model of analogy-making in a microworld of letter strings, in which understanding is meant to emerge from many small, parallel, nondeterministic agents (codelets) interacting with a network of concepts (the Slipnet) under a computational temperature. Unread: what is said here comes from its co-authored companion paper LIT-414, which cites it for the details of Copycat’s “xyz” run. | Unavailable — seeded 2026-10-01 from Crossref, the Elsevier metadata API and the account of Copycat in Chalmers, French & Hofstadter (LIT-414, read in full), not read: the article is closed access at Elsevier, ScienceDirect returned 403, and no author or repository copy was found. No NOTE is filed. |
| LIT-436 | Intelligence without representation | Brooks (1991), Artificial Intelligence 47:139–159, written in 1987. Argues that AI should be built incrementally from complete autonomous “Creatures” tested in the real world, and that the system should be decomposed by activity into parallel layers, each connecting sensing to action, not by function into perception, a central reasoner and action. His robots have no central representation and no central control: each layer is a fixed network of simple finite-state machines, and a higher layer subsumes a lower one by suppressing or inhibiting its wires. Coherent behaviour emerges, “in the eye of an observer”, from competing behaviours. Hypothesis: representation is the wrong unit of abstraction for the bulk of intelligence. | Active — read in full 2026-10-02 (NOTE-351) from the copy Brooks posts; worth reading as the decomposition side built and run: a robot whose purposive behaviour comes from parallel layers of simple finite-state machines with no central representation and no central control, which Brooks likens to Minsky’s account of human behaviour. The coherence of the whole, he says, exists “in the eye of an observer”. The evidence is three layers on one physical robot, described rather than measured. It makes no claim about minds or experience and disclaims interest in the philosophy. |
| LIT-439 | The Computational Boundary of a “Self”: Developmental Bioelectricity Drives Multicellularity and Scale-Free Cognition | Levin (2019), Frontiers in Psychology 10:2688. Proposes “Scale-Free Cognition”: an Individual or Self is the set of parts that pursue a goal together, bounded by the farthest events in space and time it can measure and try to change (its “cognitive light cone”). Selves scale up from homeostatic loops through memory and anticipation, and cells merge into larger Selves by sharing bioelectric state through gap junctions; cancer is the boundary shrinking back to one cell. Because every level that pursues its own goal is a Self, most living systems hold many nested, coexisting Selves, “not one, as implied by Integrated Information Theory”. Levin’s “Self” is a goal-pursuing collective, an agent and an individual in this record’s terms; the essay gives no account of a self as subject. A hypothesis essay: no model and no new data. | Active — read in full 2026-10-02 (NOTE-341); worth reading as the composition-side statement that agency is nested by default: a Self is whatever set of parts pursues a goal together, so cells, organs, organisms and swarms are Selves at once, each bounded by its “cognitive light cone”. It is a hypothesis-and-theory essay with no model, no measurement procedure for the light cone and no data of its own. Its one sentence against IIT’s single-Self picture is asserted in a bracket, not argued, and its consciousness claims are confined to a closing speculation. |
| LIT-444 | Examining the Society of Mind | Singh (2003), Computing and Informatics 22(6):521–543. A sympathetic exposition of Minsky’s Society of Mind by his student. It traces the theory’s history: Minsky and Papert’s 1970s copy-demo robot, the procedure-bearing frames of 1974, the abandoned 1976 book drafts, and the 1977 and 1980 papers. It catalogues the mechanisms and how agents communicate without shared symbols. It finds resemblances in Bayes nets, case-based reasoning, blackboards, Cyc, Soar and multiagent systems, none of which it calls a Society of Mind. Its verdict is that the theory has never been implemented. | Active — read in full 2026-10-01 (NOTE-339); worth reading as the shortest reliable map of The Society of Mind (LIT-429), written by the student who worked with Minsky on its sequel. It gives the theory’s history from the 1970s memos, a catalogue of its mechanisms (agents and agencies, K-lines, nemes and nomes, frames and transframes, difference-engines, censors, A- and B-brains, ways agents communicate and grow), and a survey of later AI it resembles. It is an exposition, not a test: it reports no implementation and quotes the theory more than it argues for it. Its history leans on unpublished 1976 drafts that only the author saw. |
| LIT-457 | Fluid Concepts and Creative Analogies: A Review | Burns (1995), DOI-10.1609/aimag.v16i3.1155. A review of Hofstadter and FARG’s Fluid Concepts and Creative Analogies (LIT-428). It finds two ideas under the book: cognition modelled by a parallel terraced scan of probabilistic codelets, and cognition as high-level perception. It asks why the work has had little impact on AI, and answers: microdomains, and critiques of rival programs that rest on analogy and intuition, applied to others but not to Copycat. It recommends the book. | Active — read in full 2026-10-02 (NOTE-375); worth reading as the one contemporary account the record holds of what is in LIT-428, which is unread, and as a short, fair statement of the two standing complaints against the Fluid Analogies programme: every model lives in a microdomain, and rival programs are dismissed by analogy and intuition while the same tests are waved off for Copycat. It is a three-page book review. Its account of the parallel terraced scan is clear and checkable; its verdict is the reviewer’s opinion, argued with one worked example (symbol grounding in SME versus Copycat). |
| LIT-498 | The Evolution of Cooperation | Axelrod & Hamilton (1981), DOI-10.1126/science.7466396. In an iterated Prisoner’s Dilemma with probability w of meeting again, TIT FOR TAT won two computer tournaments (14 and 62 entries) and an ecological simulation, and no strategy can do better against it when w ≥ max((T−R)/(T−P), (T−R)/(R−S)). ALL D is always stable; reciprocity can still enter through kinship or a cluster, after which a nice stable strategy resists clusters. Applications range from cleaner fish to disease and nondisjunction. | Active — read in full 2026-10-02 (NOTE-411); worth reading as the formal statement of how reciprocity can start, spread and hold: tit-for-tat is robust in Axelrod’s tournaments, cannot be bettered by any mutant when the continuation probability w is high enough, and can enter an all-defect population through kinship or clustering. “Evolutionarily stable” is stronger than what is proved: the proof shows no strategy does better than TIT FOR TAT, and always-cooperate does as well, which Boyd & Lorberbaum (1987) later turned into a proof that no pure strategy is evolutionarily stable in the repeated game. It grounds the exchange domain of morality-as-cooperation; it is not about morality. |
| LIT-501 | Five Rules for the Evolution of Cooperation | Nowak (2006), DOI-10.1126/science.1133755. Five mechanisms let natural selection favour cooperators who pay c to give b: kin selection (r > c/b), direct reciprocity (w > c/b), indirect reciprocity (q > c/b), network reciprocity (b/c > k) and group selection (b/c > 1 + n/m). Each is cast as a 2×2 game, from which conditions for cooperators to be evolutionarily stable, risk-dominant or advantageous follow. Punishment is said not to be a mechanism. Cooperation is proposed as a third principle of evolution. | Active — read in full 2026-10-02 (NOTE-409), main text only; the online supplement with the derivations was not read. Worth reading as the standard short map of mechanisms for the evolution of cooperation (kin selection, direct, indirect and network reciprocity, group selection), each reduced to a benefit-to-cost threshold from a 2×2 game. Every mechanism is modelled with the donation game, so it covers altruism only: mutualism, coordination and conflict resolution, four of morality-as-cooperation’s seven domains, are outside it. Its one sentence on morality credits indirect reciprocity with “the evolution of morality”, citing Alexander (1987). |
| LIT-506 v2 | The Genetical Evolution of Social Behaviour. II | Hamilton (1964), J. Theor. Biol. 7:17–52. Part I’s model is generalized, “unrigorously”, into two principles: an animal values a neighbour’s fitness against its own by their relationship, and its social discriminations evolve to make relationship more determinate. They are applied to alarm calls, clones and colonies, the haplodiploid hypothesis for hymenopteran sociality, multiple mating, fights between relatives, sibling competition and seed provisioning. Evidence is anecdotal, and the author reports where it runs against him. | Active — read in full 2026-10-02 (NOTE-410); worth reading as the place inclusive fitness is turned into two general principles (valuing neighbours by relatedness; evolving discrimination that makes relatedness determinate) and tried on warning behaviour, social insects, clones, fights and parental care. The principles are offered as an “unrigorous” generalization of Part I, and the evidence is anecdotal and, by the author’s account, partly contrary. Its §6 on fights is the one place in Hamilton’s pair that touches contests: relatives should fight less, a kin-weighted version of the restraint Maynard Smith and Price derived without kinship. |
| LIT-515 | Statistical physics of self-replication | England (2012; J. Chem. Phys. 2013), arXiv:1209.1179. For a system in a heat bath obeying detailed balance, a transition between coarse-grained ensembles I → II obeys β⟨ΔQ⟩ + ln π(II→I) + ΔS_int ≥ 0 (Eq. 6), a second law stated for macrostates. Applied to self-replication, the reverse probability is small when the copy is durable and made fast, so the heat released per copy is bounded below by about 2n ln(n τ_decay/τ_div) − ΔS_int (Eq. 8). The author’s estimates put E. coli within a factor of three of this bound and a self-replicating RNA near it. The “self” in self-replication is an observer’s classification of microstates, not a physical given. | Active — read in full 2026-10-02 (NOTE-419), from arXiv v1, the only arXiv version; the published J. Chem. Phys. text was not reached. Worth reading as the founding paper of the “dissipation-driven” programme and as a clean worked use of a macrostate fluctuation relation: the heat a replicator must release is bounded below by how fast it copies and how durable the copy is, not by the copying itself. The general bound (Eq. 6) is a coarse-grained second law and is sound; the numbers for E. coli and RNA rest on an argued, not derived, upper bound on the reverse probability (Eq. 7). It draws no line between living and non-living replicators, and says so: “self” is a classification an observer supplies. |
| LIT-516 | Time, Structure and Fluctuations | Prigogine (1977), Nobel Lecture, reprinted in Science 201:777 (1978). Near equilibrium the second-order excess entropy δ²S is a Lyapounov function, so fluctuations die out, and in the “strictly” linear regime the steady state minimizes entropy production. Far from equilibrium the sign of the excess entropy production ΣδJδX is no longer fixed. Given autocatalytic steps (necessary, not sufficient) the thermodynamic branch can go unstable, and fluctuations are amplified into “dissipative structures”: Bénard convection, the Brusselator’s limit cycle and “Turing bifurcation”. A closing programme derives irreversibility from a non-unitary transformation of the Liouville dynamics. | Active — read in full 2026-10-02 (NOTE-424); worth reading as Prigogine’s own short statement of the dissipative-structure programme, and as the place where its scope limits are stated in his words. A dissipative structure is a state beyond an instability of the “thermodynamic branch”, “a giant fluctuation stabilized by exchanges of energy with the outside world”. The minimum-entropy-production theorem is valid only in the “strictly” linear regime with constant phenomenological coefficients. Far from equilibrium the only general criterion offered is a sufficient one for stability (non-negative excess entropy production). Its §§6–7 programme of a non-unitary “entropy operator” is a sketch whose demonstrated link to macroscopic thermodynamics is, by its own account, “at least in the linear region”. |
| LIT-518 | Statistical Physics of Adaptation | Perunov, Marsland & England (2014; Phys. Rev. X 2016), arXiv:1412.1875. Starting from a fluctuation relation between coarse-grained macrostates, the paper writes the log-odds of two outcomes of a driven system as an internal-entropy term, a reversal-probability term and Ψ − Φ, the mean heat minus a fluctuation correction (Eq. 8). Holding the first two fixed, the more likely outcome is the one whose formation absorbed and dissipated work from the drive more reliably. It calls such outcomes “adapted” and argues the tendency needs no self-replication. Two single-particle hopping models illustrate the dissipation and fluctuation terms (Eqs. 10–13); the many-body case is a plausibility argument. | Active — read in full 2026-10-02 (NOTE-416), from arXiv v1, the only arXiv version; the published Physical Review X text was not reached. Worth reading as the origin of “dissipative adaptation”: the claim that driven matter tends towards states whose formation absorbed and dissipated work reliably, with no replication needed. Read it as a heuristic argument with two toy models, not a theorem. Its exact content is a rearranged macrostate fluctuation relation; the step to “adaptation” holds two terms fixed that it does not show can be held fixed in a many-body system, and the simulation it reports was not shown. It deliberately erases the line between living and non-living organization. |
| LIT-519 | Nonequilibrium thermodynamics and maximum entropy production in the Earth system | Kleidon (2009), DOI-10.1007/s00114-009-0509-x. A review of MEP in the Earth system. MEP is the proposed principle that a system with enough degrees of freedom adopts the steady state of maximum entropy production. It selects among steady states, where Prigogine’s principle only describes relaxation toward one. Box models show the flux–force trade-off that gives an MEP state. The review estimates the Earth’s entropy budget, which is dominated by absorption of sunlight. It surveys MEP fits for atmosphere, ocean, mantle, hydrology and biota, and proposes that life drives the planet toward MEP, a thermodynamic reading of Gaia. The author grants that MEP is not established. | Active — read in full 2026-10-02 (NOTE-423); worth reading as the clearest statement of the maximum-entropy-production (MEP) programme in Earth-system science by its main advocate: what MEP claims, how it differs from Prigogine’s minimum principle (minimum entropy production describes relaxation toward a steady state; MEP selects among possible steady states), an order-of-magnitude entropy budget of the Earth, a survey of climate, ocean, mantle and biotic MEP applications, and the extension to life and Gaia. Read it as advocacy that is candid about its footing: the author calls MEP “proposed” and says “no one would argue that MEP is well established”. Chosen over the Kleidon–Lorenz 2005 book, which has no lawful open text. |
| LIT-520 v2 | Maximum entropy production principle in physics, chemistry and biology | Martyushev & Seleznev (2006), DOI-10.1016/j.physrep.2005.12.001. A 45-page Physics Reports review of the maximum entropy production principle (MEPP) across physics, chemistry and biology. Kleidon (2009) cites it as the review of MEP’s physical foundation. Semantic Scholar’s machine-generated summary says it analyses the principle’s thermodynamic and statistical basis, including its relation to the second law and to Prigogine’s principle. Unread: no text or abstract reached. | Unavailable — seeded 2026-10-02 from Crossref metadata and citing works, not read: no lawful full text or publisher abstract could be reached (Physics Reports, closed; Semantic Scholar and OpenAlex list no open copy, and the abstract is elided by the publisher). Filed because it is the main survey of the maximum-entropy-production principle and of its relation to Prigogine’s minimum principle; it stays Unavailable until a copy is supplied. |
| LIT-521 | Information theory explanation of the fluctuation theorem, maximum entropy production and self-organized criticality in non-equilibrium stationary states | Dewar (2003), DOI-10.1088/0305-4470/36/3/303. It applies Jaynes’s maximum-entropy inference to the microscopic paths of an open system in a stationary state. Under fixed initial densities and boundary fluxes plus local conservation, the path distribution is p_Γ ∝ exp(A_Γ), with A_Γ carrying τσ_Γ/2k_B (Eq. 14). A fluctuation theorem and ⟨σ⟩ ≥ 0 follow (Eqs. 18–21). Then, in a mean-field approximation and assuming the number of paths increases with irreversible action, maximizing path entropy over the remaining multipliers is maximizing mean entropy production (MaxEP, Eq. 24). A Landau–Ginzburg argument claims self-organized criticality as slow driving goes to zero. | Active — read in full 2026-10-02 (NOTE-426); worth reading as the founding attempt to derive the maximum-entropy-production principle (MaxEP) from Jaynes’s maximum-entropy inference over microscopic paths, and as the source most later MEP work, Kleidon’s included, cites for MEP’s theoretical foundation. Read it as a programme, not a proof. The path distribution p_Γ ∝ exp(A_Γ) and its fluctuation theorem follow from the stated constraints. The MaxEP step needs a mean-field approximation and an assumption that the number of paths grows with their irreversible action, which is stated, not argued. The self-organized-criticality corollary is a mean-field artefact by Grinstein and Linsker’s analysis (LIT-525), which this reading confirms. |
| LIT-524 v2 | Self-Organization in Nonequilibrium Systems: From Dissipative Structures to Order through Fluctuations | Nicolis & Prigogine (1977), Wiley-Interscience. The Brussels school’s monograph on self-organization far from equilibrium, from the thermodynamics and bifurcation theory of dissipative structures to their stochastic theory (“order through fluctuations”). The Nobel lecture cites its ch. VII for the Brusselator and the book for its catalogue of chemical and biological examples. Unread: filed from catalogue records only. | Unavailable — filed 2026-10-02 from library catalogue records; no lawful full text was reachable (the book is in copyright, the Internet Archive scan is a lending-only copy, HathiTrust is search-only, and no publisher description or table of contents was found), so it is not read and no NOTE is filed. It is the Brussels school’s book-length treatment of dissipative structures and “order through fluctuations”, and the source the Nobel lecture (LIT-516) gives for the Brusselator; what it contains beyond that is not recorded here. |
| LIT-525 | Comments on a derivation and application of the ‘maximum entropy production’ principle | Grinstein & Linsker (2007), DOI-10.1088/1751-8113/40/31/N01. A Comment with two points. (1) Dewar’s 2005 derivation of MaxEP needs a quadratic approximation to p(f) near f = F to hold for all f. With the fluctuation theorem, that forces A(F) to be constant, i.e. linear constitutive relations. So the “orthogonality condition” behind both maximum and minimum entropy production fails far from equilibrium, as an exact spin-chain model shows. (2) Dewar’s 2003 SOC result is an artefact. Keeping the quartic term gives a finite flux variance at F_ext = 0. | Active — read in full 2026-10-02 (NOTE-422); worth reading as the short, exact critique of Dewar’s information-theoretic derivation of maximum entropy production. It shows that the 2005 derivation’s key step holds only where the constitutive relations are linear, so MaxEP far from equilibrium is not established by it, and that the 2003 claim that MaxEP yields self-organized criticality is an artefact of a mean-field expansion. Read from the authors’ submitted manuscript (Zenodo); the version of record was not seen. Its first point is checked here only on its own worked example, since Dewar 2005 itself could not be read. |
| LIT-526 | Life as we know it | Friston (2013), J. R. Soc. Interface 10(86):20130475. Any ergodic random dynamical system whose states split into internal, sensory, active and external sets with a Markov blanket has internal and active states whose flow can be written as a gradient descent on a variational free energy of the blanket and internal states (Lemma 2.1, Eqs. 2.5–2.8). They therefore “appear” to do Bayesian inference about external states and to bound their own entropy. A simulated “primordial soup” of 128 coupled Lorenz subsystems forms a blanket-enclosed cluster whose internal states predict external motion (5 of 82 above a time-reversed null) and which disperses when blanket or internal states are lesioned. The paper says a candle flame cannot have a Markov blanket, and concedes that the universe holds countless blankets, conjecturing that minimum-entropy blankets mark life. | Active — read in full 2026-10-02 (NOTE-421), from the published text (the author’s posted PDF of the journal version and the PMC full text). Worth reading as the founding statement of the Markov-blanket formulation of the free energy principle applied to life, and as the one text in the record that names a candle flame and says it is not lifelike. Read it as a redescription, not a derivation: its “heuristic proof” shows that the flow of an ergodic system with a Markov blanket can be written as a gradient flow on a variational free energy, by choosing the variational density to equal the posterior. The free energy is variational, not thermodynamic; no heat or entropy production is computed. The simulation is one run, analysed with a blanket chosen by spectral clustering. |
| LIT-527 | Pattern formation outside of equilibrium | Cross & Hohenberg (1993), DOI-10.1103/RevModPhys.65.851. A 262-page review classifying non-equilibrium patterns by the linear instability of a uniform state: type I_s (finite wave-number, stationary: convection rolls, Turing patterns), III_o (uniform oscillation: the stirred BZ reaction) and I_o (travelling waves). Near threshold, universal amplitude equations describe them, and phase equations describe them further above it. It finds no general variational principle for non-equilibrium steady states, only perturbative ones near threshold. | Active — skimmed 2026-10-02 (NOTE-418), about 30 of 262 pages read closely; worth reading as the physicists’ standard account of pattern formation away from equilibrium, and as the sober counterweight to the dissipative-structure programme. It treats Rayleigh–Bénard convection, Turing patterns and the BZ reaction in one framework, classifying patterns by the linear instability of a uniform state and describing them near onset by universal amplitude equations. Its conclusion finds “no evidence for the existence of any global minimization principles controlling the structure, except as a perturbative statement near threshold”, and quotes Glansdorff and Prigogine conceding as much. |
| LIT-528 | Energy flow and the organization of life | Morowitz & Smith (2006 working paper; Complexity 2007). Life may be forced into existence by abiotic free-energy sources, as lightning and hurricanes are channels that relieve electric and thermal potentials. Core anabolism, the reductive citric-acid cycle and the cascade built on it, is read as a relaxation channel for geochemical redox and phosphate energy. Jaynes-style entropy maximization with current-dependent entropies (not entropy-production principles) is offered as the framework, and the emergence of life as a “collapse”, a phase transition of a metastable abiotic earth. Selection on metabolism comes before replication. No quantitative model is given; the authors say the claim is undemonstrated. | Active — read in full 2026-10-02 (NOTE-425), from the Santa Fe Institute working paper (2006-08-029, dated 7 August 2006), not the Complexity version of record. Filed in place of Morowitz’s 1968 book Energy Flow in Biology, which could not be read: every Internet Archive scan of it is lending-only. Worth reading as a short statement of the “life was inevitable” view by Morowitz and Smith: core metabolism, the reductive citric-acid cycle, is a channel geochemistry was forced to open to relieve free-energy stresses, as lightning relieves a charge separation. It is an essay. It says itself that the claim “has not been quantitatively demonstrated”, and its evidence is the structure of core metabolism read in that light. It puts life on a continuum with lightning and hurricanes and draws no principled line. |
| LIT-529 v2 | Incomplete Nature: How Mind Emerged from Matter | Deacon (2011), W. W. Norton. An account of how life, mind and purpose (“ententional” phenomena) emerged from physics, built on constraint and absence rather than on added stuff. Its contents run from absence, homunculi and teleonomy through emergence and constraint to a hierarchy of dynamics (homeodynamics, morphodynamics, teleodynamics), a minimal self-producing system (autogenesis), and then work, information, significance, evolution, self, sentience and consciousness. Unread: registered from the publisher’s description and the contents; the text was not reached. | Unavailable — registered 2026-10-02 from the publisher’s description and a library contents note, not read: no lawful full text could be reached. The Internet Archive scan of the Norton printing is lending-only, and no author-posted draft was found. The companion chapter the record already cites, Deacon & Cashman (2013), “Teleology versus mechanism in biology: beyond self-organization”, is identified below but was not reachable either and is not filed. |
| LIT-530 v2 | What Is Life? The Physical Aspect of the Living Cell | Schrödinger (1944), Cambridge University Press. Lectures given at Trinity College Dublin in February 1943, published as a short book for the lay reader. It asks how events inside a living organism can be accounted for by physics and chemistry. It treats the gene as an “aperiodic crystal” carrying a code-script, defended through the Delbrück model, and in chapter 6 says an organism keeps its order by drawing “order from order” and by feeding on negative entropy from its surroundings. Unread: registered from the publisher’s description and contents; the text itself was not reached. | Unavailable — registered 2026-10-02 from the publisher’s description, the Cambridge Core contents and chapter excerpts, and library catalogue records, not read: no lawful full text could be reached. The book is in copyright with Cambridge University Press. Every Internet Archive scan of a Cambridge or Macmillan printing is lending-only, and the freely downloadable PDFs that turn up (course sites, personal uploads, Internet Archive “opensource” uploads) are unauthorized copies of the Canto edition, so I did not open them. Chapter 6, the negative-entropy chapter, is unread beyond the publisher’s one-paragraph excerpt. |
| LIT-531 | Belousov-Zhabotinsky reaction | Zhabotinsky (2007), Scholarpedia 2(9):1435. BZ reactions are metal-ion-catalysed oxidations of organic reductants by bromate in acid. The core loop is autocatalytic oxidation of the catalyst via HBrO₂, switched off by bromide, which the oxidized catalyst regenerates from bromomalonic acid. Closed, stirred, it can run “up to several thousand” cycles; only in a continuous-flow reactor do oscillations continue indefinitely, and there bursting and chaos appear. Unstirred thin layers support target and spiral waves (Zaikin & Zhabotinsky 1970). The Oregonator is qualitatively right and quantitatively not. | Active — read in full 2026-10-02 (NOTE-414); worth reading as the short, authoritative account of the Belousov–Zhabotinsky reaction by the chemist who named half of it: discovery, the core mechanism (autocatalytic HBrO₂ inhibited by Br⁻), the Oregonator and its known defects, closed versus open-reactor dynamics, and target and spiral waves. Chosen over Zaikin & Zhabotinsky (1970) because it is openly readable and covers the 1970 waves paper; it is a short encyclopedia review with no new results. |
| LIT-532 v2 | Inadequacy of entropy and entropy derivatives in characterizing the steady state | Landauer (1975), DOI-10.1103/PhysRevA.12.636. Per its abstract: in a bistable system the kinetics of transitions between the two locally stable states can be changed without changing the behaviour near either state, so no quantity that characterises only the vicinity of the states can determine which is more probable. Separately, even a monostable linear circuit’s steady state need not be one of minimum entropy production. Unread: filed from the abstract. | Unavailable — seeded 2026-10-02 from its abstract and Crossref metadata, not read: no lawful full text could be reached (Physical Review A, closed; Semantic Scholar and OpenAlex list no open copy). Filed because it is the classic objection to entropy-based characterisations of nonequilibrium steady states, Prigogine’s minimum principle among them; it stays Unavailable until a copy is supplied. |
| LIT-533 | Life as a manifestation of the second law of thermodynamics | Schneider & Kay (1994), Math. Comput. Modelling 19(6–8):25–48. A “restated second law”: systems moved from equilibrium “utilize all avenues available to counter the applied gradients”. Bénard convection and a vortex draining a bottle are read as structures that destroy gradients faster. Life is “another means of dissipating the solar induced gradient” (living systems as “sophisticated mini-tornados, with a memory”), and ecosystems develop to degrade more incoming exergy. A stressed marsh shows smaller flows and fewer cycles; airborne thermal scans show mature forests cooler (degrading 90% of net solar radiation against a quarry’s 62%). The second law is “necessary but not sufficient” for life. | Active — read in full 2026-10-02 (NOTE-415), from the authors’ own formatted text (copyright line “James J. Kay and Eric Schneider, 1992”), not the journal’s typeset version. Worth reading as the canonical statement of the “gradient-dissipation” view of life: living systems and ecosystems are dissipative structures that develop so as to degrade the solar gradient more completely, and the second law is “a necessary but not sufficient cause for life”. Read the thermodynamics as a programme, not a derivation. The “restated second law” is offered as a corollary of Kestin’s stability result but not derived from it. The ecological evidence is one stressed-versus-control marsh pair and a few thermal-scanner and satellite comparisons, all correlational. It draws no line between living and non-living dissipative structures beyond “memory” (DNA). |
| LIT-534 v2 | Order Out of Chaos: Man’s New Dialogue with Nature | Prigogine & Stengers (1984), Bantam; based on their La nouvelle alliance. A book for general readers that sets the science of complexity and irreversibility against classical dynamics. By its contents: the rise and limits of Newtonian science and its philosophical reception (Diderot, Kant, Hegel, Bergson, Whitehead); thermodynamics from Carnot to Boltzmann’s order principle; linear and far-from-equilibrium thermodynamics, bifurcations and order through fluctuations; and the rediscovery of time in physics. Unread: filed from catalogue records only. | Unavailable — filed 2026-10-02 from library catalogue records and a partial contents note; no lawful full text was reachable (the book is in copyright, the Internet Archive scans of the Bantam and Flamingo printings are lending-only, HathiTrust is search-only), so it is not read and no NOTE is filed. It is the popular and philosophical statement of the programme whose technical core is the Nobel lecture (LIT-516); what it argues, beyond its contents, is not recorded here. |
| LIT-535 | The Chemical Basis of Morphogenesis | Turing (1952), DOI-10.1098/rstb.1952.0012. Chemicals (“morphogens”) that react and diffuse through tissue can turn a stable homogeneous state unstable, with random disturbances setting which pattern grows. On a ring of cells the linearized onset takes six forms. The most important is stationary waves of finite “chemical wave-length”, which (9.4a, b) allow for two morphogens only if they diffuse at different rates. A 20-cell example computed on the Manchester computer gives a three-lobed pattern. Hydra tentacles, whorled leaves, dappling and gastrulation are suggested applications, not tested ones. | Active — read in full 2026-10-02 (NOTE-427); worth reading as the founding paper of reaction–diffusion pattern formation and the origin of what the Brussels school later called the “Turing bifurcation”. A homogeneous, stable steady state of reacting and diffusing chemicals can be destabilized by diffusion itself and settle into a stationary pattern with an intrinsic “chemical wave-length”. The analysis is linear and near onset by design, every biological application is offered as suggestion, and the paper says outright that its patterns are “dynamic equilibria” fed by “a continual supply of free energy”, which places them among dissipative structures before the term existed. |
| LIT-536 v4 | Biological Autonomy: A Philosophical and Theoretical Enquiry | Moreno & Mossio (2015), Springer, History, Philosophy and Theory of the Life Sciences 12. The book argues that biology should revolve around autonomy, not only natural selection: organisms are organized systems that self-produce and self-maintain as integrated wholes, set their own goals and norms, and promote the conditions of their existence through interaction with their environment. Chapters treat constraints and organisational closure, emergence and inter-level causation, teleology and function, agency, evolution, organisms and levels of autonomy, and cognition. Only the Introduction is read (NOTE-1437): there the authors make closure of constraints the core of biological organisation, say it differs fundamentally from the self-organisation of dissipative structures, and announce that it grounds teleology, normativity and function; the chapters that argue this are unread. | Unfetched — registered 2026-10-02 from the publisher’s description and the chapter list. The book is not open access at Springer. Its only free copy, the authors’ HAL deposit (hal-01151449, hal.science/hal-01151449/document, CC BY-NC 4.0, deposited 13 May 2015), is not the whole book, as this note earlier said: it holds the front matter (Hooker’s Foreword and the contents), the Introduction (pp. xix–xxxiv), the references and the index, and no chapter. The Introduction was read in full on 2026-10-30 (NOTE-1437, Skimmed, because only the Introduction was read). For chapters 1–8 no fuller lawful copy was found: on 2026-10-30 OpenAlex listed the HAL deposit as the book’s only open copy, and the publisher’s chapters are paywalled. HAL also served its anti-bot page to a direct fetch on 2026-10-02 and again on 2026-10-30; the deposit was read from a copy retrieved earlier the same day. It stays Unfetched for the chapters. |
| LIT-537 v2 | Thermodynamic Theory of Structure, Stability and Fluctuations | Glansdorff & Prigogine (1971), Wiley-Interscience. The monograph of the Brussels thermodynamic stability theory. By the Nobel lecture’s citations, it treats local equilibrium (ch. II), the second-order excess entropy δ²S as a Lyapounov function near equilibrium (ch. V), and the excess-entropy-production criterion far from equilibrium, including convection (ch. VII). Unread: filed from catalogue records only. | Unavailable — filed 2026-10-02 from library catalogue records; no lawful full text was reachable (the book is in copyright, the Internet Archive scan is a lending-only copy, HathiTrust is search-only, and no publisher description or table of contents was found), so it is not read and no NOTE is filed. It is the monograph in which Glansdorff and Prigogine set out the thermodynamic stability theory that the Nobel lecture (LIT-516) summarizes; what it contains beyond what the lecture and Cross & Hohenberg cite from it is not recorded here. |
| LIT-539 | Explanatory Models for Psychiatric Illness | Kendler (2008), American Journal of Psychiatry 165(6):695–702. Psychiatry should explain by mechanisms, not laws. Psychiatric causes act at many levels, within and outside the person, and are non-aggregative and loop-ridden, as an alcohol-dependence sketch shows (gene–environment interaction, tolerance feedback, niche selection, aversive cultural transmission). So “hard reductionism” and “hard emergentism” both fail, but locally decomposable subsystems can still be studied and then reassembled. After Marr, biology will implement psychological functions, not replace them. | Active — read in full 2026-10-03 (NOTE-432), from the NIH author manuscript in PubMed Central; filed as the readable substitute for Kendler’s 2005 “Toward a Philosophical Structure for Psychiatry” (LIT-552), which has no lawful open copy. It opens by citing the 2005 paper for its premise that etiological models must be pluralistic, and develops two of the 2005 abstract’s propositions at length: piecemeal integration becomes “decomposition and reassembly” of multilevel mechanisms, and the mind–brain question becomes Marr-style implementation, in which “biology will implement but not replace psychology”. It does not restate the 2005 paper’s arguments against dualism and epiphenomenalism, so it stands in for the pluralism, not for the whole of the earlier paper. |
| LIT-547 | A Network Theory of Mental Disorders | Borsboom (2017), World Psychiatry 16(1):5–13. Mental disorders are not common causes of their symptoms but states of networks of symptoms that cause one another, through “myriads of biological, psychological and societal mechanisms”. Five principles; the dynamic one is hysteresis: a strongly connected network, once activated by an external trigger, can sustain itself after the trigger is gone. Disorder is an alternative stable state of a strongly connected network, mental health the stable state of a weakly connected one. Comorbidity follows from bridge symptoms. Treatments are symptom, external-field or network interventions. | Active — read in full 2026-10-03 (NOTE-435); worth reading as the short, citable statement of the network theory of mental disorders by its main author. Five principles: disorders are complex systems of interacting components, the components are the symptoms of the diagnostic manuals, the network comes from direct causal connections between symptoms, disorders are the tightly connected clusters, and disorders arise through hysteresis, so a strongly connected network can stay “stuck” after its trigger is gone. Mental health, disorder, resilience and vulnerability are redefined as stable states and dispositions of weakly or strongly connected networks. Its evidence is indirect and it says so: the theory is offered as an “organizing framework” and a deliberate simplification, and the strict symptom-component correspondence of principle 2 is its own flagged weak point. |
| LIT-566 | Defining Agency: Individuality, Normativity, Asymmetry, and Spatio-temporality in Action | Barandiaran, Di Paolo & Rohde (2009), Adaptive Behavior 17(5):367–386. Three conditions are jointly necessary and sufficient for minimal agency: the system defines its own individuality, it is the active source of modulations of its coupling with the environment (interactional asymmetry), and it regulates that coupling by norms it generates (normativity). Generatively, an agent is an open autonomous system (a precarious network of mutually enabling processes) that adaptively modulates its coupling so as to maintain some of its constituent processes. Minimal life satisfies this; life is sufficient for agency but not necessary. | Active — read in full 2026-10-03 (NOTE-458), from the authors’ own deposit of the accepted text. Worth reading as the standard organizational definition of minimal agency, and as the clearest statement that an agent is not the same thing as an individual. Individuality is one of three conditions, with interactional asymmetry and normativity; it is a precondition for the other two and is not sufficient for agency. The generative definition: an agent is an autonomous organization that adaptively regulates its coupling with its environment and contributes to sustaining itself as a consequence. The paper rejects statistical and energetic measures of asymmetry as sufficient, and says systems optimising an externally fixed function should not be treated as models of agency. |
| LIT-570 | An Organizational Account of Biological Functions | Mossio, Saborido & Moreno (2009), BJPS 60(4):813–841. A trait has a function iff it contributes to the maintenance of a self-maintaining organization, is produced and maintained under that organization’s constraints, and the organization is differentiated. Closure grounds teleology and normativity in the current system, unifying etiological and dispositional accounts. Flames, Bénard cells and hurricanes have closure but no functions, because each makes a single undifferentiated contribution to its own maintenance. | Active — read in full 2026-10-03 (NOTE-444), from the HAL deposit of the submitted version. Worth reading as the organizational account of function and as the place where the organizational school says plainly that a candle flame has closure. Functions are contributions to a differentiated self-maintaining organization by traits that organization produces and maintains. Closure alone grounds teleology and norms but is shared by flames, Bénard cells and hurricanes; organizational differentiation is what functions need. Reproduction is admitted to be a problem and left to a sketch. |
| LIT-571 | Participatory sense-making: An enactive approach to social cognition | De Jaegher & Di Paolo (2007), Phenomenology and the Cognitive Sciences 6(4):485–507. Coordination between coupled systems is cheap and common. When patterns of coordination and the course of an encounter shape each other, the interaction acquires its own operationally closed, precarious organization. Social interaction is then regulated coupling between autonomous agents that constitutes an autonomous relational organization without destroying the agents’ autonomy. Because sense-making is embodied in movement, interactors can coordinate their sense-making, along a spectrum from modulated individual sense-making to jointly created meaning. | Active — read in full 2026-10-03 (NOTE-456), from the published version posted on De Jaegher’s own site. Worth reading as the founding statement of participatory sense-making. A social interaction is defined as regulated coupling between autonomous agents that itself becomes an autonomous organization in the relational domain, without destroying the agents’ autonomy; coordinating sense-making in interaction can generate meanings neither individual had. The argument is conceptual, illustrated by everyday cases and by the perceptual-crossing experiments; nothing is measured in the paper. |
| LIT-578 v2 | Dynamic Patterns: The Self-Organization of Brain and Behavior | Kelso (1995), Dynamic Patterns: The Self-Organization of Brain and Behavior, MIT Press, xvii + 334 pp. The book-length statement of coordination dynamics. Unread: registered from catalogue records. What the record knows of its content comes from the works that cite it: the coordination potential of the HKB model (reproduced in Kelso 2021, Box 1), absolute versus relative coordination (De Jaegher & Di Paolo 2007, citing p. 98), a chapter on how HKB arose (ch. 3) and one on brain rhythms (ch. 8), per Kelso 2021. | Unavailable — registered 2026-10-03 as a seed, not read. No lawful full text was found: the book has no DOI, is not listed as open access, and MIT Press’s page refused an automated request. Under the owner’s rule for books it is supplanted by a shorter work by the same author, Kelso’s 2021 retrospective on the HKB model (LIT-601), which was read. It is filed because it is the citation others reach for when they mean coordination dynamics, relative coordination or metastability; De Jaegher & Di Paolo (LIT-571) and Raja et al. (LIT-598) both cite it. |
| LIT-582 | Biological organisation as closure of constraints | Montévil & Mossio (2015), J. Theor. Biol. 372:179–191. Two causal regimes act in organisms: processes (thermodynamic changes) and constraints, which act on processes while being conserved at the relevant time scale. Closure is mutual dependence among constraints: each is produced by a process another constraint constrains, and each helps produce another. Closure mixes slow and fast dependence, grounds functions, and is proposed as a boundary criterion. A volume-sweeping count of dependencies, the tendency to closure, separates symbionts that share an encompassing closure, and separated nested closures mark levels of organisation. | Active — read in full 2026-10-03 (NOTE-468), from the authors’ HAL deposit of the accepted text. Worth reading as the paper statement of the central claim of Biological Autonomy (LIT-536): biological organisation is closure of constraints. A constraint is defined by a symmetry: it acts on a process at a time scale at which it is itself conserved. Closure is a set of constraints each of which depends directly on another in the set and generates another, and cannot be split into two closed sets. The paper offers closure as a boundary criterion and gives a preliminary measure, the tendency to closure, for drawing boundaries between interacting organisms. It does not claim closure defines an organism. |
| LIT-588 v3 | A theoretical model of phase transitions in human hand movements | Haken, Kelso & Bunz (1985), Biological Cybernetics 51(5):347–356. Models the involuntary switch from anti-phase to in-phase finger or hand movement as movement frequency rises: relative phase φ is the order parameter, φ̇ = −∂V/∂φ with V = −a cos φ − b cos 2φ, both patterns are stable while |b| > |a|/4 and only in-phase below it, and hysteresis follows. The φ equation is derived from two self-sustained oscillators whose coupling must be nonlinear, with amplitude falling as frequency rises acting as the control. A theory paper: its data are Kelso’s earlier experiments, summarized. | Active — read 2026-10-30 (NOTE-1424) in full, from the publisher’s scan posted on Kelso’s lab page at Florida Atlantic University (https://ccs.fau.edu/hbblab/pdfs/1985_Haken_Kelso_Bunz_Biol_Cyb.pdf); worth reading as the paper that states the HKB model: relative phase as order parameter, the potential V = −a cos φ − b cos 2φ with anti-phase lost when b/a falls below 1/4, and its derivation from two nonlinearly coupled limit-cycle oscillators. Read it knowing that it is a theory paper with one numerical simulation and no new data: the switch and the hysteresis it models are summarized from Kelso’s earlier experiments, and critical fluctuations and critical slowing are named as future work, not reported. |
| LIT-598 | The Markov blanket trick: On the scope of the free energy principle and active inference | Raja, Valluri, Baggs, Chemero & Anderson (2021), Physics of Life Reviews 39:49–72. Restating the FEP’s derivation (Langevin dynamics, NESS, Helmholtz decomposition, Markov blanket, variational bound), the authors grant that it is true of things so defined. But blankets apply to every “thing”, not everything (the candle flame is excluded); the partition is placed by modelling convenience; relational properties (heading, affordances) and constitutive self-organization (a membrane the cell makes) fall outside it. The blanket’s real role is to supply the partition variational Bayes needs. Active inference presupposes perception and action in its generative models. | Active — read in full 2026-10-03 (NOTE-450), from the authors’ PhilSci-Archive preprint (March 2021); the Physics of Life Reviews version was not seen. Worth reading as the scope critique of the free energy principle: granted its premises the principle is true, but it applies only to “things” already given a Markov-blanket partition, the partition is placed where the model needs it, and relational properties and constitutive self-organization fall outside it. The blanket is a “trick” that lets any thing be modelled as a variational autoencoder. Active inference, as a process theory, presupposes perception and action in the generative model it is handed. |
| LIT-601 | The Haken–Kelso–Bunz (HKB) model: from matter to movement to mind | Kelso (2021), Biological Cybernetics 115(4):305–322, a 60th-anniversary retrospective. HKB models bimanual coordination by the relative phase φ, with dφ/dt = −a sin φ − 2b sin 2φ and potential V = −a cos φ − b cos 2φ: both in-phase and anti-phase are stable for b/a > 1/4, and anti-phase loses stability below it, as observed when movement frequency rises. Noise, symmetry breaking (Δω) and metastability extend it; with Kuramoto’s model it becomes a generalized HKB for many agents. The same dynamics is reported within a body, between people and with machines, and in brain activity. | Active — read in full 2026-10-03 (NOTE-467), from the free-to-read publisher PDF. Filed in place of Kelso’s book Dynamic Patterns (LIT-578) and as the read account of the paywalled Haken–Kelso–Bunz paper (LIT-588), both Deferred. Worth reading as Kelso’s own short statement of coordination dynamics: the HKB order-parameter equation for relative phase, its stochastic and symmetry-breaking extensions, metastability as relative coordination, the generalized HKB–Kuramoto model, and the claim that one coordination dynamics holds within and between people. It is a retrospective by an author of the model, not a review, and it says so. |
| LIT-638 | Interacting spiral wave patterns underlie complex brain dynamics and are related to cognitive processing | Xu, Long, Feng & Gong (2023), Nature Human Behaviour 7:1196–1215. In Human Connectome Project fMRI (100 subjects per cohort), the phase field of slow cortical fluctuations holds about 16–19 rotating spirals at a time, centred on phase singularities that drift superdiffusively and sit on boundaries between functional regions. Opposite spirals annihilate, like ones repel. Spiral locations and rotation directions decode four language-task conditions at about 48% (chance 25%, matched raw-signal decoder 30%), and spiral arrays route task activity flow bottom-up while listening and top-down while answering. | Active — read in full 2026-10-03 (NOTE-502); worth reading as the claim that slow (0.01–0.1 Hz) human cortical fMRI fluctuations self-organise into many mobile, interacting spiral waves around phase singularities, as in excitable media and turbulence, and that their locations and rotation directions are task-specific and steer large-scale activity flow. The detection is careful about filtering artefacts (phase-randomised null, filtered–unfiltered similarity); the functional claims are correlational, the spatial scale was chosen to maximise task decoding, and the “gate” and “wall” rules are read off streamlines and a phase-oscillator lattice, not tested by perturbation. |
| LIT-645 | Ultraviolet Superradiance from Mega-Networks of Tryptophan in Biological Architectures | Babcock et al. (2024), J. Phys. Chem. B 128(17):4035–4046, ARXIV-2302.01469. Modelling tryptophan 1La transition dipoles in tubulin architectures with a radiative non-Hermitian Hamiltonian in the single-excitation limit, the authors predict strongly superradiant states (up to about 4000 times the single-tryptophan rate in a centriole, about 7000 extrapolated for large axon-like bundles) and a thermal quantum yield that rises with network size and survives static disorder of room-temperature size. Steady-state spectroscopy of taxol-stabilised porcine microtubules in buffer gives a tryptophan quantum yield of 17.6 ± 2.1% against 10.6 ± 0.6% for tubulin dimers, which they read as superradiance. Lifetimes, and so radiative rates, were not measured. | Active — read in full 2026-10-03 (NOTE-509); worth reading as the measured, room-temperature part of the case for collective quantum optical states in microtubules: a radiative-Hamiltonian model of up to more than 10⁵ tryptophan transition dipoles in microtubules, centrioles and axon-like bundles predicts superradiant states and a quantum yield that grows with network size, and steady-state spectroscopy finds the tryptophan quantum yield of microtubules (17.6 ± 2.1%) above that of free tubulin dimers (10.6 ± 0.6%). No lifetimes were measured, so the radiative rate itself was not, and the paper says nothing about consciousness, objective reduction or Orch OR. |
| LIT-647 v2 | Neural traveling waves in cortex: Network mechanisms and potential roles in neural computation | Muller, Busch, Davis & Reynolds (2026), Neuron 114:3156–3174. A review of neural traveling waves within single cortical areas, chiefly visual cortex: how circuits generate them, and how, by embedding sensory history in the evolving activity across a sensory map, they may implement spatiotemporal computations such as predicting upcoming input. It ends with a framework for generative processing by waves over sensory maps. Unread: registered from the abstract. | Unavailable — registered 2026-10-03 from the PubMed abstract, keywords and the Crossref record, not read. No lawful full text could be found: the article is not open access at Cell Press (Crossref gives the accepted manuscript an Elsevier open-access licence only from 2 September 2027), it is not in PubMed Central, Europe PMC lists no preprint, arXiv has none under Muller with this title, Unpaywall and OpenAlex list no repository copy, and Semantic Scholar marks it closed. The cell.com page returned a bot challenge, which was not pursued. A human reader with subscription access, or anyone after the accepted manuscript becomes open in September 2027, could read it and move this to Active. |
| LIT-707 v2 | Aggregativity: Reductive Heuristics for Finding Emergence | Wimsatt (1997), Philosophy of Science 64(S4):S372–S384. Unread. Per its abstract: most scientists call a system property emergent if it depends on the parts’ mode of organisation, a view consistent with reduction. Emergence is the failure of aggregativity, the state in which “the whole is nothing more than the sum of its parts”. Aggregativity needs four conditions; met differently for different decompositions and in degrees, they give criteria for choosing decompositions and heuristics for detecting the biases of “vulgar reductionisms”. | Unavailable — filed 2026-10-04, not read: no lawful full text was reachable. Philosophy of Science’s PSA supplement is paywalled at Cambridge Core and JSTOR, Unpaywall finds no open copy, and neither the 1997 paper nor its 2000 expansion is posted on Wimsatt’s department pages. Content here is the publisher’s abstract and Wimsatt’s own summary in “Reductionism and its heuristics” (Synthese 2006), which his department posts and which was read in part. A person with library access could supply it; a reading would move this to Active and should state the four conditions exactly. |
| LIT-709 | Conceptualization of the Holobiont Paradigm as It Pertains to Corals | Goulet, Erill, Ascunce, Finley & Javan (2020), Frontiers in Physiology 11:566968, a review. A coral is a consortium: the animal plus the Symbiodiniaceae, bacteria, archaea, fungi and viruses in its body, mucus and skeleton, and neighbours are excluded by definition. Membership can change, so one colony may be a different holobiont at different times. Traits such as thermal tolerance belong to the host–symbiont combination: not every Durusdinium is heat tolerant, and a novel anemone–alga pairing gave higher oxygen flux under heat than both natural ones. Measuring both partners shows different routes to the same bleaching outcome. Whether the holobiont is the unit of selection is asked, not answered. | Active — read in full 2026-10-04 (NOTE-555); worth reading as a short, explicit statement of why a coral should be studied as a composite of host and microbes rather than as an animal with passengers. It is a mini-review with no data of its own (about 3,700 words), and its strongest point is conceptual: traits such as thermal tolerance belong to host–symbiont combinations, not to either partner. The physiological evidence it cites is thin and partly not from corals: its one demonstration that a combination is “not necessarily the sum of its parts” is an oxygen-flux experiment in the sea anemone Exaiptasia. It poses, and does not answer, whether the coral holobiont is a unit of selection. |
| LIT-710 | Signaling cascades and the importance of moonlight in coral broadcast mass spawning | Kaniewska, Alon, Karako-Lampert, Hoegh-Guldberg & Levy (2015), eLife 4:e09991. Acropora millepora colonies from Heron Island, held in outdoor tanks for the eight days before the 2011 spawning night, spawned with the reef under ambient night light (21:30–22:30). They did not spawn that night under added light after sunset (N = 5) or under darkness (N = 5). 184 transcripts varied only on the spawning day, rose around gamete release in ambient colonies, did not change in dark ones and changed early in lit ones. Spawning-night genes were enriched for G-protein-coupled signalling; the proposed melanopsin and neuropeptide cascade is untested. | Active — read in full 2026-10-04 (NOTE-557); worth reading as the record’s one experiment in which an environmental cue is manipulated and a collective biological timing event fails. Colonies of Acropora millepora held in outdoor tanks spawned with the reef only under natural night light. Colonies given artificial light after sunset, and colonies kept dark, did not spawn that night (N = 6, 5, 5). A second experiment found that blue, green and white nocturnal light delayed spawning by 6–8 h or 2 nights and red light did not. The signalling cascade (melanopsin-like opsins, neuropeptide G-protein-coupled receptors) is a model proposed from transcript changes and is not tested. The study shows each colony tracking a shared cue; it does not test coordination between colonies. |
| LIT-711 | Phase Shifts, Herbivory, and the Resilience of Coral Reefs to Climate Change | Hughes et al. (2007), Current Biology 17(4):360–365. A replicated fish-exclusion experiment at Orpheus Island, Great Barrier Reef, begun in 2000 after the 1998 mass bleaching: four roofless 5 × 5 m cages, four partial cages and four open plots, over 30 months. Excluding large and medium fishes produced a phase shift to Sargassum-dominated macroalgae. Coral recovery was suppressed, through about two-thirds lower recruitment and more than double the mortality of surviving colonies. In the controls, coral cover nearly doubled to 20%, mainly by recruitment of taxa that bleaching had removed locally. Reopened cages lost their macroalgae within 30 days. | Active — read in full 2026-10-04 (NOTE-558), main text and methods; the supplement was out of reach. Worth reading as the controlled experiment behind the claim that reef recovery after bleaching depends on an ecological interaction, not only on surviving corals. On an inshore Great Barrier Reef crest after the 1998 bleaching, roofless cages kept large and medium fishes out of four 25 m² plots for 30 months. Macroalgae rose to a mean of 56% cover in the cages against 4.1% and 1.7% in partial cages and open plots. Coral cover in the cages rose only from 6.0% to 7.7%, against 19.2% and 20.2%, because recruitment was about two-thirds lower and mortality of established colonies more than double. It is one site with four replicates per treatment. The cages excluded all large and medium fishes, not herbivores alone, and the macroalgal state vanished within 30 days of reopening them. |
| LIT-712 | Defining Coral Bleaching as a Microbial Dysbiosis within the Coral Holobiont | Boilard, Dubé, Gruet, Mercière, Hernandez-Agreda & Derome (2020), Microorganisms 8(11):1682, a review. Bleaching, the breakdown of the coral–dinoflagellate symbiosis, is redefined as a succession of three holobiont dysbiosis stages: (i) the microbiota buffers the stress and keeps essential functions; (ii) the algal partners are reorganised by shuffling or switching, with or without transient bleaching; (iii) the stress exceeds both buffers, symbionts are lost for good, opportunists invade and the coral dies, and at reef scale algae take over. The stages are a proposal, with no criteria to tell them apart, and the authors concede that microbial shifts are not shown to cause bleaching. | Active — read in full 2026-10-04 (NOTE-556); worth reading as the statement of the “adaptive dysbiosis” account of coral bleaching, which treats bleaching as three successive holobiont states: microbial buffering, reorganisation of the algal partners by shuffling or switching, and an irreversible breakdown ending in death. It is a review with no data of its own, and the account is a proposal. Its own text says that bacterial shifts during bleaching cannot yet be read as cause or consequence, so the title’s “microbial dysbiosis” claims more than the body supports. |
| LIT-714 v2 | The Method of Characteristics Revisited: A Viability Approach | Aubin (1999), lecture notes on arXiv. A set K is viable under a system if from each state in K at least one evolution stays in K, and invariant if every evolution does. By Nagumo’s theorem K is viable exactly when the dynamics point into K’s contingent cone at each state. The viability kernel of K is the largest viable subset of K; its complement in K is a repeller. The capture basin of a target is the set of states from which it can be reached in finite time. | Active — read 2026-10-05 (NOTE-576): the introduction and chapters 1–2 of the author’s arXiv lecture notes, the parts that define viability. Worth reading as the shortest first-hand statement the record holds of Aubin’s viability concepts: a set is viable if from every state at least one evolution stays in it, invariant if all do, and the viability kernel is the largest viable subset of a constraint set. Chapters 3 onward apply these to Hamilton–Jacobi equations and were not read. Stands in for the unread monograph LIT-738. |
| LIT-720 v2 | Catastrophic shifts in ecosystems | Scheffer, Carpenter, Foley, Folke & Walker (2001), Nature 413:591–596. Lakes, coral reefs, oceans, forests and arid lands can switch abruptly to a contrasting state, and loss of resilience usually paves the way. Unread: the theory and the criteria for demonstrating alternative states are read in the authors’ 2003 review LIT-726. | Unavailable — registered 2026-10-05 from Crossref, not read: no lawful full text was found (Nature is closed; no repository or course copy was located). The authors’ 2003 review (LIT-726), read in full, restates its theory of alternative stable states and gives the criteria for showing one exists. Filed because it is the paper usually cited for catastrophic regime shifts. It stays Unavailable until a copy is supplied, not on merit. |
| LIT-726 | Catastrophic regime shifts in ecosystems: linking theory to observation | Scheffer & Carpenter (2003), Trends in Ecology & Evolution 18:648–656. A regime shift can come from a bifurcation, not only a large shock. Field data give hints that are never conclusive. Experiments can demonstrate alternative attractors: initial states fixing end states, a temporary disturbance causing a lasting shift, or hysteresis. Positive feedbacks must be strong enough. Slow return can mimic a new state, as when a biomanipulated lake stayed clear for six years and then slipped back. | Active — read 2026-10-05 (NOTE-571): in full, from a UC Berkeley course page. Worth reading for its standard of evidence for alternative stable states. Field patterns (jumps in time series, multimodal distributions, dual relationships to a driver) are only hints. Experiments are what demonstrate: different initial states lead to different end states, a temporary disturbance causes a lasting shift, or the response to forward and backward change shows hysteresis. Positive feedback is not enough unless strong. Long return times can mimic an alternative state. |
| LIT-738 v3 | Viability Theory | Aubin (1991; reprinted 2009), Birkhäuser: the monograph that founds viability theory, the study of which evolutions of a dynamical or controlled system can remain in a given constraint set, and of the set of initial states from which one can. Unread: registered from metadata; the definitions are read in Aubin’s 1999 mini-course notes LIT-714. | Unavailable — registered 2026-10-05 from Crossref and the author’s own list of his books, not read: no lawful full text could be reached. Springer serves the 2009 reprint behind a bot challenge, which was not passed. Aubin’s 1999 mini-course notes (LIT-714, read) state the definitions this book is cited for: a viable evolution, viability and invariance, the viability kernel and the capture basin. Filed because an essay the owner is writing cites “Aubin’s mathematical theory of viability” for the difference between stability and viability. It stays Unavailable until a copy is supplied, not on merit. |
| LIT-741 | Resilience and Stability of Ecological Systems | Holling (1973), Annual Review of Ecology and Systematics 4:1–23. Stability is how quickly and smoothly a system returns to equilibrium after a disturbance. Resilience is its ability to absorb change in state variables, drivers and parameters and still persist, a matter of the size of its domain of attraction. A system can be highly resilient and unstable, as the spruce budworm forest is. Managing for a stable maximum yield can shrink resilience until a rare event flips the system. | Active — read 2026-10-05 (NOTE-572): in full, from IIASA’s authorised reprint. Worth reading as the origin of the distinction between stability and resilience. Stability is the speed and smoothness of return to an equilibrium after a disturbance. Resilience is the capacity to absorb change and still persist, measured by the size of the domain of attraction and how near its boundary the system sits. The two can trade off: management for constancy can erode resilience. Evidence is a set of case histories (lakes, spruce budworm, salmon, fire), not tests. |
| LIT-743 | Risk management in a dynamic society: a modelling problem | Rasmussen (1997), Safety Science 27:183–213. Risk management is a control problem spanning government, regulators, companies, management, staff and work. Behaviour within a work space moves under an effort gradient and a cost gradient toward the boundary of acceptable performance. In defence-in-depth systems, defences degrade unobserved under cost pressure. Accidents arise from many locally reasonable decisions. Improvement means making boundaries visible, not fighting errors. | Active — read 2026-10-05 (NOTE-584): the argument in full, the review of research paradigms skimmed, from the author’s manuscript in DTU’s repository. Worth reading for the model of drift. Under a cost gradient from management and an effort gradient from workers, activity migrates toward the boundary of acceptable performance. In defence-in-depth systems one actor’s breach of a defence has no visible effect, so defences erode unobserved. Major accidents come from the interaction of many decision makers adapting to local pressures, not from coincident errors. Built from accident analyses; not a quantitative model. |
| LIT-746 v2 | Brain of the Firm | Beer (1972), Brain of the Firm, Allen Lane; 2nd edn Wiley 1981. The streamlined statement of the Viable System Model in neurophysiological terms, the second edition adding the Chilean application of 1971–73. Unread: the model is read in Beer’s 1984 retrospective LIT-752. | Unavailable — registered 2026-10-05 from Open Library and Beer’s own references, not read: no copy was sought, the book being in copyright and commercially published. Its model is read first-hand in Beer’s article-length retrospective “The Viable System Model: Its Provenance, Development, Methodology and Pathology” (LIT-752), which restates the five subsystems, the recursion theorem and the pathologies and refers to this book and The Heart of Enterprise for the detail. Filed because it is the book usually cited for the Viable System Model. On 2026-10-14 a lawful full text was sought and none was reached. OpenAlex: the book has no DOI to look up, and its title search refused the request (the shared daily budget was exhausted). Unpaywall: no DOI to query. Crossref: no record for the book, only for reviews of it. Wiley’s product page for the 1995 paperback reissue loads and offers it for sale only (listed out of stock), with no e-book or open-access edition. Europe PMC: no open-access hit for the title. Google Books: its API refused the request (daily quota exceeded). Internet Archive: no text item for this book; Beer’s other books there are borrow-only lending scans, and a community upload titled “Brain of the Firm, Reclaimed” is a transcription not posted by the rights holder, so it was not used (its metadata did not load either). A web search for an authorised copy found none. Its status is not a judgement on merit. It stays Unavailable until a copy is supplied. |
| LIT-752 | The Viable System Model: Its Provenance, Development, Methodology and Pathology | Beer (1984), Journal of the Operational Research Society 35:7–25. A retrospective on the Viable System Model. Any system able to keep its identity independently in a shared environment has five necessary and sufficient subsystems, and every viable system contains and is contained in one. The model is offered as a scientific model reached by homomorphic mapping, not an analogy. Breakdowns trace to a failing subsystem, as when Three and Five collapse without Four. | Active — read 2026-10-05 (NOTE-577): in full except one page, from the 1989 book reprint posted by the Cwarel Isaf Institute, which Beer co-founded. Worth reading as Beer’s own retrospective on the Viable System Model. Five subsystems are claimed necessary and sufficient for any system to keep its identity independently, and the structure recurs, since every viable system contains and is contained in one. Breakdowns are diagnosed as failures of a subsystem: without System Four, Systems Three and Five collapse into each other and the system can only react. Limits: the paper declines to expound or validate the model, the copy lacks the page with the synopsis of the subsystems and its figures, and the applications are recalled, not documented. |
| LIT-787 v2 | Design for a Brain: The Origin of Adaptive Behaviour | Ashby (1952; 2nd ed. 1960), DOI-10.1007/978-94-015-1320-3. Adaptation is stability of organism and environment within the region where the essential variables stay in limits. An ultrastable system finds it by a second, slower feedback that changes the parameters of the first, by step-functions at random, whenever an essential variable leaves its limits, shown in the Homeostat; Ashby argues such a feedback is necessary for any adaptation by trial and error. A large one would take impossibly long unless partial adaptations are kept, which needs a system not fully joined, its parts separated by constancies, with separate stores for separate situations. | Active — read 2026-10-14 (NOTE-851) in full, in the 1960 second edition the owner’s essay cites; worth reading for ultrastability, argued to be necessary for any system that adapts by trial and error, and for the less-cited second half: a large ultrastable system adapts in practicable time only if partial adaptations are retained, which needs parts separated by constancies, and new learning destroys old where it uses the same parts. Read it knowing that the parameter changes are blind, that the fit to real brains is qualitative, and that the account of where step-mechanisms are in the nervous system is admittedly empty. |
| LIT-852 | A sensor of oxidative stress confers virulence via response memory in Acinetobacter baumannii | Ngo et al. (2026), bioRxiv 10.64898/2026.04.08.717352 (preprint, not peer reviewed). Reports that the PmrB sensor of the PmrA/PmrB two-component system in Acinetobacter baumannii detects sublethal oxidative stress via four periplasmic histidine residues coordinating a nickel cofactor; PmrA then activates iron-sulfur repair, a ferritin, a catalase and a peroxidase. The sensor is claimed to stay active 30—90 min after the stimulus is removed (a “response memory”), priming cross-protection against lethal peroxide and antimicrobial peptides, and the histidine box is reported necessary for virulence in mice and for hypervirulence in a clinical carbapenem-resistant isolate. | Active — read 2026-10-09 (NOTE-656) from the bioRxiv full-text PDF of the v1 preprint. An unrefereed preprint: worth keeping as a clean biological instance of the memory from a temporary signal'' pattern that THEORY-136 sets the evidential bar for, and as a self-contained worked example of a two-component signalling system (PmrA/PmrB) that is claimed to sense oxidative stress through a histidine box with a nickel cofactor, to hold a redox-gated conformational switch, and to retain a 30--90 minute response memory” after the stimulus is removed. Read for what it shows, not for what a manuscript might use it for; its central memory and virulence claims rest on this single unreviewed study. |
| LIT-853 | A heritable iron memory enables decision-making in Escherichia coli | Bhattacharyya, Bhattarai, Pfannenstiel, Wilkins, Singh and Harshey (2023), PNAS 120(48):e2309082120. In single-cell swarm assays (over 10,000 plates), an E. coli cell’s swarming potential is shared by its fourth-generation descendants and lost by the seventh; it tracks the cell’s iron status (low iron, better swarmer), iron starvation or forced uptake lengthens it, and a three-state switching model fits the lineages only with a fixed holding delay before switching. The iron–swarming link is correlational and measured through a Fur-repressed promoter, not iron itself. | Active — read 2026-10-09 (NOTE-657); worth reading as an experimental case of a non-genetic, multigenerational state in single bacteria: a cell’s swarming potential is shared by its descendants for about four generations and gone by seven, and it tracks the cell’s iron status as reported by a Fur-repressed promoter (Spearman r = 0.71 between reporter signal and swarm diameter over 96 sorted cells; 0.15 and 0.05 in the controls). The state is not a bistable switch: an ODE of three swarming classes fits the lineage data only when each founding cell holds its class for a fixed delay (about three or four generations) before switching at constant rates. The “memory”, “decision-making” and “conditioning” of the title and text are figurative; the iron link rests on a promoter reporter and on correlation, and the model fixes five parameters on two time points. |
| LIT-854 | Irreversibility in bacterial regulatory networks | Zhao, Wytock, Reynolds and Motter (2024), Science Advances 10(35):eado3232. In Boolean models of the E. coli transcriptional regulatory network, a transient single-gene knockout or overexpression often moves the network to a different attractor, so one genotype can hold several heritable expression states without epigenetic marks. The genes able to do this are those upstream of, or inside, strongly connected components with positive circuits, and the more weighted paths to them the likelier. A prediction from a model ensemble, with no direct experiment. | Active — read 2026-10-09 (NOTE-655); worth reading as a whole-network test of whether transcriptional regulation alone can make a bacterium’s state history-dependent. In an ensemble of sign-consistent Boolean rules on the 87-gene core of the largest E. coli regulatory subnetwork (RegulonDB), 51 genes admit a transient knockout or overexpression that leaves the network in a different attractor; every such gene reaches a strongly connected component containing a positive circuit, and the probability grows roughly as a power of the weighted number of paths to one. Model only: the paper runs no transient-perturbation experiment. Its one comparison with data, against strains evolved after a permanent crp knockout, mostly tests the sign structure of the network, and its link to irreversibility is weak (P = 0.03 on small counts). |
| LIT-865 | Hyperbolic Geometry of Complex Networks | Krioukov, Papadopoulos, Kitsak, Vahdat and Boguñá (2010), Phys. Rev. E 82, 036106. Random graphs on a hyperbolic disk, with nodes joined by hyperbolic distance, have power-law degrees (γ = 2α/ζ + 1, set by node density against curvature) and strong clustering (set by a temperature, lost at a phase transition at T = 1). A circle-similarity model with power-law hidden degrees is the same ensemble once radius is taken as log degree: the paper’s “effective hyperbolic geometry”. The configuration model and Erdős–Rényi graphs are its degenerate limits, and greedy routing by the coordinates is near-optimal and robust in the model’s networks. | Active — read 2026-10-09 (NOTE-680); worth reading as the paper that put a latent hyperbolic space under complex networks. Nodes placed quasi-uniformly in a hyperbolic disk and joined when close give, in the large-disk approximation, a power-law degree distribution with exponent γ = 2α/ζ + 1 (node-density exponent over curvature), and a Fermi–Dirac connection probability with a temperature T gives clustering that falls from its maximum at T = 0 to zero at a phase transition at T = 1. Conversely, a circle-similarity model with power-law hidden degrees maps onto the hyperbolic one by taking radius as log degree: this is the paper’s “effective hyperbolic geometry”. Removing the angular term from the distance leaves the configuration model, and heating further leaves Erdős–Rényi graphs. Greedy routing by hyperbolic coordinates in the model succeeds for 99.9% of pairs at γ = 2.1 and T = 0 and survives heavy link removal. All of it is about the model: the fit to the Internet is of three summary statistics, and no real network is embedded here. |
| LIT-867 | Emergent Hyperbolic Network Geometry | Bianconi and Rahmede (2017), Scientific Reports 7, 41974. Growing simplicial complexes, made by gluing d-simplices to (d − 1)-faces with probability ∝ 1 + s n_α (flavor s = −1, 0, 1), have a tree as their dual and, drawn with equal links as ideal simplices in the Poincaré ball, fill hyperbolic d-space: the hyperbolic geometry is an outcome of a purely combinatorial rule rather than its cause. Degrees are exponential for d + s = 1 and power-law with γ = 2 + 1/(d + s − 1) ≤ 3 for d + s > 1; clustering and modularity are high for d ≥ 2. Hyperbolicity is shown by construction, conditional on equal link lengths, not proved. | Active — read 2026-10-09 (NOTE-678); worth reading as the model that turns the hidden-metric account of complex networks around: a simplicial complex grown by gluing d-simplices to (d − 1)-faces, with no geometry in the rule, comes out small-world, clustered, modular and (for d + s > 1) scale-free, with γ = 2 + 1/(d + s − 1) from a master equation. Its dual is a tree, so with every link given equal length each simplex is drawn as an ideal simplex of the Poincaré ball and each new node at the normalised sum of its parent face’s positions. That embedding, not a proof, is the paper’s case that the geometry is hyperbolic, and the authors concede it rests on the equal-length assumption (unequal lengths fit a sphere) and that the ideal-simplex distances are infinite. A fitness on faces gives a numerically observed transition in which the complex grows in one direction. |
| LIT-869 | Multiscale unfolding of real networks by geometric renormalization | García-Pérez, Boguñá and Serrano (2017; Nature Physics 14, 583–589, 2018). A geometric renormalization group for networks: merge blocks of angular neighbours on the S¹ circle into supernodes. The S¹ model maps approximately into itself under this (κ′ = (Σκ^β)^{1/β}, β fixed), so layers are self-similar with an average degree that grows or shrinks by r^ν, ν set by the degree exponent γ and the clustering parameter β. Six real networks collapse across layers and keep their communities. Applied as downscaled replicas that reproduce Ising, SIS and Kuramoto behaviour, and as multiscale greedy routing in hyperbolic space. | Active — read 2026-10-09 (NOTE-673); worth reading as the paper that defined a renormalization group for networks from a hidden metric space rather than from shortest paths. Nodes embedded on the S¹ circle are merged in blocks of r angular neighbours, supernodes linked if any of their members were, and the model maps approximately back into itself: hidden degree κ′ = (Σκ^β)^{1/β}, β unchanged, μ and R divided by r. So each layer is a smaller network of the same ensemble with a larger average degree, ⟨k⟩ growing as r^ν with ν = 2/(γ−1) − 1 or 2/β − 1, whichever dominates. Six real networks (Internet, airports, metabolism, proteome, chord transitions, word adjacency) show degree, neighbour-degree and clustering curves that collapse across layers and keep their communities, which the paper reads as evidence that hidden metric spaces underlie real networks. Pruning a layer back to the original density gives small replicas on which Ising, SIS and Kuramoto curves match the original, and greedy routing through the coarser layers raises its success rate. The renormalizability is a first-order approximation, and the collapse is shown by eye. |
| LIT-875 | An argument for hyperbolic geometry in neural circuits | Sharpee (2019 online), Curr. Opin. Neurobiol. 58:101–104. A four-page review arguing that neural and other biological circuits should have hyperbolic geometry, because hyperbolic space approximates trees, hyperbolic networks are navigable, and Zipf’s law, read as states growing exponentially with log-improbability and taken as the mark of maximally informative, latent-driven systems, shares that exponential growth. Its evidence is the olfactory embedding of Zhou, Smith & Sharpee (2018) and earlier perception work; the Zipf-to-hyperbolic link is an analogy, not a derivation. | Active — read 2026-10-09 (NOTE-670); worth reading as the short programmatic statement, by the lab behind the olfactory and hippocampal hyperbolic findings, of why hyperbolic geometry should be expected in neural circuits, and as a map of the literatures it joins: hyperbolic random graphs and greedy routing, Zipf’s law and statistical criticality, and maximally informative representations. Its own argument is a chain of analogies, not a derivation. Zipf’s law is rewritten as a count of states growing exponentially with energy (−log probability), and exponential growth of states is a hallmark of trees and of hyperbolic space, so the two are said to be connected; but exponential growth of states holds for any system with extensive entropy, and what singles out Zipf (unit slope) plays no part in the step to geometry. A rigidity argument for three dimensions cites Mostow’s theorem, which concerns finite-volume hyperbolic manifolds of every dimension ≥ 3 and says nothing about point clouds. The one piece of data, a 3D Poincaré-ball embedding of fruit odorants with a pleasantness gradient, is reproduced from Zhou, Smith & Sharpee (2018). |
| LIT-905 | The Architecture of Complexity | Simon (1962), Proceedings of the American Philosophical Society 106(6): 467–482. Complexity usually takes the form of hierarchy, defined by intensity of interaction, not by subordination. Hierarchies evolve fast because stable intermediate forms survive interruption (Hora and Tempus). Hierarchies are nearly decomposable: subsystems run fast and nearly independently, and interact slowly and only in aggregate. In social systems the higher levels have the slower dynamics and the longer intervals between interactions. | Active — read in full 2026-10-11 (NOTE-704) from the JSTOR PDF posted on a University of Washington course page (homes.cs.washington.edu/~ztatlock/599z-17sp/papers/complexity-simon-62.pdf; an identical copy is on pdodds.w3.uvm.edu). The record has read from a JSTOR PDF on a course page before (McAdams 2019). Worth reading for near-decomposability (fast dynamics inside subsystems, slow and aggregate between them) and for hierarchy defined by intensity of interaction rather than by space or by authority. The evolutionary-speed argument is an illustrative model whose numbers Simon says not to take seriously. |
| LIT-908 v2 | The Ghost in the Machine | Koestler (1967). Introduces the holon, a whole to its parts and a part to its whole, with a self-assertive and an integrative tendency, and the holarchy, a hierarchy of holons, drawing on Simon’s watchmaker parable. Unread. | Unavailable — unread, registered 2026-10-11. Hutchinson, London, and Macmillan, New York, 1967; no DOI. The URL is the Internet Archive’s controlled-lending record of the Macmillan edition. Filed as the source of the holon, discussed the same day as a possible name for a combined form and set aside as naming a position rather than an achievement. |
| LIT-913 v2 | On the Concept of Coordinative Structures as Dissipative Structures: I. Theoretical Lines of Convergence | Kugler, Kelso & Turvey (1980), in Stelmach & Requin (eds.), Tutorials in Motor Behavior, pp. 3–47. Coordinative structures, the functional units that solve Bernstein’s degrees-of-freedom problem, are proposed to be dissipative structures, self-organizing under energy flow, rather than units assembled by a controller. Unread. | Unavailable — looked for a lawful full text on 2026-10-14 and found none, so it is not read and no NOTE is filed. Unpaywall: closed. OpenAlex: closed, one location (doi.org), no repository full text. Semantic Scholar: closed. Europe PMC: no record. ScienceDirect: the chapter page returned 403 to this client, and OpenAlex and Unpaywall record the chapter as closed, so no free publisher copy is known to exist. Kelso’s Human Brain and Behavior Laboratory publication list at Florida Atlantic University (ccs.fau.edu/hbblab/publications.php) lists this chapter and Part II with no PDF. The old Haskins Laboratories publication pages (haskinslabs.org/publications) now redirect to a new site with no listing, and a Wayback Machine search for a Haskins-hosted copy failed on access, not availability (connection reset), so an archived lab copy is not ruled out. Web searches on the title in quotes, with and without Haskins, found no author-posted copy. It stays Unavailable until a copy is supplied. |
| LIT-917 v3 | Disappearing Polymorphs | Dunitz & Bernstein (1995), Acc. Chem. Res. 28, 193. Cases where a crystal form that had been made reproducibly could no longer be made once a new, usually more stable, form had appeared, attributed to seeding by stray nuclei of the new form. Not read. | Unavailable — filed 2026-10-11 from its Crossref record, not read. Registered at the owner’s request for the nucleating-argument line, on what it is standardly cited for. No NOTE is filed, and it stays Unavailable until it is read, not on merit. Looked for on 2026-10-11: Unpaywall reports no open-access copy for the DOI, and Europe PMC holds no full text, so no lawful full text was found. |
| LIT-918 v2 | Neural networks and physical systems with emergent collective computational abilities | Hopfield (1982), PNAS 79, 2554. Threshold units with symmetric Hebbian couplings, updated asynchronously, descend an energy function, so stored random patterns are attractors and a partial or noisy cue settles into the nearest one. In simulations at N = 30 and 100, recall degrades near 0.15N patterns, memories closer than about a tenth of N fuse, and overload makes every memory irretrievable unless old ones are forgotten. | Active — read 2026-10-14 (NOTE-819) in full; worth reading as the paper that made memory a property of a flow: with symmetric couplings the asynchronous dynamics descend an energy function, Hebbian storage makes random patterns attractors, and a cue a few bits off settles into the nearest one. Read it knowing that every number in it (the 0.15N capacity, the basin width, the fusion of memories closer than about a tenth of N, the loss of all memories under overload) comes from simulations at N = 30 and 100, and that its “stable states of no obvious meaning” appear at a low load, not only past capacity. |
| LIT-923 v2 | Synergetics: An Introduction. Nonequilibrium Phase Transitions and Self-Organization in Physics, Chemistry and Biology | Haken (1977), Synergetics, Springer. Near an instability, a few slowly varying order parameters come to govern the many fast degrees of freedom of a system (the slaving principle). One formalism is applied to lasers, fluid convection, chemical reactions and biology. Not read. | Unavailable — filed 2026-10-11 from its Crossref record, not read. Registered at the owner’s request for the nucleating-argument line, on what it is standardly cited for. No NOTE is filed, and it stays Unavailable until it is read, not on merit. Looked for on 2026-10-11: Unpaywall reports no open-access copy for the DOI, and Europe PMC holds no full text, so no lawful full text was found. |
| LIT-925 v3 | Diffusion-Limited Aggregation, a Kinetic Critical Phenomenon | Witten & Sander (1981), Phys. Rev. Lett. 47, 1400. The diffusion- limited aggregation model: particles random-walk in one at a time and stick on contact, building a branched, fractal cluster. It is the minimal model of growth that branches because tips screen the interior. Not read. | Unavailable — filed 2026-10-11 from its Crossref record, not read. Registered at the owner’s request for the nucleating-argument line, on what it is standardly cited for. No NOTE is filed, and it stays Unavailable until it is read, not on merit. Looked for on 2026-10-11: Unpaywall reports no open-access copy for the DOI, and Europe PMC holds no full text, so no lawful full text was found. |
| LIT-926 v3 | The two-step mechanism of nucleation of crystals in solution | Vekilov (2010), Nanoscale 2, 2346. The two-step mechanism: crystals nucleate inside metastable clusters of dense liquid, which form first, rather than directly from the solution. Proposed for proteins and small molecules, to explain nucleation rates far below the classical prediction. Not read. | Unavailable — filed 2026-10-11 from its Crossref record, not read. Registered at the owner’s request for the nucleating-argument line, on what it is standardly cited for. No NOTE is filed, and it stays Unavailable until it is read, not on merit. Looked for on 2026-10-11: Unpaywall reports no open-access copy for the DOI, and Europe PMC holds no full text, so no lawful full text was found. |
| LIT-927 v3 | Instabilities and pattern formation in crystal growth | Langer (1980), Rev. Mod. Phys. 52, 1. The standard review of morphological instability in crystal growth: why a growing front far from equilibrium loses its flat shape and branches into dendrites, and what selects the pattern that results. Not read. | Unavailable — filed 2026-10-11 from its Crossref record, not read. Registered at the owner’s request for the nucleating-argument line, on what it is standardly cited for. No NOTE is filed, and it stays Unavailable until it is read, not on merit. Looked for on 2026-10-11: Unpaywall reports no open-access copy for the DOI, and Europe PMC holds no full text, so no lawful full text was found. |
| LIT-929 v2 | Generalized Stability Theory. Part II: Nonautonomous Operators | Farrell & Ioannou (1996), J. Atmos. Sci. 53, 2041. For a time-dependent operator A(t) there are no modes; the propagator’s singular vectors, the Lyapunov exponents and the Lyapunov vectors take their place. Its main result: an operator stable or neutral at every instant can be asymptotically unstable when it varies in time, only if it is non-normal, and random variation destabilizes generically, needing less variation the more non-normal and less damped the mean operator. Examples: a switched oscillator, random neutral matrices, the Lorenz system and a three-layer baroclinic model. | Active — read 2026-10-14 (NOTE-842) in full; worth reading for its main result: a time-dependent linear operator that is stable, or neutral, at every instant can be asymptotically unstable, only if it is non-normal, and random variation of the operator does this generically, with less variation needed the more non-normal and less damped the mean operator. Read it knowing that genericity is cited to stochastic stability theory rather than proved, that its examples are low-dimensional, and that in its deterministic examples variation much faster than the transient growth destabilizes nothing. Filed from it: THEORY-325. |
| LIT-930 v3 | Will a Large Complex System be Stable? | May (1972), Nature 238, 413. A large system of n components with randomly signed interactions of strength s and connectance C is almost surely stable when s√(nC) < 1 and unstable when it exceeds 1, with a sharp transition: past a point, more components or more connections destabilize. It challenged the view that diversity brings stability. Not read. | Unavailable — looked for a lawful full text on 2026-10-14 and found none, so it is not read and no NOTE is filed. Unpaywall: closed, no open location. OpenAlex: two locations, doi.org and PubMed 4559589, neither open. Europe PMC: PMID 4559589, not open access, no PDF. Semantic Scholar: closed. nature.com: the article page is paywalled (“Access through your institution”), and its .pdf URL returned that HTML page. A web search on the title in quotes found no author-posted or institutional copy; May died in 2020 and has no personal page with papers. The Internet Archive could not be reached from this client (connection reset), and a 1972 Nature paper would not be public domain there. It stays Unavailable until a copy is supplied. |
| LIT-931 v2 | Generalized Stability Theory. Part I: Autonomous Operators | Farrell & Ioannou (1996), J. Atmos. Sci. 53, 2025. For du/dt = Au with A non-normal, the eigenvalues fix only the t → ∞ behaviour. Growth over time t is the top singular value of e^{At}, set at t → 0 by the numerical abscissa, the top eigenvalue of (A + A†)/2. Systems with every mode damped amplify perturbations by large factors before decaying, and their forced and white-noise responses exceed the equivalent normal response. Worked in a 2 × 2 example and damped Eady models. | Active — read 2026-10-14 (NOTE-831) in full; worth reading as the compact statement of non-modal stability for a fixed linear operator: growth over a finite time is the top singular value of the propagator, the eigenvalues govern only the long-run limit, and forced and stochastic responses exceed those of the normal system with the same spectrum. Read it knowing that it is a synthesis of earlier results with worked atmospheric models, that non-normality is relative to the chosen norm, and that it is linear and autonomous. Filed from it, with LIT-932: THEORY-323. |
| LIT-932 v2 | Hydrodynamic Stability Without Eigenvalues | Trefethen et al. (1993), Science 261, 578. Plane Couette and Poiseuille flow become turbulent at Reynolds numbers where eigenvalue analysis says they are stable. Their linearized operators are far from normal: with every mode decaying, perturbations grow transiently by O(R) and resonate by O(R²), and an operator perturbation of O(R⁻²) makes them eigenvalue-unstable. Pseudospectra, not eigenvalues, show it. That nonlinear mixing then carries the amplified disturbance into turbulence is conjectured, from a 2 × 2 model with threshold O(R⁻³). | Active — read 2026-10-14 (NOTE-839) in full; worth reading as the short statement of why eigenvalue analysis fails for shear flows: the linearized Couette and Poiseuille operators are far from normal, so perturbations grow transiently by O(R), resonate by O(R²), and an operator perturbation of O(R⁻²) destabilizes, all read off the pseudospectra. Read it knowing that the transient growth results are credited to earlier work, and that its account of transition, linear growth plus energy-neutral nonlinear mixing with threshold O(R^γ), γ < −1, is a conjecture from a 2 × 2 model. Filed from it: THEORY-304, and with LIT-931, THEORY-323. |
| LIT-933 v2 | Functional Synchronization: The Emergence of Coordinated Activity in Human Systems | Nowak et al. (2017), a Hypothesis and Theory article. It proposes one scenario for psychology from neural processes to group dynamics: functions are carried out by functional units, which form when lower-level elements synchronize and dissolve when the task ends. Synchronization means any binding of dynamics, including complementary and compensatory roles, not convergence on one state. A higher-level element may be a pattern of synchronization (an order parameter) rather than a set of members. Group synchrony from mutual influence and from a common external signal are treated alike. No data, model or derivation; the authors offer it as a heuristic. | Active — read 2026-10-14 (NOTE-768) in full; worth reading as a statement of the functional-unit view: at every level from neurons to groups, a function is a transient configuration of synchronized elements. Read it knowing that it is a programmatic hypothesis paper with no data or model, which its authors call “a heuristic”, that its synchronization includes complementary roles and is not convergence, and that it counts synchrony from mutual influence and from a common external signal as the same functional unit. Registered for QUESTION-053, where it is a third option rather than either side; no THEORY is filed from it. |
| LIT-949 v2 | A synergistic workspace for human consciousness revealed by Integrated Information Decomposition | Luppi et al. (2024), eLife 12:RP88173. Pairwise synergy and redundancy between 454 regions of resting-state fMRI (HCP, N = 100), from Gaussian integrated information decomposition, define a “synergistic workspace”. Within it, regions whose synergistic connections reach more modules than their redundant ones are gateways, mainly in the default mode network. The rest are broadcasters, mainly in the executive control network with lateral prefrontal cortex. Across propofol anaesthesia (against wakefulness and against recovery) and 22 patients with disorders of consciousness, revised integrated information ΦR falls consistently between default-mode gateway regions. The original whole-minus-sum Φ shows no common fall, and the increases near broadcasters are not robust. The evidence is correlational, pairwise and content-free. | Active — read 2026-10-14 (NOTE-799) in full; worth reading as an information-theoretic operationalisation of a global workspace with distinct input and output sides. Synergy-dominant regions form the workspace; within it, gateways (mainly default mode) and broadcasters (mainly fronto-parietal) are split by participation-coefficient rank. Pairwise integrated information ΦR falls between default-mode gateways under propofol and in disorders of consciousness, where the original Φ shows no common fall. Read it knowing four things. The two-sided split is imposed by the method, and only where its classes fall is measured. All measures are pairwise, undirected resting-state BOLD, with no contents or report, so it says nothing about which consumers a content reaches. The disorders-of-consciousness group includes minimally conscious patients. The propofol sample is given as both 15 and 16. Filed as THEORY-240. |
| LIT-953 v2 | Flickering Emergences: The Question of Locality in Information-Theoretic Approaches to Emergence | Varley (2022), Entropy 25(1):54. Information-theoretic measures of emergence, Hoel’s coarse-graining and the ΦID synergy of Mediano, Rosas et al., are expectations of past–future mutual information, whose local values can be negative. In a constructed four-node toy a coarse-graining emergent on average maps about 53% of informative micro transitions to misinformative macro ones, and the synergy atom is negative for 31% of transitions; in one connectome misinformative edges lie mostly between communities. The paper argues the possibility is general to excess-entropy measures. | Active — read 2026-10-14 (NOTE-756) in full; worth reading as the plain demonstration that information-theoretic emergence scores are expectations whose local values can run the other way: a coarse-graining emergent on average can turn most informative micro transitions into misinformative macro ones, and the ΦID synergy atom can be negative at particular transitions. Read it knowing that the instances are one constructed toy and one connectome, that the claim for every excess-entropy measure is argued and not proved, and that what a negative moment means is left open. Registered for QUESTION-035; THEORY-268 is filed from it. |
| LIT-959 v2 | A circuit-based framework for depression: Reshaping the pathological attractor | Yuan et al. (2026). The review conceptualizes major depressive disorder as a pathological attractor, a stable, self-reinforcing network configuration kept in place by maladaptive plasticity. It argues that the depressive state comes from a hierarchical failure of top-down prefrontal control, which lets subcortical hubs stabilize and drive anhedonia and motivational deficits. It recasts treatment as reshaping the brain’s functional landscape, with rapid-acting drugs and neuromodulation steering trajectories to adaptive states. Not read. | Unavailable — searched 2026-10-14 for a lawful full text and none was reached, so it is not read and no NOTE is filed. OpenAlex: closed (PubMed record only); Unpaywall: not open access; Europe PMC: no PMC copy, “Subscription required”; cell.com returned 403 to this client, failing on access, not availability, though the review is a subscription article there; no preprint was found, and a web search found only Chinese news reports of its publication (5 May 2026 online) crediting Minmin Luo’s group. It stays Unavailable until a copy is supplied. |
| LIT-960 v2 | Symmetries, Cluster Synchronization, and Isolated Desynchronization in Complex Networks | Pecora et al. (2014). For identical units coupled through a symmetric, unweighted graph, the orbits of the graph’s symmetry group are clusters that can each be exactly synchronized. A change of coordinates built from the group’s irreducible representations block-diagonalizes the variational equations, so each cluster’s stability is computed alone. When the group is a direct product, a cluster moved by one factor can lose synchrony while the others keep it (isolated desynchronization), because the other nodes receive the same summed input from it either way. An 11-node electro-optic network showed the predicted bifurcations. Graph statistics suggest such symmetries are common. | Active — read 2026-10-14 (NOTE-775) in full; worth reading as the general account of cluster synchronization for identical units on a symmetric graph: the symmetry orbits are the clusters that can synchronize, irreducible representations separate each cluster’s stability, and a cluster moved by its own factor of the group can desynchronize alone, as an electro-optic experiment showed. Read it knowing that symmetry is sufficient, not necessary, for clusters, that nonidentical units and weighted or directed coupling are not worked through, and that it says nothing about external drive. Its use on QUESTION-063 as a coupling signature is the record’s inference, held in THEORY-276. |
| LIT-979 v2 | Dynamical independence: Discovering emergent macroscopic processes in complex dynamical systems | Barnett and Seth (2023). A coarse-grained variable is dynamically independent when, given its own history and the environment, the microscopic history adds nothing to predicting it: transfer entropy T(X → Y | E) = 0. The measure is transformation-invariant, the condition is transitive across scales, and it is equivalent to a causal sub-graph with no incoming transfer. For linear state-space models it has a closed form. Minimizing it over linear subspaces at each scale gives an “emergence portrait” of many local optima. Exact independence is generically absent for VAR order above 1. The system/environment boundary is taken as given. | Active — read 2026-10-14 (NOTE-791) in full; worth reading as a transformation-invariant criterion for emergent macroscopic variables: a coarse-graining is dynamically independent when the microscopic history adds nothing to its self-prediction, with a closed form and a numerical search for linear state-space models. Read it knowing that the system/environment boundary, the scale and the class of maps are inputs, that generically no exact independent variable exists beyond VAR(1), and that the optima are many. On QUESTION-065 it supplies a system-fixed target, but not the locality-based one, and it answers the uniqueness question in the negative. Held in THEORY-257. |
| LIT-989 v2 | An ability to respond begins with inner alignment: How phase synchronisation effects transitions to higher levels of agency | Tissot, Levin, Buckley & Watson (2024), bioRxiv (v2 May 2024). In a simulated modular coordination game, minimal deciders that alternate between a sensitive and an acting phase shift only the timing of their decision cycles toward partners they currently agree with. Timing synchronises within modules; each module then switches its convention as one unit in response to the others, and all 50 runs with the learned timing reach a global optimum against none without. Imposed global synchrony does not help. Synchrony works by silencing the module’s internal pull at a shared moment. The same result arises by selection on timing, and at a second level. | Active — read 2026-10-14 (NOTE-773) in full; worth reading as a worked, bottom-up model of a group becoming a unit: bistable deciders that shift only the phase of their decision cycle toward partners they agree with come to synchronise within strongly coupled modules, and each module then switches as one in response to the others, where before it could not. Read it knowing that it is one clean simulated game at one parameter setting, that the modules are built into the couplings and timing finds them, that the phase rule is a payoff gradient only loosely like oscillator entrainment, and that imposed global synchrony does nothing. Registered for QUESTION-035; THEORY-265 is filed from it. |
| LIT-990 v3 | Agency, Goal-Directed Behavior, and Part-Whole Relationships in Biological Systems | Watson (2023). A perspective essay offering a scale-relative, comparative notion of agency. Relative to a chosen decomposition into parts with goals, a whole is agential with respect to its parts when its organization makes them better at resolving their mutual constraints than they would be at the equilibrium of the old organization. This shows as delayed gratification. Citing earlier models, it argues that unsupervised, bottom-up learning among self-interested parts can produce such organization, so that “the agent creates itself”. It sets no absolute threshold. | Active — read 2026-10-14 (NOTE-747) in full; worth reading as a comparative, scale-relative notion of agency. Given a decomposition into parts with goals of their own, a whole is more agential than its parts when its organization lets them resolve more of their mutual constraints than the old organization did, shown as delayed gratification (going uphill in a specific direction to reach lower minima). Read it knowing that it is a perspective essay. Its model results (Hebbian self-modelling networks, social and ecological networks) are reported from earlier papers. It sets no threshold for an additional agent, and its measure depends on a stipulated choice of parts and of their goals. Learned origin of the organization is offered as an optional restriction, not a requirement. |
| LIT-998 v2 | A measure for brain complexity: relating functional segregation and integration in the nervous system. | Tononi, Sporns & Edelman (1994). Introduces neural complexity C_N: the summed shortfall of average subset integration below a linear rise with subset size, equivalently the average mutual information between a subset and the rest, summed over sizes. For one family of Gaussian matrices it is low when components are independent or uniformly dependent and high in between. In one simulated visual area, and in small linear systems, patchy grouped connectivity gives higher C_N than the same connections spread uniformly. All results are simulation; C_N is one number for a system with fixed components and finds no units. | Active — read 2026-10-14 (NOTE-767) in full; worth reading as the origin of neural complexity C_N, the summed average mutual information between a subset and the rest of a system, low when parts are independent or uniformly dependent and high when they are segregated in small subsets and integrated in large ones. Read it knowing that every result is simulation, that C_N is one number over components fixed in advance with no boundary or threshold, and that its oneness test (no bipartition with zero mutual information) is the unpriced limit of the gap test QUESTION-042 asks about. THEORY-262 holds what it shows. |
| LIT-1025 | Interpretable early warnings using machine learning in an online game-experiment | Falmagne, Stephenson and Levin (2026), PNAS 123(1). On about 10,900 crowd-built r/place compositions of 2022, gradient-boosted trees over 19 composition-level series predict the time until an image is abruptly overrun: half the overthrows within 20 minutes at 3.6% false positives, far better than generic indicators, and still good on 2023. The precursors are plural (attack outrunning defence, turbulent history, little accepted change, uncoordinated activity, simple images), and about a quarter of overthrows give no warning. | Active — read in full 2026-10-13 (NOTE-731) from the version of record, the CC BY-NC-ND JATS text that Europe PMC serves for PMC12773730 (https://www.ebi.ac.uk/europepmc/webservices/rest/PMC12773730/fullTextXML), with the SI Appendix read from the arXiv preprint (https://arxiv.org/abs/2502.09880), sections 1, 2 and 6 in full and 3–5 skimmed. Worth reading as the one large-sample study of how crowd-maintained images on r/place are overthrown: the defended image is an equilibrium of attack and repair, and its failure has many precursors, several of them about the defending community. It supports CLAIM-280 (THEORY-214), with the qualification that some compositions last through neglect, and makes CLAIM-279’s frame-relativity operational; it does not answer QUESTION-091. |
| LIT-1032 | How Millions Coordinate at Scale: Engagement, Collaboration, and Conflict in Three Editions of Reddit r/place | Wu and Silva (2024; v3 2026), arXiv:2408.13236. Cross-edition statistics for 2017, 2022 and 2023 and a method that recovers coalitions, failed ones included, from the 2017 placement log. Participation stays heavy-tailed under the uniform cooldown. Larger coalitions repaint more redundantly and have less active members. Participants consolidate into large coalitions over the event. Survival is barely predictable from coalition size, area, start time and colour entropy until late. | Active — read in full 2026-10-13 (NOTE-724) from the arXiv PDF, v3 of 13 July 2026 (https://arxiv.org/pdf/2408.13236). Worth reading for the only reconstruction of failed as well as lasting r/place coalitions, and for cross-edition statistics. It supports CLAIM-280 weakly (THEORY-216): lasting artworks are those whose coalitions keep working under overwriting. Its heavy-tailed use of the uniform cooldown qualifies CLAIM-272, because unequal influence begins before any plan directs anyone. It concedes the interaction-level data that QUESTION-084 asks about were not observed. |
| LIT-1034 | Two Ways of Understanding Social Dynamics: Analyzing the Predictability of Emergence of Objects in Reddit r/place Dependent on Locality in Space and Time | Adams, Fernandez and Witkowski (2022), arXiv:2206.03563. Using the 2017 canvas alone, it tallies local cellular-automaton-style rules between 10-minute snapshots and trains a CNN to predict each pixel from its 3×3 neighbourhood. Prediction worsens with horizon and dips mid-event. Objects that spread by recolouring neighbours are predicted, and designs coordinated off the canvas are missed. No baselines or participant data. | Active — read in full 2026-10-13 (NOTE-725) from the arXiv PDF, v2 of 15 June 2022 (https://arxiv.org/pdf/2206.03563). A short, preliminary paper, worth reading only for its one suggestive contrast: on the 2017 canvas, a 3×3 local predictor recovers objects that spread by recolouring neighbours and misses designs coordinated off the canvas (THEORY-224). It has no baselines, and it models no participants, so it does not do what the exchange filed it for, estimating participants’ reach. It is a pointer for QUESTION-084 and QUESTION-093, not evidence on them. |
| LIT-1037 | Instruction vs. emergence on r/place: Understanding the growth and control of evolving artifacts in mass collaboration | Litherland and Mørch (2021), Computers in Human Behavior 122. A mixed-methods case study of the 2017 Mona Lisa and its forum. The design was set and revised in the forum through linked blueprints and negotiation with neighbouring communities, gated by a few central members, and placed by about 77,000 accounts. Image and forum evolve as interdependent artifacts. “Instruction” (Reddit’s rules, top-down) and emergence (bottom-up) are framed as complementary controls on complexity. | Active — read in full 2026-10-13 (NOTE-733) from the publisher’s CC BY PDF deposited as the published version by the University of Oslo in the Norwegian research archive (DUO handle http://hdl.handle.net/10852/86918, resolving to https://nva.sikt.no/registration/0198cc58d5aa-ec8dd620-880a-4a49-8839-aaa8bf137792); the article is also open access at ScienceDirect. Worth reading as the only r/place study that reads the forum beside the canvas. For one artwork it shows the design decided off the canvas by negotiation, gated by a few central members, and carried out by tens of thousands of placers (THEORY-218). That supports CLAIM-272 and CLAIM-279 and answers QUESTION-084 in part. Its “instruction” is Reddit’s rules, not planners’ instructions. |
| LIT-1038 | Quantifying causal emergence shows that macro can beat micro | Hoel, Albantakis and Tononi (2013), PNAS 110(49). Effective information, the mutual information between uniformly imposed interventions and their effects, equals effectiveness (determinism minus degeneracy) times the log of the state-space size. Coarse-graining always loses size and can gain effectiveness, so in four toy systems of logic gates a macro description carries 0.40 to 2.92 bits more than the micro it supervenes on. The claim that the EI peak is where causation happens rests on the uniform intervention distribution imposed at each level. | Active — read in full 2026-10-13 (NOTE-726) from the PubMed Central PDF of the published article (PMC3856819, pmc.ncbi.nlm.nih.gov/articles/PMC3856819/pdf/pnas.201314922.pdf), fetched through the Internet Archive capture of 2022-11-13 because PMC answered scripted requests with a reCAPTCHA page and pnas.org returned 403; the online Supporting Information was not read. Worth reading as the source of effective information as a measure of causal emergence: it shows exactly when a coarse-grained description of a known mechanism can carry more EI than the micro, and its macro advantage rests on imposing a uniform intervention distribution at each level. For QUESTION-093 it is an interventional criterion met with no closure and no self-individuation; it complements CLAIM-154 and THEORY-133 and is neither a case nor a rival of them; it measures a different object from the information-decomposition account of LIT-025. |
| LIT-1122 v2 | Multiple time-scales and the developmental dynamics of social systems | Flack (2012). In one captive group of pigtailed macaques, peaceful subordination signals reverse about two orders of magnitude more rarely than fight outcomes, so the signalling network, and the power distribution computed from it, are slow, predictive coarse-grained variables. That individuals read and use them, and that this founds a new level of organization, is argued from earlier studies and stated as what the data suggest. | Active — read 2026-10-29 (NOTE-1351) in full, from the publisher’s version in PubMed Central (PMC3367696, CC BY) as Europe PMC full-text XML; worth reading as the short statement of the slow-variable idea on one primate group: subordination signals that change about two orders of magnitude more slowly than fight outcomes, and power read from them. Read it knowing that the animals’ use of these variables is what “the data suggest”, argued from earlier studies and not tested here, that the timescale of power is not measured, and that its stated 165-fold ratio does not follow from the counts it gives (about 128 to 150). |
| LIT-1123 v2 | Engineering Emergence | Jansma & Hoel (2025). Scores every partition of a Markov chain’s states by CP minus the best CP of any finer partition; the partitions with positive gain form an emergent hierarchy, top-heavy, bottom-heavy or spread, whose spread peaks near linear preferential attachment in 40-state networks, and cycles can confine it to one chosen scale. | Active — read 2026-10-29 (NOTE-1359) in full, from arXiv’s own copy (v2); worth reading as the extension of causal emergence 2.0 (LIT-1136) from one path to the whole partition lattice of a Markov chain’s states, where a partition counts if its CP beats every finer partition’s, and the survivors form an “emergent hierarchy” whose spread is tied to preferential attachment and can be engineered to a single scale with cycles. Read it knowing that it searches partitions of one system’s states, not system–environment boundaries, prices nothing, drops CE 2.0’s consistency filter on “data not shown”, rests on 5- to 8-state enumerations and a 40-state greedy sampler, and that one of Figure 2’s CP values (0.13) does not follow from its own determinism and degeneracy (0.24 − 0.09). |
| LIT-1126 v2 | Computational Mechanics: Pattern and Prediction, Structure and Simplicity | Shalizi & Crutchfield (2001). For a known stationary discrete process, causal states, the classes of pasts with the same distribution over the whole future, are as predictive as the full past and are the unique minimal such states; their entropy, the statistical complexity Cµ, is at least the excess entropy. Minimality is relative to predicting the entire future. | Active — read 2026-10-29 (NOTE-1372) in full, from arXiv’s own copy (v2); worth reading for the proofs that a stationary process’s causal states are maximally predictive, minimal, unique up to measure zero and minimally stochastic among predictive states, and that their entropy Cµ bounds the excess entropy E from above. Read it knowing that minimality holds only for predicting the whole future (for a finite horizon a coarser state can do as well), that the theorems assume the joint distribution known, a discrete stationary time series and prediction from its own past, and that “causal” means Humean succession, with nothing on interventions or estimation from data. |
| LIT-1127 v2 | Aggregation of Variables in Dynamic Systems | Simon (1961). In nearly decomposable linear systems, short-run dynamics are governed within subsystems and long-run dynamics by interactions among their aggregates, which justifies aggregating variables over the long run. | Unavailable — filed 2026-10-16, not read. On 2026-10-19, at the owner’s request to read it first among the works of the exchange on coarse-to-fine processes, a search for a lawful full text reached none. JSTOR (stable 1909285) returned a block page instead of the PDF. The Econometric Society’s page gives the abstract only and sends full text to JSTOR institutional access. OpenAlex reports it closed with no repository copy, and Semantic Scholar does not index the DOI. The two reprints are not open: Ando, Fisher and Simon, Essays on the Structure of Social Science Models (1963), is on the Internet Archive as a lending-only item, and Simon’s Models of Discovery (1977, ch. 12) is a paywalled Springer chapter. Carnegie Mellon’s digital collections returned 503. A title search found no author-posted copy. It stays Unavailable until a copy is supplied. No NOTE is filed. |
| LIT-1128 v2 | Nonequilibrium phase transition in the coevolution of networks and opinions | Holme & Newman (2006). Agents either rewire an edge to a random holder of their own opinion (probability φ) or adopt a neighbour’s opinion; the network always ends as disconnected one-opinion communities, and a continuous transition at a critical φ separates a regime with one giant community (low φ) from one with only small communities of mean size N/G (high φ), with non-percolation exponents and critical slowing down. | Active — read 2026-10-29 (NOTE-1385) in full, from arXiv’s own copy (v3); worth reading as perhaps the simplest model in which opinions and ties adapt to each other, rewiring to a like-minded agent with probability φ or copying a neighbour otherwise, which always freezes into like-minded components and has a continuous transition at φ_c ≈ 0.458 (k̄ = 4, γ = 10) between one giant community and only small ones, outside the percolation class. Read it knowing that it is simulation only (N ≤ 3200), that its opinions are unweighted labels with no influence or authority, that its dynamics is absorbing, and that the summary filed with it was wrong: no mixed groups form. |
| LIT-1129 v2 | Dynamical Reversibility and A New Theory of Causal Emergence based on SVD | Zhang et al. (2024). Measures approximate dynamical reversibility of a Markov chain by Γ_α = Σσᵢ^α of its TPM, bounds EI by affine functions of log Γ_α, and defines causal emergence as the rise in average singular value when those at or below a threshold ε are cut: a rank test at ε = 0, threshold-relative above it. | Active — read 2026-10-29 (NOTE-1399) in full, from arXiv’s own copy (v6, with the supplement and proofs); worth reading for Γ_α = Σσᵢ^α as a measure of how near a transition matrix is to a permutation, the bounds log Γ_α − log N ≤ EI ≤ (2/α) log Γ_α, and causal emergence read off the spectrum as the gain in average singular value when values at or below ε are dropped. Read it knowing that with ε > 0 the measure depends on ε and is positive at some ε for every matrix whose singular values are not all equal, so “independent of coarse-graining” holds only for the rank test; that its Proposition 5, that its lumping commutes with the dynamics for any grouping, is false; and that the equivalence with EI maximization rests on Hoel’s Boolean-network examples. |
| LIT-1132 v2 | Irruption Theory in Phase Transitions: A Proof of Concept With the Haken-Kelso-Bunz Model | Sánchez-Cañizares (2024). Uses the Haken–Kelso–Bunz model to illustrate phase transitions that change the number of a system’s attractors, as a proof of concept for irruption theory. | Unavailable — searched 2026-10-29 for a lawful full text and none was reached, so it is not read and no NOTE is filed. OpenAlex (2026-10-29) reports it closed, with no repository copy; Crossref lists only Sage’s text-and-data-mining licence and the Sage PDF and XML, which are subscription access, and journals.sagepub.com returned 403 to this client. The Universidad de Navarra research portal (portalcientifico.unav.edu, document 6678c8b53974ce515cb01bfc) holds a metadata record with no full text and no Dadun deposit; Dadun’s own search API returned 403, so a deposit there was not ruled out. Europe PMC has no record, and web searches found no preprint, PhilArchive or PhilSci copy, or author-posted copy. The author’s 2026 follow-up, “Decision-making through irruption theory: how to use and interpret the Haken-Kelso-Bunz model” (Phenomenology and the Cognitive Sciences, doi 10.1007/s11097-026-10164-0), is listed as open access and may cover the same ground; it is not this work. It stays Unavailable until a copy is supplied. |
| LIT-1136 v2 | Causal Emergence 2.0: Quantifying emergent complexity | Hoel (2025). Along a chosen path of dynamically consistent coarse-grainings of a Markov chain, each step’s gain in CP (normalized determinism minus degeneracy, uniform interventions at each scale) is that scale’s causal contribution; causal emergence is the total gain and emergent complexity the entropy of the gains. Shown on three 8-state chains; the all-paths version is left open. | Active — read 2026-10-29 (NOTE-1387) in full, from arXiv’s own copy (v3); worth reading as the paper that recasts Hoel’s causal emergence as gains in causal primitives (determinism minus degeneracy, the effectiveness, which is EI without its size term) credited to each scale along a micro→macro path of consistent coarse-grainings, with the entropy of those gains as “emergent complexity”. Read it knowing that it is shown on three hand-built 8-state chains with no TPM printed, that the multi-path version is left open (LIT-1123 takes it up), that its claim to capture all macroscale causation rests on one manipulated family, and that its degeneracy formula is misprinted as 1 − H(E|C)/log₂ n. |
| LIT-1137 v2 | The information theory of individuality | Krakauer et al. (2020). Individuals as aggregates that propagate information from their past into their future, scored by decomposing I(S_n, E_n; S_{n+1}) into organismal (A*), colonial (A) and environmentally determined (nC) parts. A* and A never fall as the candidate grows, so boundaries need a size cost the paper does not give. | Active — read 2026-10-29 (NOTE-1400) in full, in the version of record (Europe PMC, CC BY) and the 2014 arXiv preprint; worth reading for the two decompositions of a system’s one-step predictive information, A* + nC = I(S_{n+1}; E_n) + A, read as organismal (A*), colonial (A) and environmentally determined (nC) individuality, with the closure-implies-sufficiency lemma. Read it knowing that A* and A cannot decrease as the candidate system is enlarged, so they cannot find a boundary (THEORY-1163), which the 2020 version concedes by calling for a size cost it does not supply; that its partial information decomposition is left unspecified; that it offers one two-unit example and no algorithm; and that the 2014 preprint differs from the article in names, authors’ order and content. |
| LIT-1139 v2 | Adaptive coevolutionary networks: a review | Gross & Blasius (2008). Reviews networks whose topology and node states coevolve and names four recurrent outcomes: robust self-organization toward critical states from local rules, spontaneous division of labour into distinct node classes, complex topologies, and complex system-level dynamics such as bistability and oscillation; it conjectures one mechanism, dynamics making global topology locally visible. | Active — read 2026-10-29 (NOTE-1394) in full, from arXiv’s own copy (v2, after acceptance); worth reading as the review that named adaptive networks and their four recurrent outcomes: robust self-organization to criticality by local rules, spontaneous division of labour into node classes, complex topologies, and new system-level dynamics such as bistability and oscillation in an adaptive epidemic, with a first inventory of rules and outcomes. Read it knowing that its results are reported rather than checked, that its common mechanism is conjecture, that it has no model with authority or roles, and that its summary of Holme and Newman (LIT-1128) inverts the parameter φ and its account of Bornholdt and Rohlf reverses one sentence. |
| LIT-1145 v2 | Linking fast and slow: The case for generative models | Medrano, Friston & Zeidman (2024). A review arguing that multiscale neuronal time series are best tested with hierarchical generative models whose levels are slower timescales, licensed by centre-manifold and adiabatic reduction (Haken’s slaving principle, illustrated by the HKB model in prose) and compared by free energy; adiabatic DCM is the worked example. | Active — read 2026-10-29 (NOTE-1383) in full, in the version of record (Europe PMC, CC BY); worth reading as a primer on testing slow change in fast neuronal data with hierarchical generative models, each level a slower timescale, justified by centre-manifold and adiabatic reduction and compared by variational free energy, with adiabatic DCM as the example. Read it knowing that it is a review of its authors’ methods, that it states the slaving principle and the Haken–Kelso–Bunz model in a paragraph each with no equations, that its levels are slower by the modeller’s construction, and that its extension of the slaving principle to HMMs is asserted. |
| LIT-1162 | Quantifying unique information | Bertschinger, Rauh, Olbrich, Jost & Ay (2014), Entropy 16(4): 2161–2183, ARXIV-1311.2852. For a target X and sources Y, Z, defines the unique information of Y as the minimum of MI_Q(X:Y|Z) over Δ_P, the joint distributions with the same (X,Y) and (X,Z) marginals as P; shared and synergistic information follow from the consistency equations. If unique information depends only on the pair marginals, these functions bound every other such measure (Lemma 3). The unique information is zero exactly when Z is Blackwell-sufficient for Y with respect to X (Lemma 6, Corollary 7). The three measures are non-negative, satisfy the bivariate PI axioms and the identity property, and are computed by a convex programme. They do not extend to three or more sources on the PI lattice. | Active — read in full 2026-10-17 (NOTE-937); worth reading as the bivariate partial information decomposition that the redundancy-measure-dependent numbers in the record can be checked against: unique information is the minimum of the conditional mutual information over all joints with the same source–target pair marginals, so it vanishes exactly when Blackwell’s order says the other source knows everything this one does, and synergy is what the pair marginals cannot reveal. Read it knowing that it is bivariate only (it cannot be extended to the PI lattice for three sources, by its own §6), that its optimisation is ill-conditioned in practice (Example 31), and that Table 1’s Unq and Copy rows conflict with its own Proposition 18. Filed as THEORY-705. |
| LIT-1165 | Information Flows? A Critique of Transfer Entropies | James, Barnett & Crutchfield (2016), Physical Review Letters 116, 238701, ARXIV-1512.06479. Defines information flow from X to Y as information in Y attributable solely to X’s past, and shows with two XOR processes that transfer entropy is not it. With Y_t = X_{t−1} ⊕ Y_{t−1}, T_{X→Y} = 1 bit, yet the bit is jointly carried by both pasts (co-information −1). With Z_t = X_{t−1} ⊕ Y_{t−1}, both transfer entropies are 0 and the causation entropies are 1 bit each. By PID, transfer entropy is unique plus synergistic information; only the unique part is a candidate for flow. Conditioning is not subtraction. | Active — read in full 2026-10-17 (NOTE-945); worth reading as the short, exact case that transfer entropy is not a measure of information flow: in two XOR processes it credits a bit to a source that holds none of it alone, and reports zero for sources that jointly fix the target. Read it knowing that “flow” is defined by the authors as information solely attributable to one source’s past, that the cure it points to (unique information) has no agreed measure, and that its conjecture that directed information and Ay and Polani’s interventional flow fail the same way is a conjecture. Filed as THEORY-707. |
| LIT-1167 | Information transfer in continuous processes | Kaiser & Schreiber (2002), Physica D 166(1–2): 43–62. Carries transfer entropy from coarse-grained states to continuous-valued processes and discusses its estimation. Unread; known through Barnett, Barrett and Seth, who cite it for the conditional transfer entropy, for the failure of partition estimators to converge, for the assumptions hidden in kernel and nearest-neighbour estimators, for the invariance of information quantities under nonlinear transformations, and for a Gaussian formula (its Eq. 19). | Unavailable — unread, registered 2026-10-17. A lawful copy was sought and not reached: Crossref lists only the Elsevier (ScienceDirect) copy, and web searches found no author-posted, repository or course-hosted copy. A 2002 Wuppertal dissertation by Andreas Kaiser on nonlinear coupling measures is openly hosted but is a different work, and was not read in its place. Known through Barnett, Barrett and Seth (LIT-1171), which cite it for the conditional definition, for estimator problems and for a Gaussian formula, until a copy is supplied. |
| LIT-1168 v2 | A Bivariate Measure of Redundant Information | Harder, Salge & Polani (2013), Physical Review E 87, 012130, ARXIV-1207.2080. I_min gives 1 bit of redundancy when Z = (X, Y) copies two independent uniform bits, because it compares how much each source tells about an outcome and not what. The paper adds an identity axiom, I∩((X,Y); X, Y) = I(X; Y), and defines a bivariate I_red as the smaller of two projected informations, each source’s specific information less what remains after projecting its posteriors onto the convex hull of the other’s. I_red satisfies symmetry, self-redundancy, monotonicity and identity, and its PID is nonnegative. It agrees with I_min on XOR, AND, RdnXor and XorAnd, and differs on copying, where it tracks I(X; Y). On transfer entropy it agrees with I_min for Williams and Beer’s coupled pair but reverses the state-independent/state-dependent split for a process with an independent bystander. | Active — read in full 2026-10-17 (NOTE-944); worth reading as the paper that shows I_min is not a measure of shared information, since it gives two independent bits copied into the target 1 bit of redundancy, and that replaces it, for two sources, with I_red, a redundancy built from reverse information projections that satisfies Williams’s three axioms plus an identity axiom, I_red((X,Y); X, Y) = I(X; Y). Read it knowing that the measure is bivariate only, that “mechanistic redundancy” lets independent sources share information (the AND gate keeps I_min’s 0.311 bit), that the Imin-upper-bound pattern is observed in random distributions with exceptions left unexplained, and that its transfer-entropy example shows the two measures can split the same transfer entropy oppositely. Filed as THEORY-708. |
| LIT-1170 | Measuring Autonomy and Emergence via Granger Causality | Seth (2010), Artificial Life 16(2): 179–196. Defines G-autonomy, the log ratio of a variable’s prediction-error variance without and with its own past, given external variables, and G-emergence, a macro variable’s G-autonomy from micro variables times their mean Granger causality on it, so that it is zero if the macro variable is independent of the micro or fully predicted by them. In a predator–prey model an evolved controller has higher G-autonomy than a reactive rule; in a boids model, flocking has higher G-emergence and more macro-to-micro Granger causality than random or rigid motion. Measures are linear or Taylor-expanded nonlinear regressions. | Active — read in full 2026-10-16 (NOTE-935); worth reading as the source of G-emergence, the Granger-based measure the causal-emergence readings name as a rival (NOTE-726, NOTE-791, NOTE-010). Read it knowing that its measures are predictive and relative to a regression model and a variable set, as Seth himself says (§5.2), so that “downward causation” here means Granger causation from a macro variable to micro variables, and that the validation is two agent-based models with hand-chosen conditions. Filed as THEORY-703. |
| LIT-1172 | Nonnegative Decomposition of Multivariate Information | Williams & Beer (2010), arXiv preprint, ARXIV-1004.2515. Defines redundancy as I_min(S; A₁…A_k) = Σ_s p(s) min_i I(S = s; A_i), the expected minimum specific information any source gives about each outcome. Restricted to antichains of sources and ordered by α ≼ β iff every source in β contains one in α, the collections form a redundancy lattice (18 nodes for three sources). The Möbius inverse of I_min on it gives partial-information atoms, proved nonnegative, that sum to I(S; R): for two sources, redundancy, two unique terms and synergy. Interaction information is shown to be synergy minus redundancy for three variables and a signed mixture of seven kinds of atom for four, which is why it can be negative and why it gives +1 bit both to 3-parity and to three copies. | Active — read in full 2026-10-17 (NOTE-936); worth reading as the source of the partial information decomposition the record already leans on through Williams and Beer (2011), Varley and Hoel, the ΦID review and the Shannon-invariants paper: the redundancy lattice of antichains, the Möbius inversion that turns any redundancy function into nonnegative-by-construction atoms once that function is monotone on the lattice, and the I_min redundancy measure. Read it knowing that the lattice and the inversion are general while every number is I_min’s, that I_min credits independent sources with redundancy whenever they reduce surprise about the same outcomes (Harder, Salge and Polani, LIT-1168), and that it is an unrefereed arXiv preprint. Filed as THEORY-706. |
| LIT-1175 | Local information transfer as a spatiotemporal filter for complex systems | Lizier, Prokopenko & Zomaya (2008), Physical Review E 77, 026110, ARXIV-0809.3275. Transfer entropy is the average of a local quantity t_{Y→X}(n+1) = log p(x_{n+1} | x⁽ᵏ⁾n, y_n)/p(x{n+1} | x⁽ᵏ⁾_n), which can be negative where the source misleads. Apparent transfer entropy conditions on the destination’s past; complete transfer entropy also conditions on the destination’s other causal parents. Applied to elementary cellular automata with long destination histories (k ≥ 6, up to 16), both highlight gliders (rule 110) and domain walls (rule 18) as the dominant information-transfer structures; in rule 18’s domain, complete transfer entropy is about 1 bit at alternate sites where apparent transfer entropy is zero. | Active — read in full 2026-10-16 (NOTE-943); worth reading as the source of local transfer entropy, the pointwise log ratio whose average is Schreiber’s transfer entropy, and of the split between apparent transfer entropy (conditioned on the destination’s past only) and complete transfer entropy (conditioned also on the other causal parents). Read it knowing that its evidence is elementary cellular automata, where the causal parents are known by construction; that “complete” needs that knowledge; that the destination history k must be long (k ≥ 6 for rule 110, k = 16 used) and is limited by sample size; and that its closing claim to establish transfer entropy as the measure of information transfer predates the critique of James, Barnett and Crutchfield (LIT-1165). Filed as THEORY-702. |
| LIT-1176 | Generalized Measures of Information Transfer | Williams & Beer (2011), arXiv preprint, ARXIV-1102.1507. With the I_min partial information decomposition, T_{Y→X} = I(X_{t+1}; Y_t | X_t) splits into the unique information from Y_t (state-independent transfer, SITE) and the synergy of X_t and Y_t (state-dependent transfer, SDTE). SITE alone gives perfect open-loop controllability (Theorem 1). Time-delayed mutual information adds the redundancy and omits SDTE. For two sources, transfer splits into unique, redundant and synergistic parts. Demonstrated on binary Markov processes and a sleep-apnoea recording, where heart→breath transfer is entirely state-dependent. | Active — read in full 2026-10-17 (NOTE-942); worth reading as the decomposition that the critique of transfer entropy (LIT-1165) stands on: under the Williams–Beer partial information decomposition, transfer entropy is the source’s unique information about the target’s next state plus its synergy with the target’s past, which the authors call state-independent and state-dependent transfer, and a multivariate transfer entropy splits into unique, redundant and synergistic transfer. Read it knowing that every number depends on the I_min redundancy measure, that the PID it applies is Williams and Beer 2010 (LIT-1172), whose I_min is contested (LIT-1168, LIT-1162), that it is an unrefereed arXiv preprint, and that its text swaps two parameter settings in the three-process example. Filed as THEORY-712. |
| LIT-1177 | Measuring Information Transfer | Schreiber (2000), Physical Review Letters 85, 461, ARXIV-nlin/0001042. Defines the transfer entropy T_{J→I} = Σ p(i_{n+1}, i_n^{(k)}, j_n^{(l)}) log[p(i_{n+1} | i_n^{(k)}, j_n^{(l)}) / p(i_{n+1} | i_n^{(k)})], the Kullback entropy of assuming that I’s transitions do not depend on J’s past, with history lengths k and l (“most natural” l = k or l = 1). Unlike time-delayed mutual information it is directional and zero for static correlation. In a tent-map lattice it is O(ε²) in the coupling while time-delayed MI is zero, and in an Ulam-map lattice it shows the coupling’s direction where time-delayed MI does not. | Active — read in full 2026-10-17 (NOTE-940); worth reading as the four-page source of transfer entropy, which the record uses in seven documents without holding it: T_{J→I} is the Kullback entropy of the transition probabilities of I with and without the past of J, at history lengths k and l that the definition leaves open. Read it knowing that “information transfer” and “exchange” are the paper’s words for a conditional mutual information, that common inputs are excluded only when they are known and conditioned on, that the continuum-limit claim is asserted, and that the evidence is two coupled-map lattices and one physiological pair, the last of which Schreiber himself says a common trigger could explain. Filed as THEORY-701. |
| LIT-1201 | Measuring multivariate redundant information with pointwise common change in surprisal | Ince (2017), Entropy 19(7): 318, ARXIV-1602.05063. Defines I_ccs, a redundancy for any number of sources: under the maximum-entropy joint P̂ that matches every source–target marginal and the joint source marginal, take the expectation of the local co-information over only those events where every source’s local information, the joint source’s and the co-information have the same sign. It satisfies symmetry, self-redundancy, subset equality and an “independent identity” (independent sources copied into the target share nothing), but not Harder et al.’s identity, monotonicity or non-negative atoms; Table 7 has unique information −0.16 bit. Argues from a game-theoretic operational definition that unique information depends on the source–source marginal, against Bertschinger et al. On three sources it accepts the negative atoms of XORCOPY and DBLXOR as “mechanistic redundancy”. | Active — read 2026-10-17 (NOTE-968): definitions, properties, the operational argument and every worked example in full, the Gaussian section and the discussion at lower resolution. Worth reading as the multivariate redundancy measure that gives up non-negativity rather than identity: I_ccs counts only the pointwise co-information terms where every source, the joint source and the overlap change the surprisal of the target in the same direction, under the maximum-entropy joint that preserves source–target and source–source marginals. It satisfies symmetry, self-redundancy, subset equality and an independent-sources identity, and not Harder et al.’s identity, monotonicity or non-negative atoms. Read it knowing that its game-theoretic case against Bertschinger et al. is an argument about what unique information should mean, not a proof that their measure is wrong; that continuity is conjectured; that the “correct” PIDs it reports are judged against intuition; and that it accepts the −1-bit atom Rauh et al. prove some measure must produce. Filed as THEORY-714. |
| LIT-1203 | Intersection Information Based on Common Randomness | Griffith, Chong, James, Ellison & Crutchfield (2014), Entropy 16(4): 1985–2000, ARXIV-1310.1538. Proposes I_∧(X_1, …, X_n : Y) = I(X_1 ∧ … ∧ X_n : Y), the information about Y in the Gács–Körner common random variable of the sources, and a zero-error variant H(X_1 ∧ … ∧ X_n ∧ Y). I_∧ is defined for any n, satisfies global positivity, equivalence-class invariance, target monotonicity (the first measure to, by its own account), weak monotonicity, weak symmetry, a lower bound and self-redundancy, and lies below I_min. It fails identity and local positivity: it is zero whenever the sources have full support, so it gives −0.99 bit of synergy in ImperfectRdn. The zero-error variant satisfies identity but gives −0.252 bit of synergy in Subtle. | Active — read in full 2026-10-17 (NOTE-967); worth reading as the measure of redundancy built from the Gács–Körner common random variable, I_∧(X_1, …, X_n : Y) = I(X_1 ∧ … ∧ X_n : Y), defined for any number of sources, the first to satisfy target monotonicity, and by construction a lower bound on any reasonable redundancy. Read it knowing that it is zero whenever the sources’ joint distribution has full support, so it is discontinuous and fails the identity property, that its synergy goes negative (−0.99 bit in ImperfectRdn, −0.252 in Subtle), and that its zero-error variant, which satisfies identity, goes negative too. It is the formal version of the view that only correlation between the sources makes redundancy. Filed as THEORY-715. |
| LIT-1204 | Quantifying synergistic mutual information | Griffith & Koch (2014), in Guided Self-Organization: Inception (Springer), pp. 159–190, ARXIV-1205.4265. Synergy is the whole minus the union of its parts: S_VK = I(X_1…n : Y) − I_VK, with I_VK the minimum of I*(X_1…n : Y) over joints that keep every Pr(X_i, Y). S_VK lies between max(0, WholeMinusSum) and Williams and Beer’s S_max, and the paper shows on binary circuits that S_max counts two unique bits as synergy (Unq), WholeMinusSum subtracts redundancy (RdnXor), and correlational importance ΔI is not bounded by the mutual information and drops when a predictor is duplicated. Versions 1–2 held that independent predictors carry no redundant information; v6 withdraws this, showing redundancy at least 0.082 bit in AND. | Active — read in full 2026-10-17 (NOTE-966), arXiv v6, with v1 and v2 checked for the passage that changed; worth reading as the “whole minus union” account of synergy, S_VK = I(X;Y) − I_VK, where the union information I_VK is the least I(X;Y) over joints with every source–target marginal fixed, and as the source of the early position, quoted by Harder, Salge and Polani, that independent sources carry no redundant information. Read it knowing that v6 withdraws that position (Fig. 11’s note), that for two sources I_VK is the same optimisation as Bertschinger et al.’s, so S_VK is their synergy CI and the paper’s open AND value is 0.5 bit, that several properties of the derived intersection measure are not proved, and that the bound S_VK ≤ S_max rests on a step the reading could not reconstruct. Filed as THEORY-716. |
| LIT-1230 v2 | The Minimum Environmental Perturbation Principle: A New Perspective on Niche Theory | Marsland, Cui & Mehta (2020). Generalizing MacArthur’s result that stable equilibria optimize a quadratic function, it shows that in a broad class of contemporary-niche-theory models the equilibrium minimizes the perturbation the competing species impose on their environment, subject to no species having positive net growth, and states when such a principle exists. | Active — read 2026-10-29 (NOTE-1352) in full, from arXiv 1901.09673v4; worth reading as the general form, for symmetric niche models, of the identity that uninvadable equilibria solve a constrained optimization, with the environment’s perturbation from its supply point as the objective and species abundances as KKT multipliers, and MacArthur’s principle as its dual. Read it knowing that symmetry is the hinge, that the asymmetric extension needs the answer to build its objective, and that the monotone-assembly result needs monostability. |
| LIT-1232 v2 | On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport | Chizat & Bach (2018). Training a sum of many parameterized units by gradient descent is, in the many-particle limit, a Wasserstein gradient flow on the measure over unit parameters. A measure is a global minimizer iff the first variation of the objective is nonnegative everywhere and zero on its support; under homogeneity and an initialization whose support separates the domain, limits of the flow are global minimizers. NeurIPS 2018. | Active — read 2026-10-29 (NOTE-1367), the main paper in full and the supplement in part, from arXiv 1805.09545v2; worth reading here for its optimality condition on measures, first variation nonnegative everywhere and zero on the support, which is uninvadability, and for its escape argument, in which mass where the first variation is negative grows exponentially. Read it knowing that its theorems assume the flow converges, need an initialization that seeds every direction and so infinitely many particles, and give no rates; the 1-homogeneous proofs and the many-particle-limit proofs were not read. |
| LIT-1234 v2 | Ecological communities with Lotka-Volterra dynamics | Bunin (2017). For a community assembled by migration from a pool of S species with random Lotka–Volterra interactions (mean μ/S, variance σ²/S, symmetry γ), the cavity method gives exact large-S results where a unique uninvadable fixed point exists: abundances are a Gaussian truncated at zero, and that phase ends at σ = √2/(1 + γ) for equal carrying capacities, independent of μ. Beyond lies a multiple-attractor phase in which, by simulation, the community reached depends on history. | Active — read 2026-10-29 (NOTE-1397) in full, from the published PDF on the author’s Technion page; worth reading as the clean cavity solution of the random generalized Lotka–Volterra community assembled from a species pool: a truncated-Gaussian abundance distribution, the surviving fraction, and a loss of the unique fixed point at σ = √2/(1 + γ) for equal carrying capacities, whatever the mean interaction. Read it knowing that the multiple-attractor phase beyond that line is located, not solved, and that its history dependence is shown by repeated simulation only. |
| LIT-1235 v2 | What can ecosystems learn? Expanding evolutionary ecology with learning theory | Power et al. (2015). In a competitive Lotka–Volterra community, individual selection lowers species i’s sensitivity to species j at a rate proportional to x_i x_j, which with a normalising trade-off on each species’ total competition is Hebbian learning. Simulated with symmetric interactions, the community comes to hold attractors for two past forcing patterns, completes them from fragments and switches with hysteresis; in the long run the memory degrades. | Active — read 2026-10-29 (NOTE-1368) in full, from the publisher’s version in PubMed Central (PMC4672551) with its erratum; worth reading as the model in which individual selection on competitive interactions acts like Hebbian learning, so that a community with no community-level selection comes to hold and recall several past compositions. Read it knowing that the memory needs an imposed trade-off that fixes each species’ total competition, that simulations keep interactions symmetric, that the two-memory state collapses in the long run, and that its printed equations (1) and (10)–(11) are wrong as printed. |
| LIT-1236 v2 | Phase Transition to Chaos in Complex Ecosystems with Nonreciprocal Species-Resource Interactions | Blumenthal, Rocks & Mehta (2024). In MacArthur’s consumer–resource model with species’ benefits from and impacts on resources correlated by ρ, the cavity method’s steady state loses stability when ρ falls below ρ*, with ρ*² = (surviving species)/(non-depleted resources) at the boundary; below it simulations show chaotic dynamics with positive Lyapunov exponents. With ρ = 1 competitive exclusion keeps the ratio at most 1 and the transition never occurs. | Active — read 2026-10-29 (NOTE-1366) in full, from arXiv v2 (the letter and its supplement); worth reading as the result that in MacArthur’s consumer–resource model with benefits and impacts correlated by ρ the cavity fixed point loses stability at ρ*² = surviving species over non-depleted resources, a boundary the symmetric model never reaches (THEORY-1162). Read it knowing that the boundary rests on a replica-symmetric ansatz, that the chaos beyond it is shown by simulation at a few parameter points, and that the letter’s fast-resource formula carries a stray R_α. |
| LIT-1240 v2 | Information Bottlenecks, Causal States, and Statistical Relevance Bases: How to Represent Relevant Information in Memoryless Transduction | Shalizi & Crutchfield (2002; arXiv 2000). A three-page note. For memoryless transduction, the causal states group inputs by Pr(Y|X = x). Among the partitions that keep all information about Y they have the least entropy. The note asserts, without proof, that the information bottleneck delivers them as β → ∞, and that Salmon’s statistical relevance basis is the same construction, the minimal sufficient partition. It says nothing about the bottleneck’s solutions at finite β. | Active — read 2026-10-20 (NOTE-976) in full, from arXiv:nlin/0006025v1; worth reading for the identification, in the finite memoryless case, of three constructions as one partition: the inputs grouped by Pr(Y|X = x), which are the information bottleneck’s β → ∞ end, computational mechanics’ causal states and Salmon’s statistical relevance basis. Read it knowing that it is a three-page note that proves none of the identifications. It calls the IB limit “evident” and defers the Salmon proofs. It treats the IB optima as partitions, which at finite β they are not. It misstates the IB’s marginal trade-off of 1/β as a global exchange rate. And it says nothing about the IB solutions at finite β or whether they nest. The record proves the limit and the factoring of every finite-β optimum through the causal states (THEORY-743). |
| LIT-1241 v2 | Simon-Ando Decomposability and Fitness Landscapes | Shpak, Stadler, Wagner & Altenberg (2004). States Simon and Ando’s theorem on nearly decomposable linear systems, without proof and without rates, as four time windows separating within-block relaxation, block quasi-equilibrium, aggregate cross-block dynamics and global equilibrium. It applies an entrywise version of the condition to mutation–selection and recombination on fitness landscapes. Point mutation meets it at low mutation rates, trivially, and recombination rarely does. It concludes that Simon–Ando aggregation is one route to a dynamically sufficient aggregate, independent of exact aggregation by symmetry and of character aggregation under linkage equilibrium. | Active — read 2026-10-20 (NOTE-977) in full, from arXiv:q-bio/0403030v1; worth reading for the record’s only open statement of Simon and Ando’s (1961) theorem (Theorems 2.1, 2.2a and 2.2b: block-diagonal A* plus εC, the four time windows T0 < T1 < T2 < T3, and the aggregate Â_IJ = Σ_{i∈I}Σ_{j∈J} A_ij ν*_jJ), for its four-stage account of when a nearly decomposable system is decomposable, aggregable or both, and for its conclusion that quasi-equilibrium, symmetry (equitable partitions) and linkage equilibrium are independent routes to a dynamically sufficient aggregate. Read it knowing that the theorem is quoted without proof and states no rate in ε and no bound on aggregation error; that the landscape “Simon–Ando condition” is an entrywise proxy, met trivially at low mutation rate even on a flat landscape where there is no time-scale separation; that its leading-eigenvector statement fails when block leading eigenvalues coincide, the stochastic case it invokes; and that (6.2b) is wrong for radius κ ≥ 2. Published as Theory in Biosciences 123(2):139–180 (2004), doi:10.1016/j.thbio.2004.04.001. |
| LIT-1242 v2 | Aggregation of Variables and System Decomposition: Applications to Fitness Landscape Analysis | Shpak, Stadler, Wagner & Hermisson (2004). Separates aggregation of variables, a lower-dimensional map whose dynamics close and which may depend on every microvariable, from decomposition of a system into subsets of variables, and treats systems that are both as a special case, with applications to fitness landscapes. | Active — read 2026-10-20 (NOTE-979) in full, from the authors’ manuscript in Leipzig University’s repository; worth reading for the distinction between aggregation (a closed lower-dimensional description) and decomposition (non-interacting subsets), for the exact condition under which a partition’s block sums close in a linear system (column-equitability, THEORY-755), and for its application to fitness landscapes, exact for one or two peaks and not for three. Read it knowing that it treats exact aggregation only, paraphrases Simon–Ando without an error bound, states Result 1.1 in a form that fails for some real 2×2 matrices, and overstates in its discussion that every linear aggregation is an equitable partition. |
| LIT-1244 v2 | Reconciling emergences: An information-theoretic approach to identify causal emergence in multivariate data | Rosas et al. (2020). Defines causal emergence of a supervenient feature V as unique information about the system’s future that no group of k parts holds, Un⁽ᵏ⁾(V_t; X_t′ | X_t) > 0, and proves a system has such a feature iff Syn⁽ᵏ⁾(X_t; X_t′) > 0, with the microstate as the witness. ΦID atoms split that synergy into downward causation and causal decoupling, under stated axioms on the redundancy function, which the paper says the minimum-MI decomposition meets and which identity-respecting ones fail. The practical criteria Ψ, Δ, Γ are redundancy-free and sufficient only; as proved they certify the system’s capacity, not the candidate feature. Applied to the Game of Life, boids and macaque ECoG. | Active — read 2026-10-20 (NOTE-987) in full; worth reading for the axioms the ΦID theory of causal emergence needs, the proof that a system hosts an emergent feature iff its parts carry synergy about their own future, the exact definitions of downward causation and causal decoupling, and the redundancy-free criteria Ψ, Δ, Γ. Read it knowing that the theorem’s witness is the microstate itself; that Proposition 1, as proved, certifies the system’s emergence capacity and not the candidate feature (under the minimum-MI decomposition the parity of two self-copying bits passes Ψ and is not emergent); that its axioms exclude identity-respecting redundancy measures and count aggregates of non-interacting persistent parts as emergent; and that Γ = 0 is never met in its data. |
| LIT-1260 v2 | Thermodynamic depth of causal states: Objective complexity via minimal representations | Crutchfield & Shalizi (1999; arXiv 1998). Shows that the growth rate of Lloyd and Pagels’ thermodynamic depth is the entropy rate of the chosen macrostate process, so depth measures randomness and its value depends on an arbitrary choice of macrostates. Proposes the causal states, the minimal sufficient statistics of the past for the future, as the principled choice. Proves they are the coarsest fully predictive states, with least statistical complexity and least growth rate. | Active — read 2026-10-20 (NOTE-978) in full, from arXiv:cond-mat/9808147v1; worth reading for three things. It shows that the growth rate of Lloyd and Pagels’ thermodynamic depth is the entropy rate of the chosen macrostate process, so lumping and splitting macrostates set it from zero up. It shows how its examples (an IID chain, a hidden fair coin, the logistic map through a non-generating partition) expose the dependence. And it proves that the causal states are the coarsest fully predictive states, with least statistical complexity and least dive (THEORY-756). Read it knowing four things. Its logistic-map “dive ≈ 0.811” is the single-symbol entropy; the entropy rate is 0.677867. Its footnote 2 makes prescience vacuous. Its dive proof covers only Markov rivals, though the result holds. Its claim that v < C_μ whenever the past and future share information fails in general. Its “objective” complexity is objective only given the measuring instrument, as its own logistic-map example shows. |
| LIT-1282 | Random Hyperbolic Graphs: Degree Sequence and Clustering | Gugelmann, Panagiotou and Peter (2012), ICALP. The first rigorous results for the threshold (T = 0) hyperbolic random graph of Krioukov et al., at curvature −1 with radial density exponent α > 1/2 and disk radius R = 2 log n + C: the expected average local clustering coefficient is Θ(1) and concentrated, the fraction of vertices of degree k is given exactly up to 1 + o(1) for k up to a power of n and has a power-law tail with exponent 2α + 1 up to the maximum degree, the average degree is a constant, and the maximum degree is n^(1/(2α) + o(1)). | Active |
| LIT-1283 | Clustering and the hyperbolic geometry of complex networks | Candellero and Fountoulakis (2015), Internet Mathematics. For Krioukov et al.’s hyperbolic random graph with curvature −ζ², density exponent α and 0 < ζ/α < 2, in the soft model with connection probability 1/(exp(β(ζ/2)(d − R)) + 1): when β > 1 (temperature below 1) the global clustering coefficient (three times triangles over paths of length two) converges in probability to an explicit positive constant if ζ/α < 1 and to zero if 1 ≤ ζ/α < 2; when β ≤ 1 it converges to zero. Restricted to vertices of bounded type it stays positive for every ζ/α < 2 when β > 1. | Active |
| LIT-1292 v3 | A contraction based, singular perturbation approach to near-decomposability in complex systems | Bousquet & Slotine (arXiv 2015, unpublished). Recasts Simon’s near-decomposability as a singularly perturbed system, fast module states x̃ and slow states y with ẏ = O(ε), and bounds the error of the reduced slow system with nonlinear contraction theory. If each module is contracting, the reduced slow system is contracting, and the coupling terms grow at most affinely in |x̃| and |y|, then below an explicit critical separation ε_c, after a transient of order (1/β_f + 1/(εβ_g)) log(1/ε), the fast states stay O(ε) from their quasi-steady values and the slow states O(ε) from the reduced trajectory, for all later time. A worked building example with a negative conductance shows multiple equilibria and instability above ε_c. Deterministic; bounds trajectory error, not dependence; proofs are sketches with a printed inversion in Remark 8. | Active — read 2026-10-20 (NOTE-1025) in full; worth reading for the only rate the record holds for Simon’s near-decomposability: with contracting fast modules (rate β_f) and a contracting reduced slow system (rate β_g), and coupling perturbations bounded affinely in the off-manifold state, Lemma 3 and Theorem 1 keep the fast variables within O(ε) of their quasi-steady manifold and the slow variables within O(ε) of the reduced system, uniformly in time after a transient of (1/β_f + 1/(εβ_g)) log(1/ε), for every ε below an explicit critical timescale separation ε_c = β_f / [χ_f(α_f,x + χ_g α_f,y α_g,x / β_g)]; and for Remark 6, that the micro states act on the macro level through their quasi-steady values, “an aggregation in time”, not an ensemble aggregate. Read it knowing that it is a five-page preprint, never published in a journal, whose proofs are sketches; that Remark 8 prints ε_c inverted (the worked example’s value √2/7 is the reciprocal of the printed expression, and matches Hypothesis 2); that Lemma 3’s O(ε) bound on the slow error needs d_g = 0, which the proof’s last line assumes silently while the worked example lists d_g = 1; that it is deterministic throughout and bounds trajectory error only, not any information-theoretic dependence; that the slow coordinates and the partition are given, not found; and that ε_c is sufficient and in linear checks conservative by factors of 3 to 50. |
| LIT-1294 | Near-Decomposability, Partition and Aggregation, and the Relevance of Stability Discussions | Ando & Fisher (International Economic Review 1963). The sequel to Simon & Ando (1961), standardly cited as giving the proofs of the near-decomposability theorems: in a linear dynamic system whose matrix is nearly block-diagonal, the short run is governed within blocks and the long run by the blocks’ aggregates. It also asks when stability analysis of the decomposed parts is relevant to the whole. Not read; this summary is from the title and how the paper is cited. | Unavailable — registered 2026-10-20, not read. A search on 2026-10-20 for a lawful full text reached none. JSTOR (stable 2525455, the DOI’s landing) returned a “Client Challenge” bot-check page instead of the article. Crossref names JSTOR as the publisher and lists no full-text link. OpenAlex, Unpaywall and Semantic Scholar all report it closed with no repository copy. The 1963 book that reprints it, Ando, Fisher and Simon, Essays on the Structure of Social Science Models (MIT Press), is on the Internet Archive in two scans (essaysonstructur0000ando, essaysonstructur0000unse), both access-restricted lending-only items; Google Books shows it with no pages viewable; the MIT Press page returned 403 to this client. No Cowles Foundation discussion paper was found for it: web searches of the Cowles series on Yale’s EliScholar turned up nothing by Ando and Fisher on near-decomposability, and EliScholar’s own search returned 403. CORE returned 429 and BASE a bot check. Title searches, with and without filetype:pdf, found no author-posted copy. It stays Unavailable until a copy is supplied, by library access or the book. No NOTE is filed. |
| LIT-1295 v2 | A Contraction Theory Approach to Singularly Perturbed Systems | Del Vecchio & Slotine (IEEE TAC 2013; conference version CDC-ECC 2011). Revisits singular perturbation with nonlinear contraction theory. For ẋ = f(x, z, t), εż = g(x, z, ε) with g contracting in z, the fast state’s distance from the slow manifold z = γ(x) obeys an explicit global bound, decaying at rate λ_z/ε to a floor εχ_z(d + K)/λ_z (Lemma 2). With a contracting slow subsystem the slow state stays within an explicit O(ε) of the reduced trajectory for all t ≥ 0 (Theorem 3), and the result extends to three time scales and to retroactivity attenuation in a phosphorylation cycle. Theorem 3 as stated assumes only partial contraction of f in x; its proof needs, and a counterexample shows it requires, contraction of the reduced system. Metrics are constant throughout. | Active — read 2026-10-20 (NOTE-1020) in full, from the authors’ revised manuscript of 22 December 2011 on Del Vecchio’s MIT pages, with the CDC-ECC 2011 conference version (MIT DSpace) for comparison; worth reading for the contraction robustness lemma with its one-line proof (Lemma 1: a system contracting at rate λ in a constant metric Θ, disturbed by d with |d| ≤ d̄, stays within χe^{−λt}|Δ(0)| + χd̄/λ of an undisturbed trajectory), for an explicit, global, uniform-in-time bound on the distance of the fast state from the slow manifold (Lemma 2: χ_z e^{−λ_z t/ε}|z(0) − γ(x(0))| + εχ_z(d + K)/λ_z), and for an explicit O(ε) bound on the error of the quasi-steady-state (Markovian) reduction for all t ≥ 0 (Theorem 3), extended to three time scales and applied to retroactivity in a phosphorylation cycle. Read it knowing that Theorem 3 as stated is false: it assumes only that f is partially contracting in the slow state x, while its proof uses contraction of the reduced system ẋ = f(x, γ(x), t), and a two-variable example satisfying every stated hypothesis has a bistable reduced system and an O(1) error (NOTE-1020); with the reduced system assumed contracting, which the CDC version’s introduction says, the theorem and its proof are correct. Read it also knowing that its metrics are constant (state- and time-dependent metrics are mentioned, not used), that the bound d on |∂γ/∂x · f| is global and cannot hold for a linear system, though the proof needs it only along the trajectory, that the example’s contraction rate λ_z is printed as a max where it is a min, and that the copy read is the revised manuscript, not the version of record. |
| LIT-1299 v2 | Parameter Space Compression Underlies Emergent Theories and Predictive Models | Machta, Chachra, Transtrum & Sethna (Science 2013). Two physics models are not sloppy at their microscopic scale and become so when observed coarsely. In a 1-D hopping model the Fisher spectrum of the density at time t spreads as t^(3/2−k), ordered particle creation, drift, diffusion constant, then skew and higher moments. In Monte Carlo on a decimated 64×64 critical Ising model with 13 couplings and a field, the field and temperature eigenvalues stay put while the rest fall in bands drawn at b^(2y−d) per step. The rate is argued by scaling, not derived, and the Ising numbers have no error bars. The paper reads the resemblance to sloppy models from biology as a common cause of effective theories, which it does not show. | Active — read 2026-10-20 (NOTE-1018) in full, from arXiv:1303.6738v1 with its nine-page supplement; worth reading for the original numerics behind the claim that coarse-graining contracts irrelevant directions of the Fisher metric (Fig. 3: a 64×64 square-lattice Ising model at its critical point, 13 couplings and a field, up to six checkerboard decimations, in which the field and temperature eigenvalues stay put and the rest fall in bands drawn at b^(2y−d) per step for y = 0, −2, −4), for the supplement’s scaling argument for that rate (Eqs. 28–41), which already states that only directions with 2y ≥ d are carried by the singular part, and for the hopping model of diffusion, whose density at time t carries Fisher eigenvalues scaling as t^(3/2−k) (THEORY-774). Read it knowing that the Ising rates are read off a figure with no error bars, no fitted exponents and no second lattice size, and that the eigenvalues are assigned to y by drawn bands, with y = 0 not an operator of the 2D Ising model (THEORY-777, Proposed); that the derivation of the rate is the same scaling argument Raju, Machta and Sethna (2018) later repeat, and assumes the coarse metric is the Hessian of a coarse free energy in the bare couplings; that the Fig. 3 caption’s rate 2^(−d−y) contradicts the supplement and the figure, whose bands fall as 2^(y−d/2); that the diffusion model is not a coarse-graining of one data set, so its leading eigenvalues grow with t rather than staying put; that the main text’s “‘relevant’ directions in the RG are exactly those whose FIM eigenvalues do not contract” is contradicted by its own supplement for relevant directions with 0 < 2y < d; and that the closing claim that emergent theories are “due to” the sloppy hierarchy is not shown, since the paper traces both to the same separation of scales. |
| LIT-1304 v2 | Discrete approach to stochastic parametrization and dimension reduction in nonlinear dynamics | Chorin & Lu (PNAS 2015). Proposes model reduction done entirely in discrete time: the resolved variables are advanced by a fixed numerical scheme plus a discrepancy sequence computed exactly from data, and the discrepancy is fitted as a NARMAX time series (autoregression in itself, lags of functions of the resolved variables, moving average in past innovations). Memory is thereby carried by finitely many lags. The connection to Mori–Zwanzig is drawn by analogy, not derived. On two-scale Lorenz 96 with ε = 0.5, a fit with one autoregressive lag, one or two exogenous lags and at most one moving-average term reproduces the statistics of x₁ better than a polynomial-plus-AR(1) closure, and at observation spacing 0.05 extends the lead time at anomaly correlation 0.6 from 2 to 4. Nothing is proved and no error bound is given. | Active — read 2026-10-20 (NOTE-1028) in full; worth reading for the fully discrete stochastic parametrization: fix a numerical integrator for the resolved equations, take the discrepancy z^{n+1} = (x^{n+1} − x^n)/δ − R_δ(x^n), which the data give without differentiation, and fit it as a NARMAX time series with x as exogenous input, so that memory of past x, past z and past innovations is carried by finitely many lags; for the conditional-likelihood (least-squares) fit; and for a Lorenz 96 test with no time-scale separation (ε = 0.5), where one or two lags reproduce the pdf, autocorrelation and cross-correlation of x₁ and, at δ = 0.05, double the forecast lead time over a polynomial-plus-AR(1) closure (THEORY-818). Read it knowing that the link to Mori–Zwanzig is motivation, not derivation: nothing shows that the fitted Φ approximates the MZ memory or that ξ is the MZ noise, which is orthogonal to the resolved variables but neither white nor independent; that “generalizes the MZ formalism” is an overstatement; that the model structure is found “by trial and error” and changes with δ; that nothing is proved, no error bound is given and no case is shown in which a finite discrete memory suffices exactly; and that the δ = 0.01 fit has a moving-average coefficient 0.9997, at the edge of invertibility. |
| LIT-1306 v2 | Software in the natural world: A computational approach to hierarchical emergence | Rosas, Geiger, Luppi, Seth, Polani, Gastpar & Mediano (arXiv 2024). Defines three exact closures of a coarse-graining Z of a stationary discrete process X. In informational closure the micro past adds nothing to predicting Z’s future (Barnett–Seth dynamical independence). In causal closure Z’s ε-machine equals its υ-machine, the coarsest partition of micro pasts that predicts Z. In computational closure Z’s ε-machine is a coarse-graining of X’s. It proves informational ⟺ causal closure, and causal ⇒ computational closure for spatial coarse-grainings, not conversely. It ties these to strong and weak lumpability of the micro ε-machine. It proposes the lattice of strongly lumpable coarse-grainings of that ε-machine, modulo computational equivalence, as a system’s “functional architecture”. The case studies are cellular-automaton parity, Ehrenfest, Glauber energy, a modular random walk, agent counts and Hopfield overlaps. Most of them close by a permutation symmetry. | Active — read 2026-10-20 (NOTE-1030) in full; worth reading for three exact notions of a self-contained coarse-graining Z of a stationary discrete process X and how they relate: informational closure, I(X⃗_t; Z⃗ᴸ_{t+1} | Z⃗_t) = 0 for every horizon, which is Barnett and Seth’s dynamical independence without an environment; causal closure, the ε-machine of Z equivalent to its υ-machine (the coarsest partition of micro pasts that predicts Z’s future); and computational closure, Z’s ε-machine a coarse-graining of X’s. Theorem 1 proves informational ⟺ causal closure for any coarse-graining of the past; Theorem 2 proves causal ⇒ computational closure for spatial ones, and Counterexample 4 the converse false. Proposition 4 and Theorem 3 tie closure to Kemeny–Snell lumpability: strong lumpability gives closure, closure with a Markov Z gives strong lumpability, weak lumpability gives only computational closure. Read it knowing that the sublattice claims are asserted and, for informationally closed spatial coarse-grainings, false under common refinement (a three-bit counterexample in the NOTE); that the stated sufficient condition for the Ising energy to close (a permutation-invariant Hamiltonian) fails with a uniform field at coincident energies; that Proposition 3 is a telescoping identity whose closure hypothesis is idle; that (A.11) and Example 2 contain slips; that the modular random walk closes by symmetry of the weights and not by modularity; and that every result is exact, with nothing on approximate closure. |
| LIT-1307 v2 | Data-driven model reduction, Wiener projections, and the Koopman-Mori-Zwanzig formalism | Lin & Lu (J. Comput. Phys. 2021). Writes data-driven model reduction for an invertible map with an invariant measure in Koopman-operator terms, derives the discrete Mori–Zwanzig equation from the Dyson formula, and introduces the Wiener projection: orthogonal projection onto the span of the entire past of chosen functions Ψ of the resolved variables. Under it the memory term vanishes, the reduced equation is the causal Wiener filter x_{n+1} = Σ_k Ψ(x_{n−k})h_k + ξ_{n+1}, and the residual is orthogonal to all of Ψ’s past. A rational approximation of the filter’s transfer function, called “uncontrolled” by the authors, turns it into a NARMAX-type recursion. That recursion is fitted by nonlinear least squares with a stability constraint and tested on Kuramoto–Sivashinsky and a stochastically forced Burgers equation. The Wiener projection is proved; the NARMAX derivation is heuristic and no error is bounded. | Active — read 2026-10-20 (NOTE-1029) in full; worth reading for the discrete-time Mori–Zwanzig identity derived from the Dyson formula in a few lines (Eq. 2.5–2.6), valid for any projection; for the Wiener projection, orthogonal projection onto the closed span of the whole past of chosen functions Ψ of the resolved variables, under which the Dyson formula collapses (Eq. 3.5), the memory term disappears into the projection, and the residual is orthogonal to all of Ψ’s past (Eq. 3.6b), not only to its present (THEORY-819); for the skew-product construction that brings randomly forced systems and bounded delays under the same formalism (§3.3); and for the cascade-of-quadratics parametrization that enforces stable memory during fitting (§4.1). Read it knowing that the step from the Wiener projection to NARMAX is a rational approximation the authors themselves call “uncontrolled” and “heuristic”, so no error bound and no convergence statement is proved; that the Wiener projection needs an invertible map and an invariant measure, and its claimed series representation (property (i)) needs more than the linear independence it states; that the KS and Burgers results are numerical, with orders chosen by trial for stability; that Appendix C says the noise term does not appreciably change the KS statistics or forecasts while §5.1 says that without it the models “do considerably worse at all tasks”; and that the record’s check shows the rational form is exact, with orders at most n − 1, for a scalar coarse variable of a stable linear Gaussian VAR(1), where the Wiener filter’s poles are the moving-average zeros, not the eliminated block’s eigenvalues. |
| LIT-1314 v2 | Competing Technologies, Increasing Returns, and Lock-In by Historical Events | Arthur (1989). In a model of adopters choosing between competing technologies, increasing returns to adoption make the outcome depend on the order of small, unforeseeable early events; the market can lock in to one technology, and not necessarily the better one, and its course is neither predictable from prior knowledge nor flexible later. | Active — read 2026-10-21 (NOTE-1052) through its precursor only, the 1983 IIASA working paper WP-83-90 (“On Competing Technologies and Historical Small Events: The Dynamics of Choice under Increasing Returns”), read in full from IIASA’s repository; the 1989 article itself was not reached (Unpaywall and OpenAlex closed, no open PDF on Semantic Scholar, JSTOR paywalled). Worth reading for the model that makes lock-in analysable: increasing returns turn the adoption difference into a random walk with absorbing barriers, so one technology takes the market, which one is decided by the order of small events, and the outcome is neither predictable, flexible nor necessarily efficient (THEORY-863, re-derived). Read it knowing that the model is very special (two types, linear returns, no expectations, pricing or sponsors), that its historical examples are illustrations, and that the published version may differ from the precursor read here. |
| LIT-1366 v2 | Linked Ecologies: States and Universities as Environments for Professions | Abbott (2005). Treats professions, states and universities as linked ecologies, each defined by actors, locations and the relation between them and each an environment for the others. Two concepts link them: hinges, issues or strategies that work in both ecologies at once, around which alliances form; and avatars, attempts to institutionalize in one ecology a copy of an actor from another. Hinges are worked through medical licensing in 19th-century New York and England, avatars through four cases linking professions and universities. | Active — skimmed 2026-10-22 (NOTE-1077) through its precursor only: Abbott’s French chapter “Écologies liées” (2003), which his page says antedates this article, and the section on Bourdieu cut from it, both posted on his University of Chicago pages and read in full. The 2005 article was not reached (Unpaywall, OpenAlex and Semantic Scholar closed; Wiley 403). Worth reading for the thesis that a profession’s audiences, the state first, are themselves ecologies, so every jurisdictional event must serve actors in two ecologies at once, and for a case in which the different tempos of medicine and politics decided the doctors’ allies. The precursor lacks the article’s university ecology, avatars, English case and developed account of hinges. |
| LIT-1372 v2 | Increasing Returns, Path Dependence, and the Study of Politics | Pierson (2000). Argues that political processes are often marked by increasing returns, so that early events and their timing lock in institutions and paths that later events cannot easily reverse. | Active — read 2026-10-22 (NOTE-1076) through its precursor only, the 1997 EUI Jean Monnet Chair Paper 44 of the same title, read in full from the EUI’s Cadmus repository (open access); the 2000 APSR article itself was not reached (Unpaywall and OpenAlex list only the precursor; Cambridge Core and JSTOR paywalled). Worth reading as the argument that politics is more prone than markets to increasing returns, because of compulsory institutions, collective action and opacity, and holds paths harder, because competition and learning correct weakly, elected officials discount at the electoral cycle and institutions are built to be sticky (THEORY-885). An argument with no data and one illustration. It makes actors’ time horizons a cause of lock-in, but does not say which component of a polity holds authority over which, so it does not already state CLAIM-423. |
| LIT-1406 v3 | Stop Signals Provide Cross Inhibition in Collective Decision-Making by Honeybee Swarms | Seeley et al. (2012). Nest-site scouts deliver stop signals, brief vibrations given mostly by head-butting, to scouts dancing for sites other than their own while the swarm is choosing between two nest boxes, and to all dancers once it has chosen; accumulated signals end dances. A mean-field model shows that this cross inhibition, like that between neural populations, above a critical rate breaks the deadlock between two equal sites, the swarm choosing one at random, and takes it to the better site when the two differ enough. | Active — read 2026-10-29 (NOTE-1411) in full, from the Science Express PDF of 8 December 2011 posted on rangevoting.org (https://rangevoting.org/SeeleyVSHFMinhibit.pdf); worth reading as the field evidence that honeybee scouts aim inhibitory stop signals at scouts dancing for rival nest sites while the swarm is choosing, and as a model in which that cross inhibition, above a critical rate, breaks deadlock between equal options. Read it knowing that the targeting result rests on two swarms, that inhibition becomes general once the choice is made, that the model’s equations and thresholds are in the supporting material, which was not read, and that this copy is the online-first version, not the print layout of 6 January 2012. |
| LIT-1424 | The geometry of interpersonal synchrony in human dance | Bigand, Bianco, Abalde and Novembre (2024). Dyads of laypeople danced face to face in a “silent disco” while shared music (same or 8.5% tempo-shifted songs through earphones) and visual contact (a curtain or none) were varied in a 2 × 2 design. Of 15 principal movements from motion capture, four synchronized more with visual contact (lateral and hand movements), five more with shared music (anteroposterior movements such as head bobs) and one, vertical bounce, with both; no movement showed an interaction. The spatial direction of a movement classified which factor drove its synchrony; its periodicity did not. | Active — read in full 2026-10-23 (NOTE-1093) from PubMed Central (PMC11266842), the publisher’s CC BY text, with Figure 2 and the supplementary Document S1; worth reading as the cleanest human instance the record holds of shared drive and coupling manipulated separately in one collective: in 35 dyads dancing face to face, shared music and visual contact each raised synchrony, in different movement components and with no interaction, and the timing of the synchrony could not tell the two kinds apart while its spatial direction could (THEORY-891). Direction of coupling between the partners was not measured. |
| LIT-1446 | The dynamic architecture of emotion: Evidence for the component process model | Scherer (2009), Cognition and Emotion 23(7):1307–1351. The component process model’s evidence review. Emotion is “an emergent, dynamic process based on an individual’s subjective appraisal of significant events”, and the paper gives special emphasis to the sequence of appraisal checks and the synchronisation of response systems. Unread: the model is read in the companion paper LIT-1451. | Unavailable — registered 2026-10-23 from Crossref, not read: a lawful copy exists but this client could not reach it. The University of Geneva’s Archive ouverte holds the published version (unige:97810), with access restricted to members of the UNIGE/HUG community. The Taylor & Francis article is paywalled. The Geneva E3 Lab’s publications page posts many of the group’s 2009 papers but not this one, and a web search found no other author or course posting. Its argument is read first-hand in Scherer’s companion paper of the same year, “Emotions are emergent processes: they require a dynamic computational architecture” (LIT-1451), which restates the component process model and cites this paper, then in press, for the evidence. Filed because the record’s proposal needs a measurable analogue of potential, and this is the review usually cited for response synchronization. It stays Unavailable until a copy is supplied, not on merit. |
| LIT-1451 | Emotions are emergent processes: they require a dynamic computational architecture | Scherer (2009), Phil. Trans. R. Soc. B 364:3459–3474. Emotion is a bounded episode of synchronization among organismic subsystems, driven by a fixed sequence of appraisal checks (relevance, implications, coping, normative significance) and aimed at control precedence. The feeling component monitors the process by integrating a representation of all components and their coherence, and the degree of synchronization is hypothesised to generate conscious experience. Proposes nonlinear dynamic modelling: emotions as attractor basins of coupled oscillators, with hysteresis and cusp-catastrophe jumps. | Active — read 2026-10-23 (NOTE-1113): in full, from the PubMed Central text (PMC2781886). Worth reading as Scherer’s own compact statement of the component process model, the same year as the evidence review LIT-1446, which it cites as in press. Emotion is a bounded episode of component synchronization, driven by sequential appraisal checks and aimed at control precedence. The feeling component monitors the process by representing the other components and their coherence. The degree of synchronization is hypothesised to generate conscious experience. Emotions are attractor basins of coupled oscillators, with hysteresis and catastrophe-surface jumps. It stands in for the unread review. |
| LIT-1455 | Bridging emotion theory and neurobiology through dynamic systems modeling | Lewis (2005), Behavioral and Brain Sciences 28(2):169–194, with open peer commentary. Appraisal and emotion are not cause and effect but constituents that organize one another, through positive and negative feedback and circular causality, into an emotion–appraisal amalgam, an “emotional interpretation”. Trigger, self-amplification and self-stabilization phases. Interpretations are attractors, one converging at a time, with abrupt phase transitions between them. Their neural basis is nested corticolimbic loops, neuromodulation, vertical integration, action monitoring and theta-band synchrony, and stable states drive learning on a developmental timescale. | Active — read 2026-10-23 (NOTE-1119): the target article in part, from the BBS treatment posted on the University of Geneva E3 Lab’s publications page with Sander and Scherer’s commentary. Worth reading as the fullest dynamic-systems account of appraisal and emotion. Appraisal and emotion constituents organize each other into one “emotional interpretation” through bidirectional feedback, in trigger, self-amplification and self-stabilization phases. Emotional interpretations are attractors, one at a time, and switch by phase transition. Vertical integration gives them momentum and selects among them. Stable states drive learning across a slower timescale. It contains the dynamics of one organization coming to prevail, but what prevails is an interpretation, not an ordering of the system’s own states. |
| LIT-1484 | The Hive Mind is a Single Reinforcement Learning Agent | Soma, Bouteiller, Hamann and Beltrame show that in an infinite, well-mixed population, imitation of success has the expected update of a single Cross Learning bandit agent, and the weighted voter model of the honey-bee waggle dance the expected update of “Maynard-Cross Learning”, π_a ← π_a + (r_k / v^π)(1[a = k] − π_a), which is the Maynard-Smith replicator dynamic. Each member is one parallel action sample of the population’s policy, and the members themselves do not learn. Simulations, qualitative by the authors’ account, show the result surviving moderate swarm and neighbourhood sizes, and finite populations losing options for good. | Active — read in full 2026-10-24 (NOTE-1132) from arXiv v6 (21 July 2026, CC BY 4.0); worth reading as a proved aggregation result: in an infinite, well-mixed population, two imitation rules with no individual learning have the expected update of a single bandit-learning agent. Imitation of success gives Cross Learning (the Taylor replicator dynamic), the honey-bee weighted voter model gives what the authors call Maynard-Cross Learning (the Maynard-Smith replicator dynamic). The macro-agent is a stateless bandit policy over the members’ types. The biological model is deliberately partial, the simulations qualitative, and pure imitation has no way back once a type is lost or the environment changes. |
| LIT-1506 | Optimal Reward Functions in Distributed Reinforcement Learning | Wolpert & Tumer: members of a multi-agent system each run a reinforcement learner, and the designer must give each a private utility such that their learning maximises a world utility G. A private utility is factored when it ranks a member’s own alternatives, others fixed, as G does; the Wonderful Life Utility G(ζ) − G(CL(ζ)), with the member’s effect set clamped, is factored and has higher learnability than G. A sketched approximation sets the clamp to the expected action rather than zero; in a 60-agent bar problem, clamping to the average action learned best across attendance levels, clamping to absence close behind, and G itself worst. | Active — read in full 2026-10-24 (NOTE-1153) from the NASA Technical Reports Server copy (document 20010066523, a 7-page scanned report marked public use permitted), not the version in the Intelligent Agent Technology proceedings; worth reading as the most compact statement the record holds of difference rewards. A member’s private utility is factored when it ranks the member’s own alternatives as the world utility does, the others held fixed; the Wonderful Life Utility, world utility minus its value with the member’s effect set clamped, is factored and learns faster than the world utility itself. Clamping to the average action did better than clamping to the member’s absence. The optimal clamp is only sketched (“too long to go through here”) and the experiment is one bar problem. |
| LIT-1507 | Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer | Shazeer, Mirhoseini, Maziarz, Davis, Le, Hinton & Dean (2017). A layer of up to 131,072 feed-forward experts with a trainable noisy top-k gate, inserted between LSTM layers, raises capacity over 1000-fold at roughly constant computation and beat the best published language-modelling and translation results of the time. Without balancing losses the gate concentrates on a few experts, a self-reinforcing imbalance; losses penalizing unequal summed gate weight and unequal load remove it and, in one ablation, cut test perplexity from 39.8 to 35.6. | Active — read in full 2026-10-24 (NOTE-1145) from arXiv v1, the only version; worth reading here for one observation and its fix, not for its scale results. The gate of a sparsely-gated mixture of experts “tends to converge to a state where it always produces large weights for the same few experts”, which the authors call self-reinforcing because favoured experts are trained more. Two auxiliary losses, the squared coefficient of variation of each expert’s summed gate weight and of a smooth estimate of its load, remove the imbalance. In the one ablation (a 256-expert model, 10 epochs) no loss gives CV 3.04 and a peak-to-mean load of 17.8 at test perplexity 39.8, any loss gives 35.6–35.7. The fix equalizes use regardless of merit; the noise in the gate is there mainly to make the load estimate differentiable. |
| LIT-1512 | Mean Field Multi-Agent Reinforcement Learning | Yang, Luo, Li, Zhou, Zhang & Wang (2018). Factorizing each agent’s Q-function into pairwise terms and expanding about the neighbours’ mean action reduces many-agent interaction to an agent against the average of its neighbours. Mean field Q-learning and actor-critic follow; MF-Q is proved to converge to the Nash Q-value under strong assumptions. With 500 and 1000 agents in Gaussian Squeeze the mean field methods learn where four baselines fail; MF-Q reproduces the order parameter of a 20 × 20 Ising model against MCMC; and it wins a 64-versus-64 battle game. | Active — read in full 2026-10-24 (NOTE-1148) from arXiv v5 (15 December 2020), the ICML 2018 paper with appendices; worth reading as the standard way multi-agent RL reaches hundreds of agents: each agent’s Q-function takes its own action and the mean action of its neighbours, so many-body interaction becomes a two-body one between an agent and the average of the rest. Mean field Q-learning is proved to converge to a Nash Q-value under strong assumptions, every stage game met in training having a global optimum or a saddle point among them, and learns where four baselines fail with 500 and 1000 agents. The approximation needs agents that are homogeneous and interchangeable within a neighbourhood; the bound on its error is loose and the cancellation of errors argued, not proved; and the contraction step needs a high Boltzmann temperature while the convergence assumptions need it to go to zero. |
| LIT-1515 | Optimal Payoff Functions for Members of Collectives | Wolpert & Tumer (2001). Members of a collective each maximise a private payoff utility; the design question is which payoffs make the members’ success yield a high provided world utility. Against the “team game”, which gives each member the world utility, the paper uses “a novel mathematical framework” to review the class of payoffs that are easy to maximise and aligned with the world utility, the Aristocrat Utility and a new variant of the Wonderful Life Utility, and reports experiments in which they beat earlier COIN utilities, the team game and “perhaps the most natural version” of endogenizing externalities (abstract, RePEc). | Unavailable — filed 2026-10-24 for difference rewards (the Wonderful Life Utility); a reading was attempted the same day and failed on access to a lawful copy. The version of record is closed at World Scientific; Unpaywall and OpenAlex report it closed with no repository copy. The second author’s publications page at Oregon State (web.engr.oregonstate.edu/~ktumer), which lists the paper, failed certificate verification through this client’s proxy and returned 503 to a second fetcher. CiteSeerX, which OpenAlex lists, reset every connection. It is not on arXiv (both authors’ arXiv listings checked) or NASA NTRS. A copy is posted on a third party’s course-library server (jmvidal.cse.sc.edu), not by the authors or their institution; it was not used. The closest lawful text, the authors’ NASA report of the same programme with a near-identical abstract, is filed and read as LIT-1506. It stays Unavailable until a copy is supplied or the author’s page can be reached. No NOTE is filed. |
| LIT-1516 | α-Rank: Multi-Agent Evaluation by Evolution | Omidshafiei, Papadimitriou, Piliouras, Tuyls, Rowland, Lespiau, Czarnecki, Lanctot, Pérolat & Munos (Scientific Reports 2019). Agents in a K-player meta-game are ranked by the stationary distribution of a Markov chain on pure profiles whose transitions are fixation probabilities of Fermi imitation with rare mutation. Unique at every finite ranking intensity α; as α → ∞ the transitions become those of Markov-Conley chains, the sink components of the better-response graph, which the paper ties to the chain components of the replicator flow. Applied to AlphaGo, AlphaZero, MuJoCo soccer and poker meta-games. | Active — read in full 2026-10-24 (NOTE-1156) from arXiv v4 (4 October 2019); worth reading as the evolutionary alternative to Nash for ranking agents when wins cycle. It ranks strategy profiles by the stationary distribution of a finite-population, rare-mutation imitation chain, unique at every finite ranking intensity α. As α grows its transitions become those of Markov chains on the sink strongly connected components of the better-response graph. The paper calls these sinks Markov-Conley chains and ties them to the chain components of the replicator flow. The large-α limit of the stationary distribution, and so the selection among several sinks, is not characterized. In the symmetric single-population model a copied strategy changes the ranking (checked by script), so it does not share Nash averaging’s resistance to padding. |
| LIT-1520 | Coupled replicator equations for the dynamics of learning in multiagent systems | Sato & Crutchfield (2002; PRE 2003). Two agents choose by softmax over reward memories Q_i that decay at rate α. In the limit where learning is slow relative to play, each agent’s choice distribution follows ẋ_i/x_i = β[(Ay)_i − x·Ay] + α Σ_j x_j log(x_j/x_i): a coupled replicator dynamic plus an entropy-like term towards uniform play. With α = 0 it is the conservative two-population replicator equation; with α > 0 it is dissipative. In rock–scissors–paper, simulations show quasiperiodic tori and Hamiltonian chaos without decay, and limit cycles, intermittency and chaotic attractors with it. | Active — read in full 2026-10-24 (NOTE-1144) from arXiv:nlin/0204057v2 (18 August 2002); worth reading as a four-page derivation of the learning dynamics of softmax reinforcement learners with forgetting: two such agents follow coupled replicator equations plus a term α_X Σ_j x_j log(x_j/x_i), set by the rate at which reward memories decay, that pushes each agent towards uniform play. Without forgetting the system is conservative, Hamiltonian in zero-sum games, and in rock–scissors–paper it is chaotic for nonzero tie rewards; with forgetting it is dissipative, with limit cycles and chaotic attractors. The memory update is not Watkins’s Q-learning: every action’s memory is updated with its average reward at the same rate. |
| LIT-1613 v2 | Engineering a Safer World: Systems Thinking Applied to Safety | Leveson (2011). STAMP treats accidents as failures to enforce safety constraints in a hierarchical control structure, including unsafe interactions among components that each behave as designed, rather than as chains of component failures; STPA is the hazard analysis built on it. | Unfetched — searched 2026-10-29 for a lawful full text; the book is open access and copies exist, but this client could not fetch any, so it is not read and no NOTE is filed. OpenAlex lists it as open access at MIT Press Direct (doi:10.7551/mitpress/8179.001.0001) and in the Directory of Open Access Books (handle 20.500.12854/78510); catalogue records give the OAPEN Library file https://library.oapen.org/bitstream/handle/20.500.12657/26043/1004042.pdf. On 2026-10-29 MIT Press Direct returned a Cloudflare 403 challenge to curl; library.oapen.org returned 403 with an anti-bot page (“Making sure you’re not a bot!”) to curl and timed out to WebFetch, and the DOAB and OAPEN APIs refused the client’s address. The author’s site copy at sunnyday.mit.edu/safer-world.pdf returned 503 behind the same anti-bot page and reset the connection over https. The failure is on access, not availability. A browser fetch of the OAPEN file is the cheapest way to read it. It stays Unfetched until a copy is supplied. |
| LIT-1630 v2 | Coarse-graining as a downward causation mechanism | Flack (2017), DOI-10.1098/rsta.2016.0338, Phil. Trans. R. Soc. A 375. Downward causation, made operational: components tune their behaviour to their own estimates of coarse-grained variables they collectively compute (“endogenous coarse-graining”). In the weak, apparent form one component tuning to a variable slower than the behaviour producing it suffices, and estimates may be wrong and disagree. In the strong, effective form the variable is predictive, robust, used nearly universally, agreed on, and gaining mutual information with the microscopic behaviour; that marks a new organizational level. The macaque power distribution, computed from subordination signals that coarse-grain fight outcomes, is the example, reviewed from earlier work. Time-scale separation lets an aggregate act as a “social” environment whether or not it is accurate. | Active — read in full 2026-10-27 (NOTE-1216); worth reading as the general, operational statement of Flack’s account: downward causation as components tuning to their own estimates of aggregate variables they collectively compute, in a weak (apparent) and a strong (effective) form, with a new organizational level only at the strong form. A conceptual paper; the macaque results are reviewed, not reported. Its criteria put convergence of estimates, not regeneration of the variable, beyond use. |
| LIT-1638 v2 | Geometric singular perturbation theory for ordinary differential equations | Fenichel (1979). For a fast–slow system εẋ = f(x,y), ẏ = g(x,y), a compact normally hyperbolic critical manifold of the fast subsystem persists for small ε as a nearby locally invariant slow manifold, with stable and unstable fibrations, so the reduced slow dynamics on it are a rigorous approximation. | Unfetched — searched 2026-10-27 for a lawful full text; one exists but this client could not fetch it, so it is not read and no NOTE is filed (ADR-053). Unpaywall lists the publisher’s open-archive copy on ScienceDirect, sciencedirect.com/science/article/pii/0022039679901529/pdf; it answered curl with an HTTP 403 Cloudflare challenge, and a headless- browser fetch was not attempted, since it would be working around the challenge. The failure is on access, not availability. A browser fetch of the open-archive copy is the cheapest way to read it. It stays Unfetched until a copy is supplied. |
| LIT-1642 v2 | Spatial Localization in Dissipative Systems | Knobloch (2015). In systems where a homogeneous and a patterned state coexist, fronts between them can pin to the pattern’s phase, giving stable localized patches of pattern in a homogeneous background; as a parameter varies they grow by adding cells along a snaking bifurcation diagram (homoclinic snaking), shown in the Swift–Hohenberg equation and in fluid, optical and other experiments. | Unfetched — searched 2026-10-27 for a lawful full text; one exists but this client could not fetch it, so it is not read and no NOTE is filed (ADR-053). Unpaywall lists the publisher’s free copy at Annual Reviews, annualreviews.org/doi/pdf/10.1146/annurev-conmatphys-031214-014514; it answered curl with an HTTP 403 Cloudflare challenge, and a headless- browser fetch was not attempted, since it would be working around the challenge. The failure is on access, not availability. A browser fetch of the Annual Reviews copy is the cheapest way to read it. It stays Unfetched until a copy is supplied. |
| LIT-1654 v2 | Tipping points in open systems: bifurcation, noise-induced and rate-dependent examples in the climate system | Ashwin, Wieczorek, Vitolo and Cox (2012), arXiv 1103.0169, Phil. Trans. R. Soc. A 370. Tipping in an open system ẋ = f(x, λ(t)) is split into B-tipping (a bifurcation of the quasi-static attractor), N-tipping (noise carries the system out of its neighbourhood) and R-tipping, in which “the system fails to track a continuously changing quasi-static attractor”. In a linear model with a fixed stable M and a tipping radius R, steady drift r of the equilibrium tips the system if ‖M‖⁻¹|r| > R and cannot if ‖M⁻¹‖|r| < R, with no bifurcation and no noise; in a co-moving frame it is the ability to track that bifurcates. Examples include a unique, globally stable equilibrium whose threshold is no basin boundary, and a toy energy balance model shows each type alone. Neither N- nor R-tipping needs a change of stability, so critical-slowing warnings have no reason to apply. | Active — read in full 2026-10-27 (NOTE-1215), from the corrected arXiv v5; worth reading as the paper that names rate-induced tipping beside bifurcation and noise, and for its plainest form: a linear model with a fixed stable matrix, so no bifurcation and no noise, in which an attractor that keeps its stability is lost when it moves faster than the system relaxes, relative to the distance to the threshold. A toy climate model shows each type alone. Mathematics and illustration, not evidence about any real system. |
| LIT-1656 v2 | Autopoiesis and Cognition: The Realization of the Living | Maturana & Varela (1980). A living system is an autopoietic machine: a network of processes producing the components that, through their interactions, regenerate the network and constitute it as a unity in space. Organization (the relations that define the unity) is distinguished from structure (the components realizing it), and cognition is identified with the process of living. | Unavailable — filed 2026-10-27, not read. A close reading was attempted on 2026-10-27 and no lawful full text was reached: the book is closed on Unpaywall (Springer), with no open copy listed. It stays Unavailable until a copy is supplied. |
| LIT-1660 v2 | The Behavioral Approach to Open and Interconnected Systems | Willems (2007). A dynamical system is its behavior, the set of trajectories its laws allow; inputs and outputs are not assumed; systems are interconnected by sharing variables and imposing constraints on them, and modelling proceeds by tearing a system into parts, zooming into each and linking them again. | Unavailable — filed 2026-10-27, not read. A reading was attempted on 2026-10-27 and no lawful full text was reached: Unpaywall and OpenAlex both give the article as closed; OpenAlex lists a CiteSeerX cache, not used, and a University of Groningen record, whose page offered no file. It stays Unavailable until a copy is supplied. |
| LIT-1668 v2 | Cycle holonomy captures higher-order compatibility constraints in remote synchronization | Torres-Hugas et al. (2026), Communications Physics. For a phase model whose edges carry antisymmetric phase lags, the twisted Laplacian Lα = δα*δα has a zero mode exactly when every cycle holonomy is 0 mod 2π; otherwise its smallest eigenvalue measures the residual incompatibility, largest on an isolated cycle at holonomy π. The symmetric Sakaguchi–Kuramoto model is a different model, but on cactus graphs its lag gives each ℓ-cycle a path mismatch (ℓ − 2)α that an associated connection is built to carry as holonomy. In the triangle–pentagon remote-synchronization motif the pentagon’s mismatch reaches π at α = π/3, where the locked branch is an exact two-group state; the branch has already lost transverse stability at αc ≃ 1.0164, so the holonomy marks geometry, not stability. | Active — read in full 2026-10-27 (NOTE-1218), from the arXiv preprint v2; worth reading for a clean statement of when edge-wise phase relations can be met around cycles, and for its own caution that the point of maximal cycle frustration is not where remote synchronization loses stability. The spectral criterion is standard mathematics; the synchronization result is one seven-node motif. |
| LIT-1669 v2 | Life Itself: A Comprehensive Inquiry Into the Nature, Origin, and Fabrication of Life | Rosen (1991). Organisms are relational systems; in the metabolism–repair ((M,R)) model an organism is closed to efficient causation, every efficient cause of its constitutive processes being produced within it, which Rosen argues no mechanism (a system with a computable model) can be. | Unavailable — filed 2026-10-27, not read. A close reading was attempted on 2026-10-27 and no lawful full text was reached: the book has no DOI to look up on Unpaywall, OpenAlex’s title search was out of its daily budget for this client, and the publisher sells it; no open copy is known. It stays Unavailable until a copy is supplied. |
| LIT-1670 v2 | Long-Range Order in a Two-Dimensional Dynamical XY Model: How Birds Fly Together | Toner & Tu (1995), PRL 75. A continuum theory of a flock: a coarse-grained velocity field with a convective term, a preferred speed and noise, coupled to a conserved density. Its linearized theory loses order in d ≤ 2, as the equilibrium XY model does under the Mermin–Wagner theorem, but the convective nonlinearity is relevant below d = 4, and in d = 2 symmetry gives z = 6/5, ζ = 3/5, χ = −1/5, so the velocity fluctuations stay bounded and the flock has true long-range orientational order. The exactness rests on a cubic vertex staying irrelevant, which the authors “strongly suspect”; the order also follows from z < 2, expected “on physical grounds”. | Active — read in full 2026-10-27 (NOTE-1228), from the arXiv preprint; worth reading as the founding hydrodynamic theory of flocking and as a clean case of order that an equilibrium system cannot have, stabilized by the coupling of order to transport. Its exponents are exact only on an argued-but-unproved step; its long-range order in two dimensions has a second, independent argument. |
| LIT-1671 v2 | Slaving principle revisited | Haken (1996). Near an instability the few modes whose damping goes to zero become slow order parameters, and the many stable modes are enslaved to them, expressible as functions of the order parameters, so the dynamics reduce to order-parameter equations; the paper restates the principle and its derivation. | Unavailable — filed 2026-10-27, not read. A close reading was attempted on 2026-10-27 and no lawful full text was reached: the article is closed on Unpaywall and OpenAlex (Physica D, Elsevier), with no repository copy. It stays Unavailable until a copy is supplied. |
| LIT-1674 v2 | Symmetry Groupoids and Patterns of Synchrony in Coupled Cell Networks | Stewart, Golubitsky & Pivato (2003), SIAM J. Appl. Dyn. Syst. 2(4). In a coupled cell network, a typed directed graph whose admissible dynamics give each cell an arbitrary smooth function of its input set, the same for cells with isomorphic inputs, a synchrony pattern is invariant under every admissible vector field iff its equivalence relation is balanced: equivalent cells receive the same number of inputs from each class along each arrow type (Theorem 6.5). Symmetry gives balance but is not needed, so robust synchrony occurs in networks with no symmetry and among cells with no arrows between them. The dynamics on a balanced subspace are admissible for a quotient network (Theorem 9.2), which can have symmetry the original lacks; not every quotient field lifts. The paper studies “existence, not stability”. | Active — read in full 2026-10-27 (NOTE-1217), from the accepted version in the Warwick repository; worth reading as the theorem behind robust synchrony in networks: an architecture forces a synchrony pattern for every admissible dynamics exactly when the pattern is balanced, which symmetry implies but does not exhaust, and the dynamics on it are a quotient network’s. It treats existence only, not stability. |
| LIT-1821 v2 | The Organism as a System: Insights from Paul Weiss | Nicholson (2026) reconstructs from the writings of the experimental biologist Paul Weiss (1898–1989) a non-formal concept of a system: a whole that keeps its configuration while its parts vary and turn over, whose parts are produced and constrained by the network they form (a triplet of processes each supplying conditions for the other two, no pair viable without the third), and which cannot be assembled stepwise or recovered from an inventory of its parts. He turns it against reductionism, genocentrism, determinism and mechanicism. The critiques are argued by analogy and conceptual analysis; only the one against determinism cites evidence, and none is presented in the paper. Weiss’s one formula, that the whole varies far less than its parts’ summed variances, is met by any aggregate whose whole is an average. | Active — read in full 2026-10-29 (NOTE-1340) from the Europe PMC full text; worth reading as the clearest gathering of Weiss’s system concept and of its triplet of mutually producing processes, an early statement of closure, and for its four critiques, of which only the one against determinism rests on cited evidence. |
| LIT-1828 | Policing stabilizes construction of social niches in primates | Flack, Girvan, de Waal & Krakauer (2006), Nature 439: 426–429. By the abstract: in “knockout” experiments on a large captive group of pigtailed macaques, temporarily removing the few individuals who police conflicts left grooming, play, proximity and contact-sitting networks smaller, less diverse and less integrated (lower mean degree and reach, higher clustering and assortativity), so a rare policing function stabilizes the social networks members build. Not read. | Unavailable — filed 2026-10-29 from the triage of the day, not read. A lawful full text was sought on 2026-10-29 and not reached. The copy search engines still index, on Emory’s Living Links reprint pages (co-author de Waal’s centre), at https://www.emory.edu/LIVING_LINKS/publications/articles/Flack_etal_2006.pdf, now returns 404, as does the whole Living Links site. web.archive.org reset every connection on 2026-10-29, so whether a capture of that copy exists could not be checked; if one does, it is the quickest route. OpenAlex reports the Nature copy closed, Jessica Flack’s old SFI site is gone, and the Collective Computation Group’s publication list did not resolve for this client. No NOTE is filed. |
| LIT-1833 v2 | Multi-Level Cause-Effect Systems | Chalupka, Perona & Eberhardt (2015; AISTATS 2016). A micro cause I and micro effect J, both discrete and possibly huge, are confounded by a hidden H. The fundamental causal partition groups i by P(J | man(i)) and j by P(j | man(i)) across all i; its classes are the fundamental cause C and effect E, and do(C = c) is any manipulation into the class. E is claimed to be the minimal sufficient partition for P(J | man(i)), and (C, E) the coarsest pair that recovers it losslessly. The fundamental causal coarsening theorem extends the UAI 2015 one to the effect side: given the observational partitions, both causal partitions fail to coarsen them only on a null set. Subsidiary variables are coarsenings of (C, E) with unambiguous effects; two that do not interact compose into the fundamental partition. A simulated 100-neuron population responding to bars in images is recovered. No distribution over interventions is assumed. | Active — read 2026-10-29 (NOTE-1420) in full, from arXiv 1512.07942v1 with its supplementary material; worth reading as the source of the two-sided form of causal feature learning that the overview (LIT-1834) restates: the fundamental cause and effect are the partitions of micro causes by P(J | man(i)) and of micro effects by P(j | man(·)), learned jointly; the fundamental causal coarsening theorem says both generically coarsen the observational partitions; and the authors decline, “following Pearl”, to put any distribution on the interventions. Read it knowing that its one demonstration is a simulated neural population, built with the macro structure it recovers; that its claim that the effect partition is the minimal sufficient partition is wrong where two effect states have proportional but unequal columns (NOTE-1420); and that it compares itself with Hoel et al. 2013 in one sentence and computes nothing on their systems. |
| LIT-1834 v2 | Causal feature learning: an overview | Chalupka, Eberhardt & Perona (2016; Behaviormetrika 2017). A review of causal feature learning (CFL). Macro variables are partitions of a micro state space. The observational partition groups micro causes h with equal p(e | h); the causal partition groups those with equal p(e | man(h)), where man() sets the micro state without touching a confounder; effect states are grouped the same way by their columns. A macro intervention do(C = c) is a manipulation to any micro state in the class, which is unambiguous because all of them have the same effect. The causal coarsening theorem: among distributions with given causal and confounding partitions, the causal partition fails to coarsen the observational one only on a Lebesgue-null set, so the observational partition is learned from data and one experiment per observational class merges it into the causal one. A toy with confounded hue and skin conductance shows the steps; open problems are continuous macrovariables, cycles and learning without experiments. | Active — read 2026-10-29 (NOTE-1415) in full, from the publisher’s PDF as posted on Frederick Eberhardt’s Caltech publications page (https://www.its.caltech.edu/~fehardt/papers/CEP2017.pdf); worth reading as the plainest statement of causal feature learning: a macro cause is a class of micro states with the same P(effect | man(state)), a macro intervention is any micro manipulation into the class, and the causal coarsening theorem says that, except on a measure-zero set, the causal partition is a coarsening of the observational one, so one experiment per observational class finds it. Read it knowing that its example is a one-dimensional toy with four hue bands; that the theorem is a genericity result, not a test, and holds only for discrete macrovariables and an acyclic micro system; that the effect classes are defined by equal likelihoods while the merging step normalizes them; that two of its displayed equations carry slips (NOTE-1415); and that it gives no measure of how much causal information a coarsening keeps. |
| LIT-1837 | Comparison between different methods of level identification | Pfante, Bertschinger, Olbrich, Ay & Jost (2014), Advances in Complex Systems 17(2), 1450007. Compares criteria for a level of a discrete dynamical system, a coarse-graining that admits a closed description in its own terms: informational closure, commutativity of aggregation with the dynamics (lumpability), Markovianity of the coarse process and related measures. By the readings that cite it, it shows that for Markov spatial coarse-grainings informational closure is equivalent to commutativity (NOTE-1030), and that closure is stronger than the sufficiency Krakauer et al. use (NOTE-1400). Not read. | Unavailable — registered 2026-10-29 from the triage of the day, not read. A lawful full text was sought on 2026-10-29 and not reached. OpenAlex reports it closed, with no repository full text; it lists CiteSeerX (10.1.1.401.4652; the connection was reset), MPG’s edoc record 708568 (it redirects to pure.mpg.de, which answered 403 and a bot check, and no file was seen) and TUHH’s repository (hdl 11420/14500, a metadata record whose PDF link is a placeholder). World Scientific offers only paid access. No arXiv deposit was found. The MPI MIS publication list for Olbrich gives the journal article and no MiS preprint for it. A web search names a Santa Fe Institute working paper, 13-11-035, at https://www.santafe.edu/media/workingpapers/13-11-035.pdf; that address returned 404 on 2026-10-29, and the working paper was not found elsewhere on the SFI site or at EconPapers. It stays Unavailable until a copy is supplied. Its results on informational closure, commutativity (lumpability) and Markovianity are known to the record second-hand, through NOTE-1030 and NOTE-1400. |
| LIT-1839 v2 | Causal Emergence: When Distortions in a Map Obscure the Territory | Eberhardt & Lee (2022), Philosophies 7, 30. A critique of Hoel’s 2017 account of causal emergence. Effective information is scored under a uniform intervention over the states at each level, and an intervention on a macro state is a uniform average of interventions on its micro states. Two numerical results follow. EI maximization merges micro states whose effects differ widely (in a 3×3 example, rows at absolute distance 0.8), so the macro variable has ambiguous manipulations in Spirtes and Scheines’s sense. And the EI-optimal abstraction of a two-step matrix is not the square of the one-step abstraction, so abstraction and marginalization over time do not commute. The authors trace both to the maximum-entropy distribution, “extraneous to the system”, and call causal capacity a normative, potential quantity. | Active — read 2026-10-29 (NOTE-1413) in full, from the publisher’s PDF as deposited in Caltech’s CaltechAUTHORS repository; worth reading as the published case that effective-information maximization, with a uniform intervention over macro states realized as a uniform average over their micro states, merges states with different effects (ambiguous manipulations) and picks levels that change with the time step (abstraction and marginalization do not commute). Read it knowing that its target is Hoel 2017, not Hoel, Albantakis and Tononi 2013; that its examples are numerical, found by a 0.1 grid search on 3×3 matrices; that it argues the uniform distribution is extraneous but never computes what happens when one micro distribution is used at both levels; that its commutativity example is a partition that is strongly lumpable, so the coarse-graining commutes and only the EI-optimal choice does not; and that its 8-state ambiguity example is unambiguous with respect to the macro effect it is scored on. |
| LIT-1840 | Encoding Power in Communication Networks | Flack & Krakauer (2006), The American Naturalist 168: E87–E102. By the abstract: in a captive pigtailed macaque group, power is defined as the consensus among individuals about one’s capacity to use force, measured from the network of a unidirectional dominance signal; its distribution is fat-tailed and it predicts requests for support and the cost and intensity of interventions, and models show how signalling strategies keep the distribution robust to signalling errors. Not read. | Unavailable — filed 2026-10-29 from the triage of the day, not read. A lawful full text was sought on 2026-10-29 and not reached. OpenAlex reports it closed, with the University of Chicago Press DOI and PubMed as its only locations, and Semantic Scholar reports no open copy. The publisher’s page returned a 403 challenge. Searches found no copy on the authors’ pages: Jessica Flack’s old SFI site (sites.santafe.edu/~jflack/) says “This website is no longer available”, the Collective Computation Group’s publication list (c4.santafe.edu/c4pubs/) did not resolve for this client, David Krakauer’s current site lists recent papers only, and the Emory Living Links reprint directory that held the authors’ Nature paper of 2006 now returns 404. web.archive.org reset every connection, so no capture of any of these could be checked. It stays Unavailable until a copy is supplied. No NOTE is filed. |
| LIT-1842 v2 | Spontaneous structure formation in a network of chaotic units with variable connection strengths | Ito & Kaneko (PRL 2002; arXiv 2001). N = 100 logistic maps, each driven by a weighted mean of the others; each unit’s incoming weights are renormalized to sum to 1 after strengthening those from units in similar states. In the desynchronized phase with high weight turnover (a = 3.97, c = 0.12), identical units split into a core of about 14 to 16 that sends many strong connections, dense among themselves and to the periphery, and a periphery that sends almost none to the core (2 of about 1,344 possible). Membership stops changing after about 3 × 10⁶ steps. Freezing the effect of weights on states removes the structure. | Active — read 2026-10-29 (NOTE-1414) in full, from arXiv’s v1; worth reading as the minimal model in which identical units, each normalizing the weights it gives to the others and strengthening weights to units in similar states, split into a persistent core of about 14 to 16 units that is heavily attended by the rest and a periphery that the core ignores, while individual weights keep changing; an ablation shows the split needs the two-way coupling of states and weights. Read it knowing that it is a four-page letter of simulations at N = 100 with one parameter point studied in detail, that its classes are defined by a threshold on outgoing weight and an out-degree cut of 20, that nothing in it measures recovery, accuracy or perturbation of a class, and that its Table I fits a core of 16 though the text says typically 14. |
| LIT-1843 v2 | Causal emergence is widespread across measures of causation | Comolatti & Hoel (arXiv 2022). Twelve measures of causal strength from philosophy, statistics and psychology are written in terms of sufficiency P(e | c) and necessity 1 − P(e | C\c), or of Hoel’s determinism and degeneracy; several turn out to be the same measure (Pearl’s PNS, PN and PS are Eells’s, Lewis’s and Cheng’s). Each needs an intervention distribution P(C): observational (stationary), maximum entropy, or a local Hamming ball. On one 16-state bipartite Markov chain, whose two-state macro is a deterministic NOT gate, every measure shows causal emergence for some transitions and parameters; the system-level effective information under the stationary distribution does not, which the paper says was known. | Active — read 2026-10-29 (NOTE-1416) in full, from arXiv’s v1; worth reading as the defenders’ survey that rewrites a dozen measures of causal strength (Eells, Suppes, Cheng, Lewis, Pearl’s PN/PS/PNS, Galton, bit-flip, effect information, EI) as functions of sufficiency P(e | c) and necessity 1 − P(e | C\c), and that reports causal emergence for every measure on one bipartite Markov chain under maximum-entropy, stationary and local intervention distributions. Read it knowing that the model is built so its macro is a deterministic NOT gate whatever the micro noise; that in its symmetric version the macro distributions are the images of the micro ones, so it is a common-distribution test, and there the system-level EI cannot show emergence under either the stationary or the maximum-entropy distribution (data processing; the record’s computation agrees), which the paper concedes only for the stationary case; that “we prove” in the abstract covers rewritings of definitions, not a theorem that emergence must occur; and that the per-transition and normalized measures that do show emergence are not bounded by data processing. It does not meet THEORY-787’s promote_when. |
| LIT-1851 | Nonequilibrium phase transitions in coordinated biological motion: critical fluctuations | Kelso, Scholz & Schöner (1986), Physics Letters A 118(6):279–284. In bimanual wrist and finger movement paced to rising frequency, the standard deviation of relative phase grows as the anti-phase pattern nears its switch to in-phase and peaks in the transition, while the in-phase pattern shows neither growth nor a switch: the critical fluctuations HKB’s stochastic extension predicts. Critical slowing is predicted, backed only by “very preliminary” spectral evidence, and left to later experiments. | Active — read 2026-10-30 (NOTE-1433) in full, from an offprint scan posted on Kelso’s lab page at Florida Atlantic University (https://ccs.fau.edu/hbblab/pdfs/Kelso_1986_PhysLettersA.pdf), read from the page images; worth reading as the first quantified report of critical fluctuations in human coordination: the standard deviation of relative phase rises before the anti-phase to in-phase switch and peaks in it, in wrist and finger experiments, with no such rise when the same movement starts in-phase. Read it knowing that its figures average a few subjects or show one representative subject, that it gives no statistical test, and that critical slowing and hysteresis are not measured in it. |
| LIT-1865 v2 | What makes biological organisation teleological? | Mossio and Bich (2014; Synthese 194, 2017, 1089–1114). Biological organisation is intrinsically teleological because it self-determines as self-constraint: closure, a set of mutually dependent constraints that canalise a far-from-equilibrium flow at another level of causation. A cycle of transformations such as the water cycle is not closure. Dissipative structures do not realise closure; at most, on a contested reading, they make one macroscopic constraint and are minimally teleological, unorganised and without functions. Read for THEORY-072. | Active — read in full on 2026-10-30 (NOTE-1443) from the authors’ accepted manuscript on HAL, hal.science/hal-01137522 (CC BY-NC 4.0), fetched from hal.science/hal-01137522/document. The PhilSci-Archive copy (philsci-archive.pitt.edu/11156) failed TLS verification from this client the same day and was not used. Worth reading as the authors’ own statement, a year before LIT-582, that closure of constraints already carries the division of labour, and that dissipative structures do not realise closure but at most make a single macroscopic constraint. |
| LIT-1873 | Dynamics governs switching among patterns of coordination in biological movement | Kelso, Scholz & Schöner (1988), Physics Letters A 134(1):8–12. When people switch on cue between in-phase and anti-phase finger movement, the switch from in-phase to anti-phase takes about twice as long as the reverse (four subjects, each p < 0.0001), with a longer-tailed distribution. Adding to the stochastic HKB equation a term that pulls relative phase toward the intended pattern reproduces the asymmetry and the distributions’ shapes: intention acts within the pattern dynamics, not over them. | Active — read 2026-10-30 (NOTE-1449) in full, from the publisher’s PDF posted on Kelso’s lab page at Florida Atlantic University (https://ccs.fau.edu/hbblab/pdfs/1988_Kelso_Scholz_Schoner_Dynamics_governs_switching_among_pattern.pdf); worth reading as the experiment showing that an intended switch between bimanual patterns is shaped by their stability: switching from in-phase to anti-phase takes about twice as long as the reverse, with a longer tail, as the HKB dynamics with an added intentional term predicts. Read it knowing that it has four subjects, that the model’s one new parameter was set to match the order of magnitude of the switching times, and that the critical slowing it mentions is cited from an earlier paper, not shown. |
| LIT-1888 v2 | Theoretical principles for biology: Organization | Mossio, Montévil & Longo (2016). Proposes organization, understood as closure of constraints, as one of two theoretical principles for biology, beside variation, which a companion paper treats. The principles are posited a priori, as physics posits its phase space, and they define the domain: any system meeting both is biological, organisms being one class. The paper restates Montévil and Mossio’s definitions of constraint, dependence and closure. It argues, without a model, that closure grounds stability by regenerating constraints beyond their own time scales, and that it also propagates variation, so a change that reaches a constraint’s generators ends in disintegration or a new closure. | Active — read in full 2026-10-31 (NOTE-1461) from the authors’ HAL deposit; worth reading for the status it gives closure of constraints, a theoretical principle that defines the domain of biology rather than an empirical finding about organisms (THEORY-1251), and for its argument that closure both removes and propagates variation (THEORY-1271). It adds no formal content to Montévil and Mossio 2015 (LIT-582), and its stability claims are argued without a model. |
| LIT-1889 v2 | Nonequilibrium Thermodynamics of Chemical Reaction Networks: Wisdom from Stochastic Thermodynamics | Rao & Esposito (2016). A nonequilibrium thermodynamics for open, deterministic, mass-action networks of reversible elementary reactions, driven by possibly time-dependent chemostats. Each chemostatted species breaks a conservation law or opens an emergent cycle; with every emergent affinity zero the network relaxes to a unique equilibrium, and a steady state dissipates the sum of emergent currents times affinities. The minimal chemical work to create a nonequilibrium distribution is RT times a relative entropy, a nonequilibrium Landauer principle. Complex-balanced networks, deficiency zero among them, have non-negative steady and transient dissipation and a unique globally stable steady state however hard they are driven. | Active — read in full 2026-10-31 (NOTE-1464); worth reading as the standard deterministic thermodynamics of open reaction networks, and for what it makes exact in the exchange’s A13: sustained turnover needs an emergent fuel-to-waste cycle with nonzero affinity, and costs its current times that affinity (THEORY-1266). |
| LIT-1893 v2 | Input-to-State Safety With Control Barrier Functions | Kolathaya & Ames (2019). Defines input-to-state safety for a safe set C = {h ≥ 0}: under an input disturbance bounded by ‖d‖∞, the larger set {h + γ(‖d‖∞) ≥ 0} stays forward invariant, for some class-K γ. A barrier inequality with a disturbance penalty, ḣ ≥ −α(h) − ι(‖d‖), implies it. Adding a damping term εL_g hᵀ to any barrier controller, or the matching constraint to a CLF–CBF quadratic program, gives ι = ‖d‖²/(4ε). The paper’s examples show that nominal barrier controllers, including the standard quadratic program, can leave the safe set without bound under small disturbances. | Active — read in full 2026-10-31 (NOTE-1477); worth reading as the short statement of graded robust safety: under a bounded input disturbance a barrier-function controller keeps the state not in the safe set but in a set enlarged by a class-K function of the disturbance, and a damping term along the barrier’s input direction delivers this with an enlargement of ‖d‖²/(4ε) (THEORY-1267). It is not the robust box invariance CASE-190 certifies, which is THEORY-134’s. |
| LIT-1926 | Re-Engineering Philosophy for Limited Beings: Piecewise Approximations to Reality | Wimsatt (2007), DOI-10.2307/j.ctv1pncnrh. Essays on heuristics, robustness, reduction and emergence; the source LIT-188 cites for generative entrenchment (a structure that later ones depend on, so that perturbing it is catastrophic while perturbing them is tolerable) and for aggregativity. Unread here. | Deferred — filed 2026-11-01, not read. Registered as the source of generative entrenchment, the mechanism Griesemer and Shavit (LIT-188, §2) say drives the transition from conexus to community. A book (Harvard University Press); no reading was attempted. |
| LIT-1950 v2 | Irruption Theory: A Novel Conceptualization of the Enactive Account of Motivated Activity | Froese (2023), Entropy 25:748. Proposes Irruption Theory: three axioms (motivations make a difference to behaviour’s material basis; how cannot be measured; behaviour is underdetermined by its material basis) and three theses (irruption, scalability, attunement). Motivation shows only as increased material underdetermination, to be measured as neural entropy; chaos, 1/f noise and criticality are offered to scale it up. Irruptions are undirected: they “can loosen the organization of the current behavior but cannot force the formation of the behavior that is to come”. Effectiveness is credited to attunement, chiefly to self-optimization of a Hopfield network by arbitrary resets plus Hebbian learning. | Active — read in full 2026-11-03 (NOTE-1521), from PubMed Central’s copy of the version of record; worth reading as the founding statement of Irruption Theory, a libertarian enactivist account on which motivation shows only as material underdetermination, and for its own concession that irruptions are undirected and that direction comes from attunement. Conceptual: it has no model or data of its own. |
| LIT-1956 v2 | Early-warning signals for critical transitions | Scheffer et al. (2009), Nature 461. A review of generic early-warning signals for critical transitions. Near a fold bifurcation the dominant eigenvalue goes to zero, so recovery from perturbations slows; under ongoing perturbation this shows as rising lag-1 autocorrelation and variance. Skewness and flickering are further signals. Spatial systems add rising cross-correlation and pattern sequences. Climate, ecosystem, epilepsy, asthma and finance cases are reviewed. The same signals, weaker, precede non-catastrophic thresholds; the timing of a shift stays hard to predict; cyclic and chaotic systems are “less well studied”. | Active — read 2026-11-03 (NOTE-1536, Skimmed), from the version reprinted as chapter 2 of Dakos’s 2011 Wageningen thesis (edepot.wur.nl/168815), its two technical boxes not extractable; worth reading as the standard review of generic early warnings of tipping points, critical slowing down above all, and for its own caution that the same signals precede non-catastrophic thresholds. |
| LIT-1957 v2 | Underdetermination and causality in Irruption Theory: A critical analysis from a complex systems perspective | Hölken (2024), doi:10.1177/10597123241301835. Registered unread from the exchange “Assess SDT Coverage” of 2026-11-02 (A21). A complex-systems critique of Irruption Theory. A21’s “Hölken (2025)”; identified by its issue year. | Unavailable — searched 2026-11-03 for a lawful full text and none was reached, so it is not read and no NOTE is filed. OpenAlex and Unpaywall (noreply address) report it closed with no repository copy; Crossref lists Sage’s text-and-data-mining licence and Sage’s PDF and XML, which are subscription access, and journals.sagepub.com returned 403 to this client. Web searches found no preprint, PhilArchive copy or author upload; the author is at Ruhr-University Bochum (ORCID 0000-0002-4280-5048). Sánchez-Cañizares 2026 (NOTE-1506) cites its criticism in one line. It stays Unavailable until a copy is supplied. |
| LIT-1958 | Integrals of motion as slow modes in dissipative many-body operator dynamics | Yang & Abanin (2025), PRB 112, 094304. Under weak local noise an operator’s norm decays at a rate proportional to its size, the number of sites it acts on. Under chaotic Hamiltonian dynamics generic operators grow, so they decay ever faster, while small-sized integrals of motion do not grow and decay slowly. Exact diagonalization of the Lindbladian for Ising and Heisenberg chains of up to nine sites finds the slowest eigenoperators to be linear combinations of the known exact and approximate integrals of motion, and turns up approximate ones not put in by hand. A perturbation theory argues that this survives at large size because the relevant gap is not the level spacing but one of order min(γL, √(v_Bγ)); the authors add that hydrodynamic modes may close that gap. | Active — read in full 2026-11-02 (NOTE-1534), from arXiv:2506.02970v3 with its supplementary material; worth reading as a clean physical case of slowness picking out structure: under weak local noise, a Hamiltonian’s small conserved quantities are the slowest modes because they do not spread, while generic operators spread and decay. The correspondence is shown by exact diagonalization at nine sites or fewer; its large-system footing is a perturbative argument the authors qualify themselves. |
| LIT-1972 v2 | Using chaos to direct trajectories to targets | Shinbrot et al. (1990), doi:10.1103/PhysRevLett.65.3215. Registered unread from the exchange “Assess SDT Coverage” of 2026-11-02 (A18). The targeting half of chaos control: a one-shot use of sensitivity to reach a target quickly, against OGY’s holding. | Unavailable — searched 2026-11-03 for a lawful full text and none was reached, so it is not read and no NOTE is filed. OpenAlex and Unpaywall (noreply address) report it closed; PubMed has the abstract only; journals.aps.org returns a bot check to this client. Web searches found the 1992 experimental follow-up’s portal record at Aberdeen and a São Paulo thesis on targeting, but no copy of this letter. It stays Unavailable until a copy is supplied. |
| LIT-1981 v2 | The geometric minimum action method: A least action principle on the space of curves | Heymann and Vanden-Eijnden (2008), CPAM 61: 1052–1117. The Freidlin–Wentzell quasi-potential, a minimization over paths and their durations that has no minimizer between equilibria, is rewritten as a minimization of a parametrization-free action over curves, which has one; for a diffusion it is 2 inf ∫ |b| sin²(θ/2) ds. The minimizer is the maximum-likelihood transition curve in the small-noise limit. The geometric minimum action method computes it for nongradient SDEs, SPDEs and Markov jump processes. With gradient drift and identity noise transition paths run parallel to the drift; in the Maier–Stein model they leave the heteroclinic orbit for β > 4. | Active — read in part 2026-11-03 (NOTE-1504, Skimmed: §§1, 2.1–2.2, 4.1 and 5), from the published text on a Peking University course page; worth reading as the standard computation of most likely transition paths in small-noise systems, which confirms QUESTION-071’s note of 2026-11-02 for gradient drift with identity noise and shows, in the Maier–Stein model, that the noise path stays the reversed relaxation path until the drift is far from gradient. |
| LIT-1987 v2 | Contextual Emergence in the Description of Properties | Bishop and Atmanspacher (2006), doi:10.1007/s10701-006-9082-8. Registered unread from the exchange “Assess SDT Coverage” of 2026-11-02 (A5). The account of contextual emergence Jennings’s paper is reported to use. It claims stability conditions that make a higher-level description well defined, not new causal powers; that is the point of contact with CLAIM-334. | Unfetched — looked for 2026-11-03, not read. A lawful free copy, the authors’ preprint on PhilSci-Archive, is at https://philsci-archive.pitt.edu/2934/1/embishFinalArchive.pdf (record philsci-archive.pitt.edu/2934). This client could not fetch it: curl through the session proxy failed TLS verification (‘unable to get local issuer certificate’) (the http address fared the same), a second fetcher got HTTP 503, and two Wayback captures (20240613145841, 20100708050954) reset the connection. The Springer version is paywalled; CORE’s copy sits behind a Cloudflare check, which was not passed. It stays Unfetched until the owner supplies the file. |
| LIT-1990 v3 | Dynamics in Action: Intentional Behavior as a Complex System | Juarrero (1999), doi:10.7551/mitpress/2528.001.0001. Registered unread from the exchange “Assess SDT Coverage” of 2026-11-02 (A21). Intentional action as context-sensitive constraint in a complex system, the nearest philosophical prior art for CLAIM-533 and CLAIM-478’s constraints. | Unavailable — searched 2026-11-03 for a lawful full text and none was reached, so it is not read and no NOTE is filed. OpenAlex reports it closed; Crossref gives no licence; direct.mit.edu returned 403 to this client; web searches found no open-access edition of this book. Juarrero’s later book, Context Changes Everything (MIT Press 2023, doi 10.7551/mitpress/14630.001.0001), is open access and is not this work. Froese 2023 (NOTE-1521) cites this book among the constraint accounts it criticizes. It stays Unavailable until a copy is supplied. Note of 2026-11-03: the 2023 book is now registered and read as its stand-in (LIT-1995, NOTE-1532, Skimmed); it restates this book’s constraint vocabulary and cites it for enabling and second-order context-dependent constraints, but not its action theory. |
| LIT-1992 v2 | Decision-making through irruption theory: how to use and interpret the Haken-Kelso-Bunz model | Sánchez-Cañizares (2026), Phenomenology and the Cognitive Sciences. The HKB potential V = −a cos φ − b cos 2φ with parameters switched in time, from no landscape to two wells to one, makes the across-trial spread of the relative phase rise and then fall, which is compared by eye with post-stimulus quenching of ERP trial-to-trial variability in Sergent et al. 2021, Wolff et al. 2019 and 2021 and Hua et al. 2025. Irruption Theory is revised as IAT*: irruption is the onset of the bistable landscape and absorption its passage to one attractor, reversing Froese 2024’s variance hypothesis. The mind sets the control parameters by “selecting the relevant physical coarse-graining”. The author calls the agreement “only qualitative” and IAT* untestable without further assumptions. | Active — read in full 2026-11-03 (NOTE-1506), from the publisher’s open-access PDF; worth reading as the one place Irruption Theory is tied to a dynamical model and to data: the HKB potential with time-switched parameters, compared qualitatively with trial-to-trial variability in decision tasks, with the mind cast as setting the landscape rather than pushing the state. The fit is by eye; the model’s late-time spread is misdescribed for the stated noise. |
| LIT-1993 v2 | Emergence in Context: A Treatise in Twenty-First Century Natural Philosophy | Bishop et al. (2022), doi:10.1093/oso/9780192849786.001.0001. Registered unread as a source of Jennings 2026. The book-length account of contextual emergence, with Bishop and Atmanspacher 2006 (LIT-1987). Jennings quotes it for the constraint Bénard cells place on their fluid parcels (“these cells constrain or shape the states of motion accessible to fluid parcels”, p. 41, at LIT-1963 p. 20). The reading THEORY-1314 needs, to say whether Jennings’s boundary condition and causal reading go beyond its source. | Unavailable — looked for 2026-11-03, not read. No lawful free copy was found: OpenAlex (no email sent, ADR-008) and Unpaywall (noreply@anthropic.com) mark the OUP book closed, with no open-access edition; the PhilPapers record links only to library access; booksellers sell it. The authors’ view is read at second hand only in Bishop’s SEP entry on chaos (NOTE-1535, THEORY-1333), which cites it. It stays Unavailable until a copy is supplied. |
| LIT-1995 v2 | Context Changes Everything: How Constraints Create Coherence | Juarrero (2023), MIT Press, open access. A speculative natural philosophy (p. 32) of causation by constraint: what raises or lowers barriers to energy flow without transferring kinetic energy (p. 40). Context- independent constraints take conditions away from equiprobability, context-dependent ones away from independence (Gatlin); enabling constraints couple processes into coherent “interactional types” whose constitutive constraints govern their components top down by confining them to a subregion of state space (pp. 67–84). Levels are demarcated by rate discontinuities, wholes are slower, and control is lost when rates converge (ch. 12). Closure of constraints is adopted from Montévil and Mossio (ch. 7); control is analog (ch. 11); delayed-response neuroscience is read as top-down control (ch. 15). | Active — skimmed 2026-11-03 (NOTE-1532): chapters 2, 3, 6, 7, 11, 12, 15 and 16 read in full from the MIT Press open-access PDF, the rest searched by term. Worth reading as the readable statement of Juarrero’s constraint vocabulary (enabling, governing, second-order context-dependent constraints), which the record could not reach in the 1999 book, and for chapter 12’s hierarchy-theory account of rate-demarcated levels, the nearest philosophical prior art for CLAIM-478. Speculative by the author’s account, with no model of its own; its “context-dependent constraint” is Gatlin’s conditional dependence, not TERM-070’s constraint. |
| LIT-1997 v2 | Controlling chaos | Ott et al. (1990), doi:10.1103/PhysRevLett.64.1196. Registered unread from the exchange “Assess SDT Coverage” of 2026-11-02 (A16, A17). The method the owner called “very wu-wei” (U17): small parameter perturbations, timed by the system’s own wandering, hold it on an unstable periodic orbit. The control is small but continues while the orbit is held. Grounds CLAIM-541 and CLAIM-542. | Unavailable — searched 2026-11-03 for a lawful full text and none was reached, so it is not read and no NOTE is filed. OpenAlex and Unpaywall (noreply address) report it closed; PubMed has the abstract only. journals.aps.org returned a Cloudflare bot check (403) to this client, and was not tried again. The paper is one of PRL’s fifty-year milestone letters; whether APS makes milestone letters free to read could not be confirmed, since the milestones page returned 403 and the Wayback Machine is blocked by this session’s egress policy. If it is free, the owner can open journals.aps.org/prl/abstract/10.1103/PhysRevLett.64.1196, and this should be Unfetched. Yorke’s own list of cited papers (yorke.umd.edu/cited100+.html) did not answer. Web searches found no author or course copy. CLAIM-541 and CLAIM-542 describe the method second-hand. |