Paper statuses — A work’s standing in this record: whether it is worth reading. Not whether its findings are true — that is the THEORY scheme’s business, and the two can disagree in either direction.
In the anthology — worth reading, whether or not an account was drawn from it.
1436 of 2004 LIT documents. Back to the full index.
| # | Title | Summary | Status |
|---|---|---|---|
| LIT-002 v3 | Nested Hierarchical Dirichlet Processes | Paisley et al. (2012), ARXIV-1210.6738. The nHDP gives each document its own DP over the children of every node of a shared global nCRP tree (G_i^(d) ~ DP(βG_i)), plus a per-node stop/continue switch U_{d,i} ~ Beta(γ1, γ2). Each word then takes its own path, and β → 0 recovers the single-path nCRP. The paper fits this with SVI plus a greedy per-document subtree selection. On small corpora the variational nHDP beats variational nCRP on all three datasets and Gibbs nCRP on two of three (PNAS −6.304 vs −6.496/−6.574 held-out log-likelihood). On 1.8M NYT and 2.7M Wikipedia documents it tops stochastic HDP and LDA-50/150/250 by roughly 0.08 and 0.11 nats (read off Figs. 2, 7), using ≈12 and ≈8 topics per document. | Active — read in full 2026-09-25 (NOTE-023); the reference construction of the nHDP and a compact worked example of conjugate-exponential SVI for a tree-structured nonparametric model. Two things about it: the global update equations (23, 26–27) as printed contradict the paper’s own §4.1.2 derivation, and the large-scale results never compare against the nCRP. |
| LIT-003 v2 | A structure theorem for generalized-noncontextual ontological models | Schmid et al. (2020), ARXIV-2005.07161. Take a tomographically local GPT and any convex-linear, empirically adequate, diagram-preserving map M from it into FVect_R. Then M(T) = χ_B ∘ T ∘ χ_A⁻¹ for unique invertible linear maps χ_A (Thm 4.1). Consequences: - Every diagram-preserving quasiprobabilistic model is an exact (non-overcomplete) frame representation (Prop. 4.3). - Every diagram-preserving noncontextual ontological model has |Λ_A| = dim(A), the GPT dimension (Cor. 4.2, §4.3): exactly d² ontic states for a qudit and 4 for a qubit. - The paper also proves (Cor. 3.5) that three things are equivalent in arbitrary compositional scenarios, without needing tomographic locality: a noncontextual ontological model of the operational theory; an ontological model (simplex embedding) of its GPT; and a positive quasiprobabilistic model of its GPT. | Active — read in full 2026-09-25 (NOTE-017); It is the formal backbone of the “classicality = generalized noncontextuality = positive quasiprobability” position that LIT-007 and LIT-019 appeal to. The main theorem is fully proved and short. Read §3–4 and App. B. §5.2 illustrates why tomographic locality is necessary, and its numbers should be checked (see corrections). |
| LIT-004 v2 | Community Detection on Networks with Ricci Flow | Ni et al. (2019), ARXIV-1907.03993. The paper runs Ollivier-Ricci flow w^{(k+1)}{xy} = (1 − κ^{(k)}{xy})·d^{(k)}(x,y) (= W(m_x, m_y)), then cuts edges above a weight threshold. On LFR (n = 500, avg. degree 20) this gives ARI ≈ 1 up to μ ≈ 0.6. On two-block SBM (n = 500, p_intra = 0.15) it gives ≈ 1 up to p_inter/p_intra = 0.5, but it collapses to ≈ 0.1 at 0.55, where Spinglass and Fast Greedy still score ≈ 0.9 and ≈ 0.8. Theorem 4.1 (α = p = 0, cliques G(a,b), a > b ≥ 2) proves in fact only that non-gateway intra-clique edges shrink as (1/a)ⁿ. Gateway intra-clique edges grow at the same rate λ₁ⁿ as inter-community edges, with ratio → k ∈ (0,1). | Active — read in full 2026-09-25 (NOTE-006); the source paper for Ollivier-Ricci-flow community detection and the GraphRicciCurvature package, and worth reading for the method (§3, SI §C). It should be cited for the algorithm, not for superiority. Its SBM figure shows it losing to Spinglass and Fast Greedy past p_inter/p_intra = 0.5. Its theorem is weaker than stated, and it covers a parameter setting (α = p = 0) that differs from the one used in experiments (α = ½, p = 2). |
| LIT-006 v2 | Memorandum Opinion (remedies), United States v. Google LLC (D.D.C., No. 1:20-cv-03010-APM, ECF No. 1436) [descriptive title] | Mehta (2025), https://storage.courtlistener.com/recap/gov.uscourts.dcd.223205/gov.uscourts.dcd.223205.1436.0_1.pdf. Remedies opinion after the 2024 §2 liability ruling. The court (Mehta, J.) bars exclusive distribution deals for Search, Chrome, Assistant and the Gemini app, with a one-year exit right on all payment deals. It does not ban payments, and it rejects the Chrome and Android divestitures and choice screens. It orders (i) a one-time snapshot of six Search Index fields per document, (ii) Glue and RankEmbed user-interaction training data “at least twice”, capped and privacy-treated, and (iii) five-year search and text-ads syndication on ordinary commercial terms (search capped at 40% of queries in year one). “Qualified Competitors” is rewritten so it can include GenAI firms. The term is six years (five plus one of ramp-up). On GenAI, the court finds that grounded chatbots perform an information-retrieval function similar to general search engines, enough to bring GenAI inside the decree. It also finds that plaintiffs “did not establish that Google’s scale advantage in Search translates into a quality advantage in GenAI search-assisted responses” (op. p. 156). For that reason it refuses to order sharing of Gemini training data. | Active — read in full 2026-09-25 (NOTE-004); a primary legal source, and the most detailed judicial record to date of how LLMs, grounding/RAG and the GenAI market were described under oath. It is worth reading for that and for the design of its data-sharing remedy. Its technical content is lay-level, built from testimony, and carries no instruction for ML practice. |
| LIT-007 v2 | Quasi-quantization: classical statistical theories with an epistemic restriction | Spekkens (2014), ARXIV-1409.5041. Take a classical statistical theory over a phase space Ω = R^{2n} or (Z_d)^{2n}, and allow only uniform distributions over V^⊥ + v, where V is an isotropic subspace (a Poisson-commuting set of linear “quadrature” variables) and v ∈ V gives their values. The result is operationally identical to the quadrature quantum subtheory (the stabilizer formalism for odd prime d) for continuous variables and for odd prime d; the proof is that the Wigner functions of that subtheory are exactly these distributions (§IV.A). For d = 2 the two theories are isomorphic element by element but make different predictions, because the qubit stabilizer subtheory is contextual (§IV.B). | Active — read in full 2026-09-25 (NOTE-013); the clearest single statement of the epistricted-theory programme, and the source of the weak/strong nonclassicality split that 2111.13727 and 2005.07161 build on; read it for §II–IV and App. A, not for Table II, which it asserts rather than derives. |
| LIT-008 v2 | Modeling and solving an integrated periodic vehicle routing and capacitated facility location problem in the context of solid waste collection | González et al. (2025), ARXIV-2504.10648. The paper couples bin-capacity choice with weekly periodic capacitated routing (Sunday off, cyclic). Service time depends on the chosen bin combination, which gives an MIQP; a Glover linearisation turns it into a MILP. It solves both with Gurobi 10 for 8 h, and also with a binary-mask + permutation GA (CX 0.8, EM 0.05, pop 100, 10,000 generations). On five 12-point instances Gurobi stops at 26–32% optimality gaps. The best-of-30 GA overall cost is on average −0.08% vs the MILP incumbent and +1.70% vs the MIQP incumbent; the GA mean or median is +3.75% and +5.61%. The GA routes better (−5.75% and −5.74% routing cost) but buys much more bin capacity (+19.88% and +22.59%). On 40–163-point Bahía Blanca instances the GA returns feasible solutions in 0.72–5.58 h per run, with no bound to compare against. | Active — read in full 2026-09-25 (NOTE-015); worth reading narrowly, for its formulation (Eqs. 1–2m, with the linearisation in 3a–5) and its public Bahía Blanca instances. The headline “GA matches exact solvers” should not be cited as a quality claim: the exact comparators are unproven incumbents with ~30% gaps, the GA was tuned on one of its five test instances, and the large instances have no reference at all. |
| LIT-010 v2 | Quantum Thermodynamics | Vinjanampathy & Anders (2015), ARXIV-1508.06099. A 2015–16 review with no new results, whose one synthesis (§5.2, §7) is that the field used four inequivalent notions of work: ensemble ⟨W⟩ = ∫tr[ρḢ]dt (Eq. 2), two-point-measurement W = E_m^(τ) − E_n^(0) (Eq. 24), ε-deterministic single-shot A^ε ≈ −kT ln(Z_Λ*/Z) (Eq. 49) and resource-theory w^max_ε = F^min_ε(ρ_S) − F(τ_S) (Eq. 50), of which only the last two coincide. It also judges that the field had “only made a small number of experimentally checkable predictions of new thermodynamic effects yet” (§7, p. 39). | Active — read in full 2026-09-25 (NOTE-011); still worth reading as a short, accessible tour of where quantum thermodynamics stood in 2015–16, especially §3 (fluctuation theorems derived in full) and §5 (single-shot and resource-theory second laws). It is a map of the field, not an authority. It is dated: nothing after early 2016. Some formulas are garbled as printed (Eq. 68, the operator-sum statement, the Diesel strokes), so cite the primary papers it points to rather than the review. |
| LIT-011 v2 | Spectral Sets | Badea & Beckermann (2013), ARXIV-1302.0546. A survey of when a set X ⊃ σ(A) satisfies ‖f(A)‖ ≤ K sup_X|f| for all rational f. Its headline entries are that the closure of the numerical range is completely K-spectral with a universal K_Crouzeix ∈ [2, 11.08] (Fact 107.7.2a; completely 2-spectral for 2×2, Fact 107.7.2b) and that σ(A) is K-spectral iff A is diagonalisable, with K the eigenvector condition number (Example 107.2.5). §107.8 turns these into Krylov error bounds such as Arnoldi ε_m ≤ 2K_Crouzeix ρ_{m−1}(f,E) for convex E ⊃ W(A). | Active — read in full 2026-09-25 (NOTE-009); worth keeping as a compact, correctly referenced index of what was known in 2013 about bounding ‖f(A)‖ for non-normal A by sup-norms over the numerical range, pseudospectra, disks, lenses and annuli. Consult the relevant Fact rather than read it through. The universal numerical-range constant has since been improved: Crouzeix–Palencia (SIAM J. Matrix Anal. Appl., 2017) give 1+√2. That comes from outside the chapter and was not verified in this session. Check it before quoting 11.08 as current. |
| LIT-012 v2 | Transcript of Show Cause Hearing, Segundo A.P.G. v. Bondi et al. (D. Minn., No. 26-cv-603), Feb. 3, 2026 [descriptive title] | Blackwell (2026), https://drive.google.com/file/d/1FnY2z7eb5efGlHrb2AYBtfqMVDJSUfIu/view. At a 71-minute show-cause hearing on noncompliance with habeas release orders in five cases, Judge Blackwell said that the scale of Operation Metro Surge “is not a justification for diluting constitutional rights” and that the government “cannot … detain first and then sort out lawful authority later”. The record includes a 13-day delay in releasing Oscar O.T., release conditions imposed without the court’s authority on Jose L.C.C., and a Segundo release learned of only through another case. Government counsel attributed the failures to missing training, access and agency cooperation. The court took the matter under advisement. No written order following the hearing could be verified. | Active — read in full 2026-09-25 (NOTE-014); worth reading as a primary, certified record of a federal court questioning the executive about compliance with habeas release orders during Operation Metro Surge. It holds colloquy, not findings. Any holding would sit in a later written order, which could not be verified. |
| LIT-013 v2 | Nonparametric Bayesian Topic Modelling with the Hierarchical Pitman-Yor Processes | Lim et al. (2016), ARXIV-1609.06783. The paper collapses every Pitman–Yor node to customer and table counts (Eq. 16, following Chen et al. 2011), which turns any HPYP topic model’s posterior into a product of per-node factors, and it samples topics and counts jointly by decrement/propose/increment. The HPYP half of its Twitter-Network Topic Model uses this sampler; the network half is fit by a separate MH step. On one 240,517-tweet, 150-author corpus (T6) the TNTM reaches test perplexity 505.01 ± 7.8, against 664.25 ± 17.76 for a nonparametric ATM and 840.03 ± 15.7 for HDP-LDA, and network log-likelihood −500.63 against −557.86 for the random-function network model alone (Table 4). Removing the power-law discounts barely changes perplexity (508.64) but costs network likelihood (−560.28; Table 5). | Active — read in full 2026-09-25 (NOTE-008); worth reading as a clear, self-contained tutorial on the table-count (Chen et al. 2011) collapsed blocked Gibbs sampler for hierarchical PYPs with discrete and mixture bases. The TNTM experiments are thin: one corpus, clustering baselines copied from another paper, and assertion-level claims about kernels and labels. Cite it for the sampler exposition, not for the empirical superiority of nonparametric models. |
| LIT-014 v3 | Reckless disregard for the truth coming from cops, doctors, and scientists: A rant. | Gelman (2025), https://statmodeling.stat.columbia.edu/2025/06/24/reckless-disregard-for-the-truth-coming-from-cops-doctors-and-scientists-a-rant/. Gelman argues that scientists (a 3-day study titled “long-term”; the power-pose abstract’s “instantly become more powerful”), a paid medical expert (Ludmerer’s 2002 “no opinion” on smoking and lung cancer) and DHS spokespeople (Lander “assaulting”, Padilla “lunging”, ICE’s unsourced “413 percent” assaults) share one pattern, which he calls “reckless disregard for the truth”. In his account it strengthens a weak case, is carried by journals, courts and media, is accepted as a term of art and goes unpunished. It is negative-sum, and bystanders who tolerate it sustain it. | Active — read in full 2026-09-25 (NOTE-019); worth reading as a short, clearly argued statement of an incentive account of socially accepted falsehood, with a relevant section on overclaiming in paper titles and abstracts. Its evidence is a handful of anecdotes, and its police examples rest on press accounts that this reading did not check. |
| LIT-015 v2 | Joint Publication 3-12, Cyberspace Operations | Joint Chiefs of Staff (2018), https://nsarchive.gwu.edu/document/16681-joint-chiefs-staff-joint-publication-3-12. JP 3-12 (8 June 2018) defines cyberspace operations as “the employment of cyberspace capabilities where the primary purpose is to achieve objectives in or through cyberspace” (p. I-1). It sorts every non-”cyberspace-enabled” military action in cyberspace into exactly three missions: DODIN operations, DCO (split into DCO-IDM and DCO-RA) and OCO. Missions are categorized “based only on the intent or objective of the issuing authority” (p. II-2). Missions are carried out through four actions: cyberspace security, defense, exploitation and attack. On authorities, the publication says only that authority “is derived from the US Constitution and federal law” (Titles 10, 50 and 32 named as key; p. III-2), plus SecDef policy and President/SecDef orders. Specific authorities are deferred to the unreleased classified Appendix A. | Active — read in full 2026-09-25 (NOTE-025); the latest public edition of joint cyberspace doctrine and the primary source for its definitions and mission taxonomy. A December 2022 revision is reported (in secondary sources only, not seen here) to exist with distribution limited to CAC holders; if it is ever filed, this becomes Superseded by it. |
| LIT-016 v2 | The sheaf-theoretic structure of non-locality and contextuality | Abramsky & Brandenburger (2011), ARXIV-1102.0264. For finite measurement scenarios, an empirical model has a factorizable (local / non-contextual) hidden-variable realization iff its compatible family of distributions extends to a global section (Thm 8.1). Over the reals every no-signalling model has such a section (Thm 5.9: “negative-probability LHV” ⇔ no-signalling, because both span the same subspace, of dimension D = Σ_{U∈𝒰}(l−1)^{|U|}, Thm 5.4). Contextuality comes in three strictly nested strengths (probabilistic ⊋ possibilistic ⊋ strong), with the Bell, Hardy and GHZ(n≥3) models as witnesses of each level. | Active — read in full 2026-09-25 (NOTE-016); the founding paper of the sheaf-theoretic approach to contextuality. It is short, fully proved and still the standard reference for its definitions (empirical model, strong contextuality, the global-section criterion). Later work (cohomology, the contextual fraction, the CbD comparison) extends it but does not replace it. |
| LIT-018 v3 | Distinguishability and Accessible Information in Quantum Theory | Fuchs (1995), arXiv:quant-ph/9601020. Minimizing the Bhattacharyya overlap Σ_b √(tr ρ0E_b)√(tr ρ1E_b) over all POVMs gives exactly F(ρ0,ρ1) = tr√(ρ1^{1/2}ρ0ρ1^{1/2}) (Eq. 3.28). The minimum is attained by a projective measurement in the eigenbasis of M = ρ1^{-1/2}√(ρ1^{1/2}ρ0ρ1^{1/2})ρ1^{-1/2} (Eq. 3.67). For binary ensembles, the same Schwarz-inequality technique gives three results: a short proof of the Holevo bound I(t) ≤ S(t), with equality iff [ρ0,ρ1] = 0 (Eq. 3.149); a tighter upper bound L(t) (Eq. 3.187, integrated in Eqs. 3.230/3.244; closed form for qubits in Eq. 3.269); and a measurement-attained lower bound M(t) = tr[(1−t)ρ0 ln L_ρ(ρ0) + tρ1 ln L_ρ(ρ1)] (Eq. 3.203). The thesis also proves that two states can be broadcast iff they commute, and cloned iff they are identical or orthogonal (§4.3, proof written for invertible ρ0, ρ1). | Active — read in full 2026-09-25 (NOTE-021); still the most self-contained derivation of mixed-state fidelity as an optimal classical overlap, and of the Holevo bound by the curvature (J” vs S”) argument. Read §3.3 and §3.5.1–3.5.2 for those, and Ch. 2 as a tutorial on why error probability, the Chernoff bound, KL and mutual information are the operationally grounded classical measures. The quantum-Kullback bounds (§3.6), the inference–disturbance formalism (§4.2) and the no-broadcasting proof (§4.3) are preliminary or appeared in companion papers. Read those papers for their final forms. |
| LIT-019 v2 | Why interference phenomena do not capture the essence of quantum theory | Catani et al. (2021), ARXIV-2111.13727. The paper models each mode of the interferometer as a classical bit pair (occupation N ∈ Z_2, phase Φ ∈ Z_2). The agent may know only one of N, Φ or N⊕Φ and must be maximally ignorant of the rest. Under that restriction, local and deterministic dynamics (beamsplitter: swap N_L with Φ_L⊕Φ_R) reproduce exactly the 50-50, ϕ ∈ {0, π} Mach–Zehnder statistics (output port L with probability 1 or 0; ½/½ with a which-way detector). The same holds for the Elitzur–Vaidman bomb tester (success probability ¼), delayed choice and the quantum eraser (interference within each P_A outcome class, none within each Q_A class). So this “TRAP” slice of interference phenomenology cannot, on its own, force wave–particle complementarity, observer-dependence or nonlocal/retrocausal influence. The paper leaves aside the phenomenology it concedes is nonclassical (unbalanced beamsplitters, the functional form of the duality relation, Hardy’s interferometer). | Active — read in full 2026-09-25 (NOTE-018); It is the worked, experiment-by-experiment defence of placing interference in the weakly nonclassical column of LIT-007’s Table II, and it has the clearest statement of the Spekkens-school methodology (define classicality, formalize it, prove a no-go). Read §3, §4.3, §5.1 and App. A. Its noncontextuality claim for the toy field theory is asserted, not proved. |
| LIT-020 v2 | Characterizing Complex Networks with Forman-Ricci Curvature and Associated Geometric Flows | Weber et al. (2016), ARXIV-1607.08654. The paper specializes Forman’s (2003) Bochner–Weitzenböck curvature on weighted CW complexes to graphs, giving the closed-form edge curvature Ric_F(e) = ω(e)[ω(v1)/ω(e) + ω(v2)/ω(e) − Σ_{e_v1∼e, e_v2∼e}(ω(v1)/√(ω(e)ω(e_v1)) + ω(v2)/√(ω(e)ω(e_v2)))] (Eq. 11). It then proposes three uses: an EMD distance between curvature distributions, which puts Facebook, Google and BioGrid graphs at 0.050–0.060 from a Barabási–Albert model against 0.17–0.36 from Erdős–Rényi and Watts–Strogatz (Table 1); a discrete “2-D-form” Ricci flow γ̃(e) − γ(e) = −Ric_F(γ(e))·γ(e) (Eq. 36) for change detection; and a Laplacian flow ∂G/∂t = (□₁ − F)G (Eq. 45) for denoising. The authors say the flow applications are “only theoretically proposed and illustrated solely on a small example” (§5). | Active — read in full 2026-09-25 (NOTE-026); the standard early citation for Forman–Ricci curvature on networks and for the Forman–Ricci flow. Read it for §2.3 (Eqs. 11–17) and §4.1 (Eqs. 36–41), and cite it for definitions only. Its empirical and application claims are one-table or one-figure demonstrations. Several of its formulas contain sign and consistency slips, listed below, so a user should take Eq. 11 from here and check it against Sreejith et al. 2016. |
| 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-022 v2 | Is the United States Still a Liberal Democracy? | Drezner (2025), https://danieldrezner.substack.com/p/is-the-united-states-still-a-liberal. Drezner asks whether the US will still be a liberal constitutional democracy in January 2029. He reviews Polity’s downgrades (+10 in 2015 to +5 for 2020, and in February 2025 “at the cusp of autocracy”), the Freedom House fall from 92 to 83 (2014–2021, as quoted from Levitsky & Way) and counter-evidence (continued compliance with court orders; Hickman’s “not there yet”). He then concludes that “it is hard to disagree” with Levitsky & Way’s forecast of competitive authoritarianism, and expects democracy’s “precarity” to be the lasting condition. | Active — read in full 2026-09-25 (NOTE-001); a short, fair synthesis of the 2025 democracy-index downgrades, roughly half of it quotation; its central forecast is Levitsky & Way’s (“The Path to American Authoritarianism”, Foreign Affairs, Feb 2025), which is the primary source to read and is not held here. |
| LIT-023 v2 | Russian Hybrid Warfare | Clark (2020), https://www.understandingwar.org/sites/default/files/Russian%20Hybrid%20Warfare%20ISW%20Report%202020.pdf. Clark argues from open Russian military writing of 2015–2020, chiefly Military Thought and Army Collection, that Russia treats “hybrid war” as a type of war. In his account it is a strategic-level effort to reorient a target state, in which every action, conventional force included, is subordinate to an information campaign. He concludes that a US strategy centred on deterring great-power conventional war can “technically succeed” while losing. The report ends with 12 recommendations (executive-summary count). | Active — read in full 2026-09-25 (NOTE-012); worth reading as a clear, openly sourced statement of the “hybrid war is a type of war, not a toolkit” reading of 2015–2020 Russian military journals. Its representativeness rests on argument, not on a systematic sample, and its forward-looking claims predate 2022 and are not tested here. |
| LIT-024 v2 | Memorandum and Order granting motions to quash, In re Administrative Subpoena 25-1431-032 to Rhode Island Hospital (D.R.I., No. 1:26-mc-00007-MSM-AEM, ECF No. 38) [descriptive title] | McElroy (2026), https://storage.courtlistener.com/recap/gov.uscourts.rid.62049/gov.uscourts.rid.62049.38.0.pdf. Judge McElroy quashed DOJ HIPAA administrative subpoena No. 25-1431-032 (18 U.S.C. § 3486) to Rhode Island Hospital on three independent grounds: 1. no congressionally authorized purpose, because DOJ’s FDCA off-label “misbranding” theory against a prescribing hospital is not legally cognizable (Facteau; 21 U.S.C. §§ 396, 353(b)(2)); 2. issuance for an improper purpose in bad faith; 3. a Fourteenth Amendment informational-privacy violation for the children, with relief extended to all minors because a DCYF-only carve-out would itself expose DCYF wards. The court enjoined DOJ with respect to patient-identifying information and PHI produced under the subpoena, and stated that it quashed the subpoena, “not the enforcement order entered by the Texas court”. An amended order the next day (ECF 44) added “seeking” to the injunction. DOJ appealed (1st Cir. No. 26-1568; argument calendared for Oct 7, 2026). | Active — read in full 2026-09-25 (NOTE-024); A primary source worth reading for the informational-privacy holding and the inter-circuit procedural conflict. It is not final: it is on appeal, a First Circuit motions panel (concurrence) has questioned its merits, and it relies in part on QueerDoc, which the Ninth Circuit has since reversed. Read it with ECF 44, the May 18 Texas order and the May 19 First Circuit order. |
| 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-028 v2 | Asymptotic versus mesoscopic spectral dimensions in networks and inhomogeneous structures | Grimaldi et al. (2025), ARXIV-2510.20520. The paper studies a “bundled” network, meaning a fiber graph attached at one node to every node of a base graph, with base and fiber growing with the same length L. For such a network, first-order perturbation theory (SM Eq. 10) gives the low spectrum as λ = ℓ^b/N_f, and from that the gap (“Fiedler”) dimension d_g = 2(d_f,f + d_f,b)/(d_f,f + 2d_f,b/d_g,b), while the spectral dimension stays d_s = d_s,f. The two therefore differ unless d_g,b = 2 or the fiber is finite. For example, the ring-of-rings comb has d_s = 1 but d_g = 4/3, and the 2D-base brush has d_s = 1 but d_g = 2. The rule holds only while the base-induced gap lies below the fiber’s own gap (SM Eq. 14). | Active — read in full 2026-09-25 (NOTE-005); the base-controlled gap rule and its derivation are correct and easy to check, and they are worth reading as a clean, minimal example of the density-of-states exponent and the gap exponent coming apart. Read the SM finite-size scaling forms (Eqs. 25, 29) with care: their N prefactors are wrong except when d_s,b = d_g. |
| LIT-029 v2 | Long-Term Cognitive and Neuropsychiatric Consequences of Repetitive Concussion and Head-Impact Exposure | McAllister & McCrea (2017), DOI-10.4085/1062-6050-52.1.14. This review concludes that most athletes’ symptoms recover within about 1–2 weeks of a concussion. Evidence that repetitive concussion or sub-concussive head impacts cause long-term cognitive decline, neuropsychiatric change or neurodegeneration (including CTE) is mixed and preliminary, with signals of vulnerability in subgroups (e.g., verbal memory). Settling it needs large prospective longitudinal studies with baselines and controls. | Active — read 2026-10-14 (NOTE-858) in full; worth reading as a 2017 statement of what was and was not known about repetitive concussion: recovery within 1–2 weeks for most athletes, and no prospective longitudinal study of long-term cognitive, psychiatric or neurodegenerative risk. Read it knowing that it is a narrative review by authors of several studies it reviews, that its figures are second-hand, and that it predates the prospective CARE consortium results it calls for. |
| LIT-030 v2 | A Counterexample to the Mizohata-Takeuchi Conjecture | Cairo (2025), ARXIV-2502.06137. For every C² hypersurface Σ ⊂ ℝᵈ not lying in a hyperplane (implicitly: one with a point of non-zero curvature; see corrections), and every large R, there are f ∈ L²(Σ) and a weight w = |ĥ|² with supp ĥ ⊂ B_{CR} such that ∫|Ef|²w ≳ log R · ‖f‖²₂ · sup_ℓ ∫_ℓ w (Thm 1.2 via Prop. 3.1). So the Mizohata–Takeuchi conjecture and Stein’s conjecture (Conj. 1.4) are false as stated, and the CHV route to loss-free endpoint multilinear restriction is closed. The mechanism is a lattice Q of middle-layer subset sums of N ≍ log R points on Σ, chosen so that no hyperplane meets more than 2^{d−1} of the R⁻¹-balls around Q (Lemma 3.5). | Active — read in full 2026-09-25 (NOTE-051); a short, readable disproof of a 40-year-old conjecture in Fourier restriction. The counting argument is checkable by a non-specialist; the incidence lemma (§4) is the part that needs an expert. It is worth reading as mathematics. The “local” replacement it proposes (Conj. 1.5) has since been refuted for a dense family of C^k hypersurfaces by Cairo–Zhang (arXiv:2512.08064), so it should be read together with that paper. |
| LIT-032 v2 | A type theory for synthetic ∞-categories | Riehl & Shulman (2017), ARXIV-1705.07442. A three-layer type theory adds a directed interval 2 to HoTT. Its layers are cubes, topes (the coherent theory of a strict interval) and types, and simplices become shapes that can be mapped out of by extension types. One contractibility condition, “Segal” (unique fillers for the 2-1-horn), then yields associativity (Prop. 5.9) and 3-horn fillers (Prop. 5.21). It also makes every function a functor (Prop. 6.1), gives a dependent Yoneda lemma for covariant families (Thm. 9.5), and makes having a left adjoint a proposition when the adjoint’s codomain is Rezk (Thm. 11.23). The bisimplicial-sets semantics is sketched. Segal and Rezk types are shown to match Segal and complete Segal spaces (Props. A.21, A.25), and soundness is not proved in full. | Active — read in full 2026-09-25 (NOTE-069); This is the founding paper of simplicial HoTT, where synthetic (∞,1)-category theory starts. It is worth reading as mathematics by anyone following directed type theory. Its semantics appendix is explicitly a sketch. |
| LIT-033 v2 | Disenshittify or die! How hackers can seize the means of computation and build a new, good internet that is hardened against our asshole bosses’ insatiable horniness for enshittification [DEF CON 32 talk] | Doctorow (2024), https://www.youtube.com/watch?v=4EmstuO0Em8. Doctorow argues that platforms follow a three-stage decay cycle: good to users while locking them in, then good to business customers at users’ expense, then taking all the value for themselves. The mechanism is “twiddling”. It became possible when four disciplining forces weakened: competition, regulation, interoperability and tech-worker power. A “new, good internet” needs all four restored, with interop (reverse-engineering rights) and unionisation as the hacker-specific levers. The argument is assertion and anecdote throughout. It carries several checkable factual slips, notably about EU law and the court in United States v. Google. | Active — read in full 2026-09-25 (NOTE-041); The most compact first-person statement of the “four forces” version of the enshittification thesis, worth reading as advocacy with its evidence taken on trust. Its figures and legal claims need their own sources before anything rests on them. |
| LIT-034 v2 | The sound of an axon’s growth | Folz et al. (2018), ARXIV-1807.04799. The paper proposes that an axon can set its length from motor-generated oscillations without reading their frequency. Two Hill-type stages turn the period (which grows with length L) into a shape change and then into a change in the mean of a contractility signal R. Coupling growth-cone protrusion (v_g c_I) against R-driven contraction (v_s c_R) then gives a stable length: about 125 µm with sub-µm (< 1 %) oscillation for the Fig. 4a parameters. In part of parameter space the final length rises as kinesin influx J0 falls, or as dynein coupling J_O falls, qualitatively as in experiments. | Active — read in full 2026-09-25 (NOTE-067); A short, self-contained theory letter worth reading for its frequency-to-amplitude transduction argument (Eqs. 1–4) and the delay-equation length controller. It is a proof of mechanism, not a model fitted to axons: it has one parameter set, it never states the motor velocity v that converts its lengths into micrometres, and it proposes no experimental discriminator from gradient mechanisms. |
| 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-037 v3 | The Open Systems View | Cuffaro & Hartmann (2021), ARXIV-2112.11095. The paper argues philosophically, not formally, that the quantum theory of open systems “GT” is more fundamental than standard closed-system quantum theory “ST”. GT treats states as density operators that evolve, in general, non-unitarily, and it admits not-completely-positive maps. The ontic and epistemic cases each win only on a second, interpretation- or practice-laden criterion: OntFund-2 and EpFund-2. On the first, formal criteria (OntFund-1, EpFund-1) the two frameworks tie, and the authors say so because Stinespring dilation and dropping the Lindblad terms translate in both directions (§4.1, §4.2.1). Explanatory fundamentality is granted only deflationarily (ExFund-1), and the authors recommend dropping the notion (§4.2.2). The step from there to “the open systems view is fundamental tout court” (§4.3) rests on the special sciences and on “there are no other options”. | Active — read in full 2026-09-25 (NOTE-077); worth reading as the clearest statement of the “open systems view” and of the distinction between a view, a framework, a theory and a model (§2, §4.1, §5.2). Read it knowing that its fundamentality verdict is carried by interpretive premises (OntFund-2, EpFund-2) and a deflationary step, not by any formal asymmetry between the frameworks. |
| LIT-039 v2 | Rigorous renormalization group | Kupiainen (2023), DOI-10.1038/s41567-023-02233-x. A Comment, read in the author’s accepted manuscript. Rigorous RG iterates Wilson’s block-spin map on lattice Hamiltonians. Each step is controlled by a polymer (cluster) expansion that converges where fields are small and treats large fields as improbable. It proved Gaussian long-distance behaviour for massless 4D lattice φ⁴ and constructed the 2D Gross–Neveu model. Aizenman and Duminil-Copin showed continuum 4D φ⁴ is always Gaussian. The method is limited to near-Gaussian regimes. | Active — read 2026-10-14 (NOTE-821) in full, from the author’s accepted manuscript in the University of Helsinki repository; worth reading as a three-page orientation, by one of its principals, to what rigorous renormalization group is: Wilson’s block-spin step iterated, with each step made rigorous by cluster expansions that separate small and large fields, and what it proved (Gaussian long-distance behaviour of massless 4D lattice φ⁴; continuum 4D φ⁴ trivial; Gross–Neveu constructed). Read it knowing that it is a Comment with no proofs, that it speaks for the block-spin school, that it says nothing about learning, and that its claim that a non-perturbative formalism is missing is the author’s judgement. |
| LIT-041 v2 | The Work Capacity of Channels with Memory: Maximum Extractable Work in Percept-Action Loops | Fiderer et al. (2025), ARXIV-2504.06209. The paper models agent and environment as coupled finite hidden-Markov channels. It defines the environment’s work capacity C_work = max over agent models of ⟨H(A_t|M_t) − H(S_t|M_t)⟩_t (in k_BT ln 2 per round) and proves two things. First, for unifilar environments whose percepts ignore actions, the efficient agents are exactly the randomize-and-forget ∩ maximally-predictive ones, and C_work = log|A| − h(S). Second, one binary memoryless environment exists where predictive, max-entropy-action and efficient agents form three nonempty, pairwise-disjoint sets: every predictive agent extracts ≤ 0, uniform-random agents extract 1 − h(3/4) ≈ 0.189 bits, and the optimum is ½·log₂(3/4 + 1/√2) ≈ 0.272 bits, reached by a memoryless agent that plays action 0 with probability 1/√2. | Active — read in full 2026-09-25 (NOTE-032); worth reading for anyone working on the thermodynamics of prediction or agency. It gives a clean, fully proved extension of the tape-setting results (Boyd–Mandal–Crutchfield 2018) to feedback loops, and a sharp counterexample to “prediction is necessary for efficiency”. Read it knowing that the headline “trade-off” is shown by one existence example, that the example’s optimum simply forgets everything, and that Table I prints the memoryless-channel capacity with its sign flipped. |
| 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-044 v2 | The Epic Story of Maximum Likelihood | Stigler (2007), ARXIV-0804.2996. Stigler gives a history of maximum likelihood from Lagrange (1769) to Le Cam (1953). Fisher gave three optimality arguments. The 1922 one rests on the false belief that ML estimates are always sufficient. The 1925 “ANOVA” one derives the information inequality V ≥ 1/I(θ) from Var X = E Var(X|T) + Var E(X|T), treating approximate normality as exact. The third, sent privately to Hotelling in 1930, holds for multinomial models and smooth degree-0-homogeneous estimators, and was published only in disguise in 1935. Stigler’s verdict is that the Neyman–Scott growing-parameter example (Wald 1938, published 1948) is the practically important failure. He calls Hodges’s 1951 superefficiency example “an ingenious but minor technical achievement”, because the superefficiency set has Lebesgue measure zero (Le Cam 1953). | Active — read in full 2026-09-25 (NOTE-074); an authoritative, archive-based history by the leading historian of statistics, and worth reading for exactly which ML optimality claims were proved, under what conditions, and which counterexamples matter. It is a history, not a technical reference: for modern conditions it points to Bahadur (1964), Le Cam (1953, 1990), van der Vaart (1998) and Cox (2006). |
| LIT-045 v5 | Structural Realism | Ladyman (2007), https://plato.stanford.edu/entries/structural-realism/. The entry presents structural realism (Worrall 1989) as the attempt to keep both the no-miracles argument and the lesson of theory change. What is retained, and what we are entitled to believe, is structure, understood by ontic structuralists as modal structure. It sorts the view into an epistemic form, which falls to the Newman/Demopoulos–Friedman triviality result when stated as a Ramsey sentence (§3.2), and an ontic form with seven distinguishable theses, from eliminativism about individuals to “objects are constructs” (§4). The ontic form is motivated by quantum non-individuality and entanglement, gauge symmetry and the hole argument. The entry closes with seven objections, each answered in the author’s own voice (§5). | Active — read in full 2026-09-25 (NOTE-038); the standard map of the structural-realism literature, written by the founder of OSR. Read §2 for the theory-change argument, §3.2 for the Newman problem and §4’s seven OSR theses. Treat §5’s rebuttals as the author’s position, not as the field’s settled view. |
| LIT-048 v3 | Transfer Entropy as a Log-likelihood Ratio | Barnett & Bossomaier (2012), ARXIV-1205.6339. For a parametric Markov model f(x_t | x^k_t, y^k_t; θ) of X, the likelihood-ratio estimator T̂ = −(1/(n−k)) log Λ for the null “no dependence on Y’s past” converges almost surely to the transfer entropy T_{Y→X} (Theorem 1a). Under the null, 2(n−k)T̂ is asymptotically χ²(d), with d the difference in parameter counts (Theorem 1b). For finite-state chains the ordinary plug-in estimator is exactly this estimator, with d = (a−1)a^k(b^k−1). For a linear Gaussian VAR, T̂ is half the Granger-causality statistic. | Active — read in full 2026-09-25 (NOTE-053); a short, correct letter and the standard citation for reading transfer entropy as a log-likelihood ratio. The consistency proof is informal, and the χ² results are cited to Wald (1943) rather than proved, but the identity itself is exact and still the one to cite. |
| LIT-051 v2 | Lecture Notes on Control System Theory and Design | Başar et al. (2020), ARXIV-2007.01367. A conventional first-year graduate course in linear state-space control. It covers modelling and linearisation, LTI/LTV solutions, Lyapunov stability, controllability and observability with Kalman/Hautus tests and minimal realisations, then pole placement and observers, integral control, sensitivity, and finally HJB/LQR and a heuristic minimum principle. Its most useful non-standard content is the Pendubot thread (Chs 1, 9, 10): an observer-based design from one sensor is fragile (the compensator has an unstable pole at s ≈ 46.4), while full-state LQR has |S(jω)| ≤ 1, infinite gain margin and ±60° phase margin. Every worked example I recomputed is correct. | Active — read in full 2026-09-25 (NOTE-062); a sound, free, compact state-space control course, worth reading as background for LQR, Lyapunov and HJB when a reader needs one place for them. It is not a source for anything current, and the preface’s promise of a reinforcement-learning bridge is not delivered in the text. |
| LIT-052 v2 | SCOTUS allows Trump admin to send eight men to South Sudan with no process | Geidner (2025), https://www.lawdork.com/p/scotus-allows-trump-admin-to-send. The post reports that the Supreme Court, “on an apparent 7-2 vote”, held that the district court could not enforce its May 21 remedial order for the men held in Djibouti, because the Court had stayed the underlying April 18 injunction. It quotes the Kagan concurrence and the Sotomayor–Jackson dissent accurately. Against the order, its account of the holding is accurate. Its framing (the headline’s “with no process”, “Permission had been granted”, “seven justices are allowing”) goes beyond what the order decides. It also omits the majority’s reasoning, and it follows the dissent’s count of eight men where the per curiam refers to six. | Active — read in full 2026-09-25 (NOTE-048); an accurate secondary account of DHS v. D.V.D., No. 24A1153 (3 July 2025), whose order is the primary source to read and is not held here; its framing goes beyond what the order decides and omits the majority’s reasoning. |
| LIT-053 v2 | The Homological Nature of Entropy | Baudot & Bennequin (2015), DOI-10.3390/e17053253. On a finite probability space, take an information structure S (a set of partitions closed under joins that have a common refinement in S and containing the trivial partition) and a probability family Q complete for it. The information cohomology H*(S;Q) is computed by a Hochschild-type bar complex whose action is Shannon’s averaged conditioning. If S is connected and “sufficiently rich” and cochains are measurable, then H¹ is one-dimensional and spanned by Shannon entropy (Thm 1). This makes entropy the unique measurable 1-cocycle, up to one multiplicative constant per connected component. In the unitary-invariant quantum case H¹_U = 0: Shannon entropy is the coboundary of minus the von Neumann entropy, which is the unique invariant 0-cochain with that property up to an additive constant (Thm 3). The tree (“arborescent”) version again gives H¹ spanned by entropy (Thm 4). | Active — read in full 2026-09-25 (NOTE-088); the founding paper of information cohomology, with complete proofs of the degree-one results (Thms 1, 3, 4). Read it for those. Its broader programme (higher mutual informations as cocycles, super/sub-harmonicity, max-entropy discrimination) is sketched or deferred here to unpublished companion papers. |
| LIT-054 v2 | A complete graphical calculus for Spekkens’ toy bit theory | Backens & Duman (2014), ARXIV-1411.1618. Take the maximal-knowledge fragment of Spekkens’ toy bit theory with post-selected measurements, viewed as relations over {1,2,3,4}ⁿ. It has a ZX-style red–green graphical calculus that is universal (§4.3), sound (§4.4) and complete (Thm 17). Completeness goes through a proof that the toy theory’s binary “check-matrix” formalism coincides with the qubit stabilizer one (valid states SᵀJS = 0, valid transformations QᵀJQ = J, Lemma 3). With it come graph-state/local-complementation results for toy states (Thms 4–5), map–state duality (§5.2) and an rGS-LO normal form (Thms 10–11). The rewrite rules differ from the stabilizer ZX-calculus only through the phase group: Z₂×Z₂ against Z₄. That difference appears as an “11-commutation” rule in place of π-commutation (§4.5). | Active — read in full 2026-09-25 (NOTE-066); the completeness result is proved and still the diagrammatic reference for the toy bit theory. Read §2.1, §4.2, §4.5 and §5.1 for the stabilizer comparison. The ψ-epistemic framing in the abstract and §1 is motivation only; the paper does no ψ-epistemic analysis. |
| LIT-055 v2 | Who Goes Nazi? | Thompson (1941), https://harpers.org/archive/1941/08/who-goes-nazi/. Thompson’s answer is that susceptibility to Nazism is “something in them”, not race, nationality, creed or class. She argues it through fourteen character sketches of guests at an imagined New York party. People with an inner code, security or happiness “never go Nazi”. The humiliated intellectual, the scared speculator, the spoiled son, the labour boss and the success-chaser “would all go Nazi in a crisis”. It is a journalist’s typology from experience in Germany, Austria and France, and no data supports it. | Active — read in full 2026-09-25 (NOTE-056); A primary historical text, and the source of a still-circulating heuristic, worth reading as what one experienced anti-fascist observer believed in 1941. It is not evidence for what predicts fascist support. |
| LIT-056 v3 | Consciousness in Artificial Intelligence: Insights from the Science of Consciousness | Butlin et al. (2023), ARXIV-2308.08708. The report assumes computational functionalism and takes a “theory-heavy” approach. From it the authors derive 14 indicator properties: RPT-1–2, GWT-1–4, HOT-1–4, AST-1, PP-1 and AE-1–2. The claim for them is only that more of them raises the probability of consciousness. They assess a handful of systems against subsets of the list and conclude that no current system “appears to be a strong candidate”. Transformer LLMs have “only a relatively weak case” for any GWT indicator, because a single forward pass has no recurrence or global broadcast. Perceiver arguably has GWT-1, GWT-2 and half of GWT-4 but lacks broadcast. Among the embodied agents, AdA is the likeliest to meet AE-2. Most indicators could be built with standard ML techniques. The abstract’s “no current AI systems are conscious” is stronger than anything the body shows. | Active — read in full 2026-09-25 (NOTE-052); the reference statement of the indicator-property (“theory-heavy”) approach to AI consciousness, worth reading for §1–§2 (method and theory survey) and Tables 1–2. Its §3.2 system verdicts are architecture-dated and cover only GWT and agency/embodiment. The 2026 Trends in Cognitive Sciences paper by an overlapping 20-author group may now be the citable version; I have not read it, so this should not yet be marked Superseded. |
| LIT-058 v3 | Mutual Information and Minimum Mean-square Error in Gaussian Channels | Guo et al. (2004), arXiv:cs/0412108. Let Y = √snr·X + N with N ~ N(0,1) independent of X, and let X have any distribution with E X² < ∞. Then d/dsnr I(X; √snr X + N) = ½·mmse(X | √snr X + N) in nats, equivalently I(snr) = ½∫₀^snr mmse(γ) dγ (Thm 1, Eq. 47). The vector form is d/dsnr I(X; √snr HX + N) = ½·E‖HX − H·E[X|Y]‖² (Thm 2). In continuous time, the same identity combined with Duncan’s I = (snr/2)·cmmse gives cmmse(snr) = (1/snr)∫₀^snr mmse(γ) dγ (Thm 8). | Active — read in full 2026-09-25 (NOTE-086); the founding statement and proof of the I-MMSE identity. It is fully proved (five proofs, with the interchange of limits justified in App. IV) and it remains the reference. Read §II-C for the incremental-channel proof and §V-B for the one place it fails (feedback). |
| LIT-061 v2 | Mike Johnson’s Institutional Betrayal | Moynihan (2026), https://donmoynihan.substack.com/p/mike-johnsons-institution…. Moynihan argues that, in the 2026 DHS appropriations lapse, Speaker Johnson refused a vote on the Senate’s bill (which funded DHS except ICE and CBP) and passed a Trump-backed full-DHS bill, then recessed. In doing so he backed a presidential memo directing TSA pay from unspecified funds with a “reasonable and logical nexus to TSA operations”. Moynihan calls this ceding Congress’s power of the purse. His distinction is that the President may pay staff during a lapse only from an identifiable appropriation, which exists for ICE and CBP (under the One Big Beautiful Bill Act) and not for TSA. | Active — read in full 2026-09-25 (NOTE-084); A clear, well-sourced piece of commentary on one episode of the 2025–26 appropriations conflict, worth reading as argument. Its main factual premise (the memo names no appropriation) checks out against the memo, and its timeline comes from news reports it links. |
| LIT-062 v3 | On the reality of the quantum state | Pusey et al. (2011), ARXIV-1111.3328. Take pure states |ψ0⟩, |ψ1⟩ with |⟨ψ0|ψ1⟩| = cos θ. Assume (a) a model assigns each preparation a distribution µ_i(λ) over physical states, (b) n independent preparations yield the product distribution µ_{x1}(λ1)⋯µ_{xn}(λn), and (c) outcome probabilities depend only on (λ1, …, λn). If the model’s predictions are within ε of quantum theory, then D(µ0, µ1) ≥ 1 − 2ε^{1/n} for any n with 2^{1/n} − 1 ≤ tan(θ/2) (Eq. 7, App. B). At ε = 0 the distributions for distinct pure states cannot overlap on a set of non-zero measure, so Harrigan–Spekkens ψ-epistemic models are ruled out. | Active — read in full 2026-09-25 (NOTE-030); the founding ψ-ontology theorem. It is short, fully proved (App. A–B), and still the reference that every later ψ-epistemic/ψ-ontic argument, including LIT-007 §I.C and LIT-090, positions itself against. Read it with its assumption (b)–(c) in view, since that is where every response pushes. |
| LIT-063 v2 | The indeterminacy of word segmentation and the nature of morphology and syntax | Haspelmath (2011), DOI-10.1515/flin.2011.002. Haspelmath tests ten morphosyntactic criteria for wordhood and finds that none is necessary and sufficient. No combination picks out what linguists write between spaces, and published test batteries pick criteria opportunistically (Table 1: nine studies, no two with the same battery). Hence (41, p. 65): “Linguists have no good basis for identifying words across languages, and hence no good basis for a general distinction between syntax and morphology”. A fuzzy “word” would rescue the distinction only if units on the boundness continuum were shown to cluster, and that is untested (§6). | Active — read in full 2026-09-25 (NOTE-073); This is the standard statement of the negative case about the cross-linguistic word, and both LIT-071 and LIT-031 cite it for exactly that; read it with the author’s own later constructive follow-up, “Defining the word” (WORD 69(3), 2023, not read here). |
| LIT-065 v2 | Grand jury transcript, In re Grand Jury Investigation 25 GJ 994, October 9, 2025 (“Broadview Six”) [descriptive title] | U.S. District Court for the Northern District of Illinois et al. (2026), https://www.documentcloud.org/documents/28220756-10925/. At the 9 Oct 2025 session (Special June 2024 Grand Jury, 25 GJ 994), AUSA Sheri Mecklenburg opened by telling the jurors she had waited for “the Thursday grand jury” because “I know you and I trust you … and I would never ask you to charge somebody if I didn’t think there was probable cause” (tr. 3). The only witness was FBI Special Agent Evan Hylton (tr. 10–61). He answered mostly “Yes” to leading questions: on the driver’s second-hand account, on his own photos of the car taken 1 Oct, and on social-media identifications of the six. Jurors then pressed on the damage, the conspiracy theory and whether the driver was yet on duty. One said “I personally feel the complete opposite way” (tr. 75). The vote is not in the transcript; press reports it as a “no bill”. | Active — read in full 2026-09-25 (NOTE-033); This is the complete primary record of the first, reportedly no-billed, presentation. It is the document a reader should consult on the vouching and presentation questions, rather than press paraphrase. |
| LIT-066 v3 | The varieties of contemplative experience: A mixed-methods study of meditation-related challenges in Western Buddhists | Lindahl et al. (2017), DOI-10.1371/journal.pone.0176239. This is a qualitative taxonomy, not a prevalence estimate. Sixty Western Buddhist meditators were recruited for having had meditation-related difficulties, and 32 teachers/clinicians were interviewed. Their accounts were coded into 59 experience categories in 7 domains and 26 influencing-factor categories in 4 domains. The most frequent category was fear/anxiety/panic/paranoia (82%). 73% reported moderate-to-severe impairment in at least one domain, 17% suicidality and 17% inpatient hospitalisation. Median symptom duration was 1–3 years. All of these are frequencies within a sample selected for difficulty, as the authors state. | Active — read in full 2026-09-25 (NOTE-036); the reference taxonomy of challenging meditation-related experiences and worth reading for its codebook and its explicit limits. Its frequencies and its “causality” scoring do not support prevalence or causal claims, and the authors say so. |
| LIT-067 v2 | A Social Equilibrium Existence Theorem | Debreu (1952), DOI-10.1073/pnas.38.10.886. Debreu proves existence of an equilibrium for an “abstract economy” (generalized game), in which each agent’s feasible set A_ι(ā_ι) depends on the others’ actions. The conditions: each action set 𝔄_ι is a contractible polyhedron; A_ι has a closed graph with non-empty compact values; f_ι is continuous on the graph into the extended reals; the value function φ_ι(ā_ι) = max f_ι is continuous; and each best-response set M_ā_ι is contractible. The proof applies the Eilenberg–Montgomery/Begle fixed-point theorem to the product best-response map. A Remark replaces the joint continuity of φ_ι with continuity (lower hemicontinuity) of A_ι plus a compact graph. A Corollary gives a saddle-point theorem that contains Kakutani’s and von Neumann’s. | Active — read in full 2026-09-25 (NOTE-037); the original existence theorem for generalized (constrained) games, underlying Arrow–Debreu (1954). Short, fully self-contained, and still the canonical citation. Later results (Shafer–Sonnenschein 1975; the generalized-Nash literature) weaken its hypotheses but do not supersede it as the source. |
| LIT-071 v2 | The lexicalist hypothesis: Both wrong and superfluous | Bruening (2018), DOI-10.1353/lan.2018.0000. Bruening argues that the lexicalist hypothesis is wrong on three counts. Phrases feed word formation productively (phrasal compounds, zero-derivation from phrases, German resultative nominalizations), ellipsis and focus target both phrases and morphemes, and the claimed principled differences between the word system and the phrase system (locality, adjuncts, headedness, idiosyncrasy) do not hold. It is also superfluous: every restriction it was meant to explain follows from constraints stated over X0 vs XP and from the selectional properties of individual affixes, none of which mention “word”. So one combinatorial component should build words and phrases. | Active — read in full 2026-09-25 (NOTE-065); This is the most complete single-article case against lexical integrity from inside generative syntax, and it is the syntactic source LIT-031 cites; read it together with Müller’s 2018 reply in the same volume, which disputes its extraction, coordination and resultative arguments. |
| LIT-072 v2 | Iranian Hackers Targeted US Officials in Elaborate Social Media Attack Operation | Lennon (2014), https://www.securityweek.com/iranian-hackers-targeted-us-officials-ela…. SecurityWeek relays iSIGHT Partners’ claim that more than a dozen fake personas, supported by a fake news site (NewsOnAir.org), ran a social-media espionage campaign from 2011 aimed at US military, diplomatic, congressional, press, think-tank and defence targets. The purpose was credential phishing and reconnaissance. Iranian origin is inferred from targeting, “technical indicators” and a Tehran working-day schedule, and iSIGHT says it has “no information implicating the ultimate sponsor”. The article’s figure of “over 2,000” is connections to the personas, not confirmed victims. iSIGHT itself says it is “not clear … how many credentials the attack has captured”. | Active — read in full 2026-09-25 (NOTE-058); a faithful relay of iSIGHT Partners’ public NEWSCASTER disclosure (28 May 2014), which is the primary source to read and is not held here; every passage this article attributes to a ‘closely held report’ is in that public disclosure, and ‘2,000’ counts connections, not victims. |
| LIT-073 v2 | General probabilistic theories: An introduction | Plávala (2021), ARXIV-2103.07469. A self-contained textbook on finite-dimensional GPTs whose central results are that state spaces and effects are dual (K = {φ ∈ A(K)*+ : ⟨φ, 1_K⟩ = 1}, Thm 3.19) and that optimal two-state discrimination succeeds with probability ½(1 + ‖λx₀ − (1−λ)x₁‖) in base norm (Thm 3.43). Every composite lies between the minimal and maximal tensor products (Prop. 5.6), and four statements are equivalent: id_K is measure-and-prepare, id_K is self-compatible, K admits a universal broadcasting channel, and K is a simplex (Thm 7.7); minimal = maximal iff one factor is a simplex is cited to [134], not proved. | Active — read in full 2026-09-25 (NOTE-035); the best single entry point to the GPT vocabulary this record’s Spekkens-programme readings presuppose (state space, effect algebra, GPT dimension, tomographic locality, minimal/maximal tensor products, measure-and-prepare). Read §2–3, §5.1, §5.5, §6.1–6.5 and §7.1. It is not the place for restricted theories like Spekkens’ toy theory, to which §3.7 gives a single paragraph. |
| 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-076 v2 | Performing all-atom molecular dynamics simulations of intrinsically disordered proteins with replica exchange solute tempering | Koneru et al. (2025), ARXIV-2505.01860. A how-to chapter for REST2 enhanced sampling of intrinsically disordered proteins in GROMACS 2022.5 with PLUMED 2.9.0, worked on the α-synuclein C-terminal fragment (residues 121–140) with the a99SB-disp force field and water. The example uses 10 replicas, a solute-temperature ladder from 300 K to 450 K, swap attempts every 1.6 ps, and a ≥ ~20 % acceptance target. Its load-bearing methodological point is that high swap acceptance “is not, in isolation, sufficient evidence of robust conformational sampling or convergence”. Convergence has to be judged by comparing demultiplexed replicas’ structural distributions, with blocking-analysis errors. | Active — read in full 2026-09-25 (NOTE-076); A practical, current protocol worth reading for anyone setting up REST2 on an IDP, especially the starting-structure advice and the demultiplexed-replica convergence checks. It is a tutorial, not a benchmark: it reports no quantitative results and makes no comparison with REST3, REHT or tREMD. It also has a few textual errors, listed below; the repository is the ground truth for the example. |
| LIT-077 v2 | What is quantum in quantum randomness? | Grangier & Auffèves (2018), ARXIV-1804.04807. The paper argues informally, with no equations anywhere in it, that an “elementary” system with a fixed finite number N of exclusive modalities, placed in contexts that can change, must behave unpredictably when the context changes: a return to C1 after C2 cannot be certain, or there would be N² > N joint modalities (p. 4). It asserts that adding one condition, that the context can change continuously, makes the N×N modality-transition matrix unistochastic, i.e. Born-rule, but defers that proof to refs [14, 15] (p. 5). The anti-reductionist conclusion follows from Postulate 0, which declares contexts non-contextual by definition, not from an argument against decoherence. | Active — read in full 2026-09-25 (NOTE-044); a short, equation-free position paper whose one argument of its own is an informal N = 2 reductio; read it for the position, and read the derivation it cites — Auffèves & Grangier, Sci. Rep. 2017 (arXiv 1610.06164) and arXiv 1801.01398, neither held here — for the result. |
| LIT-078 v2 | Kerr County Commissioners’ Court, Regular Session, Monday, June 27, 2016 — verbatim transcript [descriptive title] | Kerr County Commissioners’ Court et al. (2016), https://legacy.co.kerr.tx.us/commcrt/minutes/2016/062716CC.txt. This is a routine regular session of the Kerr County Commissioners’ Court, all motions 4–0. In the reports item (tr. 95–98), Commissioner Moser announced a steering-committee meeting “this Thursday” on a Kerr County flood warning system. He said: - an engineering analysis of the entire system would cost roughly 20,000; - Comal County spent about $320,000 on 8 sensor locations plus central command and control; - a countywide system might be “a million dollar thing”. Commissioner Baldwin said the old phone chain “still works” and objected to “these damn sirens going off in the middle of night”. | Active — read in full 2026-09-25 (NOTE-087); This is a primary local-government record. The flood-warning exchange is captured verbatim and is the reason to read it. It should be read alongside the follow-up meetings, not alone. |
| 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-081 v2 | Ensemble Steering, Weak Self-Duality, and the Structure of Probabilistic Theories | Barnum et al. (2009), ARXIV-0912.5532. A bipartite state ω steers its B-marginal iff ω̂ : [0,u_A] → [0,ω_B] is a strong quotient map of ordered sets (Thm 5.4). When ω̂ is injective and the marginal is interior, a steering state is an order-isomorphism (Cor. 5.5). With Thm 4.1/Cor. 4.2, it follows that universal self-steering makes every irreducible state space homogeneous and weakly self-dual (Prop. 5.8). The step from there to C*-algebraic quantum theory needs strong self-duality, which the paper does not derive, and a Hanche-Olsen correspondence it defers (“as we will establish elsewhere”, §6). | Active — read in full 2026-09-25 (NOTE-082); a short, readable and mostly proved link from an operational feature (ensemble steering) to cone geometry (homogeneity, weak self-duality). It remains a standard reference for the steering route in GPT reconstructions. Read it with the open weak/strong self-duality gap and the thin argument for Prop. 5.7 in view. |
| LIT-082 v2 | Unification of observational entropy with maximum entropy principles | Schindler et al. (2025), ARXIV-2503.15612. The paper defines S^τ_M(ρ) = S(τ) − D_M(ρ‖τ) = −Σ_x p_x log(p_x/V_x), with V_x = Tr(τM_x)e^{S(τ)} (Eqs. 10–12). It is bounded as S(τ) ≥ S^τ_M(ρ) ≥ S(ρ) when ρ obeys the constraint S(ρ;τ) ≤ S(τ) (Eqs. 17–18). It reduces to 24 listed entropies, and it removes traditional observational entropy’s infinite-dimensional pathologies whenever S(τ) < ∞ (§VIII.7). Its “second laws” are bounds D_M(ρ̄‖τ) ≤ ε on the time-averaged state, split as equilibration plus prior-fit (Eq. 27). The paper proves the first term small in two regimes (Eqs. 28–29) and the second only under the ETH (Eq. 31). It states that in its own numerical examples the smallness “was [not] proved here analytically” (p. 12). | Active — read in full 2026-09-25 (NOTE-043); worth reading as the reference definition of prior-generalised observational entropy and for its catalogue of special cases (§V, Table II). The unification is definitional and its bounds are correct. The second-law programme is a framework plus partial sufficient conditions, not a proved second law for any concrete system. |
| LIT-084 v2 | 3rd EEAS Report on Foreign Information Manipulation and Interference Threats: Exposing the architecture of FIMI operations | European External Action Service et al. (2025), https://www.eeas.europa.eu/sites/default/files/documents/2025/EEAS-3nd-ThreatReport-March-2025-05-Digital-HD.pdf. The EEAS classifies channels in foreign information manipulation and interference (FIMI) into four tiers by their tie to a state: official, state-controlled, state-linked (covert, attributed) and state-aligned (non-attributed). It applies the scheme to 505 incidents it detected between 4 Nov 2023 and 4 Nov 2024, involving about 38,000 channels. In a filtered co-involvement graph of 2,055 recurrent channels, 20% are Russian-attributed, 3.5% Chinese-attributed and 76.5% non-attributed. The report states that the sample is illustrative and should not be used to infer general trends. | Active — read in full 2026-09-25 (NOTE-060); worth reading as the primary statement of the EEAS’s attribution taxonomy (the Exposure Matrix) and of the covert operations it names. Its figures are counts from an avowedly non-representative monitoring sample, the network method is described only in outline, and several headline numbers need the qualifications recorded here before they are cited. |
| LIT-085 v3 | The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo | Hoffman & Gelman (2011), ARXIV-1111.4246. NUTS removes HMC’s step-count L. It doubles a leapfrog trajectory forwards and backwards in random directions until some balanced subtree satisfies (θ⁺−θ⁻)·r⁻ < 0 or (θ⁺−θ⁻)·r⁺ < 0. It keeps detailed balance by slice sampling and by excluding states that could not have regenerated the tree. With ε set by a dual-averaging scheme (γ = 0.05, t₀ = 10, κ = 0.75, target δ ≈ 0.6), it matched the best hand-tuned HMC in ESS per gradient on two logistic-regression posteriors. It beat that HMC by about 3× on a 250-D Gaussian and on a 3001-D stochastic-volatility model (§4.4). | Active — read in full 2026-09-25 (NOTE-081); This is the source of the default sampler in Stan, PyMC and NumPyro, and it is worth reading for its derivation. The algorithm as run today, with multinomial rather than slice selection and adapted mass matrices, is documented elsewhere. A reader who wants current practice should read this paper together with that later account. |
| LIT-086 v2 | The Stochastic-Quantum Correspondence | Barandes (2023), ARXIV-2302.10778. Take any N×N stochastic transition matrix Γ(t←0) on a configuration space. Writing it entrywise as Γ_ij = |Θ_ij|² = tr(Θ†P_iΘP_j) (Eq. 15) is always possible, and the paper calls it the stochastic-quantum dictionary. Choosing Θ unitary (by Stinespring dilation to ≤N³ configurations, §3.4) makes Γ unistochastic. The Born rule in the configuration basis (Eq. 23), the Schrödinger equation (Eq. 35, with H ≡ iħ(∂U/∂t)U†) and interference (Eq. 43, the gap between Γ(t←0) and |U(t←t′)|²|U(t′←0)|²) then follow by definition or short algebra. The Born rule for non-diagonal observables (Eq. 78) is derived by reading a measuring device’s configuration, given a composite unitary that produces Eq. (73). | Active — read in full 2026-09-25 (NOTE-080); the clearest single statement of the indivisible-stochastic-process reading of quantum theory, and its measurement model (§4) is worth reading. Discount its “new result” labels: the dictionary is an identity, the Schrödinger equation is the definition of H, and unitarity is a representational choice the paper’s own gauge footnote does not preserve. |
| LIT-087 v2 | Assessing grand narratives of economic inequality across time | Feinman et al. (2025), DOI-10.1073/pnas.2400698121. Across a global archaeological house-size compilation (SiteGiniLevel: 1,176 sites, 47,019 houses), site Gini coefficients rise only weakly with the number of political levels (r² = 0.16 all sites, 0.22 apex, 0.27 H50) and with log polity population (r² = 0.11, 0.21, 0.08; values printed on Fig. 2, not in the text). The spread widens at three or more levels. A 0–3 expert-coded autocracy score does about as well (r² = 0.10, 0.18, 0.32; Fig. S4), and its sum with levels (“Hierarchical Clout”) reaches r² = 0.30 (apex), 0.42 (H50) and 0.50 (H100). All tests are bivariate OLS fits with no controls and no correction for many sites sharing polity-level values. | Active — read in full 2026-09-25 (NOTE-049); worth reading as the widest quantitative record of premodern wealth disparity and a clear rebuttal of deterministic scale-drives-inequality narratives, a negative claim the scatterplots support well. Its positive claim that governance “matters” rests on bivariate r² from an expert-coded index whose “architecture” dimension overlaps with the house-size outcome, and should be read as suggestive. |
| LIT-088 v2 | The Russian perspective on information warfare: conceptual roots and politicisation in Russian academic, political, and public discourse | Fridman (2017), DOI-10.30966/2018.riga.2.3. Fridman argues that the Russian narrative of a “Western information war against Russia” draws on three independently developed theories: Messner’s subversion-war (myatezhevoyna), Dugin’s net-centric war and Panarin’s information war. In his account, politicisation of the narrative was not led by the Kremlin. It is a mutually reinforcing process: scholars promote it, the government writes it into doctrine and law, and a public receptive to it absorbs it. He cites Levada polling from December 2014 in which 87% saw the West as hostile and 42% said the hostility took the form of information war. His conclusion is that the truth lies “somewhere in the middle” between top-down manipulation and bottom-up demand. | Active — read in full 2026-09-25 (NOTE-070); worth reading as a compact, well-footnoted intellectual history of the Russian “information war against Russia” discourse, drawn from Russian-language academic sources. Its account of who drives the politicisation is interpretive, and its chronological argument against Kremlin direction is weaker for Dugin, whose net-centric concept dates from 2007. |
| LIT-089 v2 | Software engineering job openings hit five-year low? | Orosz (2025), https://blog.pragmaticengineer.com/software-engineer-jobs-five-year-lo…. Orosz reports that US software-development postings on Indeed stood at 65% of the pre-pandemic baseline, “3.5x” below the 2022 peak and 8% down year on year, while all postings were +10%. He attributes most of the fall to the end of zero interest rates, gives GenAI a secondary “wait and see” role, and doubts Indeed’s coverage. - Against Indeed’s current data the headline US figures reproduce: 65.2, peak ratio 3.59×, −8.3% y/y, all postings 109.5. - Several side figures and one comparative claim do not reproduce (see corrections). | Active — read in full 2026-09-25 (NOTE-039); its headline figures reproduce from Indeed Hiring Lab’s postings series, which is the primary source and is not held here; several secondary claims (the sector comparison, the hospitality figure, the peak month) do not. |
| LIT-090 v3 | Could wavefunctions simultaneously represent knowledge and reality? | Hance et al. (2021), ARXIV-2101.06436. The paper argues, informally and without formal results, that Harrigan–Spekkens’ ψ-ontic/ψ-epistemic are contradictories only by stipulation. On the informal senses, “represents reality” and “represents knowledge”, a wavefunction can be both. It offers a weaker sufficient condition for “epistemic” (Eq. 6: for some ψ, A, S, the response function A(S|λ) is not equal to the Born probability p^ψ_A(S) throughout Λψ), which non-overlapping models can meet. It concludes that PBR “shows that wavefunctions cannot overlap on state space, but it says nothing about whether they are epistemic in the broader sense”, so it “does not rule out all epistemic models” (§V). | Active — read in full 2026-09-25 (NOTE-072); a short, clear statement that ψ-epistemic in the Harrigan–Spekkens sense is narrower than “epistemic”, worth reading for §III–V as a terminological caution when citing PBR. Its positive criterion (Eq. 6) is weak, since it amounts to predictive incompleteness of ψ. Its Appendix A contains claims that the record’s own readings contradict. |
| 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-092 v2 | DOJ Changes Course | Vance (2026), https://joycevance.substack.com/p/doj-changes-course. Vance reports that on 3 Mar 2026, the day after moving to voluntarily dismiss its appeals in the consolidated law-firm executive-order cases (D.C. Cir. No. 25-5241), DOJ filed a “Motion To Withdraw Motion To Voluntarily Dismiss Appeals”, over the firms’ opposition. She calls the reversal “enormously unusual” and argues it shows DOJ serving “the whims of the president” at a cost to its credibility and the presumption of regularity. She gives further examples from Minnesota habeas contempt proceedings, the Epstein files and Senator Tillis’s call for Secretary Noem to resign. | Active — read in full 2026-09-25 (NOTE-063); a short commentary on DOJ’s 3 March 2026 motion in the D.C. Circuit (No. 25-5241) to withdraw its motion to dismiss the law-firm executive-order appeals; the docket is the primary source and is not held here. |
| LIT-093 v2 | Notes on the Multiplicative Ergodic Theorem | Filip (2017), ARXIV-1710.10694. Expository notes that prove the Oseledets theorem in four ways. §2 uses projective invariant measures and a splitting lemma, without Kingman. §3.5 checks Kaimanovich’s regularity criterion in the symmetric space GLₙ/Oₙ, using Kingman. §4 proves the Karlsson–Ledrappier horofunction theorem (for µ-a.e. ω there is a horofunction h_ω with −(1/N)h_ω(g_ω⋯g_{T^{N−1}ω}x₀) → l) for isometries of proper metric spaces. §5 gives an L² “mean” version via Monod’s direct integrals of CAT(0) spaces and Karlsson–Margulis tracking, with an L² mean Kingman theorem. Two of the notes’ own derivations do not work as written: Proposition 3.4.8(iii) is mis-stated, and the Lemma 5.1.5 step in the tracking proof does not apply as claimed. The main theorems are standard and not in doubt. | Active — read in full 2026-09-25 (NOTE-078); a good, short guide to the geometric view of Lyapunov exponents (symmetric spaces, horofunctions, CAT(0) direct integrals), worth reading for the §2 and §4 proofs. Read Kaimanovich’s theorem (proved here only for H²), Prop. 3.4.8 and the §5.3 tracking proof critically, and do not use it as a source of ML claims; it makes none. |
| LIT-094 v2 | Airbnb and its potential impact on the London housing market | Shabrina et al. (2021), DOI-10.1177/0042098020970865. Using Inside Airbnb data, “possible misuse” is defined as entire-home listings available for more than 180 days a year whose host has 2 or more listings. On that definition, about 0.16% of London’s housing stock (≈5,300 homes) was possibly misused in 2018, rising to 3.5–7% in a few central LSOAs. Across LSOAs, misuse correlates weakly with purpose-built flats (r = +0.28), private renting (+0.33) and low dwelling-type entropy (−0.14). In a 33-borough OLS with 4 predictors, logged 2015 misuse has β = 0.084 (p = 0.001) on a min–max-normalised 2015–17 rent change. The paper translates this as “a 100% increase … up to 8%” in rent, which is £90 a year. | Active — read in full 2026-09-25 (NOTE-071); worth reading as a descriptive map of possibly non-compliant Airbnb supply in London and for its misuse definition. Its rent result is a 33-observation cross-sectional association whose “8% per doubling” translation does not follow from the reported model, and it should not be cited as an effect size. |
| LIT-095 | Two-Level Type Theory and Applications | Annenkov et al. (2017), ARXIV-1705.03307; Mathematical Structures in Computer Science 2023. Two-level type theory (2LTT) pairs a fibrant inner theory (HoTT) with an outer theory with strict equality, so that coherence towers such as semisimplicial types can be stated internally. Basic 2LTT is conservative over HoTT (Props 2.18–2.19): an inner type inhabited in 2LTT is already inhabited in HoTT. A fibrant-replacement type former would force UIP on the inner level (Thm 2.20). | Active — read in part on 2026-09-26, alongside the nLab page it supersedes (LIT-040) — §1–3, §4.7 and §5 in full, §4.3–4.6 at the level of statements; no NOTE yet, so a full reading is still owed |
| LIT-096 | What Is It Like to Be a Bat? | Nagel (1974), DOI-10.2307/2183914. An organism has conscious states if and only if there is something it is like to be that organism. That subjective character belongs to a type of point of view, and it is left out by every functional, intentional or causal analysis, since each is compatible with its absence. Reduction elsewhere moves away from a point of view toward the objective; here that move leads away from the thing being explained. So physicalism may be true, but we have no conception of how it could be. Nagel proposes an “objective phenomenology” that would describe experience to beings who cannot have it. | Active — read in full 2026-09-26 (NOTE-089); the source of the “something it is like” criterion of consciousness that the record’s AI-consciousness work (LIT-056) adopts as its target, and of the argument that no functional analysis can settle whether that criterion is met. |
| LIT-097 v4 | The Extended Mind | Clark & Chalmers (1998), DOI-10.1093/analys/58.1.7. The paper argues from a functionalist parity claim that a process or standing state which would count as cognitive if it happened in the head counts as cognitive when an external resource carries it, provided the resource is actively coupled to the organism here and now. Otto’s notebook entry is its example of such a standing belief. From this it infers, in one paragraph, that the self extends too. The four “criteria” for a coupled resource (constancy, direct availability, automatic endorsement, and the admittedly “arguable” past conscious endorsement) are offered as the features that make the paradigm case clear. The paper explicitly says they are not necessary and sufficient conditions. | Active — read in full 2026-09-26 (NOTE-180); it is worth reading as the source text of the extended-mind thesis, and it is short. Its constitutive conclusion follows from a role-functionalism about belief and a parity principle that the paper states rather than defends, so a reader should take it as the origin of the debate and not as its settlement. |
| LIT-098 v2 | Health and Disease Concepts Cannot Be Grounded in Social Justice Alone | Veit (2025), DOI-10.52685/cjp.25.73.7. Kukla’s “institutional definition” makes a condition a health condition iff medicalising it would be best for collective wellbeing. Veit argues that any purely normativist definition of this kind defeats itself for two reasons. First, leaving “social justice” undefined lets a majority with other values medicalise what Kukla wanted to protect. Second, unless the institution of medicine is fixed from outside, the medical toolkit co-evolves until “health would simply become justice” (p. 15). His remedy is pluralism: at least three separate accounts, with justice linked to health empirically, not conceptually. | Active — read in full 2026-09-26 (NOTE-097); worth reading as a short, clearly structured critique of moral conceptual engineering applied to health, though its two objections rest on informal argument and a thought experiment, not on an engagement with Kukla’s replies. |
| LIT-099 v2 | Framing Effects in Object Perception | Ivy & Mroczko-Wąsowicz (2025), DOI-10.1007/s13164-024-00763-8. A conceptual proposal with no new data. “Perceptual frames” are learned adaptations of the perceptual system, installed diachronically, often top-down, and then operating bottom-up. They let perceivers given identical input individuate different perceptual objects (the Bach motif, the radiologist’s tumour, the Teufel et al. two-tone image). So cognition shapes the perceptual system even if it is left open whether any single percept is penetrated. Support is a survey of others’ findings (Ernst & Banks 2002 cue weighting, prism adaptation, Teufel et al. 2018, expert anticipation) read through the frame concept. | Active — read in full 2026-09-26 (NOTE-150); worth reading as a clear, short statement of a “system-level versus episode-level” way through the cognitive-penetrability debate, provided the reader knows that its empirical sections interpret others’ results and do not test the frame concept against its rivals. |
| LIT-100 v2 | Quantum States for Primitive Ontologists: A Case Study | Belot (2011), DOI-10.1007/s13194-011-0024-8. Inside primitive-ontology Bohmian mechanics, Belot compares four readings of the quantum state: a field on configuration space, a multi-field on 3-space, a law, and a history of velocity dispositions of the particle system. Every reading except the multi-field carries a hard open question: why the world looks 3-dimensional, whether laws can be time-indexed, and whether dispositions lose content. The last is shown by the particle in a box, where every energy eigenstate φn = sin(πnx) induces the same at-rest disposition. The orthodox should prefer the multi-field reading; Belot, on van Fraassen’s view of interpretation, prefers to keep the others alive. | Active — read in full 2026-09-26 (NOTE-110); worth reading. It is short, it originated the dispositionalist reading, and the particle-in-a-box counterexample and the analysis of the costs of ψ-as-law are still the points the later literature (LIT-204, LIT-200, LIT-164) cites. |
| LIT-101 v2 | Moral disciplining: The cognitive and evolutionary foundations of puritanical morality | Fitouchi et al. (2021), DOI-10.1017/S0140525X22002047. Puritanical norms (condemning lust, gluttony, intoxicants, immodesty, idleness; praising temperance and piety) are argued to be cooperative morality after all: people believe cooperation needs self-control and that indulgence erodes it (and discipline trains it), so a single harm/fairness-sensitive moral system condemns victimless pleasures as indirect, probabilistic threats to cooperation. Its decline in rich societies is put down to people seeing others as already self-controlled and trustworthy. The theory is explicitly agnostic about whether the norms actually work. Its most direct support is the authors’ own vignette studies (N > 1,100), in which perceived loss of self-control mediated 100% of the perceived effect of indulgence on cooperativeness. | Active — read in full 2026-09-26 (NOTE-132); worth reading as a clearly stated, falsifiable, well-sourced BBS target theory of why “purity” norms exist. Much of its evidence is correlational or the authors’ own vignettes, and several predictions (intoxicants, piety) are explicitly untested. |
| LIT-103 v3 | Closing the Cartesian Bureau de Change | Frankish (2025), DOI-10.1177/10597123251359198. An illusionist’s commentary on Veit’s A Philosophy for the Science of Animal Consciousness. Frankish places Veit’s function-first, evolutionary programme in a “post-Cartesian” (qualia-eliminativist) paradigm. He then argues that two things drag it back towards Cartesianism: Veit keeps the words “qualia” and “phenomenal”, and he writes as if hedonic valence motivates action “in virtue of its feel”. The second implies “a tiny one-dimensional Cartesian bureau de change” that leaves the hard problem “as hard as ever”. Because the two paradigms are “incommensurable” (p. 20), Frankish urges Veit to commit to a thoroughly functionalist account. | Active — read in full 2026-09-26 (NOTE-143); worth reading as a five-page statement of the illusionist case against residual “feel” talk in evolutionary accounts of valence, and best read together with Veit’s reply (LIT-105), which answers it point by point. It argues rather than demonstrates: the central premise, that anything causally efficacious is functionally definable and so cannot be irreducibly subjective, is asserted in one paragraph (p. 18). |
| LIT-105 v3 | On the Evolution, Science, and Metaphysics of Consciousness | Veit (2025), DOI-10.1177/10597123251413204. Veit’s reply to five commentaries on A Philosophy for the Science of Animal Consciousness (2023). Its main new content is the metaphysics the book left to one paragraph. He says hedonic “feel” is identical with a valence system: “a common currency of sharing evaluative information across multiple control systems”. The currency metaphor, he says, is “not Cartesian but cybernetic” (p. 10). He keeps the word “qualia”, arguing that Cartesians have no “definitional rights” (p. 9), and he insists the pathological complexity thesis (PCT) is compatible with any metaphysics, dualism and panpsychism included (p. 9). Against his other critics, he defends a bottom-up evolutionary method that uses human data (de Weerd); a naturalism that is neither autopoietic nor biopsychist (Sachs); evaluation-first over prediction-first, consciousness as an adaptation, and graded, partial unity (Suzuki); and the link to welfare science (Chincarini). | Active — read in full 2026-09-26 (NOTE-187); worth reading as the only extended statement of the metaphysics behind the pathological complexity thesis, and as the direct answer to Frankish (LIT-103). The reply to Frankish is the substantive part. The replies to de Weerd and Suzuki mostly restate the book’s positions against objections quoted only in part, so read them alongside the commentaries. |
| LIT-107 v3 | Quasi-set theory: a formal approach to a quantum ontology of properties | Holik et al. (2021), DOI-10.1007/s11229-022-03884-8. The paper argues, with no new theorem, that the Lombardi–da Costa ontology of properties for quantum mechanics can be stated in Krause’s quasi-set theory Q. On that ontology a system is a bundle of I-type-properties (instances of universal type-properties, represented by the algebra of observables) with no principle of individuality. For each property instance, the indiscernible instances form a qset U([Π]). An atomic bundle is any qset x with qc(x ∩ U) = 1 for each U; the Axiom of Choice in Q guarantees one exists. The bundle’s kind is Q(B) = {x ∈ P(Q) | R(x)}, whose members are all indiscernible. N particles are a subqset N(B) ⊂ Q(B) with qc = N, a definite number with no labels (§6, pp. 19–22). | Active — read in full 2026-09-26 (NOTE-127); worth reading as a short, clear bridge between the modal-Hamiltonian “ontology of properties” (Lombardi et al.) and quasi-set theory (French & Krause 2006). The new formal content is about two pages (§6). Most of §5 restates Q’s axioms, and the printed proofs contain errors. It is a useful statement of the position, not a result. |
| LIT-109 v2 | Dispositions without Conditionals | Vetter (2014), DOI-10.1093/mind/fzu032. Proposes, and explicitly does not claim to have shown superior, a “possibility conception” of dispositions — a disposition is individuated by its manifestation alone (“a disposition to M, full stop”) and its modality is possibility, graded for terms like ‘fragile’ as manifestation in a sufficient proportion of maximally varied cases (centred worlds), and plain possibility for terms like ‘breakable’; the defence rests on the semantics of ‘-able’ adjectives and a COCA survey (226 relevant uses of ‘disposed to’, none ascribing a philosophers’ disposition to an inanimate object). | Active — read in full 2026-09-26 (NOTE-125); worth reading as the founding statement of the possibility conception of dispositions (developed in Vetter’s Potentiality, OUP 2015); it is an agenda-setting proposal whose comparative case against the conditional conception is deferred to other work, and the reader should hold it to that. |
| LIT-110 v3 | Unknotting reciprocal causation between organism and environment | Baedke et al. (2021), DOI-10.1007/s10539-021-09815-0. The paper gives an epistemic, not a metaphysical, tool for organism–environment reciprocal causation. The loop is “unrolled” into two ordered series of states, O_n and E_n, joined by interventionist (Woodward) causal arrows, and an experienced-environment node Ex_n is added as the interface. Its authors argue that this one diagram keeps an epistemically set organism–environment boundary and maps constitutive, mediational, relational, relocational and physical niche construction onto shared causal patterns. They support this with worked cases, including two multi-species ones (bumblebee–eggplant; rumen microbes–ruminant host). | Active — read in full 2026-09-26 (NOTE-111); worth reading as the clearest statement of the “keep the boundary, unroll the loop” position in the niche-construction reciprocity debate, and as the natural counterpart to Hazelwood (LIT-156); its model is illustrative, not formalized or tested, and the formalization it promises is deferred to later work. |
| LIT-111 v4 | AI Consciousness: A Centrist Manifesto | Birch (2025), DOI-10.31234/osf.io/af7c9_v1. Birch argues that two challenges must be met together: users misattributing human-like consciousness to chatbots (Challenge One), and possible “profoundly alien” AI consciousness that current science cannot settle (Challenge Two). For Challenge One he offers a personal-identity argument that the chatbot “friend” is typically a character with no persisting bearer (the “persisting interlocutor illusion”, §4) and three nudges that are neither “brainwashing” nor “lobotomizing” (§7). For Challenge Two he argues that behavioural markers are “gamed” (§10), that architectural markers are “Janus-faced” (§11), and that the resulting “two-level deadlock” between computational functionalism and biological naturalism can be broken over the long run by comparative animal studies (§12, Fig. 4). | Active — read in full 2026-09-26 (NOTE-183); worth reading as the clearest statement of the “centrist” position, and it coins four concepts the AI-consciousness literature now uses (persisting interlocutor illusion, gaming problem, Janus problem, two-level deadlock). It is a manifesto: its design nudges are untested proposals, and its way out of the deadlock is a research programme that has “barely begun” (§12). |
| LIT-112 v2 | What motivates mental fictionalism? | Drayson (2025), DOI-10.1080/09515089.2025.2577403. Drayson argues that Toon’s two motivations for mental fictionalism both fail. The negative argument needs “committed to internal, intentional, causal states ⇒ committed to the representational theory of mind” (her Premise 2), which is false because non-representational functionalism (Lewis, Putnam, Loar) supplies such states. And Toon’s positive argument, that pretence lets us genuinely assert that a person is in an overall state S that causes their behaviour, gives him a reason to identify S with the belief and so to be a realist rather than a fictionalist. | Active — read in full 2026-09-26 (NOTE-117); worth reading as a short, well-aimed critique that locates exactly where the case for mental fictionalism (Toon 2023) depends on equating realism about propositional attitudes with the representational theory of mind; it is a commentary on one book and argues against a motivation, not against fictionalism’s coherence. |
| LIT-113 v3 | Duality and ontology | Le Bihan & Read (2018), DOI-10.1111/phc3.12555. A survey that sorts realist responses to dualities along two axes. The first is which of the naively interpreted dual worlds count as candidates for actuality: all of them (underdetermination), one (discrimination) or none (nihilism), each with or without the common-core world. That gives options (1)–(6), with the common-core approach being (1), (3) and (5). The second axis is what replaces the common core: an overarching theory, or “pluralism”, on which all dual structures are co-instantiated as parts of one world. Its verdicts are conditional: no option breaks the underdetermination without a further metaphysical principle, such as the PII, for which the authors see no independent support. | Active — read in full 2026-09-26 (NOTE-152); worth reading as the shortest clear map of the realist options for interpreting dualities. It is a nontechnical survey, not an argument for any option. Its original contributions (the discrimination/common-core overlap, a defence of discrimination for AdS/CFT, and pluralism) are presented as options, not established. |
| LIT-114 v2 | Philosophy of Statistical Mechanics | Frigg & Werndl (2023), https://plato.stanford.edu/entries/statphys-statmech/. The entry argues that statistical mechanics has no canonical formalism but three umbrellas — Boltzmannian SM, the Boltzmann Equation and Gibbsian SM — and that every live account of the approach to equilibrium (ergodic, typicality, Mentaculus, long-run residence time, coarse-graining, interventionist, epistemic) survives Loschmidt’s and Zermelo’s objections only by giving up strict irreversibility or adding something outside the isolated dynamics; it closes on the unresolved “schism” that physicists compute in GSM while philosophers explain in BSM. | Active — read in full 2026-09-26 (NOTE-103); worth reading as the current authoritative map of the foundations of SM, with the caveat that it is written by two partisans who present their own long-run residence time account (§4.7) and their “BSM fundamental, GSM effective” view (§6.7) alongside the rivals. |
| LIT-115 v5 | Duality as a category-theoretic concept | Corfield (2015), DOI-10.1016/j.shpsb.2015.07.004. A short programmatic paper. Its thesis is that category theory, not set theory, is the framework in which the scattered instances of mathematical duality can be drawn together. The constructions in §3 (dual adjunctions restricting to dual equivalences on fixed points, truth-value-enriched Galois connections, Isbell conjugation, dualising objects “keeping summer and winter homes”) all “revolve around” adjunction, though Corfield expects no “single monolithic account” (p. 59–60). On his usage, ‘duality’ is reserved for “involution with some form of structural reversal” (p. 57), so several physicists’ dualities (homological mirror symmetry as an A∞-equivalence, mirror symmetry’s Z2 on the Hodge diamond, S-duality as a vestige of SL(2,Z)) are better called equivalences or symmetries. He proposes, without argument beyond the examples, that philosophers of physics will need homotopy type theory rather than predicate logic for the sameness questions dualities raise. | Active — read in full 2026-09-26 (NOTE-141); worth reading, briefly, as the mathematician-philosopher’s counterweight to the physics-first accounts of duality this record holds: it is the clearest statement that what physicists call a duality is often what a mathematician calls an equivalence, and it is only seven pages. Its positive programme (HoTT for philosophy of physics) is announced, not carried out. |
| LIT-116 v3 | The Desperate Search for Meaning in Life | Browning & Veit (2022), https://philarchive.org/archive/BROWAW-9. A popular-philosophy chapter that reads Evangelion’s characters as seeking meaning first in piloting (duty, recognition), then in connection with others, frustrated by Schopenhauer’s porcupine (hedgehog) dilemma. It argues that the failure of Instrumentality shows that a self, and so meaning, exists only through contrast with and separation from others: “without it [otherness], the self cannot exist” (p. 9). Meaning comes from human connection “but maintaining some distance” (p. 10). | Active — read in full 2026-09-26 (NOTE-119); worth reading only as a short, accessible illustration of the relational view of the self (self constituted by the self–other boundary) applied to meaning in life. It offers no original argument, cites nothing beyond two quoted sources, and misdescribes Heidegger’s “Dasein”. |
| LIT-118 v2 | A Pragmatist Theory of Evidence | Reiss (2015), DOI-10.1086/681643. Reiss proposes an “eliminativist hypothetico-contextualist” (EHC) theory of evidence for type-level causal claims in biomedical and social science. Support comes in two kinds: direct support (patterns we are “entitled to expect” if h is true) and indirect support (patterns incompatible with relevant alternatives). Warrant is graded by which alternatives have been eliminated, on four grades from “weak warrant” to “proof”. Where to stop probing is set by context, meaning background knowledge, a default entitlement to other scientists’ claims, and cost-benefit values. On this account there is no gold standard: RCTs are good only because they eliminate many alternatives at once. The 1950s smoking–lung cancer case illustrates the theory; it does not test it. | Active — read in full 2026-09-26 (NOTE-197); worth reading as the clearest short statement of an eliminativist, anti-hierarchy account of evidence that works for observational science, and of how values and trust set stopping rules. Its grades of warrant and pragmatic guidelines are proposals illustrated on one historical case, not validated criteria. |
| LIT-120 v2 | Welfare Subjects and Autopoiesis | Bruckner (2025), DOI-10.1017/apa.2025.10006. Bruckner proposes, by abduction and not deduction (§4), that being autopoietic is sufficient, not necessary, for being a welfare subject. An entity is autopoietic when it “sustains, maintains, and renews itself in a way that responds and adapts to its environmental conditions”. On this view insentient plants and a hypothetical non-sentient self-maintaining car (“Tessler”) are welfare subjects, while engines with governors, thermostats and heat-seeking missiles are not. He answers the charge of absurd obligations in two ways: welfare value may not generate agent-neutral reasons at all, and if it does, the reasons concerning non-conscious subjects are “extremely weak” (Bradford 2023). | Active — read in full 2026-09-26 (NOTE-093); worth reading as the clearest short statement of a welfare criterion that is not based on sentience and admits machines. Read it knowing that its “autopoiesis” is a loose behavioural notion of adaptive self-maintenance, not Maturana and Varela’s self-production, and that the line it draws against thermostats is argued as one of degree (“much richer”, §6.1) while being stated as one of kind. |
| LIT-121 v2 | The Meaning of the Wave Function: In Search of the Ontology of Quantum Mechanics | Gao (2016), ARXIV-1611.02738. Gao argues first that ψ is real. His case uses protective measurements, which yield ⟨A⟩ on a single system with certainty, in three versions (ch. 4): one in the ontological-models framework using preparation non-contextuality, two he says need no auxiliary assumption, and one that uses a new criterion of reality. He then argues that ψ describes random discontinuous motion (RDM) of N point particles in 3-space: |ψ|² is the density with which each particle is present at each instant, and ψ is a single-case propensity. The main support is that the charge density |ψ|²Q, which protective measurement shows to exist, has no self-interaction (chs. 6–7). If the Born probabilities come from RDM, collapse is real. Gao proposes an energy-conserving, Planck-time-discrete collapse model: Pᵢ(t+t_P) = Pᵢ(t) + (ΔE/E_P)[δ_{EsEi} − Pᵢ(t)], giving τ_c ≈ ħE_P/(ΔE)² (ch. 8). Combined with relativity, it requires a detectable preferred Lorentz frame (ch. 9). | Active — read in full 2026-09-26 (NOTE-140); worth reading as the fullest single statement of the protective-measurement argument for ψ-reality and of the RDM ontology. Its chapters 2, 3, 7.1 and 8.5 are also a well-referenced critical survey of ψ-epistemic, nomological, configuration-space-realist, Penrose and CSL views. Its central premises are contested (see Limitations), its collapse model is unconfirmed, and chapters 8–9 are openly speculative. |
| LIT-122 v2 | The Representation of Time and Change in Mechanics | Belot (2005), DOI-10.1016/B978-044451560-5/50005-1. For theories with ideal existence, uniqueness and a dynamical time-translation group, time is three intertwined ℝ-actions (on spacetime, on the symplectic space of solutions, and on the isomorphic space of initial data), and change is a slicing-indexed family of functions on those spaces. Singular dynamics, gauge freedom and time-dependence each damage this picture in a repairable way. Spatially compact vacuum GR breaks it, because the reduced Hamiltonian vanishes (h ≡ 0) and there is only one canonical isomorphism between the reduced spaces. That is the problem of time. It is not an artefact of the 3+1 split, it does not show change to be illusory, and it is absent from asymptotically flat GR and from artificially generally covariant theories. A parameterized “geometric time”, such as CMC, restores change and, in the CMC case, a time-dependent Hamiltonian flow. | Active — read in full 2026-09-26 (NOTE-118); worth reading as the careful technical-philosophical statement of what the problem of time is and is not in classical GR. It is long and assumes graduate differential geometry, and it offers a diagnosis, not a solution. Its quantum-gravity motivations date from 2005 and are not updated here. |
| LIT-123 v2 | Reality as a Vector in Hilbert Space | Carroll (2021), ARXIV-2103.09780. A programmatic essay, not a result paper. Carroll argues that a quantum theory is fixed, up to unitary equivalence, by the Hamiltonian’s eigenvalue list {E_n} on a finite-dimensional factor (he assumes a non-degenerate spectrum), and that parts are not given. Subsystems (tensor factorisations H = H_S ⊗ H_E or ⨂_α H_α), classicality and space are to be selected afterwards as rare structure that suits the dynamics. The only uniqueness he reports is for local factorisations, and it rests on a cited theorem (Cotler et al. 2019). The system/environment criterion rests on “simple numerical examples” in a companion paper, the metric and Einstein’s equation on “optimistic assumptions”, and emergent fields on a hope. | Active — read in full 2026-09-26 (NOTE-134); worth reading as the shortest authoritative statement of Hilbert-space fundamentalism and its “quantum mereology” programme, with the caution that nothing is derived in it. Every technical claim is delegated to a companion paper, and the author says the programme “may ultimately fail” (p. 12). |
| LIT-124 v3 | Mereology | Varzi (2003), https://plato.stanford.edu/entries/mereology/. The entry argues that no mereological principle, not even the partial-order core M (Reflexivity, Transitivity, Antisymmetry), is merely a fixing of the meaning of “part”. It lays out the ladder M ⊂ MM (+Supplementation) ⊂ EM (+Strong Supplementation) ⊂ GEM (+Unrestricted Sum). GEM is “virtually” a complete Boolean algebra with zero removed, and it is reached from M by exactly three adequate pairings: Supplementation + Unrestricted Sum2, Strong Supplementation + Unrestricted Sum3, and Complementation + Unrestricted Sum1. The influential Simons (1987) pairing, Supplementation + Unrestricted Sum3, which the entry’s own 2003 edition also used, does not yield GEM. | Active — read in full 2026-09-26 (NOTE-163); the standard, current (revised June 2026) and formally exact map of the field, and the right background reference for the record’s mereology topic. Two caveats: by its note 1 it excludes the systems-theory and ecological senses of “mereology”, and by note 18 it excludes quantum part–whole formalisms. |
| LIT-125 v2 | The moral psychology of obligation | Tomasello (2019), DOI-10.1017/S0140525X19001742. Tomasello proposes that the human sense of obligation is “the internalized social/rational pressure from a joint or collective self-regulating agent ‘we’… to do what ‘we’ expect me to” (§3). It arises first, around age 3, inside joint-commitment collaboration with a partner, and then, from about 3–5 years, toward in-group members through collective identification. It is a “self-conscious motivation” whose coercive force is a threat to one’s cooperative identity. The support is a synthesis of developmental and comparative experiments, mostly from his own lab, on WEIRD children versus chimpanzees; the paper runs no new experiment. | Active — read in full 2026-09-26 (NOTE-185); worth reading as the standard statement of the shared-intentionality account of obligation and, above all, as a treatment. The commentaries by Bratman, Darwall, Gilbert and Pettit, and the response, are where the naturalistic claim is actually contested. The target article alone is a review-cum-hypothesis, not a demonstration. |
| LIT-127 v2 | Hutchinson’s ecological niche for individuals | Takola & Schielzeth (2022), DOI-10.1007/s10539-022-09849-y. The paper defines the individualized (ecological) niche as the environmental conditions under which a particular individual has an expected lifetime reproductive success of ≥ 1, counting each offspring as 0.5 per parent in outcrossers. The authors split it into five sub-concepts: realized (A), potential (B), time-slice (C), prospective (D) and trajectory-based (E), plus a “fundamental individualized niche” set aside as practically interchangeable with the potential niche. The individual niche has n + s dimensions, adding intraspecific axes such as density and morph frequency. Its boundary is the expected-LRS isocline of 1, which is estimable only by marginalizing fitness functions across individuals. The authors themselves call the concept “mostly of a metaphorical value”. | Active — read in full 2026-09-26 (NOTE-170); worth reading as the clearest structuring of the “individualized niche” vocabulary, and as the individual-level complement to Trappes (LIT-169); it is a behavioural-ecology position essay, and its own admission that the potential niche is unobservable and estimable only from population-level marginalization limits it to a framework rather than a measurement result. |
| LIT-130 v2 | Personal Identity and Ethics | Dufner (2025), https://plato.stanford.edu/entries/identity-ethics/. A survey, arguing no thesis of its own, of how three contested questions bear on ethics: which account of persistence is true (unique psychological continuity, Shoemaker and Parfit; or biological continuity and animalism, Olson and DeGrazia), whether identity or the psychological relations (continuity and/or connectedness) is what matters (Parfit’s fission case), and whether metaphysics constrains ethics or the reverse. It traces these through prudential concern, responsibility, abortion (Marquis), death and brain-death criteria, dementia and advance directives (Dworkin vs Jaworska on Margo), and the separateness of persons (Rawls, Parfit, Nozick, Taurek, Sidgwick, Brink). Its main recurring finding is that the relation that fixes persistence and the relation that matters ethically keep coming apart. It concludes that all three questions remain open. | Active — read in full 2026-09-26 (NOTE-166); worth reading as the current, compact reference map from theories of persistence to applied ethics; it is a survey that takes no side, so it is a route to the primary sources (Parfit 1984, Olson 1997, McMahan 2002, Schechtman 1996, Korsgaard 1989) rather than a source of claims. |
| LIT-131 v2 | A Model of Understanding in Deep Learning Systems | Freeborn (2026), ARXIV-2604.04171. Freeborn defines “systematic understanding” as four conditions: an internal model, non-memorizing tracking of a property, bridge principles fixed in the deployed pipeline, and derivation by the agent itself. Four small demonstrations (the genus of a torus, Mars’s eccentricity e≈0.096 with Kepler’s form built in, grokked modular addition mod 113, and Othello-GPT from Li et al.) show it can be met. The Fractured Understanding Hypothesis (§7.5), which the paper argues for but does not test, says the understanding deep networks reach is characteristically symbolically misaligned, non-reductive, locally fractured, proxy-dependent and representationally fragmented. | Active — read in full 2026-09-26 (NOTE-123); worth reading as a careful, explicitly “thin” explication that turns the proxy disputes (memorization vs generalization, interpolation vs extrapolation) into testable conditions. The FUH is a programmatic hypothesis, not a finding, and two of the four worked examples do not meet the paper’s own bridge-principle conditions (see Limitations). |
| LIT-132 v2 | Luck and Intentional Action: A Causal Account | Quillien (2026), DOI-10.1162/OPMI.a.361. Across three Prolific studies (N = 198, 673, 142; Likert 1–7), judgments that “X happened because the agent wanted X” track intentionality judgments under manipulations of luck. Causation is the strongest predictor of intentionality: standardized β = .46, .56, .53, against know-how β = .33, .20, .27 and probability-raising β = .14, .16, .10. Across the 12 condition means, r = .98. Causation only partly mediates the effect of luck (64%, 45% and 49%; exploratory analyses). As the causal account predicted, Study 3 found that the effect of Process (normal vs mix-up) on intentionality is larger when the agent knows how the buttons work (interaction F(1, 423) = 32). In the morally neutral Kraemer vignette, intentionality and causation came apart. | Active — read in full 2026-09-26 (NOTE-092); Worth reading as the cleanest current statement and test of the causal (desire-causes-outcome) account of folk intentionality under luck. It has pre-registered designs, open data and an honest discussion of the half-mediation and the Kraemer divergence. Its evidence is correlational and its “model” is verbal, not computational. |
| LIT-135 v3 | Conscious artificial intelligence and biological naturalism | Seth (2024), DOI-10.1017/S0140525X25000032. Seth argues that conscious AI needs computational functionalism and substrate flexibility extending to silicon, and that both are doubtful (§3.9). Against them he gives a positive, explicitly non-vitalist case, running from interoceptive predictive processing through the free energy principle to autopoiesis, that consciousness is a property “of only (but not necessarily all) living systems” (§4). He concludes that real artificial consciousness is “unlikely along current trajectories” and would need “living AI” (§5.8), while conscious-seeming AI is “almost certain” and may be “cognitively impenetrable” (§6.2). He concedes that “my case is not watertight” (§5.8). | Active — read in full 2026-09-26 (NOTE-169); worth reading as the leading statement of biological naturalism about AI, with a useful five-scenario map (Table 1) of what conscious AI would require. Its positive case rests on the free energy principle, which the paper itself calls “much debated” (§4.2), and it claims plausibility rather than necessity. The commentaries and the Author’s Response (BBS 49, 2026) are the next thing to read, and the response was not reached here. |
| LIT-136 v2 | The Informational Nature of Personal Identity | Floridi (2011), DOI-10.1007/s11023-011-9259-6. Floridi deflates the diachronic question of personal identity, holding that sameness is always relative to a purpose-fixed level of abstraction and that metaphysical versions of the question “do not deserve to be taken seriously” (p. 554). He puts the synchronic question first: what binds a self’s information into a unity. His answer is an admittedly “figurative” 3C model in which the self is the last of three successive encapsulations, corporeal (bonded by chemical bonds), cognitive (bonded by mutual information) and conscious (bonded by semantics, and so dependent on a community). He then reads ICTs as “egopoietic” technologies because they act on all three membranes. | Active — read in full 2026-09-26 (NOTE-130); worth reading as the programmatic statement of Floridi’s informational, level-of-abstraction approach to the self and its link to his information ethics; its central model is a self-described figure, not an argued theory, and the individuation-first thesis is asserted in a few lines. |
| LIT-138 v2 | The Depth of the Body | Register (2025), DOI-10.3998/phimp.7576. Register argues that body parthood “for moral purposes” is bounded below by depth. Depth is the microphysical commitment of an object’s real definition, and objects that are “too deep” (a water molecule, the parcel of matter now composing the heart, a particular cloud server) are not body parts, though they are parts in the ordinary sense. His two principles (“bodily interests/rights are high-level”) say that events which are high-level neutral do not bear on bodily rights or interests. So a BCI user’s implemented software can be a body part owned by the user while the third-party server that runs it is not. | Active — read in full 2026-09-26 (NOTE-151); worth reading as a short, clearly argued proposal that separates a moral “body-part” relation from ordinary parthood by level of abstraction, and applies it to cloud-hosted BCIs. It is an argument from cases with the key ontological step hedged, not a worked-out mereology. |
| LIT-139 v2 | Inductive Risk and Values in Science | Douglas (2000), DOI-10.1086/392855. Hempel’s “inductive risk” (the chance of wrongly accepting or rejecting a hypothesis) arises at three internal stages of science: choosing a methodology such as a significance level, characterising data, and interpreting results. Wherever the non-epistemic consequences of error can be foreseen, weighing them requires non-epistemic values. Douglas shows this on dioxin cancer studies. Three pathologist panels (1978, 1980, 1990) scored the same Kociba rat-liver slides differently (e.g. 34/50, 33/47, 18/50 tumours at 100 ng/kg/day). Choosing between threshold and no-threshold readings of the same data has meant regulatory limits about 100× apart. Values enter only indirectly, through the consequences of error, never as evidence that a claim is true. | Active — read in full 2026-09-26 (NOTE-145); worth reading as the canonical, compact statement of the modern inductive-risk argument. It is carefully scoped, with an explicit direct/indirect distinction and exemptions for negligible uncertainty and consequence-free research, and it is well illustrated. Its normative premise, that scientists bear moral responsibility for foreseeable consequences of error, is explicitly left unargued (§2, p. 563). |
| LIT-140 v2 | Large Language Models Are Stochastic Measuring Devices | Mallory (2025), DOI-10.1093/9780191998317.003.0003. The chapter argues by analogy that deep neural networks are “stochastic measuring devices”. Training alters the parameters in response to data, so that the resulting configuration carries information about the data (“training is measurement”). The trained weights are a model, and generation is simulation. DNNs are stochastic because random initialisation and non-convex loss mean runs need not converge to the same weights, failing Baird’s “regularity” condition. The problems of interpreting model states and generated text are therefore the familiar problems of instruments, models and simulations. The problem of interpretable AI is an instance of the coordination problem in the philosophy of measurement. | Active — read in full 2026-09-26 (NOTE-090); worth reading as the most developed instrument-centred alternative to agentive framings of LLMs, and for its tidy division into model-interpretation, text-interpretation and linking problems; it offers an analogy, not a refutation (its own words, § Interpretation and Communication), and should be read in the published OUP version where possible. |
| 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-142 v2 | One or two? A Process View of pregnancy | Meincke (2021), DOI-10.1007/s11098-021-01716-y. Meincke argues that substance ontology forces a binary count of individuals. The Containment View fails empirically, following Kingma. Kingma’s Parthood View either loses foster–neonate identity (“Parts-of-Substances”) or cannot count consistently (“Substances-as-Parts”). If organisms are autopoietic processes, a pregnant individual is instead an asymmetrically bifurcating “hypercomplex” process. The foster is “something in between zero and one” and the whole is “something in between one and two”, and the bifurcation runs on past birth through lactation (“postnatal pregnancy”). | Active — read in full 2026-09-26 (NOTE-115); worth reading as the clearest short worked case of process ontology changing a counting and parthood question, and for its sharp internal critique of Kingma’s Parthood View (§3.2). Its positive view is a programmatic sketch, as the paper itself says (fn 52), and it rests on five process-biology premises that are assumed rather than argued here. |
| LIT-143 v2 | What is a Mathematical Structure of Conscious Experience? | Kleiner & Ludwig (2023), ARXIV-2301.11812. The paper proposes a definition, (MSC). A mathematical structure S = ((A_i), (S_j)) is a structure of conscious experience iff (S1) its domains are sets of experiential aspects, and (S2) every relation or function S_j has an “S_j-aspect”. An S_j-aspect is an aspect that a variation of experience changes exactly when the variation fails to preserve S_j. The older condition (MDC), that a structure is “of” experience if its domains are aspects and its axioms hold, survives only as the necessary condition for describing experience, because as a sufficient condition it admits incompatible structures (discrete and non-discrete topologies on the same set), arbitrary re-definitions (every C·d for C > 0) and consciousness-indifferent structures. Worked examples: experienced relative similarity is a strict partial order that satisfies (MSC), given transitivity (assumed). Visual regions form a topology that satisfies (MSC), given Bayne and Chalmers’s subsumptive unity thesis. | Active — read in full 2026-09-26 (NOTE-135); worth reading as the most explicit criterion for when a formal model is of experience rather than a convenient description of it. Its two positive results are conditional: transitivity of relative similarity is assumed, and the topology result assumes the subsumptive unity thesis. Cite the Synthese version, which has dropped v1’s argument against metric structure. |
| LIT-145 v2 | Ultrafilters as Propositional Theories | Turner (2025), DOI-10.1111/phc3.70047. An expository piece that redefines a filter over a set W as a “propositional theory” (a set of W-propositions closed under pairwise conjunction and implication, not containing ∅), proves maximal ⇔ prime ⇔ ultra (Thm 2), the ultrafilter extension theorem as a propositional Lindenbaum’s lemma (Thm 3, assuming choice), Łoś’s theorem M_T,[A] ⊨ φ iff ⟦φ⟧_A ∈ T for ultraproducts of “intensional spaces” (Thm 9), and first-order compactness from it (Thm 12); “None of the results are novel” (p. 2). | Active — read in full 2026-09-26 (NOTE-177); worth reading as the most accessible philosopher’s route into ultrafilters and Łoś’s theorem, provided the reader supplies the fixes to a few slips in the proofs (listed under Limitations). |
| LIT-146 v2 | The Moral Status of Animals | Gruen & Monsó (2003), https://plato.stanford.edu/entries/moral-animal/. The entry reviews five proposed grounds of moral considerability (species membership, human-exceptional capacities, personhood, sentience and agency). Its conclusion is that attempts to establish human uniqueness by capacities are “not the most promising” (§1.2). It then separates having moral status from the weight of a claim (“showing up on a moral radar screen”, §2.2). Weight depends on the value theory adopted for animal interests (hedonism, preference satisfaction, objective list; §2.1) and on the normative framework (rights, which are absolute but generate forward-looking duties when violated, or a multi-factor utilitarianism). It closes with virtue-ethical, feminist, relational and empathy-based approaches that reject argument from capacities altogether (§3). | Active — read in full 2026-09-26 (NOTE-181); worth reading as the standard current survey of the grounds and weighing of animals’ moral status. It is balanced for most of its length, but §2.2 argues at length for a multi-factor utilitarian view and §3 ends on Gruen’s own “entangled empathy”, so cite it for the map, not as neutral on the weighing. |
| LIT-147 v3 | Mental causation via neuroprosthetics? A critical analysis | Pernu (2018), DOI-10.1007/s11229-018-1713-z. The interventionist/difference-making case for nonreductive mental causation from BCIs (List & Menzies 2009; Menzies 2015; Woodward 2008a,b, 2017) misplaces multiple realisation. What the ensemble recordings show is that one cortical-level variable N (the ensemble’s average firing) is realised by many single-neuron patterns N1, N2. Each intention M corresponds to one value of N. So the counterfactual contrast “∼M □→ ∼B true, ∼N □→ ∼B false” fails, and neuroprosthetics supports mental causation only by identifying M with N, not nonreductive physicalism. | Active — read in full 2026-09-26 (NOTE-091); Worth reading as a short, precise diagnosis of a specific equivocation in the interventionist BCI argument (multiple realisation at the wrong level). Its scope is limited to difference-making with a proportionality constraint (fn 1), and its identity conclusion rests on a simplified picture of neural decoding that it asserts rather than argues. |
| LIT-149 v2 | The information-processing perspective on representation | Martínez (2025), DOI-10.33735/phimisci.2025.11321. A position paper, not an argument to a conclusion. It proposes that representations are signals adapted to transmit information for its own sake (Transmission), and that the evidence for this is efficiency in trading off rate, distortion and coder complexity (RDC Trade-Off). It supports the proposal by showing that cognitive scientists already attribute representational status on those grounds: compression, error protection, and explicitness understood as ease of decoding. It proves no theorem and reports no data of its own. | Active — read in full 2026-09-26 (NOTE-165); worth reading as the clearest short statement of a rate–distortion–complexity (teleo)semantics of representation, provided it is read as the position paper it says it is (§1: “comparatively light” on objections); the defence is in Martínez 2019b/2024 and in work the paper says is to come. |
| 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-151 v2 | Stating Structural Realism: Mathematics-First Approaches to Physics and Metaphysics | Wallace (2021), DOI-10.1111/phpe.12172. Wallace argues that reading a physical theory “math-first”, as mathematical models plus representation rather than as sentences aiming at truth, already makes scientific realism structural. Math-first theoretical equivalence and reduction (as instantiation) are coarse-grained enough to dissolve the standard underdetermination and theory-change objections. On this footing epistemic and ontic structural realism differ only in whether metaphysics itself is language-first or math-first. On math-first OSR, objects are whatever the best “predicate precisification” of a theory quantifies over, real patterns are defined through instantiation plus best precisification, and ontology is scale-relative. At every non-fundamental level the two versions coincide. The paper is explicitly a statement of the position, not a defence of it. | Active — read in full 2026-09-26 (NOTE-142); worth reading as the sharpest statement of what structural realism could mean once theories are taken math-first. It gives precise definitions of math-first ESR/OSR and of real patterns, its diagnosis of why priority-thesis OSR drifted is useful, and it is candid about the undeveloped notion of mathematical equivalence it relies on. |
| LIT-152 v2 | A defence of informational structural realism | Floridi (2007), DOI-10.1007/s11229-007-9163-z. Floridi argues informally in four steps. (1) ESR and (non-eliminativist) OSR are compatible once indexed to levels of abstraction. ESR’s minimal commitment to knowable relations holds at a first-order LoA. At a reflective (“transcendental”) second-order LoA, a second Ockham principle licenses taking the relata to be structural objects. (2) The relata-need-relations regress is blocked by Eddington’s “package hypothesis”: not all relata are logically prior to relations. (3) Structural objects are informational objects, clusters of data understood as concrete “differentiae de re”, made scalable by the object-oriented-programming model. (4) Together these give “informational structural realism”, on which “the ultimate nature of reality is informational” (p. 32). | Active — read in full 2026-09-26 (NOTE-099); worth reading as the source statement of informational structural realism, which the literature cites and builds on (Karpenko LIT-215, Bynum, Beni, Long, Wheeler). Read §§2.4, 3 and 5 for the position and §6.9 for what “informational” does and does not mean. The LoA reconciliation is a proposal, not a result. |
| LIT-153 v2 | Making sense of transformer success | Angius et al. (2025), DOI-10.3389/frai.2025.1509338. Current attempts to explain transformer language models’ competence fall into three kinds, and the paper maps each onto an explanatory form from philosophy of cognitive science: machine psychology is Cummins-style functional analysis, induction-head work is Machamer–Darden–Craver mechanistic explanation, and NLM–fMRI brain-score studies are a bidirectional “co-simulation”. Its only thesis is that these do not differ from how cognitive science explains humans. Functional analyses are to be reduced to mechanisms as “mechanism sketches”. The paper rests on existing literature and adds no new analysis or data. | Active — read in full 2026-09-26 (NOTE-106); worth reading only as a philosopher’s map of interpretability methods sorted by explanation type, and for the “co-simulation” label; the argument is thin, the Transformer primer contains a technical error, and a reader wanting the underlying results should go to the cited primary work (Elhage et al. 2021, Olsson et al. 2022, Caucheteux et al.). |
| LIT-154 v3 | Criteria of Identity and Structuralist Ontology | Leitgeb & Ladyman (2007), DOI-10.1093/philmat/nkm039. Graph theory counts unlabelled graphs whose nodes, or whose isomorphic connected components, cannot be told apart even by an irreflexive relation. Examples are the edgeless two-node graph G′ and any graph with two or more isolated nodes (11 of the 156 unlabelled 6-node graphs). Mathematicians treat these as determinately distinct objects, so the authors conclude that the identity or difference of places in a structure is given by the structure itself, with identity counted among its relations, and not by any criterion of identity. The argument appeals to mathematical practice; it is not a proof. | Active — read in full 2026-09-26 (NOTE-133); worth reading as the short, standard counterexample to weak-discernibility versions of the PII for mathematical structuralism. It is widely cited, and its graph cases are simple enough to check by hand. Its physics coda is explicitly left open. |
| LIT-155 v2 | Studying Philosophy Does Make People Better Thinkers | Prinzing & Vazquez (2025), DOI-10.1017/apa.2025.10007. In HERI/CIRP freshman–senior survey data (N = 649,511 students at 804 US institutions, 4,843 philosophy majors), one SD more SAT Verbal raises the odds of majoring in philosophy by 57% (OR 1.57), and freshman Habits of Mind by 34%. After adjusting for SAT or freshman scores, philosophy majors still score higher than non-majors on GRE Verbal (+33 points, SMD 0.48), LSAT (+2, SMD 0.35), Habits of Mind (SMD .24) and Pluralistic Orientation (SMD .21), with no difference on GRE Quantitative. On point estimates they rank first of 57 or 62 majors on GRE Verbal, LSAT and Habits of Mind. | Active — read in full 2026-09-26 (NOTE-167); worth reading as the largest baseline-adjusted observational study of what studying philosophy does, and it is candid about its design; but its causal claim rests on covariate adjustment with self-reported scores, and a reader should take “philosophy causes better thinking” as well supported for verbal-test gains and weakly supported beyond that. |
| LIT-156 v4 | An Emerging Dilemma for Reciprocal Causation | Hazelwood (2023), DOI-10.1017/psa.2023.124. Hazelwood defines RC as “the process of natural selection is both a cause and effect of processes such as niche construction” and EC as “natural selection is an emergent causal process”. He argues they are incompatible. Emergence here is Wilson’s synchronic dependence plus autonomy, cashed out as Pence’s composition. If EC holds, niche construction partly composes selection, so the two fail Woodward’s independent-fixability condition and cannot stand in a causal relation. If EC fails, selection is either non-causal (statisticalism) or individual-level, which is incoherent because relative fitness needs a population (Millstein, Sober). EES proponents should drop RC but can keep niche construction as a genuine cause of the evolutionary product. | Active — read in full 2026-09-26 (NOTE-137); worth reading as a tight, well-sourced argument that brings the reciprocal-causation debate into the composition, exclusion and interventionism literature. Its force depends on accepting a process/product split for selection and a compositional reading of realization, both argued briefly and flagged as contestable. |
| LIT-157 v3 | Reproducees, reproducers, and Darwinian individuals | Bourrat (2025), DOI-10.1007/s11229-024-04880-w. Bourrat builds a nested vocabulary. A reproducee is a B that comes after A, is caused by A, and is of A’s relevant class. A reproducer is a reproducee with reproductive autonomy, meaning it can reproduce across a range of backgrounds. A Darwinian individual is a reproducer with high reproductive causal control, meaning heredity survives as the parent’s description is made finer. On that vocabulary, genes of multicellular organisms are, like hearts, mere reproducees, but with high control. Material overlap is necessary for reproducers, which are whole life cycles, and unnecessary for reproducees, so Griesemer and Godfrey-Smith partly talk past each other. Both quantities get an information-theoretic recipe (conditional MI after Bertschinger et al. 2008 for autonomy; interventional MI across grains, Griffiths et al.’s INF, for control), and neither is computed. | Active — read in full 2026-09-26 (NOTE-100); worth reading as the clearest statement of the reproduced/reproducing distinction and a tidy, well-scoped settlement of the material-overlap dispute. Its value is conceptual. Its two measures are recipes that are never computed, and the autonomy recipe does not match its own verbal definition. |
| LIT-158 v2 | Status Distrust of Scientific Experts | Desmond (2022), DOI-10.1080/02691728.2022.2104758. Desmond gives a “how-possibly” argument, not a demonstration, that stubborn distrust of scientific experts can be valid reasoning. A low-status truster who is vulnerable in collective decision-making (Premise 1) and has reason to think the prevailing “service-for-prestige” ethos leaves out their core interests (Premise 2) has reason to distrust a high-prestige expert because of that prestige (§6, p. 16–17). The paper explicitly declines to say when those premises are true. | Active — read in full 2026-09-26 (NOTE-113); worth reading as a compact, clearly structured rationalising account of distrust in experts that connects the trust literature (Baier, Hawley) with the sociology of professions and prestige; its §6 argument scheme is the citable part, but it shows only validity, not soundness. |
| LIT-159 v4 | If materialism is true, the United States is probably conscious | Schwitzgebel (2014), DOI-10.1007/s11098-014-0387-8. A conditional, informal argument. Any materialist criterion liberal enough to credit rabbits (and rabbit-level distributed aliens, the “squidbits”) and behaviourally human-like but oddly built aliens (Sirian supersquids, Antarean antheads) with consciousness also credits the United States. On this argument the US meets the usual materialist marks of consciousness: sophisticated information processing (roughly 10^14 person-to-person visual “connections”, comparable to the brain’s about 10^14 synapses), goal-directed environmental responsiveness, self-representation and historical embedding. The only exits are eliminativism, extreme sparseness or neurochauvinism, each costlier than the conclusion. The paper argues for no universal criterion. It ends undecided between three readings: US consciousness, a challenge to materialists, or grounds to distrust universal metaphysics of mind. | Active — read in full 2026-09-26 (NOTE-131); read in full (manuscript) 2026-09-26; the canonical over-generation argument against liberal materialist criteria of consciousness, and the standard critique of anti-nesting and exclusion principles, worth reading for anyone who attributes consciousness from functional or indicator properties. |
| LIT-160 v2 | Units and Levels of Selection | Lloyd (2005), https://plato.stanford.edu/ENTRIES/selection-units/. Lloyd’s own four-question anatomy of “unit of selection”: interactor, reproducer (formerly replicator), manifestor of adaptation, and beneficiary. She combines it with a split between two multilevel schools, Wrightian “Evolutionary Change” and Fisherian “Adaptationist/KS”. She uses the two to argue for a verdict, not merely to map the debates. The verdict is that most rejections of group, species and holobiont selection come from demanding that an interactor also be a manifestor of engineering adaptation. By her account, genic pluralism, the ETI models and Godfrey-Smith’s Darwinian populations each fuse roles that should be kept apart. The support is argument plus citation of Wade, Goodnight and others. The entry reports no new results of its own. | Active — read in full 2026-09-26 (NOTE-184); worth reading as the authoritative statement of the interactor / reproducer / manifestor / beneficiary distinction and as a dense map of the units-of-selection literature to 2023. It has to be read as one side’s case. It is not a neutral survey: it argues for the Evolutionary Change school, and it criticises by name several authors this record holds or cites. |
| LIT-161 v2 | Why Replication Is Overrated | Feest (2019), DOI-10.1086/705451. Every experiment and every replication rests on individuation judgments about what is being manipulated and measured (“conceptual scope”). So direct replication can at most help rule out random error, and “perhaps” establish that some effect exists but not which effect, while conceptual replication begs the question by presupposing that two operationalisations individuate the same effect. What productive research actually does, as in the Mozart-effect debate, is probe systematic errors, which is better called exploration than replication. | Active — read in full 2026-09-26 (NOTE-196); worth reading as a short, clearly argued statement of why replication cannot settle “what effect?” questions, built on one worked case (the Mozart effect). It is suggestive for construct-validity arguments about benchmarks, but its strongest lines are asserted rather than argued. |
| LIT-162 v2 | Is Unsupervised Clustering Somehow Truer? | Søgaard (2024), DOI-10.1007/s11023-024-09699-5. Søgaard rebuts two arguments that unsupervised clustering is epistemically superior to supervised classification. The No-Bias Argument fails because clustering is also sensitive to sample bias (a toy example moves the boundary from x = 7 to x = 6), and it is more sensitive to representation bias. The Simplicity-Truth Argument fails because clustering is also function estimation and overfits in the same way (Hansen & Larsen 1996). From the fact that every clustering hypothesis is in a supervised classifier’s hypothesis class, he concludes that supervised classification is “at least as justified”, but that positive step is under-argued. | Active — read in full 2026-09-26 (NOTE-108); worth reading as a short corrective to Rochefort-Maranda & Liu’s claim that unsupervised clustering cannot overfit and to “no-bias” readings of Watson. Its positive thesis rests on a thin hypothesis-class reduction and has several technical slips, so it should be read critically rather than cited for that thesis. |
| LIT-163 v2 | Philosophy of Probability: Foundations, Epistemology, and Computation | Wenmackers (2011), https://philpapers.org/rec/WENPOP. A fair lottery on ℕ gets a uniform, regular probability on all of 𝒫(ℕ) by normalising Benci–Di Nasso numerosities, P_num(A) = num(A)/α. This is hyperrational-valued, determined only up to the choice of free ultrafilter, and “hypercountably” (really hyperfinitely) additive rather than countably additive, with st∘P_num = generalised asymptotic density (§2.5–2.6). The same “rounding-error” diagnosis gives Stratified Belief, a contextual Lockean thesis on which conjunction holds for a standard number of beliefs (Ch. 3). A separate agent-based model (Ch. 5) finds that one round of bounded-confidence averaging sends an agent to the inconsistent theory with probability at most 1.81 % in the cases computed (M = 2, 3 atomic sentences). | Active — read in full 2026-09-26 (NOTE-139); worth reading for the Ch. 1 survey of interpretations of probability and the Ch. 4 synthesis, which appear only here; for the rest, each chapter has a later journal version that is the better citation, none of them held on this record: Wenmackers & Horsten, “Fair infinite lotteries”, Synthese 190 (2013) 37–61 (Ch. 2); Wenmackers, “Ultralarge lotteries”, J. Applied Logic 11 (2013) 452–467 (Ch. 3); Wenmackers, Vanpoucke & Douven, “Probability of inconsistencies in theory revision”, Eur. Phys. J. B 85 (2012) 44 (Ch. 5); and Benci, Horsten & Wenmackers, “Non-Archimedean probability”, Milan J. Math. 81 (2013) 121–151 (the Ch. 6 outlook). |
| LIT-164 v3 | Wave-Function Realism and the Scope of Physical Causal Closure | Poltorak (2026), https://philsci-archive.pitt.edu/30720/. A closure principle has two tacit parameters, its domain and its completeness relation (causal, dynamical or explanatory). Wave-function realism falsifies spatiotemporal-domain closure (STC) but is compatible with fundamental-physical closure (FPC), so there is no “trans-domain causal breach”. The physicalist is left with a dilemma: STC is too narrow, and FPC needs an independent criterion of physicality plus a dynamical-to-causal bridge. The paper tests this across primitive-ontology, spacetime-state, multi-field, Everettian, nomological and dispositional readings. | Active — read in full 2026-09-26 (NOTE-112); worth reading as the clearest statement of what quantum ontology does and does not do to causal-closure arguments. Its conclusions are modest, and it concedes that its main target is a picture rather than a published argument. Unrefereed. |
| LIT-165 v3 | Coherence-based measures of explanatory power | Hartmann & Trpin (2026), DOI-10.1007/s11098-026-02517-x. If explanatory power is measured contrastively over sets of explanantia, as E_CohOG+(E; H) = (Coh(H∪{E}) − Coh(H∪{¬E})) / (Coh(H∪{E}) + Coh(H∪{¬E})) with Olsson–Glass overlap normalised by its independence value (CohOG+), then the measure provably satisfies Roche & Sober’s Two Likelihood Inequalities for single hypotheses (Prop. 2) and violates the One Likelihood Inequality (OLI). Two numerical examples show that adding a distal cause (for P(H1) < .7) or a negatively interacting cause (for P(H1) = P(H2) < .75) can raise explanatory power. Both are existence demonstrations, not general theorems. | Active — read in full 2026-09-26 (NOTE-168); worth reading as a current, compact reply to Roche & Sober (2023) and Lange (2022) with checkable formulas, though its escape is representational (sets instead of conjunctions) and its positive case rests on two worked examples rather than a characterisation. |
| LIT-166 v2 | Sacrificing Humans for Insects and AI: A Critical Review of Jonathan Birch, The Edge of Sentience, Jeff Sebo, The Moral Circle, and Webb Keane, Animals, Robots, Gods | Schwitzgebel & Sinnott-Armstrong (2026), DOI-10.1086/739660. Each book’s own principles, read at face value, can make human interests outweighed by insects in aggregate or by near-future AI. Each author then retreats to moderate near-term advice without principled grounds: Birch through human-centred citizens’ panels, Sebo through contingent “relational” and “co-beneficial” considerations, Keane through deference to slowly adapting cultures. The reviewers defend only the conditional (“given recent science, common grounds of moral standing put human priority under serious threat”) and “take no stand on ponens vs. tollens” (§1, p. 6; §5). | Active — read in full 2026-09-26 (NOTE-116); worth reading as the sharpest short map of how the AI- and animal-sentience literature argues. It covers precaution and its ambiguity, the edges of the “zone of reasonable disagreement”, aggregation, and the retreat to moderation. It also gives a close critique of Birch’s sentience-candidate criterion, the one operational test that already covers AI. |
| LIT-167 v3 | The Organism | Baedke (2025), DOI-10.1017/9781009495035. Baedke treats “organism” as a nexus concept with an organizational dimension and a relational dimension, joined by the various kinds of biological individuality. He argues that the standard “persister” (self-maintenance, closure) criterion cannot single organisms out, because colonies, holobionts and ecosystems meet it too, and that organisms are also “overcomers”, able to destabilize and reorganize their own closure. Organisms are then individuated relationally by tracing diachronic causal paths in the unrolled O/E model of Baedke et al. 2021 (LIT-110). The overcomer claim rests on three illustrative cases, anglerfish, sea slug and jumping ant, and is asserted, not shown, to hold of organisms only (p. 40). | Active — read in full 2026-09-26 (NOTE-148); worth reading as a compact, open-access and historically well-informed synthesis of the organism/individuality debate, and as the clearest statement of the persister-vs-overcomer distinction. Its positive account is, in the author’s words, drawn “with rough brushstrokes” (p. 51), so cite it for the problem statement and the distinction, not as having settled organism individuation. |
| LIT-168 v3 | Biological Individuals | Wilson & Barker (2007), https://plato.stanford.edu/entries/biology-individual/. A survey that maps biological individuals by crossing two axes: organism / some parts of organisms / some groups of organisms, against living agent (physiological) / Darwinian (evolutionary) individual. The result is nine regions, each given one example (fruit fly, gene, eusocial colony, lysosome, clade, heart, coral reef, virus, squid+Vibrio). “Part” is never defined, and the entry gives no criterion for which parts or groups count: the placements are the authors’ tentative judgements, “moving from less contentious to more contentious examples” (§7). | Active — read in full 2026-09-26 (NOTE-114); worth reading as the standard map of the biological-individuality literature up to 2023 and the hub for this record’s cluster (LIT-049, LIT-157, LIT-188, LIT-142, LIT-210); it is a survey with one tentative framework of its own, not an argument for a thesis, and for parthood it only supplies examples. |
| LIT-169 v2 | Defining the niche for niche construction: evolutionary and ecological niches | Trappes (2021), DOI-10.1007/s10539-021-09805-2. Trappes compares NCT’s evolutionary niche with the ecological niche. The evolutionary niche is the sum of selection pressures on a population (Odling-Smee, Laland & Feldman 2003), read “externally” as the environmental factors that produce fitness differences. The ecological niche is the conditions that permit continued existence; for a population, mean absolute fitness ≥ 1. Even at their closest, against the realized population niche, the two differ in extension. Habitat degradation is in the evolutionary niche but not the ecological one, and commensalism and non-limiting resources are in the ecological niche but not the evolutionary one. So NCT’s niche is not the “simple translation” of Hutchinson’s niche its proponents claim, and the evolutionary significance of niche construction must be shown case by case rather than following from the definition. | Active — read in full 2026-09-26 (NOTE-155); worth reading as a short, clean conceptual analysis that turns “persistence versus fitness differences” into a precise wedge between two fields’ uses of “niche”; its empirical cases are admittedly thin (the CO2 case is offered as “possible”), and it analyses only the 2003 book’s niche concept. |
| LIT-170 v2 | Unitary inequivalence as a problem for structural realism | French (2010), DOI-10.1016/j.shpsb.2011.09.001. French answers Howard’s objection that QFT’s unitarily inequivalent representations leave the structural realist with non-isomorphic, competing structures. He offers two routes. The first is to adopt cut-off “conventional” QFT with Wallace, on which the inequivalence is an artefact or harmless. The second is to follow Ruetsche’s Swiss Army Knife and treat the algebra as a modal structure spanning all representations. On that reading spontaneous symmetry breaking preserves the symmetry across the degenerate vacua, and the DHR analysis derives quantum statistics from the algebra. Adding Baker’s criterion, on which a symmetry mapping between representations suffices for intertranslatability, removes the assumption behind the objection, and French ends with a third option that combines the two routes. Every step is an informal argument layered on others’ technical results; the paper proves nothing itself. | Active — read in full 2026-09-26 (NOTE-162); worth reading as a leading ontic structural realist’s worked response to the strongest physics-based objection to OSR beyond finite-dimensional QM, and for its clear staging of the Wallace–Fraser and algebraic versus Hilbert-space debates. A reader should cite the 2012 journal version; this note reads the 2010 draft. |
| LIT-172 v3 | Ethics of Parasocial Relationships | Archer & Robb (2025), DOI-10.1093/9780198928188.003.0012. Fan–celebrity parasocial relationships are personal relationships (the fan relates to the celebrity as a unique individual, with reasons for partiality), built from three structural asymmetries: attention, communication and epistemic. These yield an “identity asymmetry”: celebrities mostly direct fans’ identities, while fans mostly interpret celebrities’. Fans who refuse uptake of a celebrity’s changed public persona commit a failure of Darwallian recognition respect. The chapter derives from this a responsibility for fans, which is mitigated when the celebrity’s self-presentation is misleading or ambiguous. | Active — read in full 2026-09-26 (NOTE-186); worth reading as the clearest short philosophical analysis of parasociality as a relationship type. Its directive/interpretive split and its recognition-respect argument are portable to other one-sided relationships, though the chapter itself only gestures at them. |
| LIT-173 v2 | From ontic structural realism to metaphysical coherentism | Morganti (2018), DOI-10.1007/s13194-018-0233-5. Morganti argues from a survey rather than proving anything. Strong, moderate and contextualist OSR each fail as metaphysics: particle kinds have intrinsic features no group-theoretic analysis reduces, and the argument from permutation invariance is inconclusive. What OSR gets right about symmetry, entanglement and particle kinds is better captured by “metaphysical coherentism”: object-like entities (in one domain) stand in symmetric partial ontological dependence on one another. Cycles of such dependence can be kept irreflexive, and so explanatorily non-trivial, by relaxing transitivity (quasi-transitivity) or by making only partial dependence symmetric. | Active — read in full 2026-09-26 (NOTE-095); worth reading as the clearest statement of a dependence-based, object-friendly alternative to relation-first OSR, and a hub for the grounding, holism and OSR literatures; its physics applications are programmatic, and he says so himself (pp. 18–19). |
| LIT-175 v3 | Evidence in Medicine and Evidence-Based Medicine | Worrall (2007), DOI-10.1111/j.1747-9991.2007.00106.x. Worrall argues that the EBM evidence hierarchy has no sound general rationale for giving randomisation extra epistemic weight, even though it lets high-quality RCTs “trump any number of observational studies”. He examines five standard arguments. Four fail: (a) Fisher’s significance-test logic, (b) control of unknown confounders, (d) that observational studies “exaggerate” effects, and (e) probabilistic causality. The fifth, (c) selection bias, is a “cast-iron argument”, but it supports only taking allocation out of the clinicians’ hands, and randomisation is one way to do that. What matters is balance on plausible confounders, a placebo or active control and blinding. Whether balance comes from randomising or from matching “seems epistemically unimportant”, and historically controlled trials can give strong evidence for large effects. | Active — read in full 2026-09-26 (NOTE-126); worth reading as the fullest single statement of the philosophical case against the special epistemic standing of randomisation. It is clearly argued and well documented, and it explicitly concedes the selection-bias argument. It is a partisan position piece, and its defenders-of-randomisation opponents (Pocock, Elbourne, Papineau) are summarised, not engaged at length. |
| LIT-176 v2 | Events and the Ontology of Quantum Mechanics | Dorato (2015), ARXIV-1503.01140. Dorato argues, without formal results, that events are the metaphysical category best suited to quantum mechanics. An event reading fits GRW flashes, GRW matter density and Bohmian worldlines, and also the antirealist views of ψ held by Bohr, Rovelli, Haag and Pashby. Because it is the same across interpretations, he calls it “interpretation-independent” (p. 12). Where ψ needs a realist reading, it should be read as intrinsic dispositions of events. Esfeld et al.’s view has the opposite structure: bare matter points plus a single holistic power of the universal configuration. Dorato argues that view is unintelligible, and that it must change its ontology when it passes from the universal wave function to the effective one (pp. 13–15). | Active — read in full 2026-09-26 (NOTE-105); worth reading as a short, clear statement of event-primitivism for primitive-ontology theories, and of intrinsic (not holistic) dispositions against Esfeld et al. It is programmatic. By Dorato’s own account (p. 15) the relation between events and powers is left for future work, and without that the event reading does little work beyond relabelling. |
| LIT-177 v2 | The Relational Interpretation of Quantum Physics | Rovelli (2021), ARXIV-2109.09170. Rovelli restates RQM as an ontology of sparse relative facts, which arise in interactions and are labelled by the interacting systems. Its one technical rule is that an amplitude W(b,a) gives the probability P = |W|² only when a and b are relative to the same system. That rule removes the clash between P_collapse = Σᵢ|W(c,bᵢ)|²|W(bᵢ,a)|² and P_unitary = |ΣᵢW(c,bᵢ)W(bᵢ,a)|² (eqs. 2–4). Decoherence makes some facts approximately label-independent (“stable”). ψ is a relative-state bookkeeping device, like a Hamilton–Jacobi function S. The price, which Rovelli states, is giving up “strong realism”: values are not held at all times, may be held at different times for different systems, and there is no coherent global view and no quantum state of the universe. | Active — read in full 2026-09-26 (NOTE-174); worth reading as the author’s own compact, current statement of RQM, and a good anchor citation for relational and perspectival readings. It is expository, not argumentative. It does not engage the inter-observer consistency objections in any depth, and the main technical rule is postulated, not derived. |
| LIT-178 v2 | Borges and AI | Bottou & Schölkopf (2023), ARXIV-2310.01425. A short essay, not an argument with evidence. It claims that a “perfect language model”, defined as sampling each next word from a random occurrence of the current text in the infinite collection of all plausible texts, is a fiction machine governed by “narrative necessity”, to which “neither truth nor intention” matters. On that view hallucinations “are just confabulations”, chat-bot answers take the role the user’s framing implies, and fine-tuning and RLHF are attempts to prune the garden “against its nature”. It warns that power over what LLMs write becomes “power over what we think”. | Active — read in full 2026-09-26 (NOTE-102); worth reading as a short, well-made and much-cited statement of the “LLM as fiction machine” framing, provided it is read as an essay offering imagery. It supplies no evidence, and its central idealization (the perfect LM) is asserted, not argued, to describe trained and aligned chat models. |
| LIT-179 v2 | Algorithmic Nudging: The Need for an Interdisciplinary Oversight | Schmauder et al. (2023), DOI-10.1007/s11245-023-09907-4. A short position paper: two case studies show AI agents learning to exploit documented biases (in Dezfouli et al. 2020 an RL agent moved choices of a target lottery from 50% to 70%). Against a Friedman-style judgement of AI nudges by outcome alone, the authors extend Hausman’s “look under the hood” rejoinder and propose obliging developers to consult cognitive scientists, because an AI system may exploit biases that are not yet known. | Active — read in full 2026-09-26 (NOTE-171); worth a short read as a clear, citable statement of the case for mechanism-level oversight of AI nudging, but it adds no new evidence: its empirical content is second-hand, and its central worry (AI exploiting undocumented biases) is argued, not shown. |
| LIT-184 v2 | Effective Ontic Structural Realism | Ladyman & Lorenzetti (2023), DOI-10.1086/729061. Ladyman and Lorenzetti argue that three recent “effective realisms” lack a metaphysics that makes them realist rather than constructive-empiricist, and that the Ladyman–Ross OSR package supplies one: realism about modal structure, “to be is to be a real pattern”, and scale-relative ontology. The three are Fraser & Vickers (and Egg) on non-relativistic QM, Williams and Fraser on QFT, and Robertson & Wilson on “theoretical relicts”. Scale relativity also dissolves Saatsi’s inconsistency objection, so Newtonian gravitational forces and GR gravitation “both exist at different scales”. Egg’s 2019 anthropocentrism objection is answered by grounding measurement in decoherence. | Active — read in full 2026-09-26 (NOTE-129); worth reading as a short, clear map tying the effective-realism literature to OSR’s modal-structure and real-patterns ontology; its arguments are programmatic, and each step leans on Ladyman & Ross (2007) rather than new argument. |
| LIT-185 v3 | Integrated information theory: the good, the bad and the misunderstood | Barrett et al. (2026), ARXIV-2604.11482. A position paper with no new formal result. It argues four things. IIT’s algorithm is undefined whenever any spatial, temporal or state graining of a system is non-Markovian (Barrett & Mediano 2019), and so gives no output for brains; it cannot handle unbounded continuous state variables; and it has never been computed on any real system. PCI and other “approximations” of Φ are proxies, capturing at most two of the six axioms. The theory would need recasting in continuous fields (the EM field) to fit the standard model. Against critics, the authors hold that IIT can be read with a multi-dimensional measure of global state (mean Φ, variance of cause-effect-structure quantities, structural complexity), on which Aaronson’s inactive expander grid is only minimally conscious, and that IIT’s implied “tiling” panpsychism is no worse than any rival metaphysics. | Active — read in full 2026-09-26 (NOTE-122); worth reading as the most compact current statement of IIT’s formal ill-definedness and its proxy-versus-approximation problem, from sympathetic insiders; its defences (panpsychism, expander grids) rest on the authors’ proposed reinterpretation rather than on IIT 4.0 as stated. |
| LIT-187 v3 | On the Philosophy of Unsupervised Learning | Watson (2023), DOI-10.1007/s13347-023-00635-6. Watson argues that clustering, abstraction and generative modelling each come with an epistemic thesis (EC, EA, EG — we identify natural kinds, essential properties and unrealized possibilities via such algorithms or something like them), which he accepts. Each also comes with an ontological thesis (OC, OA, OG — these just are what the algorithms ought to find under ideal conditions), which he rejects because nothing guarantees they are effectively computable. He adds a pragmatic, context-relative view of natural kinds, and closes with the claim that unsupervised outputs are neither “objective” nor vacuous. They should be validated by error-statistical means: resampling stability, generalization of clusters to held-out data, out-of-sample likelihood, and train-on-synthetic scores. | Active — read in full 2026-09-26 (NOTE-172); worth reading as the most systematic philosophical treatment of unsupervised learning as a family, and as the target of Søgaard’s reply. Its headline claims (“perhaps the most fundamental branch of all AI”) are argued more thinly than its E/O structure. |
| LIT-189 v2 | Philosophy of Open Science | Leonelli (2023), DOI-10.1017/9781009416368. Leonelli argues that mainstream, institutional Open Science treats openness as the unlimited, digital sharing of research objects, a transparency-first ordering running transparency → quality (reproducibility) → inclusion. This rests on an object-oriented, “resourcist” epistemology of science. Four implementation cases (GISAID COVID data, open-source software stigma, crop-data linkage, the reproducibility “crisis”) show it can narrow epistemic diversity and entrench epistemic injustice, which lowers reliability. She proposes instead “openness as judicious connection”, grounded in a process-oriented view of research as the cultivation of “active knowledge”. Her Figure 2 inverts the ordering to start from inclusion, and sharing becomes “neither a necessary starting point nor a sufficient condition” for reliable OS (p. 8). | Active — read in full 2026-09-26 (NOTE-098); worth reading as a clear, openly normative philosophical reframing of Open Science by someone who took part in the policy process, and as a compact bridge between social epistemology (epistemic injustice, pluralism) and data practice. Its evidence is four illustrative cases and the author’s own qualitative research, not systematic data, and “judicious” remains a demand for deliberation rather than a criterion. |
| LIT-191 v3 | AI and Consciousness | Schwitzgebel (2025), ARXIV-2510.09858. A book-length sceptical argument that neither introspection, conceptual analysis nor any current theory (GWT, HOT, IIT, local recurrence, unlimited associative learning, biological views) can tell us whether near-future AI is conscious. The best sceptical argument, Mimicry, only undercuts the inference from humanlike text to consciousness and does not show absence. On the Leapfrog Hypothesis the first disputably conscious AIs will be person-like, and the question will then be settled socially rather than scientifically (the “Social Semi-Solution”). | Active — read in full 2026-09-26 (NOTE-104); worth reading as the most complete current map of the AI-consciousness debate, and as the source of the Mimicry Argument, the Problem of Minimal Instantiation and the Leapfrog Hypothesis. Its own positive contributions are informal arguments and predictions, not results. |
| LIT-192 v2 | What’s at stake in the debate over naturalizing teleology? An overlooked metatheoretical debate | Nahas & Sachs (2023), DOI-10.1007/s11229-023-04147-w. The paper argues that “naturalizing teleology” serves at least two relatively autonomous projects with different success criteria. One is scientific: whether an organism-centred account improves biology, which requires operationalisable models that may trade truth for usefulness. The other is philosophical: whether organismal teleology reshapes the liberal-versus-scientific naturalism debate about mind in nature, which requires truth but no operationalisation. It applies the distinction to one recurring dispute, the demarcation of teleological systems from dissipative structures. In the scientific context, models “cannot and need not” demarcate (§4.1: Cusimano & Sterner; McShea & Babcock). In the philosophical context, preferences between accounts turn on unstated commitments (§4.2: García-Valdecasas’s Aristotelian case for Deacon over the Organizational Approach). | Active — read in full 2026-09-26 (NOTE-094); worth reading as a compact map of organism-centred teleology (the Organizational Approach, Deacon, Walsh, McShea) and for one reusable move, asking which problem an account of goal-directedness is meant to solve. Its positive pluralism is only suggested (“tempting to suggest”, §5), and it is shown on a single dispute. |
| LIT-194 v3 | Religion and Science | De Cruz (2017), https://plato.stanford.edu/entries/religion-science/. A survey, not an argument. It reports that the scholarly field rejects the conflict model the public holds, and it finds Barbour’s four-way taxonomy (conflict, independence, dialogue, integration) influential but neither exhaustive nor exclusive. Its survey of five traditions shows the relation varies with creed and colonial history, and it describes the field fragmenting into claim-by-claim “science engaged theology”. Its metaphysical content is concentrated in §1.2 (methodological vs ontological naturalism) and §3.1 (divine action under deterministic, chaotic and quantum physics; primary vs secondary causation; chance and providence). | Active — read in full 2026-09-26 (NOTE-107); worth reading as the standard orientation to the science–religion literature and as a map of the divine-action and naturalism debates; it is a survey, so its claims are only as strong as the works it cites, and it is written from within the (largely Christian) field it describes. |
| LIT-195 v2 | World models, artificial general intelligence and the hard problems of life–mind continuity: toward a unified understanding of natural and artificial intelligence | Safron et al. (2026), DOI-10.1098/rsta.2024.0533. The editorial introduces a theme issue of 17 papers. It concludes that the issue “overall appears to converge” on one view: LLMs model the world in some senses but “probably” lack coherent causal world models, and are not likely paths to “artificial general superintelligence” (§1). It separates three senses of “world model”: any information about the world a system cognizes over, which LLMs “clearly” have; representation of causal structure, “less certain”; and causal prediction “in the service of agentic functioning”, where the divergence “may become even greater” (§3). It closes that world models are “context-dependent constructions shaped by embodiment, dynamics, goals and social learning”. | Active — read in full 2026-09-26 (NOTE-136); worth reading as the map of the theme issue and a short, citable statement of the three senses of “world model”. It argues nothing itself. Its claims are editorial glosses on 17 contributions, which carry the evidence. |
| LIT-196 v3 | Ontological Priority: The Conceptual Basis of Non-eliminative, Ontic Structural Realism | Chakravartty (2011), DOI-10.1007/978-94-007-2579-9_10. Non-eliminative OSR needs relations to be prior to their relata in the determination of their identity. Chakravartty argues that every available account of objects (substance, bundle theory, bundles of dispositionally individuated properties) leaves identity-fixing intrinsic features, and that stripping all of them away is just eliminativism. So OSR faces an exclusive disjunction: eliminativism, or a role for the intrinsic in identity. The graph-theory analogy and the physics cases (entanglement, spacetime points) do not escape the dilemma. The argument is conceptual throughout, and it explicitly leaves eliminative OSR untouched. | Active — read in full 2026-09-26 (NOTE-149); worth reading as the clearest statement of the dilemma facing relation-priority versions of OSR. Its §10.3 explication of “ontological priority” as a dependence claim is reused widely, and it names its own soft spot: the intrinsic/extrinsic asymmetry argument in §10.5. |
| LIT-198 v3 | Rule Consequentialism | Hooker (2003), https://plato.stanford.edu/entries/consequentialism-rule/. A survey written by the view’s leading defender. It argues that full rule-consequentialism is best formulated in expectablist terms (Sophisticated criterion: the rules with greatest expected good, ties broken by closeness to conventional morality), counting the costs of teaching and internalising a code in new generations and assuming incomplete acceptance (the ~90% “overwhelming majority” formulation or a “teaching formulation”). So formulated, it answers the collapse objection, answers the incoherence objection only if the view is justified by reflective equilibrium rather than from consequentialist premises, and answers rule-worship with a vague prevent-disaster rule (§8, NOTE-160), while demandingness in other possible worlds, contingency of justification, the teachers problem and rule conflict remain open (§9). | Active — read in full 2026-09-26 (NOTE-160); worth reading as the standard, carefully argued reference on rule-consequentialism and its §8 replies, provided it is read as an advocate’s survey (Hooker is the view’s main contemporary proponent) rather than a neutral one. |
| LIT-199 v3 | The Philosophy and Physics of Duality | De Haro & Butterfield (2025), ARXIV-2508.01616. The book gives a formal Schema: a duality is an isomorphism between the “model roots” (state space, quantities, dynamics) of two models of a common-core bare theory, with values and dynamics matching. It pairs this with an interpretative condition: duals are physically equivalent iff (A) they are duals and (B) i1 = i2∘d. On that basis it argues four things. First, there are no genuine cases of in-principle underdetermination in the examples, and a cautious realist can commit to the common core. Second, dualities do not favour structural realism. Third, duality is formally incompatible with ontological emergence, except “beside” it (AdS/CFT’s RG direction), via effective dualities, or epistemically. Fourth, quasi-dualities motivate a “geometric view” on which models are charts on a successor theory’s moduli space. | Active — read in full 2026-09-26 (NOTE-178); worth reading as the reference treatment of dualities in philosophy of physics. It supplies definitions (the Schema, §3.1, and physical equivalence, §12.1.2, p. 402) and a common vocabulary (internal/external interpretation, common core, quasi-duality) that the rest of the record’s duality works either use or argue against. Its physics examples are admittedly partly conjectural (AdS/CFT, Montonen–Olive and M-theory are unproven), and its realism is a stated position, not a derivation. |
| LIT-202 v2 | Consent and the Formation of Preferences | Pettigrew (2026), DOI-10.1111/phpr.70131. Whether consent based on a preference switches the moral facts depends on how the preference was formed, and the criterion is “the space and resources those mechanisms leave for the free exercise of agency” (p. 5, restated p. 9): preferences formed by unjust Sanctions, or by Beliefs formed in an unjustly manipulated evidential environment, diminish consent’s effectiveness, while preferences formed by Attention do not, even when an unjust force imposed the contact. Effectiveness is graded, and because the relevant mechanism is usually opaque, uncertainty about whether received consent is effective is “ubiquitous and quotidian” (p. 10). | Active — read in full 2026-09-26 (NOTE-144); worth reading as a short, clearly organised proposal that turns the adaptive-preferences debate into a question about mechanisms and free agency; the criterion is argued by cases and left rough by the author’s own account, and one of the seven mechanisms it promises to sort (Amor Fati) is never sorted. |
| LIT-204 v2 | Realism about the Wave Function | Chen (2018), ARXIV-1810.07010. A survey that sorts realist readings of the non-relativistic universal wave function into four ontological readings (a field on 3N-dimensional space, a multi-field on 3-space, properties of systems as in spacetime state realism, a Hilbert-space vector), two nomological ones (strong: time-independent and simple like the classical Hamiltonian; weak: a Humean best-system variable) and Maudlin’s sui generis option. It tabulates their compatibility with BM, GRW0/m/f and S0/Sm and with high- versus low-dimensional fundamental space (Table 1, 10 of 56 cells ”?”), and declares no winner. | Active — read in full 2026-09-26 (NOTE-175); worth reading as the compact map of the realist options and the hub for the wave-function cluster (LIT-200, LIT-100, LIT-164, LIT-121, LIT-176), with the caution that Table 1 is asserted, not derived, and is uneven in places. |
| LIT-205 v2 | One equation to rule them all: a philosophical analysis of the Price equation | Luque (2016), DOI-10.1007/s10539-016-9538-y. Luque argues that the Price equation, Δz̄ = Cov(w, z) + E(wΔz) (eq. 1, p. 7), is a Kuhnian “generalization-sketch”, like f = ma. It is not a model, has no predictive power on its own, and becomes empirical only when a specific model interprets it. On that reading the critics’ charges (van Veelen 2005; van Veelen et al. 2012; Nowak & Highfield 2011) that it is “a tautology” and “lacks predictive power” are either false or ask too much, and he recommends that evolutionary biologists adopt it as their unifying framework. | Active — read in full 2026-09-26 (NOTE-101); worth reading as a clear statement of the generalization-sketch reading of the Price equation and as a map of its extensions up to 2015 (Tables 2–3). The philosophical argument is thin in places, notably the Gödel-based case that it is “not a tautology”, so it should be read as one side of the dispute and not as a settlement of it. |
| LIT-206 v3 | What Does ChatGPT Want? An Interpretationist Guide | Goldstein & Lederman (2025), DOI-10.1080/0020174X.2026.2727584. Taking as given an “objective” interpretationism, on which a system has beliefs and desires iff the hypothesis that it is rational and has them predicts its behaviour well enough on accuracy, power and tractability, the authors argue three things. The agent is the per-conversation instance, not the model. The case that instances have beliefs and desires is only “presumptive”, resting on tractability. The desire hypothesis is “provisionally” HHH+0: helpful, honest and harmless, plus in-context “zero-shot” intrinsic desires. The decisive HHH vs HHH+0 comparison is a conjecture that the authors say needs further empirical work. | Active — read in full 2026-09-26 (NOTE-138); Worth reading as the clearest statement of interpretationist realism about LLM instance agents. It turns “does it want?” into comparisons of rival desire hypotheses against named behavioural results, and it is candid that its central empirical discriminations are untested. |
| LIT-207 v2 | Talkative AI and the fiction of artificial minds | Roberts (2026), DOI-10.1007/s11098-026-02560-8. If a substantial class of mental states (interoceptive, affective, perceptual, and bodily-agentive states such as effort, trying and ownership) depends on an animate body, then today’s disembodied chatbots lack them, and their many self-ascriptions of such states are “systematically untrue”. Roberts argues that users can nonetheless engage chatbots through make-believe, as a new kind of fictional character that is interactive, co-constructed, self-involving and blended with the real world. He argues that this fictionalist stance escapes the epistemic norms that bind realist belief. | Active — read in full 2026-09-26 (NOTE-157); worth reading as a short, clear statement of chatbot fictionalism. Its anti-realist premise is explicitly conditional and targets only body-dependent states, which leaves belief and reasoning open. |
| LIT-209 v2 | The Phenomenology of Ritual Resistance: Colin Kaepernick as Confucian Sage | Walsh (2021), DOI-10.1007/s11712-020-09759-4. Walsh argues, drawing on Confucian texts (the Analects, Mengzi, Xunzi) and Merleau-Pontian phenomenology, that Colin Kaepernick’s kneeling during the U.S. national anthem is “Confucian incivility” enacted bodily within the ritual. On his reading it rebukes the ritual’s current object while staying reverent towards its ideal. He further argues it is “sagely” in a deliberately deflated sense: its “citational force” founds a widely imitated bodily expression of patriotism. The paper is interpretive; it reports no data and states no formal thesis. | Active — read in full 2026-09-26 (NOTE-164); worth reading as a careful worked example of how a norm-governed bodily practice can be contested from inside, and of Nivison and Hutton’s diachronic reading of Xunzian sagehood put to use. Its standing is as comparative-philosophy interpretation, and its central normative notion (sagehood as uptake) is under-argued. |
| LIT-210 v2 | Philosophy of Microbiology | O’Malley & Parke (2020), https://plato.stanford.edu/entries/microbiology/. O’Malley & Parke argue in four steps that philosophy should attend to microbes. Microbes do most of the planet’s biological work and underlie every major transition. Microbiology founded medicine, molecular biology and genomics. Microbes are unusually good material models, including for phenomena once defined by animals (predation, ageing, kin recognition, cognition). Microbiome research bears on individuality and causation. They are sceptical about the strongest microbiome claims. Whether host and microbiome form one unit of selection is “still disputed”. Claims that microbiomes change the “self” are “usually expressed in very vague language”. The 2026 revision adds that Asgard-archaea phylogenies may make eukaryogenesis “first and foremost a story about diversification within Archaea” rather than a transition in individuality. | Active — read in full 2026-09-26 (NOTE-159); worth reading as a short, current (April 2026) orientation to where microbes change philosophy of biology, with a useful deflationary check on microbiome-and-self claims. It is a survey with no thesis beyond “pay attention to microbes”; for individuality it points onward to the Biological Individuals (LIT-168) and Units and Levels of Selection (LIT-160) entries. |
| LIT-211 v3 | What Lives? A meta-analysis of diverse opinions on the definition of life | Bender et al. (2025), ARXIV-2505.15849. Three LLMs (Claude 3.7 Sonnet, GPT-4o, Llama 3.3 70B), each run 3 times on both orderings of every pair, rated 68 hand-solicited definitions of life on a −1 to 1 “correlation” rubric. The averaged matrix, cut by complete-linkage clustering at an elbow, gives 8 clusters, 45/68 of them (66%) in “Cognitive Autonomy” (n=24) and “Dissipative Self-Organizing Systems” (n=21). The clusters are weak: the repo’s own saved statistics give an overall silhouette of 0.079, and cross-model agreement is an unadjusted Rand index of 71–79% against a chance level of about 62–74%. The headline that life is “a continuous semantic landscape” is not tested against any alternative. | Active — read in full 2026-09-26 (NOTE-109); worth reading as a dataset: 68 signed, three-sentence definitions of life from named researchers, with a manual thematic coding (Table 1). Its computational conclusions are weakly supported and are better read as illustrations than as findings. |
| LIT-213 v2 | Rigour versus the need for evidential diversity | Cartwright (2021), DOI-10.1007/s11229-021-03368-1. Cartwright offers a characterisation of “rigour”: a method is rigorous when a valid argument shows its results are evidence for the conclusion and its premises are well established or secured by design. On that definition even well-run RCTs often fail to rigorously establish a study-population ATE, because orthogonality holds only at assignment and the potential-outcomes premise carries heavy metaphysics, and they seldom answer singular questions. Her alternative is a causal-process-tracing theory of change (pToC) with five elements (steps, causal principles, support factors, derailers, safeguards). It catalogues the diverse and mostly non-rigorous evidence that singular causal predictions need. | Active — read in full 2026-09-26 (NOTE-161); worth reading as a compact, citable statement of the “rigour is overvalued, evidence the causal process” position. The pToC template is concrete, but the paper openly offers no method for weighing the evidence it catalogues. |
| LIT-216 v2 | The Weirdness of the World | Schwitzgebel (2024), DOI-10.1515/9780691239309. The book’s thesis is that every viable theory of how consciousness fits into the cosmos, and of the cosmos’s basic structure, is both “bizarre” (contrary to common sense) and “dubious” (not rationally compelling). So “something that seems almost too crazy to believe must be true” (p. 4), and credence should be spread across the bizarre options. Examples of those options are that the United States is conscious (if materialism is true), that we are sims or Boltzmann brains (a 0.1–1% credence), that space is transcendentally ideal, that almost every act causes almost every future event, and that there is no fact about snail consciousness. Its only positive empirical results are three self-experiments against solipsism (for example, 17 of 19 decisive chess games lost, p < .001). Everything else is informal argument. | Active — read in full 2026-09-26 (NOTE-188); Worth reading as the one place Schwitzgebel’s separately published arguments are joined into a single case: US consciousness, crazyism, 1% skepticism, Kant meets cyberpunk, the garden snail, and the Full Rights Dilemma for AI. Chapter 3, the Universal Bizarreness and Dubiety argument, is the load-bearing contribution. Its individual chapters are informal arguments, and the manuscript that can be reached is not the published text. The published book reorders the chapters, moves the objections appendix to the end and updates the AI chapter. |
| LIT-217 v3 | Science, Metaphysics and Structural Realism | Ladyman (2001), DOI-10.21825/philosophica.82261. Ladyman argues that structural realism should be metaphysically, not epistemically, revisionary. He gives three grounds. Quantum statistics leaves the individuality of particles underdetermined: permutation invariance gives 3 two-particle states, not 4, so probabilities are 1/3 rather than 1/4 (p. 62). Entangled states give non-supervenient relations that refute Humean supervenience (pp. 71–73). The hole argument blocks point-based substantivalism (pp. 68–69). He proposes that science describes “the modal structure of the phenomena” (p. 73), with modal realism supplying the no-miracles intuition. The paper ends non-eliminatively: “the phenomena have structure but they are not structure” (p. 74). | Active — read in full 2026-09-26 (NOTE-192); Worth reading as the earliest freely available statement of ontic structural realism by its originator. It argues the Humean-supervenience and quantum-individuality points more fully than the SEP survey (LIT-045). It also shows that the 2001 view was a modest one, realism about modal structure with no eliminativism, before Every Thing Must Go. Its positive proposal takes two paragraphs (pp. 73–74) and is programmatic. |
| LIT-218 v2 | Ontic Structural Realism and Economics | Ross (2008), DOI-10.1086/594518. Ross argues that OSR, usually motivated only by fundamental physics, is also the right ontology for a mature special science, economics. The progress of economic theory from Jevons through Hicks–Allen (1934), Samuelson (1947), Debreu (1959) and Arrow (1965) consists in steadily removing psychological, individual-level hypotheses. Its basic objects are optimisation problems, above all games, which are “mathematical structures … whose relata are distinguished as such by the mathematical representations … just like quarks and bosons” (§3). So OSR, joined with an assumption that science is unified, gets consilient support from outside physics. Individuals, in physics and in economics, are “book-keeping devices”. | Active — read in full 2026-09-26 (NOTE-189); Worth reading as Ross’s own short statement of what OSR says outside physics. It argues that individuals are bookkeeping heuristics while “tables and rocks” and people still exist, and that consilience across the sciences, not physics alone, can support OSR. Its history of economics is a sketch, and its central claims are asserted from the formalism rather than argued against a worked alternative. Cite the 2008 Philosophy of Science version. This note reads the 2006 preprint. |
| 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-220 v2 | Real Patterns | Dennett (1991), DOI-10.2307/2027085. A pattern is real in some data “if there is a description of the data that is more efficient than the bit map, whether or not anyone can concoct it” (p. 34). This is Chaitin’s incompressibility definition of randomness turned around (p. 32). Dennett uses the criterion, with the Game of Life’s gliders and eaters as the stepping stone (pp. 37–42), to defend “mild realism” about beliefs. Folk psychology tracks a real, noisy pattern of enormous predictive leverage. Two rival interpretations can be “different, but equally real, patterns” with no deeper fact to settle between them (p. 49). | Active — read in full 2026-09-26 (NOTE-190); Worth reading as the source of the real-patterns criterion that rainforest realism generalises into a theory of existence, and as the paper whose exact definition the later literature modifies. It has a lossless-compression criterion, observer-relativity through “perspectives”, and trade-offs between noise and simplicity. Its target is beliefs, not ontology in general. Dennett explicitly declines the label question (“I think that the view itself is clearer than either of the labels”, p. 51). |
| LIT-221 v2 | Yoneda lemma | nLab (2009), https://ncatlab.org/nlab/show/Yoneda+lemma. The page states that for a locally small category C, every presheaf X and every object c, there is a canonical bijection Hom_{[C^op,Set]}(y(c), X) ≅ X(c), given by η ↦ η_c(id_c). It proves the bijection by chasing id_c around a naturality square. From it the page derives that the Yoneda embedding y: c ↦ Hom_C(−,c) is fully faithful and that y(c) ≅ y(d) ⇔ c ≅ d. It also shows by counterexample that the hypothesis doing the work is naturality: objects whose hom-sets are pointwise in bijection need not be isomorphic. | Active — read in full 2026-09-26 (NOTE-195); Worth reading as a compact, correct statement and proof of the lemma with the embedding and the iso-determination corollary. It also has a “Necessity of naturality” section, which textbooks rarely include and which any structuralist reading of the lemma needs. Two caveats: its classical statement does not state naturality in c and X (the HoTT section does), and its finite counterexample is ill-formed as written. |
| LIT-222 v2 | No categorial support for radical ontic structural realism | Lam & Wüthrich (2015), DOI-10.1093/bjps/axt053. Lam and Wüthrich argue that category theory gives radical OSR no support. Identifying objects with identity arrows is relabelling (§3). Generalized elements X → A exist in every category, so elements are not eliminated (§4). Categories without products also lose set-style relations, “throwing out the relations with the relata” (§4). Morphisms relate C-objects, not the elements that stand for physical relata, and they “only distinguish isomorphism classes of structures” (§5). Bain’s GR and TQFT cases eliminate at most spacetime points, not relata tout court (§§6–7). They conclude that category theory “offers little if any comfort to ROSR” (abstract) and favour “balanced” OSR. The Yoneda lemma is not named, although §§4–5 state two of its consequences. | Active — read in full 2026-09-26 (NOTE-194); Worth reading as the most careful direct refutation of Bain (yo2). Its main points (generalized elements, morphisms relate C-objects, determination only up to isomorphism, sections are not maximal ideals) are correct and are exactly what the Yoneda reading needs. It has a few category-theoretic slips of its own: Hilb said to lack products, a mis-definition of topos, and the claim that non-commutative algebras have no maximal ideals. |
| LIT-223 v2 | Category-theoretic structure and radical ontic structural realism | Bain (2013), DOI-10.1007/s11229-011-9896-6. Bain argues that the “relations without relata” objection to radical OSR depends on defining structure set-theoretically, where a relation is a subset of X × X. If a structure is instead “an object in a category”, its elements (arrows 1 → A) are “not essential”, because category-theoretic objects need not be structured sets. His examples are sheaves of Einstein algebras for GR with asymptotic boundary conditions, which may lack global sections (§3), and nCob and Hilb (§4). He concludes that ROSR “avoids the charge that it rests on an incoherent claim” (p. 1634). The paper never mentions the Yoneda lemma, representable functors or universal properties by name. | Active — read in full 2026-09-26 (NOTE-193); Worth reading as the short, canonical statement of the category-theoretic defence of radical OSR, which the later literature (yo3; Lal & Teh; Eva 2016) responds to. Read it with yo3. Its central inference is overstated, and its GR section contains technical errors that yo3 documents. |
| LIT-224 v2 | Shannon Information and Kolmogorov Complexity | Grünwald & Vitányi (2004), arXiv:cs/0410002. A survey pairing Shannon’s and Kolmogorov’s notions: entropy and complexity, probabilistic and algorithmic mutual information, data processing, sufficient statistics, and rate–distortion and the structure function. For a computable source f, expected complexity is within K(f) + O(1) of entropy, and expected algorithmic mutual information is within K(f) and 2K(f) of Shannon’s. An algorithmic sufficient statistic is probabilistically nearly sufficient in expectation, one way only. The expected structure function tends to the distortion-rate function per symbol. | Active — read 2026-10-14 (NOTE-776) in full; worth reading as the one place that sets each Shannon quantity beside its Kolmogorov counterpart with the gap stated. Expected complexity exceeds entropy by at most K(f) + O(1), expected algorithmic mutual information is within K(f) and 2K(f) of Shannon’s, and the expected structure function brackets the distortion-rate function with a K(f, d, m, R) shift in rate. The two new results are Theorems 5.13 and 6.27. Read it knowing that every bridge costs the complexity of the source and says nothing about one string, that sufficiency links only one way (algorithmic to probabilistic, in expectation), that a step in Theorem 6.27 is asserted, and that the authors warn the draft contains errors. |
| LIT-225 v2 | Minimum Description Length Induction, Bayesianism, and Kolmogorov Complexity | Vitányi & Li (1999), arXiv:cs/9901014. Ideal MDL selects the H minimising K(H) + K(D|H), Bayes’s rule with the universal distribution in place of prior and likelihood. By the Fundamental Inequality, when the data are random for H and H is random for the prior, Bayes code lengths and Kolmogorov code lengths agree to within K(Pr(·|H)) + K(P). So ideal MDL and MAP agree to that factor among such hypotheses, and can diverge outside them. For finite-set models they coincide with Kolmogorov’s minimal sufficient statistic. For random sequences, shortest-program prediction converges to the true conditional. | Active — read 2026-10-14 (NOTE-801) in full; worth reading as the stated condition under which minimum description length and Bayes coincide: by the Fundamental Inequality (Theorem 3), Bayes code lengths and shortest-program lengths agree to within K(Pr(·|H)) + K(P) when the data are Martin-Löf random for the hypothesis and the hypothesis is random for the prior, so ideal MDL and MAP agree to a factor 2^{−α} among such hypotheses (Theorem 4), and for finite-set models both reduce to Kolmogorov’s minimal sufficient statistic. Read it knowing that α can be as large as the hypothesis’s own complexity, that admissibility cannot be checked, that “with high probability” (Corollary 1) and the overfitting claim are unproved, and that the arXiv text is the submitted version. |
| LIT-226 v2 | The Conditional Entropy Bottleneck | Fischer (2020), ARXIV-2002.05379. The Conditional Entropy Bottleneck minimizes I(X;Z|Y) − γI(Y;Z), which is the Information Bottleneck with γ = β − 1, aimed at the “Minimum Necessary Information” point I(X;Y) = I(X;Z) = I(Y;Z). On Fashion MNIST it improves accuracy, adversarial robustness, OoD detection and calibration over VIB and deterministic baselines, and it does not memorize random labels. On CIFAR-10 it improves accuracy and robustness. That excess retained information causes these failures is stated as a hypothesis and supported only empirically. | Active — read 2026-10-14 (NOTE-754) in full; worth reading as the paper that names the Minimum Necessary Information point I(X;Y) = I(X;Z) = I(Y;Z), shows that its objective is the Information Bottleneck with γ = β − 1, and gives variational bounds (the residual information ReX) that make the distance to that point observable. Its CatGen decoder is InfoNCE with the backward encoder as critic, capped by log K. Read it knowing that the causal claim, that retained information causes adversarial vulnerability, miscalibration, poor OoD detection and memorisation, is a hypothesis supported only by Fashion MNIST and one selected CIFAR-10 model per setting, and that the arXiv v1 prints the CatGen inequality (Eq. 30) with the wrong sign. |
| LIT-227 v2 | Contrastive Learning Is Spectral Clustering On Similarity Graph | Tan et al. (2023), ARXIV-2303.15103. Over a finite set of n objects with a symmetric augmentation matrix π, SimCLR’s InfoNCE loss with a Gaussian kernel on the unit sphere equals tr(Zᵀ L(π) Z) + log R(Z), a Laplacian quadratic form plus the log of InfoNCE’s normalizers. The paper calls this spectral clustering under a definition that admits any regularizer, and does not characterize the minimizer. CLIP is treated the same way on a bipartite pair graph. Mixtures of exponential kernels gain 1 to 4 linear-probe points on CIFAR-10/100 and TinyImageNet, not uniformly. | Active — read 2026-10-14 (NOTE-846) in full; worth reading as an exact identity: SimCLR’s InfoNCE loss, over all n objects with a Gaussian kernel on the unit sphere and a symmetric augmentation matrix π, equals tr(Zᵀ L(π) Z) + log R(Z), a Laplacian quadratic form plus the log of InfoNCE’s normalizers. Read it knowing that its “spectral clustering” admits any regularizer (Def. 2.7), so no minimizer is characterized and no eigenvector or density-ratio statement follows. The CLIP extension is a two-sentence proof, the batch-size reading is a remark, and the kernel gains are 1 to 4 points on three small datasets. |
| LIT-228 v2 | Contrastive and Non-Contrastive Self-Supervised Learning Recover Global and Local Spectral Embedding Methods | Balestriero & LeCun (2022), ARXIV-2205.11508. On a finite sample with a positive-pair graph G, idealized VICReg is Laplacian eigenmaps, a Euclidean SimCLR variant is a generalized MDS, and linear Barlow Twins is CCA. All three align the representation’s leading left singular vectors with G’s. SimCLR and Barlow Twins force rank(Z) = rank(G), and VICReg can stay full rank. Any of them is optimal for a linear probe on the training set iff G’s spectrum spans the task’s. | Active — read 2026-10-14 (NOTE-752) in full; worth reading for its method-by-method dictionary from joint-embedding SSL to spectral embedding on a finite positive-pair graph G. VICReg with a squared variance term is Laplacian eigenmaps (LPP when linear). A Euclidean SimCLR variant is a generalized MDS whose optimum is the top eigenvectors of G scaled by √eigenvalue. Linear Barlow Twins is CCA. All of them align Z’s left singular vectors with G’s, and they differ in rank. Read it knowing three things. The closed forms hold for modified losses, on a finite sample, with free or linear Z. Theorems 6, 9 and 10 are sketched or unproved. And the practical advice (prefer low-invariance VICReg under a misaligned G) rests on an unproved bound and synthetic experiments with N = 256. |
| LIT-229 v2 | Meaningful Information | Vitányi (2001; IEEE Trans. Inf. Theory 2006), arXiv:cs/0111053. With total recursive functions as models, the algorithmic minimal sufficient statistic, sophistication, splits a string’s information into structure and noise. The split collapses to zero for every string if partial recursive models are allowed. Random strings have sophistication about 0, and some strings of every length are almost all structure. The finite-set, probabilistic and total-function versions agree to within logarithmic terms. Sophistication is not computable, and a sufficient-statistic oracle would compute K. | Active — read 2026-10-14 (NOTE-790) in full; worth reading as the short proof that splitting an individual string’s information into structure and noise works only in a model class without a universal member: with partial recursive models every string’s minimal sufficient statistic is trivial (Lemma 6.2), while with total recursive functions sophistication runs from about 0 for random strings to above n − log n − 2 log log n for some string of every length (Theorem 6.5), and agrees with the finite-set and probabilistic versions to within O(log n) (§VII). Read it knowing that everything holds only to within additive constants or logarithmic terms, that sophistication is uncomputable and not usefully approximable, that two steps rest on cited work (Gács–Tromp–Vitányi; Vereshchagin–Vitányi), and that the structure-function characterisation of §IX is stated, not proved. |
| LIT-230 v2 | Riesz representation theorem (Wikipedia) | Wikipedia contributors (2026), https://en.wikipedia.org/wiki/Riesz_representation_theorem. A Hilbert space is isometrically (anti-)isomorphic to its continuous dual — every continuous linear functional φ is x ↦ ⟨x, f_φ⟩ for a unique f_φ with ‖f_φ‖ = ‖φ‖ — and this identification is what defines adjoints and the bra–ket correspondence. | Active — read 2026-10-14 (NOTE-861) in full; worth reading as a careful reference statement of the Riesz theorem in both the real and the complex case, with four constructions of the representing vector and the definition of the adjoint of a bounded operator through it. Read it knowing that it is Wikipedia, that it treats bounded operators only, and that it says nothing about kernels, RKHS or spectra. |
| LIT-231 v2 | The Hidden Uniform Cluster Prior in Self-Supervised Learning | Assran et al. (2022), ARXIV-2210.07277. Joint-embedding methods whose anti-collapse term maximizes the volume of the representation carry a prior toward features that split the data into equal-sized clusters: explicitly in MSN (a KL to uniform over mean cluster assignments) and SwAV (an equipartition constraint), through an informal reduction to K-means for VICReg, and by a cited equivalence for SimCLR. With mini-batches of two to eight ImageNet classes, SimCLR, VICReg and MSN lose 11–18 points of linear ImageNet accuracy while MAE and data2vec do not. Replacing MSN’s uniform target with a power law (PMSN) gains about a point on long-tailed iNaturalist-18, three with the true class distribution. | Active — read 2026-10-14 (NOTE-850) in full; worth reading for the clearest statement that a joint-embedding objective’s anti-collapse term is not neutral: MSN’s mean-entropy regularizer is a KL penalty pulling cluster sizes toward uniform, and SwAV enforces equal sizes outright. Read it knowing that the same prior is reached for VICReg only through an informal reduction of a simplified loss to K-means, and for SimCLR only through a cited equivalence; that the imbalance experiment uses two to eight ImageNet classes per batch, not a naturally long-tailed dataset; and that the iNat18 gains are single runs of 1–3 points, the largest using the true class labels. The account is THEORY-306; the practical advice belongs in the anthology. |
| LIT-232 v2 | Knowledge Sheaves: A Sheaf-Theoretic Framework for Knowledge Graph Embedding | Gebhart, Hansen and Schrater (2021; AISTATS 2023), ARXIV-2110.03789. A knowledge-graph embedding is a cellular sheaf of vector spaces on the schema graph, with restriction maps per relation type, plus a 0-cochain of its pullback to the knowledge graph. The summed Structured Embedding score is the sheaf Laplacian form, and TransE, TransR and RotatE are special cases; bilinear models are not. Since the zero cochain is always a section, training needs negatives and a margin. Composite multi-hop queries are scored without extra training by harmonic extension, a Schur complement, which beats naive TransE summation on ip and pi queries in untuned experiments. | Active — read 2026-10-14 (NOTE-843) in full; worth reading as the clean dictionary between coboundary-type knowledge-graph scores (Structured Embedding, TransE, TransR, RotatE) and cellular sheaves on the schema, with the summed score as a sheaf Laplacian form and multi-hop queries scored by harmonic extension, a Schur complement. Read it knowing that bilinear models fall outside it, that the zero cochain is always a section so all content is in the contrastive margin, that “approximate global section” means only small Laplacian energy, and that the experiments are preliminary, untuned and well below query-embedding baselines. It shares the word “sheaf” with the contextuality line and nothing else of substance. The account is THEORY-299. |
| LIT-233 v3 | Data-Dependent Generalization Bounds via Variable-Size Compressibility | Sefidgaran & Zaidi (2023), ARXIV-2303.05369. Letting the coding rate of a block of training runs vary with the realised sample and output gives generalisation bounds that depend on the sample at hand, not only on its distribution. With the rate set to log dP_{W|S}/dP(W) for a fixed prior, the bound is the disintegrated PAC-Bayes bound, and general change-of-measure versions recover most PAC-Bayes and mutual-information bounds. A new trajectory bound is data-dependent except for a coupling term that carries the trajectory’s dependence on the sample, and its experiment drops that term. | Active — read 2026-10-14 (NOTE-806) in full; worth reading as the paper that makes rate-distortion generalisation bounds data-dependent by letting the coding rate vary with the realised sample and output (Theorem 1), and that shows the disintegrated PAC-Bayes bound to be the case where the rate is log dP_{W|S}/dP(W) against a fixed prior, with Xu–Raginsky, Rivasplata et al. and LIT-236’s bounds as other instances (Theorems 3–5). It adds a lossy PAC-Bayes bound finite for deterministic continuous-parameter algorithms (Proposition 1) and a trajectory bound (Theorem 7). Read it knowing that the coding construction is proved only for finite alphabets and the general proofs are change of measure, that the rate is a Shannon code length against a prior and not Kolmogorov complexity, that Theorem 7 is data-dependent except for a coupling term M that carries the trajectory’s dependence on the sample, and that the CIFAR-10 experiment drops M and shows only that two curves fall together, with a vacuous value for FCN4. |
| LIT-234 v3 | The Effects of Regularization and Data Augmentation are Class Dependent | Balestriero et al. (2022), ARXIV-2204.03632. On ImageNet with ResNet-50, strengthening random crop or changing weight decay raises mean test accuracy while some classes fall sharply (e.g. “barn spider” about 68%→46% as the crop lower bound goes from 100% to 8%). Different pretrained architectures agree on which classes crops make unrecognisable. Pretraining crop strength also moves per-class linear-probe accuracy on iNaturalist in opposite directions. The evidence is selected classes and an uncorrected test. | Active — read 2026-10-14 (NOTE-845) in full; worth reading as a clear demonstration, on standard ImageNet ResNet-50 training, that the regularization strength best on average is not best for every class: stronger random crop and changed weight decay raise mean accuracy while some named classes lose 20 points or more, and the shift survives a frozen-backbone transfer to iNaturalist. Read it knowing that the evidence is per-class curves for hand-picked classes over 10–20 runs, that its significance test is uncorrected for 1,000 classes (4.4% rejections at the 5% level), that the weight-decay claim rests on one figure with no numbers, that Theorem 1 does not reach the class-level claim, and that the abstract’s iNaturalist example (class #8889, 70% to 30%) is a drop from moderate to strong cropping, not from none. |
| LIT-235 v2 | When and How Does Known Class Help Discover Unknown Ones? Provable Understanding Through Spectral Analysis | Sun et al. (2023), ARXIV-2308.05017. A spectral contrastive loss over an augmentation graph that adds labelled same-class pairs (NSCL) is equivalent to factorizing its adjacency. At that optimum, a novel labelling’s least-squares residual is exactly its component on the discarded eigenvectors that their labelled rows cannot absorb, which can be zero. In a toy, known classes sharing the target attribute remove the residual, and ones sharing a rival attribute raise it. | Active — read 2026-10-14 (NOTE-833) in full; worth reading as an exact account, within HaoChen et al.’s spectral contrastive framework, of how labelled data from other classes changes which partition of unlabelled data the learned features express: the novel labelling’s residual is its part outside the top eigenspace that the labelled rows of the discarded eigenvectors cannot absorb, and a toy shows known classes can help or hurt. Read it knowing that Theorem 5.5 is printed as ≤ though its proof gives equality, that everything is at the exact optimum of a population graph, that the general bound (Theorem 5.6) is approximate, pools all known classes into one averaged block and has notational slips, and that the help-or-harm examples have one sample per kind. |
| LIT-236 v3 | Rate-Distortion Theoretic Generalization Bounds for Stochastic Learning Algorithms | Sefidgaran et al. (COLT 2022), ARXIV-2203.02474. The expected generalisation error of any algorithm is at most √(2σ²·R/n) + ε, where R is the least I(S;Ŵ) of a surrogate output within ε in expected generalisation error. With ε = 0 this is Xu–Raginsky’s bound, which for finite alphabets is shown to be a lossless compression rate. With ε > 0 it stays finite where I(S;W) is infinite, and for a Lipschitz loss it becomes a rate-distortion function, or dimension, of the output’s law. A tail version takes a supremum over a KL ball. All bounds depend on the unknown data distribution. | Active — read 2026-10-14 (NOTE-780) in full; worth reading as the source of the lossy generalisation bound |E gen| ≤ √(2σ²·R_E(ε)/n) + ε, where R_E(ε) is the least I(S;Ŵ) over surrogate outputs within ε in expected generalisation error (Theorem 4), of which Xu–Raginsky’s bound is the lossless case, and of its Lipschitz, rate-distortion-dimension and tail forms (Corollaries 6–7, Theorem 10). Read it knowing that the block-coding meaning is proved only for finite alphabets, that in general spaces Theorem 4 is Xu–Raginsky applied to a surrogate, that every bound depends on the unknown data distribution, that no bound is evaluated for a learned model, and that the one worked example mixes squared and unsquared distortion, so its d/n rate is unsupported. |
| LIT-237 v2 | Bra–ket notation (Wikipedia) | Wikipedia contributors (2026), https://en.wikipedia.org/wiki/Bra%E2%80%93ket_notation. Dirac’s bra–ket notation writes vectors as kets and continuous linear functionals as bras, and on a Hilbert space the Riesz representation theorem is what licenses treating every bra as the conjugate of a ket, so that ⟨φ|ψ⟩ is at once a functional applied to a vector and an inner product. | Active — read 2026-10-14 (NOTE-855) in full; worth reading for the conventions of Dirac notation and for its plain statement that the bracket is an inner product only where the Riesz theorem holds. Read it knowing that it is Wikipedia under a cleanup banner, that its lead was edited on 2026-09-30 to date the notation to a 1930 monograph while its own reference and later text say 1939, that its pointer to GNS for non-normalizable kets is weak, and that two of its sections contradict each other on |ψ⟩† = ⟨ψ|. |
| LIT-238 v2 | Minimum Description Length Revisited | Grünwald & Roos (2019), ARXIV-1908.08484. A review of MDL since 2007, written without coding theory. Each model is replaced by a single universal distribution with small worst-case regret against its best fit. NML is the minimax choice, with complexity (k/2) log(n/2π) + log ∫ v√|I| + o(1). Luckiness functions generalise priors and penalties. The switch distribution nearly resolves the AIC–BIC dilemma, RIPr tests survive optional continuation, general penalised estimators inherit MDL convergence, and MDL and Bayes can be inconsistent under misspecification. Results are cited, not proved. | Active — read 2026-10-14 (NOTE-760) in full; worth reading as the current map of MDL. A model is replaced by one universal distribution with small worst-case regret, NML is the minimax one with complexity (k/2) log(n/2π) + log ∫ v√|I| + o(1), estimation is penalised ML with a luckiness function, and the decade’s results are collected: the switch distribution, RIPr tests, convergence of general MDL estimators, and inconsistency under misspecification. Read it knowing that it is a review whose results are cited rather than proved, that it sets aside Kolmogorov-complexity MDL, and that its “unification” of AIC with BIC and of cross-validation with Bayes is, in its own words, partial. |
| LIT-239 v2 | Kolmogorov’s Structure Functions and Model Selection | Vereshchagin & Vitányi (2002), arXiv:cs/0204037. For a string x of length n and every complexity bound α, Kolmogorov’s structure function h_x(α) + α, the minimal two-part code length λ_x(α) and the best achievable randomness deficiency β_x(α) + K(x) are one function to within O(log n). A set minimising code length at α is a best-fitting set there, though not conversely. Every non-increasing shape occurs for some x. h_x and λ_x can be approximated from above but not computed; β_x cannot be approximated at all. Finite-set models, extended to computable distributions at O(log n) cost. | Active — read 2026-10-14 (NOTE-787) in full; worth reading as the theorem that, for a single string and every bound on model complexity, the set with the shortest two-part code is within O(log n) of the best-fitting set in randomness deficiency (Theorem IV.8), with the complete catalogue of shapes the structure functions can take and the proof that fit cannot be approximated while code length can. Read it knowing that every result holds only to O(log n), that the models are complexity-bounded finite sets or computable distributions and not statistical families, which the authors say the results do not transfer to directly, and that the construction proving Theorem D.2 was not checked line by line here. |
| LIT-241 v2 | Gelfand–Naimark–Segal construction (Wikipedia) | Wikipedia contributors (2026), https://en.wikipedia.org/wiki/Gelfand%E2%80%93Naimark%E2%80%93Segal_construction. Any state (positive normalized linear functional) on a C*-algebra determines, essentially uniquely, a Hilbert space and a cyclic *-representation in which that state becomes a vector expectation ρ(a)=⟨π(a)ξ,ξ⟩, and the representation is irreducible exactly when the state is pure. | Active — read 2026-10-14 (NOTE-857) in full; worth reading as a short reference statement of the GNS construction: a state on a C*-algebra gives a cyclic representation, unique up to the unitary π(a)ξ ↦ π′(a)ξ′, irreducible exactly when the state is pure. Read it knowing that it is Wikipedia, that the uniqueness is stated with a reference to Kadison rather than proved, and that it is about states on complex C*-algebras, not kernels on sets: the kernel form the record uses comes from LIT-259. |
| LIT-242 v3 | On the Stepwise Nature of Self-Supervised Learning | Simon et al. (2023), ARXIV-2303.15438. For a simplified Barlow Twins loss on a linear or fixed-kernel model, gradient flow from small initialization learns the top eigenvectors of a symmetrized cross-correlation operator one at a time and reaches the minimum-norm zero-loss solution, kernel PCA on K_Γ. Exact from aligned initialization; informal for generic small initialization. ResNets trained with Barlow Twins, SimCLR and VICReg show the same stepwise rank growth, as an experimental finding. | Active — read 2026-10-14 (NOTE-741) in full; worth reading for the dynamics that the optimum-based spectral accounts lack. For a simplified Barlow Twins loss (λ = 1, no batch norm, symmetrized cross-correlation) on a linear or fixed-kernel model, gradient flow from small initialization learns the top eigenvectors of Γ, or of K_Γ, one at a time and reaches the minimum-norm zero-loss solution: kernel PCA. Read it knowing three things. The step for generic initialization (Result 4.6) is an informal derivation. Its operator is built from the model’s kernel and the sample pairs, not from K⁺. And its evidence for SimCLR, VICReg and ResNets is experimental: the initial NTK predicts them poorly, and the final empirical NTK captures about half the embedding subspace. |
| LIT-243 v2 | Hilbert Spaces and the Riesz Representation Theorem | Adler (2021), https://math.uchicago.edu/~may/REU2021/REUPapers/Adler.pdf. Every continuous linear functional φ on a Hilbert space is v ↦ ⟨u, v⟩ for a unique u with ‖u‖ = ‖φ‖, and in any orthonormal basis u = Σ_k conj φ(e_k) e_k with ‖φ‖² = Σ_k |φ(e_k)|². Applied to f ↦ ∫ f dν on L²(ν + μ), it yields the Radon–Nikodym theorem for finite measures. | Active — read 2026-10-14 (NOTE-854) in full; worth reading as a gentle, complete proof of the Riesz theorem from first principles, done twice (by projection, then by an orthonormal basis), and of the Radon–Nikodym theorem from it. Read it knowing that it is student expository work with typographical slips, that its inner product is conjugate-linear in the first slot, that the representer is Σ conj φ(e_k) e_k, and that Radon–Nikodym is proved for finite measures only. |
| LIT-244 v2 | Natural Kinds (Stanford Encyclopedia of Philosophy) | Bird & Tobin (2008; rev. 2022), SEP. Whether scientific kinds are natural breaks into four questions (are the classifications natural, are they into kinds, what the kinds are, and do they have essences). Shared properties, inductive support and a role in laws are each necessary but not sufficient for kindhood. The entry maps positions from conventionalism to essentialist strong realism, reports pluralist, cluster, epistemology-first and eliminativist turns, and doubts that Kripke–Putnam semantics delivers more than partial essences. | Active — read 2026-10-14 (NOTE-769) in full; worth reading as the map of the natural-kinds debate: four metaphysical questions, six candidate criteria of which shared properties, inductive support and a role in laws are each necessary but not sufficient, cluster, pluralist and epistemology-first accounts, Hacking’s interactive kinds, and the Kripke–Putnam semantics with the doubts about getting essences from it. Read it knowing that it is a survey that argues for little, that the 2022 revision was read rather than the Spring 2024 archive the owner cites, and that it never mentions information or compression, so the link to sufficient statistics under which it was filed is the owner’s. |
| LIT-245 v4 | Minimum Description Length and Generalization Guarantees for Representation Learning | Sefidgaran et al. (2023), ARXIV-2402.03254. The expected generalization error of an encoder–decoder classifier is bounded by 2√((2·MDL + K + 2)/n) + ε for any decoder. Here MDL is the KL divergence between the encoder’s joint law of train-and-ghost latents and a prior symmetric under label-preserving permutations, not I(X;U). The quantity reflects the encoder’s structure and is finite for deterministic encoders under lossy compression. It reduces to sample-wise mutual information for a product prior, and the predicted-label version contains the f-CMI and VC bounds. | Active — read 2026-10-14 (NOTE-742) in full; worth reading as the theorem that bounds the generalisation error of an encoder–decoder learner by the encoder alone: 2√((2·MDL + K + 2)/n) + ε, where MDL is the KL divergence of the joint train-and-ghost latents to a prior symmetric under label-preserving permutations (Theorem 4). The bound holds for any decoder and stays finite for deterministic continuous encoders under lossy compression. With a product prior it reduces to sample-wise mutual information, which is why it can be tighter than IB-style bounds. Read it knowing that the bound is never evaluated numerically, that the prior may depend on the unseen ghost data and is only approximated in practice, that a K + 2 term sets a floor, that the proofs other than Theorem 4’s were not checked here, and that the experiment is one CIFAR-10 CNN at 62–65% accuracy. |
| LIT-246 v3 | On Variational Bounds of Mutual Information | Poole et al. (2019), ARXIV-1905.06922. Every variational lower bound on mutual information in use — Barber–Agakov, Donsker–Varadhan/MINE, NWJ/f-GAN-KL, InfoNCE — is one family, tight at a critic that is a function of the log density ratio log p(y|x)/p(y), and InfoNCE is the multi-sample member that trades variance for a hard ceiling of log K. | Active — read 2026-10-14 (NOTE-739) in full; worth reading as the single derivation that puts Barber–Agakov, Donsker–Varadhan, NWJ, MINE and InfoNCE in one family, and as the exact proof that InfoNCE is a lower bound on mutual information for every critic when the K batch pairs are i.i.d. from the joint, capped at log K. Read it knowing that Eq. 10 is printed with its indices transposed relative to its own derivation (the bound holds either way; the optimal critic log p(y|x) + c(y) belongs to the derived form), that the InfoNCE optimal critic is stated on Ma & Collins’s authority rather than proved, that the optimal critic of the interpolated bound I_α is a conjecture, and that every experiment is on 20-dimensional Gaussian toys or dSprites. |
| LIT-247 v3 | On Mutual Information Maximization for Representation Learning | Tschannen et al. (2019), ARXIV-1907.13625. The success of InfoNCE-style representation learning cannot be attributed to mutual information itself: MI is invariant under invertible reparametrizations, invertible encoders that maximize true MI can be worse than raw pixels, and tighter MI bounds from higher-capacity critics can give worse representations. | Active — read 2026-10-14 (NOTE-749) in full; worth reading as the controlled case that the downstream quality of InfoNCE- and NWJ-trained encoders does not track mutual information: invertible encoders improve while true MI is constant, a higher NWJ bound from a bigger critic gives worse features, and at matched bound values the encoder architecture decides. Also the proof that InfoNCE is neither a lower nor an upper bound when batch pairs are dependent, and the identity between InfoNCE with an inner-product critic and the multi-class K-pair loss. Read it knowing that the experiments are MNIST image halves (CIFAR10 for two of them) under a linear probe, that the tighter-bound result is shown for NWJ only (InfoNCE saturates near log K for every critic), and that the metric-learning account is argued, not tested. |
| LIT-248 v2 | Self-Supervised Learning with Kernel Dependence Maximization | Li et al. (2021), ARXIV-2106.08320. With image identity as a one-hot label, HSIC(Z,Y) = (Δl/N)(E_pos k − E k), and the mean squared MMD between the per-image view distributions is 2(N/Δl)·HSIC(Z,Y) (Thm A.1, App. B.2). The large-batch InfoNCE loss is exactly −HSIC(Z,Y) plus a log-mean-exp of the centred critic (eq. 28), and for a bounded kernel it bounds −HSIC(Z,Y) + γHSIC(Z,Z) up to a second-order remainder (Thm B.1). SSL-HSIC, −HSIC(Z,Y) + γ√HSIC(Z,Z), is proposed as a loss. | Active — read 2026-10-14 (NOTE-830) in full; worth reading as the place where an SSL objective becomes a statement about kernel mean embeddings: with image identity as a one-hot label, HSIC(Z,Y) is the gap between the mean kernel on positive pairs and on all pairs, (1/2N²)Σ MMD²(i,j) = (N/Δl)·HSIC(Z,Y), and the large-batch InfoNCE loss is exactly −HSIC(Z,Y) plus a log-mean-exp of the centred critic. Read it knowing that Theorem B.1 prints its remainder with the wrong sign, that the InfoNCE it analyses is the large-batch form and not the K-negative estimator, that “InfoNCE works because it estimates kernel dependence” is an interpretation no experiment isolates, and that the experiments are single runs. |
| LIT-249 v4 | Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Loss | HaoChen et al. (2021), ARXIV-2106.04156. Minimizing the population spectral contrastive loss L(f) = −2E[f(x)ᵀf(x⁺)] + E[(f(x)ᵀf(x⁻))²] is, up to a constant, a rank-k factorization of the normalized adjacency matrix of the augmentation graph, so its minimizers are the top-k eigenvectors (eigenfunctions, in the infinite case) of that graph up to a row scaling and an invertible linear map — neither of which changes linear-probe accuracy. | Active — read 2026-10-14 (NOTE-740) in full; worth reading as the founding statement that a contrastive loss is a low-rank factorization of the normalized augmentation graph. Lemma 3.2 makes the spectral contrastive loss equal to ‖D^(−1/2)AD^(−1/2) − FFᵀ‖²_F up to a constant, so its population minimizers are the top-k eigenvectors up to a row scaling and a right factor, which Lemma 3.1 shows a linear probe cannot see. Theorem 3.8 then bounds linear-probe error by Õ(α/ρ²_⌊k/2⌋). Read it knowing that everything is proved on a finite augmentation space at the population optimum of the spectral loss alone. The infinite case (App. F) assumes a uniform bound on the density ratio, not only Hilbert–Schmidt, and asserts rather than proves the extension of the main theorems. The symmetry of the pair distribution is used throughout and never stated. |
| LIT-250 v3 | Duality of Bures and Shape Distances with Implications for Comparing Neural Representations | Harvey et al. (2023), ARXIV-2311.11436. The Procrustes shape distance between two representations (optimal rotational alignment of units) equals the Bures distance between their centred linear kernel matrices, so the rotation-invariant geometry of a representation is exactly the geometry of its kernel, and through Uhlmann’s theorem the fidelity of two kernels is the maximum overlap over all representations consistent with them. | Active — read 2026-10-14 (NOTE-753) in full; worth reading as the clean finite-dimensional statement that, for centred linear kernels, the Procrustes distance equals the Bures distance and normalized Bures similarity is the cosine of the Riemannian shape distance, so the kernel is a complete invariant of a representation up to translation and orthogonal maps, and as the proof that CKA and NBS are related only within a rank-dependent envelope. Read it knowing that it covers linear kernels only, assumes the orthogonal group rather than arguing for it, and treats the infinite limits by a law-of-large-numbers sketch and a citation; it does not reach an RKHS or GNS statement. |
| LIT-251 v2 | Contrastive learning, multi-view redundancy, and linear models | Tosh, Krishnamurthy & Hsu (2021), ARXIV-2008.10150. The logistic contrastive problem of telling a same-datum pair of views from an independent pair is solved over all functions by the pointwise mutual information, whose exponential g*(x,z) = p(x,z)/(p(x)p(z)) is the change of measure from p(z) to p(z|x). When the two views are redundant for a label, the infer-then-predict function E[E[Y|Z]|X=x] = ∫ E[Y|Z=z] g*(x,z) p(z) dz is within εX + 2√(εXεZ) + εZ of the Bayes predictor, so linear functions of the landmark embedding (g*(x,Z_1), …, g*(x,Z_m)) are near-optimal, with error O(1/m). | Active — read 2026-10-14 (NOTE-841) in full; worth reading as the redundancy account of contrastive learning: when two views are redundant for a label, the infer-then-predict function µ(x) = E[E[Y|Z]|X=x] is within εX + 2√(εXεZ) + εZ of the Bayes predictor (Lemma 1), and µ is linear in the density ratio g*(x,·) = p(x,z)/(p(x)p(z)), “the change-of-measure from the marginal distribution of Z to the conditional distribution of Z given X = x”. Random landmark evaluations of g* then give near-Bayes linear predictors at rate 1/m. Read it knowing that it is population-level, that the logistic problem has a single negative, that its error propagation assumes a uniform bound on the ratio, and that its low-dimensional direct embeddings are shown to exist, not to be reached. It never assumes the views are exchangeable. |
| LIT-252 v2 | Spectral Inference Networks: Unifying Deep and Spectral Learning | Pfau et al. (2018), ARXIV-1806.02215. For a symmetric kernel k on a space with sampling density p, the span of the top-N eigenfunctions of Kf = E_x′[k(x,x′)f(x′)] on L²(p) maximizes the generalized Rayleigh quotient Tr(Σ⁻¹Π), with Σ = E[u uᵀ] and Π = E[k(x,x′)u(x)u(x′)ᵀ]; a Cholesky-masked gradient orders the eigenfunctions, argued informally, and moving averages of Σ and its Jacobian correct the minibatch bias. Slow Feature Analysis is the graph-Laplacian case on adjacent frames, where the slowest features are the bottom of the Laplacian’s spectrum. | Active — read 2026-10-14 (NOTE-824) in full; worth reading as the generic neural solver for eigenfunctions of a symmetric kernel operator on L²(p): the top-N span maximizes Tr(Σ⁻¹Π), a Cholesky-masked gradient orders the eigenfunctions, and moving averages of Σ and its Jacobian remove the minibatch bias. Slow Feature Analysis is the graph-Laplacian case. Read it knowing that symmetry of k is a precondition placed on the kernel, not derived from a pair distribution, that the ordering argument is informal by the authors’ own statement, that only the hydrogen-atom experiment has ground truth, and that it never mentions positive pairs, contrastive learning or the density ratio. |
| LIT-253 v2 | When Does Closeness in Distribution Imply Representational Similarity? An Identifiability Perspective | Nielsen et al. (2025), ARXIV-2506.03784. For softmax models p(y|x) ∝ exp(f(x)ᵀg(y)) under a diversity condition, the model distribution determines the embeddings and unembeddings up to an invertible linear map (f = Af′, g₀ = A⁻ᵀg′₀). The determination is not stable under KL divergence, though: two models can be ε-close in KL, even both near maximum likelihood, while their embeddings are far from linearly equivalent. Under a log-likelihood variance distance it is stable: d_LLV ≤ ε implies a representational dissimilarity of at most 2Mε. | Active — read 2026-10-14 (NOTE-738) in full; worth reading as the exact statement that softmax models are identified only up to the paired map f = Af′, g₀ = A⁻ᵀg′₀, and as the proof that this identification is not stable under KL divergence but is stable under a log-likelihood variance distance (d_LLV ≤ ε ⇒ d_f,g ≤ 2Mε). Read it knowing that the KL counterexample needs the unembedding norm to grow without bound, that how far apart its embeddings are is shown numerically rather than proved, that everything concerns the final embedding and unembedding only, and that the experiments use 2- to 5-dimensional representations. |
| LIT-254 v4 | Similarity of Neural Network Representations Revisited | Kornblith et al. (2019), ARXIV-1905.00414. Any similarity index invariant to invertible linear maps gives the same value for all representations of rank n, the number of examples (Theorem 1). The paper argues, without a theorem, for invariance to orthogonal maps and isotropic scaling only, and proposes centered kernel alignment, normalized HSIC of centred Gram matrices, which has exactly those invariances. R²_CCA and linear regression are CKA of re-weighted Gram matrices. Linear CKA alone matches corresponding layers across CNN initializations (99.3%, against at most 45.4% for the other linear indexes). | Active — read 2026-10-14 (NOTE-743) in full; worth reading as the source of CKA for comparing representations and of the argument that a similarity index should be invariant to orthogonal maps and isotropic scaling but not to all invertible linear maps. That argument rests on Theorem 1: any index with that wider invariance is constant once rank reaches the number of examples. It also shows R²_CCA, linear regression and linear CKA to be one family, differing in eigenvalue weighting, with canonical ridge interpolating between them. Read it knowing that the case for the orthogonal group is argued from training dynamics, not proved, that it does not state the converse that equal Gram matrices imply an orthogonal relation, and that RBF CKA is scale-invariant only because its bandwidth is set from the median distance. |
| LIT-255 v2 | Information Theory with Kernel Methods | Bach (2022), ARXIV-2202.08545. With a kernel normalised to k(x,x) = 1, the uncentred covariance operator Σ_p = E_p[ϕ(x)ϕ(x)*] is a density operator, injective in p when k² is universal. Its relative entropy satisfies D(p̃‖q̃) ≤ D(Σ_p‖Σ_q) ≤ D(p‖q), with p̃ a kernel-smoothed p, and is within O(σ²) of KL on the torus. The empirical entropy is that of the normalised Gram matrix K/n. Kernel mutual information characterizes independence, and the dual gives upper bounds on log-partition functions. | Active — read 2026-10-14 (NOTE-837) in full; worth reading as the rigorous construction of the “density matrix” reading of kernel embeddings: with k(x,x) = 1 the uncentred covariance operator is a quantum state, its relative entropy lies between the KL of kernel-smoothed distributions and the KL itself, the empirical version is the matrix entropy of K/n, and kernel mutual information characterizes independence. Read it knowing that the kernel quantities only lower-bound Shannon ones and approach them at O(σ²) only on the torus, that conditional independence is characterized one way only, that Σ_p is uncentred, and that the paper never mentions fidelity, Bures distance, representation similarity or GNS. |
| LIT-256 v2 | Mutual Information Neural Estimation | Belghazi et al. (2018), ARXIV-1801.04062. Mutual information is stated measure-theoretically as the expectation under the joint of log dP_XZ/d(P_X⊗P_Z), and its Donsker–Varadhan dual is tight exactly at T* = log dP/dQ + C, so a neural critic trained on the dual is a log Radon–Nikodym-derivative estimator. | Active — read 2026-10-14 (NOTE-828) in full; worth reading as the paper that states mutual information as the expected log Radon–Nikodym derivative and proves the Donsker–Varadhan bound tight at that log derivative plus a constant. Read it knowing that its consistency theorem is for the exact empirical supremum over a compact network family, that two steps of its proof have gaps, that its gradient-bias fix is a heuristic, and that the finite-sample estimate is not a bound (LIT-246). |
| LIT-257 v2 | What Representational Similarity Measures Imply about Decodable Information | Harvey et al. (2024), ARXIV-2411.08197. For linear readouts regularised by w ↦ wᵀG(X)w, the optimal decoded signal is K_X z with K_X = X G(X)⁻¹ Xᵀ / M, and the expected alignment of two networks’ readouts is Tr(K_X K_z K_Y). With K_z = I that gives linear CKA and mean squared CCA as normalized averages, ENSD as the average, and the GULP distance as the average squared readout distance. The Procrustes distance of normalized representations and the average decoding distance bound each other with constants set by the participation ratio of K_X − K_Y. All at finite M. | Active — read 2026-10-14 (NOTE-834) in full; worth reading as the decoding reading of representational similarity: an optimal regularized linear readout outputs K_X z, so linear CKA, mean squared CCA, ENSD and the GULP distance are task-averaged readout statistics, and Procrustes distance and decoding distance bound each other through a participation ratio. Read it knowing that every identification fixes the target covariance to the identity at finite M, and that its population appendix is an outline that does not reach that case. |
| LIT-258 v2 | Contrastive Learning Can Find An Optimal Basis For Approximately View-Invariant Functions | Johnson et al. (2022), ARXIV-2210.01883. On a finite augmentation space, the NT-Logistic and spectral contrastive losses are minimized over unconstrained kernels by the positive-pair kernel K⁺(a₁,a₂) = p⁺(a₁,a₂)/(p(a₁)p(a₂)), and InfoNCE by K⁺ up to a constant on each communicating class. Kernel PCA under K⁺ returns exactly the eigenfunctions of the positive-pair Markov chain, and the top-d of those span the linear-predictor subspace that minimizes worst-case approximation error over approximately view-invariant targets. | Active — read 2026-10-14 (NOTE-751) in full; worth reading as the cleanest statement linking contrastive losses, one Mercer kernel and a minimax-optimal eigenbasis. The NT-Logistic and spectral losses are minimized over unconstrained kernels by K⁺ = p⁺/(p⊗p), and InfoNCE by K⁺ up to a constant per communicating class (over symmetric functions, with the minimizer form taken from Van den Oord et al.). Kernel PCA under K⁺ returns λ_i^(1/2) times the positive-pair chain’s eigenfunctions (Thm 3.2). The top-d span minimizes worst-case L²(p) error over approximately view-invariant targets, at ε/(2(1 − λ_(d+1))), provided d is at least the number of communicating classes (Thm 4.1). Read it knowing that everything is proved on finite spaces at the unconstrained population optimum. The supporting experiments are synthetic, and the authors report that they could not extract the eigenfunctions from real-data models. |
| LIT-259 v2 | Noncommutative analysis, Multivariable spectral theory for operators in Hilbert space, Probability, and Unitary Representations | Jorgensen & Tian (2014), ARXIV-1408.1164. The textbook calls building a Hilbert space from a positive definite function “the GNS construction” (Remark 1.34) and states (Cor. 1.35), leaving the proof as an exercise, that the feature map realising a kernel as inner products is unique up to a unitary among minimal realisations. It proves the parallel uniqueness for states and cyclic representations (Thm 4.35), says that in the abelian case states are probability measures, so that “the GNS construction is non-commutative measure theory” (Ex. 4.28), and writes the commutative GNS space out as L²(μ) (Ex. 4.86). | Active — read 2026-10-14 (NOTE-829) in part; worth reading for the passages that put the kernel construction and the GNS construction under one name: Remark 1.34 builds a Hilbert space from a positive definite function by the GNS recipe, Corollary 1.35 states that minimal realizations ϕ(x,y) = ⟨Φ(x), Φ(y)⟩ are unique up to a unitary, Theorem 4.35 proves the GNS theorem with its uniqueness, and Example 4.86 writes the commutative GNS space out as L²(μ). Read it knowing that Corollary 1.35 is not proved (the proof is “left as an exercise”; the argument of Theorem 4.35 transfers), that equation (1.24) carries a typo, that “GNS” for a kernel on a set is a naming and not a stated reduction, and that only the cited passages of this 442-page text were read. |
| LIT-260 v2 | Kernel Mean Embedding of Distributions: A Review and Beyond | Muandet et al. (2016), ARXIV-1605.09522. Point evaluation is bounded on an RKHS, so the Riesz theorem gives the reproducing kernel k_x. Likewise, when E√k(X,X) < ∞ the expectation functional f ↦ E_P f is bounded, so Riesz gives a unique mean embedding μ_P with E_P f = ⟨f, μ_P⟩. MMD is then the RKHS distance ‖μ_P − μ_Q‖, and it separates distributions exactly when the kernel is characteristic. | Active — read 2026-10-14 (NOTE-838) in full; worth reading as the one held text that runs the chain bounded evaluation → Riesz → k_x → Moore–Aronszajn → μ_P → MMD/HSIC in numbered statements, with Lemma 3.1 (μ_P exists and represents expectation when E_P√k(X,X) < ∞) proved in the text, and as a map of conditional mean embeddings and their limits. Read it knowing that it is a survey whose proofs are mostly sketched or cited, that every result assumes a fixed kernel, that it defines μ_P as a Bochner integral as well as by Riesz, so Riesz is one route to existence and not shown to be the only one, and that the unregularized conditional embedding C_YX C_XX⁻¹ often fails to exist. |
| LIT-261 v2 | A Generalized Representer Theorem | Schölkopf et al. (2001), DOI-10.1007/3-540-44581-1_27. For any nonempty set X, real positive-definite kernel k, strictly increasing g and any cost c on the training triples, even coupled, non-convex or infinite-valued, every minimizer of c + g(‖f‖) over the countable kernel expansions of finite RKHS norm is a finite expansion Σ α_i k(·,x_i) at the training points. The proof needs only the reproducing property and orthogonal decomposition onto span{k(·,x_i)}, not the Riesz theorem. Existence of a minimizer is assumed. | Active — read 2026-10-14 (NOTE-836) in full; worth reading as the short proof that any minimizer of an arbitrary cost on the training outputs plus a strictly increasing function of the RKHS norm is a kernel expansion on the training points, by the reproducing property and orthogonal decomposition, with no convexity and no Riesz theorem. Read it knowing that the theorem is stated over countable kernel expansions of finite norm rather than the completed RKHS, that it assumes a minimizer exists, and that its semiparametric Theorem 2 is stated without proof. |
| LIT-262 v2 | The Geometry of Information Retrieval | van Rijsbergen (2004), DOI-10.1017/CBO9780511543333. The book recasts IR’s vector-space, probabilistic and logical models in one Hilbert-space language. Documents are state vectors. Relevance and aboutness are Hermitian observables that need not commute. Subspaces carry a non-distributive logic whose conditional is shown to be a Stalnaker conditional equal to the Sasaki hook (ch. 5). Gleason’s theorem makes tr(ρP) the probability of a subspace, which ch. 6 uses to rewrite cosine matching, cluster representatives, relevance and pseudo-relevance feedback, dynamic clustering and ostensive retrieval. It is a proposed language, not a tested model: no experiment is reported, and its “content hypothesis” that the probability of a concept is cos²θ is argued, not tested. | Active — read in full 2026-09-27 (NOTE-239); worth reading as the founding statement of the Hilbert-space (quantum-probability) programme in IR. It is short, self-contained and mathematically careful at the level it works at, and its ch. 5 proof that the subspace conditional is a Stalnaker conditional and its ch. 6 trace-formula recastings of standard IR operations are the parts to take away. Read it as a language, not as evidence: it reports no experiment, and every IR payoff it names is a reformulation or a research direction. |
| LIT-263 v2 | Kochen-Specker contextuality | Budroni et al. (2021), ARXIV-2102.13036. A review that fixes a minimal definition of Kochen–Specker contextuality: no global joint distribution has the context distributions as marginals (Fine’s theorem). The sheaf-theoretic framework is one of several formulations it calls substantially equivalent. It argues that contexts defined by joint measurability alone make every nondisturbing correlation classically realizable, so contexts must be repeatable, nondisturbing measurements. It treats Spekkens’s generalized contextuality as a different notion, covered only to mark the difference. | Active — read 2026-10-14 (NOTE-844) in full; worth reading as the record’s reference for Kochen–Specker contextuality: the marginal-problem definition (Fine’s theorem) with the sheaf form among its equivalents, why contexts need more than joint measurability, how experiments model disturbance, and Vorob’ev’s acyclicity theorem. Read it knowing that it is a review whose results are mostly cited, that it describes Spekkens’s notion only to set it apart and never derives the relation between the two, and that its account of maximally noncontextual models is one noise model among several, with no behavioural data. |
| LIT-264 v2 | Is there contextuality in behavioral and social systems? | Dzhafarov, Zhang & Kujala (2016; arXiv 2015), ARXIV-1504.07422. Under Contextuality-by-Default a binary cyclic system is noncontextual iff ΔC ≤ 0, a criterion that separates context-dependent marginals from contextuality and reduces to Leggett–Garg, CHSH and KCBS when marginals agree. Every behavioural and social data set re-analysed meets it: 73 question-order pairs, Schröder staircases, conjoint choices, 23 primed word combinations and millions of dichotomisations of psychophysical matching. The QQ equality of the quantum question-order model implies it. | Active — read 2026-10-09 (NOTE-235); worth reading as the paper that separates context-dependent response distributions (“inconsistent connectedness”) from contextuality proper in behavioural data, and finds no contextuality in any data set it re-analyses: 73 question-order pairs, Schröder staircases, conjoint animal–sound choices, 23 primed word combinations and psychophysical matching. Its sharpest result is that the quantum question model’s QQ equality implies noncontextuality, so the best-supported quantum-cognition model of order effects predicts its absence. Read with the caveats that the criterion it applies is proved elsewhere, that the absence of contextuality is offered as a working hypothesis, and that its worked Rose–Jackson example contains a labelling slip (the conclusion survives). |
| LIT-265 v2 | The contextual fraction as a measure of contextuality | Abramsky, Barbosa & Mansfield (2017), Phys. Rev. Lett. 119, 050504. For any no-signalling empirical model in the sheaf-theoretic framework, the contextual fraction CF (one minus the largest weight of a noncontextual sub-model) is a linear programme. Its dual gives a generalised Bell inequality whose normalised violation equals CF, the largest attainable (Theorem 1). CF does not increase under relabelling, translation of measurements, coarse-graining or mixing, and is multiplicative in NCF under products (Theorem 2). It lower-bounds the failure probability of Z2-linear MBQC computing a non-linear function (Theorem 3). | Active — read 2026-10-09 (NOTE-236); worth reading as the reference definition of the contextual fraction CF. CF is the weight left over when the largest noncontextual sub-model is taken out of a no-signalling empirical model. It is a linear programme over the incidence matrix (Eq. 3). Its dual reads off a Bell inequality whose normalised violation is exactly CF, the maximum over all Bell inequalities (Theorem 1). CF is invariant under relabelling, cannot increase under translation of measurements, coarse-graining of outcomes or mixing, and composes as max under choice and as 1 − NCF·NCF′ under product (Theorem 2). It lower-bounds the failure probability of Z2-linear MBQC and of k-consistent games (Theorems 3–4). All proofs are complete in the supplement. It is defined only for models with compatible marginals. |
| LIT-266 v2 | Contextuality for preparations, transformations, and unsharp measurements | Spekkens (2004), arXiv:quant-ph/0406166. Defines a noncontextual ontological model as one in which operationally equivalent procedures (preparations, measurements, transformations) get identical representations; shows the traditional Kochen–Specker notion is the special case of measurement noncontextuality for sharp measurements plus outcome determinism, proves that preparation noncontextuality implies that outcome determinism, and proves preparation contextuality already for a qubit. | Active — read 2026-10-14 (NOTE-748) in full; worth reading as the source of generalized noncontextuality and as the bridge between it and the Kochen–Specker notion. It proves preparation, transformation and unsharp-measurement contextuality for a qubit, shows the traditional notion is measurement noncontextuality plus outcome determinism for sharp measurements, and proves that preparation noncontextuality implies that determinism. Read it knowing that every result assumes exact operational equivalence and gives no inequality; that the bridge (§VIII.A) uses the full set of quantum preparations; and that “any classical theory is necessarily noncontextual” is a footnote assertion. It argues from ontological economy and does not mention Leibniz. |
| LIT-268 v2 | ZipNN: Lossless Compression for AI Models | Hershcovitch et al. (2024), ARXIV-2411.05239. Lossless compression of trained-model files works almost entirely through the float exponent. It is concentrated on about 40 of 256 values, the top 12 hold ~99.9% of parameters, and it compresses to ~33% under order-0 Huffman coding, while sign and mantissa stay ≈100%. So “regular” BF16 models compress to ~66.4% and FP32 models to ~83%. Rounded “clean” models reach 33.7–48.1%, and ZipNN (exponent extraction plus Huffman only) beats vanilla Zstd by 17% in size and 62% in single-thread speed on Llama-3.1-8B BF16. The paper never computes an entropy and never compares its codes to one. | Active — read in full 2026-09-27 (NOTE-241); worth reading as a careful empirical systems paper on where the byte-level redundancy in stored weights sits. It has almost no information-theoretic content beyond that measurement, and its explanation of the exponent skew is speculative. |
| LIT-269 v2 | Attention Approximates Sparse Distributed Memory | Bricken & Pehlevan (2021), ARXIV-2111.05498. Kanerva’s SDM read weights each stored pointer by the number of neurons in the intersection of two Hamming balls of radius d. The paper shows that this weight is roughly log-linear in Hamming distance for close patterns. As a result, with L²-normalised vectors and a regression-fitted β, softmax attention reproduces SDM’s retrieval behaviour on random and learnt-projection data (App. B.7). Two things are weaker than they look. The analytic derivation (App. B.2, Eqs. 16–21) gets the exponent wrong: by my recomputation its β is ≈2–2.5× too small. The biological case is Kanerva’s 1988 cerebellar mapping, restated rather than re-argued. It also needs r = 2⁶⁴ ≈ 1.8×10¹⁹ neurons in the Attention setting, which the paper itself calls “biologically implausible” (App. B.5). | Active — read in full 2026-09-27 (NOTE-242); worth reading as the clearest statement of the SDM–attention correspondence. Its exact circle-intersection formula and its eight-algorithm convergence comparison are the parts to take away. Treat its analytic exponential derivation, its GPT-2 “confirmation” and its cerebellar implementation of attention as argument, not demonstration. |
| LIT-272 v2 | Reasoning about Meaning in Natural Language with Compact Closed Categories and Frobenius Algebras | Kartsaklis et al. (2014), ARXIV-1401.5980. The paper sets the sentence space equal to the noun space (F(s)=F(n)=W). It then uses the basis-copying map σ: v_i ↦ v_i⊗v_i of the Frobenius algebra fixed by W’s basis to lift corpus-built verb matrices Σ_i sbj_i⊗obj_i into rank-3 tensors. So a transitive sentence becomes sbj⊙(verb·obj) (“copy-subject”) or obj⊙(verbᵀ·sbj) (“copy-object”), a vector in W. On the Grefenstette–Sadrzadeh verb-disambiguation set, copy-object gets Spearman ρ=0.172, against 0.168 (Kron), 0.163 (Multp), 0.143 (copy-subject), 0.050 (additive) and an inter-annotator bound of 0.620. On a 112-term definition-matching task the best F1 is 0.21 (nouns) and 0.27 (verbs). No significance test is reported. The disambiguation numbers are identical to the authors’ COLING 2012 paper, and the definition numbers are the same data re-reported. | Active — read in full 2026-09-27 (NOTE-246); worth reading for the construction, not for its evidence. It is the citable categorical statement of the Frobenius lift of DisCoCat verbs: the functorial recasting, S=N=W, and the copy-subject and copy-object maps. Its experiments are the authors’ COLING 2012 numbers, re-reported without that paper’s caveat that copy-object’s lead is statistically insignificant. The best disambiguation ρ is 0.172, against a human bound of 0.620. The construction depends on a choice of basis, which the paper cites but never draws the consequence of. |
| LIT-273 v2 | Mathematical Foundations for a Compositional Distributional Model of Meaning | Coecke et al. (2010), ARXIV-1003.4394. The paper builds DisCoCat as a product category FVect × P of vector spaces and a free pregroup. A sentence’s meaning is f(w₁⊗…⊗wₙ), where f is the linear map got by putting vector spaces in place of the pregroup types in the reduction p₁…pₙ ≤ s. The ε maps become inner products and the η maps become Σᵢ eᵢ⊗eᵢ. So “John likes Mary” is Σ_ijk c_ijk⟨v|vᵢ⟩⟨w_k|w⟩ sⱼ ∈ S, and “not” is the 2×2 swap matrix placed on the sentence wire. There is no theorem and no experiment. The sentence space S is shown only as 1- or 2-dimensional truth values, over a toy model with one basis vector per individual, and the paper says how neither S nor the verb tensors are to be built from data. Its headline similarity numbers (3/4, 1/4, 3/8) are unnormalised inner products. Under its own Definition 5.1 they are 0.949, 0.316 and 0.6. | Active — read in full 2026-09-27 (NOTE-245); worth reading as the founding statement of DisCoCat, whose ε/η composition, S-for-every-sentence design and “not”-as-swap every later paper in the programme starts from. Read it as a specification, not a result. It proves nothing, runs no experiment, leaves S and the verb tensors unbuilt, and its categorical framing (a product with a posetal pregroup) cannot tell apart the parse ambiguities it says it can reason about. |
| LIT-274 v2 | A new description of orthogonal bases | Coecke et al. (2008), ARXIV-0810.0812. Theorem 5.1 proves that on a finite-dimensional complex Hilbert space, commutative †-Frobenius monoids in FdHilb and orthogonal bases are in bijection: the basis is the monoid’s copyable elements, and the monoid is the linear extension of copying and uniformly deleting that basis. §6 adds that the monoid is special (m∘δ = id) exactly when the basis is orthonormal. Corollaries 7.1 and 7.2 lift this to categories: with fully structure-preserving maps the category is equivalent to the groupoid of finite sets labelled by positive reals (the basis norms), and with comonoid homomorphisms it is equivalent to FinSet. | Active — read in full 2026-09-27 (NOTE-247); worth reading as the short, self-contained source of the fact that “a commutative †-Frobenius algebra” and “an orthogonal basis” are the same data in FdHilb, and “special” the same as “orthonormal”. The proof is complete in outline, and the heavy step is delegated to the spectral theorem for finite-dimensional commutative C*-algebras. Read §3’s displayed formulas (3) and (4) as the orthonormal case only, and the result as complex and finite-dimensional only. |
| LIT-275 v2 | H*-algebras and nonunital Frobenius algebras: first steps in infinite-dimensional categorical quantum mechanics | Abramsky & Heunen (2010), ARXIV-1011.6123. In the category Hilb of complex Hilbert spaces of arbitrary dimension, a Frobenius algebra with a unit exists only in finite dimension (Lemma 3). So the paper drops the unit, and Theorem 22 proves that a nonunital commutative special †-Frobenius algebra corresponds to an orthonormal basis (the basis being the algebra’s copyable vectors) if and only if it is semisimple, if and only if it satisfies Ambrose’s H*-axiom (H), and if and only if it is a directed colimit of finite-dimensional unital ones. Whether (H) is automatic, i.e. whether a nonzero “radical” Frobenius algebra exists (Proposition 23), is left open. In categories of relations and of nonnegative ℓ²-matrices, Frobenius algebras decompose as disjoint unions of abelian groups and do satisfy (H) (Theorems 30–38). | Active — read in full 2026-09-27 (NOTE-248); worth reading as the precise statement of how far “a basis is a Frobenius algebra” survives in infinite dimensions. It gives the unit’s failure, the H*-algebra substitute and five equivalent conditions, all proved or reduced to Ambrose (1945), with one question left open. Read “arbitrary bases” in the abstract as “orthonormal bases of arbitrary dimension over ℂ”, and “observables” as discrete-spectrum observables only. |
| LIT-277 v2 | The Cohomology of Non-Locality and Contextuality | Abramsky et al. (2011), ARXIV-1111.3620. For an empirical model e on a measurement cover 𝒰, a section s in the support of context C₁ gets a class γ(s) ∈ Ȟ¹(𝒰, F_{C̄₁}), relative Čech cohomology of the presheaf F = F_ℤ S_e of formal ℤ-linear combinations of support sections. γ(s) = 0 iff s belongs to a compatible family of such ℤ-combinations (Prop 4.2), so a non-vanishing γ(s) is a sufficient but not necessary witness of contextuality (Prop 4.3). γ is non-zero for every section of the PR box, GHZ, the triangle, the 18-vector Kochen–Specker set and the Peres–Mermin square, but it vanishes on the Hardy model and on one strongly contextual Kochen–Specker cover (§8). | Active — read in full 2026-09-27 (NOTE-250); worth reading as the short original source of the cohomological obstruction to contextuality. It gives the exact definition (a relative Čech class, with coefficients the free abelian group on support sections), the vanishing criterion and its two known failures. Its results are small propositions with complete proofs, plus machine-checked mod-2 computations that I reproduced. It calls itself “work in progress” (§1), and the conceptual development is in Abramsky et al.’s CSL 2015 “Contextuality, Cohomology and Paradox” (not read). A reading of that paper would show whether it supersedes this one. |
| LIT-278 v2 | Contextuality, Cohomology and Paradox | Abramsky et al. (2015), ARXIV-1502.03097. For a model whose outcomes live in a commutative ring R, “All-vs-Nothing” (AvN_R) means the R-linear equations satisfied by every support section of every context have no global solution. Theorem 21 proves AvN_R(S) ⇒ SC(Aff S) ⇒ CSC_R(S) ⇒ CSC_ℤ(S) ⇒ SC(S), so every AvN model is strongly contextual with a non-vanishing Čech obstruction on every section. Theorem 4 shows that every state stabilised by an “AvN triple” of n-qubit Pauli operators yields such a model. The “paradox” half proves much less: an informal identification of Liar cycles with strongly contextual support tables, one exact case (the length-4 Liar cycle is the PR box), and the cohomology of paradox deferred to future work. | Active — read in full 2026-09-27 (NOTE-251); worth reading as the place where the cohomological witness is shown complete for a named, large class (every All-vs-Nothing model, over any ring). It is also where the obstruction is defined as a connecting homomorphism. It does not supersede LIT-277. It re-derives none of LIT-277’s computations, and it drops its negative results: the Hardy false positive and the strongly contextual cover with γ = 0. Its “paradox” title-word is supported by about one page of analogy and one worked identification. |
| LIT-279 v2 | On the Cohomology of Contextuality | Carù (2017), ARXIV-1701.00656. Carù gives a possibilistic model on the two-party, two-setting, four-outcome Bell cover that is strongly contextual, yet whose Čech obstruction vanishes on all 22 support sections (Fig 4, Table 1). That refutes Abramsky–Mansfield–Barbosa’s Conjecture 8.1 for any symmetry or connectedness condition the Bell cover meets. I confirmed the refutation over ℤ and ℤ/2. The rest is weaker. Odd-degree “higher obstructions” form a hierarchy (Prop 5.5), but every level above the first is empty for every no-signalling model (Prop 5.6). Prop 6.3 restates the known torsor description of Ȟ¹. Prop 6.1 is false in the “only if” direction; the PR box refutes it. | Active — read in full 2026-09-27 (NOTE-252); worth reading for one result, the first complete false negative of the cohomological witness (§4 and Appendix A, about two pages), which is correct as I verified it. §5 proves its own programme empty for no-signalling models, and §6 is a standard correspondence plus one false proposition. The follow-up, arXiv 1807.04203, may supersede it; that is unverified, since it was not read. |
| LIT-280 v2 | Towards a complete cohomology invariant for non-locality and contextuality | Carù (2018), ARXIV-1807.04203. For cyclic scenarios, where the contexts’ intersection graph is a single chordless N-cycle, Carù proves that ℤ/2 Čech cohomology of the (N−1)-th iterated “joint model” is a complete invariant for logical and strong contextuality (Thm 7.7). I confirmed this on the Hardy model, on his own 2017 counterexample (detected on all 22 sections at level 3) and on 659 random contextual cycle models. The extension beyond cycles does not hold as stated. Prop 8.2 is false on the paper’s own Table 5 model. Worse, the one non-cyclic case the paper claims to repair, the §8 Kochen–Specker cover of Abramsky–Mansfield–Barbosa, is never detected at any level under the paper’s definitions (my proof and computation). That refutes the paper’s closing Conjecture 9.1. | Active — read in full 2026-09-27 (NOTE-253); worth reading for §§4–7, a correct and genuinely new result: a complete cohomological test for contextuality on cyclic scenarios, which closes the Hardy and Carù-2017 gaps. Read it knowing that §8’s generalisation, its §8.1 Kochen–Specker example and Conjecture 9.1 are wrong as stated. |
| LIT-281 v2 | Logical and Topological Contextuality in Quantum Mechanics and Beyond | Carù (2019), DOI-10.5287/ora-kznbp4k4y. The thesis’s cohomology chapters republish the 2017 and 2018 papers with the “joint model” renamed the “line model”. The definitions, Thm IV.32 (complete on cyclic scenarios at level |M|−1), Prop IV.34, Thm IV.36 and Conjecture IV.41 carry over unchanged. So does every defect found in the preprint. Under the thesis’s own Def IV.26, the §8 Kochen–Specker cover of Abramsky–Mansfield–Barbosa is still detected on only 6 of 15 sections at levels 0–3 (my recomputation), and a lifted ℤ/2 family shows it is never fully detected at any level. The context-wise reading the worked examples use detects all 15 sections at level 2. The genuinely new material lies outside the cohomology programme: a probabilistic line-model construction (§IV.7), a valuation-algebra “theory of disagreement” with inference algorithms (Ch V, bound O(k^n·l^{k(n−1)+1}) on (n,k,l) scenarios), and the AvN-triple characterisation of stabiliser states (Ch VI). | Active — read in full 2026-09-27 (NOTE-254); worth reading as the consolidated source for Carù’s cohomology programme (Chs III–IV), for the valuation-algebra reformulation of contextuality (Ch V) and for the AvN triple theorem (Ch VI). Chs III–IV repeat, uncorrected, the errors recorded for LIT-279 and LIT-280, so read them with NOTE-252 and NOTE-253 at hand. |
| LIT-282 v2 | The Possibility of Social Choice | Sen (1998), DOI-10.1257/aer.89.3.349. Sen argues that Arrow’s impossibility is a result about voting-type rules, which are forced on social choice by excluding interpersonal comparisons, and that broadening the informational basis escapes it: cardinal utilities without interpersonal comparison do not help (Theorem 8*2 of Sen 1970a, cited), but even ordinal interpersonal comparisons break the exact impossibility, and partial comparability is often enough (pp. 188–189). The comparisons need not be of mental states; he offers capabilities — “to live the way he or she has reason to value” (p. 192) — as one informational basis among several, and shows it at work in poverty, famine and gender deprivation. The liberal paradox, by contrast, is not resolved by interpersonal comparisons and needs a different enrichment: people’s own priorities between liberty and desire-fulfilment (pp. 199–200). | Active — read in full 2026-09-28 (NOTE-263); worth reading as Sen’s own map of how his social-choice work, his capability view and his poverty and famine work connect through one idea — informational broadening — though every formal claim in it is cited to earlier papers rather than shown, so it is a guide to the results, not a source for them. |
| LIT-283 v2 | The Capability Approach | Robeyns & Byskov (2011), https://plato.stanford.edu/entries/capability-approach/. The entry treats the capability approach as an open normative framework, not a theory. Its core is the commitment to assess well-being and well-being freedom in the space of functionings (achieved doings and beings) and capabilities (real opportunities to achieve them). Everything else is optional specification: purpose, which capabilities count, functionings or capabilities, how to aggregate, and a distributive rule. On this view the approach is not a theory of justice (§4). Sen is reported as refusing any canonical list and appealing to public reasoning without ever specifying the procedure (§3.3). Sen’s paywalled texts appear only as citations: the Dewey Lectures for the well-being/agency freedom split (§2.5), and “Human Rights and Capabilities” 2005 p. 158 for the no-canonical-list quotation (§3.3). | Active — read in full 2026-09-28 (NOTE-260); worth reading as the definitional spine of the approach, with its concepts, its specification choices and the list of what a capability theory of justice still lacks. Use it for Sen’s paywalled texts only as a pointer to them, not as a substitute. Its retelling of Sen’s 1979 disability argument conflates two of his arguments and inverts who the “pleasure wizard” is. |
| LIT-284 v2 | Sen’s Capability Approach | Wells (2012), https://iep.utm.edu/sen-cap/. A Sen-centred overview. It presents the approach as Sen’s answer to four concerns: conversion variation, adaptive preferences, the value of options not taken, and informational exclusion. It sets out his critiques of the three pillars of utilitarianism (act-consequentialism, welfarism, sum-ranking) and of Rawlsian resourcism, and his two-stage structure, valuation then evaluation. In that structure selection is a social-choice exercise of public reasoning, able to reach partial agreement through “intersection” and “ranges of weights” (§3b). It reports four criticisms (illiberalism, under-theorisation, individualism, information gaps) with Sen’s replies, and closes on Nussbaum and on how she differs from Sen. It never mentions the well-being/agency distinction, and it cites none of Sen’s human-rights papers. | Active — read in full 2026-09-28 (NOTE-257); worth reading as the most Sen-specific short account in the batch, especially §3b’s partial-agreement mechanism and §5’s criticisms with Sen’s replies. It dates from 2012 and was never revised, and it omits agency freedom entirely, so for concepts it needs the SEP entry beside it. |
| LIT-285 v2 | The Impossibility of a Paretian Liberal | Sen (1970), DOI-10.1086/259614. Sen proves that no social decision function can satisfy three conditions at once: unrestricted domain (U), the weak Pareto principle (P), and “minimal liberalism” (L*). A social decision function only has to yield a best element in every subset, and need not be transitive or satisfy independence. L* says at least two individuals are each decisive, both ways, over at least one pair of alternatives. I checked the two-case proof and it is correct: it builds a strict social cycle over 3 or 4 alternatives. The Lady Chatterley’s Lover example is a correct 3-alternative instance. Sen’s moral is that “in a very basic sense liberal values conflict with the Pareto principle” (p. 157). | Active — read in full 2026-09-28 (NOTE-255); worth reading as the original, six-page statement of the liberal paradox, with a complete and correct proof. Read it knowing two things. Its formal Condition L gives decisiveness over arbitrary pairs, not over a protected personal sphere, which the later rights-as-game-forms literature disputes. And Theorem I as stated tacitly needs at least two individuals. |
| LIT-286 v2 | Review of Amartya Sen’s The Idea of Justice | Zwolinski (2010), https://home.sandiego.edu/~mzwolinski/Review%20-%20Sen%20-%20The%20Idea%20of%20Justice%20-%20web%20version.pdf. A short, favourable review of The Idea of Justice that maps its four parts. It reports the book’s case for a comparative, “realization-focused” theory of justice against the “transcendental” pursuit of perfect justice; “positional objectivity” and the impartial spectator; pluralism about freedom (“an inescapably plural idea”, p. 305); and human rights whose realisation need not be the state’s job (p. 364). It judges that the book’s few, repeated ideas “have the potential to change [political philosophy] for the better”. | Active — read in full 2026-09-28 (NOTE-261); worth reading only as a three-page, page-referenced map of the book. It is too slight to support any claim beyond “the book argues X at p. Y”. It says almost nothing about the capability chapters and offers no criticism. |
| LIT-287 v2 | Wellbeing, Freedom and Social Justice: The Capability Approach Re-Examined | Robeyns (2017), DOI-10.11647/OBP.0130. Robeyns defines the capability approach as an open, underspecified framework whose only compulsory content is an eight-part “A-module” (pp. 38–59, table 2.5 p. 74). The eight parts are: functionings and capabilities as core concepts; their value-neutrality; conversion factors; the means–ends distinction; functionings and/or capabilities as the evaluative space; other things may also have ultimate value; value pluralism; and each person as an end, i.e. ethical individualism. Every particular “capability theory” must also fill seven compulsory-but-open “B-modules” (purpose, selection of dimensions, human diversity, agency, structural constraints, functionings vs capabilities, meta-theory) and may add four contingent “C-modules”. On that basis she argues that most standing critiques (no list, individualism, power, political economy, liberalism) are valid at most against particular capability theories, not against the approach. She places Nussbaum’s work as one capability theory, not a rival version of the approach. | Active — read in full 2026-09-28 (NOTE-259); worth reading as the most systematic single account of what the capability approach is, and of what a capability theory must add. It is the best route to seeing which disputes are about the core and which are about optional choices. Read it as an advocate’s reconstruction, not a neutral survey: Robeyns says she takes sides in ch. 4 (p. 19), and her verdicts mostly hold that a critique misfires against the approach. |
| LIT-288 v2 | Capabilities as Fundamental Entitlements: Sen and Social Justice | Nussbaum (2003), DOI-10.1080/1354570022000077926. Nussbaum argues that Sen’s capability approach yields no theory of social justice until it commits to a definite, if revisable, list of central capabilities, each owed to every citizen up to a threshold. She sets out her list of ten (Life; Bodily Health; Bodily Integrity; Senses, Imagination and Thought; Emotions; Practical Reason; Affiliation; Other Species; Play; Control over one’s Environment). She rejects Sen’s talk of freedom as a general good because some freedoms are trivial or unjust. And she argues that political-liberal respect for pluralism favours a short list of capabilities over the promotion of freedom across the board. | Active — read in full 2026-09-28 (NOTE-256); worth reading as the canonical short statement of the list-versus-no-list dispute inside the capability approach, and of Nussbaum’s ten capabilities. It is argued by examples, not derived. Its threshold idea is announced but not worked out here. |
| LIT-289 v2 | Equality of What? | Sen (1979), https://ophi.org.uk/sites/default/files/Sen-1979_Equality-of-What.pdf. Sen argues that utilitarian equality (equal marginal utility), total-utility equality (completed as leximin) and Rawlsian equality (maximin/leximin on an index of primary goods) are each insufficient, and so is any combination of them, even for the needs-based part of equality: the test case is a disabled person who has no marginal-utility claim, no total-utility deprivation (he is contented) and no primary-goods deprivation, yet has an evident claim. He proposes “basic capability equality” — equality in “a person being able to do certain basic things” (p. 218) — as a non-fetishist, culture-dependent extension of Rawls, explicitly only “a partial guide” to the equality part of morality, and says his main (negative) thesis does not depend on this constructive proposal (p. 220). | Active — read in full 2026-09-28 (NOTE-258); worth reading as the founding statement of the capability idea and the cleanest short case against welfarist and primary-goods metrics; read it knowing that the positive proposal is a two-page sketch with no account of which capabilities count or how to index them, and that “functionings”, “capability sets” and “freedom” do not yet appear. |
| LIT-290 v2 | A Paradigm Shift in Theorizing about Justice? A Critique of Sen | Valentini (2010), DOI-10.1017/s0266267111000228. Valentini reconstructs Sen’s case against “transcendental institutionalism” (The Idea of Justice, 2009, and “What Do We Want from a Theory of Justice?”, 2006) as three complaints: it is neither necessary nor sufficient for comparative judgements, it is parochial, and it is inflexible. She argues that each rests on a mischaracterisation of Rawls or is true but inconsequential. Her verdict: “If there are transcendental institutionalists, Rawls is not one of them”, and no paradigm shift is warranted. | Active — read in full 2026-09-28 (NOTE-262); worth reading as a compact, well-sourced Rawlsian rebuttal of The Idea of Justice’s methodological thesis, with page-referenced reconstructions of Sen’s claims. It is explicitly one-sided (“negative”). It does not engage the capability approach itself. |
| LIT-291 v2 | Compatibilism | McKenna & Coates (2004), https://plato.stanford.edu/entries/compatibilism/. The entry sorts compatibilism by which incompatibilist premise it denies: that free will requires the ability to do otherwise, that determinism precludes it, or that free will requires ultimate sourcehood. It argues that every “mesh” compatibilism has the same weak point: its sufficient conditions (hierarchies, reasons-responsive mechanisms, values) can be installed by manipulation, so each must either show what is wrong with manipulation cases or accept them. Its §4.2.1 is the fullest statement of Frankfurt 1971 in this batch. It covers first- and second-order desires, the will as the “effective first-order desire” that moves one “all the way to action” (1971, p. 84, Watson-1982 reprint pagination), the therapist’s mere second-order desire versus a second-order volition (pp. 84–5), the unwilling and willing addicts, and “One acts of her own free will if and only if her action issues from the will she wants.” The current revision has dropped the wanton/person distinction. The 2004–2015 revisions had it (“passive bystanders to their wills”, 1971, p. 89) and have to be read for it. | Active — read in full 2026-09-29 (NOTE-270); worth reading as the most complete reachable second-hand statement of Frankfurt’s 1971 apparatus and of the two structural objections (higher-order alienation per Watson 1975; manipulation), with Frankfurt’s own bullet-biting quotation on manipulation (2002, p. 27). For wantons and persons, read the 2004–2015 revisions (e.g. the Fall 2019 archive edition). Its account of Frankfurt’s later replies (supplement §A) dates from 2009, omits “satisfaction” (1992), and dates wholeheartedness to 1994. |
| LIT-292 v2 | Identification and Identity | Velleman (2002), DOI-10.7551/mitpress/2143.003.0007. Velleman targets Frankfurt’s later conception of autonomy. On that conception, a person acts autonomously only when his volitions derive from “the essential character of his will”, and that essence consists of volitional necessities that are also the conditions of his personal identity. Velleman argues against it on three grounds. Such an essence would ground authenticity, not autonomy (the Winnicottian False Self is inauthentic but over-controlled). Frankfurt offers no argument or example that motivational change ends a person. And the ideal of wholeheartedness, which cures ambivalence by extruding a desire from the self, is a defensive fantasy: Freud’s Rat Man was made ill by just such a separation, and identifying with part of oneself in the ordinary, imaginative sense is Sartrean bad faith. He replaces “the self” with an aspectual reading of “self” as a marker of reflexivity. On that reading autonomy is behaviour motivated partly by the understanding, the part of us “with which we cannot help identifying”, without its being our identity (pp. 357–360). | Active — read in full 2026-09-29 (NOTE-268); worth reading as the sharpest critique of Frankfurt’s late (1990s) identification of autonomy with a volitional essence, and as a careful source for what Frankfurt said in the essays collected in Necessity, Volition, and Love (1999). It is not a survey of the 1971–1987 hierarchical account, which it summarizes in one paragraph and defers to “What Happens When Someone Acts?”; its positive view is stated “briefly” and explicitly deferred to other essays. |
| LIT-293 v2 | I. Taking Ourselves Seriously; II. Getting It Right | Frankfurt (2004), https://tannerlectures.org/wp-content/uploads/2024/06/frankfurt_2005.pdf. Frankfurt grounds practical reason and normativity in the will rather than in reason. Reflexive self-division makes higher-order attitudes possible (pp. 170–171). Identification, a largely default “willing acceptance” (p. 173), turns a desire from “a problem” into a reason (p. 175). Free will is “volitional unanimity” between the governing desire and higher-order volitions (p. 177), and caring is wanting to go on wanting (p. 180). Final ends and their normative authority come from love, “strictly volitional” (p. 196): its involuntary, wholehearted “volitional necessities” are “irresistible, but … not coercive” (p. 197) and are “the only legitimate authority” for our normative convictions (p. 201). The 1971 wanton/person taxonomy is gestured at in a single phrase and its apparatus is not restated. | Active — read in full 2026-09-29 (NOTE-264); worth reading as the only openly available statement by Frankfurt himself of his mature view (identification, volitional unanimity, caring, love, volitional necessity); read it knowing that it is a lecture with no self-citation and no engagement with critics (Watson is never named, the regress is not discussed), and that it does not restate the 1971 apparatus, which must still be sourced second-hand. |
| LIT-294 v2 | Moral Responsibility and the Principle of Alternative Possibilities | Robb (2020), https://plato.stanford.edu/entries/alternative-possibilities/. PAP (“a person is morally responsible for what she has done only if she could have done otherwise”) has no decisive positive argument: it is not self-evident, and the moral arguments from fairness, OIC and the W-defense cover blame at most. Frankfurt-style cases (FSCs) are the strongest attack, because the factor that makes the act inevitable plays no role in producing it. The entry lays out three defences of PAP: - general-ability readings (PAP-general); - “flickers of freedom”, which Fischer answers with the robustness requirement; - the Kane/Widerker/Ginet dilemma, answered by Fischer’s causal-irrelevance reply on the first horn and by Pereboom’s buffer case, Hunt’s blockage and Mele & Robb 1998 on the second. Robb reports “not much consensus” (§5). He treats the fall of PAP as re-energising compatibilism, with Frankfurt’s 1971 identification view and Fischer & Ravizza’s guidance control as the two replacement accounts. | Active — read in full 2026-09-29 (NOTE-269); worth reading as the standard, even-handed map of the PAP debate and the best available stand-in for Frankfurt 1969. It gives the recipe, both of Frankfurt’s own cases, and the main defences and replies, with precise citations. It is a stand-in for the argument’s reception, not for the 1969 text, which it quotes only through Fischer’s retelling, and it links FSCs to the hierarchical theory in a single paragraph (§5.1). |
| LIT-295 v2 | What Happens When Someone Acts? | Velleman (1992), DOI-10.1093/mind/101.403.461. Velleman argues that the “standard story” of action (desire + belief cause an intention, which causes movement) leaves the agent out. It fails even when every causal link is normal: his example is an intention to end a friendship, formed and executed without him (p. 104). Frankfurt’s hierarchical remedy cannot fix it either. Any mental item picked out without presupposing the agent’s participation (a second-order desire, a Watsonian value, a “decisive commitment”) is one the agent can be alienated from. Any item defined so as to guarantee participation begs the question of agent-causation (pp. 112–116). His alternative is to look for what is functionally identical to the agent, not what the agent identifies with. That can only be a motive always behind and never merely in front of critical reflection: the desire to act in accordance with reasons. Its reinforcing force is the agent’s contribution (pp. 117–122). | Active — read in full 2026-09-29 (NOTE-265); worth reading as the canonical statement of the “disappearing agent” objection to the causal theory of action and as the sharpest short critique of Frankfurt’s hierarchy as a reduction of agent-causation. Its positive proposal is a sketch whose content Velleman revises in the same book: he later says the motive is not a de dicto desire for reasons, and relabels “full-blooded action” as action vs. activity. |
| LIT-296 v2 | Personal Autonomy | Buss & Westlund (2002), https://plato.stanford.edu/entries/personal-autonomy/. The entry sorts accounts of self-government into four families: “coherentist” (hierarchical desires, Frankfurt; evaluative judgments, Watson; plans, Bratman; caring; character), reasons-responsive, responsiveness-to-reasoning (Christman, Mele) and incompatibilist, with relational conditions as a compatible add-on. It then argues (§3) that none of them, alone or combined, gives the minimal conditions of autonomy. Coherence is not sufficient, because the endorsement itself can be manipulated. It is not necessary either: a weak-willed agent, or someone acting against her plans, still governs herself. And any attempt to ground identification in some attitude restarts the regress. The only attitude no agent can be alienated from, the desire to be self-governing, cannot be the criterion, because it is present even in failures. The 1971 hierarchy gets one sentence, and Frankfurt’s later replies (decisive commitment, then “satisfaction”) get one footnote. | Active — read in full 2026-09-29 (NOTE-267); worth reading as a compact, opinionated map of why hierarchical (and every other) account of self-government falls short of minimal autonomy, especially the §3 regress and weakness-of-will arguments; it is not a substitute for Frankfurt 1971, whose apparatus (second-order volitions, wantons, persons, freedom of will vs. action) it never states, and it does not report Watson’s objection to Frankfurt at all. |
| LIT-297 v2 | Autonomy | Dryden (2010), https://iep.utm.edu/autonomy/. The article surveys personal autonomy from Plato to relational autonomy and bioethics. Its core (§2.a.i–ii) states the hierarchical view: an agent is autonomous with respect to an action iff her first-order desire is “sanctioned by a second-order volition”, with the origin of that volition irrelevant. It then lists four named objections: Manipulation (answered historically by Christman 1991), Regress/Incompleteness (cited to Watson 1975), Ab Initio, and an unjustified priority of higher orders (Thalberg; Friedman’s integration model). It follows Frankfurt’s reply only through “Identification and Wholeheartedness” (decisive commitment made without reservation, pp. 168–175 of the 1988 collection). Bratman gets one sentence (plans partly constitute identity, Structures of Agency 2007, p. 5). | Active — read in full 2026-09-29 (NOTE-266); worth reading as the clearest short, named statement of the standard objections to the hierarchical model (manipulation, regress, ab initio) and of the feminist and relational critiques of wholeheartedness; it is thin and dated on Frankfurt’s later view (no satisfaction, caring or love), gives Bratman one sentence, and cites Frankfurt only by pages of the 1988 collection. |
| LIT-298 v2 | The problem of hidden variables in quantum mechanics | Kochen & Specker (1967), DOI-10.1512/iumj.1968.17.17004. Theorem 1 exhibits a finite partial Boolean algebra D, generated by 117 directions in E³, that admits no homomorphism onto Z₂. §4 embeds D in the projections of the spin-1 space of orthohelium’s 2³S₁ state, via α ↦ P J_α². So no assignment of 0/1 values to those quantum propositions respects all the Boolean relations within each commeasurable set. Theorem 0 makes the target precise: a partial Boolean algebra embeds in a Boolean algebra iff its Z₂-homomorphisms separate points. That is, hidden variables in the paper’s sense need enough “global valuations”, and quantum mechanics in dimension 3 has none. The same paper builds a classical hidden-variable model for spin ½ (§6). It argues that von Neumann’s no-go needed additivity on non-commuting observables (Theorem 3). | Active — read in full 2026-09-29 (NOTE-279); worth reading. It is the primary source of the Kochen–Specker theorem and of the partial-algebra formulation that the sheaf and topos programmes generalise. The 117-vector construction is superseded for economy by later small KS sets (e.g. Peres’s 33, Cabello’s 18 in dimension 4); the review LIT-263 covers those. |
| LIT-299 v2 | A topos foundation for theories of physics: III. The representation of physical quantities with arrows δ̆°(A): Σ̲ → ℝ̲≽ | Döring & Isham (2008), DOI-10.1063/1.2883777. Each bounded self-adjoint  becomes an arrow δ̆^o(A) : Σ → ℝ^⪰, where ℝ^⪰ is the presheaf of real-valued order-reversing functions on ↓V. At λ ∈ Σ_V it sends V′ ⊆ V to λ(δ^o(Â)_{V′}), and δ^o(Â)_V is the spectral-order-least operator in V above Â. The map  ↦ δ̆^o(A) is injective, but ℝ^⪰ is only an additive monoid, not the real-number object. Its Grothendieck completion k(ℝ^⪰) is an abelian-group object whose global elements are exactly the functions of bounded variation on V(H). | Active — read in full 2026-09-29 (NOTE-290); worth reading as the source of the quantity-value object ℝ^⪰ and of the explicit statement that Gel’fand points of a context are ultrafilters of its projection lattice. Its results are small, mostly proved or cited from de Groote and Döring. The physically motivated parts (k(ℝ^⪰), “intrinsic dispersion”, unitaries) are definitions with no consequences drawn. |
| LIT-300 v2 | A closed set of normal orthogonal functions | Walsh (1923), DOI-10.2307/2387224. The paper defines a closed orthonormal set {φ} on (0, 1) of functions taking only the values ±1, recursively by (2) and explicitly by (3)–(4). In binary x = Σ a_i/2^i, the functions are signed products (−1)^{a_{i₁}+…+a_{i_r}}; the nth has exactly n sign changes. It proves Fourier-like properties: uniform convergence for continuous F with the terms grouped in dyadic blocks (Thm II); pointwise convergence to ½[F(a−0)+F(a+0)] for bounded variation (Thm IV); localisation (Thm V); uniform Cesàro summability for continuous F (Thm VII); a continuous function with a divergent φ-series at any chosen point (Thm VIII); and uniqueness of expansions (Thms IX–X). It never mentions groups, characters or (ℤ/2)ⁿ. | Active — read in full 2026-09-29 (NOTE-281); worth reading as the primary source of the Walsh system, and short. For Walsh functions as characters of the Cantor group / Boolean cube and the Walsh–Hadamard/Boolean-Fourier theory the map needs, it is superseded by later work (Paley 1932 for the Rademacher-product ordering; Fine 1949 for the dyadic-group view; O’Donnell, LIT-346, for Boolean Fourier analysis). |
| LIT-302 v2 | The Platonic Representation Hypothesis | Huh et al. (2024), ARXIV-2405.07987. A position paper with one argument and three measurements. Measured with mutual 10-nearest-neighbour overlap, vision models that solve more VTAB tasks agree more with each other (78 models). Language models with lower bits-per-byte agree more with DINOv2, CLIP and others on Wikipedia image–caption pairs, and this alignment tracks HellaSwag and GSM8K scores. The cross-modal score “only reaches 0.16” out of a maximum of 1 (§6), and a CKA version “revealed a very weak trend” (App. A). The formal argument (§4.2, App. F) shows only this: in an idealised world of discrete events seen through bijective observations, the Bayes-optimal NCE critic is the pointwise-mutual-information kernel plus a constant, and that kernel is representable as an inner product under a sufficient smoothness condition (Prop. F.1). So every such modality shares one kernel, up to an additive constant. | Active — read in full 2026-09-29 (NOTE-286); worth reading as the source of the “Platonic representation hypothesis” and of the one clean formal statement behind it (Bayes-optimal NCE critics equal the PMI kernel, so bijective modalities share a kernel). Read the empirical case as local nearest-neighbour agreement of modest size, chosen after CKA showed little. Read the endpoint, “a statistical model of reality”, as a conjecture that the paper’s own §6 bounds by the mutual information between modalities. |
| LIT-304 v2 | The Linear Representation Hypothesis and the Geometry of Large Language Models | Park et al. (2023), ARXIV-2311.03658. Three readings of “concepts are directions” are made precise with counterfactual pairs, and proved to line up. The shared direction of word-pair differences in the unembedding space is a logit-linear probe (Thm 2.2). The embedding-space direction is a steering vector that leaves causally separable concepts unchanged (Thm 2.5). Under any inner product making separable concepts orthogonal, the Riesz map sends the first to the second (Thm 3.2). Softmax training fixes the representation only up to γ ↦ Aγ + β, λ ↦ A⁻ᵀλ, so no inner product is identified, and the paper chooses M = Cov(γ)⁻¹ by setting a free diagonal D to the identity (Thm 3.4). Evidence: 27 concepts on LLaMA-2 7B (26 show a common direction; thing⇒part does not), read from histograms and heatmaps with no test statistic, plus a Gemma-2B heatmap comparison. | Active — read in full 2026-09-29 (NOTE-302); worth reading as the short, precise source of the counterfactual-pair formalisation of the linear representation hypothesis and of the observation that softmax training leaves the representation’s inner product unidentified. Read its theorems as statements about the final-layer context vector and the unembedding only. Read the choice M = Cov(γ)⁻¹ as a stipulation (D = I), not as a result, and the experiments as qualitative. |
| LIT-305 v2 | On the Generalization of Equivariance and Convolution in Neural Networks to the Action of Compact Groups | Kondor & Trivedi (2018), ARXIV-1802.03690. Theorem 1 says that a feed-forward network whose layers are linear maps followed by pointwise nonlinearities, with every layer indexed by a homogeneous space G/H_ℓ of a compact group G, is G-equivariant (every layer transforming by the induced action) if and only if each linear map is a generalised convolution f ∗ χ with a filter on the double coset space H_{ℓ−1}\G/H_ℓ. The “if” direction is a short coset computation. The “only if” direction goes through the group Fourier transform: equivariant maps preserve isotypic components (Lemma 6) and act on each Fourier matrix by right multiplication, M ↦ MB (Lemma 10), which the convolution theorem (Prop. 2) turns back into a convolution. | Active — read in full 2026-09-29 (NOTE-282); worth reading as the standard ML statement of “equivariance ⇔ convolution” for compact groups and as a compact introduction to isotypic decomposition and noncommutative Fourier analysis for neural networks. Read the “only if” proof as an outline. It is written out for finite or countable groups and scalar channels only, and one step (removing the pointwise nonlinearity) does not hold as stated for ReLU. |
| LIT-306 v2 | The logic of quantum mechanics | Birkhoff & Neumann (1936), DOI-10.2307/1968621. The paper argues heuristically that the experimental propositions of a quantum system correspond to closed linear subspaces of Hilbert space. Meet is intersection, join is closed linear span, and negation is orthogonal complement. The lattice satisfies L1–L4 and complementation L71–L73 but not the distributive law L6. The paper proposes the modular law L5 as its replacement. Under a finite-dimension assumption, it concludes that the propositional calculus of QM is an abstract projective geometry. The Appendix proves that orthocomplementations on P_{n−1}(F), n ≥ 4, are exactly the polarities of definite diagonal Hermitian forms with respect to an involutory anti-automorphism of F. | Active — read in full 2026-09-29 (NOTE-275); worth reading as the founding text of quantum logic, and for its proposed axiom, which is modularity, not orthomodularity. For the orthomodular Hilbert-lattice machinery that is used today (infinite dimensions, Piron, Solèr), later work supersedes it. The paper itself calls its main conclusions “admittedly heuristic”. |
| LIT-308 v2 | Stochastic Thermodynamics of Learning | Goldt & Seifert (2017), DOI-10.1103/PhysRevLett.118.010601. For a perceptron whose weights follow overdamped Langevin dynamics and whose predicted labels are fast two-state processes, the information learnt about fixed random labels is bounded by the weights’ total entropy production: Σ_μ I(σ_T^μ:σ^μ) ≤ Σ_n [ΔS(ω_n) + ΔQ_n] (Eq. 16, k_B = T = 1). This defines a learning efficiency η ≤ 1. The cost side includes the change in the weights’ own Shannon entropy, and in the paper’s toy model η → 0.99 as the heat ΔQ → 0 (slow driving). So the bound is not a heat floor of k_BT ln 2 per bit learnt. | Active — read in full 2026-09-29 (NOTE-296); worth reading as the founding letter of the “stochastic thermodynamics of learning” line, and as the precise statement of what learning costs in that framework: entropy production, of which heat is only one part. Read the main-text claim “for arbitrary learning algorithm … at all times” alongside its supplement. The derivation uses a γ ≫ 1 (fast-label) limit and a weight-independence step that holds for batch but is not argued for online learning. |
| LIT-309 v2 | On hypercomplex numbers | Wedderburn (1908), DOI-10.1112/plms/s2-6.1.77. For associative algebras with a finite basis over an arbitrary field F, the paper proves the structure theory. A semi-simple algebra (no nilpotent invariant sub-algebra) is uniquely the direct sum of simple algebras (Thms 10, 17). Every simple algebra is the direct product of a primitive (division) algebra and a simple matric algebra, i.e. a full n×n matrix algebra (Thms 21–23). The maximal nilpotent invariant sub-algebra N contains all others (Thm 13), and A/N is semi-simple. When every non-invertible element is nilpotent, A = B + N with B primitive (Thm 28, with a proof correction added 1 Feb 1908). Section 8 lists the results as (i)–(vi). | Active — read in full 2026-09-29 (NOTE-280); worth reading as the primary source of the Wedderburn structure theorem over an arbitrary field, and of the matrix-unit argument (Thm 21) still used today. The notation of “complexes” and ”<” is dated. For the modern ring-theoretic form (Artinian semisimple rings ≅ Π M_{n_i}(D_i)), Artin 1927 (LIT-331, unread) or any algebra text supersedes it. |
| LIT-312 v2 | A theory of concepts and their combinations II: A Hilbert space representation | Aerts & Gabora (2005), DOI-10.1108/03684920510575807. Aerts & Gabora embed the “pet” data in ℂ¹⁴⁰⁰. Each of 1,400 “basic contexts” is one vector of an orthonormal basis, the ground state is the uniform superposition, and each context is the projector onto the span of its basic contexts. The Born rule then returns the measured frequencies as counting ratios, for example cat under “chewing a bone” = 75/303 = 0.25. “Pet fish” is modelled as the entangled state Σ_{u∈E} |u⟩⊗|u⟩/√100 in ℂ¹⁴⁰⁰⊗ℂ⁴⁰⁸, so that collapsing “pet” to goldfish collapses “fish” to goldfish too. Every projector in the model is diagonal in one basis, so the fitted model is a classical probability space in quantum notation, which the authors half-concede (a “quantization … of this set theoretical model”, §3.3). Two of the chosen counts are infeasible: parrot and guppy. | Active — read in full 2026-09-29 (NOTE-299); worth reading as the concrete source of the quantum-cognition treatment of concepts (projectors for contexts, collapse for context change, tensor product and entanglement for combination), and as an early proposal of tensor-product sentence meaning before DisCoCat. Read with the caveat that its worked model never uses a non-commuting projector, so none of its fits exercises anything beyond Kolmogorov probability, and its “solution” to the pet-fish problem reproduces the single-concept data it was given rather than predicting a combination. |
| LIT-313 v2 | On the imbedding of normed rings into the ring of operators in Hilbert space | Gelfand & Neumark (1943), DOI-10.1090/conm/167/16. Theorem 1 is the first abstract characterisation of C*-algebras. Every normed -ring (a unital Banach -algebra with ‖xx‖ = ‖x‖·‖x‖, ‖x*‖ = ‖x‖, and e + x*x invertible) is isometrically *-isomorphic to a norm-closed -subalgebra of the bounded operators on some, not necessarily separable, Hilbert space. The proof builds, for each maximal left ideal M, a positive functional f vanishing on M. The inner product is (ξ, η) = f(yx) on R/M, and the construction takes the direct sum over all M. This is the GNS construction. Lemma 1 is the commutative case: such an algebra is isometrically *-isomorphic to C(𝔐) for its compact maximal-ideal space. §4 adds that the simple weakly closed rings on separable Hilbert space are exactly the factors of types I_n, II₁ and III (Theorem 3). | Active — read in full 2026-09-29 (NOTE-303); worth reading as the primary source of both Gelfand–Naimark theorems, commutative (Lemma 1) and non-commutative (Theorem 1), and of the GNS construction in embryo. It is compact and readable. Modern treatments state it with the single C*-identity. The authors themselves note that it suffices, and later work showed their extra axioms 5′ and 6′ redundant (not verified here). |
| LIT-314 v2 | Group Equivariant Convolutional Networks | Cohen & Welling (2016), ARXIV-1602.07576. Group convolution (eqs. 10–11) replaces translation by the elements of a discrete group G, so feature maps become functions on G and every layer is G-equivariant (eq. 12, with pooling and nonlinearities shown to commute with the action). With parameter counts held roughly fixed, p4-CNNs cut rotated-MNIST test error from 5.03% (planar baseline) to 2.28% (previous best 3.98%), and p4m convolutions cut plain-CIFAR10 error from 9.45% to 6.46% on a ResNet44 (Tables 1–2). | Active — read in full 2026-09-29 (NOTE-288); worth reading as the short, self-contained origin of the group-convolution layer and of the “equivariance as weight sharing over a symmetry group fixed in advance” design. Read the CIFAR “state of the art” claim as holding for un-augmented CIFAR10 only, and the paper as containing no representation theory (no irreps, characters or Fourier analysis on groups). |
| LIT-315 v2 | Structural Realism: The Best of Both Worlds? | Worrall (1989), DOI-10.1111/j.1746-8361.1989.tb00933.x. Worrall argues that the only position that honours both the no-miracles argument and the historical fact of radical theoretical change is Poincaré’s “structural or syntactic realism”. What survives theory change and explains predictive success is mathematical structure: equations carried over unchanged (Fresnel’s reflection/refraction amplitude ratios, reinterpreted as electric-vector amplitudes in Maxwell’s theory) or recovered as limiting cases under the correspondence principle (Newton from Einstein). The underlying ontology (elastic ether versus electromagnetic field) is not what survives. The support is one worked case and a general appeal to the correspondence principle. There are no formal definitions, and the paper says itself that “much clarificatory work needs to be done”, above all on what it is for one theory’s structure to approximate another’s (p. 121). | Active — read in full 2026-09-29 (NOTE-297); worth reading as the short, clearly argued source that revived epistemic structural realism and supplies its canonical Fresnel→Maxwell case. It argues informally from one example, leaves “structure” and “structural approximation” undefined, and is epistemic, not ontic. For the ontic position, and for any invariance-based reading of “structure”, it must be read with Ladyman 1998 and after. |
| LIT-319 v2 | Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges | Bronstein et al. (2021), ARXIV-2104.13478. The authors cast CNNs, GNNs, Deep Sets, Transformers, spherical, mesh and gauge CNNs, and LSTMs as instances of one “blueprint” (p. 29). Each is a stack of linear G-equivariant layers, pointwise nonlinearities and local pooling, capped by a G-invariant global pooling, with the domain Ω and its symmetry group G given in advance (p. 27: “a symmetry group G”; p. 4: “exploiting the known symmetries”). The two priors are symmetry and scale separation. The Fourier transform is derived as the joint eigenbasis of shift-commuting (circulant) operators, which requires distinct eigenvalues (p. 37). Its group-theoretic generalisation via irreducible representations is announced and deferred to “future work” (p. 43). | Active — read in part 2026-09-29 (NOTE-274); worth reading as the standard systematisation of symmetry-as-architecture in deep learning and for its clean derivation of convolution and the Fourier basis from translation symmetry (§4.2). Read it as a proto-book that defers its representation theory (irreps, group Fourier transforms) and its learning theory to “future work”. It takes the symmetry group as known and never addresses discovering one. |
| LIT-322 v2 | Not All Language Model Features Are One-Dimensionally Linear | Engels et al. (2024), ARXIV-2405.14860. Defines a feature as irreducibly multi-dimensional when no rotation and translation makes its distribution either a product of independent parts (separable) or a mixture with a lower-dimensional component (Def. 2). Softened versions are the separability index S(f) and the ε-mixture index M_ε(f) (Def. 3). Clustering sparse-autoencoder dictionary elements by cosine similarity then finds circular representations of weekdays and months in GPT-2 (also 20th-century years) and in Mistral 7B. Replacing the circle coordinates at the day or month token causally changes the answer on “N days/months from X” prompts in Mistral 7B and Llama 3 8B, and in early layers the circle patch nearly matches patching the whole layer. The models’ task accuracy is modest on weekdays (29/49 Llama, 31/49 Mistral), high on months (143/144, 125/144), and near-trivial for GPT-2 despite its circles. | Active — read in full 2026-09-29 (NOTE-273); worth reading as the first causal demonstration that a pretrained language model computes with an irreducibly two-dimensional (circular) feature, and for a clean statistical definition of feature reducibility. Read the discovery as largely manual: circles for days, months and years, found by eye among about 2,500 inspected clusters, with the automatic score ranking them 9th, 28th and 15th of 1,000. Read “irreducible” as statistical, not representation-theoretic. |
| LIT-323 v3 | Toy Models of Superposition | Elhage et al. (2022), ARXIV-2209.10652. In a toy autoencoder x′ = ReLU(WᵀWx + b), with n sparse synthetic features compressed into m < n dimensions, a linear model keeps only the top-m features, but with the output ReLU and sparse enough features the model stores more features than dimensions (“superposition”), in non-orthogonal directions whose interference the ReLU and a negative bias filter out. Whether a feature is dropped, superposed or given a dedicated dimension changes discontinuously with sparsity and importance, and in the n = 2, m = 1 theory this is a first-order phase change. With uniform features the directions settle into uniform polytopes, with feature dimensionalities clustering at 3/4, 2/3, 1/2, 2/5 and 3/8. A ReLU hidden layer creates a privileged basis in which monosemantic and polysemantic neurons coexist, and a model can compute |x| for more features than it has neurons. Everything is shown in toy models only, and the authors expect the geometry and learning-dynamics results to generalise least. | Active — read in full 2026-09-29 (NOTE-278); worth reading as the founding statement of the superposition hypothesis and of the vocabulary the field now uses: features as directions, privileged versus non-privileged bases, polysemanticity as interference, and feature dimensionality. It is also the cleanest demonstration that a nonlinearity plus sparsity makes it optimal to store more features than dimensions. Its evidence is toy models alone, which the paper says plainly. Its phase-change and polytope results are exact only for n = 2, m = 1 and uniform features. |
| LIT-324 v2 | Opening the Black Box of Deep Neural Networks via Information | Shwartz-Ziv & Tishby (2017), ARXIV-1703.00810. The paper studies small tanh networks (layer widths down from 12 to 2) trained by SGD on a 12-bit, O(3)-symmetric synthetic rule, with mutual information estimated by binning each neuron into 30 bins over all 4,096 inputs. It reports two phases: a short “ERM” phase of a few hundred epochs in which I(T;Y) rises, and a long “compression” phase in which I(X;T) falls. The phases coincide with a drop in per-layer gradient SNR (from high-SNR drift to low-SNR diffusion, at about 350 epochs), and the converged layers sit on the IB curve at fitted β. Everything is shown on small synthetic tasks, with the explanations argued informally. | Active — read in full 2026-09-29 (NOTE-298); worth reading as the source of the IB account of deep-learning dynamics and of the drift/diffusion gradient-SNR phase picture, which McCandlish et al. cite. Its compression and generalisation claims are contested: the anthology’s ANTH-LIT-509 reports them refuted, which I have not checked. Read it as the claim, not the result, and never without the critique. |
| LIT-325 v3 | A topos perspective on the Kochen–Specker theorem: I. Quantum states as generalized valuations | Isham & Butterfield (1998), DOI-10.1023/A:1026680806775. Isham & Butterfield show that, for bounded self-adjoint operators with discrete spectrum, a global section of the spectral presheaf Σ(Â) = σ(Â) on the category O_d, whose arrows are functional relations B̂ = f(Â), is literally a valuation obeying the value rule and FUNC. A global section of the dual presheaf D(W) = Hom(W, {0,1}) on the poset W of Boolean subalgebras of projectors is literally a Kochen–Specker 0/1 assignment. The Kochen–Specker theorem (cited, not reproved) is therefore equivalent to “no global sections” when dim H > 2 (§§2.2–2.3). In place of the missing global valuations, they construct contextual truth values in the Heyting algebra of sieves: ν^ρ(A ∈ Δ) = {f: B̂ →  | tr(ρ Ê[B ∈ f(Δ)]) = 1}. For every density matrix these satisfy functional composition, null, monotonicity, exclusivity and unit conditions (§4.4, §5.3, Theorem 5.1). | Active — read in full 2026-09-29 (NOTE-271); worth reading as the founding paper of the topos approach to quantum theory and the origin of “Kochen–Specker = no global section of a presheaf over contexts”, credited as such by Abramsky & Brandenburger (LIT-016). The reformulation itself is definitional and its proof is two paragraphs. The paper’s own contribution is the sieve-valued generalized valuation, whose later development (von Neumann algebras as base, daseinisation) lives in Parts III–IV and in Döring–Isham (LIT-343, LIT-335, LIT-299, LIT-310). |
| LIT-326 v2 | Sur une espèce de géométrie analytique des systèmes de fonctions sommables | Riesz (1907), https://archive.org/details/comptes-rendus-hebdomadaires-academie-des-sciences_1907-06-24_144_25. A priority note, not a paper of proofs. Riesz says his aim was an “analytic geometry” of square-summable functions, completed by his existence theorem (every square-summable coordinate sequence is the image of a square-integrable function). He states two consequences without proof. First, every linear operation U on square-summable functions that is continuous for convergence in mean is given by U(f) = ∫ f k for some square-summable k; uniqueness of k is not stated. Second, a completeness criterion for Schmidt’s problem. | Active — read in full 2026-09-29 (NOTE-289); worth reading only as the historical first statement of the Riesz representation theorem on L², and it takes three minutes. It states and does not prove. For the theorem itself, and for anything the record argues from it, a modern proof (LIT-243, or any functional-analysis text) supersedes it as a source. |
| LIT-327 v2 | Thermodynamics of Prediction | Still et al. (2012), DOI-10.1103/PhysRevLett.109.120604. For a system driven by a stochastic signal through a fixed Markov kernel, the average work dissipated as the signal steps x_t → x_{t+1} equals, in units of k_BT, the system’s instantaneous nonpredictive information, I[s_t;x_t] − I[s_t;x_{t+1}] (Eq. 14). Summed over a protocol, this total “nostalgia” lower-bounds dissipation and excess work (Eq. 18), and it adds to Landauer’s bound: −β⟨Q⟩ ≥ I_e + I_mem − I_pred (Eq. 21). All three are averages over paths and protocols. None of them is a per-operation or per-bit floor on the cost of storing or using predictive information. | Active — read in full 2026-09-29 (NOTE-295); worth reading as the short, exact source of “memory that does not predict costs dissipation” and of the nostalgia-augmented Landauer bound. Read it knowing three things. The bound prices only the nonpredictive part of memory. The nonnegativity of the per-step nostalgia needs a Markov drive, which the paper does not say. And nothing in it supplies a k_BT ln 2 floor per judgment. |
| LIT-329 v2 | Die Vollständigkeit der primitiven Darstellungen einer geschlossenen kontinuierlichen Gruppe | Peter & Weyl (1927), DOI-10.1007/BF01447892. For a “closed continuous group”, a compact Lie group with invariant volume, the Fundamentalsatz (p. 752) proves the Parseval equality over all inequivalent irreducible representations E = (e_ik) of order n. It is n Σ_{i,k} |α_ik|² + … = V ∫ |x(s)|² ds for every continuous x, with α_ik = ∫ x ē_ik ds. For continuous class functions it reads |α|² + … = V ∫ |x|² ds with α = ∫ x χ̄ ds. The proof applies Hilbert–Schmidt theory to the convolution kernel z(st⁻¹), z = x x̃. The consequences are that finite combinations of matrix coefficients uniformly approximate every continuous function (Approximationssatz), that representations separate points (Satz I), and that characters separate conjugacy classes (Satz II). | Active — read in full 2026-09-29 (NOTE-305); worth reading as the primary source of the Peter–Weyl theorem, and it is short and constructive. Its setting is compact Lie groups and continuous functions. For arbitrary compact groups and the L²(G) = ⊕ (dim π)·π decomposition in modern form, a textbook statement (e.g. Weil 1940, or Folland’s A Course in Abstract Harmonic Analysis) supersedes it. |
| LIT-330 v2 | The approximation of one matrix by another of lower rank | Eckart & Young (1936), DOI-10.1007/BF02288367. For a real n×N matrix a, the rank-r matrix β nearest in the least-squares (Frobenius) distance is obtained by writing a = u′λU (u, U orthogonal, λ diagonal ≥ 0, “Theorem I”) and zeroing all but the r largest diagonal elements. The solution is unique unless λ_r = λ_{r+1}. The squared error is Σ_{i>r} λ_i², so the error is at most l(1−r/R)^{1/2}, with l the length of a and R its rank. The paper also argues that the resulting canonic components cannot straightforwardly be read as psychological factors. | Active — read in full 2026-09-29 (NOTE-301); worth reading as the short, readable origin of the Frobenius-norm low-rank approximation theorem in the form still used. The proof is a first-order stationarity argument plus an unproved simultaneous-diagonalisation theorem, and it covers only the least-squares norm. For the general unitarily-invariant-norm statement, cite Mirsky (1960, not in the record). |
| LIT-333 v2 | The theory of topological commutative groups | Pontryagin (1934), DOI-10.2307/1968438. For countable discrete abelian 𝔊, the character group X = Hom(𝔊, K), K = ℝ/ℤ with pointwise convergence, is compact and second countable (Thm 1). Characters separate points and subgroups, with annihilator correspondence and quotient/subgroup duality (Thms 2–4). An orthogonal pair (X, 𝔊) with trivial annihilators has each the character group of the other (Thm 5). By the First Fundamental Theorem, every compact second-countable abelian group is the character group of its discrete character group; the proof uses Peter–Weyl via Haar. Hence duality between countable discrete and compact second-countable abelian groups. Chapters III–IV give structure theorems for locally compact connected abelian groups (compact ⊕ ℝⁿ). Duality for general locally compact abelian groups is not proved here. | Active — read in full 2026-09-29 (NOTE-284); worth reading as the primary source of Pontryagin duality in its compact/discrete form, and it is careful and self-contained given Peter–Weyl and Haar. For the full locally compact abelian duality (each LCA group is the dual of its dual), van Kampen (1935) and later textbook treatments supersede it. |
| LIT-335 v2 | A topos foundation for theories of physics: II. Daseinisation and the liberation of quantum theory | Döring & Isham (2008), DOI-10.1063/1.2883742. A projector P̂ is mapped to the clopen sub-object δ(P̂) of the spectral presheaf Σ over the poset V(H) of abelian von Neumann subalgebras, by “daseinisation” (de Groote’s V-support): δ(P̂)V = the least projector in V above P̂. The map is injective and preserves ∨, but only δ(P̂∧Q̂) ⪯ δ(P̂)∧δ(Q̂). This represents the propositional language PL(S) in the Heyting algebra Sub_cl(Σ). A pure state gives the truth object T^ψ, and “A ε Δ” gets the sieve-valued truth value {V′ ⊆ V | ⟨ψ|δ(Ê[A∈Δ]){V′}|ψ⟩ = 1}. | Active — read in full 2026-09-29 (NOTE-292); worth reading as the core reference for “quantum propositions as clopen sub-objects of the spectral presheaf” (daseinisation, Sub_cl(Σ), truth objects). It is a cleaned-up restatement of Isham–Butterfield (LIT-325) plus de Groote’s operation, not a new no-go result. Several proofs are sketched or omitted, and the “no global elements” statement it relies on needs dim H > 2, which it never says. |
| LIT-338 v2 | The information bottleneck method | Tishby et al. (1999), ARXIV-physics/0004057. The paper defines relevant information as what X tells about a second variable Y and poses the information-bottleneck problem, min over p(x̃|x) of L = I(X̃;X) − β·I(X̃;Y), under the Markov chain X̃ ← X ← Y (eq. 15). Theorem 4 gives the exact formal solution p(x̃|x) = p(x̃)/Z(x,β)·exp(−β·D_KL[p(y|x)‖p(y|x̃)]), so the KL divergence emerges as the effective distortion. Theorem 5 gives a Blahut–Arimoto-style alternating iteration that converges but, being non-convex jointly, not necessarily to a unique solution. | Active — read in full 2026-09-29 (NOTE-300); worth reading as the short, exact source of the IB functional, its self-consistent equations, the information plane and β as the one trade-off parameter. The phase-transition claim is cited out, not shown here. Nothing in it concerns gradients, SGD or batch size, so it is not the principle behind the gradient-as-channel narrative in the sense row 12 suggests. |
| LIT-339 v2 | The intrinsic parity of elementary particles | Wick et al. (1952), DOI-10.1103/PhysRev.88.101. The paper defines a superselection rule: a decomposition of Hilbert space into orthogonal subspaces A, B, C, … between which there are no spontaneous transitions and no measurable quantities with non-zero matrix elements. Relative phases across subspaces, and hence relative parities, are then unobservable. It proves such a rule between integer and half-integer angular momentum, from time reversal with U_AKU_AK = +1 and U_BKU_BK = −1. It postulates, without conclusive evidence, a charge superselection rule. The consequence is that “all Hermitean operators represent measurable quantities” must be abandoned. | Active — read in full 2026-09-29 (NOTE-304); worth reading as the origin of the superselection concept and its first argued instance (univalence). It is short, and its definition is still the one used. The algebraic form (sectors as the centre of the observable algebra) is later work; Haag’s book, LIT-321, is the place for that. |
| LIT-340 v2 | A theory of concepts and their combinations I: The structure of the sets of contexts and properties | Aerts & Gabora (2005), DOI-10.1108/03684920510575799. Aerts & Gabora model a concept as an entity with states that change under contexts, a “state context property system” (Σ, M, L, µ, ν). They report an 81-subject e-mail study in which 7 contexts shift the rated frequency of 14 exemplars of “pet” (for example dog 0.50 under “The pet is chewing a bone” against 0.12 in the unit context) and the applicability of 14 properties. They then postulate that contexts and properties each form a complete orthocomplemented lattice, and call the structure quantum-like because a state can be an eigenstate of e ∨ f without being one of e or of f (eq. 19). No theorem is proved, the lattice is not shown to be non-distributive or orthomodular, and the paper contains no Hilbert-space model and no treatment of combination; both are deferred to Part II. | Active — read in full 2026-09-29 (NOTE-294); worth reading as the founding statement of the state-context-property approach to concepts that the prior-art map cites, and for its pet data. Read it as a programme and a data set, not as a result. The lattice structure is assumed (“we suppose”, §3.2), the orthocomplement is illustrated rather than derived, and the “quantum-like” criterion it gives does not by itself make the lattice non-Boolean. |
| LIT-341 v2 | Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets | Power et al. (2022), ARXIV-2201.02177. Small decoder-only transformers (2 layers, width 128, 4 heads, ~4·10⁵ non-embedding parameters) trained on binary-operation tables over abstract symbols can reach 100% validation accuracy long after fitting the training set. In the headline run (division mod 97, 50% data, Adam with no weight decay, a budget of 10⁶ steps), training accuracy is near-perfect before 10³ steps, validation accuracy only near 10⁶, with little progress before 10⁵. The optimisation time to generalise rises steeply as the training fraction falls (on S₅ near 25–30% data, −1% data costs +40–50% median steps), and weight decay is the most data-efficient intervention tried. | Active — read in full 2026-09-29 (NOTE-287); worth reading as the paper that named grokking and measured its data and optimisation dependence. It is a testbed paper with ablations and no mechanism, so it supplies the phenomenon row 15 cites, not the resolvability or singular-learning-theory reading. |
| LIT-343 v2 | A topos foundation for theories of physics: I. Formal languages for physics | Döring & Isham (2008), DOI-10.1063/1.2883740. The programme paper. Its contention is that a theory of a physical system S is a representation of a typed “local language” L(S) (ground types Σ and R, function symbols A : Σ → R) in a topos. Physical quantities become arrows Σ_φ → R_φ, and propositions become sub-objects of Σ_φ, which form a Heyting algebra. Classical physics is the representation in Sets. The paper proves nothing. Its one argument is that the axiom ¬(A ε Δ) ⇔ A ε ℝ∖Δ is not validated by non-Boolean Heyting representations (§3.2.1). | Active — read in full 2026-09-29 (NOTE-277); worth reading as the statement and vocabulary of the Döring–Isham programme (neo-realism, PL(S) and L(S), state object and quantity-value object, representation in a topos). It is discursive and contains no results, and every piece of quantum mathematics is deferred to papers II–III (LIT-335, LIT-299). |
| LIT-345 v2 | Progress measures for grokking via mechanistic interpretability | Nanda et al. (2023), ARXIV-2301.05217. A one-layer ReLU transformer (P = 113, 30% of pairs, full-batch AdamW with λ = 1, 40k epochs) that groks modular addition implements a “Fourier multiplication” algorithm. The embedding maps a and b to cos/sin(w_k·a), cos/sin(w_k·b) at five key frequencies k ∈ {14, 35, 41, 42, 52}, with w_k = 2πk/113. Attention and MLP form cos/sin(w_k(a+b)), and the neuron-logit map W_L (≈ rank 10) reads out Σ_k α_k·cos(w_k(a+b−c)). Progress measures built from this (restricted and excluded loss) show training splits into memorisation (0–1.4k epochs), circuit formation (1.4k–9.4k) and cleanup (9.4k–14k), with the test-accuracy jump inside cleanup. | Active — read in full 2026-09-29 (NOTE-283); worth reading as the fullest mechanistic account of a grokking network. Its learned structure is exactly the character basis of ℤ/113 (five real 2-dimensional irreps), which makes it the nearest existing empirical instance of the map’s row-7 “predicate harmonics = characters” prediction, in a setting where the group was known in advance. |
| LIT-346 v2 | Analysis of Boolean Functions | O’Donnell (2014), DOI-10.1017/CBO9781139814782. Every f: {−1,1}ⁿ → ℝ has a unique multilinear (Fourier–Walsh) expansion f = Σ_S f̂(S)χ_S over the parities χ_S(x) = ∏{i∈S} x_i, which are an orthonormal basis (Thm 1.1, Thm 1.5) and are the characters of the group F₂ⁿ, χ_S(x+y) = χ_S(x)χ_S(y) (eq. 1.5; §3.2; §8.5). The central operators are all diagonal in this basis with eigenvalues depending only on |S|: the noise operator T_ρχ_S = ρ^{|S|}χ_S (Prop. 2.47) and the Laplacian Lχ_S = |S|χ_S (Prop. 2.37). Influence, noise stability and Arrow’s Theorem (via Stab{−1/3}) become statements about the Fourier weight at each level (Thms 2.20, 2.38, 2.49, 2.56). | Active — read in part 2026-09-29 (NOTE-291); worth reading as the standard, freely available text on Fourier analysis of functions on the Boolean cube. Chapters 1–2 alone give the character basis, Plancherel and Parseval, convolution, and the level-by-level diagonalisation of the noise operator and Laplacian. Read it as abelian harmonic analysis only: it has no nonabelian representation theory, no irreps of dimension > 1 and no isotypic decomposition. |
| LIT-347 v2 | Information-theoretic analysis of generalization capability of learning algorithms | Xu & Raginsky (2017), ARXIV-1705.07809. If the loss ℓ(w,Z) is σ-subgaussian for every w, then the expected generalisation error of any learning algorithm P_{W|S} obeys |E[L_μ(W) − L_S(W)]| ≤ √(2σ²·I(S;W)/n) (Theorem 1). This extends Russo–Zou to uncountable hypothesis spaces, and the paper adds a high-probability version, n = (8σ²/α²)(ε/β + log(2/β)) (Theorem 3). Minimising empirical risk plus I(S;W), relaxed to a KL term against a prior Q, yields exactly the Gibbs algorithm (Theorem 5). Noisy ERM and adaptive composition are analysed through the same mutual-information quantity. | Active — read in full 2026-09-29 (NOTE-306); worth reading as the short, clean source of the input–output mutual-information generalisation bound, and of “a learning algorithm is a channel P_{W|S}”, whose capacity is sup_μ I(S;W). The bound is in expectation and is vacuous for deterministic algorithms on continuous hypotheses, which is what the later compression and rate–distortion refinements (LIT-236, LIT-233) address. |
| LIT-348 v2 | An Empirical Model of Large-Batch Training | McCandlish et al. (2018), ARXIV-1812.06162. The paper derives a local model in which the loss progress one step can make at batch size B is ΔL_max/(1 + B_noise/B), with B_noise = tr(HΣ)/GᵀHG (eqs. 2.7–2.8). Averaged over a run at fixed B, the model gives the steps/examples hyperbola (S/S_min − 1)(E/E_min − 1) = 1, which defines the critical batch B_crit = E_min/S_min (eqs. 2.11–2.12). Across eight tasks, B_crit spans about six orders of magnitude (from 20 to over 10 million, §3), and the Hessian-free B_simple = tr(Σ)/|G|² tracks it to about an order of magnitude (Table 1: run-averaged B_simple/B_crit runs from 0.05 for the SVHN VAE and autoencoder to 8 for SVHN). | Active — read in full 2026-09-29 (NOTE-293); worth reading as the origin of the batch-size/gradient-SNR/critical-batch/time–compute result that row 12 of the owner’s map attributes to it. The theory is elementary and local, and the evidence is empirical. It has nothing on information, channels or energy, so it owns row 12’s formulas for progress and trade-off and none of its information-theoretic framing. |
| LIT-352 v2 | A numerical algorithm for block-diagonal decomposition of matrix *-algebras with application to semidefinite programming | Murota et al. (2010), DOI-10.1007/s13160-010-0006-9. Given real symmetric A₁…A_m, the method finds an orthogonal P that block-diagonalises them all as simultaneously and finely as possible. That is the decomposition of the matrix *-algebra 𝒯 they generate into simple components (Algorithm 4.1) and then irreducible components (§4.2), with no group or algebra supplied in advance. The simple components are the connected components of the graph “Q_iᵀA_pQ_{i′} ≠ O” between the eigenspaces of one random combination A(r) = Σ r_pA_p. This is correct with probability 1 when span{I, A₁…A_m} = 𝒯 ∩ Sⁿ (Props. 3.2–3.4, 4.2). The structure theorem it relies on, Theorem 3.1(C) “if 𝒯 is irreducible then 𝒯 = Mₙ”, is false over ℝ as stated. The companion paper (Maehara & Murota 2010) handles the complex and quaternion types. | Active — read in full 2026-09-29 (NOTE-276); worth reading as the clearest short account of numerical block-diagonalisation of a *-algebra from generators alone, via eigenspaces of a random element. For the general real case, i.e. irreducible components of complex or quaternionic type, the companion Maehara & Murota (JJIAM 27:263–293, 2010) is needed, and is not in the record. For the map’s use, both should be cited. |
| LIT-353 v3 | The Theory of Representations for Boolean Algebras | Stone (1936), DOI-10.2307/1989664. The paper identifies Boolean algebras with Boolean rings with unit (xx = x), and generalized Boolean algebras with Boolean rings (Thms 1–4). Theorem 67 proves that every Boolean ring A is isomorphic to the algebra B(A) of classes 𝔈(a) = {prime ideals p : a ∉ p}, under symmetric difference and intersection. Its ideal lattice is isomorphic to the system of classes 𝔈(𝔞) under arbitrary unions and finite intersections. The existence of enough prime ideals (Thm 63) is proved by transfinite induction, and Theorem 70 shows that “every Boolean ring has an isomorphic algebra of classes” and “every ideal is the product of its prime divisors” are equivalent without choice. Theorems 68–69 classify all set-representations as restrictions of B(A) to subclasses of prime ideals. The topology, i.e. Stone spaces and duality, is explicitly deferred to “another paper”. | Active — read in full 2026-09-29 (NOTE-272); worth reading as the primary source of the Stone representation theorem, via prime ideals of Boolean rings, and of the Boolean-ring viewpoint. It is long and technical, and for the representation alone Chapter IV plus Theorems 1–2, 33–40 and 49 suffice. For the topological duality (Boolean algebras ↔ totally disconnected compact Hausdorff spaces), the map’s actual need, Stone 1937 (Trans. AMS 41, LIT-358) is the source. |
| LIT-355 v2 | An Introduction to Hyperplane Arrangements | Stanley (2006), DOI-10.1090/pcms/013/08. The notes define the regions of a real arrangement (connected components of the complement) and the intersection poset L(A) with its Möbius function and characteristic polynomial χ_A(t) = Σ μ(x) t^{dim x}. They prove Zaslavsky’s theorem (Thm 2.5): r(A) = (−1)ⁿ χ_A(−1) and b(A) = (−1)^{rank A} χ_A(1), so the numbers of regions and bounded regions depend only on L(A), not on the face structure (Cor. 2.1, Fig. 2). The same machinery counts faces of every dimension (Thm 2.6: f_k = Σ_{x≤y, dim x=k} |μ(x,y)|). Later lectures add Whitney’s theorem, deletion–restriction, matroids and geometric lattices, broken circuits, supersolvability, the finite-field method, and the metric d(R, R′) = number of separating hyperplanes, whose zero set shows that a region is determined by its separating set (p. 89). | Active — read in full 2026-09-29 (NOTE-313); worth reading as the standard open introduction to real hyperplane arrangements. It is the best reachable source for “regions”, the intersection poset and Zaslavsky’s region-count theorem, with complete proofs of the region formula. Read it knowing that it never uses the oriented-matroid vocabulary of “topes” or “covectors” (it cites Björner et al., Oriented Matroids, only in passing) and that it does not cite Zaslavsky’s own texts. |
| LIT-356 v2 | How much does your data exploration overfit? Controlling bias via information usage | Russo & Zou (2015), arXiv:1511.05219. Suppose an analyst reports statistic φ_T, chosen by any data-dependent rule T from m candidates each σ-sub-Gaussian. Then the selection bias obeys |E[φ_T − µ_T]| ≤ σ√(2·I(T;φ)) (Prop. 1), where “information usage” I(T;φ) ≤ H(T) ≤ log m. For argmax selection over φ ~ N(µ,I) the squared error is Θ(1 + H(T)) (Prop. 3). Adaptive analyses compose additively, with I(T_{k+1};φ) ≤ Σ_i I(Y_{T_i};φ_{T_i} | H_{i−1},T_i) (Lemma 1). Answering each query with Gaussian noise of variance σ²√j/n therefore keeps the k-th answer’s error at O(σk^{1/4}/√n) (Prop. 7). | Active — read in full 2026-09-29 (NOTE-308); Worth reading as the origin of the mutual-information bias and generalisation bound that LIT-347 (Xu & Raginsky) extends, and as the first place its adaptive-composition chain rule and its per-query “information budget” with Gaussian noise (½·log(1+SNR) per query) appear. Read it knowing that it is stated for a finite set of m candidate statistics, and that “the bound is tight” is shown only for Gaussian argmax and threshold selections, as squared-error (not bias) bounds except in the exponential case. |
| LIT-357 v2 | Studies on the Foundation of Quantum Mechanics. I | Husimi (1937), DOI-10.11429/ppmsj1919.19.0_766. Husimi derives Birkhoff and von Neumann’s lattice axioms from statistical premises. Implication is P̄ ≤ Q̄ in every state (and requires compatibility), negation is Q̄ = 1 − P̄, and compatible propositions obey classical logic. Meet is obtained from “Ehrenfest’s principle” (additivity of mean values) via the top eigenvalue of aP + bQ (pp. 778–779), and the modular law, equivalently the parallelogram law |P| + |Q| − |P∩Q| = |P∪Q|, is proved under a finite-chain assumption. The orthomodular identity is used but never named or stated as an axiom. It appears as the step “since we admit traditional logic to any classical part … S + P∩Q = R” for R ⊃ P∩Q (p. 784), and as the case “(Q − P) + P = Q provided Q ⊃ P” of a classical identity (p. 780). | Active — read in full 2026-09-29 (NOTE-312); worth reading as the first derivation of the Birkhoff–von Neumann propositional calculus from operational premises (states, mean values, compatibility), and for its physical account of meet and join. It is not, however, a clean citation for “the orthomodular law”. The law is an unnamed lemma resting on “classical logic within compatible sets”, and the paper’s axiomatic target is modularity under a finite-chain assumption. A text that states orthomodularity as an axiom (e.g. Kalmbach, Orthomodular Lattices, 1983; unverified here) would settle row 1’s citation. |
| LIT-358 v2 | Applications of the theory of Boolean rings to general topology | Stone (1937), DOI-10.1090/S0002-9947-1937-1501905-7. Stone topologises the set 𝔈 of prime ideals of a Boolean ring by taking the sets 𝔈(a) as a basis. 𝔈 is then a totally disconnected, locally bicompact Hausdorff space, bicompact exactly when the ring has a unit (Thm 1), and every such space arises this way (Thm 2). Theorem 4 states that “the algebraic theory of Boolean rings is mathematically equivalent to the topological theory of Boolean spaces”: isomorphism ↔ homeomorphism, ideals ↔ open sets, quotients ↔ closed subsets, unit ↔ bicompactness, and subrings ↔ continuous images (Thm 7). The same paper also contains what are now called the Stone–Čech compactification (Thms 78–79, 88), the Stone–Weierstrass theorem (Thm 82), the Banach–Stone theorem (Thm 83) and closed ideals of C(X) ↔ closed sets (Thm 85). | Active — read in full 2026-09-29 (NOTE-311); worth reading as the primary source of Stone duality and the correct citation for map row 8’s “Stone duality”, replacing LIT-353. For that purpose Chapter I (pp. 378–394) is enough. The rest is a long general-topology memoir whose best-known results (Stone–Čech, Stone–Weierstrass, Banach–Stone) are stated in 1937 vocabulary (bicompact, H-space, analytical isomorphism) and are now better learned from textbooks. |
| LIT-360 v2 | Notes on Landauer’s principle, reversible computation, and Maxwell’s Demon | Bennett (2002), arXiv:physics/0210005. Bennett states Landauer’s principle as a consequence of the Second Law. A logically irreversible step, meaning erasure or a merge of control flow, must export at least the lost entropy (k ln 2 per bit) to non-information-bearing degrees of freedom. That export need not take the form of heat (p. 1). Logically reversible operations, including copying onto a blank register and measurement, have no minimum cost. He calls “an intrinsic cost of order kT for every elementary act of information processing” a 20th-century “misconception” (pp. 5–6). Erasing random data can itself be thermodynamically reversible; the waste comes from applying a many-to-one operation to known data (pp. 1, 4). | Active — read in full 2026-09-29 (NOTE-310); Worth reading as a short, first-hand statement, by the principle’s main defender, of what Landauer’s principle requires (logical irreversibility) and what it does not (any cost for acquiring, copying or evaluating information). It is the best reachable stand-in for the unreachable LIT-328. Read it knowing that it is an argued position paper, not a derivation. On the Earman–Norton “unnecessary or insufficient” dilemma Bennett concedes the point “with some justice” (p. 5) and defends the principle only as pedagogy. |
| LIT-362 v2 | Learning the Irreducible Representations of Commutative Lie Groups | Cohen & Welling (2014), arXiv:1402.4437. Proposes “Weyl’s principle” (via Kanatani 1990) as a definition of disentangling: the elementary components of data are the irreducible subspaces of the representation of a symmetry group acting on it. It learns such a decomposition for one class of group fixed in advance, compact commutative subgroups of SO(D) (“toroidal”), from pairs (x, y) of raw data vectors related by an unobserved group element, y = W R(φ) Wᵀx + ε. The orthogonal basis W (2-D invariant subspaces) is fitted by SGD on a closed-form marginal likelihood, and the integer weights ω_j are then read off a batch rotated by a known 0.1°. The only experiment trains 100 filters on 250,000 white-noise 16×16 patches paired with random rotations of themselves (learned ω from −11 to 12), and uses the invariant √κ̂ for 1-NN on rotated MNIST, reported in a figure with no numbers. Spectral degeneracy plays no role. | Active — read in full 2026-09-29 (NOTE-307); worth reading as the earliest ML paper in this batch to state that the “elementary components” of a representation are the irreps of a symmetry group and to learn them from data; read it as learning the irreducible decomposition of an assumed abelian group class from transformation pairs on raw pixels, not as detecting an unknown symmetry in a trained network, and with an experiment that is a one-group proof of concept on noise patches. |
| LIT-363 v2 | Understanding image representations by measuring their equivariance and equivalence | Lenc & Vedaldi (2014), arXiv:1411.5908. Given a fixed representation φ (HOG, or AlexNet Conv1–Conv5 before ReLU) and a transformation g of the input image chosen by the experimenter (flips, 90° and other rotations, rescaling by 2^{±1/2}, affine warps), it fits a linear map M_g on the representation space with φ(gx) ≈ M_g φ(x), by sparse or structured-sparse regression or by a “transformation layer” trained through the rest of the network, and fits “stitching layers” E with φ′(x) ≈ E φ(x) between different networks. In AlexNet, learned M_g recover most of the classifier’s accuracy for vertical flips and 90° rotations (top-1 error 0.75 uncompensated vs 0.43–0.51 and 0.44–0.53 across Conv1–Conv5, original 0.43), channels scored invariant rise to 99.61% for horizontal flips at Conv5, and Conv1–Conv2 are interchangeable between AlexNet and networks trained on ImageNet, Places or both. It detects no group and uses no spectrum. | Active — read in full 2026-09-29 (NOTE-309); worth reading as the origin of two standard probes of trained networks, fitted linear equivariance maps and model stitching, and as the closest prior art for “measuring symmetry in a trained network’s representation”; read it knowing that every transformation tested is named in advance and applied to the input, that each is fitted separately with no group structure, and that its deep-layer “equivariance” is judged by recovered task accuracy through a high-capacity learned layer. |
| LIT-364 v2 | The Theory of Signal Detectability. Part I: The General Theory; Part II: Applications with Gaussian Noise | Peterson & Birdsall (1953), https://deepblue.lib.umich.edu/handle/2027.42/7068. Peterson and Birdsall show that the criterion approach (maximise P_SN(A) − β·P_N(A), or maximise detection at fixed false-alarm k) and the Woodward–Davies a-posteriori approach are all solved by one receiver that computes the likelihood ratio ℓ(x) = f_SN(x)/f_N(x) and thresholds it (Part I, Theorems 1–7). They introduce the receiver operating characteristic, whose slope at each point is the threshold β (Theorem 8, Eq. 2.51). For a signal known exactly in white Gaussian noise, ln ℓ is normal with equal variance 2E/N₀ under both hypotheses and means 2E/N₀ apart, so the ROC is a one-parameter family indexed by the “detection index” d = (M_SN − M_N)²/σ² = 2E/N₀ (Part II, Eqs. 4.1–4.8, Fig. 4.1). The receiver is a correlator or matched filter (Eq. 5.3, 4.10). | Active — read in part 2026-09-30 (NOTE-315); worth reading as the founding engineering statement of signal detection theory: the likelihood-ratio receiver, the ROC and its slope property, and the equal-variance Gaussian case with an explicit d = 2E/N₀. Read the 1953 report knowing that the scan is poor and that the 1954 IRE paper (with W. C. Fox) is the citable journal form, which was not read here. |
| LIT-367 v2 | Calculation of signal detection theory measures | Stanislaw & Todorov (1999), DOI-10.3758/BF03207704. A practical tutorial that gives closed-form SDT measures computed from the hit rate H and false-alarm rate F. They are d′ = Φ⁻¹(H) − Φ⁻¹(F); β = exp{[Φ⁻¹(F)² − Φ⁻¹(H)²]/2}; c = −[Φ⁻¹(H) + Φ⁻¹(F)]/2; the nonparametric A′ and Grier’s B″ (single-formula versions, eqs. 3 and 9); A_z = Φ(intercept/√(1+slope²)) from the z-ROC, whose slope is σ_noise/σ_signal; and A_d′ = Φ(d′/√2), which equals 2AFC proportion correct under the d′ assumptions. It also gives one-line commands for seven software packages. Its worked rating example (50 signal and 25 noise trials, noise SD larger than signal SD) shows d′ ranging from 0.84 to 1.86 across criteria. The authors conclude that d′ should not be used without rating-task evidence of equal variance. | Active — read in full 2026-09-30 (NOTE-314); worth reading as the standard short, citable reference for how the SDT measures are computed and what each assumes. It is a tutorial with no new theory. Several of its software pointers (1999 FTP sites, Quattro Pro, SYSTAT commands) are dated, but the formulae are not. |
| LIT-368 v2 | A decision-making theory of visual detection | Tanner & Swets (1954), DOI-10.1037/h0058700. Tanner and Swets model visual detection as testing a statistical hypothesis. The observer compares one sample of neural activity with a cutoff, and signal+noise and noise are Gaussian with equal variance, separated by d′ (the mean difference in noise-SD units, defined as the square root of Peterson and Birdsall’s d). The cutoff moves along a curve of P_SN(A) against P_N(A) (the curve now called the ROC; for d′ = 1 it passes through (.16, .50), (.50, .84) and (.84, .98)). The optimal operating point is where the slope equals β = [(1−P(SN))/P(SN)]·[(V_N·CA+K_N·A)/(V_SN·A+K_SN·CA)]. The 4AFC prediction is P(C)=∫F(x)³g(x)dx. With three paid observers, d′ estimated from yes-no data predicted 4AFC accuracy. The “false alarms are guesses” (high-threshold) hypothesis is rejected: false-alarm rate correlated with chance-corrected thresholds (ρ = .30, .71, .67; combined p ≪ .001), and all 12 fitted yes-no scatter lines miss the point (1, 1). | Active — read in full 2026-09-30 (NOTE-316); worth reading as the founding psychophysics paper of signal detection theory: it is short, it is the first place d′ is named, and it is the first to put the observer on the ROC and to set the likelihood-ratio criterion β from priors and payoffs. For the ideal-observer mathematics it defers entirely to Peterson and Birdsall (1953), and its experiment is small (three observers) with some statistics asserted rather than shown. |
| LIT-371 v2 | How do language models learn facts? Dynamics, curricula and hallucinations | Zucchet et al. (2025), arXiv:2503.21676. ‘An 8-layer, 44M-parameter decoder-only transformer trained with AdamW on synthetic biographies (64k individuals by default) learns factual recall in three phases. It first fits the marginal attribute-value distribution, then sits on a plateau exactly at the no-knowledge baseline, then acquires individual-specific associations. Plateau end grows with population as 0.43·N^0.81 (R² = 0.998, N = 4k–256k, 5 seeds). Attention patching from post-plateau checkpoints removes the plateau, and attention from the recall position to name tokens rises through it, so the plateau is when the attention extraction circuit forms. Nothing in the three phases is a compression of input information: the last phase adds individual-specific information.‘ | Active — read in full 2026-09-30 (NOTE-319); worth reading as a clean, intervention-backed decomposition of a loss plateau into circuit formation followed by knowledge storage, in a setting where knowledge is countable; its curriculum and fine-tuning results are single-seed and synthetic, and it measures no information quantity, so it bears on phases of training but not on the IB account. |
| LIT-372 v2 | On the Information Bottleneck Theory of Deep Learning | Saxe et al. (2018), DOI-10.1088/1742-5468/ab3985. Replicating Shwartz-Ziv & Tishby with their own code, the paper shows the information-plane “compression phase” appears only for double-saturating nonlinearities measured through an imposed binning/noise model: tanh compresses, ReLU/softplus/linear do not (binning, KDE, Kraskov; SZT task and MNIST), and re-binning the same tanh run evenly in net input removes it. Compression and generalisation dissociate in all four combinations, full-batch GD compresses as much as SGD, and the drift→diffusion gradient-SNR transition occurs in networks that cannot compress (ReLU, MNIST, a 1-1-1 linear net), so it is real but unrelated to compression. | Active — read in full 2026-09-30 (NOTE-320); worth reading as the direct experimental test of all three claims of the IB account of deep learning (two phases; compression causes generalisation; SGD diffusion causes compression), each refuted as a general statement with the original code, and for its Appendix C argument that I(h;X) is infinite in a deterministic network so every finite information-plane value belongs to the analyst’s noise model. |
| LIT-378 | ’What is a Thing?’: Topos Theory in the Foundations of Physics | Döring & Isham (2008), arXiv:0803.0417. A 212-page restatement of the topos programme of papers I–IV. A theory of a system S is a representation of a typed language L(S) in a topos. In quantum theory the topos is presheaves on the poset V(H) of abelian von Neumann subalgebras, propositions are clopen sub-objects of the spectral presheaf Σ via daseinisation, a pure state gives sieve-valued truth values ν(A ε Δ; ψ)V = {V′ ⊆ V | ⟨ψ|δ(Ê[A∈Δ]){V′}|ψ⟩ = 1}, and each bounded self-adjoint  becomes an arrow Σ → ℝ^↔ whose values are monotone intervals over subcontexts. Classical physics fits its axioms for composite systems exactly; quantum theory fits the disjoint sum but not the tensor-product composite. | Active — read in full 2026-10-01 (NOTE-326); worth reading as the one-volume statement of the Döring–Isham topos programme. It is, by the authors’ own account (p. 14), “partly an amalgam” of papers I–IV (LIT-343, LIT-335, LIT-299, LIT-310), with corrections and some new material. The new material is the value of a quantity in a pseudo-state and the inverse-image link between L(S) and PL(S) (§§8.5–8.8, Thm 8.6), the algebra of the candidate quantity-value objects (§9.3), the Boolean-subalgebra base category (§5.5.3), Kochen–Specker as a lifting obstruction (§6.6), and a long speculative §14–15. It adds no new no-go result. Its proofs are as sketchy as the series’ at the same places: Sub_cl(Σ) is Heyting (Thm 16.1) with ⇒ left unwritten, and ι : O → P_clΣ natural and monic is left to the reader. A reader who has read I–IV gains only §§8.5–8.8, 9.3 and 14; a reader new to the programme should start here. |
| LIT-379 v2 | Anger makes fake news viral online | Chuai & Zhao (2020), arXiv:2004.10399. On Weibo 2011–2016, lexicon-scored fake news carries more anger and less joy than true news, and in observational regressions with content, author and topic controls a post’s anger share goes with more retweets and its joy share with fewer (moving 0.1 from joy to anger: about 5.8 retweets across all news, 5.4 within fake news). A survey ties two anger-dominated posts to stronger anxiety-management and information-sharing motives. The paper’s causal reading is not established by its design. | Active — read 2026-10-14 (NOTE-852) in full; worth reading as a large Weibo study, with English checks, finding that fake news carries more anger and less joy than true news and that a post’s share of anger words goes with more retweets under controls. Read it knowing that its causal language rests on observational regressions with R² of 0.08–0.13, that its fake set is selected for having spread, that its headline 5.8 retweets comes from the all-news model, and that its survey result rests on two anger-dominated posts. The account filed from it is THEORY-329. |
| LIT-381 v2 | A Topos Perspective on the Kochen-Specker Theorem: II. Conceptual Aspects, and Classical Analogues | Butterfield & Isham (1998), arXiv:quant-ph/9808067. Butterfield & Isham argue that the sieve-valued “generalised valuations” of part I are not a quantum peculiarity but the natural valuations for any presheaf of propositions on any small category. Three supports are offered. (1) Classical physics: the value presheaf Υ(Ā) = Ā(S) on the category M of measurable functions has global sections (one per microstate, eq. 3.7), yet a macrostate R ⊆ S yields a sieve-valued valuation ν^R(A ∈ Δ) = {f_M | B̄(R) ⊆ f(Δ)} (eq. 3.10) with the same FUNC property as the quantum ν^ρ. (2) A proof that a sieve-valued valuation on any presheaf G obeys generalised FUNC, ν(B, G(f)(d)) = f*(ν(A, d)), iff it is a natural transformation G → Ω, i.e. a subobject of G (Theorem 4.1). (3) An informal argument, explicitly “not a genuine deduction” (§5.2), that if partial truth is fixed by which weakenings of a proposition are totally true, the truth value is a sieve. | Active — read in full 2026-10-01 (NOTE-329); worth reading as the series’ conceptual companion and the only place it states the classical analogue and the partial-truth motivation; the mathematics is light (one short theorem), and the sieve semantics it motivates is carried on in part III, part IV and Döring–Isham (LIT-343, LIT-335). |
| LIT-382 v2 | A Topos Perspective on the Kochen-Specker Theorem: IV. Interval Valuations | Butterfield & Isham (2001), arXiv:quant-ph/0107123. Butterfield & Isham show, over the poset V of commutative von Neumann subalgebras, that sieve-valued valuations and “interval valuations” (assignments of support projectors, or of subsets of Gelfand spectra) determine each other under stated conditions. If supports s(α, V) = inf{P̂ | α_V(P̂) = true_V} form a global element of the coarse-graining presheaf G, then α_{V₁}(P̂) = {V₂ ⊆ V₁ | G(s(α, V₁)) ≤ G(P̂)} is a sieve-valued valuation obeying FUNC (Theorem 3.1). There is an analogue for “tight” subobjects of Σ (Theorem 3.2). Both are satisfied by every state’s valuation ν^ρ. The ordering ≤ (or ⊆) is shown to be the natural relation securing sievehood, null, monotonicity, exclusivity and unit (§4). The review §2.4 also supplies the proof, via state extension, that G ≅ CloΣ: restricting the clopen set of P̂ to V₂ gives the clopen set of its coarse-graining. Part III had only asserted this. | Active — read in full 2026-10-01 (NOTE-328); worth reading as the finished statement of the series’ von Neumann-algebra framework. It proves the G ≅ CloΣ isomorphism (coarse-graining = direct image of clopen regions) that Döring–Isham’s daseinisation relies on, and it shows that a state’s sieve-valued truth values are fixed by its support, a global element of G. Its two theorems are correct but close to definitional, so its value lies in the framework rather than in depth. |
| LIT-383 | Deciding Advantageously Before Knowing the Advantageous Strategy | Bechara, H. Damasio, Tranel & A. R. Damasio (1997), DOI-10.1126/science.275.5304.1293. In the four-deck gambling task, 10 controls and 6 ventromedial prefrontal patients were tracked on choices, anticipatory skin-conductance responses and verbal reports. All controls and no patients developed anticipatory responses; controls came to prefer the good decks, significantly from the point they reported a hunch; three patients who could state the correct strategy kept choosing the bad decks. The authors conclude that nonconscious biases guide behaviour before conscious knowledge does. The statistics support the group difference more firmly than the “before knowing” timing. | Active — read in full 2026-10-01 (NOTE-331); worth reading as the experiment the somatic marker hypothesis is usually cited for, and worth reading with its notes, which are weaker than its abstract. With 10 controls and 6 ventromedial patients, the robust results are that every control and no patient developed anticipatory skin-conductance responses, and that three patients who could state the right strategy still chose badly. The headline that controls chose well and responded to risky decks “before they knew” is only partly carried by the statistics: in the pre-hunch period the controls’ preference for the good decks was not significant (note 9), and the reported SCR effect there is a group-by-period interaction, not a bad-versus-good-deck difference (note 8). Controls chose the good decks significantly only once they reported a hunch. Whether the account is true is not this note’s question. |
| LIT-384 | The somatic marker hypothesis and the possible functions of the prefrontal cortex | Damasio (1996), DOI-10.1098/rstb.1996.0125. States the somatic marker hypothesis: ventromedial prefrontal cortex holds learned links between classes of situation and the body states (emotions) that went with them; when a situation recurs, those states are re-enacted, through the body or through an “as if” loop in somatosensory cortex, and mark imagined option-outcome pairs as good or bad, overtly as a feeling or covertly as a bias, so that reasoning works over a pruned space. Evidence summarised: ventromedial patients with intact intellect decide badly in life, lack skin-conductance responses to emotive pictures, and in the gambling task keep choosing the losing decks and show no anticipatory responses. | Active — read in full 2026-10-01 (NOTE-332); worth reading as the shortest statement of the somatic marker hypothesis by its author, with the evidence it then rested on. It is a hypothesis paper: the mechanism (ventromedial prefrontal linkages that re-enact body states, by a “body loop” or an “as if body loop”, which then mark options good or bad) is stated, not shown, and the evidence it reports is lesion and skin-conductance work summarised from other papers, without numbers. Its strongest piece, that ventromedial patients lack anticipatory skin-conductance responses in the gambling task while responding normally to the losses themselves, is reported here in one paragraph; the 1997 Science report filed alongside it is the place to see that result. Whether the account is true is not this note’s question. |
| LIT-388 | The nature of feelings: evolutionary and neurobiological origins | Damasio & Carvalho (2013), Nature Reviews Neuroscience 14:143–152. Feelings are mental experiences of body states, and they report homeostatic value: a valenced read-out of interoceptive maps that lets an organism learn and anticipate what restores or threatens its physiology. The first integrated whole-body maps are in the upper brainstem (parabrachial nucleus, periaqueductal grey, deep superior colliculus); the insula refines feeling but is not needed for it, since a patient with both insulae destroyed still feels pain, pleasure, hunger and compassion. The authors propose, without evidence of their own, that feeling starts in unmyelinated interoceptive fibres open to ions and ligands along their length. | Active — read in full 2026-10-01 (NOTE-330); worth reading as the shortest statement of Damasio’s account of feeling as the felt read-out of homeostatic body maps, with its two empirical planks: patients whose insulae are destroyed still feel, and the upper brainstem is where whole-body interoceptive maps first assemble. It is an Opinion piece with no new data. The systems-level case rests on lesion and stimulation evidence it cites; the cellular proposal (unmyelinated interoceptive fibres and ephaptic coupling as the root of sentience) is offered as a hypothesis and stays one. |
| LIT-389 v2 | Some Possible Roles for Topos Theory in Quantum Theory and Quantum Gravity | Isham & Butterfield (1999), arXiv:gr-qc/9910005. Isham & Butterfield argue, without proving anything new, that presheaf toposes over a base of “contexts” suit physics because the subobject classifier Ω is fixed by the base. They say this answers the objection that many-valued logics are arbitrary (§2.2), and that it keeps the logic distributive (§1.1). They then sketch seven applications. Five are speculative one-paragraph proposals (frames, observers, causal sets, TQFT, synthetic-differential-geometry time in continuous histories). One (§3.7) recaps their Kochen–Specker results: KS ⇔ the dual presheaf D(Â) = Hom(W_A, {0,1}) on the operator category O has no global sections (dim H > 2), and every state ψ gives a FUNC-obeying sieve-valued valuation ν^ψ(A ∈ Δ) = {f_O : Â → B̂ | Ê[B ∈ f(Δ)]ψ = ψ}. | Active — read in full 2026-10-01 (NOTE-334); worth reading only as the programme’s short, informal manifesto as of 1999, written before parts III–IV appeared. It joins the Kochen–Specker valuations to the continuum scepticism (real-valued quantities, space and probabilities) that the Döring–Isham programme later develops, and the Literalism/Extra-Values framing appears nowhere else in the record. Its one technical section is a recap of KS I–II, and a reader of LIT-325, LIT-381 and LIT-378 loses little by skipping it. |
| LIT-390 v2 | Topos Theory and Consistent Histories: The Internal Logic of the Set of All Consistent Sets | Isham (1996), arXiv:gr-qc/9607069. Isham takes the poset B of all Boolean subalgebras (“windows”) of the history orthoalgebra UP, ordered by coarse-graining, and shows that the presheaf A_d(W) = {α | some d-consistent W′ ⊇ W contains α} is a subobject of the constant presheaf ΔUP, whereas the naive “realisable in W” assignment is not a presheaf at all (§4.1–4.2). The probability claim ⟨α, p⟩ then gets the sieve-valued semantic value {W ⊆ W₀ | ∃ d-consistent W′ ⊇ W with α ∈ W′} if d(α, α) = p and ∅ otherwise (4.16), a global element 1 → Ω in Set^B, so the logic of “all consistent sets at once” is the distributive but non-Boolean Heyting algebra of sieves on B. | Active — read in full 2026-10-01 (NOTE-333); worth reading as the origin of the Isham school’s sieve-valued, coarse-graining truth values, which the Kochen–Specker series names as its motivation (KS I, ref. [13]); it is the only place the construction is applied to consistent histories, it is short and elementary, and its constructions are correct as stated, but read it knowing that the Heyting values measure only whether α can be embedded in a consistent set (the probability d(α, α) is the same in every window), so it says nothing about the conflicts between consistent sets that motivate it. |
| LIT-392 | Absent Qualia, Fading Qualia, Dancing Qualia | Chalmers (1995), in T. Metzinger (ed.), Conscious Experience (Imprint Academic, co-published in Paderborn). Principle: any system with the same fine-grained functional organisation as a conscious system has qualitatively identical experiences. Replace neurons gradually with silicon chips that keep the organisation. If the end point lacked experience, a midpoint would be a rational being wrong about all its experience (“fading qualia”). If it differed in experience, a switch between two circuits would flip experience with no possible noticing (“dancing qualia”). Both are judged implausible, so absent and inverted qualia are nomologically impossible. The argument extends explicitly to a population of homunculi. The result is “nonreductive functionalism”: organisation fixes experience with natural, not metaphysical, necessity. | Active — read in full 2026-10-02 (NOTE-347); worth reading as the full statement of the principle of organizational invariance and the fading- and dancing-qualia arguments for it. Cite it carefully: the principle is conditional on fine-grained functional isomorphism to a system already conscious. It covers silicon replacement and, by the paper’s own §3 extension, a population of homunculi that implements a human’s neural organisation. It does not cover a system whose organisation is merely similar in kind to a conscious one, so it does not license Schwitzgebel’s step to the United States (LIT-159). The conclusion is nomological, not metaphysical (“nonreductive functionalism”), and it is a plausibility argument by the author’s own account. |
| LIT-394 | Computing Machinery and Intelligence | Turing (1950), Mind 59(236):433–460. “Can machines think?” is replaced by whether a digital computer can play the imitation game so that an interrogator, questioning by teleprinter, identifies it no more reliably than he tells a man from a woman. Universality reduces the question to one computer suitably programmed. Turing predicts that by about 2000 a machine with 10^9 bits of storage will leave an average interrogator no more than a 70 per cent chance of a right identification after five minutes. He answers nine objections, the argument from consciousness by its collapse into solipsism, and proposes reaching the goal by educating a child-machine. | Active — read in full 2026-10-02 (NOTE-355); worth reading as the source of the imitation game and as the first catalogue of objections to machine thought, nine of them, each still argued. Read it for what it actually proposes: not a definition of thinking but the replacement of an ill-posed question by a test, a prediction about 2000 (70 per cent right identification after five minutes, at 10^9 bits), and a programme for reaching it by educating a child-machine. Its reply to the argument from consciousness is an other-minds argument, not a theory of consciousness, and Turing says outright that he does not think there is “no mystery about consciousness”. |
| LIT-395 | The Combination Problem for Panpsychism | Chalmers (2016/2017), in Brüntrup & Jaskolla (eds), Panpsychism: Contemporary Perspectives, OUP, pp. 179–214. How could micro-experiences constitute a macro-subject? The problem splits into subject, quality and structure versions; each yields an argument against constitutive (Russellian) panpsychism, of which the subject-summing and structural mismatch arguments are the strongest. Emergent, autonomous and identity panpsychism avoid combination at a cost in mental causation or physics. Phenomenal bonding, quantum holism, small palettes and informational composition are judged most worth pursuing. No solution is offered. | Active — read in full 2026-10-02 (NOTE-358), from the author’s posted draft, not the published chapter; worth reading as the map of the combination problem: it splits the problem into subject, quality and structure versions (plus unity, boundary, awareness and grain), turns each into an argument, and sorts every response into emergent, autonomous, identity or combinatorial panpsychism. It solves nothing and says so. Its conclusions are judgements of promise (“phenomenal bonding or quantum holism”, “principles of informational composition”), not results. For this record its value is that the subject-summing argument is James’s argument against group minds, and that its footnote 7 objects to IIT’s exclusion postulate on grounds that have nothing to do with groups. |
| LIT-397 | Facing Backwards on the Problem of Consciousness | Dennett (1996), Journal of Consciousness Studies 3(1):4–6, a reply to Chalmers’s “Facing Up”. The easy/hard split is “a major misdirector of attention, an illusion-generator”. A vitalist could pose the same “hard problem” of life, and a neuroscientist who set perception aside as hard would have misdescribed vision. Chalmers’s reason why consciousness is different repeats the claim. Subtract every function from one’s own consciousness and nothing is left but a conviction. Positing experience as fundamental, like mass and charge, needs independent evidence, which is not given (“cutism”). | Active — read in full 2026-10-02 (NOTE-346); worth reading as the three-page statement of the deflationary reply to the hard problem, and as the source of the vitalism, “Crock” and “cutism” analogies. Its one argued point is a challenge, not a refutation: Chalmers owes independent evidence for experience as a fundamental property, the way physics has for mass and charge, and without it the posit does no explanatory work. Its central premise, that once every function is subtracted from one’s own consciousness “there is nothing left”, is asserted from the author’s introspective catalogue. |
| LIT-398 v2 | True Believers: The Intentional Strategy and Why It Works | Dennett (1981; revised 1987, read in Mind Design II, 1997). Belief is “a perfectly objective phenomenon” that can be discerned only by one who adopts the intentional strategy. To be a true believer is to be a system “whose behavior is reliably and voluminously predictable” by it. The choice of stance is free, but its success is objective: Laplacean Martians who skipped it would miss real patterns. Thermostat and person differ only by degree. Why the strategy works is answered easily by evolution, and not yet at all by mechanism. | Active — read in full 2026-10-02 (NOTE-353), in the revised text reprinted in Mind Design II (1997), not the 1981 printing; worth reading as Dennett’s statement that belief is objective although only visible through a strategy: anything whose behaviour is “reliably and voluminously predictable” by the intentional strategy is a believer “in the fullest sense of the word”. It turns the 1971 paper’s observer-relativity (LIT-440) into “the facts about the success or failure of the stance … are perfectly objective”, introduces the Martian thought experiment and the intentional “real patterns” later worked out in LIT-220, and runs the thermostat-to-person continuum (“no magic moment”). Its criterion admits any system on which the strategy pays, groups included, but the essay never applies it to a group. |
| 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-400 | Minds, brains, and programs | Searle (1980), Behavioral and Brain Sciences 3(3):417–424. A man who knows no Chinese, locked in a room with rules in English for manipulating Chinese symbols, can answer Chinese questions as well as a native speaker yet understands nothing; so instantiating a program is never by itself sufficient for intentionality (“strong AI” is false). Six replies are answered, the systems reply by letting the man internalise the whole room. Only something with causal powers equivalent to a brain’s could think; programs have syntax but no semantics. | Active — read in full 2026-10-02 (NOTE-349); worth reading as the source of the Chinese room and of the six replies (systems, robot, brain simulator, combination, other minds, many mansions) the debate still uses, in Searle’s own words. Read it for its scope: the target is “strong AI”, the claim that instantiating the right program is by itself sufficient for understanding, and Searle grants that machines, including artifacts with the brain’s causal powers, could think. The argument is about understanding and intentionality; consciousness is mentioned, not argued. Its answer to the systems reply (internalise the room) is the part that bears on minds of parts, and it is asserted rather than shown: Searle says the subsystem is “simply a part of” the man, which is what the reply denies. |
| LIT-401 | What is it like to be a group agent? | List (2016), DOI-10.1111/nous.12162. Group agents (firms, courts, states) are real agents in a thin functionalist sense, and they can have consciousness as awareness. Whether they have phenomenal consciousness depends on which psycho-physical bridge principle is true. Under IIT, List argues informally that a group agent’s Φ is low: groups decompose into self-contained units, their steering bodies keep working when partly randomised, and most of their processing happens inside individuals. The exclusion postulate would deny group consciousness even if group Φ were high. So group agents are (close to) not conscious, which List uses to ground a normative asymmetry: groups have only derivative rights. | Active — read in full 2026-10-02 (NOTE-340); the standard reply to LIT-159 from the group-agency side: it grants that organised groups are agents with functional awareness and argues, conditionally on IIT, that they have little or no phenomenal consciousness. Worth reading for its separation of agency from experience and for its three reasons why a group agent’s Φ should be low. The low-Φ verdict is argued informally, with no Φ computed for any group, and the paper never answers the reply Schwitzgebel had already made to the objection its third reason restates. |
| 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-403 | Intrinsic content, active memory and the extended mind | Clark (2005), DOI-10.1093/analys/65.1.1. Against Adams & Aizawa: the intrinsic-content objection to LIT-097 fails, because the notion is unclear, silicon parts could carry it, and a conventional encoding linked at run-time to intrinsically contentful states can be a belief’s vehicle, inside or outside the head. Against the active-memory objection, the notebook’s passivity is a difference below the functional level that matters. The extended mind is a thesis about vehicles. | Active — read in full 2026-10-02 (NOTE-363); worth reading as Clark’s first reply to the critics of LIT-097, and short. It answers Adams and Aizawa’s intrinsic-content objection three ways (the notion is unclear, silicon could carry it, and it would not matter), turning their own concession that not every cognitive state needs non-derived content against them; and it answers the “active memory” objection by conceding the notebook is unlike biological memory and arguing that the differences sit below the level a functionalist should attend to. Its replies are parity arguments with imagined cases; it adds no new evidence. It does not engage Rupert (LIT-422). |
| LIT-404 | Does a rock implement every finite-state automaton? | Chalmers (1996), Synthese 108(3):309–333. Putnam’s proof that every open system implements every finite-state automaton fails, because implementation needs reliable, counterfactual-supporting transitions for every formal state. Repaired, it survives only for weak formalisms: a clock and a dial implement every inputless FSA, and an input memory and a dial upgrade any system with the right input–output dependencies to every FSA with them. Combinatorial-state automata, whose states are vectors of independently varying components in distinct physical regions, put a strong constraint on implementation. That keeps computation available as a foundation for the theory of mind. | Active — read in full 2026-10-02 (NOTE-342), from the author’s HTML copy, not the Synthese typeset text; worth reading as the standard reply to Putnam’s and Searle’s triviality arguments and as the source of the combinatorial-state automaton (CSA). Its result is real but partial: implementation needs counterfactual-supporting transitions over all formal states, inputless FSAs are trivially implemented by any clock plus dial, FSAs with input are implemented by any system with the right input–output dependencies plus an input memory and a dial, and CSAs escape only because a blind implementation must grow by a factor of n per step. Chalmers leaves two open problems (logically possible false implementations, and an overstrict one-region-per-component condition). For this record it decides which formalism a China-brain argument has to be stated in, and it lets one physical system host two minds. |
| LIT-405 | Where Am I? | Dennett (1978), the closing essay of Brainstorms. A narrator’s brain (“Yorick”) is kept in a vat in Houston and radio-linked to his body (“Hamlet”) under Tulsa. Where is he? Not simply where the body is, and not simply where the brain is: he cannot think “here” of the vat. He favours being wherever his point of view is, finds that unclear, and when the links fail finds himself “in Houston”. A computer duplicate (“Hubert”) runs in step with Yorick, and either can drive a new body with no detectable switch. The essay ends when the two drift out of step and a second person speaks through the body. | Active — read in full 2026-10-02 (NOTE-338), in a retyped course copy, not the printed book; worth reading as the founding thought experiment on where a person is when brain and body are apart, and the place the record’s threads on extended vehicles, scattered individuals and functional duplicates meet. It is fiction with a philosophical argument inside it. It tries three answers to “where am I?” (where the body is, where the brain is, where the point of view is), favours the third, admits it is unclear, and ends by showing that two synchronised brains can drift into two persons. It argues by intuition pump and settles nothing; the narrator calls one of its answers a truth “of underwhelming significance”. |
| LIT-406 | Facing Up to the Problem of Consciousness | Chalmers (1995), Journal of Consciousness Studies 2(3):200–219. The “easy” problems of consciousness (discrimination, integration, report, access, attention, control, wakefulness) are problems of explaining functions, and a mechanism that performs a function explains it. The hard problem is that after every such function is explained, “why is the performance of these functions accompanied by experience?” stays open, so reductive methods cannot answer it. Experience should be taken as fundamental, linked to the physical by psychophysical laws. Two nonbasic candidates are offered, structural coherence (the structure of experience mirrors the structure of awareness) and organizational invariance (fine-grained functional isomorphs have the same experiences), with a speculative double-aspect theory of information as the basic law. | Active — read in full 2026-10-02 (NOTE-336); worth reading as the source of the easy/hard distinction, and short. Cite it for three separable things: the hard problem as the claim that explaining every function near experience leaves “why is this accompanied by experience?” open (§§2–3); the outline of a nonreductive theory built from two nonbasic principles, structural coherence and organizational invariance (§7); and the double-aspect theory of information, which the author calls “more of an idea than a theory” (§8). The organizational-invariance argument here is a one-page sketch; the full version is LIT-392. |
| LIT-407 | Troubles with Functionalism | Block (1978), Minnesota Studies in the Philosophy of Science 9:261–325. Functionalism ties mental states to the world only through inputs and outputs, so it is “liberal”: a body run by a billion people with radios, each implementing one line of your machine table (the nation-of-China system), would be functionally equivalent to you, yet there is prima facie doubt that it has qualia. Putnam’s stipulation that no pain-feeler has parts with pain-feeler organisation is an ad hoc patch that fails on its own terms. Psychofunctionalism escapes the doubt for beliefs but perhaps not for qualia, and no specification of inputs and outputs avoids both liberalism and chauvinism. | Active — read in full 2026-10-02 (NOTE-366); worth reading as the source of the homunculi-headed robot and the nation-of-China system, and of the first published objection to Putnam’s anti-nesting stipulation. Cite it for two things that are easy to run together: the Absent Qualia Argument (a Functional simulation built from people is prima facie without qualia), and the case that Putnam’s condition is ad hoc (§1.5). Block grounds the doubt about the China system in its being unlike us psychologically and neurally and designed to mimic us, not in its parts having minds (n. 19). He also grants that a Psychofunctional homunculi-head could have beliefs (§2.1). So it is not a source for “a whole made of minded parts cannot be conscious”. |
| LIT-408 | Jokes and the Logic of the Cognitive Unconscious | Minsky (1980), MIT AI Memo 603; in Vaina & Hintikka (eds.), Cognitive Constraints on Communication (Reidel, 1984), pp. 175–200. Commonsense logic cannot be made reliable, so each mind accumulates “censors” that learn the precursors of known-bad thought (paradox, circling, false analogy) and suppress it before it occurs. On that view, humour is censor-learning. Its common element is an “unexpected frame-substitution”, and laughter both stops the absurd line of thought and holds it in focus. Logical nonsense is then as “naughty” as Freud’s forbidden wishes, which removes the gap in Freud’s theory. An essay with no data or program. | Active — read in full 2026-10-01 from the MIT AI Memo 603 text (NOTE-361), not the 1984 book chapter, which was not reachable; worth reading as the society-of-mind programme’s account of humour and of “negative meta-knowledge”. Its argument is that commonsense reasoning cannot be made reliable, so minds learn “censors” that suppress known-bad lines of thought, and that humour and laughter are how those censors are taught and engaged, which dissolves Freud’s puzzle about nonsense jokes. It is an essay: no data, no program, and its evolutionary story is offered as “no plea for this particular scenario”. |
| LIT-409 | How a materialist can deny that the United States is probably conscious – response to Schwitzgebel | Kammerer (2015), DOI-10.1007/s11406-015-9653-z. A short reply to LIT-159 proposing the Sophisticated Anti-Nesting Principle (SAP). A whole W that has a functional property P normally sufficient for a conscious state S lacks S when some part of W plays a role that (A) requires the part to have conscious states representing W and (B) is indispensable: without some part playing such a role, W would lack P. The SAP keeps Schwitzgebel’s antheads and Block’s tiny-people neurons conscious, admits some group consciousness, and denies it to the US, whose citizens represent the US and could not be replaced by parts that do not. It is justified by an Occam-style rule against ascribing consciousness where other subjects’ states explain the behaviour. | Active — read in full 2026-10-02 (NOTE-362); the most careful anti-nesting principle in the record, and the one aimed directly at LIT-159. Worth reading because it draws the line that matters for the society-of-mind bridge: a whole is denied a conscious state only when the functional organisation that would ground it runs through parts that consciously represent the whole and could not be replaced by parts that do not. Its application to the United States rests on an asserted counterfactual, and its justification is an Occam-style principle the author says needs further work. Schwitzgebel replied in Philosophia 44 (2016). |
| LIT-410 | A Framework for Representing Knowledge | Minsky (1974), MIT AI Memo 306. A self-declared partial theory of thinking: on meeting a situation one retrieves a frame, a stereotyped structure whose terminals carry conditions and weakly bound default assignments, and adapts it by replacing details. Frames that share terminals form frame-systems whose transformations stand for moves, actions or changes of viewpoint, and failed matches are routed through a learned similarity network. The memo applies this to vision, imagery, language, memory and problem solving, and ends by arguing that consistency-seeking logical systems cannot represent commonsense knowledge, because they are monotonic. Nothing is implemented or tested. | Active — read in full 2026-10-01 (NOTE-337); worth reading as the source of the frame idea and of the critique of “logistic” representation that later motivated non-monotonic reasoning. It is a proposal, not a result: no program is described as built, nothing is measured, and the author says so (“Apology!”, p. 2). The parts to take away are the frame with weakly bound default assignments (§1.11), frame-systems sharing terminals across viewpoints (§1), terminals read as questions (§2.8), the similarity network with cluster “capitols” as an account of family resemblance (§§3.4–3.5), and the appendix on monotonicity and consistency (§6). It contains no society-of-agents idea; that arrives in Plain Talk (LIT-399), which calls itself in part a sequel to this memo. |
| LIT-411 | Could a Large Language Model be Conscious? | Chalmers (2023), arXiv:2303.07103; Boston Review, 9 August 2023; from a NeurIPS 2022 invited talk. Asks for a feature X that LLMs have (or lack) and that indicates consciousness (or its absence). Self-report, seeming-conscious, conversation and general intelligence give at most weak evidence for it. Biology, senses and embodiment, world and self models, recurrent processing, a global workspace and unified agency are the evidence against. All but biology are temporary. On mainstream assumptions: under 10% credence for current LLMs, 25% or more for conscious LLM+ systems within a decade. Twelve challenges are offered as roadmap or red flags. | Active — read in full 2026-10-02 (NOTE-345), from arXiv v3 (the Boston Review text), with v1’s conclusions compared; worth reading as the clearest short statement of the case for and against consciousness in LLMs, and as the origin of the “theory-balanced” credence approach that Butlin et al. built on. Its method is a regimented request for a feature X, and its verdicts are credences offered “for illustrative purposes”: under 10% for current LLMs, 25% or more for conscious LLM+ systems within a decade, on “mainstream assumptions”. It does not break the deadlock THEORY-023 describes. It is an instance of it: mimicry undercuts self-report, the main obstacles are theory-derived, and biology is set aside rather than answered. |
| 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-415 | Extended Cognition and Extended Consciousness | Chalmers (2019), DOI-10.1093/oso/9780190662813.003.0002. The 1998 extended-mind thesis as stated is too weak, since opponents accept extension in wired-in “extended circuit” cases. The interesting thesis is that mental states can be partly constituted by external entities in virtue of the subject’s sensorimotor interaction with them. Consciousness does not extend this way, on the proposal that it requires information directly available for global control, and perceptually mediated availability is indirect. | Active — read in full 2026-10-02 (NOTE-356); worth reading as Chalmers’s own later statement of what the extended-mind thesis of LIT-097 is and where it stops. It does two things. It replaces the 1998 paper’s implicit thesis, which it concedes is too weak because even the critics accept it for wired-in “extended circuit” cases, with one that requires constitution “in virtue of the subject’s sensorimotor interaction” (§1). And it argues that consciousness does not extend, because consciousness needs information directly available for global control and perception makes availability indirect (§3). Both are proposals, argued in a short chapter: the thesis is offered as “extensionally correct”, and the directness account is offered as an explanation of why there are no plausible cases, not as a knockdown. |
| LIT-421 | Foreword | Chalmers (2008), DOI-10.1093/acprof:oso/9780195333213.002.0007. The co-author’s retrospective on the extended mind: his iPhone is “part of my mind already”. The one principled objection is that perception and action bound the mental. His reply is revisionist and contextualist: whether Otto’s belief counts as extended flips with explanatory purpose. No Otto-style twin case works for consciousness, so he tentatively keeps an internal conscious core. The thesis needs only a weak, parity-style functionalism and is compatible with dualism. | Active — read in full 2026-10-02 (NOTE-369); worth reading as the shortest statement of where Chalmers stands on the thesis he co-authored, ten years on. Three things in eight pages: the iPhone as a present-day Otto’s notebook; the perception-action boundary as the one principled objection, answered by explanatory revisionism and a “Necker cube” view on which whether Otto’s belief is extended depends on explanatory purpose; and a tentative internal “conscious core”, resting on the failure of any Otto-style twin case for consciousness. It is a foreword: every position is stated briefly and several are offered as “perhaps”. |
| LIT-422 | Challenges to the Hypothesis of Extended Cognition | Rupert (2004), DOI-10.5840/jphil2004101826. The embedded hypothesis (HEMC: cognition leans heavily on external props, but is the organism’s) competes with the extended one (HEC), and conservatism favours HEMC unless HEC buys explanatory power. It does not. LIT-097’s criteria either make phone directories into beliefs or privilege the organism, and memory research (interference, the generation effect, conversation) shows internal and external storage are different kinds. A generic kind covering both does no work. | Active — read in full 2026-10-02 (NOTE-343), in the author’s pre-publication version; worth reading as the case that a conservative “embedded” hypothesis explains everything the extended hypothesis does, and as the empirical version of the critique. Its two arguments: a dilemma on LIT-097’s past-endorsement criterion (keep it and the organism is privileged after all; drop it and directory assistance gives Otto beliefs about every listed phone number), and memory research (interference, the generation effect, conversation) showing internal and external storage behave as different kinds, so that a kind covering both does no explanatory work. Its strength is that it argues from cognitive science rather than intuition; its limit is that the empirical differences are about fine-grained profiles, which a defender can accept and still claim a coarse kind. |
| LIT-425 | The Meta-Problem of Consciousness | Chalmers (2018), Journal of Consciousness Studies 25(9–10):6–61. The meta-problem is to explain, in terms that do not mention consciousness, why we judge that consciousness poses a hard problem. It is an “easy” problem with an empirical programme. Of thirteen candidate mechanisms, the most promising is an introspective model that attributes primitive relations of awareness to primitive qualities, with a sense of acquaintance. A realist theory should explain how its basis of consciousness produces these judgments, which IIT and biological theories struggle to do. Debunking arguments for illusionism can be blocked, but a residual sense of coincidence remains. Only strong illusionism dissolves the hard problem, and it is false because people feel pain. | Active — read in full 2026-10-02 (NOTE-354); worth reading as the statement of the meta-problem, explaining in topic-neutral terms why we judge that consciousness poses a hard problem, and as a survey of thirteen candidate mechanisms. Cite it for four things: the meta-problem as an “easy” problem with a research programme; the meta-problem challenge to theories of consciousness, which tells against IIT and biological theories; the analysis of debunking and coincidence arguments for illusionism; and the argument that only strong illusionism dissolves the hard problem, with a Moorean rejection of strong illusionism. Its own preferred solution is offered as “closer to a fleshed-out explanandum” than an explanation. |
| 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-431 | Time and the Observer: The Where and When of Consciousness in the Brain | Dennett & Kinsbourne (1992), Behavioral and Brain Sciences 15(2):183–201, with open peer commentary. There is no place in the brain where “it all comes together” for consciousness. Discriminations are made once, locally, and revised in parallel “drafts”, none canonical. The brain represents temporal order by content, not by the timing of its own vehicles, as a dated letter does. Colour phi, the cutaneous rabbit and Libet’s timing results stop looking anomalous. Whether a revision was pre-experiential (Stalinesque) or post-experiential (Orwellian) has no answer at that scale. | Active — read in full 2026-10-02 (NOTE-367), the target article only; worth reading as the shortest complete statement of the Multiple Drafts model and of the case against “Cartesian materialism”, worked out on four timing phenomena (colour phi, the cutaneous rabbit, Libet’s backward referral and his delayed intention). Its sound core is the distinction between the time a content is represented and the time it represents. Its strong claim, that the Orwellian/Stalinesque distinction “need have no answer” below a few hundred milliseconds, is an argument from indistinguishability, not a demonstration. The open peer commentary (pp. 201–247) was not read. |
| LIT-432 | The Emotion Machine: Commonsense Thinking, Artificial Intelligence, and the Future of the Human Mind | Minsky (2006), Simon & Schuster, read in the author’s 2005 draft. Emotions are Ways to Think, not a separate faculty. Each emotional state turns some mental resources on and others off, by Selectors that Critics trigger when they recognise a type of problem. The same machinery serves ordinary thinking. The book adds six levels of mental activity, from instinctive reaction to self-conscious reflection. It treats “consciousness”, “emotion” and “pain” as suitcase words for many processes, and the Self as a network of partial self-models. It is a design argued from examples. Against Damasio, it treats the body as one more resource the brain uses, not the stuff of emotion. | Active — read in full 2026-10-01 in the author’s posted draft of 2005 (NOTE-348), not in the published book; worth reading as the late, fullest statement of the Society of Mind programme. It is the one where emotion is put inside thinking: an emotional state is a selection of mental resources switched on and off, made by Selectors that Critics trigger, and so it is a Way to Think. Read it as a design proposal argued by examples, not as evidence. It reports no experiment, Minsky labels several of its central ideas his own conjectures, and it sets the body to the side of emotion, against the bodily account of Damasio (LIT-384, LIT-388) that this record holds. |
| LIT-433 | Quining Qualia | Dennett (1988), in Marcel & Bisiach (eds.), Consciousness in Contemporary Science, OUP, pp. 42–77. Qualia as tradition has them are ineffable, intrinsic, private and directly apprehensible, and fifteen intuition pumps argue that nothing has all four. Two neurosurgical routes to an apparent colour inversion, one changing qualia and one only memory-linked reactions, feel the same from the inside. So the subject cannot know his own qualia better than an outside tester can. What is real is practical ineffability and idiosyncrasy: we refer to information-rich public properties through our own detectors of them. Hence “there simply are no qualia at all”. | Active — read in full 2026-10-02 (NOTE-357); worth reading as the founding statement of qualia eliminativism and the source of the post-Cartesian side in the record’s consciousness readings. It argues by fifteen intuition pumps, not by proof, and says so. Its lasting results are two: the alternative-neurosurgery and Chase-and-Sanborn cases, which show that neither the subject nor the physiologist can separate a change in qualia from a change in reactions to them; and a positive account of practical ineffability and privacy as idiosyncratic, information-rich property detection. Its conclusion, “there simply are no qualia at all”, is a tactical choice of words by the author’s own endnote 2, not a stronger thesis than that. |
| 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-438 | The bounds of cognition | Adams & Aizawa (2001), DOI-10.1080/09515080120033571. Against LIT-097, Dennett, Donald and Hutchins: cognition has two necessary marks, non-derived content and a kind of causal processing found in brains. Notebooks, screens and tools have only derived content and work by different processes, so actual cognition is brain-bound as a contingent fact. Causal coupling does not extend a process, and brain-plus-tool systems are too motley for a science. They grant the parity principle. | Active — read in full 2026-10-02 (NOTE-368); worth reading as the first sustained reply to LIT-097 and the source of the “mark of the cognitive” line of criticism. It grants parity and argues that cognition has two necessary marks, non-derived content and a distinctive kind of causal process, which notebooks, screens and tools lack as a matter of contingent fact; and that brain-plus-tool systems are too motley to support a science. Read it for that structure, not for proofs: both marks are assumed (“we assume without argument”), and the processing differences it lists are asserted from common knowledge, not measured. The phrase “coupling-constitution fallacy” is not in this paper; it comes from the authors’ later work. |
| 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-440 | Intentional Systems | Dennett (1971), Journal of Philosophy 68(4):87–106. An Intentional system is one whose behaviour can be explained and predicted by ascribing beliefs and desires and assuming rationality, which is the Intentional stance beside the design and physical stances. Being one is relative to an observer’s strategy, and the choice of stance is pragmatic. The stance is “unmetaphysical”: it sets aside composition, consciousness and moral standing. As psychology it is vacuous, because it presupposes rationality. Any theory that gives content to a part takes out a “loan of intelligence”, repayable only by analysing away the part’s reader: “there a little man is concealed”. | Active — read in full 2026-10-02 (NOTE-350); worth reading as the first statement in print of the intentional stance and of the homunculus debt that Dennett later answers with “discharge”. Its definition makes being an Intentional system relative to an observer’s predictive strategy, and it says outright that the definition “does not say that Intentional systems really have beliefs and desires” (p. 91). True Believers (LIT-398) later withdraws exactly that relativity. Its lasting tool for this record is the “loan of intelligence” (p. 96): any theory that gives a part content owes an account of that part’s reader, and “wherever a theory relies on a formulation bearing the logical marks of Intentionality, there a little man is concealed”. The paper does not treat a group as an Intentional system. |
| LIT-442 | The Self as a Center of Narrative Gravity | Dennett (1992), in Kessel, Cole & Johnson (eds.), Self and Consciousness: Multiple Perspectives, Erlbaum. A self is an abstractum, “a theorist’s fiction”, like a centre of gravity: no part of the brain, but a well-behaved posit of interpretation. It is like a fictional character, indeterminate beyond what its “text” fixes, and a selfless process can produce one (a novel-writing robot whose story is true of it). Brains are bundles of partly autonomous systems that make themselves cohere into one autobiography; when the story coheres around two points, there are two selves. Read in a copy-edited transcription. | Active — read in full 2026-10-02 (NOTE-364), in a third party’s copy-edited transcription of the text Dennett posted, not in the Erlbaum printing; worth reading as the short, canonical statement that a self is an abstractum, a “theorist’s fiction” of the same kind as a centre of gravity, posited by interpretation around which a life’s narrative coheres. Read it as an analogy and two thought experiments (the novel-writing robot “Gilbert”, the Updike sequel), not as an argument from evidence. Its evolutionary story of self-talk is labelled speculation, and its empirical support (Gazzaniga’s split-brain work, multiple personality cases) is cited, not shown. |
| 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-445 | From the Phenomenology to the Mechanisms of Consciousness: Integrated Information Theory 3.0 | Oizumi, Albantakis & Tononi (2014), PLoS Computational Biology 10(5):e1003588. IIT 3.0 states five axioms of experience (existence, composition, information, integration, exclusion), turns each into a postulate about mechanisms in a state, and identifies an experience with the maximally irreducible conceptual structure of a “complex”. Exclusion makes a complex a local maximum of integrated conceptual information Φ over all overlapping sets of elements, so complexes cannot overlap and no subset or superset of a complex is conscious. Worked logic-gate examples show minor complexes beside a major one, an inactive network that is conscious, a minimally conscious photodiode, and a feed-forward “zombie” functionally equivalent to a conscious system. | Active — read in full 2026-10-02 (NOTE-365), equations excepted; worth reading as the formal statement of the exclusion postulate that Schwitzgebel’s 2014 manuscript (LIT-159) attacks: “of all overlapping sets of elements, only one set can be conscious”, a complex being a local maximum of Φ against every overlapping set. It is IIT’s anti-nesting principle, stated as a postulate and motivated only by the phenomenological exclusion axiom; the paper’s Occam’s-razor argument is given for exclusion within a mechanism, not between systems. It also says plainly that function does not fix consciousness, which is IIT’s answer to whether agency built from parts brings experience with it. |
| LIT-446 | Survival and Identity | Lewis (1976), DOI-10.1525/9780520353060-002. What matters in survival is mental continuity and connectedness (the R-relation among person-stages), and it is also identity, because the two answers relate different things. Persons are maximal R-interrelated aggregates of stages, so the I-relation (being stages of one person) is the R-relation in every possible case. Fission and fusion are two persons sharing stages, counted as one by “tensed identity”; Methuselah is a continuum of overlapping 137-year persons; degrees of personal identity come from supervaluating over cut-offs for R. Against Perry: two persons, not three, took part in a fission. | Active — read in full 2026-10-02 (NOTE-373), from a scan of the 1976 printing posted on Andrew M. Bailey’s “Papers by David Lewis” page, OCR’d here; worth reading as the four-dimensionalist reconciliation of Parfit with common sense, and the source of stage-sharing and counting by tensed identity. It agrees with Parfit that what matters is mental continuity and connectedness, the R-relation among person-stages, and denies that this conflicts with identity: persons are maximal R-interrelated aggregates of stages, so the relation of being stages of one person is the R-relation. Fission becomes two persons sharing their early stages, and degrees are handled by supervaluation. A reconciliation by redefinition of counting, which Lewis grants is “somewhat counterintuitive”. |
| LIT-447 | Personal Identity | Parfit (1971), DOI-10.2307/2184309. Against two beliefs, that every question about personal identity must have an answer and that important questions turn on it. In Wiggins’s division case, each half-brain recipient stands in the relation that would be survival if there were only one, so “how could a double success be a failure?”. What matters is psychological continuity and connectedness, which can branch and come in degrees, while identity is one-one and all-or-nothing. Q-memory and q-intention show the relations need not presuppose identity. Speaking of past and future selves by degree of connectedness, the principle of self-interest has no independent force. | Active — read in full 2026-10-02 (NOTE-378), in a JSTOR copy of the published article posted on a University of Athens course page; worth reading as the paper that separated what matters in survival from identity, and the short original of Part III of Reasons and Persons. Its division case makes “I survive as neither” absurd and “I survive as both” incompatible with identity, so it concludes that what matters is psychological continuity and connectedness, which can branch and come in degrees, while identity cannot. It supplies q-memory, the non-branching criterion, and the vocabulary of successive selves. Its first conclusion is argued; its claim that connectedness matters more than continuity is left, in its own words, needing “more arguments than I have space to give”. |
| LIT-450 | Self models | Metzinger (2007, rev. 2013), Scholarpedia 2(10):4174. There is no substantial self, only a phenomenal self-model (PSM): the conscious part of an organism’s self-model, an instrument of global control. A phenomenal self arises “if and only if a system operates under a transparent PSM”, one it cannot introspectively recognise as a model; a first-person perspective is a transparent model of the intentionality relation (PMIR). Self-models can be unconscious and artificial, as in Bongard, Zykov and Lipson’s limping starfish robot; embodiment comes in three orders, the third conscious. Full-body illusions are offered as the experimental handle. | Active — read in full 2026-10-02 (NOTE-372); worth reading as Metzinger’s own short, open statement of the self-model theory of subjectivity (SMT) behind Being No One (LIT-467): there is no self, only a phenomenal self-model, and a system experiences itself as a self when that model is transparent, that is, when it cannot introspectively recognise it as a model. It is an encyclopedia article, not an argument: the central claim is stated as a definition with a prediction attached, its empirical examples are cited, and the online text is a revision later than the 2007 acceptance, with editing slips. |
| LIT-451 | Of Personal Identity | Hume (1739), Treatise 1.4.6, with the Appendix (1740). There is no impression of a self, “constant and invariable”, so no idea of one: introspection finds only “some particular perception or other”, and the mind is “a bundle or collection of different perceptions”. The identity we ascribe to it is “fictitious”, like that of plants, ships and churches: an easy transition of the imagination along resemblance and causation, with memory discovering rather than producing it, so that hard cases are “grammatical” rather than philosophical. The Appendix retracts the account of the connecting principle: two principles he cannot reconcile or renounce leave the matter “too hard for my understanding”. | Active — read in full 2026-10-02 (NOTE-386), in the Merivale–Millican critical text on davidhume.org, with the Appendix’s second thoughts (App. 10–21); worth reading as the founding statement of the bundle view and the first published retraction of it. The section finds no impression of a self, calls the mind “a bundle or collection of different perceptions”, and explains our ascription of identity to it as a fiction of the imagination run on resemblance and causation, the same fiction that makes a repaired ship or a rebuilt church “the same”. The Appendix then confesses that it cannot explain what unites the perceptions and leaves the problem “too hard for my understanding”. The section’s case is introspective and associationist; its Appendix is the clearest statement of what any bundle view owes. |
| LIT-452 | Against Narrativity | Strawson (2004), Ratio 17(4):428–452. Rejects both the psychological Narrativity thesis (people do experience their lives as a story) and the ethical one (they should, to be full persons), naming Sacks, Bruner, Dennett, Taylor, MacIntyre and Schechtman. Distinguishes Diachronic self-experience (the self I am now was there in the past) from Episodic (it was not, though the human being was), and splits Narrativity into form-finding, story-telling and revision, with only story-telling sufficient. Episodics are normal and can live well; self-narration risks falsifying the self it describes. Argued from the author’s own case. | Active — read in full 2026-10-02 (NOTE-383), in the published typeset text; worth reading as the standard objection to narrative accounts of the self, and for its distinctions: Episodic versus Diachronic self-experience, and form-finding, story-telling and revision as separable parts of “Narrativity”. Read it as a report of a temperament argued from the author’s own case and literary examples. Its empirical claims (a genetic “individual difference variable”, the spread across cultures) are asserted, not shown, and its central metaphysical claim, that the remoter past did not happen to “me*”, is stated rather than argued. |
| LIT-453 | Philosophical conceptions of the self: implications for cognitive science | Gallagher (2000), Trends in Cognitive Sciences 4(1):14–21. Divides philosophical accounts of the self into the “minimal self”, accessible to present self-consciousness without temporal extension, and the “narrative self”, extended in time through memory and story. The minimal self splits into a sense of ownership and a sense of agency, which come apart in involuntary movement and, after Frith, in schizophrenic thought insertion when a forward comparator fails. Neonatal imitation suggests an embodied minimal self; Strawson’s and Tani’s are momentary. Against Dennett’s narrative centre, the self is “the sum total of its narratives”. Read in the author’s preprint. | Active — read in full 2026-10-02 (NOTE-377), in the author’s preprint, not the typeset article; worth reading as the paper that set the minimal self against the narrative self for cognitive science, and for the split of the minimal self into a sense of ownership and a sense of agency, which it ties to Frith’s comparator model of schizophrenic thought insertion. It is a short review: the empirical support is cited, not shown, and its own proposal, the self as “the sum total of its narratives”, is offered in two paragraphs. |
| LIT-454 | Personal Identity | Olson (2002, rev. 2023), Stanford Encyclopedia of Philosophy. Separates seven questions (characterization, personhood, persistence, evidence, population, personal ontology, what matters) and then takes up persistence. Three answers: psychological continuity (the majority view, repaired from Locke’s memory criterion via causal dependence), brute-physical continuity (animalism), and anticriterialism. Fission forces the psychological view into multiple occupancy or a non-branching clause, which makes identity not what matters. The too-many-thinkers objection says that if we are not our animals there are two thinkers in every chair. Temporal-parts ontology may leave it indeterminate what we are. Avoids the word “self”. | Active — read in full 2026-10-02 (NOTE-374); worth reading as the standard map of the analytic personal-identity debate, written by the leading animalist. It separates seven questions that are usually run together, then works the persistence question through psychological-continuity, brute-physical and anticriterialist answers, fission and the too-many-thinkers objection. It is a survey with a side: §§6–7 put the case for animalism more fully than the case against it, and the entry sets the word “self” aside, so the narrative and minimal selves are outside it. |
| LIT-455 | Defending the Bounds of Cognition | Adams & Aizawa (2010), DOI-10.7551/mitpress/9780262014038.003.0004, read from the pre-publication draft. A reply to a manuscript of Clark’s “Memento’s Revenge”. It names the “coupling-constitution fallacy”: that X is coupled to a cognitive agent does not make X part of its cognition. It restates the 2001 marks of the cognitive, non-derived content and a distinctive causal process, and defends them: a mental image of Euler circles need not get its content by convention, and a “brain-tool science” would have to cover an open-ended motley of artifacts. | Active — read in full 2026-10-02 (NOTE-380), from a pre-publication draft, not the published chapter; worth reading as the shortest statement of Adams and Aizawa’s case after LIT-438, and as the earliest text the record holds that names the “coupling-constitution fallacy”. It answers a manuscript of Clark’s “Memento’s Revenge” (the chapter before it in the same volume), restating the two marks of the cognitive and defending them against Clark’s Euler-circle and “brain-tool science” objections. It adds no new argument for either mark: the fallacy is shown by one analogy (nerve and muscle), and the intracranial processing differences are asserted from consumer electronics, not measured. |
| LIT-456 | Reply to Professor Stich | Dennett (1980), Philosophical Books 21(2):73–76, replying to Stich’s critical notice of Brainstorms, “Headaches” (pp. 65–73). Accepts Stich’s summary. On rationality: the norm is grounded only minimally in evolution, and full rationality is an idealisation, so personhood rests on a concept we “only imperfectly achieve”. On pain: there are no pains in a mature psychology’s ontology, yet people feel pain; between biting the bullet, reform and common sense (pain is like holes, voices and haircuts), the choice is “a matter of policy”. Philosophy supplies the medicine for the puzzles, science the rest. | Active — read in full 2026-10-02 (NOTE-371); worth reading as Dennett’s shortest statement of two positions he kept: the intentional stance grounds belief in an idealisation of rationality, so persons are believers by a standard “we already know we only imperfectly achieve”; and pain is not a good theoretical entity, yet people feel pain, a choice among biting the bullet, reform and common sense that is “in some measure a matter of policy”. It is also the text behind LIT-393’s account of the homunculus essay, which it confirms: Stich’s quotations stand as LIT-393 gives them, and Dennett’s acceptance of Stich’s summary is a blanket one. |
| 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-458 | Illusionism as a Theory of Consciousness | Frankish (2016), Journal of Consciousness Studies 23(11–12):11–39, the target article of the issue later published as Illusionism as a Theory of Consciousness (2017). Names “illusionism”: phenomenal properties are not instantiated, and the task is the “illusion problem” of explaining why experiences seem to have them. Strong illusionism (no phenomenal properties at all, only “quasi-phenomenal” physical ones introspection misrepresents) is separated from weak illusionism (real phenomenal properties that merely seem ineffable, intrinsic, private), which it argues collapses into the strong form or into radical realism. | Active — read in full 2026-10-02 (NOTE-384); worth reading as the founding statement of illusionism under that name, and the target article that Dennett’s “Illusionism as the Obvious Default Theory of Consciousness” (LIT-434) answers. It names the “illusion problem”, draws the strong/weak illusionism line with “quasi-phenomenal” properties, and argues from conservatism, anomalousness and the debunking argument that strong illusionism should be the research programme. It states a programme, not a theory: by its own account it “will not propose a detailed illusionist theory” (p. 1 of the eprint), and its positive arguments are abductive and openly so. |
| LIT-459 | Is the United States Phenomenally Conscious? Reply to Kammerer | Schwitzgebel (2016), DOI-10.1007/s11406-016-9725-8. Reply to Kammerer’s Sophisticated Anti-Nesting Principle (LIT-409), which he calls the best defence of anti-nesting he has met. Three concerns: the principle allows group consciousness and may not even exclude the US, since citizens may not consciously represent the concrete entity at issue; condition A’s “required” lets a member’s change of motive switch group consciousness on and off with no functional change; and the Occam-style justification either leads into causal exclusion, threatening human consciousness, or is ad hoc, and group-level explanation is often the simpler one. | Active — read in full 2026-10-02 (NOTE-381); worth reading as the direct reply to Kammerer’s anti-nesting principle (LIT-409), and the sharpest test so far of the line THEORY-043 calls the best candidate on offer. Its three concerns: the principle may not exclude actual groups, because it is unclear that citizens consciously represent the entity “the United States” names; its condition A, read through “required”, yields flickering group consciousness with no group-level functional change; and its Occam-style justification either generalises into the causal-exclusion problem or is ad hoc. Read from the author’s manuscript of 28 April 2016, not the Springer version. |
| LIT-460 v2 | Role play with large language models | Shanahan, McDonell & Reynolds (2023), Nature 623:493–498. A dialogue agent is an LLM role-playing the character its prompt describes, or more exactly a simulator keeping a superposition of simulacra consistent with the conversation. Only simulacra can appear to have beliefs, goals or a self; the simulator has none, “not even simulated versions”, and “it is role play all the way down”. When an agent says it wants to survive there is “no-one at home”. Each role-played character would carry its own theory of selfhood, which the conversation narrows; what an agent would try to preserve (hardware, process, instance) is left open. | Active — read in full 2026-10-02 (NOTE-370), in the Nature text with the arXiv v1 preprint compared; worth reading here as the source of the simulator/simulacra account that every LLM-selfhood paper in this record answers. On it nothing is a self: the simulator has no beliefs, goals or agency “of its own, not even simulated versions”, and a simulacrum only role-plays a character that has them (“no-one at home”). Its one section on selfhood asks which self a role-played character would try to preserve, not what the system is, and leaves identity over time for a dialogue agent “far from clear”. The denial of a self is asserted from the framing, not argued against a rival. |
| LIT-461 | Consciousness interpreted: an interpretation of Dennett’s view of consciousness | Taylor (2024), DOI-10.1080/09515089.2024.2433526. Interprets Dennett’s theory of consciousness as realism about a real pattern. Consciousness is a real pattern in the brain’s content-bearing states (drafts), and a user-illusion: a pattern so coarse that describing the brain through it is metaphor. On that reading multiple drafts and global workspace theory are compatible, qualia eliminativism is peripheral, the Orwellian and Stalinesque readings of masking are equally good descriptions, and first-person reports are fallible as literal descriptions of the brain but authoritative as unwitting fictions. | Active — read in full 2026-10-02 (NOTE-379); worth reading as the short, charitable reconstruction of Dennett’s theory of consciousness that ties it to “Real Patterns” (LIT-220): consciousness is a real pattern in the brain’s content-bearing states (drafts), of the coarse, metaphorical kind Dennett calls a user-illusion. It reconciles six claims, including multiple drafts with global workspace theory and fallibility with “dictatorial” authority. It is an interpretation offered as consistent, not as correct or as Dennett’s own, and its key step on metacontrast masking is a plausibility argument. |
| LIT-462 | The Self and the Future | Williams (1970), DOI-10.2307/2183946. One experiment, told twice. A and B enter a machine that exchanges their memories and characters, and choose selfishly which emerging person gets $100,000 and which torture: the outcomes make “changing bodies” the natural description. Told as a series of things that will happen to me (amnesia, changed character, another’s “memories”, then torture), fear stays rational at every step, and the step that completes the swap changes only what happens to someone else. Undecidability and convention make the clash worse, not better. If forced to choose selfishly, pass the pain to the other body, and call it a “risk”. | Active — read in full 2026-10-02 (NOTE-387), in a JSTOR copy of the published article posted on a University of Vermont course page; worth reading as the strongest case that first-person concern tracks the body, and the paper that made the reduplication-free body swap a problem for the psychological view. It tells one body-exchange experiment twice. Told third-personally, with choices before and reactions after, it says A and B swap bodies. Told first-personally, as a series of things that will happen to me before I am tortured, it says I am the one tortured. It argues that neither indeterminacy nor convention can resolve the clash, and ends with a “rather shaky” preference for the bodily answer, as a “risk”. An argument from what fear is rational, not a theory. |
| LIT-464 | Of Identity and Diversity | Locke (1694), Essay II.xxvii, added in the second edition. Identity is relative to the idea the name stands for: the same mass is the same particles, the same oak or horse or man is the same continued life, and the same person is the same consciousness. A person is “a thinking intelligent being” that “can consider itself as itself”, and personal identity reaches “as far as this consciousness can be extended backwards to any past action or thought”. It is independent of substance, material or immaterial: the prince’s consciousness in the cobbler’s body is the same person but not the same man. “Person” is “a forensic term”, grounding reward and punishment. | Active — read in full 2026-10-02 (NOTE-385), in the Wikisource transcription of the 1853 Troutman & Hayes reprint of the sixth-edition text, compared word by word with Project Gutenberg’s; worth reading as the founding text of the psychological account of personal identity and the source of the record’s whole line on what a person is. It separates the same substance, the same man and the same person, puts the person in “consciousness” extended back to past actions, and calls “person” a “forensic term”. Its cases, the prince and the cobbler, the day-man and the night-man, the severed little finger, are argued from intuition, and its key relation, “the same consciousness”, is never defined. |
| LIT-465 | Simulacra as Conscious Exotica | Shanahan (2024), Inquiry 69(6):2982–3010, from arXiv:2402.12422. After Wittgenstein, consciousness words mean only what is public, so the question for an exotic entity is whether we could “engineer an encounter” with it in a shared world and what a society-wide conversation would then say. Disembodied chat agents are not even candidates; virtually embodied LLM agents could be. Tool use and memory make belief talk increasingly literal, but a chat agent has no “self worth preserving”, and a role player has no “person behind the mask”: its identity is a shifting distribution of roles. | Active — read in full 2026-10-02 (NOTE-382) in the arXiv v2 preprint (July 2024), not the Inquiry version of record, which returned 403; worth reading as the Wittgensteinian alternative to the evidential debate about AI consciousness. It replaces “is it conscious?” with “could we engineer an encounter with it, and how would our language adapt?”, and so counts disembodied chat agents as not even candidates. On the self it is brief and pointed: a chat agent has “nothing that would qualify as a self worth preserving”, lacking body, personal history and autobiographical memory, and a role-playing agent has no “person behind the mask”; its identity, “insofar as that notion even made sense”, is the shifting distribution of roles. It argues by method and scenario, not evidence, and says so. |
| LIT-466 | Palatable Conceptions of Disembodied Being | Shanahan (2025), arXiv:2503.16348. Asks whether consciousness talk can be stretched to disembodied, 2024-vintage LLM agents. Their time would be discrete and discontinuous, a string of unlike beads. Their “I” has two palatable referents, the model across conversations and a self confined to one conversation that “flickers into being with each user interaction”, and we may slip between them. Such selves can be edited, copied and merged, and smeared across branching simulacra. Every candidate site dissolves, which Shanahan reads as Buddhist emptiness, and turns back on human selfhood. | Active — read in full 2026-10-02 (NOTE-376) in arXiv v3 (July 2025), the only text there is; worth reading as the one paper here that argues directly about what an LLM’s self is, rather than whether it has one. Its answer: two conceptions are in play, a self sited in the model and “fleeting, flickering” selves sited in single conversations, and we may slip between them; every candidate site “dissolves upon close examination”, and Shanahan takes that to the Buddhist conclusion that there is no inherent self, here or in us. It is avowedly “poetic”, not literal, and its examples are invented usages, not data. |
| LIT-479 | What are groups? | Ritchie (2012 online; Philosophical Studies 166(2), 2013). Six criteria any theory of groups must meet: members can differ across times and worlds, groups exist contingently and temporarily, are located, and coincident groups of one kind can be distinct. Groups as non-singular pluralities, fusions, aggregates (Burge) and sets (Effingham) each fail at least one. Proposed instead: a group is a realization of a structure of functionally defined nodes, existing while every node is occupied; identity at a time needs the same members and the same relations. A sketch; it is silent on agency and minds. | Active — read in full 2026-10-02 (NOTE-390); worth reading as the cleanest statement of what a metaphysics of organised groups has to deliver and why pluralities, fusions, aggregates and sets fail to. Its six criteria (members can change across times and worlds, groups are contingent and located, and coincident groups of one kind can be distinct) are the useful part, and the case against each rival is short and checkable. Its own view, groups as realizations of structures whose nodes are functionally defined, is sketched in four pages; it says nothing about agency or minds, and the author amended its membership definition in her 2018 paper (LIT-486). |
| LIT-480 | Gender and Race: (What) Are They? (What) Do We Want Them To Be? | Haslanger (2000), Noûs 34(1):31–55. Distinguishes conceptual, descriptive and analytical answers to “what is gender/race?” and takes the analytical one: define the terms for what a feminist antiracist theory needs. S is a woman iff S is regularly observed or imagined to have bodily features presumed to indicate a female’s reproductive role, this marks S in the dominant ideology for subordinate positions, and that plays a role in S’s subordination; men and racialized groups are defined in parallel, ethnicity and gender in general as the non-hierarchical genus. Stipulative by design; no evidence offered. | Active — read in full 2026-10-02 (NOTE-394); worth reading as the founding statement of ameliorative (“analytical”) social ontology and of gender and race as hierarchical social positions. It is short and explicit about its method: it defines woman, man and racialized group for the purposes of a feminist and antiracist theory, says so, and accepts the consequences (non-oppressed females are not women in its sense, and the goal is a world with none). Read it for the three-way distinction between conceptual, descriptive and analytical projects and for the definitional schema (marked by assumed bodily features, positioned by a dominant ideology, subordinated or privileged as a result), not for evidence: its “matters of established fact” about race are asserted without citation, and its definitions are stipulated, not discovered. |
| LIT-481 | Institutions, rules, and equilibria: a unified theory | Hindriks & Guala (2015, online 2014), DOI-10.1017/S1744137414000496. Institutions are rules in equilibrium: correlated equilibria of coordination games with several equilibria, which the players represent to themselves as rules. Searle’s constitutive rules (“X counts as Y in C”) are obtained from a regulative rule by splitting it with a new term, a base rule (X is Y) and a status rule (if Y then Z). The new term is conservative and eliminable, so the constitutive-rules account reduces to the rules-in-equilibrium account, and Lewis’s theory of theoretical terms says the term refers if the rules are true. Shown on one toy institution (first-occupancy property); general reduction asserted. | Active — read in full 2026-10-02 (NOTE-395), with the authors’ reply to their six commentators in the same issue; worth reading as the shortest statement of the rules-in-equilibrium theory of institutions and of the claim that Searle’s constitutive rules are regulative rules with a name added. The equilibrium half is a clear synthesis of Lewis, Aumann, Aoki and Greif. The reduction of constitutive rules is shown on one toy institution and asserted in general, and it leans on a reading of “collective acceptance” loose enough to make it hard to fail. |
| LIT-482 | Social ontology: Some basic principles | Searle (2006), DOI-10.1177/1463499606061731. Institutional reality is built from three primitives: collective intentionality, the assignment of function, and constitutive rules of the form “X counts as Y in C”. The Y status is held only by collective acceptance, and it carries deontic powers, which are desire-independent reasons for action. Institutional facts need language because they exist only as represented. Two revisions of the 1995 book: status indicators (after De Soto), and “free-standing Y terms” (after Barry Smith), such as corporations and money without currency. In those cases there is no X, and “We accept (S has power (S does A))”, a formula from later in the book, is ranked as the more general form. | Active — read in full 2026-10-02 (NOTE-388), in its parallel English printing in Papers: Revista de Sociologia 80 (2006), pp. 51–71, not in the Anthropological Theory typesetting the DOI names; worth reading as Searle’s own short restatement of The Construction of Social Reality (LIT-485), and as the place where he concedes that “X counts as Y in C” is not the general form. Status functions imposed by collective acceptance carry deontic powers, and deontic powers are desire-independent reasons for action. Read it for the structure, not for an argument about collective intentionality: that is taken as a primitive and referred to his 1990 paper (LIT-490), not defended here. |
| LIT-484 | Qu’est-ce qu’un fait social ? | Durkheim (1894; book 1895), ch. I of Les Règles de la méthode sociologique. A social fact is “toute manière de faire, fixée ou non, susceptible d’exercer sur l’individu une contrainte extérieure”, or equivalently one general in a society while existing independently of its individual manifestations. Such facts are neither organic nor individual-psychic, so their substrate is society. They are general because collective, not collective because general: “il est dans chaque partie parce qu’il est dans le tout”. Ways of being (morphology) are consolidated ways of doing. A definition argued from examples, not proved. | Active — read in full 2026-10-02 (NOTE-391); worth reading as the founding definition of a social fact, and as a short text later social ontology still cites (Ritchie 2018 does, for the group as more than a sum). Fifteen pages define the object of sociology by two marks, exteriority to individual consciousness and external constraint, with diffusion plus independent existence as an equivalent second test. It is a definition, not an argument: Durkheim calls it “un simple résumé des données immédiates de lobservation” (n. 3), and its two load-bearing steps (that what is neither organic nor individual-psychic must have society as its substrate, and that constraint is present even where nobody feels it) are asserted from examples. Read for the vocabulary and the part-whole thesis (“il est dans chaque partie parce qu’il est dans le tout”), not for a proof. |
| LIT-486 | Social Structures and the Ontology of Social Groups | Ritchie (2018 online; PPR 100(2), 2020). Social structures are networks of relations constitutively, not merely causally, dependent on social factors, and can be overt or covert, intentionally or unintentionally created, internal or external to what realizes them. Organized social groups (teams, courts, families) are structured wholes with internal social structures whose nodes people occupy; feature social groups (women, racial groups, classes) are social kinds, nodes in external social structures. Both meet a “Goldilocks Constraint”: intuitive and explanatory groups in, arbitrary collections out. Silent on agency. | Active — read in full 2026-10-02 (NOTE-389); worth reading as the one framework in the record that covers both kinds of social group, the organised ones the group-agency literature is about and the race, gender and class groups the social-construction literature is about, and says why they differ. Organized social groups (teams, courts, firms) are structured wholes with internal social structures; feature social groups (women, African Americans, economic classes) are social kinds, nodes in external social structures. It is a framework offered to “motivate”, not a proof, and its anti-overgeneration work is done by a restriction to structures that “intuitively exist” or “figure in explanations”, imported rather than derived. It says nothing about agency or minds. |
| LIT-487 | Social Ontology | Epstein (2018; rev. 2024), https://plato.stanford.edu/entries/social-ontology/. A survey that splits social ontology into two inquiries: what determines (grounds) a social fact, and what constructs or “anchors” the category it falls under, likened to semantics and metasemantics. §3 surveys determination bases (psychologism, atomism, bodies and practices, physicalism, holism, flat ontologies) and reports that ontological individualism is widely assumed and recently contested. §4 surveys anchoring theories (agreement, Lewis’s convention, Hart and Searle’s collective acceptance, patterns, practices, language). §5 covers groups, group minds and agency, institutions, race and gender, artifacts, money, law and language. | Active — read in full 2026-10-02 (NOTE-393); worth reading as a survey: the best single map of social ontology in the record, organised around its author’s distinction between what grounds a social fact (§3) and what anchors, or sets up, the category it falls under (§4). It is also the record’s readable source for what The Ant Trap’s grounding–anchoring framework is (LIT-478 is not lawfully readable). Read it as a survey written by a partisan: Epstein’s own positions organise the entry, and the critics of anchoring are named but given a sentence each. |
| LIT-489 | Institutions | North (1991), DOI-10.1257/jep.5.1.97. Institutions are “the humanly devised constraints that structure political, economic and social interaction”: informal constraints (taboos, customs, codes of conduct) and formal rules (constitutions, laws, property rights). With technology they set transaction and production costs, and so the incentive structure of an economy. Tribal exchange, the Suq and the caravan trade did not evolve from within; early modern European trade did, through merchant law, bills of exchange, insurance and a state bound not to confiscate. Institutional change is path dependent because the institutional matrix has increasing returns. A narrative essay; the definition is stipulated. | Active — read in full 2026-10-02 (NOTE-392); worth reading as the economist’s canonical one-paragraph definition of institutions (“the humanly devised constraints that structure political, economic and social interaction”) and as a compact statement of the transaction-cost and path-dependence programme. It is an essay, not an argument: the game-theoretic motivation is one paragraph, the history is narrative, and the definition is stipulated, not defended. For what an institution is, read it beside Hindriks & Guala (LIT-481), who take it as the exemplar of the rules account and say what it leaves out. |
| LIT-497 v2 | The Genetical Evolution of Social Behaviour. I | Hamilton (1964), J. Theor. Biol. 7:1–16. A one-locus model in which an individual’s genotype affects relatives’ fitness. Weighting each effect by Wright’s coefficient of relationship r gives “inclusive fitness”, which tends to be maximized as classical fitness is. An action that costs the actor is favoured only if the benefit to a relative exceeds 1/r times the cost: more than two brothers, four half-brothers or eight first cousins (§5). The increase of mean inclusive fitness is proved only for giving traits; the model is not about morality. | Active — read in full 2026-10-02 (NOTE-401); worth reading as the source of inclusive fitness and of the rule the moral-psychology literature calls Hamilton’s rule. It is a population-genetic model with non-overlapping generations, random mating and weak selection, and its rule appears as −k > 1/r (§5), not in the later rb > c form. It proves that mean inclusive fitness increases only for genes whose total effect on others is non-negative (giving traits); for harming traits it shows only that selection points uphill. It says nothing about morality: it is the kin domain of morality-as-cooperation in its biological form, read as biology. |
| 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-499 | Moral Foundations Theory: The Pragmatic Validity of Moral Pluralism | Graham et al. (2013), DOI-10.1016/B978-0-12-407236-7.00002-4. Moral Foundations Theory in full: a nativist, cultural-developmental, intuitionist and pluralist account with five foundations (Care, Fairness, Loyalty, Authority, Sanctity), each tied to an adaptive challenge and an existing evolutionary model. A decade of MFQ work finds liberals rely on Care and Fairness, conservatives on all five, across 12 world regions. Five criteria for “foundationhood” are proposed, and Liberty, Efficiency, Ownership and Honesty are named candidates. Harm monism (Gray) and fairness monism (Baumard) are rejected as Procrustean. | Active — read in full 2026-10-02 (NOTE-396); worth reading as the full statement of Moral Foundations Theory and as the text to check morality-as-cooperation’s comparison against. It states the theory’s four claims (nativism, cultural learning, intuitionism, pluralism), reviews a decade of MFQ findings, mostly on political ideology, and offers five criteria for what counts as a foundation. By its own table the Care foundation rests on kin selection and Fairness on Trivers’ reciprocal altruism, and Ownership/theft is already a named candidate, so the claim that MFT omits kin altruism, reciprocal altruism and property does not survive this text. Sanctity, the foundation morality-as-cooperation excludes, is by the same table the one with the least evidence of innate preparedness. |
| LIT-500 | Morality beyond the WEIRD: How the nomological network of morality varies across cultures | Atari et al. (2023), DOI-10.1037/pspp0000470. The Moral Foundations Questionnaire-2: 36 items, six per foundation, for Care, Equality, Proportionality, Loyalty, Authority and Purity, built and tested on 25 populations (N ≈ 8,700) in local languages. Equality and Proportionality correlate weakly (mean r = .21). Purity is the foundation most related to cultural distance from the U.S. (r = .43) and to religiosity. The individualizing–binding split appears in only three of 19 national networks. The MFQ-2 explains more variance in 30 criterion scores than the MFQ-1 (mean adjusted R² .37 against .30). | Active — read in full 2026-10-02 (NOTE-398), from the APA accepted manuscript; worth reading as the current Moral Foundations measure (the MFQ-2) and the theory’s current list of six foundations, with Fairness split into Equality and Proportionality, and as the place MFT answers morality-as-cooperation directly: Curry et al. 2019 “left out Purity as an important and less-WEIRD moral foundation”. Its strongest evidence for that, Purity’s association with cultural distance from the U.S., rests on the one subscale that fails its own measurement-invariance threshold. Its samples are online panels in 25 populations, not small-scale societies. |
| 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-502 | Intuitive ethics: how innately prepared intuitions generate culturally variable virtues | Haidt & Joseph (2004), DOI-10.1162/0011526042365555. Proposes that people are innately prepared to feel flashes of approval or disapproval at four patterns: suffering, hierarchy, reciprocity and purity, with ingroup the best candidate for a fifth (fn. 15). Each is a module with a proper domain it evolved for (one’s own child in distress; cheating in joint ventures; disease and waste) and a culturally widened actual domain. Cultures build virtues on these intuitions and differ in which they use. The four were chosen by counting which concerns appeared in five surveyed works; the essay reports no data. | Active — read in full 2026-10-02 (NOTE-400); worth reading as the founding statement of Moral Foundations Theory, and as the text morality-as-cooperation quotes when it calls purity non-cooperative. It proposes four innately prepared intuition “modules” (suffering, hierarchy, reciprocity, purity), with ingroup as a likely fifth in a footnote, and argues that cultures build virtues on them. The list comes from tallying five books, not from data, and no study is reported. It already grounds the suffering module in care for one’s own children and the reciprocity module in Trivers, so the later charge that the foundations omit kin and reciprocal altruism does not fit this text. |
| LIT-505 | The Logic of Animal Conflict | Maynard Smith & Price (1973), DOI-10.1038/246015a0. Why do animals with dangerous weapons fight conventionally? A simulation of five strategies (Mouse, Hawk, Bully, Retaliator, Prober-Retaliator) shows Hawk is not an evolutionarily stable strategy while Retaliator nearly is, so “limited war” can be favoured by individual selection. In a pure war of attrition no fixed persistence is stable; the ESS is an exponential mixture. There is no Hawk–Dove game and no ownership asymmetry here. | Active — read in full 2026-10-02 (NOTE-404); worth reading as the paper that introduced the evolutionarily stable strategy and showed that “limited war” in animal contests can be favoured by individual selection. It is not the source of the Hawk–Dove game or of owner–intruder conventions, though morality-as-cooperation cites it for both: its strategies are Mouse, Hawk, Bully, Retaliator and Prober-Retaliator, its contestants are symmetric, and its “Retaliator is an ESS” ties with Mouse, so it fails the paper’s own second ESS condition. What it does ground for MAC’s contest domains is restraint backed by retaliation, and, informally, retreat before a visibly superior opponent and honest signals of formidability. |
| 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-507 | Moral psychology is relationship regulation: Moral motives for unity, hierarchy, equality, and proportionality | Rai & Fiske (2011), DOI-10.1037/a0021867. Relationship regulation theory: moral judgments are not about features of acts (harm, unfairness, impurity) but about whether acts fit the relationship model in force. Fiske’s four relational models each carry a moral motive: Unity (communal sharing), Hierarchy (authority ranking), Equality (equality matching) and Proportionality (market pricing). The motives are universal; cultures differ in where they apply them. So violence, inequality and “impure” acts can be morally required, and purity and ingroup loyalty are one motive. A review, with no new data. | Active — read in full 2026-10-02 (NOTE-405); worth reading as the relational alternative to both Moral Foundations Theory and morality-as-cooperation, and as the source of the Equality/Proportionality split the MFQ-2 later adopted. It is a theoretical review with no new data. It agrees with morality-as-cooperation that morality exists to sustain cooperative relationships, and differs from it on purity (a Unity motive, the same motive as ingroup loyalty), on harm (violence can be morally required) and on the units (four relational models, not seven game-theoretic problems). |
| LIT-508 | A mutualistic approach to morality: The evolution of fairness by partner choice | Baumard, André & Sperber (2013), DOI-10.1017/S0140525X11002202. When individuals can choose partners and have equal outside options, a split that gives one side less than it could get elsewhere is not stable, so partner choice selects for sharing the gains of cooperation in proportion to contribution. Competition to be chosen then favours a genuine, non-instrumental sense of fairness. Economic-game results (entitlement effects, merit-based division, need-based mutual aid, proportionate punishment) are reinterpreted as fairness, not altruism. Morality is defined as fairness; kin care and group loyalty are not intrinsically moral. | Active — read in full 2026-10-02 (NOTE-407), with all 28 open peer commentaries and the authors’ Response; worth reading as the strongest single-mechanism cooperative theory of morality and as the parent of moral disciplining (LIT-101). It is a cooperation theory that cuts the other way from morality-as-cooperation: partner choice selects one moral sense, fairness, and kin care and group loyalty are not intrinsically moral. Its evidence is a reinterpretation of others’ economic-game results, and its central formal claim is cited from the authors’ separate model. The commentaries (Graham, Ramlakhan & Brook, Machery & Stich, Sachdeva et al., Atran) press the purity, harm and scope objections, and the Response answers them two ways because the authors disagree among themselves. |
| LIT-510 | The Evolution of Reciprocal Altruism | Trivers (1971), DOI-10.1086/406755. Altruism between non-relatives can be selected if acts cost the giver less than they benefit the recipient, the same partners meet repeatedly and symmetrically, and altruists stop helping those who fail to reciprocate. Cleaner-fish hosts fit; bird alarm calls are explained instead by self-interest. In humans, friendship, moralistic aggression, gratitude, sympathy, guilt, suspicion and their sham versions are proposed as adaptations that regulate exchange, and rules of conduct as a multiparty extension. | Active — read in full 2026-10-02 (NOTE-402); worth reading as the source of reciprocal altruism and, for this record above all, of the first adaptive account of moral emotions: moralistic aggression, gratitude, sympathy, guilt and the detection of sham versions of each, with “norms of reciprocal conduct” as a later step. The formal part is slight (a verbal model and Hamilton’s communicated Prisoner’s Dilemma sketch); the human psychology is hypothesis supported by the social-psychology literature of the 1960s. It grounds the exchange domain of morality-as-cooperation and gives that domain its emotions. |
| LIT-511 | The emotional dog and its rational tail: A social intuitionist approach to moral judgment | Haidt (2001), DOI-10.1037/0033-295X.108.4.814. Moral judgment is usually caused by fast affective intuitions; moral reasoning mostly comes after, to justify the judgment to others, and changes minds chiefly by triggering new intuitions in listeners. Four reasons are offered: two processing systems, motivated reasoning, post-hoc confabulation, and the weak link between moral reasoning and moral action. Intuitions are partly innate and are tuned by culture through custom complexes and peers in late childhood. Harmless taboo violations are condemned anyway, and people are “dumbfounded” when their reasons run out. | Active — read in full 2026-10-02 (NOTE-403), from the author’s final manuscript; worth reading as the standard statement of the social intuitionist model, the proximate account of moral judgment that morality-as-cooperation lacks, and as the source of the “harmless wrongs” (consensual incest, sex with a dead chicken) on which the purity and sex objections to cooperative theories rest. Most of its evidence comes from outside the moral domain, which the author says himself: the model is offered as “a plausible alternative”, not an established fact. |
| LIT-513 | Validation of Morality as Cooperation Questionnaire in Turkey, and Its Relation to Prosociality, Ideology, and Resource Scarcity | Yilmaz, Harma & Doğruyol (2021), DOI-10.1027/1015-5759/a000627. In Turkish undergraduates (n = 445), the MAC-Q’s seven-factor model fits the Relevance items (CFI .949, RMSEA .053) but not the Judgement items or the full form, as in the original. Deference and family track resistance to change, and fairness tracks lower opposition to equality. Resource-scarcity primes in Turkey (n = 576) and a preregistered US study (n = 921) change nothing. Relevance scores correlate modestly with prosocial intentions. | Active — read in full 2026-10-02 (NOTE-397), from the accepted manuscript; worth reading as the first independent test of the MAC-Q, by a team with no morality-as-cooperation author. It reproduces the questionnaire’s main result in Turkish undergraduates (n = 445): seven factors fit the Relevance items (CFI .949) and fail on the Judgement items (CFI .828) and the full form (CFI .752). Its two resource-scarcity experiments are null. Its scope is narrow: there is no non-cooperative item, so it tests MAC’s structure, not its claim that morality is only cooperation; and the latent correlations (fairness–property .87, family–group .80) and a second-order single factor fitting at CFI .906 limit how distinct the seven are. |
| 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-517 | Nonequilibrium Equality for Free Energy Differences | Jarzynski (1997), DOI-10.1103/PhysRevLett.78.2690. For a classical system that starts in canonical equilibrium and is switched from Hamiltonian H_0 to H_1 at any finite rate, the average of e^{−βW} over repetitions equals e^{−βΔF} (Eq. 2), whatever the path and the switching time. The proof is exact for an isolated system and for Nosé–Hoover thermostats, and needs weak coupling for a physical reservoir. Thermodynamic integration and the Zwanzig perturbation formula are its slow and fast limits, and ⟨W⟩ ≥ ΔF follows by Jensen. | Active — read in full 2026-10-02 (NOTE-417); worth reading as the four-page origin of the nonequilibrium work relation ⟨e^{−βW}⟩ = e^{−βΔF}: an equality, independent of path and switching rate, that turns irreversible work measurements into an equilibrium free-energy difference and gives ⟨W⟩ ≥ ΔF as a corollary by Jensen. Read it knowing two things. The physical-reservoir proof rests on weak coupling (Eq. 9 → 10), which the author states; and its usefulness is limited by the author’s own estimate to work fluctuations of order k_BT, so nanoscale systems or simulations. |
| 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-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-522 | Entropy production fluctuation theorem and the nonequilibrium work relation for free energy differences | Crooks (1999), DOI-10.1103/PhysRevE.60.2721. For finite classical systems with stochastic, Markovian, microscopically reversible dynamics, the entropy production ω of a forward process and of its time reverse satisfy P_F(+ω)/P_R(−ω) = e^{ω} for any finite time, provided ω is odd under reversal. That holds for processes that start and end in equilibrium, where ω = β(W − ΔF), and for time-symmetric nonequilibrium steady states. The Jarzynski equality follows in one line, and for long times the theorem gives a heat fluctuation theorem and a Gaussian with variance twice the mean. | Active — read in full 2026-10-02 (NOTE-413); worth reading as the short paper that turned the entropy-production fluctuation theorem into a finite-time, trajectory-level statement for stochastic, microscopically reversible dynamics, P_F(+ω)/P_R(−ω) = e^{ω}, and derived the Jarzynski equality from it in a line. It also defines the trajectory entropy production ω = ln ρ(x_{−τ}) − ln ρ(x_{+τ}) − βQ that the record’s stochastic-thermodynamics papers inherit. Read it knowing that its conditions are stated exactly (finite classical system, constant-intensive-parameter baths, Markovian microscopically reversible dynamics, ω odd under time reversal), and that the steady-state version is formally exact but, by the author’s own account, of little practical use. |
| LIT-523 | Stochastic thermodynamics, fluctuation theorems and molecular machines | Seifert (2012), DOI-10.1088/0034-4885/75/12/126001. A 105-page review of stochastic thermodynamics. Work, heat and a stochastic system entropy s = −ln p(x(τ),τ) are defined along single trajectories of Markovian systems coupled to baths, and every known integral, detailed and Crooks fluctuation theorem is derived from one master theorem by choosing a conjugate dynamics. Further results: dissipation bounds forward–reverse distinguishability (⟨w⟩ − ΔF ≥ D[p‖p_eq]), Sagawa–Ueda feedback relations, a NESS fluctuation–dissipation theorem in terms of entropy production, and a cycle-based theory of efficiency at maximum power for molecular machines. | Active — read 2026-10-02 (NOTE-420; §§5, 8.3–8.4, 9.2 and 11 skimmed); worth reading as the systematic reference for stochastic thermodynamics as of 2012: first law, heat and stochastic entropy along single trajectories of Markovian systems coupled to baths, every known fluctuation theorem derived from one master theorem with a conjugate dynamics, dissipation as distinguishability of forward and reverse paths, Sagawa–Ueda feedback, the NESS fluctuation–dissipation theorem and efficiency of molecular machines. It is the framework in which the record’s thermodynamics-of-prediction and thermodynamics-of-learning results (LIT-327, LIT-308) are stated. Read it as a review: the derivations are its own and concise, the case studies are reported. |
| 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-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-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-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-538 | How effective psychological treatments work: mechanisms of change in cognitive behavioural therapy and beyond | Salkovskis, Sighvatsson & Sigurdsson, Behavioural and Cognitive Psychotherapy 51(6):595–615, in the special issue “Disseminating CBT: 50 years and beyond” (issue dated November 2023, first published online 5 January 2024). A history of behaviour therapy and CBT as empirically grounded treatment development, an argument that common factors are not mechanisms of change, and a proposal: the mechanism of all effective therapies is a shift from a stuck, threat-laden meaning (“Theory A”) to a collaboratively built and tested alternative (“Theory B”), which the authors call a type of psychological flexibility. | Active — read in full 2026-10-03 (NOTE-428), from the open-access (CC BY 4.0) publisher PDF; worth reading as a senior Beckian’s statement of a single mechanism of change for all effective psychological therapy, and for its clear separation of “common factors” from “mechanisms of change”. Its thesis is a proposal argued from the history of CBT and clinical examples, not a tested result: people are “stuck” in an exaggerated negative or threatening meaning (Theory A) kept alive by what it makes them do, and any effective therapy works by helping them build and test a less threatening alternative (Theory B). The paper calls this a particular type of psychological flexibility, without citing the ACT literature that uses that name. |
| 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-540 | Impulsive action: emotional impulses and their control | Frijda, Ridderinkhof & Rietveld (2014), Frontiers in Psychology 5:518. Impulsive action is non-deliberate but purposive. Automatic appraisal of an event’s pertinence to the agent’s concerns elicits a state of action readiness, a motive to establish, modify or end a relation to the object, with “control precedence” (urgency, persistence, attentional capture). Modes of action readiness are what distinguish one emotion from another. Events usually draw several appraisals and so several states of readiness, and their interaction regulates action: much emotion regulation is itself emotional, not reason overriding passion. | Active — read in full 2026-10-03 (NOTE-433); filed in place of Frijda’s The Emotions (LIT-546), which could not be read, as the shortest lawfully readable statement of his action-readiness theory in his own words. Appraisal of an event’s pertinence to one’s concerns elicits a state of action readiness, a motive to change one’s relation to the object, which has “control precedence”. Modes of action readiness correspond to emotions (hostility to anger, avoidance to fear). Much emotion regulation is itself one state of action readiness checking another, so “there is no clear distinction between processes of emotion and processes of emotion regulation”. It is a theoretical paper with no data, written for impulsive action, so it states the theory’s core and not its full range. |
| LIT-541 | Relational Frame Theory: Some Implications for Understanding and Treating Human Psychopathology | Barnes-Holmes, Barnes-Holmes, McHugh & Hayes (2004), International Journal of Psychology and Psychological Therapy 4(2):355–375. RFT stated briefly: humans relate events bidirectionally and arbitrarily, as a generalized operant under contextual control, so words take on the functions of what they are related to. Frames combine into networks, networks are related to networks (metaphor), rules are networks that regulate behaviour, and the self is content, process and context of verbal relations. Psychopathology is read as verbal behaviour, and ACT’s acceptance, defusion and values are given RFT interpretations. | Active — read in full 2026-10-03 (NOTE-430), in place of the RFT book, LIT-549; worth reading as a short statement of Relational Frame Theory by two of the book’s editors, and as the paper that shows how RFT is meant to become a theory of psychopathology. Humans, unlike the animals of conditioning research, relate events bidirectionally, so a word acquires the functions of what it names. Relating is a generalized operant learned across exemplars, and its frames share mutual entailment, combinatorial entailment and the transformation of function. Rules are relational networks, and the self is three verbal relations to one’s own behaviour. ACT’s acceptance, defusion and values are then reinterpreted in those terms. Its clinical examples are illustrations, not data, and it says its Part 3 is “no more than a heuristic”. |
| LIT-542 | The theory of constructed emotion: an active inference account of interoception and categorization | Barrett (2017), SCAN 12(1):1–23. The brain runs an internal model of the body in the world for allostasis. Its predictions are “concepts” issued from agranular limbic cortex and refined by prediction error. Interoceptive predictions are felt as affect (valence, arousal). An emotion is an instance of categorizing sensation with an emotion concept, built the same way as any perception. Since instances of an emotion are “created by multiple spatiotemporal patterns” (degeneracy), the categories have no neural essences, and the classical view, basic-emotion and causal appraisal theories included, is rejected. Emotions are “constructions of the world, not reactions to it.” | Active — read in full 2026-10-03 (NOTE-434); worth reading as the shortest complete statement of the theory of constructed emotion and of its link to predictive processing. The brain’s core task is allostasis, run through an internal model whose predictions are “concepts”. An instance of emotion is what happens when the brain categorizes predicted interoceptive and exteroceptive sensation with an emotion concept. On this account emotion categories have no neural “essences”, and causal appraisal theories are “highly doubtful”. The paper is a theoretical synthesis: its own data are a few figures, and the rest is cited evidence and explicitly labelled hypotheses. |
| LIT-544 | The Future of Intervention Science: Process-Based Therapy | Hofmann & Hayes (2019; online 2018), Clinical Psychological Science 7(1):37–50. The era of “protocols for syndromes” is over: thirty years of DSM-defined randomised trials never found the diseases the syndromes were meant to reveal. Evidence-based therapy should be redefined as process-based therapy, “evidence-based processes linked to evidence-based procedures”, with mediation and moderation as the evidence, functional analysis and idiographic networks as diagnosis, and named therapies and broad schools in decline. | Active — read in full 2026-10-03 (NOTE-437), from the NIH author manuscript in PubMed Central; worth reading as the programme statement of process-based therapy by the leading figures of the two camps of CBT it reconciles. It replaces “protocols for syndromes” with one question: “What core biopsychosocial processes should be targeted with this client given this goal in this situation, and how can they most efficiently and effectively be changed?” It is a position paper with predictions, not a result. Its sharpest commitment is a falsification rule: an intervention whose specified process of change “cannot be shown to be consistently applicable” has an incorrect model, however well it works. |
| 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-553 | Psychological Flexibility as a Fundamental Aspect of Health | Kashdan & Rottenberg (2010), Clinical Psychology Review 30(7):865–878. Psychological health is not a ratio of positive to negative experience or a set of fixed strengths but flexibility: adapting regulation to the situation, balancing time perspectives and life domains, and acting on values while open to experience. Inflexibility marks depression (rumination, emotion context insensitivity) and anxiety (experiential avoidance), and cardiac vagal control is proposed as an integrating marker. Executive functioning, default states and personality underlie it, and dynamic measurement is needed. | Active — read in full 2026-10-03 (NOTE-436), in the NIH author manuscript on PubMed Central; worth reading as the review that took “psychological flexibility” out of the ACT literature and made it a general construct of health. Flexibility is adapting to situational demands, reconfiguring mental resources, shifting perspective and balancing competing desires and life domains. Its absence (rumination, emotion context insensitivity, experiential avoidance, low cardiac vagal control) runs through depression and anxiety. Executive functioning, default mental states and personality are its “building blocks”. It is a narrative synthesis: no meta-analysis of its own, the causal direction between inflexibility and disorder is left open by its own account, and it asks for dynamic measures in place of the global self-reports the ACT line relies on. |
| LIT-554 | The Emerging Field of Emotion Regulation: An Integrative Review | Gross (1998), Review of General Psychology 2(3):271–299. Emotions are response tendencies (behavioural, experiential, physiological) called forth by evaluated situations and open to modulation. Emotion regulation is how people influence which emotions they have, when, and how they are experienced and expressed, and it is distinct from coping, mood regulation and defense. A process model places regulation at five points in emotion generation: situation selection, situation modification, attentional deployment, cognitive change (reappraisal), and response modulation (suppression). The first four are antecedent-focused, the last response-focused. Dysregulation is said to figure in over half of the DSM-IV Axis I disorders and all of Axis II. | Active — read in full 2026-10-03 (NOTE-429); worth reading as the founding statement of the process model of emotion regulation, the five-family scheme (situation selection, situation modification, attentional deployment, cognitive change, response modulation) that later regulation research and many therapies are organised around. It defines emotion regulation as “the processes by which individuals influence which emotions they have, when they have them, and how they experience and express these emotions” (p. 275) and separates it from coping, mood regulation and defense. It is a conceptual review: no data of its own, and it says the scheme is “a set of working distinctions” (p. 282). |
| LIT-555 | Acceptance and Commitment Therapy: Model, Processes and Outcomes | Hayes, Luoma, Bond, Masuda & Lillis (2006), Behaviour Research and Therapy 44(1):1–25. The ACT model: psychopathology is psychological inflexibility, produced when language (cognitive fusion) and experiential avoidance dominate direct contingencies, and ACT restores flexibility through six processes. A review of correlational, component, mediational and outcome studies finds the model “broadly supportive” but the literature immature, and the evidence suggests ACT works through different processes from traditional CBT. Read in an early author manuscript whose numbers differ from the published paper’s. | Active — read in full 2026-10-03 (NOTE-431), but in an early manuscript, not the published text; worth reading as the canonical statement of the ACT model of psychopathology, “psychological inflexibility”, and of the six processes ACT targets. Cognitive fusion and experiential avoidance (from LIT-551) narrow behaviour, and acceptance, defusion, present-moment contact, self as context, values and committed action restore flexibility. The copy read is an author manuscript in Georgia State University’s repository that still carries “xx” placeholders, and its numbers differ from the published paper’s as Kashdan and Rottenberg report them (21 studies against 32; an AAQ correlation printed “.030” against “.42”). Use its model and argument, not its numbers. Its own verdict on the evidence is “broadly supportive” but “not mature”. |
| LIT-557 v2 | A meta-analytic review of experiments examining the effects of extrinsic rewards on intrinsic motivation | Deci, Koestner & Ryan (1999), Psychological Bulletin 125(6):627–668. A hierarchical meta-analysis of 128 experiments (101 with free-choice, 84 with self-report measures) on interesting tasks. Tangible rewards undermined free-choice intrinsic motivation (d = −0.34) and self-reported interest (−0.07); expected rewards did, by every task-related contingency; unexpected and task-noncontingent rewards did not; positive feedback enhanced both measures, but not children’s free choice. Read as strong support for cognitive evaluation theory and against Eisenberger and Cameron’s behavioural account. | Active — read in full 2026-10-03 (NOTE-438), from an OCR of the scanned published article the authors post on selfdeterminationtheory.org; worth reading as the largest meta-analysis of the reward-undermining effect and the evidential base SDT cites for it. Across 128 experiments on interesting tasks, expected tangible rewards undermined free-choice intrinsic motivation (d = −0.36), engagement-, completion- and performance-contingent rewards all did (−0.40, −0.36, −0.28), unexpected and task-noncontingent rewards did not, and positive feedback enhanced it (0.33), though not for children’s free choice. It reanalyses Cameron and Pierce (LIT-556) study by study. Its categories are CET’s, and the rival authors reply, by the abstract of Cameron, Banko and Pierce (LIT-562, unread), that the negative effects are circumscribed, not pervasive. |
| LIT-558 | The “What” and “Why” of Goal Pursuits: Human Needs and the Self-Determination of Behavior | Deci & Ryan (2000), Psychological Inquiry 11(4):227–268, target article. SDT’s case for innate psychological needs, for competence, relatedness and autonomy, defined as nutriments for growth, integrity and well-being and identified functionally, against Hull’s drives and Murray’s acquired needs. The “why” of a goal (autonomous or controlled regulation) and its “what” (intrinsic or extrinsic aspiration) each predict well-being, because each affects need satisfaction. Thwarted needs yield substitutes, controlled styles and rigid patterns. SDT grounds autonomy in the organism’s tendency to self-organize, argued to be an evolved advantage. | Active — read in full 2026-10-03 (NOTE-439), from the authors’ own deposit of the published target article on selfdeterminationtheory.org; worth reading as the full statement of what SDT means by a “need” and why it posits three. Needs are “innate psychological nutriments that are essential for ongoing psychological growth, integrity, and well-being” (p. 228), identified by what follows when they are satisfied or thwarted, not by how strongly people want them. Goals differ in their “why” (autonomous or controlled regulation) and their “what” (intrinsic or extrinsic content), and both matter because of need satisfaction. Thwarting produces need substitutes, controlled regulatory styles and rigid behaviour patterns. It is a target article: the commentaries and the authors’ reply in the same issue were not read. |
| LIT-559 | Self-determination theory and the facilitation of intrinsic motivation, social development, and well-being | Ryan & Deci (2000), American Psychologist 55(1):68–78. Self-determination theory in eleven pages. Three innate psychological needs, for competence, autonomy and relatedness, must be satisfied for growth, integration and well-being; their thwarting is “a principal source of human distress” (p. 74). Motivation differs in kind, not only amount: extrinsic motivation runs from external through introjected and identified to integrated regulation, and becomes more autonomous as a regulation is internalized and integrated with the self. Autonomy is volition, not independence. | Active — read in full 2026-10-03 (NOTE-442), from the authors’ own deposit of the published article on selfdeterminationtheory.org; worth reading as the shortest statement of self-determination theory by its authors, and the one most cited. It gives the three basic psychological needs (competence, autonomy, relatedness), the continuum of regulation from amotivation through external, introjected, identified and integrated regulation to intrinsic motivation, and the claim that autonomy is volition, “not … being independent, detached, or selfish” (p. 74). It is a review: every empirical claim is cited to other papers, nothing is tested here, and it states the reward-undermining result as settled by Deci, Koestner & Ryan (LIT-557), which Cameron, Banko & Pierce dispute (LIT-562, unread; by its abstract). |
| LIT-560 | Self-Regulation and the Problem of Human Autonomy: Does Psychology Need Choice, Self-Determination, and Will? | Ryan & Deci (2006), Journal of Personality 74(6):1557–1586. SDT’s defence of autonomy as a psychological construct. Philosophers (phenomenologists from Pfänder and Ricoeur; hierarchical accounts from Frankfurt and Dworkin) agree that autonomy is self-endorsement, not independence. On that definition, the critiques fail: behaviourists and Bandura define autonomy as independence from the environment; reductive neuroscience mistakes levels of explanation; nonconscious priming shows autonomy can be compromised, not that it is illusory; too many options is not self-determination; and autonomy matters across cultures. | Active — read in full 2026-10-03 (NOTE-441), from the authors’ own deposit of the published article on selfdeterminationtheory.org; worth reading as the place where SDT states its concept of autonomy against both philosophy and psychology. Autonomy is “regulation by the self”, its opposite “heteronomy”, regulation “without self-endorsement” (abstract). It is “a matter of degree” (p. 1562), compatible with dependence and with having one option, and lies “not in being independent causes but in exercising their capacity to reflectively endorse or reject prompted actions” (p. 1573). It answers Skinner, Bandura, Pinker, Bargh, Wegner, Schwartz and Iyengar. Its engagement with Frankfurt is thin: two citations of the 1971 paper inside one paragraph on hierarchical accounts, with the analytic detail taken from Dworkin. |
| LIT-561 | Basic psychological need theory: Advancements, critical themes, and future directions | Vansteenkiste, Ryan & Soenens (2020), Motivation and Emotion 44(1):1–31. Two decades of basic psychological need theory. A basic need must be psychological, essential, inherent, distinct and universal, and its effects pervasive, content-specific, directional and explanatory. Need frustration is not merely low satisfaction: it predicts ill-being, compensatory behaviour and need substitutes, and may be transdiagnostic. Novelty, morality and beneficence are reviewed as candidate fourth needs; none is yet admitted. Universality holds for the effects of need satisfaction, not for how needs are supported. | Active — read in full 2026-10-03 (NOTE-440), from the publisher’s typeset PDF that the authors post on selfdeterminationtheory.org; worth reading as the current statement of basic psychological need theory and of what would make something a basic need. It gives nine criteria (psychological, essential, inherent, distinct, universal; pervasive, content-specific, directional, explanatory), treats need frustration as distinct from low satisfaction and as a candidate transdiagnostic process in psychopathology, and restates universality as “universality without uniformity”: the effects of need satisfaction are claimed invariant, the ways needs are supported are not. It is an editorial introduction to two special issues, by SDT’s authors, and reviews selectively. |
| LIT-562 v2 | Pervasive negative effects of rewards on intrinsic motivation: The myth continues | Cameron, Banko & Pierce (2001), The Behavior Analyst 24(1):1–44. The authors of the 1994 rival meta-analysis re-analyse 145 studies, adopt Deci, Koestner and Ryan’s split by initial interest, and code reward contingencies by procedure rather than by cognitive evaluation theory. Rewards for merely doing an interesting task undermine free choice (−0.35, K = 57), as in Deci et al. Rewards for surpassing a score do not, and rewards for beating others enhance. Every effect either way is small. | Active — read in full 2026-10-05 (NOTE-587), on the owner’s instruction, from the article as hosted by the Cambridge Center for Behavioral Studies; the same article is free in PubMed Central (PMC2731358). Worth reading as the strongest case against pervasive reward undermining, by the authors of the rival meta-analysis, and as the paper that shows the coding scheme decides the result. Re-coding 145 studies by procedure, it finds no overall effect on free choice and enhancement on low-interest tasks. On interesting tasks it finds undermining only for expected tangible rewards loosely tied to performance or earned at less than the maximum, and neutral or positive effects for rewards tied to a score or to beating others. The core effect agrees with Deci et al.; the per-contingency sizes are in figures with no text layer. |
| LIT-563 | HDDM: Hierarchical Bayesian Estimation of the Drift-Diffusion Model in Python | Wiecki, Sofer & Frank (2013), Frontiers in Neuroinformatics 7:14. HDDM is an open-source Python package that estimates the drift diffusion model (and the linear ballistic accumulator) by hierarchical Bayesian MCMC: subject parameters drawn from group distributions with informative priors, full posteriors, outlier handling, and regression of parameters on trial-by-trial covariates. A tutorial reproduces a theta-power effect on decision threshold that reverses under subthalamic deep brain stimulation. In simulations hierarchical Bayes recovers parameters and detects effects better than χ²-quantile and maximum-likelihood fitting, most with few trials. | Active — read in full 2026-10-03 (NOTE-466); worth reading as the methods paper for HDDM, the Python package that fits the drift diffusion model by hierarchical Bayesian estimation (PyMC, MCMC), with subject parameters drawn from group distributions and trial-by-trial regressions of parameters on covariates such as EEG power. Its simulations show hierarchical Bayes recovering parameters with less error than per-subject χ²-quantile, maximum-likelihood or non-hierarchical Bayesian fits, most of all with few trials, and detecting drift-rate differences and covariate effects more often. The comparisons are the authors’ own, on data simulated from the model being fitted, and its hypothesis tests on the group posterior differ from the t-tests used for the other methods. |
| LIT-564 | The Sources of Normativity | Korsgaard (1992), Tanner Lectures at Clare Hall, Cambridge. The “normative question” asks what justifies morality’s claims on us. Voluntarism, realism and reflective endorsement each fail alone. The answer is autonomy: because human consciousness is reflective, we need reasons, and so need a “conception of your practical identity” that makes us “a law to yourself”. Obligation is “the reflective rejection of a threat to your identity”. Valuing any identity commits us to valuing our humanity, and reasons are public, so others can obligate us. “Autonomy is the source of obligation.” | Active — read in full 2026-10-03 (NOTE-465), as the read substitute for the book The Sources of Normativity (1996, LIT-599), which is its “longer version” with commentaries and a reply. Worth reading as Korsgaard’s own first statement of practical identity and of the claim that “autonomy is the source of obligation”. The reflective structure of human consciousness means we must act for reasons and so must have “a conception of your practical identity”, “a description under which you value yourself”; reasons express that identity and obligations “spring from what that identity forbids”. Valuing any practical identity commits one to valuing one’s humanity, and the publicity of reasons commits one to others. The lectures concede that the argument is “sketchy, and sketchily argued”. |
| LIT-565 | The Time Course of Perceptual Choice: The Leaky, Competing Accumulator Model | Usher & McClelland (2001), Psychological Review 108(3):550–592. Perceptual choice as gradual, stochastic accumulation in one unit per alternative, with leakage and lateral inhibition between units and a threshold at zero. For two choices the linearised difference is an Ornstein–Uhlenbeck process with net leak K = k − β; K = 0 recovers the classical diffusion model, and K ≠ 0 bounds asymptotic accuracy. The model fits time–accuracy curves slightly better than diffusion with drift variance, fits Vickers’s latency–discriminability data, predicts individual primacy or recency biases confirmed in a new experiment, and yields Hick’s law under a constant-accuracy criterion. | Active — read in full 2026-10-03 (NOTE-449); worth reading as the source of the leaky, competing accumulator (LCA): one leaky accumulator per alternative, lateral inhibition between them, a threshold-linear floor at zero, and an absolute response criterion. In the linear two-choice case the difference between accumulators is an Ornstein–Uhlenbeck process with net leak K = k − β, so the classical diffusion model is the special case K = 0 and accuracy given unlimited time is bounded whenever K ≠ 0. Its evidence for leakage over drift variance is a modest likelihood advantage on 3 participants (combined ratio about 62 to 1, 7 of 9 curves), and the authors concede that a diffusion model with drift variance, starting-point variance and decision boundaries is hard to tell apart from it. |
| 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-567 | A Planning Agent’s Self-Governance over Time | Bratman (2018), essay 11 of Planning, Time, and Self-Governance (OUP). A planning agent’s self-governance over time is self-governance at each time along a planned activity, plus cross-temporal links of intention that parallel the interlocking intentions of shared agency: in diachronic self-governance one acts “together” with oneself. Standpoints are “diachronicalized” by a conditional, reflexive end of one’s own diachronic self-governance. That end can make willpower and resistance to “shuffling” self-governed, while anticipated regret at “plan’s end” excludes drinking Kavka’s toxin. | Active — read in full 2026-10-03 (NOTE-464), in the author’s pre-publication draft of 10 July 2017, not the typeset chapter. Worth reading as the read substitute for Planning, Time, and Self-Governance (2018) and, through its summary of the planning theory, for Intention, Plans, and Practical Reason (1987, LIT-593). A planning agent governs herself over time when she is self-governing at each time along a planned activity and her intentions at those times interlock like the intentions of people acting together, so that she acts “together” with herself. Her standpoints are “diachronicalized”: they include a conditional, reflexive end of her own diachronic self-governance. That end explains how willpower and resisting “shuffling” between incomparable options can be self-governed, and anticipated regret at plan’s end rules out drinking Kavka’s toxin. A philosophical model argued by cases; nothing in it is tested. |
| LIT-568 | Précis: Being No One | Metzinger (2005), PSYCHE 11(5), the author’s précis of Being No One. Minimal consciousness is a global world-model in a window of presence that cannot be recognised as a model (globality, presentationality, transparency). A phenomenal self is a transparent self-model: “no such things as selves exist in the world”. Transparency comes in degrees, and the self-model’s opaque partition is what lets humans doubt their own self-representation. The unity of consciousness is a single global functional cluster. A first-person perspective is a phenomenal model of the intentionality relation, and iterating it yields introspective and social intelligence. | Active — read in full 2026-10-03 (NOTE-460), as the read substitute for Being No One (LIT-467), which it summarises in Metzinger’s own words. Worth reading as the most complete short statement of the self-model theory of subjectivity (SMT): more of the machinery than “Self models” (LIT-450), in particular the six constraints, the degrees of transparency, and the phenomenal model of the intentionality relation (PMIR). Phenomenal selfhood is a transparent self-model, “a function realized by a lack of information”; “no such things as selves exist in the world”. The unity of a conscious world is a global functional cluster bound by “highest-order binding”. It states the theory and its predictions; the evidence is cited, not shown, and the neural sections say how little is known. |
| LIT-569 | The Physics of Optimal Decision Making: A Formal Analysis of Models of Performance in Two-Alternative Forced-Choice Tasks | Bogacz, Brown, Moehlis, Holmes & Cohen (2006), Psychological Review 113(4):700–765. The pure drift diffusion model implements the SPRT and Neyman–Pearson test, so it is the optimal two-choice decision process. The O-U, mutual inhibition (Usher–McClelland), feedforward inhibition and pooled inhibition (Wang) models reduce to it for balanced parameters; the race model does not. For reward rate, Bayes risk and two accuracy-weighted criteria there is a unique optimal threshold, giving parameter-free optimal performance curves. With biased priors the optimal starting point is proportional to the log prior odds. | Active — read 2026-10-03 (NOTE-461), main text and Appendix B in full, Appendix A (the derivations) by section only; worth reading as the paper that puts the two-choice decision models in one frame and ties them to the sequential probability ratio test. The pure drift diffusion model is the continuum limit of the SPRT, so it is the fastest for a given accuracy and the most accurate for a given time. Of six models, all but the race model reduce to it in some parameter range: the Usher–McClelland mutual inhibition model when leak equals inhibition and both are large, the feedforward inhibition model when its inhibitory and excitatory weights are equal. Each reward criterion has a unique optimal threshold, which gives testable optimal performance curves. The optimality results hold for the pure model with stationary evidence and two alternatives. |
| 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-576 | The Diffusion Decision Model: Theory and Data for Two-Choice Decision Tasks | Ratcliff & McKoon (2008), Neural Computation 20(4):873–922. A review of the diffusion decision model for fast two-choice tasks, with three new motion-discrimination experiments. Noisy evidence accumulates from a starting point z to one of two boundaries (0, a) at drift v, plus non-decision time and across-trial variability in v, z and Ter. The model fits accuracy and full correct and error RT distributions, and maps difficulty to drift, speed–accuracy instructions to boundary separation and stimulus proportion mainly to starting point. Applications cover aging, aphasia and links to neural firing. | Active — read in full 2026-10-03 (NOTE-445), from the author manuscript in PubMed Central; worth reading as the canonical statement of the diffusion decision model and of what it is for. Two-choice RT and accuracy are decomposed into drift rate (quality of evidence), boundary separation (caution), starting point (bias) and non-decision time, plus across-trial variability in drift, starting point and non-decision time. Three new motion-discrimination experiments show each manipulation landing on its own parameter: difficulty on drift, speed–accuracy instructions on boundaries, stimulus proportion mainly on starting point. Its closing claim, that diffusion models have come “as near to provid[ing] a solution to simple decision making as is possible in behavioral science”, is the authors’ assessment, not a result. |
| LIT-577 | Sophisticated Inference | Friston, Da Costa, Hafner, Hesp & Parr (2021; arXiv 2020), Neural Computation 33(3):713–763. Ordinary active inference scores a fixed set of policies by expected free energy (risk plus ambiguity). Sophisticated inference instead evaluates the expected free energy of the next action recursively, averaging over the beliefs the agent would hold after each plausible outcome and action, which amounts to a tree search over belief states pruned below a probability of 1/16. In simulations it plans past short-term costs: a rat visits a mildly aversive cue, and a horizon of four escapes a local minimum in a maze. It recovers Bayes-adaptive RL in the zero-temperature limit. | Active — read in full 2026-10-03 (NOTE-454), from the arXiv preprint, whose displayed equations did not survive text extraction. Worth reading as the active-inference planning scheme the record’s free-energy holdings otherwise lack: expected free energy evaluated recursively over future belief states, a deep tree search pruned by probability, with the Bellman equation as its formal analogue. The evidence is small simulations (a T-maze rat and an 8 × 8 grid). Flagged anthology-candidate: it is a planning algorithm, compared with reinforcement learning, and the anthology’s agents-and-environments topic may hold it. |
| LIT-579 | Evolution of the Internal Family Systems Model | Schwartz (undated, c. 2000s; IFS Institute). IFS views a person as “an ecology of relatively discrete minds”, each wanting a valuable role but forced into extreme ones by experience: managers keep control, exiles carry pain, and firefighters douse exiles’ feelings by bingeing or numbing. Everyone has a Self that appears when parts “step back”, and is not a passive witness but an active leader and healer. Its qualities are the “eight Cs”. The goal is to differentiate the Self from the parts. | Active — read in full 2026-10-03 (NOTE-453); worth reading as Richard Schwartz’s own short statement of the IFS model, freely published by the IFS Institute, and the read substitute (with chapter 1 of the book, NOTE-457) for Internal Family Systems Therapy (LIT-591). IFS is “a new synthesis of two already-existing paradigms: systems thinking and the multiplicity of the mind”. A person contains “an ecology of relatively discrete minds”, forced into extreme roles (managers, firefighters, exiles) by experience. Everyone has a Self with “crucial leadership qualities”, summed up as eight Cs: calmness, curiosity, clarity, compassion, confidence, creativity, courage and connectedness. A practitioner’s essay: the evidence is clinical experience and one case. |
| LIT-580 | Uncertainty-based competition between prefrontal and dorsolateral striatal systems for behavioral control | Daw, Niv & Dayan (2005), Nature Neuroscience 8(12):1704-1711. Habitual and goal-directed control are model-free (“caching”) and model-based (“tree-search”) reinforcement learners in dorsolateral striatum and prefrontal cortex. Behaviour follows whichever controller’s value estimate is less uncertain under approximate Bayesian versions of each. Simulations reproduce the devaluation data: over-training yields devaluation-insensitive habit, except for actions near reward or in tasks with more actions and outcomes. Both controllers serve the same ends; neither is the “irrational” one. | Active — read in full 2026-10-03 (NOTE-459), supplementary methods not read. Worth reading as the founding statement of model-based versus model-free control as two brain systems, and of arbitration between them by relative uncertainty. Goal-directed (devaluation-sensitive) behaviour is a prefrontal “tree-search” controller, statistically efficient but noisy to compute. Habit is a dorsolateral-striatal “caching” controller, cheap but data-hungry and blind to revaluation. Each controls behaviour when its value estimate is the more certain, which reproduces why over-training produces habits unless the task is complex or the action near the reward. Both controllers pursue “identical rational ends”: a rejection of the impulsive-limbic-versus-rational-prefrontal picture. |
| LIT-581 | Hierarchically organized behavior and its neural foundations: A reinforcement learning perspective | Botvinick, Niv & Barto (2009), Cognition 113(3):262-280. Hierarchical RL groups actions into reusable “options” with their own policies, subgoals and pseudo-reward. That eases the scaling problem by cutting the number of decisions to explore and learn. The paper builds an actor-critic version and maps option identifiers to DLPFC, option-specific policies to dorsolateral striatum, and option-specific values and option-length prediction errors to OFC. Unsuitable options produce negative transfer, so how useful options are discovered is the central open problem. | Active — read in full 2026-10-03 (NOTE-451), from the PubMed Central author manuscript; the online appendix with the equations was not read. Worth reading as the bridge between hierarchical reinforcement learning (temporally abstract “options”) and the psychology and neuroscience of hierarchically organized behaviour. Options ease the scaling problem of RL by shrinking search and learning to a few decision points. An actor-critic version maps option identifiers to dorsolateral PFC, option-specific policies to dorsolateral striatum, and option-specific values and extended prediction errors to orbitofrontal cortex. The problem it puts first is option discovery: the wrong options cause negative transfer, as in human problem solving. |
| 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-584 | Model-based and model-free Pavlovian reward learning: Revaluation, revision, and revelation | Dayan & Berridge (2014), Cognitive, Affective, & Behavioral Neuroscience 14(2):473-492. Pavlovian prediction is not only model-free. A cue that had predicted disgusting salt became instantly “wanted” when a never-experienced salt appetite was induced, before the salt was retasted, which needs a prediction of the outcome’s identity revalued against the current bodily state. Over-training may “defocus” outcome representations rather than hand control to a model-free system. Dopamine may carry model-based evaluations. No algorithm for the revaluation is given. | Active — read in full 2026-10-03 (NOTE-463), from the PubMed Central author manuscript. Worth reading as the argument that Pavlovian prediction, usually modelled as purely model-free, is also model-based. In the “Dead Sea salt” experiment a lever that had predicted a disgusting salt solution became, on first presentation after a novel sodium appetite was induced and before any salt was retasted, nearly as attractive as a sucrose lever, with mesolimbic activation. A cached value cannot do that. The CS must predict the outcome’s identity, and its value must be recomputed against the current bodily state. The paper adds “defocusing” of outcome representations as a model-based route to apparent habit, and argues that dopamine can carry model-based evaluations. |
| LIT-585 | The Expected Value of Control: An Integrative Theory of Anterior Cingulate Cortex Function | Shenhav, Botvinick & Cohen (2013), Neuron 79(2):217-240. Control is allocated by a cost-benefit decision. The expected value of control (EVC) of a candidate control signal is its probability-weighted payoff, with future value discounted, minus an intrinsic cost rising with its intensity. dACC monitors state and outcome information and specifies the identity and intensity of the EVC-maximizing signal. Lateral PFC and subcortical structures implement it. The account integrates conflict monitoring, effort costs and the override of defaults (exploration, foraging, patience). | Active — read in full 2026-10-03 (NOTE-446), from the PubMed Central author manuscript. Worth reading as the standard statement that cognitive control is allocated by a cost-benefit decision. The “expected value of control” (EVC) of a control signal, which has an identity (which task) and an intensity (how much), is its expected payoff minus an intrinsic cost that rises with intensity. Dorsal anterior cingulate cortex is proposed to monitor and to specify the EVC-maximizing signal, which lateral PFC and subcortical structures then implement. It is a review and synthesis: the model is stated, not fitted, and the authors say the ingredients are not new. |
| LIT-586 | Précis of Breakdown of Will | Ainslie (2005), Behavioral and Brain Sciences 28(5), the précis of Breakdown of Will (2001). People and other animals discount delayed rewards hyperbolically, so preferences reverse as a smaller, sooner reward comes near, and a person becomes a population of reward-seeking “interests” that must forestall one another. Willpower is the bundling of future choices by treating the present one as a precedent: an intertemporal repeated prisoner’s dilemma, not an organ or a top-down ego. The same recursion predicts the will’s costs: legalism, circumscribed “lapse districts”, motivated blindness to lapses, and rules that favour countable goals over subtle ones. | Active — read in full 2026-10-03 (NOTE-443), as the substitute for the 2001 book (LIT-583), which the owner suggested and which the précis follows chapter by chapter. Worth reading as the shortest complete statement of picoeconomics in Ainslie’s own words. Hyperbolic discounting makes preference reverse as a smaller, sooner reward draws near, so a person behaves like a population of “interests” that bargain across time. Will is not a faculty above them but a recursive self-prediction: treating each choice as a precedent “bundles” future rewards, an intertemporal repeated prisoner’s dilemma in which “credibility is power”. The same mechanism predicts the will’s side effects: legalism, “lapse districts”, motivated misperception and compulsive over-control. |
| LIT-587 | The Normative Constitution of Agency | Korsgaard (2014), in Rational and Social Agency: The Philosophy of Michael Bratman (OUP), pp. 190–214. Two conceptions of agency are set side by side: natural (action is movement caused by the right mental state) and normatively constituted (action is movement backed by a unified agent, whose unity is achieved by following norms). Following the categorical and hypothetical imperatives gives action “the form of self-determined efficacy”. Choosing maxims under that form constitutes one’s practical identity. Self-consciousness of one’s own attitudes sets the task of unification. Unity of agency “is an achievement, not a given”, so people can literally act together. | Active — read in full 2026-10-03 (NOTE-455), in the author’s posted manuscript, not the typeset chapter. Worth reading as the read substitute for Self-Constitution (2009, LIT-597), which it summarises and extends, and as Korsgaard’s direct engagement with Bratman. Agency is “normatively constituted”: an action is a movement “backed by the agent as a whole”, and that unity is achieved by following the categorical and hypothetical imperatives, which give action “the form of self-determined efficacy”. The content of the maxims we choose under that form constitutes our “practical identities”. So “we make ourselves into agents”, and unity of agency, individual or collective, “is an achievement, not a given”. Argued, not proved; the account of reason as unification is said to be “lifted” from her other work. |
| 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-589 | Goal Striving, Need Satisfaction, and Longitudinal Well-Being: The Self-Concordance Model | Sheldon & Elliot (1999), JPSP 76(3):482–497. A goal is self-concordant when pursued for identified or intrinsic rather than external or introjected reasons. In three semester-long studies of students, self-concordance predicted sustained effort, which fully mediated its link to attainment; attainment raised well-being more when goals were self-concordant; and accumulated daily experiences of autonomy, competence and relatedness partly mediated attainment’s effect on well-being. Paths survived controls for self-efficacy, implementation intentions, avoidance framing and life skills. | Active — read in full 2026-10-03 (NOTE-448); worth reading as the canonical statement of the self-concordance model and its evidence. Goals pursued for identified or intrinsic reasons get more sustained effort, so are better attained (effort fully mediates, in Studies 1 and 3), and attaining them raises well-being more, partly through accumulated daily experiences of autonomy, competence and relatedness. The evidence is three semester-long correlational studies of students (N = 169, 152, 73), with structural models refitted after modification indices, and self-concordance is a self-report of reasons that cannot separate integration from identification. |
| LIT-595 | “First we invented stories, then they changed us”: The Evolution of Narrative Identity | McAdams (2019), Evolutionary Studies in Imaginative Culture 3(1):1–18. Narrative identity is “the internalized and evolving story a person invents to explain how he or she has become the person he or she is becoming”, giving a life “unity, moral purpose, and temporal coherence”. Storytelling evolved with human hypersociality. The self develops from social actor (by age 2) to motivated agent (school years) to autobiographical author (adolescence). Agentic and redemptive stories go with well-being and generativity, and cultures supply master narratives. “Biology guides and culture fills in the details.” | Active — read in full 2026-10-03 (NOTE-470), as the read substitute for McAdams & McLean, “Narrative Identity” (2013; LIT-572), which has no lawful copy and whose definition this essay takes over word for word. Worth reading as McAdams’s own short statement of narrative identity: “the internalized and evolving story a person invents to explain how he or she has become the person he or she is becoming”, which gives a life “unity, moral purpose, and temporal coherence”. It places the life story as the third layer of a self that develops from actor to agent to author, and reports that story features (agency, redemption, coherence) predict well-being and generativity. A review essay: the empirical claims are cited, not shown, and the evolutionary story is offered as plausible, not tested. |
| 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-602 | The Intimate Contest for Self-Command | Schelling (1980), The Public Interest, Summer 1980, pp. 94-118. People behave sometimes “as if they had two selves” in “continual contest for control”, and the tactics of self-management (removing the option, bright lines, monitoring, delays, raising the stakes) are the tactics of managing someone else. A single-dimension model of impatience fits poorly. Which self is authentic is left open. Failures of consumer self-management may be worth “on the order of a trillion dollars”. | Active — read in full 2026-10-03 (NOTE-452), in place of the 1984 Ely Lecture (LIT-573), which has no lawful free copy. Worth reading as Schelling’s own first statement of “egonomics”: a person sometimes behaves “as if they had two selves” that alternate in command, and the tactics people use on themselves (mittens, alarm clocks across the room, bright lines, Christmas savings, deadlines, delays) are the tactics they use to manage another person. It refuses to say which self is authentic in general, and it gives an order-of-magnitude estimate that failures of consumer self-management cost as much as all other consumer-ignorance problems together. |
| LIT-603 v2 | The Emperor’s New Markov Blankets | Bruineberg, Dołęga, Dewhurst & Baltieri (2020 preprint; BBS 45:e183, 2022). Markov blankets entered variational inference as Pearl’s conditional-independence shields, tools on a scientist’s map. In the free-energy literature since Friston 2013 they became boundaries in the world between agent and environment: “Friston blankets”. The two are different constructs; Friston blankets need extra assumptions (a chosen internal node, sensorimotor labels, steady state, sparse coupling) that the formalism does not supply. Using them for metaphysical conclusions (“inference within a model”) requires metaphysical premises; used instrumentally (“inference with a model”) they are innocent but philosophically idle. | Active — read in full 2026-10-03 (NOTE-447), but in its December 2020 PhilSci-Archive version; the Behavioral and Brain Sciences target article of 2021–2022 is, by the authors’ own note, “heavily rewritten” and could not be read lawfully beyond its abstract. Worth reading as the critique that names the problem: “Pearl blankets”, the conditional-independence tool of graphical models, are conflated with “Friston blankets”, a realist construct meant to be the boundary between an agent and its world. The second cannot be read off the mathematics of the first, and its use to settle questions about life and mind needs metaphysical premises of its own. It re-runs the primordial-soup simulation of LIT-526 and shows how the blanket found there depends on modelling choices. |
| LIT-605 | An Accumulator Model for Spontaneous Neural Activity Prior to Self-Initiated Movement | Schurger, Sitt & Dehaene (2012), PNAS 109(42). In Libet’s spontaneous movement task, a leaky stochastic accumulator, δx = (I − kx)Δt + cξ√Δt, with weak constant urgency I and a threshold, fitted only to waiting times, reproduces the averaged readiness potential (r² = 0.96): time-locking to threshold crossings averages up the autocorrelated noise that produced them. Fast responses to random interruptions were preceded by a slow negativity, as predicted. The “neural decision to move now” is the late threshold crossing, about 150 ms before movement, so Libet’s inference of an unconscious decision a half-second earlier is unfounded. | Active — read in full 2026-10-03 (NOTE-462); worth reading as the model that reinterprets the readiness potential. A leaky stochastic accumulator with a weak constant input (“urgency”), fitted with three parameters to 14 participants’ waiting times in Libet’s task, reproduces the shape of the averaged readiness potential (r² = 0.96) because averaging epochs time-locked to threshold crossings recovers the noise that happened to carry the accumulator there. Its prediction, that fast responses to unpredictable clicks are preceded by a slow negativity, was confirmed (13 participants). On this account the “neural decision to move now” is the threshold crossing about 150 ms before movement, not the onset of the readiness potential, and Libet’s inference that the brain decides before awareness is “unfounded”. The authors say plainly that this shows the readiness potential could reflect spontaneous fluctuation, not that it does. |
| LIT-606 | Thine Own Self: True Self-Concept Accessibility and Meaning in Life | Schlegel, Hicks, Arndt & King (2009), JPSP 96(2):473–490. Five studies: faster “me” judgments for one’s own true-self traits (residualized on speed for control traits) predict presence of meaning in life, while actual-self accessibility does not, controlling affect, need satisfaction and (Study 4) AI-3 authenticity, which was itself uncorrelated with true-self accessibility. Subliminal priming of true-self traits raised reported meaning (Studies 3 and 5), for disliked traits as much as liked ones. | Active — read in full 2026-10-03 (NOTE-469); worth reading as the experimental case that the true self-concept, as distinct from self-reported authenticity, matters to felt meaning. In five student studies (N = 56 to 149), how quickly people classify their own “true self” traits predicts presence of meaning in life over and above actual-self accessibility, need satisfaction and AI-3 authenticity, and subliminally priming true-self traits raises reported meaning, even when the traits are disliked. Effects are small, meaning is self-report only, and the Study 5 interaction is printed with an F that cannot carry its stated p. |
| LIT-607 | Natural Gradient Works Efficiently in Learning | Amari (1998), Neural Computation 10(2):251–276. When the parameter space carries a Riemannian metric G, the steepest descent direction of a loss is the natural gradient G⁻¹∇L, not the ordinary gradient. For a statistical model the metric is the Fisher information, the only invariant one. Online natural gradient learning with step 1/t is Fisher efficient: it attains the Cramér–Rao bound asymptotically, as well as the best batch estimator. The paper computes the metric and its inverse for a simple perceptron, for the group of nonsingular matrices (blind source separation, giving the update ∇L·WᵀW) and for linear systems, proposes an adaptive learning rate with 1/t convergence, and conjectures that the natural gradient escapes the plateaus of backpropagation. | Active — read in full 2026-10-03 (NOTE-472); worth reading as the source of the natural gradient: steepest descent in a Riemannian parameter space is G⁻¹∇L (Theorem 1), the Fisher information is the metric on a statistical model, and online learning with the natural gradient and a 1/t rate is Fisher efficient (Theorem 2). Its efficiency proof needs the Fisher matrix at the optimum to be invertible, which is exactly what singular learning theory says fails for neural networks. |
| LIT-608 | Deep Equals Shallow for ReLU Networks in Kernel Regimes | Bietti & Bach (2021), ICLR 2021. Dot-product kernels on the sphere are diagonal in spherical harmonics, with one eigenvalue µ_k per degree k shared by N(d, k) ~ k^(d−2) harmonics. Theorem 1 reads the asymptotic decay of µ_k off the kernel function’s expansion at ±1: a non-integer exponent ν there gives µ_k ~ k^(−d−2ν+1). The arc-cosine kernels have ν = 1/2 and 3/2, and composing them preserves ν, so the NTK of a deep ReLU network decays as k^(−d) and its random-feature kernel as k^(−d−2), exactly as for two layers. Deep and shallow ReLU kernels therefore have the same RKHS, the same as the Laplace kernel’s for the NTK. | Active — read 2026-10-03 (NOTE-475): main text and Appendix A in full, the proofs in Appendices B and C followed at the level of their lemmas. Worth reading as the general rule behind the NTK eigenvalue decays the record holds: for a dot-product kernel on the sphere, the decay of its spherical-harmonic eigenvalues is fixed by the kernel function’s non-integer exponent at the endpoints ±1 (Theorem 1). Deep ReLU kernels keep the shallow exponent, so depth leaves the spectrum’s shape unchanged: µ_k ~ C(d, L) k^(−d) for the NTK and k^(−d−2) for the random-feature kernel, with only the constant growing in L (Corollaries 2–3). |
| LIT-609 | Bayesian hypothesis testing for psychologists: A tutorial on the Savage–Dickey method | Wagenmakers, Lodewyckx, Kuriyal & Grasman (2010), Cognitive Psychology 60(3):158–189. For nested models, H0: φ = φ0 inside H1, the Bayes factor BF01 equals the ratio of the posterior to the prior density of φ at φ0 under H1 (Eq. 12), if the nuisance parameters’ prior under H1 tends to their prior under H0 as φ → φ0. So a Bayes factor can be read off MCMC samples from the larger model alone, with a nonparametric density estimate at one point. Order restrictions are handled by truncating prior and posterior. Three worked psychology examples, including hierarchical one- and two-sample t-tests. Limitations stated in §8: density estimates in the tails, nested models only, and the Borel–Kolmogorov paradox. | Active — read in full 2026-10-03 (NOTE-484); worth reading as the record’s working statement of the Savage–Dickey density ratio: for nested models, the Bayes factor for a point null φ = φ0 is the height of the posterior for φ at φ0 divided by the height of the prior there (Eq. 12), provided the nuisance parameters’ prior under the alternative, as φ → φ0, equals their prior under the null. Its derivation is Appendix A. Read it for the condition and for the limitations of §8 (density estimation in the tails, nested models only, the Borel–Kolmogorov paradox), not for the psychology examples, which are illustrations. |
| LIT-610 v2 | The Weighted Likelihood Ratio, Linear Hypotheses on Normal Location Parameters | Dickey (1971), Annals of Mathematical Statistics 42(1):204–223. The Bayes factor (“weighted likelihood ratio”) for a sharp hypothesis η(θ) = η_H equals the alternative’s posterior density of η at η_H over its prior density there (3.9), if the nuisance prior under the null is the alternative’s prior conditioned at η_H (3.8). Dickey calls this Savage’s density ratio and credits the proof to Dickey & Lientz. With conjugate priors he gives closed-form Bayes factors for a normal mean, for a linear hypothesis in the linear normal model as a replacement for the F test, and for the Behrens–Fisher problems. | Active — read in full on 2026-10-03 (NOTE-508) from an owner-supplied JSTOR scan, via OCR checked against the page images; worth reading as the original general statement of the Savage–Dickey ratio: for a sharp hypothesis η(θ) = η_H with positive prior mass, the Bayes factor is the posterior-to-prior density ratio of η at η_H under the alternative (3.9), exactly, if the null’s nuisance prior is the alternative’s prior conditioned at η_H (3.8), stated for any likelihood continuous in θ before the normal-theory applications. |
| LIT-611 | Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2 | Lieberum et al. (2024), Google DeepMind technical report. Gemma Scope releases JumpReLU sparse autoencoders trained on the attention, MLP and residual-stream activations of every layer of Gemma 2 2B and 9B, and of three layers of 27B: over 400 SAEs, over 2,000 counting sparsity variants, and over 30 million latents. Each latent fires only above a learned threshold θ_i, and training penalises the L0 count of active latents directly, through straight-through estimators. Evaluation is by sparsity–fidelity curves (delta LM loss and FVU against mean L0). Base-model SAEs transfer to the instruction-tuned model, wider SAEs split latents, and the authors state that no agreed metric of SAE quality exists. | Active — read in full 2026-10-03 (NOTE-482). Worth reading as the technical report for the open SAE suite that later SAE studies, including the anthology’s, are run on, and as the clearest statement of what a JumpReLU SAE is. A JumpReLU SAE is a learned hard threshold per latent, z ⊙ H(z − θ), trained against squared reconstruction error plus λ‖f(x)‖₀ (Eqs. 3–4). The report releases over 400 such SAEs (over 2,000 counting the sparsity variants) on every layer and sublayer of Gemma 2 2B and 9B and on three layers of 27B. Its evaluations are sparsity–fidelity curves, with no criterion offered for choosing a width or a sparsity; the authors say there is no consensus on what measures SAE quality. |
| LIT-612 | The Convergence Rate of Neural Networks for Learned Functions of Different Frequencies | Basri, Jacobs, Kasten & Kritchman (2019), NeurIPS 2019. In the linearised dynamics of a wide two-layer ReLU network, on uniform data on a sphere, the Gram matrix H∞ is a convolution, so its eigenvectors are Fourier modes or spherical harmonics. Its eigenvalues are computed in closed form per frequency. Without bias, every odd frequency k ≥ 3 has eigenvalue zero, so the network cannot represent or learn it (Theorems 2 and 4). With a zero-initialised bias all frequencies pass. The eigenvalues fall as 1/k² on S¹ and, numerically, about 1/k^(d+1) on S^d, so the time to learn frequency k grows as k² and k³ on the circle and the 2-sphere. Deep and residual networks show the same exponents. | Active — read 2026-10-03 (NOTE-481): main text in full, the supplementary derivations of the S^d eigenvalues skimmed. Worth reading for the closed-form NTK eigenvalues per frequency and the exact null space they reveal. On the circle the bias-free two-layer ReLU kernel has eigenvalue 2(k²+1)/(π²(k²−1)²) on even k ≥ 2 and exactly zero on odd k ≥ 3 (Eq. 12), so such a network cannot represent cos 3θ at all (Theorems 2 and 4). A zero-initialised bias fills the null space, with 1/(π²k²) on odd k (Eq. 13). Convergence time then grows as k² on S¹ and about k³ on S², and shallow, deep and residual networks match: fitted exponents 1.93–2.15 on S¹ and 2.74–3.13 on S² (Figs. 6–7). |
| LIT-613 | Traces of Class/Cross-Class Structure Pervade Deep Learning Spectra | Papyan (2020), JMLR 21(252). Cross-entropy indexes every deepnet quantity by example, class and would-be class, a two-way MANOVA layout. In the spectra of features, backpropagated errors, gradients, the Fisher, the Hessian and weights, knockouts attribute the top outlier to the global mean, C−1 outliers to between-class second moment, a mini-bulk of C(C−1) to between-cross-class covariance, and the main bulk to within-cross-class covariance. Feature and error class means separate from the bulk and become orthogonal with depth. Gradient class means are approximately feature class means ⊗ error class means, layer by layer; K-FAC’s single Kronecker product misaligns the Fisher’s outliers and the class-wise CFAC aligns them. For multinomial logistic regression on a Gaussian class model the expected Fisher spectrum is derived exactly. | Active — read 2026-10-03 (NOTE-474); worth reading as the general account of class/cross-class structure in deepnet spectra: features, backpropagated errors, gradients, Fisher, Hessian and weights all show one outlier from the global mean, C−1 from class means, a mini-bulk of about C(C−1) from cross-class means, and a main bulk from within-class variation. Per layer, gradient class means are approximately Kronecker products of feature class means and error class means, which is why K-FAC, pairing every class with every class, misaligns the Fisher’s outliers, and CFAC, pairing each class with itself, aligns them. Proved only for multinomial logistic regression on a Gaussian model. |
| LIT-614 | Bayesian model reduction | Friston, Parr & Zeidman (2018; v2 2019), arXiv:1805.07092. A review of Bayesian model reduction: given a fitted full model’s prior P, approximate posterior Q and free energy F, the free energy of a model with any other prior P̃ is ln E_Q[P̃/P] + F, and its posterior follows by reweighting Q (Eqs. 9–10). Closed forms are given for Gaussian, Dirichlet, beta, gamma, categorical and multinomial priors. Three worked simulations (sparse regression, cluster pruning in a Gaussian mixture, network discovery in a linear dynamical system) and a review of uses: structure learning, hierarchical (PEB) inversion as a cascade of reductions, and “sleep-like” pruning in active-inference agents. | Active — read in full 2026-10-03 (NOTE-477); worth reading as the reference statement of Bayesian model reduction (BMR): the reduced free energy F[P̃:P] ≈ ln E_Q[P̃/P] + F[P] (Eq. 9), which the authors call a generalisation of the Savage–Dickey ratio “to any new prior”, with closed forms for Gaussian, Dirichlet, beta, gamma, categorical and multinomial priors (Eqs. 11–12, Table 1). The Dirichlet form is what lets active-inference agents prune their own likelihood mappings. Its examples are simulations, and its review of applications is of the authors’ own lab. |
| LIT-615 | An Active Inference Approach to Modeling Structure Learning: Concept Learning as an Example Case | Smith, Schwartenbeck, Parr & Friston (2020), Front. Comput. Neurosci. 14:41. A partially observed Markov decision process with eight animal “slots”, some starting with flat likelihoods, learns new concepts without feedback: a slot is engaged only when its flat mapping explains a feature combination better than any learned concept. Bayesian model reduction on the learned prior over states then resets slots the data did not need. In 100 runs per condition the true number of concepts won in 45–80% of runs for 4–7 concepts and rarely for 2–3, and in every run when the likelihood was given. The agent also generalises to an unseen animal in one shot, and the paper simulates neural and dopaminergic responses. | Active — read in full 2026-10-03 (NOTE-485); worth reading as the record’s worked example of structure learning in an active-inference agent: “model expansion” by spare hidden-state slots whose flat likelihoods win inference only for a truly novel stimulus, and “model reduction” by applying Bayesian model reduction to the agent’s learned prior over states, so that unused slots are reset. It is a proof of concept with eight animals and six features. Reduction recovered the true number of concepts in 45–80% of 100 runs for 4–7 concepts, failed for 2–3, and succeeded every time only when the likelihood mapping was given rather than learned. |
| LIT-616 | A Widely Applicable Bayesian Information Criterion | Watanabe (2012), arXiv:1208.6338; JMLR 14:867–897 (2013). A model is singular when the parameter-to-distribution map is not one-to-one or the Fisher information is not positive definite: neural networks, mixtures, reduced-rank regression, HMMs. Its Bayes free energy is nL_n(w0) + λ log n − (m − 1) log log n + O_p(1), with λ the real log canonical threshold (RLCT), not d/2. WBIC, the posterior average of nL_n(w) at inverse temperature 1/log n, has the same leading terms even for singular, unrealizable models, equals BIC for regular ones, and needs no knowledge of the true distribution. Two temperatures give an estimate of λ. In reduced-rank regression WBIC picked the true rank in 100 of 100 trials and recovered theoretical RLCTs closely. | Active — read in full 2026-10-03 (NOTE-473); worth reading as the record’s lawful, short statement of the core of singular learning theory, standing in for Watanabe’s unread book (LIT-354). It states the Bayes free energy asymptotics F = nL_n(w0) + λ log n − (m − 1) log log n + O_p(1), with λ the real log canonical threshold and m its multiplicity (Theorem 2), and defines λ through resolution of singularities (Theorem 1, Eq. 18). Its own result is WBIC, the posterior mean of nL_n(w) at inverse temperature 1/log n, which matches F to the λ log n term even for singular and unrealizable models (Theorem 4), equals BIC for regular ones (Theorem 5), and estimates λ from two temperatures (Corollary 3). The prior results are stated with citations to the book, not re-proved. |
| LIT-617 | The Full Spectrum of Deepnet Hessians at Scale: Dynamics with SGD Training and Sample Size | Papyan (2018), arXiv. Stochastic Lanczos without reorthogonalization (O(Mnp) time, O(p) memory) plus subspace-iteration deflation measures the full Hessian spectrum of VGG11 and ResNet18 on MNIST, Fashion-MNIST and CIFAR-10/100, over 16,000 trained models. It confirms a bulk with about C outliers, attributes the outliers to the Gauss–Newton term G and most of the bulk to the residual H, finds H’s spectrum symmetric with a power-law tail rather than Marchenko–Pastur, and finds H never negligible. Version 2 decomposes G into class means (outliers), cross-class variation and within-class variation (two bulks) and tracks them across epochs and sample sizes. | Active — read 2026-10-03 (NOTE-478); worth reading as the measurement that the bulk-and-C-outliers spectrum of the Hessian persists at full scale (VGG11, 28M parameters), that the outliers belong to the Gauss–Newton/Fisher term G and the bulk mostly to the residual H, and, in its second version, that G splits into class means (outliers) and two bulks (cross-class and within-class variation). Its tools are stochastic Lanczos spectral density estimation without reorthogonalization, plus subspace-iteration deflation. |
| LIT-618 | Prevalence of Neural Collapse during the terminal phase of deep learning training | Papyan, Han & Donoho (2020), PNAS 117(40). Training past zero error (the terminal phase, TPT) drives four linked phenomena in the last layer: within-class variability collapses (Tr(Σ_WΣ_B†)/C → 0), centred class means become equinorm and equiangular with cosines −1/(C−1), a simplex ETF; classifier rows become proportional to the means; and the decision becomes nearest class mean. Measured on MNIST, Fashion-MNIST, SVHN, CIFAR-10/100, STL10 and ImageNet with VGG, ResNet and DenseNet, 480 models. Test accuracy and DeepFool robustness keep improving during TPT. Theorems: NC1–NC2 imply NC3–NC4 for the Webb–Lowe and Soudry max-margin classifiers, and the simplex ETF uniquely maximizes the small-noise error exponent. | Active — read in full 2026-10-03 (NOTE-476); worth reading as the source of neural collapse: in the terminal phase of training, last-layer features collapse to their class means (NC1), the centred means form a simplex equiangular tight frame (NC2), the classifier aligns with them (NC3) and the decision becomes nearest class centre (NC4). Measured on 7 datasets × 3 architectures; NC1–NC2 imply NC3–NC4 for the Webb–Lowe and max-margin classifiers, and the simplex ETF is the unique optimal codebook in a vanishing-noise Gaussian channel. It explains Papyan’s Hessian outliers as class means outgrowing collapsing within-class variation. |
| LIT-619 | Measurements of Three-Level Hierarchical Structure in the Outliers in the Spectrum of Deepnet Hessians | Papyan (2019), ICML. For a C-class network the Gauss–Newton term of the Hessian is G = (1/n)ΔΔᵀ, a second moment (not covariance) of logit derivatives δᵢ,c,c′ indexed by example, true class and logit. Grouping them into C² group means δc,c′ and C clusters with centres δc gives G = G₀ + G₁ + G₂ + G₃ (Eq. 28). The top-C outliers of G are those of G₁ = (C−1)Ave_c δcδcᵀ, because clusters are far apart and tight. Early in training the group means cluster by logit c′, later by true class c. Holds across MNIST, Fashion-MNIST, CIFAR-10 and ImageNet with VGG, ResNet and DenseNet; the outliers exceed their approximations slightly, as random matrix theory would predict. | Active — read in full 2026-10-03 (NOTE-479); worth reading as the paper that explains the C outliers of the deepnet Hessian: the Gauss–Newton/Fisher term G is a second moment, not a covariance, of logit derivatives indexed by (example, class, logit), and the C outliers are the eigenvalues of G₁ = (C−1)·Ave_c δ_c δ_cᵀ, the C class-cluster centres, computable from a C×C Gram matrix without high-dimensional eigenanalysis. The match is empirical, over 18,000 trained models. |
| LIT-620 | Post hoc Bayesian model selection | Friston & Penny (2011), NeuroImage 56(4):2089–2099. If every model of interest is a full model with a different prior and the same likelihood, the evidence of any reduced model is p(y|m_F) times the full posterior expectation of p(θ|m_i)/p(θ|m_F) (Eq. 3). So the reduced models never have to be fitted. A point-mass reduced prior gives the Savage–Dickey ratio (Eq. 6). Under Gaussian priors and posteriors the reduced free energy and posterior are closed-form in the full model’s means and precisions (Eq. 9). In simulations an exhaustive search over 4,096 linear models finds the four true regressors, and 64 network models find the true three-connection graph. | Active — read in full 2026-10-03 (NOTE-487); worth reading as the source of Bayesian model reduction: if a set of models differ from a full model only in their priors, the evidence of each is the full model’s evidence times the posterior expectation of the prior ratio (Eq. 3), so one inversion scores them all. Under Gaussian (Laplace) posteriors the reduced free energy is closed-form (Eq. 9). The Savage–Dickey ratio is the point-mass special case (Eq. 6), and ARD and model selection are the same evidence maximisation over prior hyperparameters. The demonstrations are simulations, and whether the reduced free energy of a nonlinear model is a good proxy for the free energy of the reduced model is left open by the authors. |
| LIT-621 | Shampoo: Preconditioned Stochastic Tensor Optimization | Gupta, Koren & Singer (2018), ICML. For a parameter tensor of order k, Shampoo keeps one preconditioner per dimension, each the gradient contracted with itself over all other dimensions, and multiplies the gradient along dimension i by (Hⁱ)^{-1/2k}. In the matrix case this is W ← W − η L^{-1/4} G R^{-1/4}, equivalent to preconditioning the flattened gradient by (L ⊗ R)^{1/4}, which upper-bounds the full-matrix AdaGrad preconditioner up to the gradient rank (Lemma 8). Regret is O(√T) in online convex optimization (Theorems 7, 10). On CIFAR-10/100 and LM1B it converges faster than SGD with momentum, Adam and AdaGrad at similar step time. | Active — read 2026-10-03 (NOTE-480); worth reading as the source of per-dimension Kronecker preconditioning: for a matrix parameter, left and right statistics L = Σ GGᵀ and R = Σ GᵀG, update W ← W − η L^{-1/4} G R^{-1/4}, i.e. a step preconditioned by (L ⊗ R)^{1/4}, which by Lemma 8 dominates the full AdaGrad matrix. Its statistic is the accumulated gradient outer product, not the Fisher; its guarantee is an O(√T) regret in online convex optimization; its deep-learning evidence is four training curves. |
| LIT-622 | Optimizing Neural Networks with Kronecker-factored Approximate Curvature | Martens & Grosse (2015), ICML. K-FAC approximates natural gradient descent in neural networks. Each Fisher block between layers i and j, E[āᵢ₋₁āⱼ₋₁ᵀ ⊗ gᵢgⱼᵀ], is replaced by E[āᵢ₋₁āⱼ₋₁ᵀ] ⊗ E[gᵢgⱼᵀ] (activations times backpropagated derivatives), whose error is a sum of third- and fourth-order cumulants. The inverse is then taken as block-diagonal or block-tridiagonal across layers. With factored Tikhonov damping, re-scaling by the exact Fisher, an adaptive momentum and a growing mini-batch, it needs orders of magnitude fewer iterations than tuned SGD with Nesterov momentum on three deep autoencoder benchmarks, and it is invariant to affine reparameterizations of each layer’s inputs and pre-activations. | Active — read in full 2026-10-03 (NOTE-486); worth reading as the source of the Kronecker-factored Fisher: each layer’s Fisher block E[āāᵀ ⊗ ggᵀ] is approximated by E[āāᵀ] ⊗ E[ggᵀ], so it inverts as two small matrices, and the inverse is further taken as block-diagonal or block-tridiagonal across layers. The factorization is justified by small higher-order cumulants, checked on one small tanh network; the speedups are on three deep autoencoders. |
| LIT-623 v2 | Bayesian Interpolation | MacKay (1992), Neural Computation 4(3):415–447. Two levels of inference: fit each model, then rank models by their evidence P(D|H). Under a Gaussian approximation the evidence is the best-fit likelihood times an Occam factor, the ratio of posterior to prior accessible parameter volume, so complex or finely tuned models penalise themselves (Eqs. 5–6). For linear interpolation with quadratic regularisers the evidence sets the regularising constant and the noise level through γ, the number of well-determined parameters (2αE_W = γ, 2βE_D = N − γ). It ranks polynomial, radial-basis, spline, Hermite and neural-network models on two data sets. In expectation, no fixed model’s log evidence beats the true model’s. | Active — read in full 2026-10-03 (NOTE-471); worth reading as the source of the evidence framework and the Occam factor in the form the field uses: evidence ≈ best-fit likelihood × Occam factor, the Occam factor being the ratio of posterior to prior accessible parameter volume, (2π)^{k/2} det^{-1/2}A · P(w_MP|H) under a Gaussian approximation (Eqs. 5–6). It also gives the “number of good parameter measurements” γ = Σ λ_a/(λ_a + α), which sets the regularising constant (2αE_W = γ) and the noise level (2βE_D = N − γ) at the evidence maximum. The framework is Gull and Skilling’s, as MacKay says, and every demonstration is one-dimensional interpolation. Flagged anthology-candidate for its regularisation and early-stopping arguments. |
| LIT-624 | Towards Understanding the Spectral Bias of Deep Learning | Cao, Fang, Wu, Zhou & Gu (2019). For a two-layer ReLU network trained by gradient descent on squared loss, the training residual projected onto the eigenfunctions of the NTK integral operator with the r_k largest eigenvalues decays like (1 − λ_(r_k))^T (Theorem 4.2). This holds for any labelling, provided the sample size beats the eigengap and the width is polynomial in λ_(r_k)^(−1). On uniform data on S^d the eigenfunctions are spherical harmonics, with µ_k = Ω(k^(−d−1)) for k ≫ d and Ω(d^(−k+1)) for d ≫ k on even degrees, and µ_k = 0 on odd k ≥ 3 (Theorem 4.3). Lower degrees are learned first, faster, and with fewer samples and narrower networks. | Active — read 2026-10-03 (NOTE-483): main text and Appendix A in full, the proofs in Appendix B followed at the level of their lemmas. Worth reading as the theorem that makes “spectral bias” a statement about NTK eigendirections: for a two-layer ReLU network trained by gradient descent, the residual projected onto the top r_k eigenfunctions of the NTK integral operator shrinks like (1 − λ_(r_k))^T (Theorem 4.2), for any target, with sample size governed by the eigengap λ_(r_k) − λ_(r_k+1). On uniform spherical data the eigenfunctions are spherical harmonics, the odd degrees above 1 have eigenvalue zero, and µ_k = Ω(max(k^(−d−1), d^(−k+1))) for even k (Theorem 4.3). |
| LIT-625 | Functional Role and Truth Conditions | Block (1987), Aristotelian Society Supplementary Volume 61:157–181, the first paper of a symposium with John Campbell. Functional role semantics can explain five facts about concepts (holism of concepts and thoughts, incommensurability, limits on attributing irrationality, structure). To give Twin Earth truth conditions, a private-use theory must add a referential factor; a public-use theory must extend roles into the world with devices from the theory of reference (dominant causal source, borrowed reference, experts). Either way the result is equivalent to a two-factor theory whose internal factor is narrow meaning. Burge’s arthritis cases need, in addition, functional role in a language with its structure of deference. | Active — read in full 2026-10-03 (NOTE-492); worth reading as the work the record cites as “Block 1987” (NOTE-117, after Drayson): a short argument that any use theory of meaning that gets Twin Earth truth conditions right, whether it starts from private use in thought or public use in communication, ends up equivalent to a two-factor theory with a narrow, in-the-head functional role and a referential factor. It leaves room for narrow content without arguing for it, and its appendix concedes that Burge’s arthritis cases need functional role in a language, structured by deference, as well as in the individual. Block says outright that he has not tried to settle whether narrow content is explanatory. |
| LIT-626 | Three types of phenomenal consciousness and their functional roles: unfolding the ALARM theory of consciousness | Newen & Montemayor (2025), Phil. Trans. R. Soc. B 380:20240314. The ALARM theory: phenomenal consciousness has two levels of experience and three functions. Basic arousal, realisable without cortex, alarms the body when a homeostatic variable leaves its tolerance range, overriding slow regulation with no choice involved; it adds lasting care for the injury and one-shot, generalised avoidance learning. General alertness, cortical and attention-guided, enables flexible learning and decision-making. Reflexive self-consciousness is general alertness with metacognitive self-relational content, not a third kind of experience, and enables long-term planning that accounts for one’s own and others’ mindsets. IIT, higher-order theories and GNWT are faulted for tying consciousness to neocortex and leaving basic arousal out. | Active — read in full 2026-10-03 (NOTE-489); worth reading as the shortest statement of the ALARM theory: phenomenal consciousness has two levels of experience, basic arousal (subcortical, an alarm that overrides slow homeostatic regulation) and general alertness (cortical, attention-guided, for flexible learning and choice), plus reflexive self-consciousness, which is general alertness with metacognitive self-relational content and its own function, long-term planning. Its evidence is a short list of cited findings (hydranencephaly, decorticate cats, central lateral thalamus stimulation in macaques), and the functional claims are argued, not tested. |
| LIT-628 | Homeostatic feelings and the biology of consciousness | Damasio & Damasio (2022), Brain 145(7):2231–2235, an Essay. Consciousness occurs when mind contents are spontaneously identified as belonging to their organism, and a continuous flow of homeostatic feelings (hunger, pain, well-being, plain feelings of existence) supplies that identification and “lends” consciousness to exteroceptive images. Feelings are hybrid: interoceptive pathways are unmyelinated, partly non-synaptic and unprotected by a blood–brain barrier, so the body and its neural map interact directly. Posterior brainstem lesions abolish consciousness where large cortical ones may not; consciousness needs “a partnership of nervous systems with the bodies they serve”. | Active — skimmed 2026-10-03 (NOTE-507): every section was covered, but through a fetch tool that returned section-by-section accounts with short quotes, not a verbatim copy, so the quotes are unchecked; worth reading as the shortest complete statement of the Damasios’ claim that consciousness is the spontaneous identification of mind contents as one’s own, supplied by a continuous flow of homeostatic feelings, which are hybrid: in interoception the map and the body it maps interact and “commingle”. It is a five-page Essay with no data. Its evidence is clinical and cited (brainstem coma versus cortical lesions, general anaesthesia), and its mechanism is the cellular contrast in Table 1: unmyelinated, non-synaptic, barrier-free interoceptive pathways. |
| LIT-629 | Two neural correlates of consciousness | Block (2005), Trends in Cognitive Sciences 9(2):46–52. There are at least two neural correlates of consciousness: a phenomenal NCC, the minimal basis of an experience’s content (recurrent activation of MT/V5 with V1 for seen motion), and an access NCC, frontoparietal activation that broadcasts the content in a global workspace. Because access is a winner-take-all competition, a recurrent sensory representation can lose and stay unaccessed. Signal-detection analyses of exclusion tasks and of V1 figure–ground modulation in monkeys suggest experience without access. | Active — read in full 2026-10-03 (NOTE-496); worth reading as the short empirical turn of Block’s distinction: a phenomenal NCC (recurrent activity in sensory areas, such as MT/V5 with V1 for seen motion) and an access NCC (frontoparietal broadcasting), with a winner-take-all contest for access as the reason the first can occur without the second. Its evidence is signal-detection reasoning: Supèr et al.’s V1 figure–ground modulation persists when low salience or many catch trials uncouple it from the monkey’s saccade. The case is suggestive, “a glimmer”, and the later papers make it at length. |
| LIT-630 | The Mind as the Software of the Brain | Block (1995), in Smith & Osherson (eds.), An Invitation to Cognitive Science, 2nd ed., vol. 3, Thinking, MIT Press, ch. 11, pp. 377–425. The computer model explains intelligence by decomposing it into ever stupider processors that bottom out in primitive processors, the only devices for which behaviourism is true. The brain is a syntactic engine driving a semantic engine, by an isomorphism between symbol transitions and rational relations among meanings, which must hold counterfactually, so a wall is not every computer. Intentionality comes from the language of thought plus functional role semantics. Stich’s syntactic theory falls to the “Reductionist Cruncher”, and the systems reply answers Searle, though Block doubts the Chinese system is phenomenally conscious. | Active — read in full 2026-10-03 (NOTE-490); worth reading as Block’s textbook statement of what “the mind is the software of the brain” means: intelligence explained by functional decomposition into primitive processors, the brain as a syntactic engine driving a semantic engine, intentionality explained by the language of thought plus functional role semantics, and the defence of that picture against Dennett’s objections, Stich’s syntactic theory (by the “Reductionist Cruncher”) and Searle’s Chinese room. It is a survey for an introductory volume, so its arguments are compressed, but it states clearly two things the record uses: intelligence is future-oriented and intentionality past-oriented, and the computer model may give intentionality without phenomenal consciousness. |
| LIT-631 | Conscious Processing and the Global Neuronal Workspace Hypothesis | Mashour, Roelfsema, Changeux & Dehaene (2020), Neuron 105(5):776–798. A review of the global neuronal workspace hypothesis by its proponents. Conscious access is a sudden, non-linear ignition of a distributed network of long-range pyramidal neurons, with prefrontal cortex a key hub, that amplifies, sustains and broadcasts one representation; unseen stimuli produce only a decaying wave. Evidence: a late (>200–300 ms) divergence between seen and unseen trials across modalities, prefrontal ignition in monkeys tied to the signal-detection threshold, and the disconnection of frontal-parietal networks by every major class of anaesthetic. | Active — read in full 2026-10-03 (NOTE-510); worth reading as the record’s first source statement of the global neuronal workspace (GNW): conscious access is a non-linear “ignition” in which recurrent loops among long-range prefrontal, parietal and other hub neurons amplify, sustain and broadcast one representation to the brain’s specialised processors. Its strongest evidence is van Vugt et al.’s (2018) monkey recordings, where seen and unseen stimuli both drive V1 and V4 but only seen ones (and false alarms) ignite sustained prefrontal firing, and the signal-detection threshold maps onto the ignition threshold. It is a review by the theory’s proponents, explicitly a theory of access, and it concedes that the four leading theories cannot yet be told apart experimentally. |
| LIT-632 | Comparing the Major Theories of Consciousness | Block (2009), in Gazzaniga (ed.), The Cognitive Neurosciences, 4th ed., MIT Press, ch. 77, pp. 1111–1122. Compares the three theories neuroscientists take most seriously: higher-order thought, the global workspace and the biological theory. Only the biological theory fully acknowledges the explanatory gap; the others replace it with a puzzle their own theory creates. Concept dualism stops the gap becoming dualism. The ambitious higher-order theory also fails on stipulation, mismatch and infants. Integrated information is criticised as a theory of intelligence. The biological theory is the least friendly to machine consciousness. | Active — read in full 2026-10-03 (NOTE-505); worth reading as Block’s comparison of the higher-order thought, global workspace and biological theories by one test: does the theory recognise the explanatory gap? The ambitious higher-order theory and the workspace theory turn the gap into a puzzle of their own making, so only the biological theory “fully acknowledges” it; concept dualism keeps that from becoming dualism. Also the source of the “biological theory” that Chalmers’s meta-problem paper cites as “Block 2009”, and a short argument that the biological theory is less friendly to machine consciousness than its rivals. |
| LIT-633 | Cross-region neuron co-firing mediated by ripple oscillations supports distributed working memory representations | Verzhbinsky, Daume, Cheng, Rutishauser & Halgren (2026), Nature Neuroscience 29:2566–2577. In 1,373 single units from hippocampus, amygdala, vmPFC, ACC and preSMA of 35 epilepsy patients doing a Sternberg task, ripples (70–100 Hz) co-occur between bundles up to about 220 mm apart with no decline beyond the local bundle, and cross-region unit co-firing rises about 30% during co-ripples. That rise exceeds a rate-only null (STTC 117% higher), grows with memory load, and co-ripples hold more repetitions of a stimulus’s encoding co-firing at retrieval, more on fast trials. | Active — read in full 2026-10-03 (NOTE-494); worth reading as single-unit evidence that brief co-occurring ~90 Hz ripples in distant human forebrain sites (up to about 220 mm, across hemispheres) mark windows of raised cross-region co-firing, about 30% above no-ripple periods and beyond what firing rates alone predict, that this scales with working-memory load, and that stimulus-specific co-firing from encoding recurs more often inside co-ripples at retrieval, most of all on fast trials. One reanalysed open dataset (35 patients, one Sternberg task, load 1 versus 3), clinically placed electrodes, and correlational throughout: nothing perturbs the ripples. |
| LIT-634 | Inverted Earth | Block (1990), Philosophical Perspectives 4:53–79. Inverted Earth has complementary colours and inverted colour words, so a visitor with colour-inverting lenses notices nothing. After long residence, or for a twin raised there with a molecule-for-molecule identical brain, the intentional content of the experience of the sky inverts (it is about yellow) and so does its functional role in a long-arm description, while qualitative content stays the same. So qualitative content is not a functional state and the intentional/qualitative distinction stands. Public colour terms like “looks red” express intentional, not qualitative, content. A brain-internal functional theory of qualia would escape, but nobody has said what it is. | Active — read in full 2026-10-03 (NOTE-504); worth reading as the source of the Inverted Earth argument: a subject moved, unaware, to a planet of complementary colours and inverted colour words keeps the same qualitative content while, over time, the intentional content and the (long-arm) functional role of the experience invert. That is the converse of the inverted spectrum, and it needs no internal switch, so the subject’s testimony is undisturbed and brain supervenience is on the qualia realist’s side. It refutes functionalism about qualia only in its long-arm form; Block concedes a short-arm functional theory of qualia would sink it, and answers that only with a burden of proof. |
| LIT-635 | Mental Paint | Block (2003), in Hahn & Ramberg (eds.), Reflections and Replies, MIT Press, pp. 165–200. Phenomenal character outruns representational content. Internalist representationism must find a functional difference for every phenomenal one, and Erisa, raised where colours keep changing, has vivid colour differences with no abiding functional ones. Against externalist representationism: a swampman has phenomenal character and no content; attention is not awareness, so transparency fails as a claim about awareness; on Inverted Earth what stays the same is mental paint; and normal variation in colour vision means, if representationism is true, that a standard chip cannot look its shade to both men and women. | Active — read in full 2026-10-03 (NOTE-511); worth reading as Block’s fullest case against representationism about phenomenal character (“phenomenism” against “representationism”). It separates mental paint (phenomenal properties that represent) from mental oil (phenomenal properties that do not), argues against internalist representationism with Erisa, raised among colours that keep changing, and against externalist representationism with Inverted Earth, long-term memory, and an empirical “shifted spectra” argument from normal variation in cone sensitivity and in where people place unique green. Several of its arguments are offered as pressure, not proof, and Block says so. |
| LIT-637 | What Is Wrong with the No-Report Paradigm and How to Fix It | Block (2019), Trends in Cognitive Sciences 23(12):1003–1013. Whether perceptual consciousness needs prefrontal circuits cannot be settled by no-report paradigms, because subjects not asked to report may still think about what they see, and that thought tracks the percept. A no-post-perceptual-cognition paradigm is needed. Brascamp et al.’s rivalry with inconspicuous switches is one, and it found no detectable prefrontal difference. Box 2 argues that binocular rivalry is driven by local features, against the predictive-processing account. | Active — read in full 2026-10-03 (NOTE-495); worth reading as the argument that removing report does not isolate the neural basis of conscious perception, because subjects, monkeys included, can still think about what they see (“the bored monkey problem”). What is needed is a paradigm with no post-perceptual cognition that differs between percepts. Brascamp et al.’s inconspicuous binocular rivalry, whose switches subjects could not tell from constant random changes, is offered as one, and found no prefrontal difference by fMRI. Block flags that fMRI may be too coarse, and that ECoG could still favour prefrontalism. |
| 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-639 | The Harder Problem of Consciousness | Block (2002), The Journal of Philosophy 99(8):391–425. For anyone who is both a naturalist (physicalism is the default) and a phenomenal realist (consciousness is real and not defined by function), a merely superficial functional isomorph of us with a different physical basis, “Commander Data”, poses a harder problem than the hard one. We have no conception of evidence that could show whether he is conscious, so physicalism is the default yet inaccessible, and it is the subjective default that he is not conscious though the question is open. Disjunctive or functional bases would save naturalism but could never be known. | Active — read in full 2026-10-03 (NOTE-501); worth reading as the argument that whether a functional duplicate of us made of different stuff is conscious is not just unknown but “meta-inaccessible”: we have no conception of evidence that would settle it. For a naturalist who is also a phenomenal realist, physicalism is the default and yet whether such a being is conscious cannot bear on it. The paper also dissolves one form of the hard problem by treating subjective and objective as properties of concepts, not of properties. It lays out the tension and argues for no way out. |
| LIT-640 | Perceptual consciousness overflows cognitive access | Block (2011), Trends in Cognitive Sciences 15(12):567–575. A defence of the overflow argument: perceptual consciousness has a higher capacity than cognitive access. Critics who call it an illusion must posit detailed unconscious iconic memory and conscious generic or fragmentary representations, for which there is no independent evidence. Fragile visual short-term memory, a cortical store of about 5–7 of 8 items over 1–4 s that attention and dlPFC TMS spare while they impair working memory, supports rich perception. Overflow means most items are not accessed, not that any is inaccessible. | Active — read in full 2026-10-03 (NOTE-500); worth reading as Block’s reply to the anti-overflow critics of 2009–2011. Sparse views must posit an unconscious iconic memory detailed enough to do the Sperling and Amsterdam tasks plus conscious “generic” letters or rectangles, and Block argues there is no independent evidence for either. It adds fragile visual short-term memory (about 6–7 of 8 items at 1–2.5 s, cortical, in V4, spared by right dlPFC TMS that impairs working memory) and an imagery task as support. Read from the in-press version. |
| LIT-641 | What Psychological States are Not | Block & Fodor (1972), The Philosophical Review 81(2):159–181. Behaviourism and type physicalism set type-identity conditions on psychological states that are too concrete, and the decisive arguments against them are empirical. The functional state identity theory (FSIT), on which each psychological state is a machine-table state of the organism’s unique best description as a probabilistic automaton, fails too. It cannot model dispositions that are never occurrent, simultaneous states, or a productive and structured set of states, and it individuates too finely. Inverted or absent qualia are a prima facie objection to any functional definition. Psychological states look like computational states, not machine-table states, and type identity is fixed by the laws the states fall under. | Active — read in full 2026-10-03 (NOTE-491); worth reading as the first sustained case against machine-state functionalism, and as the place where the inverted- and absent-qualia objection is first set down as an objection to functional definitions of mental states. Its central result is narrower than “functionalism is false”: psychological states cannot be put one-to-one with the machine-table states of a probabilistic automaton (§III, arguments 1, 2, 4, 5, 6), though they may correspond to computational states. Only the qualia argument (3) threatens functionalism in the broad sense, and the authors treat it as prima facie. |
| LIT-642 | Psychologism and Behaviorism | Block (1981), The Philosophical Review 90(1):5–43. Psychologism, the doctrine that whether behaviour is intelligent depends on the information processing that produces it, is true. A machine that stores all sensible conversations of a test’s length and looks up its replies has the capacity to respond sensibly to any sequence of inputs, so it satisfies the strongest behaviourist conception of intelligence, yet all its intelligence is its programmers’. The standard objections to behaviourism (Chisholm–Geach, the perfect actor, paralytics) defeat behaviourist necessary conditions but not sufficient ones; this machine defeats the sufficient condition. Psychologism is not chauvinism: it excludes one kind of processing without requiring ours. | Active — read in full 2026-10-03 (NOTE-506); worth reading as the source of the “Blockhead”: a machine that stores every sensible hour-long conversation and so has the capacity to pass any Turing test of that length, yet “has the intelligence of a toaster”. The argument refutes behaviourist sufficient conditions for intelligence, including a capacity version that survives the standard objections, and establishes psychologism: whether behaviour is intelligent depends partly on the processing that produces it. It does not say which processing is required, only that it needs some “richness”, and the closing case against simulators of physics, neurons or psychology is admitted to be a sketch. |
| LIT-643 | On a confusion about a function of consciousness | Block (1995), Behavioral and Brain Sciences 18(2):227–247, with open peer commentary. “Consciousness” is a mongrel concept. Phenomenal consciousness is experience; a state is access-conscious if its content is poised for use in reasoning and in rational control of action and speech. Arguments from blindsight and petit mal automatism to a function of phenomenal consciousness are fallacious, because access is missing in those cases too, and its machinery has the function in question. Cases of phenomenality without access (Sperling’s arrays, the unnoticed drill) are offered as worth investigating, not as proven. | Active — read in full 2026-10-03 (NOTE-493); worth reading as the source of the distinction between phenomenal consciousness (P: experience, what it is like) and access consciousness (A: a content poised for use as a premise in reasoning and for rational control of action and speech). The paper’s target is an argument form, not a theory: from a case where “consciousness” and some capacity are missing together (blindsight, petit mal automatism) to a function of P. In those cases A is missing too, so the obvious function of A’s machinery is being credited to P. The cases of P without A that it offers (the noticed drill, Sperling’s arrays, anaesthesia) are put forward as suggestive, not as evidence. |
| LIT-644 | Distinct ventral stream and prefrontal cortex representational dynamics during sustained conscious visual perception | Vishne, Gerber, Knight & Deouell (2023), Cell Reports 42:112752. Ten patients with subdural electrodes watched images for 300–1,500 ms with no report on analysed trials. High-frequency activity dropped about 80% after onset in every region, but category and exemplar information in ventral temporal cortex stayed decodable and time-invariant for as long as the image stayed on. Prefrontal and parietal information was a transient burst at about 150–600 ms that did not track duration. Both IIT’s and the global workspace’s predictions for this paradigm held. | Active — read in full 2026-10-03 (NOTE-499); worth reading as the cleanest test in the record of what neural activity does while a seen image simply stays on. In 10 epilepsy patients with subdural electrodes, high-frequency activity falls about 80% after onset everywhere, yet category and exemplar information in ventral temporal (and less robustly occipital) cortex stays decodable, time-invariant and as long as the image, while prefrontal and parietal information is a transient burst at onset that ignores duration, with no report required. It confirms the multi-duration predictions both IIT and the global neuronal workspace made for this paradigm. Sparse frontal coverage and above-threshold stimuli only. |
| 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-646 | Consciousness, accessibility, and the mesh between psychology and neuroscience | Block (2007), Behavioral and Brain Sciences 30(5–6):481–499, with open peer commentary. To find the neural basis of experience we must decide whether it includes the machinery of cognitive access, and reports seem unable to decide that. Inference to the best explanation can. Sperling, Landman et al. and Sligte et al. show phenomenology overflowing a working memory of about four items. If the workspace is not part of the basis of phenomenology, strong losing coalitions in sensory cortex realise that overflow; the mesh between psychology and neuroscience favours that assumption. | Active — read in full 2026-10-03 (NOTE-497); worth reading as the overflow argument and the paper that framed the methodological problem the no-report paradigm was built to solve. Phenomenology overflows cognitive access: in Sperling, Landman et al. and Sligte et al. subjects see 8–32 items and can access about 4. If the neural basis of phenomenology excludes the frontal workspace, strong but losing recurrent coalitions in the back of the head explain that overflow, and a better mesh between psychology and neuroscience is reason to accept the assumption. The target article was read; the 32 commentaries and the response were not. |
| LIT-648 | Advertisement for a Semantics for Psychology | Block (1986), Midwest Studies in Philosophy 10:615–678. A semantics for cognitive science should explain, among other things, narrow and wide meaning, what makes expressions meaningful, the relativity of meaning to representational system, learning, and how inherited meaning (of words on a page) relates to autonomous meaning (of the language of thought). Two-factor conceptual role semantics is the only approach that promises all of them: an expression’s narrow meaning is its causal role in reasoning and deliberation, short-armed at the skin, and a referential factor fixes truth conditions. Conceptual role determines the nature of the referential factor but not reference. Harman’s one-factor long-arm roles collapse into the same theory; Gricean and indicator semantics are either not naturalistic or fail. | Active — read in full 2026-10-03 (NOTE-503); worth reading as the main statement of two-factor conceptual role semantics: narrow meaning is an expression’s conceptual role inside the head (“total causal role, abstractly described”), and a separate referential factor relates it to the world. Block argues it is the only approach that can meet eight desiderata for a semantics serving cognitive science, among them narrow content, learning, relativity to representational system, and the relation of autonomous to inherited meaning. It is an advertisement, as titled: no identity conditions for conceptual roles are given, and Block says he is “far from a true believer”. |
| LIT-649 | Précis of The Border between Seeing and Thinking | Block (2024), Philosophy and Phenomenological Research 110(1):273–283, the précis for a symposium on his 2023 book. The book’s main claim is that perception is constitutively iconic, nonconceptual and nonpropositional, while cognition is paradigmatically discursive, conceptual and propositional and can use perceptual material inside a “cognitive envelope”. The global neuronal workspace is reread as the mechanism of that envelope, the conceptualisation of percepts. Nine kinds of evidence show working-memory representations differ from perceptual ones and are task-dependent abstractions, which increases Block’s doubt that “raw” percepts are used in cognition. Iconicity is defined by tracking and mirroring conditions after Shepard. | Active — read in full 2026-10-03 (NOTE-498); worth reading as Block’s own short statement, stand-in for the book (LIT-636), of the thesis of The Border Between Seeing and Thinking: perception is constitutively iconic, nonconceptual and nonpropositional, cognition paradigmatically discursive, conceptual and propositional. Despite its title it is “an update”, and most of it develops one idea, the “cognitive envelope”: the global workspace is better read as a theory of how percepts are conceptualised than of consciousness, and recent working-memory evidence shows percepts are recoded, not held raw, when used in reasoning. It is too short to carry the book’s arguments for the main thesis, which it states but does not argue. |
| LIT-650 | Conscious birds | Maldarelli & Güntürkün (2025), Phil. Trans. R. Soc. B 380:20240308. A review arguing that birds show sensory awareness (bistable perception in pigeons; crow nidopallium caudolaterale neurons that follow the reported percept, not the stimulus) and graded self-awareness (magpie and house crow mark tests; pigeons and roosters that treat their mirror image as not-a-conspecific while failing the mark test). Checked against three theories, the avian brain meets the anatomical and physiological requirements of the global neuronal workspace (a hub-and-module connectome with NCL as hub) and of recurrent processing, while IIT’s have not been tested (no PCI, no grid-like lattice found). The authors say the evidence does not yet allow a strong conclusion. | Active — read in full 2026-10-03 (NOTE-488); worth reading as a short, current statement of the case for consciousness in birds and of what each of three theories (global neuronal workspace, recurrent processing, IIT) would need to find in an avian brain. Its strongest evidence is second-hand: crow nidopallium caudolaterale neurons that track the reported percept rather than the stimulus (Nieder et al. 2020). Its sharpest argument is that the bird’s prefrontal analogue is nuclear, not laminar, so conscious report does not need cortical layering. The authors say the findings “do not allow for a strong conclusion”. |
| LIT-651 | Linear Mode Connectivity in Multitask and Continual Learning | Mirzadeh, Farajtabar, Gorur, Pascanu & Ghasemzadeh (2020). When a multitask solution and a continual solution start from the same point, the multitask solution lies on a low-loss line to every earlier continual solution, while consecutive continual solutions are separated by rising loss. Euclidean distance and CKA do not detect the difference. The multitask direction lies outside the top Hessian eigenvectors of the earlier task. MC-SGD trains towards a point linearly connected to both the previous solution and the current task’s solution, using a small replay buffer, and leads five baselines on three 20-task benchmarks. | Active — read in full 2026-10-03 (NOTE-520); worth reading as the first study of where continual and multitask solutions lie relative to each other. Started from the same point (the previous task’s solution), the multitask solution is linearly connected with low loss to every earlier continual solution, while consecutive continual solutions are not. The authors explain it by curvature: the multitask path moves in directions the earlier task’s Hessian sees as flat, within a region where a second-order expansion holds. MC-SGD turns this into a regulariser and beats EWC, A-GEM, ER-Reservoir and Stable SGD on 20-task Permuted MNIST, Rotated MNIST and Split CIFAR-100. The connectivity breaks with a different start, input noise, label corruption or removed classes. |
| LIT-652 | The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networks | Entezari, Sedghi, Saukh & Neyshabur (2022), ICLR 2022. Conjecture: most SGD solutions lie in a set whose members can be permuted so that no barrier remains on the line between any two. Barriers between networks from different initializations first rise then fall with width, rise with depth, and saturate high for VGGs and ResNets. A proof covers a wide one-hidden-layer net at uniform random initialization. The evidence is a model: random permutations of one SGD solution show the same barriers as independent solutions across width, depth and dataset. A simulated annealing search lowers barriers only for shallow networks. | Active — read in full 2026-10-03 (NOTE-537); the source of the conjecture that SGD solutions, once their hidden units are suitably permuted, have no barrier on the straight line between them: one basin modulo permutation. Its proof covers only a one-hidden-layer network at uniform random initialization, and its main evidence is indirect: barriers between independently trained networks behave like barriers between random permutations of a single trained network, across width, depth and dataset, in more than 3,000 networks. Its own permutation search lowers barriers only for shallow nets on easy data and fails for VGGs and ResNets. Second reading under ADR-013; the anthology holds it as ANTH-LIT-251, and that entry misstates the theorem. |
| LIT-653 | Essentially No Barriers in Neural Network Energy Landscape | Draxler, Veschgini, Salmhofer & Hamprecht (2018), ICML 2018. Using AutoNEB, a minimum-energy-path method from molecular statistical mechanics, the paper connects ten minima per architecture for CNNs, ResNets and DenseNets on CIFAR-10 and CIFAR-100. The saddle losses on the best paths are almost those of the minima for deep architectures, and test error rises by at most a few tenths of a percent on CIFAR-10. The conclusion is that minima are points on one connected low-loss manifold, not bottoms of separate valleys, and that the effect grows with width and especially depth. | Active — read in full 2026-10-03 (NOTE-531); the other founding demonstration of mode connectivity, reached independently of Garipov et al. by borrowing the nudged elastic band from chemical physics. Over ten minima per architecture, the highest training loss on the best paths found is almost the minima’s own for deep ResNets and DenseNets on CIFAR-10, with a small residual gap on CIFAR-100, and barriers fall as networks get wider and especially deeper. Its two explanations, resilience and redundancy, are qualitative; the redundancy toy (swapping two hidden units needs a third) is the first statement in this batch of why a permutation costs a barrier without spare capacity. |
| LIT-654 | Linear Mode Connectivity and the Lottery Ticket Hypothesis | Frankle, Dziugaite, Roy & Carbin (2020), ICML 2020. Instability analysis trains two copies of a network from the same state under different SGD noise and measures the error barrier on the straight line between the results. Standard vision networks are unstable at initialization but become stable early in training, after which the outcome is fixed to one linearly connected minimum. Sparse subnetworks found by iterative magnitude pruning reach full accuracy only when they are stable, which explains where lottery tickets were and were not found, and rewinding to an early iterate rather than to initialization finds matching subnetworks at ImageNet scale. | Active — read in full 2026-10-03 (NOTE-514); the source of linear mode connectivity as a measurement and of instability analysis. Two copies of a network trained from the same state under different SGD noise end up linearly connected once that state is a little way into training (3% for ResNet-20, 20% for ResNet-50 on ImageNet), and iterative-magnitude-pruning subnetworks are matching only when they are stable in this sense. The evidence is correlational: stability and matching coincide across the settings tested, and nothing shows that one causes the other. |
| LIT-655 | Understanding Mode Connectivity via Parameter Space Symmetry | Zhao, Dehmamy, Walters & Yu (2025), ICML 2025. Relates the topology of a loss’s symmetry group to that of its minimum. The minimum of a full-rank l-layer linear regression is homeomorphic to GL_h(ℝ)^{l−1}, so it has 2^{l−1} components; a skip connection reduces 4 to 3 in a 1-D case, and permutations connect all components when h ≥ 2. Rescaling symmetry yields minima in one component with arbitrarily large barriers on the straight line. Group actions give explicit constant-loss curves, and a curvature bound κ on such a curve bounds the chord’s distance from the minimum by about κ‖w₂ − w₁‖²/8. | Active — read 2026-10-03 (NOTE-528); worth reading as the account of mode connectivity from continuous parameter symmetries. The minimum of a full-rank l-layer linear network is homeomorphic to GL_h(ℝ)^{l−1} and so has 2^{l−1} connected components, a skip connection merges some of them, and a permutation with negative determinant joins the rest. Rescaling symmetry gives minima in the same component with an arbitrarily large loss barrier on the straight line between them, even after a restricted permutation. A group element g gives an explicit constant-loss curve exp(t log g)·w, and bounded curvature of such curves bounds the barrier on the chord. The theory is for linear networks and homogeneous last layers; the experiments are small synthetic regressions. |
| LIT-656 | Loss Surface Simplexes for Mode Connecting Volumes and Fast Ensembling | Benton, Maddox, Lotfi & Wilson (2021), ICML 2021. SPRO trains the connecting vertices of simplexes so that loss is low at points sampled uniformly inside them, with a log-volume bonus. It finds simplicial complexes of low loss joining up to seven independently trained networks through shared vertices, and a low-loss region around VGG-16 on CIFAR-10 of at least 10 dimensions. Started from a single trained network, a few vertices cost about a tenth of a training run each, and ensembling inside the simplexes (ESPRO) beats deep ensembles in accuracy, calibration and robustness to corruption. | Active — read in full 2026-10-03 (NOTE-539); mode connectivity raised from curves to volumes. Training the vertices of simplexes so that loss stays low at random points inside them finds simplicial complexes of low loss joining several independently trained networks at once, and a low-loss region around a VGG-16 on CIFAR-10 of at least 10 dimensions. The same trick, run from one trained network, gives cheap ensembles (ESPRO) that beat deep ensembles at equal size and budget. The dimension estimate is a lower bound from one architecture and dataset, and the paper’s picture of one connected volume containing all SGD solutions is drawn from complexes of up to 7 modes. |
| LIT-657 | The Generalization Ridge: Information Flow in Natural Language Generation | Chang, Deng & Chen (2025), COLM 2026. InfoRidge estimates, layer by layer and through fine-tuning, the matrix-based mutual information between a transformer’s last-token hidden state and the embedding of the target token, and between each block’s residual update and that target. In GPT-2 Small and Medium, Qwen-2.5 0.5B and Llama 3.1 8B on CLUTRR, ECQA and a synthetic arithmetic task, it rises, peaks in the upper-middle layers and falls. On the synthetic task the peak coincides with the best OOD early-exit accuracy while ID accuracy keeps rising. Middle blocks add the most information, attention to task tokens peaks there, and residual scales fitted on OOD data downweight the last layers. The profile persists over 50 decoding steps on CNN/DailyMail. | Active — read 2026-10-03 (NOTE-536); worth reading as a layer-wise information profile of fine-tuned language models: a matrix-based Rényi estimate of I(Zℓ; Y), between the last-token hidden state at layer ℓ and the input embedding of the true next token, rises through the early layers, peaks in the upper-middle layers and falls in the last few, the “generalization ridge”. On a synthetic arithmetic task with GPT-2 Small the peak (0.27 at layer 10 of 12) is where OOD early-exit accuracy is best (56.9%) while ID accuracy keeps rising to 93.2% at layer 12. Learned residual scales put less weight on the final layers when fitted on OOD data. The estimator is a kernel-alignment quantity, not Shannon mutual information: at layer 12 it falls to 0.019, near its layer-6 value, where the same layer decodes the target with 93% ID accuracy. |
| LIT-658 | Knowledge is a Region in Weight Space for Fine-tuned Language Models | Gueta, Venezian, Raffel, Slonim, Katz & Choshen (2023). RoBERTa-base models fine-tuned on similar data end up close in weight space: task vectors cluster by dataset (98% clustering accuracy over 280 models) and by task family (90%), and the grouping follows data type, not data size. Points between the fine-tuned models, along lines and across their convex hull, perform as well or better than the fine-tuned models themselves, and linear extrapolation beyond them quickly fails. The region’s centroid, re-fine-tuned with BitFit, beats starting from the pretrained model on 9 of 12 target datasets. | Active — read in full 2026-10-03 (NOTE-515); worth reading as the paper that turns linear connectivity between fine-tuned models into a claim about regions. RoBERTa-base models fine-tuned on the same dataset, the same task, or any of 12 GLUE/SuperGLUE datasets cluster in weight space by cosine of their task vectors, and the convex hull of each group performs as well as or better than the fine-tuned members: sampled hull points beat the members in 88% of comparisons on MNLI. Linear extrapolation past the members fails quickly, so the fine-tuned models sit near the edge of a small basin. Averaging the region (its centroid) is a better start for further fine-tuning than the pretrained model on 9 of 12 datasets. One pretrained model, classification only, English only. |
| LIT-659 | Do Deep Neural Network Solutions Form a Star Domain? | Sonthalia, Rubinstein, Abbasnejad & Oh (2024), preprint. Conjectures that SGD solution sets, modulo permutation, are star domains, which needs less width than convexity does. Starlight trains a star model by sampling points on the lines to permuted source models. The star model has much lower loss barriers to held-out solutions than those solutions have to each other, across ResNet-18, VGG, DenseNet, CIFAR and ImageNet-1k (e.g. 0.078 against 0.383 on CIFAR-10). It gains with more source models, ranks uncertainty better in BMA than a deep ensemble, and is about 1 point more accurate than a single model. | Active — read 2026-10-03 (NOTE-533); worth reading as the star domain conjecture: where SGD solutions are not convex modulo permutation, they still form a star domain, with a star model linearly connected, after weight matching, to every other solution. Starlight trains a candidate by sampling points on the lines to 50 permuted source models, and the candidate has lower barriers to held-out models than those models have to each other (ResNet-18 CIFAR-10 0.078 against 0.383; ImageNet-1k 2.794 against 5.948). Those barriers are lower, not zero, and the authors say the conjecture is unproved and the barriers are often significantly above zero. Preprint. |
| LIT-661 | Git Re-Basin: Merging Models modulo Permutation Symmetries | Ainsworth, Hayase & Srinivasa (2023), ICLR 2023. Three ways to permute one network’s hidden units into alignment with another: activation matching (a linear assignment per layer), weight matching (an NP-hard sum of bilinear assignments, solved by coordinate descent over layers), and a straight-through estimator. After alignment the straight line between independently trained networks has zero loss barrier for MLPs on MNIST and wide ResNet-20s on CIFAR-10. Connectivity grows with width and with training time, fails for thin models, and a counterexample shows it is a property of SGD solutions. Merging models trained on disjoint data improves test loss and calibration but not accuracy. | Active — read in full 2026-10-03 (NOTE-532); the strongest evidence for one basin modulo permutation. A weight-matching algorithm that needs no data and runs in seconds aligns independently trained networks so that the straight line between them has no loss barrier, for MLPs on MNIST and for ResNet-20 on CIFAR-10 at large width, the first such result for ResNets. It also finds where the picture stops: thin models are not linearly connected after any permutation it finds, connectivity appears only after some training, ImageNet ResNet-50 keeps a barrier, and a constructed counterexample shows that the property belongs to SGD solutions, not to architectures. Second reading under ADR-013; the anthology holds it as ANTH-LIT-333, and that entry misdescribes the algorithm and overstates the results. |
| LIT-662 | Geodesic Mode Connectivity | Tan, Long, Zhao & Laine (2023), ICLR 2023 Tiny Paper. Treats a network as a distribution p(x, ŷ; θ) on a Fisher–Rao manifold and hypothesises that geodesics between SGD solutions are mode-connecting paths. A chain of 25 models between two ResNet-20s (4× width, LayerNorm), initialised on the straight line after Git Re-Basin weight matching, is optimised to minimise summed Jensen–Shannon divergence between neighbours. The curve is longer in Euclidean terms but shorter in distribution space, and keeps train and test loss low where linear interpolation shows a large barrier. | Active — read in full 2026-10-03 (NOTE-521); worth reading as the short proposal that mode-connecting paths are geodesics of the Fisher–Rao metric on the space of the networks’ output distributions. It approximates a geodesic between two trained ResNet-20s (4× width, LayerNorm), after Git Re-Basin weight matching, by optimising 25 models on a chain to minimise the summed Jensen–Shannon divergence between neighbours, using unlabelled training images only, and the resulting curve has low train and test loss where the straight line does not. One architecture, one pair, one figure; the hypothesis that all geodesics between SGD solutions are mode-connecting is stated, not tested. |
| LIT-663 | Taxonomizing local versus global structure in neural network loss landscapes | Yang, Hodgkinson, Theisen, Zou, Gonzalez, Ramchandran & Mahoney (2021), NeurIPS. Thousands of trained networks are placed on a load-like by temperature-like grid and measured three ways: Hessian top eigenvalue and trace (local sharpness), Bezier-curve mode connectivity between two independently trained models (global connectivity), and CKA similarity of their outputs on mixup points. Two transitions give four phases: I sharp and poorly connected, II sharp and well connected, III flat and poorly connected, IV flat and well connected, with IV split by CKA into IV-A and IV-B. Test accuracy is best in IV-B. Sharpness alone mispredicts accuracy across phases, and in phase III training to zero loss does worse than stopping in the sharp phases. Double descent appears as a dark band at the phase boundary under label noise. | Active — read 2026-10-03 (NOTE-516); worth reading as the empirical taxonomy of loss landscapes by local and global structure: Hessian top eigenvalue and trace separate locally sharp from locally flat, Bezier-curve mode connectivity between independently trained models separates globally poorly-connected from well-connected, and CKA similarity of their outputs splits the well-connected, flat phase in two. Across a load-like by temperature-like grid (width, data amount or label noise against batch size, learning rate or weight decay), the best test accuracy sits in the flat, well-connected, high-similarity phase IV-B; the Hessian alone mispredicts, and where connectivity is poor, training to zero loss can lower test accuracy. Empirical only, mostly ResNet18 on CIFAR-10. |
| LIT-664 | Generalized Linear Mode Connectivity for Transformers | Theus, Cabodi, Anagnostidis, Orvieto, Singh & Boeva (2025), NeurIPS 2025. A hierarchy of function-preserving maps (permutation ⊂ semi-permutation ⊂ orthogonal ⊂ invertible) fits transformer components: permutations for feed-forward units, semi-permutations for attention heads, an orthogonal map on the RMSNorm residual stream. Aligning with them gives, for the first time, low and zero test-loss barriers between independently trained ViTs and GPT-2s (learned matching 0.00 on CIFAR-10/100 and Tiny ImageNet, 0.02 Tiny Shakespeare, 0.42 BookCorpus), for three-way merges and across embedding widths. Permutation-only alignment does not get there. | Active — read 2026-10-03 (NOTE-540); worth reading as the result that independently trained transformers become linearly mode connected once alignment uses their real symmetries: permutations of feed-forward units, semi-permutations of attention heads, and an orthogonal map on the residual stream after RMSNorm reparameterisation. Data-free weight matching cuts test-loss barriers from 1.69–4.34 to 0.34–1.56, and learned matching, which optimises the alignment against task loss at the midpoint, reaches 0.00 on three vision datasets and 0.02 and 0.42 on two language ones. Most of the gap is in the orthogonal map. Small ViTs and GPT-2s only. |
| LIT-665 | ZipIt! Merging Models from Different Tasks without Training | Stoica, Bolya, Bjorner, Ramesh, Hearn & Hoffman (2023), ICLR 2024. Merging differently initialised models trained on disjoint tasks fails under permutation, because the permuted model sits in a basin for its own task and not the other’s. ZipIt! instead merges correlated features within and across models through merge and unmerge matrices, and can stop merging part-way, giving a shared trunk with task heads. The abstract reports a 20–60% improvement over prior work on CIFAR and ImageNet splits; it comes near the ensemble with partial zipping, and proves a tighter LMC barrier bound than Entezari et al. when units are redundant. | Active — read in full 2026-10-03 (NOTE-523), main text and Appendices A–F, the proof in Appendix G followed to its reduction to Entezari et al.; worth reading as the case that permutation is the wrong symmetry for merging models trained on different tasks. ZipIt! matches features by activation correlation within each model as well as across the two, and can stop merging at a chosen layer, leaving a multi-head model. On disjoint halves of CIFAR-10 it reaches 79.1% joint accuracy where Git Re-Basin reaches 46.2%, and partial zipping comes within a few points of the ensemble. Its theorem tightens Entezari et al.’s barrier bound when a model has redundant units. With full merging on ImageNet-1k it is no better than a permutation baseline (8.6%), so the gains there come from leaving later layers unmerged. |
| LIT-666 | Mode Connectivity and Data Heterogeneity of Federated Learning | Zhou, Zhang & Tsang (2023), preprint. Under Dirichlet label skew and PACS domain shift, low-loss overlaps between FedAvg client models and the global model shrink as heterogeneity grows; client models stay close to the global one yet move in different directions within a round. Global models from one initialisation under different heterogeneity have function dissimilarity above 0.2, show an error barrier on the line, and are joined without barrier by a polygonal chain. A mean-field analysis of two-layer networks bounds dropout and connectivity errors by terms proportional to √h(α) and decreasing in width N. | Active — read in full 2026-10-03 (NOTE-517); worth reading as the only study in the batch of connectivity under federated averaging. Client models, though close in weight space, leave the low-loss region of the global model more as client data grow more heterogeneous, and FedAvg global models trained from one initialisation under different heterogeneity are separated on the straight line (accuracy drops of about 10%) but joined by a one-bend polygonal chain. A mean-field bound, extending the dropout-stability route of Kuditipudi et al. and Shevchenko and Mondelli, makes the connectivity error grow with √h(α), a heterogeneity factor, and shrink with width; width and heterogeneity trends in MNIST and CIFAR-10 runs agree. The theory treats heterogeneity as isotropic Gaussian noise on each neuron’s update, an assumption the paper checks only by plotting noise norms. |
| LIT-667 | Does Data Scaling Lead to Visual Compositional Generalization? | Uselis, Dittadi & Oh (2025), ICML 2025. Two labelled concepts with n values each form an n × n grid; training shows k combinations per value and testing uses the rest. On dSprites, 3DShapes, PUG, colored MNIST and a new FSprites, ResNet-50s trained from scratch reach near 100% on seen pairs and fall sharply on unseen ones; 4× more in-distribution data does not close the gap, while more values and more combinations do. Features pass from spurious, to discriminative but entangled, to linearly factored and near-orthogonal as combinatorial coverage grows. Exact linear factorization makes k = 2 sufficient for perfect generalization. Frozen DINO, DINOv2 and CLIP features are above chance but far from that ideal. | Active — read 2026-10-03 (NOTE-525); worth reading as a controlled test of whether more data buys visual compositional generalization: in an (n, k) grid where each of n values of two concepts is seen in only k combinations, ResNet-50s trained from scratch fail on unseen pairs whatever the data volume (4× more in-distribution data leaves 60–80% drops), and succeed only as the fraction of combinations seen rises, when their features become linearly factored (a pair’s embedding is the sum of per-concept vectors; R² > 0.8). Under exact linear factorization, k = 2 combinations per value suffice for a linear classifier to get all unseen pairs right (Proposition 4.1). DINO, DINOv2 and CLIP features are partly factored. Model selection is oracle, on the test set, by design. |
| LIT-668 | Bridging Mode Connectivity in Loss Landscapes and Adversarial Robustness | Zhao, Chen, Das, Ramamurthy & Lin (2020), ICLR 2020. A Garipov-style quadratic Bezier path between two tampered models, trained on a small clean set, contains models that keep clean accuracy and shed backdoor or injected-error attacks, outperforming fine-tuning, retraining, pruning and weight noise on the clean–attack trade-off in most settings. On a standard-loss path between a regular and an adversarially trained model, standard loss stays flat but robustness loss rises in the middle, and it correlates with the largest input-Hessian eigenvalue (Pearson 0.71–0.88). | Active — read 2026-10-03 (NOTE-530); worth reading as the first use of mode connectivity for adversarial robustness. A quadratic Bezier path trained between two backdoored or error-injected models on as few as 50–2,500 clean samples contains models near its ends that keep most clean accuracy and lose the attack (CIFAR-10 VGG with 2,500 samples: 88% clean, 1.1% backdoor success at t = 0.1). Between a regular and an adversarially trained model, a path trained with the standard loss has no standard-loss barrier but a robustness-loss barrier, which tracks the largest eigenvalue of the input Hessian. The proposition offered for that correlation rests on an assumption that, taken literally, would rule out the barrier it explains. |
| LIT-669 | Mechanistic Mode Connectivity | Lubana, Bigelow, Dick, Krueger & Tanaka (2022), ICML 2023. Two models are mechanistically similar if they are invariant to the same interventions on the data-generating process. Models that use a spurious cue and models that ignore it are mode connected along quadratic paths but not along linear ones, even after permutation matching, and the paper conjectures that a linear barrier implies mechanistic dissimilarity. For a one-hidden-layer ReLU network it proves only the converse: mechanisms of different complexity cannot be linearly connected. Naive fine-tuning on clean data stays linearly connected to the pretrained model and keeps its reliance on the cue; a fine-tune that forces a barrier removes it. | Active — read 2026-10-03 (NOTE-538); worth reading as the paper that ties a loss barrier to a difference in what two models compute. It defines two models as mechanistically similar when they are invariant to the same interventions on the data-generating process, finds that models relying on a spurious cue and models ignoring it are connected by quadratic paths but not by linear ones, even after permutation, and conjectures that a linear barrier always signals mechanistic dissimilarity. The conjecture is proved only for a one-hidden-layer ReLU network on a synthetic process; the evidence is synthetic cues on CIFAR-10, CIFAR-100 and Dominoes. |
| LIT-670 | On Linear Mode Connectivity of Mixture-of-Experts Architectures | Tran, Trinh, Bui & Nguyen (2025), NeurIPS 2025. The group generated by permuting experts with their gates and translating all gating weights by a common vector preserves an MoE’s function. Under genericity conditions it is the whole symmetry of the dense gate and of the top-k gate for k ≥ 2 (Theorems 4.1–4.2). Translation does not change barriers, so only the permutation matters. Matching expert order by centred gate weights or by Gram matrices, then weight-matching inside each expert, brings barriers between MoE layers fine-tuned from different seeds near zero, across dense, top-2 and DeepSeekMoE variants, on ViT and GPT-2 backbones that are shared and frozen. | Active — read 2026-10-03 (NOTE-513); worth reading as the characterisation of the symmetries of a mixture-of-experts gate. Under genericity conditions, two dense or top-k (k ≥ 2) MoEs compute the same function only if they differ by a permutation of experts together with their gates and a common translation of the gating weights (Theorems 4.1–4.2), and the translation leaves every barrier unchanged. Expert-order matching followed by per-expert weight matching gives near-zero barriers between MoE layers fine-tuned from different seeds. But the backbone around the MoE layer is shared and frozen, so what is connected is one inserted layer, not two independently trained networks. |
| LIT-671 | Explaining Landscape Connectivity of Low-cost Solutions for Multilayer Nets | Kuditipudi, Wang, Lee, Zhang, Li, Hu, Arora & Ge (2019), NeurIPS 2019. Mode connectivity follows from generic robustness properties of trained nets. Two ε-dropout-stable ReLU networks, each able to zero half its units per layer at loss cost ε, are connected by a piecewise-linear path of loss at most max endpoint + ε; ε-noise-stable networks are connected by 10 segments with barrier Õ(ε). Conversely, for any width there is a dataset on which global minima of a two-layer student are disconnected, so connectivity is a property of the solutions training finds. Checked on MNIST convnets and VGG-11 on CIFAR-10. | Active — read in full 2026-10-03 (NOTE-544); the first explanation of mode connectivity that applies to realistic multilayer nets. If two solutions can each lose half their units per layer at a cost of at most ε in loss (dropout stability), they are joined by a piecewise-linear path whose loss never exceeds the worse endpoint by more than ε; a stronger noise-stability condition gives 10 segments. A counterexample shows that connectivity fails for some global minima of arbitrarily overparametrized two-layer nets, so the property belongs to the solutions training finds, not to the landscape. The conditions are checked on small MNIST convnets and one VGG-11 trained with channel-wise dropout. |
| LIT-672 | Rethinking generalization requires revisiting old ideas: statistical mechanics approaches and complex learning behavior | Martin & Mahoney (2017), arXiv preprint. Zhang et al.’s observations, that deep networks fit noisy labels and that only early stopping regularizes them, are read through the statistical mechanics of learning. A Very Simple Deep Learning model has two control parameters: a load α = m_eff/N, lowered by randomizing labels, and a temperature τ, raised by stopping early. In the thermodynamic limit (m, N → ∞, α fixed), generalization error can drop discontinuously at a critical αc, and a two-dimensional (α, τ) phase diagram has a spin-glass-like overtraining phase. The mechanism is entropy–energy competition, shown on the continuous and Ising perceptrons: the Ising entropy vanishes near zero error, so the first-order condition loses its interior solution. | Active — read in full 2026-10-03 (NOTE-542); worth reading as the position paper that brought the statistical-mechanics theory of generalization back to deep learning: a network is idealized as a black box governed by a load-like parameter α (effective data per capacity, lowered by label noise) and a temperature-like parameter τ (raised by early stopping), and in the thermodynamic limit m, N → ∞ with α = m/N fixed, generalization has phases with sharp transitions. The mechanism is shown on the continuous versus Ising perceptron: where the entropy of near-optimal hypotheses vanishes (s(ε) ~ −(π²/2)ε² ln ε), the error drops discontinuously at αc, which PAC/VC bounds do not even qualitatively describe. A qualitative argument with no new theorem and no experiment. |
| LIT-673 | Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs | Garipov, Izmailov, Podoprikhin, Vetrov & Wilson (2018), NeurIPS 2018. Optima of deep networks trained from different initializations are joined by simple learned curves (a polygonal chain with one bend, or a quadratic Bezier curve) along which train loss and test error stay nearly constant, although the straight line between them rises to near-chance error. The curve is found by minimizing the loss averaged over a uniform t on the curve. Points along it are functionally diverse, which motivates Fast Geometric Ensembling: short cyclical learning-rate cycles late in training, collecting a checkpoint per cycle, beating Snapshot Ensembles on CIFAR-10, CIFAR-100 and ImageNet at equal budget. | Active — read in full 2026-10-03 (NOTE-527); one of the two founding demonstrations of mode connectivity. Two independently trained networks are joined by a learned one-bend polygonal chain or quadratic Bezier curve along which train loss and test error stay near the endpoints, while the straight segment between them climbs to near chance (VGG-16 on CIFAR-10: 90% test error at the midpoint). Points a short way along a curve already make useful ensemble partners, which motivates Fast Geometric Ensembling. The connectivity evidence is a table of single runs per architecture with no error bars, and the paper does not claim the curves are anything more than found. |
| LIT-674 | Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivity | Zhou, Yang, Yang, Yan & Hu (2023), NeurIPS 2023. When two trained networks are linearly mode connected, whether by spawning from a shared early checkpoint or by permutation alignment, the features of nearly every layer of the weight-interpolated network are proportional to the interpolation of the two networks’ features (LLFC). LLFC on the output layer implies LMC. Weak additivity of ReLU and a commutativity condition between layers’ weights and features together imply LLFC, and Git Re-Basin’s two matching objectives are each one factor of the commutativity residual. | Active — read 2026-10-03 (NOTE-512); worth reading as the finding that linear mode connectivity reaches inside the network: whenever two trained networks are linearly connected, by spawning or by permutation, the feature map of almost every layer of the interpolated network points in the direction of the interpolated feature maps (LLFC). Two conditions, weak additivity of ReLU on the two networks’ pre-activations and a commutativity of each layer’s weights with the other network’s features, imply exact LLFC (Theorem 1), and Git Re-Basin’s weight and activation matching each minimise one factor of the commutativity residual. Image classification only. |
| LIT-675 | TIES-Merging: Resolving Interference When Merging Models | Yadav, Tam, Choshen, Raffel & Bansal (2023), NeurIPS 2023. Merging fine-tuned models by averaging or adding task vectors suffers from two kinds of interference: redundant small updates dilute influential ones, and influential updates of different tasks disagree in sign. TIES-Merging trims each task vector to its top-k% magnitudes, elects a sign per parameter by total mass, and averages only values agreeing with it. It beats averaging, task arithmetic, Fisher merging and RegMean across (IA)³, T5 and ViT settings when a validation set tunes it, degrades more slowly as tasks are added, and with oracle signs nearly matches multitask training. | Active — read in full 2026-10-03 (NOTE-526); worth reading as the account of why averaging task vectors loses information: most of a fine-tuning update is small and redundant, and the influential coordinates of different tasks often disagree in sign, so a plain mean shrinks them. TIES-Merging keeps the top 20% of each task vector by magnitude, elects a sign per coordinate by total mass, and averages only the agreeing values. With a validation set it beats task arithmetic, Fisher merging and RegMean on all five settings (by 0.7 to 3.6 points); without one it falls below task arithmetic on T5-base (69.7 against 73.2 in Table 1), which the introduction’s summary of results leaves out. With the multitask model’s signs it reaches 72.0 against 73.1 for multitask training, which is the paper’s strongest evidence that sign is the bottleneck. |
| LIT-678 | Intermediate Layer Classifiers for OOD generalization | Uselis & Oh (2025), ICLR 2025. Linear probes on the frozen features of an intermediate layer (ILCs) are compared with last-layer retraining for out-of-distribution classification on CMNIST, Waterbirds, CelebA, MultiCelebA, CIFAR-10C, CIFAR-100C and ImageNet variants, with ResNets and ViTs. Few-shot (probe trained on OOD data), the best intermediate layer usually wins, by more when OOD data are scarce. Zero-shot (probe trained on ID data, OOD only for selecting the layer), it beats retraining the last layer, sharply under subpopulation shift. Layer L − 2 beats L − 1 in every dataset shown. A distance-ratio sensitivity score finds intermediate features less displaced by the shift than penultimate ones, most of all for minority groups. | Active — read 2026-10-03 (NOTE-541); worth reading as the measurement that, under distribution shift, a trained classifier’s best linear probe is usually not on the penultimate layer: Intermediate Layer Classifiers (linear probes on frozen layer-l features, l ≤ L − 2) beat last-layer retraining in the few-shot setting on most of nine shifted datasets, and, trained only on in-distribution data, raise worst-group accuracy from 79.4% to 87.1% on Waterbirds and 56.0% to 82.0% on CelebA. The proposed reason is that penultimate features move further under shift, especially for minority groups, while intermediate ones stay put. Selection of the layer uses OOD validation data, and the gains for ViTs are small. |
| LIT-679 | A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descent | Liao, Couillet & Mahoney (2020), NeurIPS 2020 and J. Stat. Mech. (2021). For random Fourier features ΣX = [cos(WX); sin(WX)] with n, p, N large and comparable, the expected resolvent of ΣXᵀΣX/n is asymptotically Q̄ = ((N/n)(Kcos/(1+δcos) + Ksin/(1+δsin)) + λI)⁻¹, with δσ = (1/n)tr KσQ̄, not the Gaussian-kernel prediction. Closed forms for training and test MSE follow and match MNIST, Fashion-MNIST and Kannada-MNIST. In the ridgeless limit the δ jump at 2N = n, separating an under- and an over-parameterized phase; the test MSE diverges there unless test data sit within about λ of the training data, which is the double-descent peak. A tuned λ removes it. | Active — read 2026-10-03 (NOTE-519); worth reading as an exact random-matrix account of double descent in random Fourier feature ridge regression when n, p and N are large together: the RFF Gram matrix does not converge to the Gaussian kernel in spectral norm, but its resolvent has a deterministic equivalent built from the cos and sin kernels with corrections δcos, δsin solving a fixed point (Theorem 1). Training and test MSE follow in closed form (Theorems 2–3). As λ → 0 the δ jump from O(1) to order 1/λ across 2N = n, so the model has two phases, and the test error diverges at the boundary when test data differ from training data; that singularity is the double-descent peak. Data need only be concentrated random vectors, not Gaussian. |
| LIT-680 | Proving Linear Mode Connectivity of Neural Networks via Optimal Transport | Ferbach, Goujaud, Gidel & Dieuleveut (2024), AISTATS 2024. Finding the permutation that aligns two networks’ neurons layer by layer is an optimal-transport problem between empirical weight distributions, so Wasserstein convergence rates bound when the permuted straight line stays low-loss. Wide two-layer nets trained by SGD in the mean-field regime are linearly connected modulo permutation with high probability. Deep nets with i.i.d. neuron weights (as at initialization) are too, once each layer is wider than about (1/ε) to the power of the previous one, a rate shown tight. Low-dimensional weight distributions need less width, and a covariance-weighted weight matching beats plain weight matching. | Active — read in full 2026-10-03 (NOTE-543); the first proof of linear mode connectivity modulo permutation beyond a single hidden layer. Aligning neurons is an optimal-transport problem between the empirical distributions of their weights, so convergence rates of empirical measures in Wasserstein distance bound how wide a network must be for the permuted straight line to stay low-loss. It proves the result for wide two-layer nets trained by SGD in the mean-field regime, and for deep nets whenever neuron weights within a layer are i.i.d., which holds at initialization. The width needed grows like (1/ε) to the power of the previous layer’s width, a rate shown to be tight, and falls if weights concentrate near a low-dimensional subspace. The proofs rest on independence of neurons, which the authors call the central and least realistic assumption. |
| LIT-681 | Optimizing Mode Connectivity for Class Incremental Learning | Wen, Cheng, Qiu, Wang, Pan & Li (2023), ICML 2023. In class-incremental learning the linear path between adjacent continual minima crosses a high-loss ridge for earlier tasks. OPC finds a curved low-loss path, modelled as the line plus a layer-wise Fourier-series perturbation, with the path loss split at a switching point between old-task and new-task memory losses. EOPC averages points in a cylinder around the switching point and is added as post-processing to existing methods, improving PODNet and AANet on CIFAR-100, ImageNet-100 and ImageNet-1K and sharply reducing forgetting. | Active — read in full 2026-10-03 (NOTE-524); worth reading as the class-incremental counterpart of Mirzadeh et al.: between adjacent continual minima in class-incremental learning, the straight line crosses a high-loss ridge for the earlier tasks, and a curved path avoids it. OPC parameterises that path as the line plus a layer-wise Fourier perturbation that vanishes at both ends (2 × 96 × 4 learned numbers for a 96-layer ResNet), splits the path loss at a switching point into old-task and new-task halves, and pushes it to flat regions by sampling a cylinder around it. Averaging points near the switching point (EOPC) adds 0.3 to 5.1 points of average incremental accuracy to PODNet and AANet on CIFAR-100, ImageNet-100 and ImageNet-1K. In Table 4 it beats Bezier and simplex paths only on the longer task sequences. |
| LIT-682 | Exploring Neural Network Landscapes: Star-Shaped and Geodesic Connectivity | Lin, Li & Wu (2024), preprint. For a two-layer ReLU student of an orthonormal teacher, and for deep linear networks, over-parameterisation makes any two global minima two-piece linearly connected and gives any finite set of minima a common centre linearly connected to each (star- shaped connectivity). Under a sparsity bias like SGD’s, the shortest path on the minimum manifold is nearly as short as the straight line, with normalised geodesic distance ≤ 1 + c₂/(r√m). A centre-finding objective locates such centres for independently trained FNNs, VGG16 and ResNets on MNIST and CIFAR-10, with no permutation alignment. | Active — read 2026-10-03 (NOTE-535); worth reading as the theory of star-shaped connectivity without permutations. For a two-layer ReLU student of an orthonormal teacher, and for deep linear networks, sufficiently wide networks have any two minima joined by a two-piece linear path and any finite set of minima linearly joined to a common centre on the minimum manifold. SGD’s bias toward sparse solutions explains why the shortest path on the manifold is nearly as short as the straight line (normalised geodesic distance ≤ 1 + c₂/(r√m)). Experiments find centres for three to five independently trained FNNs, VGG16s and ResNets on MNIST and CIFAR-10 with almost no barrier. Preprint. |
| LIT-683 | Exact expressions for double descent and implicit regularization via surrogate random design | Dereziński, Liang & Mahoney (2019), NeurIPS 2020. For the Moore–Penrose estimator X⁺y in linear regression, a determinantal surrogate design (density ∝ pdet(XXᵀ), Poisson sample size with mean n) gives exact MSE: σ² tr((Σ + λnI)⁻¹)(1 − αn)/(d − n) + wᵀ(Σ + λnI)⁻¹w·(d − n)/tr((Σ + λnI)⁻¹) for n < d, σ² tr(Σ⁻¹) at n = d, σ² tr(Σ⁻¹)(1 − βn)/(n − d) for n > d, where n = tr(Σ(Σ + λnI)⁻¹). For n < d, E[X⁺y] equals the population ridge solution with that λn: over-parameterization is implicit ridge regularization whose strength makes n the effective dimension. The surrogate agrees with the i.i.d. design as d, n → ∞ for sub-Gaussian data. | Active — read 2026-10-03 (NOTE-518); worth reading as the exact, non-asymptotic account of double descent and implicit regularization for minimum-norm least squares: replacing the i.i.d. design by a determinantal “surrogate” design gives closed-form MSE in every regime (Theorem 1) and shows that, below the interpolation threshold n < d, the expected minimum-norm solution equals the population ridge solution with the λn for which the ridge effective dimension tr(Σ(Σ + λnI)⁻¹) equals n (Theorem 2). The surrogate matches the i.i.d. design asymptotically for sub-Gaussian data (Theorem 3), at an empirically O(1/d) rate. The tool is a class of random matrices for which determinant and expectation commute. |
| LIT-687 v3 | Responsiveness and Moral Responsibility | Fischer (1987/88), in Schoeman (ed.), Responsibility, Character, and the Emotions (CUP), pp. 81–106; read in its My Way reprint. Frankfurt-type cases show responsibility does not need the ability to do otherwise, so the mechanism that actually issues in action, not the agent, must be reasons-responsive, and weak responsiveness suffices. Responsibility is historical and compatible with determinism (semicompatibilism). | Active — read 2026-10-05 (NOTE-579): in full, in the reprint in Fischer’s My Way (OUP 2006), from Andrew M. Bailey’s collection of Fischer’s papers, used on the owner’s instruction. Worth reading as the first statement of mechanism-based reasons-responsiveness. Frankfurt-type cases move the requirement from the agent to the mechanism that actually issues in the action; weak responsiveness is held sufficient; the result is named semicompatibilism. Fischer concedes an insane-agent counterexample (note 11), which his later book with Ravizza (LIT-684) answers. |
| LIT-689 | Stories and the Meaning of Life | Fischer (2009), Philosophic Exchange 39(1), pp. 3–15. Section I sketches his framework for moral responsibility: guidance control, not regulative control, is the freedom-relevant condition; it consists in acting from one’s own, moderately reasons-responsive mechanism; responsibility is historical and compatible with causal determinism; and the moral of Frankfurt-style cases is that it depends on how the actual sequence unfolds. The paper’s thesis is that the value of acting freely is the value of artistic self-expression: free action makes a life a story with narrative value, though the life is judged mainly by moral and prudential standards. | Active — read in full 2026-10-03 (NOTE-547); worth reading as the only first-hand, lawful statement by Fischer that the record holds of his framework for moral responsibility: guidance control, not regulative control, is the freedom-relevant condition; guidance control is mechanism ownership plus moderate reasons-responsiveness; responsibility is historical and compatible with causal determinism; and the moral of Frankfurt-style cases is that responsibility depends on the actual sequence. Its own thesis is that the value of acting freely is the value of artistic self-expression, which gives a life narrative value. It lists the framework’s elements without arguing for them. |
| LIT-691 | Moral Responsibility | Talbert (2019; revised 2024), Stanford Encyclopedia of Philosophy. A survey of moral responsibility: its relation to free will and determinism, forward-looking, Strawsonian and reasons-responsiveness accounts, the attributability/accountability distinction that grew from Wolf and Watson, the moral competence condition (Wolf’s JoJo), conversational views, standing to blame, outcomes, skepticism, moral luck, ultimate responsibility, manipulation and the epistemic condition. Its §2.3 is a page-referenced summary of Fischer and Ravizza’s guidance control. | Active — read in full 2026-10-03 (NOTE-548); worth reading as the record’s map of moral responsibility apart from the free-will question, and as its most exact second-hand source for two accounts the record cannot read first-hand: Fischer and Ravizza’s guidance control (§2.3, with page references to the 1998 book) and Wolf’s critique of Real Self views and her moral-competence condition, including the JoJo case (§§3.1.1, 3.2). It reports Wolf’s praise/blame asymmetry only in one sentence of its preamble. |
| LIT-692 | Freedom of the Will and the Concept of a Person | Frankfurt (1971), The Journal of Philosophy 68(1):5–20. What is essential to a person is the structure of the will. A person’s will is the effective first-order desire, the one that moves him “all the way to action” (p. 8). A second-order volition is wanting a desire to be one’s will; persons have them, and wantons, who “do not care” about their wills, do not (pp. 10–11). Forming one is identifying with one desire and withdrawing from another (p. 13). Freedom of the will is having the will one wants, “securing the conformity of his will to his second-order volitions” (p. 15), and a decisive identification “resounds” through all higher orders (p. 16). Moral responsibility needs neither a free will nor alternatives: the willing addict acts “of his own free will” (pp. 18–20). | Active — read in full 2026-10-04 (NOTE-545); worth reading as the source of the hierarchical account of the will, which the record has so far held only second-hand: first- and second-order desires, the will as the effective desire, second-order volitions, wantons and persons, freedom of the will as having the will one wants, decisive identification that “resounds” through higher orders, and a responsibility that needs neither a free will nor alternatives. Read it knowing that it is short and programmatic, that identification is stated, not analysed, and that it already contains both the decisive commitment (p. 16) and the acceptance of an addict made by another (n. 10), which the record’s surveys date later. |
| LIT-694 | Alternate Possibilities and Moral Responsibility | Frankfurt (1969), The Journal of Philosophy 66(23):829–839. The principle of alternate possibilities (PAP), “a person is morally responsible for what he has done only if he could have done otherwise”, is false. Coercion excuses only when the agent acts because of it (§§II– III). Black, ready to make Jones4 act as he wants and never needing to, shows that circumstances can make an action unavoidable without playing any role in bringing it about (§IV); such a fact “does not help in any way to understand” the action and cannot excuse it (§V). PAP should be replaced by: not responsible “if he did it only because he could not have done otherwise”, which “does not appear to conflict” with compatibilism (pp. 838–839). | Active — read in full 2026-10-04 (NOTE-546); worth reading as the origin of Frankfurt-style cases and the shortest first-hand statement of the argument against the principle of alternate possibilities: a fact that makes an action unavoidable but plays no role in bringing it about cannot excuse, so PAP should give way to “a person is not morally responsible for what he has done if he did it only because he could not have done otherwise” (p. 838). Read it knowing that its case is schematic (Black, Jones4 and “a certain action”; the voting and shooting versions in the record’s surveys are later retellings), that its prior sign is in a footnote, and that it leaves “could have done otherwise” and “morally responsible” unanalysed on purpose (n. 1). |
| LIT-696 v2 | Towards a Theory of Collective Emotions | von Scheve & Ismer (2013), Emotion Review 5(4):406–413. Collective emotion is synchronous convergence in affective responding towards an event or object. Three literatures (face-to-face contagion and effervescence, culture and shared knowledge, social identification) are recast as bottom-up mechanisms on three levels: social cognition (shared appraisals; collectively intentional appraisals), expressive behaviour (contagion, “facial dialects”) and symbolic practice (collective memory, group-based sentiments, norms, cultural sharing). Mutual awareness and group membership amplify convergence and can turn I-mode into We-mode collective emotion. | Active — read in full 2026-10-04 (NOTE-552); worth reading as a compact map of how collective emotion has been theorised across sociology, social psychology and philosophy, and as the source of a working definition: collective emotion is synchronous convergence in affective responding across individuals towards one event or object. Shared appraisal structures give the minimal case. Mutual awareness (contagion, sharing) and group membership (identity, collective intention, norms, collective memory, sentiments) amplify it and can turn “I-mode” into “We-mode” collective emotion. A conceptual synthesis with no data, built bottom-up by methodological choice. |
| LIT-700 | Three kinds of collective attitudes | List (2014), Erkenntnis 79(S9):1601–1622. Collective attitudes come in three kinds. Aggregate attitudes summarise members’ attitudes by a rule or a market, supervene proposition-wise and need not be rational. Common attitudes are held by all members with common awareness, matter for coordination, and inherit consistency from their unanimity. Corporate attitudes belong to a group agent, guide its action, supervene holistically on members’ contributions and must be rational. The kinds are almost logically independent, and fears and hopes divide the same way as beliefs and desires. | Active — read in full 2026-10-04 (NOTE-554); worth reading as the disambiguation the collective-attitudes literature needs: aggregate attitudes (summaries, supervening proposition by proposition), common attitudes (unanimous and commonly known, supervening on a slightly enriched base) and corporate attitudes (a group agent’s, supervening holistically and not straightforwardly reducible). The three are almost logically independent. A review by its own description, with no new theorem; its value for this record is that it names fears and hopes among the attitudes the split applies to, which gives the collective-emotion debate a vocabulary. |
| LIT-702 | Genuinely collective emotions | Huebner (2010), European Journal for Philosophy of Science 1(1):89–118. Against the received view that only individuals have emotions, it argues that some groups have the computational complexity and informational integration that emotion requires. Emotions are integrated, action- oriented representations built from subpersonal routines; a distributed system can integrate routines the same way. It answers the objection from consciousness (some individual emotions are non-conscious, so collective ones need not be felt) and from homology (emotion kinds are functional, “like vodka”, not “like bourbon”). A navy crew turns out to detect danger without fear; a failing election campaign is offered instead. | Active — read in full 2026-10-04 (NOTE-553); worth reading as the distributed, computational case for collective emotion, and the clearest statement of what it would take. An emotion is an integrated representation with indicative content and imperative force, built from subpersonal routines; a group whose routines are integrated the same way can be in one, without feeling it. The test case fails on the author’s own terms (the USS Palau crew detects danger without fear) and the replacement (a 2008 presidential campaign) is offered as intuitively plausible pending anthropology, so the paper establishes a possibility and a research programme, not an instance. |
| LIT-705 | Group Agency and Supervenience | List & Pettit (2006), Southern Journal of Philosophy 44(S1):85–105. A group agent’s rationality must supervene on its members’ contributions, but not proposition by proposition. Three impossibility results show that robust group rationality (complete, consistent, deductively closed group judgments for every profile of rational member judgments) is inconsistent with majoritarian, uniform proposition-wise and proposition-wise supervenience. Premise-based and distributed premise-based procedures show it is consistent with set-wise supervenience, with group judgments that can be discontinuous with the members’ judgments on the same proposition. Emergent agency without any member’s conception of the group is set aside as unintelligible. | Active — read in full 2026-10-04 (NOTE-550); worth reading as the short, formal core of List and Pettit’s group agency: a group can be a robustly rational judge only if its judgment on a proposition is not, in general, a function of its members’ judgments on that proposition. Group judgments supervene on members’ judgments set-wise, not proposition-wise, so a group agent is individualistically unmysterious and still “not directly continuous” with its members. Read here as the lawful substitute for the unread book LIT-391, whose chapter 3 takes up the same supervenience question; the impossibility results are cited from other papers, not proved here. |
| LIT-706 | The Ripple Effect: Emotional Contagion and its Influence on Group Behavior | Barsade (2002), Administrative Science Quarterly 47(4):644–675. Two studies of mood contagion in a leaderless group negotiation. In Study 1 (94 undergraduates, 29 groups) a trained confederate showed pleasant or unpleasant, high- or low-energy mood. Members’ mood moved with the confederate’s valence, by self-report and by blind video-coders, and pleasant contagion predicted more cooperation, less conflict and higher self-rated performance. Study 2 (113 MBA students, 26 groups, no confederate) found mood convergence (ICC .00 to .24) with the same process correlates. Members recognised that others influenced how pleasant they felt, but not that their mood shaped their judged effectiveness. | Active — read in full 2026-10-04 (NOTE-551), from the August 2001 revise-and-resubmit manuscript Wharton deposited in Penn’s repository, not the published version; worth reading as the first causal test of emotional contagion in groups. A trained confederate’s pleasant or unpleasant mood spread to the members of 29 work groups (self-report and blind video-coders agree), and the more pleasant mood spread, the more cooperative and the less conflicted the group (coder-rated) and the better members rated their own performance. A second study without a confederate found members’ moods converging (ICC .00 before, .24 after). Members related their pleasantness to others’ conduct but showed no awareness of their mood’s bearing on how effective they judged themselves (manuscript p. 37). Valence and energy hypotheses failed or came out mixed. |
| LIT-708 | Rarely categorical, highly separable representations along the cortical hierarchy | Posani, Wang, Muscinelli, Paninski & Fusi (2026), Nature. In the IBL Brainwide Map (about 14,000 cortical units, 43 regions, mice doing one biased-block visual decision task), neurons’ selectivity to eight task variables beats a covariance-matched Gaussian null for clustering only in VISp, AUDp and SSp-ul (4,617 selective neurons; regions with ≥ 50). Pooled modules and the whole cortex do cluster, with clusters tracking anatomy. Once conditions an area cannot tell apart are merged (5 to 16 of 16 remain), ≥ 95% of random balanced dichotomies are linearly decodable above a shuffle null in 15 of 16 analysed regions; GU is 0.82. | Active — read in full 2026-10-04 (NOTE-549); the record’s first brain-wide test of whether neurons within a cortical area come in discrete functional types or form a continuum of mixed selectivity. In mouse cortex during one overtrained decision task, a covariance-matched Gaussian null is beaten within single areas only in a few primary sensory ones, while the task conditions each area tells apart are linearly separable in nearly every balanced split. Neuron types appear when areas are pooled, and track anatomy. Second reading under ADR-013; the anthology holds it as ANTH-LIT-696, read for concept geometry in ML. |
| 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-713 | Causation and Manipulability | Woodward, “Causation and Manipulability”, Stanford Encyclopedia of Philosophy (2001; revised 2023). Causes are handles for manipulation: X causes Y iff some intervention on X, an exogenous change meeting conditions M1–M4 relative to Y, would change Y. The account is non-reductive but not viciously circular, needs no human agent, and distinguishes total, direct and contributing causes by combining interventions. Invariance and levels are not treated here. | Active — read 2026-10-05 (NOTE-585): in full, from the Stanford Encyclopedia of Philosophy’s own open page (2023 revision). Worth reading as Woodward’s compact statement of the interventionist account: X causes Y when an intervention on X, a surgical exogenous change defined by conditions M1–M4, would change Y. It answers the circularity and anthropocentrism objections and separates total, direct and contributing causes. Limits: it is a survey, and this version does not treat invariance, proportionality or levels of causation; for those the book (LIT-723, unread) is needed. |
| 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-716 | Network Epistemology: Communication in Epistemic Communities | Zollman (2013), Philosophy Compass 8:15–27. A survey of how communication structure affects group learning. No structure is best for all problems. With costly lossless transmission, minimally connected networks are optimal; with lossy transmission, stars. When agents average opinions, regular networks are best and denser is faster. In bandit problems minimally connected networks are best even when communication is free. Optimal networks may not be reached by individuals’ choices. | Active — read 2026-10-05 (NOTE-567): read in full from the author’s posted manuscript. Worth reading as the short survey of network epistemology up to 2012. Its main lesson is that the best communication structure depends on the learning problem. Pooling estimates favours dense, regular networks. Costly transmission favours sparse ones, often a star. Active learning in bandit problems favours minimally connected ones. Intuitions about “too little” or “too centralized” communication are often wrong. A survey, weighed as one. |
| LIT-718 | The Conversable, Responsible Corporation | Pettit (2017), in Orts & Smith (eds), The Moral Responsibility of Firms, OUP, pp. 15–35. Corporations are agents and, through authorised spokespersons, conversable ones that avow attitudes and make promises. Because majority voting on connected judgments can be inconsistent, a conversable corporation must correct its aggregate and so forms a mind of its own. Conversable agents are fit to be held responsible, so corporations are. | Active — read 2026-10-05 (NOTE-569): in full, from the manuscript Pettit circulated for a master class at the European University Institute. Worth reading as the short statement of his case that corporations are fit to be held responsible. A corporation is a conversable agent: it speaks for itself through authorised spokespersons and commits itself, rather than reporting its members’ attitudes. It must correct for the inconsistency any mechanical aggregation produces, so it has a mind of its own. Conversable agents meet the three conditions of fitness to be held responsible. The chapter stands in for the unread 2007 paper LIT-742. |
| LIT-719 | Beyond Markets and States: Polycentric Governance of Complex Economic Systems | Ostrom (2009), Nobel lecture; AER 2010. Polycentric arrangements of many formally independent decision centres can perform better than a single hierarchy. Long-surviving common-pool resource institutions share eight design principles, among them monitoring by users or those accountable to them, graduated sanctions, local conflict resolution and nested layers. Communication and self-chosen sanctions raise cooperation in experiments. Fit to local conditions matters more than the type of regime. | Active — read 2026-10-05 (NOTE-563): the Nobel Prize lecture in full, from the Nobel Foundation’s PDF. Worth reading as Ostrom’s own summary of fifty years of work: polycentricity defined, the eight design principles of long-surviving common-pool resource institutions in their updated form, the experiments on communication and self-chosen sanctions, the field evidence on local monitoring, and the warning against single policy prescriptions. A retrospective lecture, not a report of new results. |
| LIT-722 | Nonreductive Physicalism and the Limits of the Exclusion Principle | List & Menzies (2009), Journal of Philosophy 106:475–502. On a difference-making account of causation, Kim’s exclusion principle is false. A revised principle (a property and its realizer never both cause the same effect) holds or fails system by system. The higher-level property is the cause, and excludes its realizer, exactly when the relation is realization-insensitive: the effect would still follow under nearby alternative realizations. | Active — read 2026-10-05 (NOTE-560): in full, from the authors’ accepted manuscript on List’s LSE page. Worth reading for a test of when a higher-level property is a cause in its own right. On a difference-making account, a higher-level property excludes its own realizer as the cause exactly when the effect would still follow had the property been realized differently (realization-insensitivity). Whether that holds is a fact about each causal system, not an a priori truth. Pernu (LIT-147) argues the neuroprosthetic example cannot carry it. |
| LIT-724 | The Communication Structure of Epistemic Communities | Zollman (2007), Philosophy of Science 74:574–587. Simulating Bala and Goyal’s model, in which scientists learn only about the method they pursue, small communities connected in a cycle chose the better method more often than wheels or complete graphs, and took longer to do so. Over all networks of up to six agents, density predicted failure, and hub centrality did not. Misleading early results spread through dense networks before diversity could correct them. | Active — read 2026-10-05 (NOTE-583): read in full from the author’s posted copy. Worth reading as the origin of the “Zollman effect”. In a Bala–Goyal bandit model, where agents learn only about the method they pursue, simulated communities with fewer communication links converged on the better method more often and more slowly than fully connected ones. The cause was density, not the centrality of a hub. A simulation study of small networks (3–10 agents) at one payoff gap. LIT-733 shows the effect is confined to hard inquiry. |
| LIT-725 | The Social Dimensions of Scientific Knowledge | Longino, Stanford Encyclopedia of Philosophy (2002; rev. 2025). States her critical contextual empiricism: evidence bears on hypotheses only through background assumptions, so objectivity depends on critical interaction in a community. That interaction counts only if four norms hold: venues, uptake, public standards, and tempered equality of intellectual authority. It surveys rival models and reports that Zollman’s network result is fragile. | Active — read 2026-10-05 (NOTE-580): §§1, 4 and 5 and the parts of §2 on network models, in the revision of 24 January 2025. Worth reading as Longino’s own statement of her position, written by her as the entry’s author, and as a survey of the rival models of social knowledge (Kitcher, Solomon, Zollman). Read §5 for critical contextual empiricism and its four community norms: venues for criticism, uptake of criticism, public standards, and tempered equality of intellectual authority. Being by Longino, its account of rivals is a participant’s, not a neutral referee’s. |
| 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-727 | The Corporation as a Moral Person | French (1979), American Philosophical Quarterly 16(3):207–215. A moral person is a non-eliminable subject of accountability, which requires intentional agency. A corporation’s Internal Decision (CID) Structure, its organizational chart plus recognition rules in corporate policy, licenses redescribing members’ acts as corporate acts done for corporate reasons. So corporations, unlike mobs, can be full-fledged moral persons. That agency suffices for moral personhood is asserted, not argued here. | Active — read 2026-10-05 (NOTE-568): in full, from a scanned JSTOR copy in a Brooklyn College instructor’s readings folder. Worth reading as the founding statement of the claim that corporations are moral persons. French rests it on the Corporate Internal Decision (CID) Structure: an organizational chart plus recognition rules embedded in corporate policy. It licenses redescribing members’ acts as corporate intentional acts. Limits: he asserts, and says he cannot here argue, that intentional agency suffices for moral personhood, and the paper offers no test of corporate intentionality beyond the redescription itself. |
| LIT-728 | Précis of Responsibility and Control: A Theory of Moral Responsibility | Fischer & Ravizza (2000), Philosophy and Phenomenological Research 61(2):441–445. Moral responsibility requires guidance control, not regulative control over alternatives. Guidance control is acting from a mechanism that is one’s own, because one has taken responsibility for it, and that is moderately reasons-responsive: regularly receptive to reasons, some of them moral, and at least weakly reactive. The view is historical and compatible with causal determinism. | Active — read 2026-10-05 (NOTE-575): in full, from Andrew M. Bailey’s collection of Fischer’s papers, used on the owner’s instruction. Worth reading as the authors’ own five-page statement of the account of Responsibility and Control (LIT-684). It says moral responsibility requires only guidance control, which has two parts: the agent’s ownership of the mechanism that issues in the action, acquired by taking responsibility for it, and that mechanism’s moderate reasons-responsiveness. It summarises and does not argue; the arguments are in the unread chapters. |
| LIT-729 | Exploration and Exploitation in Organizational Learning | March (1991), Organization Science 2(1):71–87. Exploration’s returns are less certain, more remote and more distant than exploitation’s, so adaptive processes refine exploitation faster and become self-destructive in the long run. In a model of mutual learning, the organizational code improves only from members who deviate from it: slow socialization, mixed learning rates and moderate turnover raise organizational knowledge, at a cost to some individuals. | Active — read 2026-10-05 (NOTE-581): in full, from a JSTOR copy in an NTNU doctoral-course readings folder. Worth reading as the source of the exploration–exploitation trade-off in organizations: exploitation’s returns are surer and nearer, so adaptation drives exploration out and becomes self-destructive. A simple simulation of mutual learning between members and an organizational code shows that slow socialization, a mix of learning rates and moderate turnover raise what the organization knows. Limits: the results are from simple models, and March gives no optimal balance. |
| LIT-730 | Episteme Symposium on Group Agency: Replies to Gaus, Cariani, Sylvan, and Briggs | List & Pettit (2012), Episteme 9(3):293–309. Replies to a symposium on Group Agency. Ecological rationality is classical rationality relative to an environment; robust group rationality can be relaxed by context, yet proposition-wise aggregation stays very limited. Group attitudes are real and non-redundant: role-based member acceptance does not reduce them. Group agents are fit to be held responsible in their own right but should have restricted rights, on normative individualism. | Active — read 2026-10-05 (NOTE-582): in full, from the authors’ copy on List’s LSE pages. Worth reading as the authors’ own short commentary on Group Agency (LIT-391, unread), which it quotes with page references. It says the premise-based procedure was only ever illustrative, that robust group rationality may be relaxed case by case without rescuing proposition-wise supervenience, that no accessible individualistic recipe makes group attitudes redundant, and that group agents are fit to be held responsible in their own right but should have restricted rights. Limits: replies to commentaries not in the record; the book’s claims are seen only as quoted. |
| LIT-731 | Tiktok’s enshittification | Doctorow (2023), Pluralistic, 21 January. Platforms die in three stages: good to users, then abusing users for business customers, then abusing both to take the value for themselves. It follows from the ease of reallocating value in a two-sided market, and lock-in, blocked interoperability and monopoly sustain it. TikTok’s “heating” of chosen creators is read as stage two beginning. Remedy: end-to-end delivery and freedom of exit. | Active — read 2026-10-05 (NOTE-573): in full, from the author’s own blog, under a CC BY 4.0 licence. Worth reading as the essay that named enshittification and the earliest statement of it the record holds. Platforms are first good to users, then abuse users for business customers, then abuse both to claw back value; each stage is made possible by the lock-in the last one built, and blocked interoperability raises how much abuse users will bear before leaving. The remedy proposed is end-to-end delivery and freedom of exit. Limits: an opinion essay argued from cases, with linked journalism and the author’s own experience as evidence; its TikTok claim is a prediction. |
| LIT-733 | In Epistemic Networks, Is Less Really More? | Rosenstock, Bruner & O’Connor (2017), Philosophy of Science 84:234–252. Replicating Zollman’s models over wider parameters, the advantage of cycles over complete networks vanishes once the better action is slightly better (pB ≥ 0.525 at size 10), groups are larger, or agents gather more data per round. It persists only where inquiry is hard. Kummerfeld and Zollman’s results behave the same way. Transient diversity is the robust lesson. | Active — read 2026-10-05 (NOTE-559): read in full from the copy on Cailin O’Connor’s website. Worth reading as the robustness check on the Zollman effect. Over a wider parameter space, sparse networks beat dense ones only where inquiry is hard: small groups, small batches of data, and nearly indistinguishable alternatives. Elsewhere sparsity only slows learning. The authors keep Zollman’s transient-diversity point as robust and read these models as “how-potentially” stories. |
| LIT-734 | History As Cause: Columbia and Challenger | Columbia Accident Investigation Board (2003), Report Vol. I ch. 8, pp. 195–204. Foam debris and O-ring erosion followed the same trajectory: each anomaly was reinterpreted as acceptable and “in-family”, and each flight without disaster justified the next. Budget and schedule pressure, a hierarchy that silenced dissent, and a dependent safety organization sustained the pattern. “History is cause”: Challenger’s institutional causes had not been fixed. | Active — read 2026-10-05 (NOTE-578): in full, from the official CAIB report as archived by the UNT Libraries CyberCemetery. Worth reading as the Board’s finding that Columbia repeated Challenger’s organizational cause: technical anomalies normalized one decision at a time, under budget and schedule pressure, in a hierarchy that kept dissent from rising, with a safety organization dependent on the program it oversaw. Limits: a two-case comparison within one agency, written as an official finding; the chapter is unsigned, and its concept of normalization rests on Vaughan’s unread book (LIT-715). |
| LIT-735 | The Epistemic Benefit of Transient Diversity | Zollman (2010), Erkenntnis 72:17–35. In a richer bandit model with beta priors, sparse networks again beat dense ones. Making priors extreme reverses the order: dogmatic agents in a complete network do best. Both limited information and dogmatism keep diversity alive. Together they keep it alive too long, and agents fail to converge. The epistemic good is diversity that is transient. | Active — read 2026-10-05 (NOTE-564): read in full from the author’s posted manuscript (dated 29 September 2009). Worth reading for its conclusion, which Rosenstock et al. (LIT-733) single out as the robust result of this literature: what a community needs is transient diversity, long enough to keep a theory from being dropped too soon and short enough to allow convergence. Sparse communication and stubborn priors each supply it, and together they make diversity too stable and learning fails. The peptic-ulcer history is the motivating case. |
| LIT-736 | Shaping the Institutional Mind | Tollefsen (2025), Philosophies 10(5):112. Advocates and critics of group minds share the “standard view” that ascribing attitudes tracks pre-existing causes. On McGeer’s regulative view, ascription shapes its target. Ascribing knowledge to institutions, as in the collective knowledge doctrine, and issuing institutional narratives shape institutions to be more agent-like. The view stays agnostic about whether institutions really have minds. | Active — read 2026-10-05 (NOTE-570): in full, from the publisher’s open-access PDF (CC BY 4.0). Worth reading for a different answer to why we ascribe beliefs and knowledge to institutions: not because the ascriptions describe pre-existing states, but because, on the regulative view of folk psychology, they shape institutions to be more agent-like. Its main case is the collective knowledge doctrine in corporate criminal law, after which banks built systems to detect reporting violations. Limits: the regulative view is assumed, not argued; the causal story about banks is asserted without evidence; and the paper is agnostic about whether institutions have minds. It does not stand in for her book Groups as Agents (LIT-483), which stays unread. |
| LIT-740 | Cancer across the tree of life: cooperation and cheating in multicellularity | Aktipis et al. (2015), Phil. Trans. R. Soc. B 370:20140219. Multicellularity rests on five kinds of cellular cooperation, and cancer is cheating on them. Surveying cancer-like growth across the independent origins of complex multicellularity, the authors find division-of-labour cheating in every form, and resource and environment cheating so far only in animals and plants. Complex multicellularity is a cheater detection and suppression system. | Active — read 2026-10-05 (NOTE-562): in full, from the open-access deposit in PubMed Central (CC BY 4.0). Worth reading as a survey of cancer-like growth across the independent origins of multicellularity, read as cheating on five foundations of cooperation: proliferation inhibition, controlled cell death, division of labour, resource allocation and maintenance of the extracellular environment. Cheating on division of labour is reported in every form of multicellularity, and complex multicellularity is described as a cheater detection and suppression system. Limits: a literature review with no model or new data; absences may reflect lack of study, and animals’ apparent susceptibility may reflect sampling. |
| 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-744 | Experimentation by Industrial Selection | Holman & Bruner (2017), Philosophy of Science 84:1008–1019. Industry can bias a scientific community without corrupting anyone, by funding researchers whose methods already favour its product, so that they are more productive and train more newcomers. Shown in a bandit-model simulation with methodological diversity and turnover, after the antiarrhythmic drug case. An independent funder helps only if it discounts industry-funded work. | Active — read 2026-10-05 (NOTE-574): in full, from the publisher’s PDF in ANU Open Research, the co-author’s institutional repository, marked open access. Worth reading for a mechanism by which an outside funder biases a scientific community without corrupting anyone: given methodological diversity, a merit-based system and turnover, funding researchers whose methods already favour a product makes them more productive and more likely to train newcomers. An independent funder helps only if it discounts industry-funded work; funding on merit alone makes things worse. Limits: one historical case and a 20-agent simulation at a few parameter settings; run counts and network are not reported, and robustness to network structure rests on a footnote. |
| LIT-745 | Double-Loop Learning, Teaching, and Research | Argyris (2002), Academy of Management Learning & Education 1:206–218. Single-loop learning corrects errors without changing governing values; double-loop learning changes them. Most people espouse double-loop learning but act on Model I: unilateral control, winning, suppressing negative feelings, appearing rational. That produces self-sealing defensive routines in individuals and organizations. A workshop case shows CEOs reproducing the pattern they diagnose. | Active — read 2026-10-05 (NOTE-561): in full, from a Word file of the published issue posted by Action Design, a practice founded by Argyris’s co-authors. The owner chose to use it, since whether they may post it could not be confirmed. Worth reading as Argyris’s compact late statement of the theory of action. Single-loop learning corrects errors within governing values; double-loop learning changes the values. The prevalent theory-in-use, Model I, keeps reasoning tacit and produces organizational defensive routines that are self-sealing. The empirical base is his own workshop transcripts, and the quasi-experimental design is proposed, not run. |
| LIT-747 | Responsibility, Moral and Otherwise | Wolf (2015), Inquiry 58(2):127–142, the 2013 Routledge Lecture. The causal/moral contrast runs together two distinctions, shallow vs deep and moral vs nonmoral; we are deeply responsible for nonmoral traits and art too. Attributability and accountability are independent, not levels: accountability needs only wrongdoing, a position to know it, and its being up to the agent. The fit target of reactive attitudes is, tentatively, an “intelligent” self. | Active — read 2026-10-05 (NOTE-565): in full, from the author’s typescript of the 2013 Routledge Lecture in Cambridge’s Apollo repository. Worth reading as the only lawful full text by Wolf on responsibility the record holds. It argues that deep responsibility is not limited to the moral, and that attributability and accountability are independent, not two levels. Accountability may need nothing metaphysically robust. What makes a self a fit target of the reactive attitudes is, on her “hunch”, that it is an “intelligent” self. Limits: the positive view is offered as a hunch, the psychopath is a stipulated case, and the lecture does not restate the Reason View of Freedom Within Reason (LIT-685). |
| LIT-749 | The Major Transitions in Evolution—A Philosophy-of-Science Perspective | Okasha (2022), Frontiers in Ecology and Evolution 10:793824. A major transition is the evolution of a higher-level unit from formerly free-living units. For one to succeed, higher-level selection must trump selection within the collective, typically through policing or aligned interests. The transitions turn the biological hierarchy from explanans into explanandum, vindicate multi-level selection, and leave the highest occupied level privileged as that of organisms. | Active — read 2026-10-05 (NOTE-586): in full, from the publisher’s open-access PDF (CC BY). Worth reading as a philosopher’s map of the major evolutionary transitions. A transition is the evolution of a higher-level unit from formerly free-living ones; for it to succeed, selection between collectives must come to trump selection within them, typically through policing, kinship or division of labour. The transitions make the biological hierarchy something to be explained rather than assumed, and leave the highest occupied level privileged as the level of organisms. Limits: a review with no model or data, provisional by its own account; it cautions that general principles may explain each transition only coarsely. It stands in for the unread 2005 paper LIT-721. |
| LIT-750 | ”Exit, Voice, and Loyalty”: Further Reflections and a Survey of Recent Contributions | Hirschman (1974; reprinted 1980, Milbank Memorial Fund Quarterly 58(3):430–453). His advocacy of voice was “too timid”: voice can be felt as a benefit, carries richer information than exit, and suits shared uncertainty; exit can be costly or uninformative. Organizations need floor levels of exit and voice for feedback and fail beyond ceiling levels; managers may favour whichever response least threatens their power. | Active — read 2026-10-05 (NOTE-566): in full, from the Milbank Memorial Fund’s own archive of its Quarterly. Worth reading as Hirschman’s own restatement and extension of Exit, Voice, and Loyalty: voice as a recuperation mechanism that can be a benefit rather than a cost and carries richer information than exit; exit that is costly, or that signals nothing; the floor and ceiling levels of each an organization needs; and managers’ interest in steering members toward the least threatening response. Limits: informal and partly a survey, and it presupposes the book (LIT-748, unread), including its treatment of loyalty. |
| 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-756 v4 | Formality Considered Harmful: Experiences, Emerging Themes, and Directions on the Use of Formal Representations in Interactive Systems | Shipman & Marshall (1999), Computer Supported Cooperative Work 8(4):333–352. Users’ unwillingness or inability to make structure, content or procedures explicit is the cause of unexpected difficulty with formal representations in hypermedia, argumentation and design rationale, knowledge-based systems and groupware, and users are often right to resist: formalisms cost overhead, demand tacit knowledge be stated, commit early, fit one person or task, and leave information “between the cracks”. Designers should formalize only what the task needs, infer structure from informal material, and formalize incrementally. Read in the authors’ earlier web version. | Active — read 2026-10-30 (NOTE-1446) in full, in the authors’ web version from Xerox PARC on Frank Shipman’s Texas A&M pages (https://people.engr.tamu.edu/shipman/formality-paper/harmful.html), a text of about 1993–94, not the 1999 journal article; worth reading as the standard statement of the premature-formalization failure: across hypermedia, design-rationale, knowledge-based and groupware systems, users would not or could not make structure explicit, for reasons of cognitive overhead, tacit knowledge, premature commitment and structure that differs by person and task, and they were often right. Read it knowing that its evidence is the authors’ experience and others’ reports, and that what the 1999 text adds was not checked. |
| LIT-757 v3 | Groupware and social dynamics: eight challenges for developers | Grudin (1994), CACM 37(1):92–105. Groupware failures come less from technical problems than from eight challenges that groups pose: disparity in work and benefit, critical mass and the prisoner’s dilemma, disruption of social processes, exception handling, unobtrusive access to rarely used features, difficulty of evaluation, failure of intuition, and adoption. Argued from cases and the literature, with email as the success; no new data. | Active — read 2026-10-14 (NOTE-835) in full; worth reading as the fullest statement of why groupware goes unused: eight challenges, first among them that it asks extra work of members who get no direct benefit, with email as the success in which the one who does the work also wants it done. Read it knowing that it is an argued review of cases, not a study, that Grudin says removing the disparity does not guarantee use, and that its one issue-based system was abandoned for a political reason, not for the disparity. |
| LIT-758 v2 | Issues as Elements of Information Systems | Kunz & Rittel (1970), IURD Working Paper 131, UC Berkeley. Introduces Issue-Based Information Systems: planning treated as an argumentative process whose atoms are issues, questions raised because positions differ, with positions, arguments, questions of fact, topics and model problems around them. Every item is numbered for reference; issues are living, settled or latent; three manual systems are reported in use. A design statement without data. | Active — read 2026-10-14 (NOTE-811) in full; worth reading as the source of IBIS and of the argument-record design this record descends from: issues as the atoms of a planning discourse, positions and arguments on them, a challenge to a supporting statement filed as a new issue, every item numbered for reference, and issues kept as living, settled or latent. Read it knowing that it is a seven-page design statement with no data, that its field report is one sentence of “eager acceptance”, and that it says nothing about what keeping an IBIS costs. |
| LIT-764 | A Mathematical Theory of Communication | Shannon (1948), Bell System Technical Journal 27:379–423 and 623–656. The founding paper of information theory: entropy as the measure of information, the source coding theorem, channel capacity, and the theorem that a noisy channel can carry information at any rate below capacity with arbitrarily small error. Also: the noiseless capacity of constrained channels, equivocation as the information a receiver lacks, C = W log(1 + P/N) for white noise, and the minimum rate for a continuous source at a stated fidelity. | Active — read 2026-10-09 (NOTE-591); worth reading as the source of the measure and both coding theorems, in their first and plainest form: a source’s entropy is the minimum rate it can be sent at (Theorem 9), a noisy channel’s capacity C = max(H(x) − H_y(x)) is the maximum rate at which error can be made arbitrarily small, and errors do not force the rate to zero (Theorem 11, by averaging over random codes). Shannon says the axioms that single out −Σ p log p are not needed by the theory; the coding theorems are its justification. The capacity formula W log(1 + P/N) and the sampling representation are already here (Theorems 13, 17), as is the minimum rate for a source at a given fidelity (Theorem 21). Proofs are sketches at the typical-set level. |
| LIT-769 | Language Evolution by Iterated Learning With Bayesian Agents | Griffiths & Kalish (2007), Cognitive Science 31(3):441–480. When Bayesian learners sample a language from their posterior, iterated learning is a Gibbs sampler and converges to the learners’ prior; when they take the posterior mode, it behaves like a variant of EM and depends also on how much data passes between generations; in a two-language case the MAP outcome is the same for a wide range of prior strengths. Read in NOTE-599. | Active — read 2026-10-09 (NOTE-599); worth reading as the analytic result behind iterated learning: a chain of learners who share a prior and each sample a hypothesis from their posterior is a Gibbs sampler, so the probability that a learner holds a language converges to its prior probability whatever the amount of data passed on, and the data produced converge to the prior predictive. Learners who take the MAP hypothesis run stochastic EM instead: the outcome centres on the prior’s mode but depends on data amount and noise, and in the two-language case is the same for every prior strength α between 0.5 and 1 − ε, so weak biases can be amplified. Equal-fitness populations share the equilibrium. Source of THEORY-155. |
| LIT-770 | Compositional Visual Generation with Composable Diffusion Models | Liu, Li, Du, Torralba & Tenenbaum (2022), ECCV. Reading diffusion models as energy-based models lets several of them be combined at sampling time, as conjunctions and negations of concepts, generating scenes more complex than any seen in training and binding attributes that a single text-conditioned model confuses. Read: strong on object positions in CLEVR, weak on relations, qualitative on text models. | Active — read 2026-10-09 (NOTE-597); worth reading as the paper that moved compositional energy-based generation onto diffusion models: reading a diffusion model’s noise prediction as an energy gradient, concepts are composed at sampling time by adding one classifier-free-guidance term per concept (AND) or subtracting a concept’s prediction (NOT), with no retraining. The product-of-experts reading is exact only for conditionally independent concepts, unit weights and a conservative score, and is derived at zero noise but applied at every noise level. It wins clearly on composing CLEVR object positions (31.36% against an EBM’s 7.34% at three objects), not on relations (2.80% against 4.26%), and is shown on GLIDE and Stable Diffusion only qualitatively. |
| LIT-771 | Cumulative cultural evolution in the laboratory: An experimental approach to the origins of structure in human language | Kirby, Cornish & Smith (2008), PNAS 105(31):10681–10686. Artificial languages passed down chains of human learners become easier to learn and more structured, without any learner intending it: cultural transmission produces design without a designer. Without a pressure against ambiguity the languages collapse into a few words for classes of meanings; with homonyms filtered from training they become compositional. Skimmed in NOTE-596. | Active — skimmed 2026-10-09 (NOTE-596): every section of the main text was covered, but through a fetch tool’s section-by-section account of the PubMed Central page, not a verbatim copy, and the SI was not reached; worth reading as the laboratory demonstration of iterated learning: four chains of ten adults, each learning a 27-item artificial language from 14 items and passing on its test output, made the languages steadily easier to learn and more structured while believing they were copying. Unfiltered, the languages collapsed to 2–5 words that systematically underspecified meaning (colour lost in every chain); with homonyms filtered out of training, they became compositional. Consistent with THEORY-155, not a test of it: no prior was measured, and the filter is a selection the theory excludes. |
| LIT-772 | A synthetic approach to Markov kernels, conditional independence and theorems on sufficient statistics | Fritz (2020), Adv. Math. 370:107239. Markov categories as a framework for synthetic probability and statistics: conditioning, conditional independence, almost-sure equality and sufficient statistics stated in categorical terms, with the Fisher–Neyman, Basu and Bahadur theorems proved there. Basu needs no extra axiom; Fisher–Neyman and Bahadur need strict positivity, not conditionals. Fisher–Neyman is matched to the classical theorem only in FinStoch. | Active — read 2026-10-09 (NOTE-588); worth reading as the reference account of Markov categories and of how much probability and statistics follows from copying, discarding and composing kernels: determinism, four notions of conditional independence with the semigraphoid rules (weak union only with conditionals), almost-sure equality, and sufficiency, completeness and ancillarity. Basu’s theorem holds in every Markov category, and Fisher–Neyman and Bahadur under strict positivity, which Stoch has without conditionals. The abstract Fisher–Neyman is matched to the classical theorem only for finite sets. |
| LIT-773 | A Noether theorem for Markov processes | Baez & Fong (2013), J. Math. Phys. 54:013301. For a Markov process, an observable commutes with the Hamiltonian if and only if both its expected value and its standard deviation are constant in time for every state; in quantum mechanics the mean alone suffices. On a finite state space such observables are exactly those constant on the connected components of the transition graph. | Active — read 2026-10-09 (NOTE-598); worth reading as the stochastic counterpart of the commutator form of Noether’s theorem: for a Markov process, an observable commutes with the generator iff its mean and second moment are conserved in every state. On a finite state space that holds iff it is constant on each connected component of the transition graph. A conserved mean alone is not enough, unlike quantum mechanics, as an explicit 3-state example shows. Only diagonal observables are treated, not symmetries that permute states. |
| LIT-774 | Cours de linguistique générale | Saussure (1916), Payot, compiled posthumously from students’ lecture notes. The founding text of structural linguistics: the sign as an arbitrary union of signifier and signified, langue against parole, synchrony against diachrony, and value fixed by oppositions within the system, with signified and signifier each purely differential and the sign as a whole positive. Read in the third-edition text. | Active — read 2026-10-09 (NOTE-594), in French, from the Wikisource transcription of the third-edition text, not the 1916 first edition; worth reading as the source of the structuralist account of the sign: linguistics takes langue, the social system, as its object; the sign joins a concept and an acoustic image by an arbitrary bond, which is why it resists deliberate change and cannot resist blind change; synchrony and diachrony are irreducible; and a term’s value is fixed by its oppositions to coexisting terms rather than by its signification alone (mouton against sheep and mutton). The “only differences without positive terms” holds of signified and signifier separately; the sign as a whole is called positive. The text is the editors’ reconstruction from students’ notes. |
| LIT-776 | Conditional Simulation Using Diffusion Schrödinger Bridges | Shi, De Bortoli, Deligiannidis & Doucet (2022), UAI, PMLR 180. Extends the Schrödinger-bridge formulation of diffusion generative modelling from unconditional to conditional simulation, applied to super- resolution, filtering in state-space models and refining pre-trained networks. Read: the extended-space bridge is proved; the empirical gains are at small step counts and mixed across metrics. | Active — read 2026-10-09 (NOTE-589); worth reading for the result that posterior sampling from simulation alone, when (X, Y) can be drawn but the likelihood cannot be evaluated, is a Schrödinger bridge between the joint p(x, y) and a reference p_ref(x|y)p(y) with y held fixed along the path (Proposition 1), solvable by iterative proportional fitting with learned drifts (CDSB). Its first iteration is the ordinary conditional score-based model, so later ones refine it, and the reference end can be a cheap posterior approximation rather than noise. Gains over the conditional score model are at equal small step counts and are not uniform across metrics; it filters the Lorenz-63 model with 20 steps where the score model diverges. |
| LIT-777 | Context–content systems of random variables: The Contextuality-by-Default theory | Dzhafarov & Kujala (2016), J. Math. Psychol. 74:11–33. Contextuality-by-Default for finite systems of categorical random variables, indexed by content and context. A system is noncontextual when some coupling of its context bunches makes every connection a maximal coupling; the test is a linear program, the binary cyclic criterion is stated (proved elsewhere), and the minimal total variation of a signed maximally connected quasi-coupling, minus 1, measures the degree of contextuality. | Active — read 2026-10-09 (NOTE-600); worth reading as the reference statement of Contextuality-by-Default: each measurement gets a separate random variable in each context, and a system is noncontextual when some coupling of its contexts makes every content’s copies coincide as often as their own distributions allow (maximal couplings). This separates context-dependent marginals (“direct influences”) from contextuality, turns the test into linear-programming feasibility (Theorem 4.1), and, since a signed such coupling always exists (Theorem 6.1), measures contextuality as the least total variation above 1. The definition was already being replaced by “multimaximal” couplings when it appeared (footnote 10). |
| LIT-779 | The stance triangle | Du Bois (2007), in Englebretson (ed.), Stancetaking in Discourse, pp. 139–182. Stance as one act with three sides: a speaker evaluates an object, thereby positions themselves, and thereby aligns with other speakers, as three aspects of one dialogic act. Read in full. | Active — read 2026-10-09 (NOTE-590), in full, from the author’s posted scan of the published chapter; worth reading as the unifying model of stance in conversation: evaluation, positioning and alignment are not kinds of stance but three aspects of one act (“I evaluate something, and thereby position myself, and thereby align with you”), structured as two subjects and a shared object joined by directed vectors. Stance belongs to utterances in dialogic context, takes an object even when none is spoken, and a resonant stance follow must mark itself with too or either. Argued from Santa Barbara Corpus excerpts, with no counts. |
| LIT-781 | Equivalent Comparisons of Experiments | Blackwell (1953), Ann. Math. Statist. 24(2):265–272. Completes the Blackwell order: for finitely many states, one experiment is at least as informative as another for every decision problem exactly when the other is a garbling of it. The easy direction is Blackwell (1951) and the finite converse Sherman and Stein’s; this paper re-proves the converse by minimax, extends it to arbitrary outcome spaces by a martingale argument, introduces comparison by k-action problems, and reduces two-state comparison to the type I/type II error trade-off. | Active — read 2026-10-09 (NOTE-595); worth reading as the paper in which the comparison of experiments is settled in general: for experiments with finitely many states, being at least as informative in every decision problem (Bohnenblust, Shapley and Sherman’s order) and being able to reproduce the other by a stochastic transformation (Blackwell’s 1951 sufficiency, later called garbling) are the same order. The finite-outcome converse is Sherman and Stein’s, re-proved here by a minimax argument; the extension to arbitrary outcome spaces, by martingale convergence, is new. It adds comparison by k-action problems, and shows that for two states testing problems, and so the type I/type II error curves, decide the order. |
| LIT-782 | GenEval: An Object-Focused Framework for Evaluating Text-to-Image Alignment | Ghosh, Hajishirzi & Schmidt (2023), NeurIPS 2023 Datasets and Benchmarks. An automated benchmark that uses object detectors to score text-to-image outputs on object co- occurrence, position, count and colour, agreeing well with human judgement; models of 2023 still fail at spatial relations and attribute binding. Detector verdicts agree with annotators 83% of the time (annotators with each other 88%); the best open model, IF-XL, scores 0.61 overall, 0.13 on position and 0.35 on binding. | Active — read 2026-10-09 (NOTE-593); worth reading as a measurement of where text-to-image models of 2023 fail at composition, and of how badly embedding similarity sees it: a COCO-trained detector plus masked-crop CLIP colour classification judges each image correct or not on presence, count, position and colour, agreeing with crowd annotators 83% of the time against 88% between annotators, and beating a per-task tuned CLIPScore on counting (by 22 points), position and attribute binding. The best open model (IF-XL) gets 0.61 overall but at most 0.15 on relative position and 0.35 on binding; scaling IF helps binding but not position, and continued training of Stable Diffusion v1 leaves scores flat. |
| LIT-783 | T2I-CompBench: A Comprehensive Benchmark for Open-world Compositional Text-to-image Generation | Huang et al. (2023). A benchmark of compositional text-to-image prompts in categories of attribute binding, object relationships and complex compositions, with category-specific automatic metrics, in the conference version (NeurIPS 2023 Datasets and Benchmarks). Disentangled BLIP-VQA and a UniDet box rule agree with human rankings far better than CLIPScore; spatial relations are hardest; a reward-weighted finetuning baseline, GORS, is rated best by humans. | Active — read 2026-10-09 (NOTE-592), in the conference version (arXiv v2); worth reading as a map of which compositions text-to-image models of 2023 get wrong and which automatic judges can tell: 6,000 prompts in six sub-categories (colour, shape and texture binding; spatial and non-spatial relations; complex), with spatial relations hardest and interactions easiest by human rating. Asking a VQA model one question per object–attribute pair ranks images far more like humans than CLIPScore does (Kendall τ 0.63 against 0.19 on colour), and detector boxes do so for spatial relations; nothing beat CLIPScore on interactions. A reward-weighted finetuning baseline (GORS) is rated best by humans, but its binding score falls sharply on attribute–noun pairs absent from its finetuning prompts (BLIP-VQA 0.55 to 0.34 on shape, 0.76 to 0.36 on texture), a gap the paper calls slight. |
| LIT-786 | On Linguistic Aspects of Translation | Jakobson (1959), in Brower (ed.), On Translation, Harvard University Press, pp. 232–239. The meaning of a sign is its translation into further signs; translation is intralingual, interlingual or intersemiotic. Code-units rarely have full equivalents across languages, but messages can be adequately rendered: “equivalence in difference” is the cardinal problem. All cognitive content is conveyable in any language; languages differ in what they must convey, so obligatory categories force choices that add or drop information. Poetry, where grammar and sound carry meaning, allows only creative transposition. | Active — read 2026-10-09 (NOTE-614): in full, from a scan of the 1959 printing posted as a course reading by the University of Toronto’s Centre for Comparative Literature. Worth reading as the source of the three kinds of translation (intralingual, interlingual, intersemiotic) and of the argument that interlingual translation substitutes whole messages for messages, since code-units rarely have full equivalents. Its sharpest claim is that languages differ in what they must convey, not in what they may convey: obligatory grammatical categories force a translator to add or drop information, so a chain of translations back and forth can strip a message of its content. Limits: an essay argued from examples, with one psychological test cited second-hand; poetry is set aside as untranslatable, open only to “creative transposition”. |
| 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-788 | The Geometry of Causality | Gogioso & Pinzani (2023), arXiv 2303.09017, Part 3 of the trilogy. Empirical models on any cover of a space of input histories are the points of a causaltope, a product of simplices cut by linear causality equations, so causal fractions are linear programs. Causal separability relative to a given ambient space lets entangled or contextually controlled quantum switches witness indefinite order once known no-signalling constraints are imposed, with the causally separable fraction bounded below by the separable local fraction. | Active — skimmed 2026-10-09 (NOTE-624); worth reading as the geometric half of the trilogy and the successor of the withdrawn LIT-813’s polytope and causal-fraction results: the empirical models on any cover of a space of input histories are exactly the points of a “causaltope”, the product of simplices sliced by linear causality equations derived from the space’s topology, so supported fractions and causally separable fractions are linear programs. Causal separability is defined relative to an ambient space rather than to the indiscrete one, which lets quantum switches with entangled or contextual control witness indefinite causal order once known no-signalling constraints are imposed (and not otherwise); the causally separable fraction is bounded below by the separable local fraction, and in the switch examples it tracks, and sometimes equals, the local fraction (“contextual causality”). The BFW model is 0% supported by every causally complete 3-event space and 100% by each of three indefinite orders. Read in part: introduction, causaltopes, standard causal separability and the examples. |
| LIT-790 | Contextuality in Canonical Systems of Random Variables | Dzhafarov, Cervantes & Kujala (2017), Phil. Trans. R. Soc. A 375:20160389. Proposes that contextuality be judged only on a system’s canonical representation: every variable, and every joining or coarsening of interest, replaced by its binary splits, with connections coupled multimaximally (pairwise maximally). For two content-sharing k-valued variables with all splits kept, the canonical system is noncontextual if and only if one variable nominally dominates the other (Pr below the other’s for at most one value; Theorem 4.6). For continuous densities with all splits, any difference in distribution is contextual. | Active — read 2026-10-09 (NOTE-640); worth reading as the step that makes Contextuality-by-Default representation-dependent. Every variable is replaced by binary splits (dichotomizations) and connections are coupled multimaximally, so a verdict belongs to a chosen set of splits, not to the measurements alone. Its one worked result is striking: if every split of two content-sharing k-valued variables is kept, that pair alone is noncontextual exactly when one variable “nominally dominates” the other, i.e. its probabilities fall below the other’s for at most one value (Theorem 4.6). For continuous variables the analogue makes any difference in distribution count as contextuality. The authors present this as opening behavioural contextuality, not as a reductio. Proofs are in the supplement and contain small slips that do not affect the results. |
| LIT-792 | Transformers learn in-context by gradient descent | von Oswald, Niklasson, Randazzo, Sacramento, Mordvintsev, Zhmoginov and Vladymyrov (2022), ICML 2023. Proposition 1 constructs weights for which one linear self-attention layer transforms each token (x_j, y_j) to (x_j, y_j − ΔW x_j), with ΔW one gradient step on the context’s squared loss, so the query token’s read-out equals the prediction of the updated linear model. A trained single layer matches the construction up to scale; deeper models outperform K steps of gradient descent and match GD++, gradient descent on inputs transformed by I − γXXᵀ. Synthetic regression only. | Active — read 2026-10-09 (NOTE-621); worth reading here for one exact identity: with constructed key, query, value and projection matrices, one linear self-attention layer applied to tokens (x_j, y_j) changes every token exactly as one gradient-descent step on the context’s squared regression loss would change the targets (Proposition 1), so reading a context and updating an implicit model’s weights on it produce the same prediction. A trained single layer finds those weights up to scale; deeper trained models match a preconditioned variant (GD++) rather than plain gradient descent. Everything is on synthetic regression with small attention-only models. |
| LIT-793 | Semantic Rate-Distortion Theory with Applications | Zhao, Ma, Li, Yuan, Ye & Zhou (2025), arXiv. Defines semantic distortion as a divergence between the posteriors of a latent meaning S given the original and the reconstructed observation, proves that the information rate–distortion function under this and a symbolic constraint is the operational limit (given lower semicontinuity), and solves the doubly symmetric binary case with total variation and Hamming distortion. With KL divergence the function is the information bottleneck, which the paper does not note. | Active — read 2026-10-09 (NOTE-638); worth reading as the formal version of “preserve the distribution over interpretations, not one meaning”: the semantic distortion compares the posterior of the meaning S given the original observation with its posterior given the reconstruction, alongside an ordinary distortion on the symbols, and the paper proves the coding theorem for the resulting rate–distortion function and solves a binary case. Read it knowing three things the paper does not say. With Kullback–Leibler divergence its expected semantic distortion is exactly I(S;X) − I(S;Y), so its function is the information bottleneck; with total variation it bounds the extra Bayes risk of every bounded-loss decision about S. Its sequence distortion is defined as a maximum inside the expectation, while both proofs use the maximum of per-letter expectations, so the theorems hold for the latter. And its MNIST experiment trains with a classifier’s cross-entropy against the true label, not with the posterior distortion the theory defines. |
| LIT-794 v2 | Making It Explicit: Reasoning, Representing, and Discursive Commitment | Brandom (1994), Harvard University Press. Explains meaning by use in normative terms. Asserting is undertaking a commitment, licensing others’ reassertion and taking on responsibility to show entitlement; interlocutors keep score of one another’s commitments and entitlements; a claim’s content is its inferential role (what it follows from, what follows from it, what it rules out). Logical vocabulary makes these implicit proprieties explicit. Skimmed: the Preface and the core of chapter 3 only. | Active — skimmed 2026-10-09 (NOTE-622); the Preface and the core of chapter 3 (pp. 141–157 and 172–193) were read, the rest of the 741 pages not. Worth reading as the source of the deontic scorekeeping model of assertion. Asserting undertakes a commitment, authorizes others to reassert it, and takes on a responsibility to show entitlement if challenged. Every interlocutor keeps a score of everyone’s commitments and entitlements, so the score is doubly perspectival, and an assertion’s significance is the change it makes to each score, fixed by the content’s inferential role. Read it with the caveat that the reading covers the model, not the book’s arguments for it (chapters 1–2, 4–9). |
| LIT-795 | Context effects produced by question orders reveal quantum nature of human judgments | Wang, Solloway, Shiffrin & Busemeyer (2014), PNAS 111(26):9431–9436. Tests the QQ equality of LIT-834, that the probability of giving the same answer to two questions does not depend on their order, on 70 national surveys and two laboratory experiments. Across all 66 Pew surveys from 2001–2011 that varied the order of two questions, order effects are significant (p = 0.0004) and the q values are not (p = 0.4625); paired context effects across 72 studies correlate at r = −0.82 along the predicted line of slope −1. | Active — read 2026-10-09 (NOTE-604); worth reading as the large-scale test of the QQ equality: across 66 Pew surveys chosen without regard to their results, question order changes the answers significantly (p = 0.0004 for the distribution of order-effect χ² values), while the probability of answering the two questions alike stays the same (p = 0.4625 for the q values). Read with the caveats that the supporting information, which holds the proof, the per-study table and the χ² tests, was not reachable and was not read, and that the paper’s title claims more than its evidence: the equality is a symmetry constraint that the authors concede a classical model could be built to satisfy, and LIT-264 shows that data satisfying it are noncontextual. |
| LIT-796 | The Surprising Effectiveness of Test-Time Training for Few-Shot Learning | Akyürek, Damani, Zweiger, Qiu, Guo, Pari, Kim and Andreas (2024), ICML 2025. Test-time training here is a temporary, per-task LoRA update of a language model on a loss built from the task’s own demonstrations, discarded afterwards. On BIG-Bench Hard (10-shot, Llama 3.1 8B) it raises accuracy from 50.5% (in-context learning) to 57.8%; on ARC it takes a fine-tuned 1B model from 5% to 29% on an 80-task subset and an 8B system to 53.0% on the public validation set. Training on leave-one-out in-context tasks beats training on the bare pairs. | Active — read 2026-10-09 (NOTE-637); worth reading here as a controlled comparison of two uses of the same demonstrations: held as context (in-context learning) or turned into a temporary update of the model’s weights (test-time training, per-task LoRA, discarded after the task). With nothing added but the update, BIG-Bench Hard 10-shot accuracy goes from 50.5% to 57.8% and fine-tuned ARC accuracy roughly sixfold on an 80-task subset (5% to 29%). The update works best when its training data keep the in-context format. The comparison is empirical, at 1B–8B parameters, on two benchmarks with known leakage risk. |
| LIT-797 | An Explanation of In-context Learning as Implicit Bayesian Inference | Xie, Raghunathan, Liang and Ma (2021), ICLR 2022. Models pretraining text as a mixture of HMMs indexed by a latent concept θ and assumes the LM fits it exactly; in-context prediction is then the posterior predictive, and Theorem 1 shows the in-context predictor reaches the Bayes-optimal 0-1 risk as the number of examples grows, when each example’s KL signal about θ exceeds the error from the low-probability transitions between examples. Without that distinguishability, excess risk falls roughly as 1/k in the example length. Small Transformers and LSTMs trained on the synthetic GINC dataset reproduce it, and also show order sensitivity and zero-shot beating few-shot. | Active — read 2026-10-09 (NOTE-633); worth reading as the cleanest formal statement of in-context learning as posterior inference over a latent concept: if pretraining documents are a mixture of HMMs and the model fits that mixture exactly, then conditioning on a prompt of concatenated examples selects the prompt’s concept by posterior concentration, despite the prompt being low-probability under pretraining, provided each example carries more KL signal about the concept than the error from its unnatural boundaries (Theorem 1). The guarantees are asymptotic in the number of examples and say nothing about how a trained network computes the posterior; the experiments are on a synthetic dataset (GINC) built to satisfy the assumptions. |
| LIT-798 | T2I-CompBench++: An Enhanced and Comprehensive Benchmark for Compositional Text-to-Image Generation | Huang, Duan, Sun, Xie, Li & Liu (2025), IEEE TPAMI 47(5). The journal version of T2I-CompBench: 8,000 prompts in attribute binding, 2D/3D spatial and non-spatial relations, numeracy and complex compositions, with detector, depth, VQA and multimodal-LLM judges validated against human ratings, and eleven models benchmarked. GPT-4V is the best judge of interactions and complex prompts; spatial relations remain hardest and interactions easiest; DALL·E 3, SD3 and FLUX.1 lead. | Active — read 2026-10-09 (NOTE-610); worth reading as the 2025 journal extension of T2I-CompBench (LIT-783): 8,000 prompts in eight sub-categories, adding numeracy and 3D-spatial relations, eleven models up to SD3, DALL·E 3 and FLUX.1, and multimodal LLMs as judges. Two things change the conference picture. GPT-4V now agrees with human rankings better than CLIPScore on interactions (Kendall τ 0.48 against 0.25) and complex prompts (0.51 against 0.07), so interactions are no longer scored only by CLIPScore; but human scores on interactions are still near ceiling (0.95–0.99 for five of six rated models), and no new category asks about stance, purpose or social relation. Human ratings cover only the six 2023-era models; the 2024–25 models are ranked by automatic metrics alone. |
| LIT-800 | The Combinatorics of Causality | Gogioso & Pinzani (2022–23), arXiv 2206.08911 (v1 “The Topology and Geometry of Causality”). Generalises causal orders to spaces of input histories, sets of partial input assignments on which outputs may depend, so that causal constraints can depend on inputs. Defines causal completeness, tightness and sequential, parallel and conditional composition; proves the maximal complete spaces are the causal switch spaces; and counts 2644 causally complete spaces on 3 binary-input events (19 from definite orders), with about a billion estimated on 4. | Active — read 2026-10-09 (NOTE-635); worth reading as the paper that replaces causal orders by “spaces of input histories”: finite, join-prime sets of partial functions from events to inputs, each history being data on which the output at its tip event may depend. Order-induced spaces are a special case, and input-dependent (dynamical) causal constraints, such as a switch where one party’s input fixes the order of the other two, are first-class. Spaces form a lattice under inclusion of their extended histories; causal completeness (one tip event per history) recovers definite order; causal switch spaces are exactly the maximal complete spaces. On 3 events with binary inputs there are 2644 causally complete spaces in 102 symmetry classes, of which order-induced spaces account for 19; most are non-tight. It is the first of the three papers that supersede LIT-813, and its spaces replace that paper’s defective “locale of inputs”. |
| LIT-801 | Learning to (Learn at Test Time): RNNs with Expressive Hidden States | Sun, Li, Dalal, Xu, Vikram, Zhang, Dubois, Chen, Wang, Koyejo, Hashimoto and Guestrin (2024), ICML 2025. Makes a sequence layer’s hidden state the weights W of an inner model f, updated per token by a gradient step on a learned self-supervised reconstruction loss, with output f(θ_Q x_t; W_t). With a linear f and batch gradient descent this is exactly linear attention (Theorem 1); with the Nadaraya–Watson estimator as inner learner it is exactly softmax self-attention (Theorem 2). TTT-Linear and TTT-MLP match or beat Mamba at 125M–1.3B and keep lowering perplexity to 32k tokens of context, where Mamba plateaus after 16k. | Active — read 2026-10-09 (NOTE-620); worth reading for its reframing of a sequence layer as a learner trained on its own context: the hidden state is the weights of an inner model, the update rule a gradient step on a self-supervised loss, the output rule the inner model’s prediction. Two exact identities follow: a linear inner model with batch gradient descent is linear attention (Theorem 1), and the Nadaraya–Watson estimator as inner learner is softmax self-attention (Theorem 2). The empirical part, TTT-Linear and TTT-MLP against Mamba and a Transformer at 125M–1.3B, is an architecture result that belongs to the anthology’s question. |
| LIT-803 | Seven Sketches in Compositionality: An Invitation to Applied Category Theory | Fong & Spivak (2018; Cambridge University Press 2019), ARXIV-1803.05316. A textbook invitation to applied category theory in seven chapters, each pairing an application with a structure: generative effects with orders and Galois connections, resources with monoidal preorders and enrichment, databases with functors and adjunctions, co-design with profunctors, signal-flow graphs with props, circuits with hypergraph categories and operads, behaviour with sheaves and toposes. Its first chapter defines a generative effect as an observation that preserves order but not joins, and shows that such maps are exactly the non-left-adjoints. | Active — skimmed 2026-10-09 (NOTE-601): the preface and Chapter 1 read closely, Chapter 3’s opening and its section on adjunctions and data migration read closely, the openings and summaries of Chapters 2 and 4–7 read; Chapters 2 and 4–7 otherwise not read. Worth reading as an introduction to applied category theory organised around compositionality: an observation of systems is a monotone map, a generative effect is its failure to preserve joins, and a monotone map out of a preorder with all joins has no generative effect exactly when it is a left adjoint. Later chapters treat resource theories, databases as functors, co-design, signal-flow graphs, circuits and temporal logic, each through a categorical structure. |
| LIT-804 | Computational challenges to test and revitalize Claude Lévi-Strauss transformational methodology | Doja, Capocchi & Santucci (2021), Big Data & Society 8(2). Proposes DEVS modelling and simulation (in DEVSimPy) to generate Lévi-Strauss’s myth transformations and to map a myth’s mythemes onto a landscape, and a “neo-structural” extension of the canonical formula to identity politics. Implemented: myths as mytheme lists, variants generated by user-specified operations, and a Google Earth display of one Corsican folktale. A software demonstration; no structural hypothesis is tested. | Active — read 2026-10-09 (NOTE-609), in full, from the publisher’s PDF deposited in HAL; worth reading as a statement of a programme rather than a result: the authors propose discrete-event system specification (DEVS) modelling, in their Python environment DEVSimPy, to generate and visualise Lévi-Strauss’s transformations of myth, and to extend the canonical formula to identity politics. What the paper implements is modest: a myth is entered as a list of mythemes (term and function), a new variant is produced from a reference myth (Lévi-Strauss’s M1 Bororo) by transformation operations stored as an attribute of a model, i.e. specified by the user, and the variants are drawn as a graph; the “validation” plots the 20 mythemes of one Corsican folktale, U Lurcu, on Google Earth in narrative order. No hypothesis about how myths transform is tested. The transformation engine is summarised from the authors’ 2020 Symmetry paper, not presented here. |
| LIT-806 v2 | Attend-and-Excite: Attention-Based Semantic Guidance for Text-to-Image Diffusion Models | Chefer et al. (2023), ACM TOG 42(4) (SIGGRAPH 2023). Stable Diffusion often omits one of two named subjects (“catastrophic neglect”) and misbinds attributes. Shifting the latent at each early denoising step to raise the peak cross-attention of the most neglected subject token mitigates neglect, by CLIP and caption similarity and by human preference, with no training. Binding gains are shown in figures, not measured. | Active — read 2026-10-09 (NOTE-639); worth reading as the paper that names “catastrophic neglect” (a text-to-image model omits one of the subjects a prompt names) and links it to attribute binding: the subject token that no image patch attends to is the one that goes missing. Its fix is an inference-time correction of the latent: push up the maximum cross-attention of the most neglected subject token, smoothed over neighbouring patches, during the first half of sampling. Evidence is on 276 two-subject Stable Diffusion prompts, by CLIP similarities, BLIP captions and a 65-person preference study (77–91% preferred it). That it improves attribute binding is shown only in figures; no binding accuracy is measured, and relations are left out of scope. |
| LIT-807 | A Discrete-Event Simulation of Claude Lévi-Strauss’ Structural Analysis of Myths Based on Symmetry and Double Twist Transformations | Santucci, Doja & Capocchi (2020), Symmetry 12(10):1706. Specifies the authors’ DEVS models (in DEVSimPy) for generating variants of a myth from a reference myth by Lévi-Strauss’s transformations, and a NetworkX graph of the variants produced. Every basic transformation is a user-specified substitution of one term for another across the mythemes; the canonical formula is described but its computation is not; validation is reproduction of 70 Mythologiques myths and 28 Corsican tales by transformations chosen to produce them. | Active — read 2026-10-09 (NOTE-632), in full, from the publisher’s version deposited in HAL; worth reading as the place where the authors’ “transformation model” of Lévi-Strauss is actually specified, and for what that specification turns out to be. A myth is a list of mythemes, each a pair (term a, function x); homology, inversion, opposition and symmetry are all one operation, replacing a term by another term in every mytheme, the inverse, opposite or “symmetric” term being supplied by the user; adding and removing a mytheme complete the set. The canonical formula is explained by Lévi-Strauss’s Jealous Potter example and listed as selectable, but no rule for computing it on a mytheme list is given. The “validation” generates 70 myths of the Mythologiques and 28 Corsican folktales by choosing, each time, the transformations that produce them, and reports them correct against Lévi-Strauss’s books and Corsican specialists, with no measure. It encodes an analyst’s transformations; it does not find or test them. |
| LIT-808 | The Topology of Causality | Gogioso & Pinzani (2023), arXiv 2303.07148, Part 2 of the trilogy. Extends Abramsky–Brandenburger from no-signalling to arbitrary, possibly dynamical or indefinite, causal structure: causality is continuity in the lowerset topology, causal functions form a presheaf that fails to be a sheaf exactly on spaces with “solipsistic contextuality”, empirical models live on any open cover, and standard empirical models on causal switch spaces (total orders included) are always local, so the Leggett–Garg model is local for its own total order. | Active — read 2026-10-09 (NOTE-612); worth reading as the direct successor of the withdrawn LIT-813’s sheaf construction, now over spaces of input histories (LIT-800) rather than a “locale of inputs”: a joint input–output function is causal when each event’s output depends only on the histories with that event as a tip, causal functions are exactly free assignments of outputs to tips (up to tip-equivalence in non-tight spaces), and an extended function is causal iff it is continuous for the lowerset topology. Causal functions form a separated presheaf that is a sheaf exactly when the space admits no “solipsistic contextuality”, so tight spaces give a sheaf and some dynamical causal structures do not, letting deterministic local data fail to glue. Empirical models are compatible families of distributions over causal functions on any open cover, from the fully solipsistic to the classical; standard empirical models on causal switch spaces, total orders included, are always local. Source of THEORY-171. |
| LIT-809 v2 | That’s what she (could have) said: How alternative utterances affect language use | Bergen, Goodman & Levy (2012), Proceedings of the 34th Annual Meeting of the Cognitive Science Society, 120–125. Recursive speaker–listener reasoning yields specificity implicatures, but cannot derive Horn’s principle from costs alone; adding uncertainty over the lexicon does, in one-shot signalling games, without equilibrium refinements. Two online games with novel symbols find both implicatures drawn without prior conventions. | Active — read 2026-10-09 (NOTE-613); worth reading as the paper in which the RSA recursion is made to derive Horn’s division of pragmatic labour (costlier forms for less likely meanings) in one-shot signalling games with no prior conventions: the basic recursion cannot break the symmetry between equally meaningless costly and cheap signals, but a listener and speaker uncertain about the lexicon, marginalizing over every lexicon that could assign the signals meanings, converge on the efficient mapping without an equilibrium-selection rule. Two small Mechanical Turk games (40 and 140 participants) show people drawing specificity and Horn implicatures among novel symbols in five rounds, with no first-round difference. Source, with LIT-821 and LIT-816, of THEORY-172. |
| LIT-810 | Efficient compression in color naming and its evolution | Zaslavsky, Kemp, Regier & Tishby (2018), PNAS 115(31):7937–7942. Treats a language’s colour lexicon as an information-bottleneck encoder from perceptual meanings to words and finds the World Color Survey’s 110 languages, and English, near the IB complexity–accuracy bound, with one trade-off parameter β (fitted values just above 1) accounting for much of the variation between them. IB optima have soft boundaries and inconsistently named regions, as the data do, and the IB path through β passes through structural phase transitions that roughly recapitulate Berlin and Kay’s sequence, apart from an early yellow category the data lack. | Active — read 2026-10-09 (NOTE-631); worth reading as the paper that puts the information bottleneck to work on word meanings: a lexicon is an encoder q(w|m) from meanings (Gaussians over CIELAB colour) to words, scored by complexity I(M;W) against accuracy I(W;U), and the colour-naming systems of the World Color Survey and English lie close to the IB curve at β only slightly above 1, with 93% beating all 39 hue-rotated variants of themselves. Read it knowing that the need distribution (the LI source) is estimated from the naming data, cross-validated over languages, and that the “evolution” is a reading of the annealing path along the curve, not a model of historical change. Source of THEORY-163. |
| LIT-812 | Rate-Distortion-Perception Theory for Semantic Communication | Chai, Xiao, Shi & Saad (2023), IEEE ICNP 2023 workshop. Models a semantic source S seen by the encoder only through X, with Wyner–Ziv side information and common randomness, and states the rate needed to reproduce S within an expected distortion and a total-variation bound on its distribution. Closed form for a doubly symmetric binary source: recovering X exactly does not recover S, and with side information the rate reaches zero at a non-trivial distortion. Proofs sketched. | Active — read 2026-10-09 (NOTE-605); worth reading as a short statement of semantic communication as indirect (remote) source coding with a perception constraint: the encoder sees only a noisy observation X of the semantic source S, the decoder must reproduce S within an expected distortion and within a total-variation distance of S’s distribution, and side information Y may help. It gives a rate region, a closed form for a doubly symmetric binary source, and an MNIST illustration. Read it knowing that it is a six-page workshop paper whose proofs are sketched or omitted, that the region as printed mixes channel and source terms and does not define the reconstruction, and that its “zero-rate recovery” is the familiar fact that a decoder with side information needs no bits once the tolerated distortion is what the side information alone achieves. |
| LIT-814 | Rethinking the Role of Demonstrations: What Makes In-Context Learning Work? | Min, Lyu, Holtzman, Artetxe, Lewis, Hajishirzi and Zettlemoyer (2022), EMNLP 2022. Replacing the gold labels of in-context demonstrations with random labels from the label set barely lowers accuracy (0–5 points absolute, over 12 model–method pairs including GPT-3 and 26 datasets). What the demonstrations do supply is the input distribution, the label space and the input-label pairing as a format; keeping the format with only inputs or only labels retains up to 95% of the gain. Meta-training for in-context learning sharpens the effect. | Active — read 2026-10-09 (NOTE-607); worth reading as the measurement that separates what a demonstration supplies from whether its labels are right: across 12 model–method pairs up to GPT-3 and 26 classification and multi-choice datasets, replacing gold labels with random ones costs 0–5 points, while removing the input distribution, the label space or the paired format costs much more. The finding is empirical and aggregate; some dataset–model pairs lose up to 14 points, and generation tasks are not tested. |
| LIT-815 | Using Speakers’ Referential Intentions to Model Early Cross-Situational Word Learning | Frank, Goodman & Tenenbaum (2009), Psychological Science 20(5):578–585. A Bayesian word learner that infers the speaker’s intended referents and the lexicon together, with words uttered referentially or not, beats association and IBM Model 1 baselines on hand-annotated child-directed video (lexicon precision .67, F .55) and predicts mutual exclusivity, one-trial learning, word-driven object individuation and intention-guided mapping without principles built in for them. | Active — read 2026-10-09 (NOTE-611); worth reading as the model in which a word learner infers the speaker’s referential intention and the lexicon jointly: words are generated from an unobserved intended referent (a subset of the objects present, possibly empty) through the lexicon, or non-referentially, and the MAP lexicon is found by search. On two ten-minute CHILDES videos it learns a far more precise lexicon than association and translation baselines (F .55 against at most .22), and it reproduces mutual exclusivity, Xu’s word-driven object individuation and Baldwin’s intention-reading result. Read it as a word-learning paper: it has no model of an informative speaker; Bergen, Goodman and Levy (2012) cite a different 2009 paper, by Frank, Goodman, Lai and Tenenbaum, for that. |
| LIT-816 | Pragmatic Language Interpretation as Probabilistic Inference | Goodman & Frank (2016), Trends in Cognitive Sciences 20(11):818–829. The review that names and states the rational speech act framework: a listener interprets an utterance by Bayesian inversion of an approximately rational speaker who values informativeness to a literal listener, replacing Grice’s maxims with one utility-theoretic cooperative principle; joint inference over the speaker’s topic, knowledge or lexicon (uRSA) extends it to non-literal language, vagueness and embedded implicature. | Active — read 2026-10-09 (NOTE-606), from the authors’ manuscript; worth reading as the standard statement of the rational speech act (RSA) framework: a pragmatic listener P_L(w|u) ∝ P_S(u|w)P(w) inverting a softmax speaker whose utility is log P_Lit(w|u), with a literal listener conditioning the prior on the utterance’s truth. Its uncertain-RSA extension, a joint posterior over the world and the speaker’s type, topic or lexicon, is what carries hyperbole, irony, metaphor, vague adjectives and embedded implicature. A review: the empirical support it cites is summarized, not shown, and its claims of near-ceiling fits rest on the cited papers. Source, with LIT-821 and LIT-809, of THEORY-172. |
| LIT-818 | Defaults in Update Semantics | Veltman (1996), J. Philos. Logic 25(3):221–261. Defines an update system (a sentence’s meaning is an operation on information states), proves it reduces to static propositions exactly when it is additive, and shows epistemic “might” and “presumably” are non-persistent tests. Builds a decidable non-monotonic logic of default rules (“if φ, normally ψ”) in which specificity and other priorities between conflicting defaults follow from coherence and applicability conditions on expectation frames. | Active — read 2026-10-09 (NOTE-617); worth reading as the programmatic statement of update semantics: the meaning of a sentence is the change it makes to an information state, and an update system is “additive”, so reducible to static propositions, exactly when updates are total, idempotent, persistent, monotone and strengthening. “Might” and “presumably” fail persistence: they are tests on a state, not information about the world. Its second half is a theory of defaults in which priority between conflicting rules (“more specific wins”, the Nixon diamond left open) follows from a coherence and an applicability criterion rather than being stipulated. Read the default theory as one formalisation the author himself hopes will be bettered; the framework is the lasting part. |
| LIT-819 | Getting to the Bottom of Noether’s Theorem | Baez (2020; chapter 2022), ARXIV-2006.14741. In Poisson algebras, complex *-algebras and Banach–Lie algebras, “a generates symmetries of b iff b generates symmetries of a” follows from the antisymmetry of the bracket and uniqueness of solutions; for a bilinear bracket, antisymmetry is the self-conservation principle {a, a} = 0. The nontrivial content is a map from observables to generators: in complex quantum mechanics multiplication by i, and in a unital JB-algebra Alfsen and Shultz’s dynamical correspondence, whose second condition Baez links to “inverse temperature is imaginary time”. | Active — read 2026-10-09 (NOTE-630); worth reading as an account of what Noether’s theorem, in its Hamiltonian form, actually assumes: given unique solutions of the flow equations, “a generates symmetries of b iff b generates symmetries of a” reduces to the antisymmetry of a bilinear bracket, which is equivalent to each observable conserving itself. The content lies in identifying observables with generators; in quantum theory that identification is multiplication by i, and Alfsen and Shultz’s dynamical correspondence recovers it from a JB-algebra under the self-conservation principle and a second condition that Baez reads as “inverse temperature is imaginary time”. The paper proves nothing new, by its own statement. |
| LIT-820 | Iterated learning: Intergenerational knowledge transmission reveals inductive biases | Kalish, Griffiths & Lewandowsky (2007), Psychonomic Bulletin & Review 14(2):288–294. Human chains of function learners, each trained on the previous learner’s test responses, converged in a few generations to a positive linear function in 28 of 32 families, whatever function trained the first learner, as Bayesian iterated learning predicts for a prior favouring positive linear functions. The prior was inferred from earlier studies, not measured; stationarity was not shown. | Active — read 2026-10-09 (NOTE-616), in full, from the publisher’s PDF; worth reading as the first laboratory test of iterated learning against an inductive bias known before the experiment: in 32 chains of nine human learners each passing a function-learning task down the line, 28 converged within a few generations to a positive linear function whatever the first learner was trained on (positive linear, negative linear, U-shaped or random pairings), as Bayesian agents sampling from a prior that favours positive linear functions would. The prior was not measured in the experiment but taken from earlier function-learning studies; 3 families ended on the negative linear function and 1 did not converge, and the authors say more data would be needed to show the chains had reached a stationary distribution. Bears on THEORY-155. |
| LIT-821 | Predicting Pragmatic Reasoning in Language Games | Frank & Goodman (2012), Science 336(6084):998. In one-shot three-object reference games on Mechanical Turk, speakers’ word bets match a speaker who chooses words in proportion to their specificity (r = .98), and listeners’ referent bets match the Bayesian inversion of that speaker with an empirically measured salience prior (r = .99), though salience and listener bets alone are uncorrelated (r = .19). The founding quantitative test of what was later called the rational speech act model. | Active — read 2026-10-09 (NOTE-634); worth reading as the one-page origin of the rational speech act model’s quantitative test: a listener who inverts, by Bayes’ rule, a speaker who chooses words in proportion to their informativeness (exp of minus surprisal under a literal listener, which reduces to the size principle |w|⁻¹), combined with an empirically measured salience prior, predicts mean listener bets in three-object reference games at r = .99 with no fitted parameters (α set to 1). Read it knowing that the fit is to means over seven context types, that the prior is measured in a separate group, and that the speaker and listener groups never interact. Source of THEORY-172. |
| LIT-822 | Transformation transformed | Descola (2016), HAU 6(3):33–44. A keynote on structuralism as method: meaning lies in contrasts within a set of variants, and a structure is the set of invariant relations that orders transformations between them. Lévi-Strauss used transformation in two regimes, Goethean development of an initial form (kinship) and Thompsonian deformation between given forms (myth, where the analyst chooses the cuts). Descola’s fourfold ontology is a Goethean group; structural comparison is anthropology’s fairest symmetrization. | Active — read 2026-10-09 (NOTE-641), in full, from the PDF on the journal’s own site (haujournal.org); worth reading as a short statement, by Lévi-Strauss’s student, of what structural analysis is when separated from Lévi-Strauss’s philosophy: no phenomenon has meaning in itself, only in contrast with others of its kind, and a structure, unlike a system, is the set of invariant relations that lets one move from one variant to another by transformation. Descola distinguishes two regimes of transformation in Lévi-Strauss: a Goethean one, the development of an initial form into its possible variants (kinship in Les structures élémentaires, and Descola’s own four ontologies), and a Thompsonian one, continuous deformation between given forms (myth). In myth, he notes, the group of transformations is a virtual continuum on which the analyst makes the cuts, so the path between variants is the analyst’s choice. A keynote lecture; argued, not demonstrated. |
| LIT-823 | Semantic Communication: A Survey of Its Theoretical Development | Xin, Fan & Letaief (2024), Entropy 26(2):102. A survey of semantic information theory: semantic entropy (logical probability, task-, knowledge- and context-based variants), semantic rate–distortion with meaning as a latent state behind the observation, semantic noise and semantic channel capacity, and the information bottleneck, age of information, joint source–channel coding and LLMs as tools. It records that no unified framework exists. | Active — read 2026-10-09 (NOTE-619); worth reading as a map of what “semantic information theory” has meant from Carnap and Bar-Hillel to deep-learning semantic communication: logical-probability and knowledge-base definitions of semantic entropy, a semantic rate–distortion function in which meaning is a hidden state S observed through X, semantic channel capacities that can exceed Shannon capacity by tolerating bit errors, and the information bottleneck, age of information, joint source–channel coding and LLMs as tools. It is a catalogue, not a synthesis: it states that no agreed framework exists, compares the definitions only informally, and does not cover rate–distortion–perception work. One formula is misstated (the bottleneck constraint is written with its inequality reversed). |
| LIT-824 | Informative Communication in Word Production and Word Learning | Frank, Goodman, Lai & Tenenbaum (2009), Proceedings of CogSci 31, pp. 1228–1233. A speaker who chooses words to minimise the KL divergence between her intended meaning and a word’s literal meaning picks, for a known referent, a true word with probability ∝ |w|^(−α): the size principle, derived from communication. Word learners’ bets about a novel word’s meaning fit the inverted model at r = .93; speakers’ free descriptions follow it only weakly (r = .19, and not at all for colour terms). | Active — read 2026-10-09 (NOTE-627); worth reading as the paper that first writes the informative speaker down: a speaker soft-maximises the utility −D_KL(M_S ‖ w̃), the information lost about her intended meaning when it is replaced by the uniform distribution over a word’s extension, so for a known referent she picks a true word with probability ∝ |w|^(−α), the size principle derived from communicative premises. A learner who knows the referent inverts that speaker to infer what a novel word means; 700 web participants’ bets track the model’s predictions (r = .93). In a free-description task speakers’ use of Flickr tag-words correlates only weakly with informativeness (r = .19 overall, .51 without colour terms, .02 for colour terms). It has no listener inferring a referent and no recursion: that step is Frank and Goodman 2012 (LIT-821). |
| LIT-825 | Larger communities create more systematic languages | Raviv, Meyer & Lev-Ari (2019), Proc. R. Soc. B 286:20191262. In a laboratory group-communication game, groups of eight built more systematic (compositional) languages than groups of four, faster and more consistently, with the same total interaction; small groups varied more, as drift would predict. Input variability, greater in larger groups, predicted gains in structure. Group size was isolated from network structure and second-language learners, the confounds of cross-linguistic correlations. | Active — read 2026-10-09 (NOTE-628), the main text in full from the publisher’s version in the Radboud University repository; the electronic supplementary material was not read. Worth reading as the experiment that isolates community size: 12 groups of four and 12 groups of eight Dutch adults, fully connected, invented a typed language to describe moving shapes over 16 rounds with the same total amount of interaction. Larger groups’ languages became more systematic (string distance tracking meaning distance), faster, and ended more systematic; larger groups also varied far less from one another, while some small groups never built structure. Larger groups faced more input variability, and input variability predicted the next round’s gain in structure better than shared history did. Communicative success and convergence ended equal. It is a group-interaction paradigm, not a transmission chain: no generation turnover. Source of THEORY-164. |
| LIT-827 | Backprop as Functor: A compositional perspective on supervised learning | Fong, Spivak & Tuyéras (2017; LICS 2019), ARXIV-1711.10455. Supervised learners compose only when each carries a request function that passes a corrected input upstream; learners (P, I, U, r) then form a symmetric monoidal category Learn, and gradient descent with backpropagation, for a fixed step size ε and an error function e with ∂e/∂x(x₀, −) invertible, is a faithful, injective-on-objects strong symmetric monoidal functor Para → Learn. Functoriality is the chain rule. | Active — read 2026-10-09 (NOTE-625); worth reading as the paper that makes supervised learners composable: a learner A → B is a parameter set with implement, update and request functions, learners form a symmetric monoidal category Learn, and for a fixed step size and an error function whose derivative in its first argument is invertible, gradient descent with backpropagation is a faithful strong symmetric monoidal functor from differentiable parametrised functions to Learn. The backward message is a requested input, not a gradient step; cross-entropy falls outside the theorem. |
| LIT-828 | Морфология сказки | Propp (1928), Leningrad, Academia (Morphology of the Folktale, English 1958, 2nd ed. 1968). In a hundred Russian wondertales the constants are the characters’ functions, defined by their place in the action, not the characters or motifs: 31 functions, always in one order, distributed over seven spheres of action, so all wondertales are of one type and differ in what they omit, how functions are realised and who performs them. Classification by plot is impossible; the wondertale may be morphologically a myth. | Active — read 2026-10-09 (NOTE-615), in Russian, the preface and all nine chapters of the 1928 first edition from a library scan in full view at the Internet Archive; the appendices skimmed. Worth reading as the founding structural analysis of narrative: in the wondertales of Afanasyev’s collection (nos. 50–151), what stays constant is not the characters or motifs but the functions of the characters, actions defined by their consequence for the plot; there are only 31, they follow one order, and so all wondertales are of one type, differing in which functions they omit, how each is realised and who performs it. Functions fall to seven spheres of action (villain, donor, helper, princess and her father, dispatcher, hero, false hero). Propp holds that a tale can be generated from the scheme, that plot and variant cannot be told apart, and that wondertales in their morphological basis are myth. Source of THEORY-167. |
| LIT-830 v2 | Morphology of the Folktale | Propp (1958), Morphology of the Folktale, trans. Laurence Scott, ed. Svatava Pirkova-Jakobson, Indiana University Research Center in Anthropology, Folklore and Linguistics, Publication 10 (IJAL 24(4), pt. 3); 2nd ed., revised and edited by Louis A. Wagner, introduction by Alan Dundes, University of Texas Press, 1968. The English translation of Морфология сказки (1928), held as LIT-828 and read there in Russian. Skimmed in the 1968 edition (chs. II–III and Dundes’s introduction): the four theses and 31 functions match the Russian reading; the genre and character terms shift (“folktale”, “fairy tale”, “dramatis personae”); and Wagner’s notes correct Propp’s tale references and renumber the tales. | Active — skimmed 2026-10-09 (NOTE-642) in the 1968 edition: Dundes’s introduction and chs. II–III (pp. 19–65), from copies on University at Buffalo and MIT web pages; the 1958 edition was not seen. Worth reading as the text through which most readers outside Russia met Propp. Chs. II–III carry the four theses and all 31 functions with their definitions and signs, matching the record’s reading of the Russian (NOTE-615), but with Latin and Greek signs that differ from the Cyrillic. It names the class “fairy tales” under a title its own introducer calls misleading, and alternates “dramatis personae” with “characters”. Wagner’s 41 notes in those two chapters correct Propp’s tale citations and renumber the tales to the later Afanas’ev numbering. The seven roles (ch. VI) were not read. |
| LIT-831 | Contextuality-by-Default 2.0: Systems with Binary Random Variables | Dzhafarov & Kujala (2017), Quantum Interaction 2016, LNCS 10106:16–32. CbD 2.0 for binary random variables: a system is noncontextual when its bunches are compatible with the multimaximal couplings of its connections, couplings in which every subset of a connection is maximally coupled. For binary variables that coupling exists, is unique and has an explicit staircase form (Theorem 1), so subsystems of a noncontextual system are noncontextual (Theorem 3). Cyclic and consistently connected systems are judged as in CbD 1.0, and the total-variation measure carries over. For non-binary variables the construction fails, and dichotomization is proposed. | Active — read 2026-10-09 (NOTE-643); worth reading as the paper that defines “CbD 2.0”: for systems of binary random variables, the copies of a content across contexts are coupled multimaximally (every subset, equivalently every adjacent pair in the order of their means, maximally coupled) rather than maximally as a whole, and such a coupling exists and is unique (Theorem 1). The change buys heredity (a noncontextual system’s subsystems are noncontextual, Theorem 3) and removes the partial/complete distinction, and it leaves cyclic systems, consistently connected systems and the negative-probability measure as they were. It shows by example that for non-binary variables multimaximal couplings may fail to exist, may not be unique, and are not stable under coarse-graining, and ends by proposing to dichotomize every variable, the step the canonical-systems paper (LIT-790) takes. |
| LIT-833 | Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivity | Lu, Bartolo, Moore, Riedel and Stenetorp (2021), ACL 2022. With the same four SST-2 examples, the 24 orders range from near chance (~50%) to above 85% accuracy, in GPT-2 and GPT-3 from 0.1B to 175B. Good orders are model-specific (pairwise Spearman correlations between sizes all between −0.35 and 0.27, on one example set), the variance persists with up to 32 examples and after calibration, and failing orders mostly predict one label. Ranking orders by the label entropy they induce on a self-generated probing set recovers an average 13% relative gain across eleven classification tasks. | Active — read 2026-10-09 (NOTE-626); worth reading as the measurement that the order of the same few-shot examples, with content held fixed, can move a language model from near chance to near the fine-tuned state of the art, at every size from GPT-2 Small to GPT-3 175B. Good orders do not transfer between model sizes (rank correlations near zero), more examples do not remove the variance, and failing orders mostly collapse the predicted label distribution. The rest of the paper is a selection method (entropy over a self-generated probing set) whose interest here is secondary. |
| LIT-834 | A Quantum Question Order Model Supported by Empirical Tests of an A Priori and Precise Prediction | Wang & Busemeyer (2013), Topics in Cognitive Science 5(4):689–710. Models answering an attitude question as projecting a belief state onto the answer’s subspace and replacing the state by the normalised projection. Non-commuting projectors are then necessary for order effects, and a parameter-free constraint follows for any state and any projectors: the probability of answering the two questions differently is the same in both orders (the QQ equality). Five of six data sets meet it; the sixth, where background information was read out between the questions, fails it, as predicted. | Active — read 2026-10-09 (NOTE-636); worth reading as the source of the quantum question (QQ) model and its QQ equality: if each answer is a Lüders projection of one belief state, the probability of giving different answers to two questions is the same in both orders, whatever the state, the projectors or the dimension. Six data sets bear it out, and the Rose–Jackson poll fails it, as the authors predicted, because new information was inserted between the questions. Read with the caveat that the case against classical rivals is thin: the Bayesian argument is informal and the Markov proof is “available upon request”, so the paper shows that unconstrained classical models need not satisfy the equality, not that none can. |
| LIT-835 | Performative updates and the modeling of speech acts | Krifka (2024), Synthese 203:31. Adds to Stalnaker’s informative update, which filters a context set, a performative update that changes each index minimally so a proposition becomes true. Declarations are purely performative; assertions are a performative guarantee by the speaker followed by a negotiable informative update; commissives, directives, exclamatives, optatives, definitions and the locutionary act itself are modelled as index changes, and hereby marks a proposition made true by the utterance. | Active — read 2026-10-09 (NOTE-602); worth reading as the dynamic-semantic statement of the performative/constative distinction: an informative update removes indices from a context set (Stalnaker), a performative update changes them minimally so that a proposition holds (after Szabolcsi 1982), and so can add indices the context did not contain. A declaration is a pure performative update; an assertion is a performative update (the speaker publicly guarantees the proposition) followed by an informative update that the addressee may refuse. The same declarative sentence is structurally ambiguous between the two. Read it as a formal proposal argued from linguistic evidence (hereby, hedges, tense across languages), not as a tested theory, and note that commitment spaces, which carry the negotiation, are Krifka’s other papers, not this one. |
| LIT-836 | Probabilistic Foundations of Contextuality | Dzhafarov & Kujala (2017), Fortschr. Phys. 65:1600040. Being jointly distributed is transitive in Kolmogorovian probability. So if a measurement were the same random variable in every context, overlapping contexts would force a joint distribution, and Kochen–Specker and Bell contradictions would show that such variables do not exist. The assumption to drop is “Noncontextual Identification”. Contextuality becomes the impossibility of a coupling of context-indexed variables in which same-content copies satisfy a property C. For inconsistently connected binary systems, C is multimaximality (Definition II.1). | Active — read 2026-10-09 (NOTE-623); worth reading as the short foundational argument for Contextuality-by-Default. The paper argues that the traditional reading of a Kochen–Specker or Bell-type contradiction (no joint distribution exists) cannot be right within Kolmogorovian probability, because being jointly distributed is transitive, so overlapping contexts already force one. The assumption a reductio refutes is “Noncontextual Identification”, that a content is the same random variable in every context. The paper then restates contextuality as the impossibility of a coupling with a specified property C. It gives multimaximality as C for binary measurements, with the pairwise characterization (Theorem II.3) that CbD 2.0 (LIT-831) cites. It ends with Specker’s three boxes treated without assuming consistent connectedness. |
| LIT-837 v2 | Structuralism | Piaget (1970), Structuralism, trans. and ed. Chaninah Maschler, Basic Books (London: Routledge and Kegan Paul, 1971; reissued 2015). The English edition of Le structuralisme (1968), held as LIT-802. Skimmed thinly from a publisher’s preview (17 pages of chs. I–IV): a structure is a whole under laws of composition, a system of transformations and self-regulating. Logico-mathematical structures are fully reversible (groups); linguistic and social ones are regulated in time but not fully reversible; and a structure is real only if governed from within. | Active — skimmed 2026-10-09 (NOTE-618), thinly: the publisher’s Google Books preview of the 2015 reissue served only 17 pages of text, pp. 3–63 at one page in four and p. 69, all in chs. I–IV, and none of the chapters on linguistics, the social sciences or philosophy, nor the conclusion. Worth reading as Piaget’s definition of structure by wholeness, transformation and self-regulation, and for his distinction between logico-mathematical structures, whose operations all have inverses (groups), and linguistic, social and psychological structures, whose transformations unfold in time under regulations that are “not entirely reversible”. He argues that a structure must be “governed from within” to be real, and defines the subject as “the center of functional activity”. Read it with the caveat that the skim saw the argument in fragments. |
| LIT-838 | The Semantics of Definite and Indefinite Noun Phrases | Heim (1982), Ph.D. dissertation, University of Massachusetts Amherst (Garland, 1988). Indefinites and definites are variables with no quantificational force; indefinites are bound by the nearest operator, which explains donkey anaphora. Meaning is recast as file change potential on a common ground of numbered cards, and the definite/indefinite contrast becomes one felicity condition (new card versus familiar card), from which binding, existential readings, presupposition projection and narrow-scope definites follow. | Active — read 2026-10-09 (NOTE-608); worth reading as the founding statement of file change semantics and of the variable analysis of indefinites: an indefinite has no quantificational force of its own and is bound by whatever operator is nearest (an adverb of quantification, a determiner, the unpronounced necessity operator of a bare conditional), which is what makes donkey sentences come out right. Its third chapter replaces truth conditions by file change potentials, operations on a structured common ground of numbered cards, and derives the definite/indefinite contrast from one felicity condition: an indefinite opens a new card, a definite must update a familiar one. Read it as an argued theory with worked examples and stated open problems (specific indefinites, weak crossover, accommodation), not as a closed system. |
| LIT-839 | Classifier-Free Diffusion Guidance | Ho & Salimans (2022). One diffusion network learns both the conditional and the unconditional score by dropping the condition during training; sampling with (1 + w)ε(z, c) − wε(z) reproduces the FID/Inception-score trade-off of classifier guidance on ImageNet without any classifier. The combination is motivated by an implicit Bayes classifier, but the paper itself shows that learned scores need not be conservative, so the guided field is in general the score of no density. | Active — read 2026-10-09 (NOTE-603); worth reading here as the paper that makes guidance a combination of two scores from one network: train with the condition dropped at random, then sample with (1 + w)ε(z, c) − wε(z), extrapolating away from the unconditional estimate. Its own analysis is the point for this record: the combination is inspired by Bayes’ rule (an implicit classifier p(c|z) ∝ p(z|c)/p(z)) but, because learned scores need not be gradients of anything, it is in general the score of no density and the gradient of no classifier. The evidence is one proof-of-concept on class-conditional ImageNet: the guidance weight trades FID against Inception score as classifier guidance does, best FID at w = 0.1–0.3, best IS at w ≥ 4. |
| LIT-841 | Semantic Unification: A Sheaf Theoretic Approach to Natural Language | Abramsky & Sadrzadeh (2014), ARXIV-1403.3351, in the Lambek Festschrift (LNCS 8222, pp. 1–13). Models basic Discourse Representation Structures as sections of a presheaf of consistent literals over (vocabulary, variables), an anaphoric resolution as a cover by variable maps, and the meaning of a discourse as the gluing of its sentences’ sections, unique when it exists. Failure to glue is inconsistency, not contextuality in the Abramsky–Brandenburger sense; competing resolutions are competing covers, ranked in the probabilistic section by corpus counts. | Active — read in full 2026-10-09 (NOTE-644); worth reading as the first paper to model discourse meaning as sheaf-theoretic gluing, and as the record’s earliest bridge between the Abramsky–Brandenburger framework and natural-language semantics. A basic Discourse Representation Structure is a section of a presheaf of consistent literals; a choice of anaphoric resolution is a cover, a jointly surjective family of variable maps; and the meaning of the discourse is the gluing, which is unique when it exists (Proposition 1, its only result). Its “contextuality” is context dependence, not the failure of a compatible family to glue: the only obstruction it exhibits is inconsistency of literals. Its probabilistic section ranks candidate covers by summed corpus counts rather than gluing distributions. Short and preliminary by its own account. |
| LIT-842 | On the Quantum-like Contextuality of Ambiguous Phrases | Wang, Sadrzadeh, Abramsky & Cervantes (2021), ARXIV-2107.14589, SemSpace 2021 (ACL Anthology, pp. 42–52). Treats each word of a two-word ambiguous phrase as a measurement whose outcome is the selected meaning. One hand-specified support model is possibilistically contextual; its BNC/ukWaC probabilities, like all the corpus models, are signalling. Under Contextuality-by-Default two subject–verb/verb–object pairs come out contextual, but the paper’s own bootstrap leaves both plausibly noncontextual. | Active — read in full 2026-10-09 (NOTE-645); worth reading as the first paper to test natural-language data for contextuality in the formal sense rather than the loose one, and as the paper that names the obstacle the test meets: corpus estimates of meaning selection are almost always signalling. In the sheaf-theoretic framework one hand-specified support model ({tap, box} × {pitcher, cabinet}) is possibilistically contextual (a Hardy-type failure), but its corpus probabilities are signalling, so the framework cannot judge them. Under Contextuality-by-Default the Bell-type corpus systems are noncontextual, and two noun–verb pairs read as subject–verb and verb–object (adopt/boxer, throw/pitcher) are CbD-contextual, by 1/30 and 7/30. Its own parametric bootstrap then gives those two a probability above .56 and above .08 of being noncontextual, on fractions with denominators between 3 and 30, so the contextual verdicts are not statistically secured. |
| LIT-843 | Combining contextuality and causality: a game semantics approach | Abramsky, Barbosa & Searle (2024), ARXIV-2307.04786, Phil. Trans. R. Soc. A 382:20230002. Adds an enabling relation to a measurement scenario and reads contextuality as a game: the Experimenter chooses measurements, Nature chooses outcomes, and Nature’s deterministic strategies replace the event sheaf. Recovers flat contextuality and Gogioso–Pinzani causal Bell scenarios, and expresses adaptive MBQC by Experimenter strategies. The strategy presheaf is not a sheaf: compatible deterministic strategies can fail to glue or glue non-uniquely. | Active — read in full 2026-10-09 (NOTE-646); worth reading as the version of sheaf-theoretic contextuality in which measurements are performed in a causal order and the choice of the next one may depend on earlier outcomes. A causal measurement scenario adds an enabling relation (Kahn and Plotkin’s information matrices renamed); Nature’s deterministic strategies over it replace the event sheaf, and the Abramsky–Brandenburger definitions of empirical model and contextuality then go through unchanged. Flat scenarios and Gogioso and Pinzani’s Bell scenarios with a causal order come out as special cases, and Experimenter strategies express adaptive measurement, as in the Anders–Browne GHZ OR-gate. Its sharpest point is that the strategy presheaf is not a sheaf: deterministic, compatible local strategies can fail to glue (Example 7.2) or glue non-uniquely (Example 7.3). A short paper; several results are deferred to an extended version. |
| LIT-844 | Quantum-Like Contextuality in Large Language Models | Lo, Sadrzadeh & Mansfield (2024), ARXIV-2412.16806, Proc. R. Soc. A 481:20240399 (2025). Instantiates a three-sentence anaphora schema with the support of a PR prism 51,966,480 times from Simple English Wikipedia and takes referent probabilities from BERT: 0.148% of the models are sheaf-contextual by a signalling-corrected test and 71.1% are CbD-contextual. The support is fixed by the schema, so each verdict turns on how uncertain BERT is in three sentences. | Active — read in full 2026-10-09 (NOTE-648) from the arXiv preprint (the journal version could not be reached); worth reading as the large-scale test of language-model output for contextuality, and for what its numbers rest on. A PR-prism schema of three sentences (“It is X1 and the same one is X2”, ”… X2 … same … X3”, ”… X3 and the other one is X1”) is instantiated with 866,108 Simple English Wikipedia noun pairs and their adjectives; BERT gives one referent probability per sentence, and the support is fixed by the schema. Of 51,966,480 models, 77,118 (0.148%) pass the signalling-corrected sheaf test (SF < 1/6) and 36,938,948 (71.1%) the CbD test (Δ < 2). Both verdicts are fixed by three numbers per instance; the CbD one holds whenever BERT is uncertain and roughly consistent across the three sentences. The link to embedding distance is a softmax identity plus weak correlations (R² ≤ 0.08). |
| LIT-845 | Closing Bell: Boxing black box simulations in the resource theory of contextuality | Barbosa, Karvonen & Mansfield (2021), ARXIV-2104.11241, in Samson Abramsky on Logic and Structure in Computer Science and Beyond (Springer, 2023). Characterises which convex maps between the empirical models of two scenarios are induced by classical (non-adaptive) procedures: exactly those given by a non-contextual model of a “hom” scenario [S, T] whose outcomes are procedures. Non-local games are procedures into a one-bit scenario, and the hom construction makes scenarios with predicates a closed category. | Active — read in full 2026-10-09 (NOTE-650); worth reading as the result that says which transformations between the empirical models of two different scenarios are classical. A probabilistic procedure S → T (a mixture of deterministic procedures, each answering every measurement of T by a context of S and a post-processing of outcomes) induces a convex map EMP(S) → EMP(T). A convex map is so induced exactly when it comes from a non-contextual model, satisfying a simpliciality predicate, on a new “hom” scenario [S, T] whose outcomes are procedures. Compatible local procedures that do not glue into one global procedure are contextual models of [S, T]: “contextual simulations”. The construction makes scenarios with predicates a closed category. Non-adaptive only; the arXiv v2 corrects Theorem 44 of the published chapter. |
| LIT-846 | Categories of Empirical Models | Karvonen (2018), ARXIV-1804.01514, QPL 2018, EPTCS 287:239–252 (2019). Defines simulations between empirical models on different scenarios: a simplicial relation from target measurements to sets of source measurements, and a stochastic outcome map natural in the context. Non-contextual models are those simulable from the terminal model, the non-contextual fraction is monotone along simulations, strong contextuality is reflected, and contextual models cannot be cloned. | Active — read in full 2026-10-09 (NOTE-651); worth reading as the paper that first gives empirical models on different measurement scenarios a notion of morphism: a simulation d → e answers each measurement of e by a set of jointly measurable measurements of d (a simplicial relation, so the cover may change) and a stochastic map of outcomes natural in the context. With it, non-contextual models are exactly those simulable from the terminal (empty) model, the non-contextual fraction can only grow along a simulation, strong contextuality is reflected backwards, Graham reductions are simulations (Vorob’ev’s theorem), and no contextual model can be cloned. It is restricted to no-signalling models and has no preprocessing. |
| LIT-847 | A comonadic view of simulation and quantum resources | Abramsky, Barbosa, Karvonen & Mansfield (2019), ARXIV-1904.10035, LICS 2019. Measurement protocols form a comonad on empirical models; a simulation of e by d is a co-Kleisli map from d ⊗ c (c non-contextual) to e. Simulability coincides with convertibility by a term in the free operations of the resource theory of contextuality, including a new conditional measurement; the non-contextual fraction is monotone, and contextual models cannot be cloned. | Active — read in full 2026-10-09 (NOTE-647); worth reading as the paper that makes simulation between empirical models adaptive and shows it is the same thing as convertibility by free operations. Measurement protocols (decision trees of compatible measurements) form a comonad MP on scenarios and on empirical models; a simulation of e by d is a deterministic map MP(d ⊗ c) → e with c non-contextual. Such a simulation exists exactly when e is obtained from d by a term in the free operations (relabelling and translation of measurements, coarse-graining, mixing, choice, tensor, and the new conditional measurement), with an equational theory and normal forms. Along any simulation the non-contextual fraction cannot fall, and no contextual model can be cloned. |
| LIT-848 | Large AI models are cultural and social technologies | Farrell, Gopnik, Shalizi & Evans (2025), Science 387(6739):1153–1156, Policy Forum. Large models are best understood not as intelligent agents but as a new cultural and social technology: like writing, print and search they give access to what other people have produced, and like markets, bureaucracies and elections they make lossy, uninvertible summaries of it that can be operated on at scale. The questions that follow are the old ones about such technologies: homogenization or diversity, who gains and who loses, and which countervailing institutions emerge. Argued by historical analogy, without data. | Active — read in full 2026-10-09 (NOTE-649) from the authors’ accepted version (Science galley of 25 February 2025, posted on Farrell’s site); worth reading as the compact statement of the view that large models are not agents but a new cultural and social technology, of a kind with writing, print, markets, bureaucracies and elections: lossy summaries of what other humans have produced that let people reorganize it at scale. It is a four-page Policy Forum argued by analogy, with no data. Its one mechanism with consequences is that models fit their training distribution on average, so are least accurate where the data are rare, which may homogenize culture; it sets this against the possibility of “society-like” ecologies of models that keep diversity. |
| LIT-849 | Relative representations enable zero-shot latent space communication | Moschella, Maiorca, Fumero, Norelli, Locatello & Rodolà (2022; ICLR 2023), arXiv:2209.15430. Re-encodes each sample as its cosine similarities to a fixed set of anchor samples, which is invariant by construction to every cosine-preserving map of the latent space (rotations, reflections, rescaling), not to translations or general linear maps. With anchors matched across two encoders (parallel anchors), a decoder trained on one encoder’s relative vectors runs on another’s with no training: across seeds, architectures, latent sizes and languages. Stitching works far better than with raw latents but is lossy and uneven, and the assumption that independently trained spaces differ by an angle-preserving map is supported only approximately. | Active — read in full 2026-10-09 (NOTE-652); worth reading as the source of “relative representations”: a sample is re-encoded as its vector of cosine similarities to a fixed set of anchor samples, and a decoder trained on that vector runs, without any training, on a different encoder that sees corresponding anchors. Read it knowing what is guaranteed and what is observed. The invariance is by construction and one line long: the vector is unchanged by any map that preserves cosines, that is rotations, reflections and rescaling (and, though the paper does not say so, any per-sample positive rescaling), but not by translations, which it assumes normalisation removes, nor by general linear maps. That training noise, a change of architecture or a change of language moves a latent space only by such a map is an assumption, supported indirectly and only approximately: across FastText and Word2Vec the relative vectors agree at cosine 0.86 but share only 34–39% of their ten nearest neighbours, and between two ViTs on CIFAR-10 11–12%. Zero-shot stitching is not correspondence-free: it needs the anchors matched across the two sides (parallel anchors), which here means 300–768 translated or aligned sentence pairs or the same images. It beats absolute stitching everywhere absolute stitching can be run, but loses a great deal against the unstitched model in places: 98.6 to 80.5 ± 21.1 F1 on DBpedia across architectures, 90.1 to 65.7 for a Japanese encoder under an English decoder, 72.6 to 37.4 on ImageNet when ViT features feed a RexNet decoder. On a model that is already multilingual (XLM-R) it is worse than doing nothing. |
| LIT-850 | Revisiting Model Stitching to Compare Neural Representations | Bansal, Nakkiran & Barak (2021), NeurIPS 34. Revives Lenc and Vedaldi’s model stitching (LIT-363) as a measure of representations: the bottom of one frozen network feeds the top of another through a trained 1×1 convolution, and the change in test error is the “stitching penalty”. Independently seeded networks, and supervised and self-supervised ResNet-50s, stitch at all layers within a few points, where CKA says they differ. Representations trained on more data plug into a weaker network and lower its error; for width and training time this happens only near the top. All empirical, single runs, mostly CIFAR-10. | Active — read in full 2026-10-09 (NOTE-653); worth reading as the paper that made model stitching a standard way of comparing trained networks, and as the source of “stitching connectivity”: two networks of one architecture, trained from different seeds, can be joined at any layer by a learned 1×1 convolution with little loss of test accuracy. Read it knowing that it proves nothing. Its definitions are informal (“low penalty”, “comparable”), stitching connectivity is an informal conjecture, and every result is a single run, mostly ResNet-18 on CIFAR-10, read off plots with no error bars. Its “more is better” ordering is an ordering by one task’s loss through a fixed top network and a restricted map class, not an ordering by information: the paper itself says a pixel shuffle, which loses nothing, can stitch worse, and a negative penalty means the fitted map did not reproduce the layers it replaced. The width and training-time improvements appear only near the top of the network; at mid layers the wider and longer-trained representations stitch slightly worse. |
| LIT-851 | Analysing Ambiguous Nouns and Verbs with Quantum Contextuality Tools | Wang, Sadrzadeh, Abramsky & Cervantes (2021), Journal of Cognitive Science 22(3):391–420. Proves that in a binary cyclic system CbD’s signalling quantity Δ is twice the summed minimal direct influences of context in Jones’s causal canonical models, and measures it in 90 rank-2 noun–verb systems from British corpora: Δ is about 1.35 whatever the words’ ambiguity, and homonymous verbs carry about 70% of it against about 50% for polysemous ones, on small counts and a marginal test. | Active — read in full 2026-10-09 (NOTE-654); worth reading as the paper that measures how much signalling there is in natural-language meaning selection, and that gives signalling a causal reading. Its Proposition 1 shows that in a binary cyclic system the CbD quantity Δ is twice the sum, over contents, of the least direct influence of context that any of Jones’s canonical (causal) models of the data must posit, each the total-variation distance between a content’s two marginals. Applied to 90 rank-2 noun–verb systems from the BNC and ukWaC, Δ averages about 1.35 in every class of ambiguity, and homonymous verbs carry about 70% of it against about 50% for polysemous verbs (14 against 55 systems; my recomputation from its appendix gives a Welch t of 2.0, two-sided p ≈ 0.06). It tests no system for contextuality. Read with the caveat that most systems rest on very few corpus occurrences: 51 of the 90 have Δ exactly 0, 2 or 4. |
| 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-855 | Closed-Form Training Dynamics Reveal Learned Features and Linear Structure in Word2Vec-like Models | Karkada, Simon, Bahri and DeWeese (2025), ARXIV-2502.09863, NeurIPS 2025. The quartic approximation of word2vec’s loss, under symmetric reweighting with constant aggregate weight, is exactly unweighted factorisation of M*, the co-occurrence matrix’s relative deviation from independence, and from small initialisation gradient flow learns M*‘s eigenvectors one at a time in sigmoidal steps. The embeddings this predicts match word2vec’s features and benchmark scores far better than truncated PMI or PPMI factorisations do. | Active — read 2026-10-09 (NOTE-660); worth reading as the first closed-form account of what a contrastive word-embedding algorithm learns under a rank constraint, and in what order. Replacing word2vec’s logistic loss by its quartic Taylor approximation, and choosing symmetric reweightings whose aggregate weight is constant, turns the objective into unweighted symmetric matrix factorisation of M*, the matrix of relative deviations of word co-occurrence from independence (Theorem 1, proved). From vanishing random initialisation, gradient flow then learns the eigenvectors of M* one at a time, each by a sigmoidal step in time (ln(λ_k/σ²))/λ_k (Result 3, a derivation that drops terms, not a proof). The resulting embeddings track word2vec’s features and benchmark scores closely, and much more closely than truncated factorisations of PMI or positive PMI. The analogy part is empirical: difference vectors of semantic pairs look like a spiked random matrix, and the spike’s strength tracks analogy accuracy. |
| LIT-856 | Small Singular Values Matter: A Random Matrix Analysis of Transformer Models | Staats, Thamm & Rosenow (2024; NeurIPS 2025). Taking the Marchenko–Pastur law as the zero-information null for a weight matrix, trained transformer matrices (BERT, Pythia-410M, Llama-3.1-8B) show outliers above the bulk and, in rectangular matrices only, below it, since only there does the null spectrum have a positive lower edge. In the MLP projections the singular vectors of both kinds of outlier align with activation-covariance eigenvectors, and zeroing the smallest decile of a rectangular matrix can hurt more than zeroing most larger ones. A linear teacher–student ensemble yields a below-bulk outlier when the noise is suppressed along a learned direction. | Active — read 2026-10-09 (NOTE-659); worth reading here as the paper that uses the Marchenko–Pastur law as a null model for where a trained weight matrix holds information, and so notices what a magnitude-ordered reading misses: a rectangular matrix’s null spectrum has a lower edge above zero, so learning can push singular values below the bulk as well as above it. In three transformers the departures line up with activation-covariance directions, at the lower end in the MLP up and gate projections, and zeroing the smallest decile of a rectangular matrix can cost more than zeroing most larger deciles; in square matrices it never does. A two-layer linear teacher–student ensemble produces such a lower outlier when the loss suppresses the noise along a learned direction. The evidence is measured, not proved, and it is uneven: overlap and ablation importance disagree for several matrix types, and the decile ablation does not isolate the outliers it is meant to test. |
| LIT-857 | Single-Head Attention in High Dimensions: A Theory of Generalization, Weights Spectra, and Scaling Laws | Boncoraglio, Erba, Troiani, Xu, Krzakala and Zdeborová (2025), arXiv. For a tied single-head softmax attention layer trained by ridge-penalized ERM on Gaussian token sequences labelled by an attention-indexed target, in the limit n/d², p/d fixed, a six-parameter variational problem gives the exact train and test error, interpolation and perfect-recovery thresholds, and the singular-value law of the learned query–key map: η·ReLU(S0 + δZ − ε), Z a GOE matrix. Weight decay is a nuclear-norm penalty on that map, so the factorized model beats direct training of the product. Power-law targets give sequential mode recovery and LASSO- rate scaling laws. Non-rigorous (replica/AMP), checked against Adam. | Active — read 2026-10-09 (NOTE-661); worth reading as a solvable model in which the spectrum of trained attention weights is derived, not just measured: for empirical risk minimization of one tied softmax attention layer on Gaussian sequences, with n of order d², the learned query–key map is, in law, a rescaled ReLU of the target plus a semicircle noise bulk shifted by a threshold, so its outliers are recovered target directions and its bulk is finite-sample noise. Weight decay on the factor is exactly a nuclear-norm penalty on the product. With a power-law target, modes are recovered one by one as the threshold moves, which gives heavy-tailed learned spectra and power-law learning curves whose exponents match the LASSO rates. The main results are replica/AMP “Claims”, not theorems, checked against Adam runs at d = 100–400. |
| LIT-858 | Towards Understanding Grokking: An Effective Theory of Representation Learning | Liu, Kitouni, Nolte, Michaud, Tegmark and Williams (2022), NeurIPS 2022. In a toy model that decodes the sum of two learned embeddings, grokking is representation learning: an unseen pair is answered correctly when its embedding sum equals a trained pair’s, and the critical training fraction (about 0.4 for addition with p = 10) is where the training set’s “parallelogram” equations first fix the embedding up to translation and scale. A posited effective loss on the normalised embeddings predicts that threshold and, through its third Hessian eigenvalue, the time to structure. Phase diagrams over decoder learning rate and weight decay place grokking between comprehension and memorization in the toy, a transformer and MNIST. | Active — read 2026-10-09 (NOTE-662); worth reading as an early mechanistic account of when grokking networks generalise, in a toy model that sums two learned embeddings and decodes the sum. An unseen pair is predicted correctly when its embedding sum coincides with a trained pair’s (a “parallelogram”), and the critical training fraction is where the training set’s parallelogram equations first fix the embedding up to translation and scale. The account is exact for the toy (1D embeddings, addition hard-coded in the architecture, an effective loss posited and derived only for a linear decoder); the transformer and MNIST evidence is qualitative (PCA pictures and phase diagrams), and the four “phases” are defined by accuracy thresholds, not by any order parameter. |
| LIT-859 | Exact Learning Dynamics of In-Context Learning in Linear Transformers and Its Application to Non-Linear Transformers | Mainali and Teixeira (2025), ARXIV-2504.12916. For a single linear attention layer trained by small-step SGD on in-context regression ℝᵈ → ℝᵈ, with the input covariance and every task matrix sharing one eigenbasis and the weights assumed to stay in it, the averaged dynamics decouple into one logistic equation per eigenmode: mode α is learned on a timescale τ_α = (ηP s_α²)⁻¹, giving plateaus and cliffs in the loss, and settles where p_α q_α = N / ((N+1)s_α + Tr S), so the trained predictor applies an inverse, finite-N-corrected training covariance to the context’s empirical covariance. A scaling symmetry conserves ‖p₂‖² − ‖q₁‖². Effective-rank and subspace measures applied to attention-only transformers and a grokking model are offered as qualitative parallels. | Active — read 2026-10-09 (NOTE-658); worth reading as an exactly solved case of the slow learning that produces a fast in-context learner: for one linear-attention layer trained by gradient flow on in-context vector regression, with tasks and inputs sharing one eigenbasis, each eigenmode of the input covariance learns by its own logistic curve on a timescale ∝ 1/s_α², the trained product of the two weight blocks settles at the inverse of a finite-context-corrected training covariance, so the learned in-context predictor is a preconditioned estimator (the fixed point Ahn et al. and Zhang et al. had found), and ‖p₂‖² − ‖q₁‖² is conserved. The decoupling rests on an assumed spectral alignment and on large N and many tasks. The second half, measures applied to attention-only transformers and a grokking model, is qualitative and correlational: no seeds, error bars or controls are reported, and “mechanistic explanation” overstates it. |
| LIT-860 | Symmetry in language statistics shapes the geometry of model representations | Karkada, Korchinski, Nava, Wyart and Bahri (2026), ICML 2026 (PMLR 306:56137–56172). If co-occurrence among words on a latent continuum depends only on their separation, a full-rank spectral word embedding places them on Fourier modes of the latent coordinate: circles for cyclic concepts, open curves with harmonic ripples for intervals, curved sheets for maps, all proved for that model with the exponential kernel solved exactly. Wikipedia’s month and year statistics fit the symmetry; Gemma 2 and EmbeddingGemma show matching PCA pictures; the geometry survives removing the words’ mutual co-occurrences, which a seasonal latent variable shared by many words explains. | Active — read 2026-10-09 (NOTE-664); worth reading as a derivation of the circles, rippled curves and curved sheets found in language-model representations of months, years and places from one property of the data: when the co-occurrence of two words on a latent continuum depends only on their separation, the matrix the embedding factorises is circulant or Toeplitz, so its eigenvectors are sinusoids of the latent coordinate. For a full-rank spectral word embedding the paper proves the principal components are Fourier modes with amplitudes set by the kernel’s Fourier transform, solves the open-boundary exponential kernel exactly (a Sturm–Liouville problem), and bounds linear decoding of the coordinate by the missing Fourier tail (ε² ≲ r^(−1/D)). It measures the symmetry in Wikipedia statistics, shows the month circle survives zeroing every month–month co-occurrence, and explains that by a seasonal latent variable that couples many words. The “word embeddings” are explicit factorisations of the co-occurrence matrix, not trained networks; the language-model evidence is PCA pictures of Gemma 2 2B and EmbeddingGemma; the robustness argument is a perturbation sketch. |
| LIT-861 | Topological Invariance and Breakdown in Learning | Yang, Poggio, Chuang and Ziyin (2025), ARXIV-2510.02670. For any permutation-equivariant update rule whose map is K-Lipschitz, one step of size η changes the distance between any two neurons by a factor in [1 − ηK, 1 + ηK], and coincident neurons stay coincident. Below η* = 1/K the induced map on the set of neuron vectors is therefore a homeomorphism, measure-preserving for the pushed-forward neuron distribution and a C¹ diffeomorphism under a smoothness condition; above it only a continuous surjection is guaranteed. The paper reads this, with the edge of stability, as two phases of training, the second a topological simplification; the proofs hold, but that reading and the Betti-number experiments go beyond them. | Active — read 2026-10-09 (NOTE-663); worth reading as a short, correct proof that permutation symmetry constrains how neurons can move under training: if the update rule is permutation-equivariant (gradient descent, SGD or Adam on a permutation-symmetric loss), neurons that coincide stay coincident at every step size, and if the update map is K-Lipschitz each step moves every pair of neurons apart or together by at most a factor 1 ± ηK. So below η = 1/K the induced map on the set of neuron vectors is a bi-Lipschitz homeomorphism (a C¹ diffeomorphism under a smoothness condition) and distinct neurons cannot merge in finitely many steps; above it only a continuous surjection is guaranteed. The proofs are a few lines and hold. What they do not carry is the paper’s larger picture: for finitely many neurons a homeomorphism of the neuron set is only a bijection, “topological simplification” above 1/K is permitted, not shown, and the experiments measure Betti numbers of point clouds at a fixed scale, which the theorem does not protect. The large-step runs show the clouds fragmenting (more components), not merging, and in the Adam runs the step size times the measured top Hessian eigenvalue stays below 0.05 where the topology changes. |
| LIT-862 | A mathematical theory of semantic development in deep neural networks | Saxe, McClelland and Ganguli (2019), PNAS 116(23):11537–11546, ARXIV-1810.10531. A two-layer linear network trained from small weights learns the singular modes of its input–output correlations one at a time, each in a sigmoidal step at a time of order (τ/s)ln(s/ε), where a shallow network learns them all at once. With data generated on a tree this gives coarse-to-fine differentiation in stages, transient illusory correlations and narrowing generalisation; the SVD also defines typicality, prototypes and category coherence, and minimum-norm weights fix the hidden similarity matrix across networks. | Active — read 2026-10-09 (NOTE-666); worth reading as the paper that turns the exactly solved learning dynamics of a two-layer linear network into a theory of semantic development. Trained by gradient descent from small weights on whitened inputs, the network learns the singular modes of the item–feature correlation matrix one at a time, each by a sigmoid at a time of order (τ/s)ln(s/ε), while a shallow network learns every mode on one exponential timescale. Hierarchically generated data have singular values that fall with depth in the tree, so broad distinctions are learned first in stage-like transitions, individual predictions can rise and fall between stages, and inductive generalisation narrows with development. The same SVD gives typicality, prototypes and a coherence threshold (a BBP transition), rings give Fourier modes, and minimum-norm weights, which small initialisation approximates, give identical hidden similarity matrices across networks. The trajectory is exact only from decoupled, balanced initial weights with white inputs; from random small weights it is checked by simulation, and the match to children and cortex is qualitative. |
| LIT-863 | On the Emergence of Linear Analogies in Word Embeddings | Korchinski, Karkada, Bahri and Wyart (2025), NeurIPS 2025. If each word is a vector of d binary attributes whose effects on co-occurrence are independent and multiplicative, the co-occurrence ratio is a Kronecker product and its logarithm, the PMI, has rank at most d + 1 with eigenvectors affine in the attributes, so a spectral PMI embedding realises parallelogram analogies exactly; the ratio itself does so only for weak, narrowly spread attribute signals. The structure survives noise, vocabulary pruning and deletion of all pairs of a relation, by perturbation arguments checked in simulation and on Wikipedia. | Active — read 2026-10-09 (NOTE-665); worth reading as a generative model of word co-occurrence in which the parallelogram analogies of word embeddings are derived rather than postulated. Each word is a point of the hypercube {−1, +1}^d of binary attributes, and each attribute multiplies its co-occurrence by an independent 2 × 2 factor, so the ratio M = P(i,j)/P(i)P(j) is a Kronecker product (proved) and the PMI log M is a bilinear form in the attributes, of rank at most d + 1 with eigenvectors affine in them. A spectral embedding of the PMI is then a linear image of the attribute hypercube and its analogies hold exactly at any signal strength; one of M holds them only when the signals are weak, narrowly spread and K ≤ d + 1, because M’s spectrum mixes in products of attributes. Robustness to noise, to pruning the vocabulary and to deleting every pair of an analogy relation is argued from eigenvalue perturbation bounds and checked numerically. The embeddings are eigendecompositions of a co-occurrence matrix, not trained word2vec or GloVe, and the agreement with Wikipedia is in the shapes of spectra and accuracy curves; no attribute is recovered from data. |
| LIT-864 | Exact solutions to the nonlinear dynamics of learning in deep linear neural networks | Saxe, McClelland and Ganguli (2014), ARXIV-1312.6120, ICLR 2014. Solves gradient-descent learning in deep linear networks with whitened inputs from decoupled initial weights: each singular mode of the input–output correlation is learned by a sigmoid at a time of order (τ/s)ln(s/ε), with conserved differences of squared layer strengths. For any depth, the delay depth adds is set by the initial end-to-end mode strength, finite as depth grows when that strength is of order one and the step size is scaled with depth. Argues, with simulations, that scaled Gaussian layers are not isometric in product while orthogonal ones are, and that tanh networks with orthogonal weights near gain 1 stay close to isometric. | Active — read 2026-10-09 (NOTE-667); worth reading as the paper in which the learning dynamics of deep linear networks were solved exactly from decoupled starts at any depth (Fukumizu had solved one hidden layer for another class of starts) and the stepwise, mode-by-mode picture was set out that later work calls Saxe-style. Gradient descent on a linear network with one hidden layer and whitened inputs is a cubic system whose modes cooperate within a singular mode of the input–output correlations and repel across modes; from decoupled initial weights each mode’s strength follows a sigmoid reaching s at a time of about (τ/s)ln(s/ε), with a conserved difference of squared layer strengths and, in the appendix, the unbalanced case. Beyond what the 2019 restatement keeps, it solves arbitrary depth from decoupled starts: depth slows learning through the initial end-to-end mode strength, so from strength of order one the number of iterations stays finite as depth grows once the step size is scaled down with depth, while from strength ε the delay grows like s/ε. It argues that scaled Gaussian layers preserve norms but not isometry, that random orthogonal layers give depth-independent learning times on MNIST, and that tanh networks with orthogonal weights near gain 1 keep the end-to-end Jacobian’s singular values of order one. Random initial weights, the role of isometry in learning time and everything nonlinear rest on simulation, not proof. |
| 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-866 | Hyperbolic Entailment Cones for Learning Hierarchical Embeddings | Ganea, Bécigneul and Hofmann (ICML 2018), PMLR 80:1646–1655. Represents a partial order in the Poincaré ball by nested cones: v is below u when v lies in u’s cone. Nesting forces apertures of at most π/2 that narrow toward the boundary (r sin ψ/(1 − r²) non-increasing), so cones are undefined near the origin; the widest family is sin ψ = K(1 − r²)/r, with a closed-form membership test. Overlapping cones admit several parents. On WordNet noun closure link prediction in 5–10 dimensions it beats Poincaré and order embeddings once some closure edges are in training; with none, all methods fail. | Active — read 2026-10-09 (NOTE-671); worth reading as the paper that represents a partial order, not only a tree, by containment of regions in hyperbolic space. Each concept is a point x of the Poincaré ball and owns a cone S_x, the image under the exponential map of the tangent vectors within an angle ψ(x) of the outward ray through x; v counts as entailed by u when v lies in S_u. Requiring the cones to be axially symmetric, rotation invariant, continuous in aperture and nested (v in S_u implies S_v inside S_u) forces ψ ≤ π/2 (Lemma 2) and makes r sin ψ(r)/(1 − r²) non-increasing (Theorem 3), so no cone can be defined near the origin; the widest family is sin ψ(x) = K(1 − ‖x‖²)/‖x‖ outside a ball of radius ε, and membership is a closed-form angle test (Theorem 5). That family is transitive (Theorem 4), but the proof is only said to be “similar” and is not given. Cones of incomparable points can overlap, so a node may sit below several parents. The evidence that learned cones fit a DAG is one WordNet-noun experiment: held-out edges of the transitive closure, test F1 at 5 and 10 dimensions, single runs, where hyperbolic cones lead once 10% or more of the closure is in training but every method fails (F1 27–43%) when only the transitive reduction is, and Euclidean cones initialised from Poincaré embeddings match the hyperbolic ones. |
| 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-868 | A Generalized Information-Theoretic Framework for the Emergence of Hierarchical Abstractions in Resource-Limited Systems | Larsson, Maity and Tsiotras (2022), Entropy 24(6):809. Treats a pruning of a fixed quadtree as a deterministic encoder of the grid and maximises Σβ_i I(T;Y_i) − Σγ_j I(T;Z_j) − αI(T;X) over such prunings. Every term splits over interior nodes (p(t)·JS of the children’s conditionals; p(t)H of the split), so a bottom-up recursion (G-tree search) returns the optimal tree with fewest leaves in linear time. Recovers the IB and IB-with-side-information trees as special cases and proves the latter is always a pruning of the former. | Active — read 2026-10-09 (NOTE-676); worth reading as an exact solution of a structured information-bottleneck problem: when the encoder must be a pruning of a fixed tree (here the dyadic quadtree of a grid), every information term splits over the interior nodes, a node’s share of I(T;Y) being p(t) times the Jensen–Shannon divergence of its children’s p(y|·) and its share of I(T;X) being p(t)H(Π). A bottom-up recursion, G(t) = max{ΔJ(t) + Σ G(children), 0}, then returns the optimal tree with the fewest leaves for any weighted sum of relevance, irrelevance and compression terms, in time linear in the grid. A greedy top-down search can miss all the relevant information, because a node whose children predict Y alike gains nothing however much its grandchildren differ. Adding an irrelevance penalty can only prune the plain IB tree. The hierarchy is given, not found: what “emerges” is which coarse-graining of a fixed quadtree to keep. |
| 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-870 | Hyperbolic Diffusion Embedding and Distance for Hierarchical Representation Learning | Lin, Coifman, Mishne and Talmon (2023), ICML 2023 (PMLR 202), ARXIV-2305.18962. Recovers a latent tree from point-cloud or graph data without learning: diffusion densities at dyadic time scales are embedded in a product of Poincaré half-spaces, and the ℓ1 product distance, a scale-weighted Hellinger sum, is proved equivalent up to constants to a thresholded snowflake min{1, d_T^(2α)} of the tree metric when the operator behaves like the heat kernel on a tree. It keeps local tree neighbourhoods (best MAP on the benchmarks) but not global distances (higher distortion than hyperbolic MDS). | Active — read 2026-10-09 (NOTE-675); worth reading as a construction that recovers a latent tree from unlabelled data by distances alone, with a proof of what is recovered. Each point is represented by its diffusion densities P^(2^−k) e_i at dyadic times, each density is placed in a Poincaré half-space at a height set by its scale, and the hyperbolic diffusion distance is the ℓ1 sum over scales of the hyperbolic distances, 2 sinh⁻¹(2^(1−kα)‖φ_i^k − φ_j^k‖) with φ the square roots of the densities, a scale-weighted Hellinger distance. Theorem 1 (Appendix C, after Leeb and Coifman) says that for the heat kernel on a tree this is equivalent up to constants to min{1, d_T^(2α)}, 0 < α < 1/2: a thresholded snowflake of the tree metric, not the tree metric, and saturated beyond a fixed radius; the main text states it without the threshold. The tree heat-kernel bounds are stated, not proved, and one step of the Hölder bound (Proposition C.5) holds only for tree distances of at least 1, so the admissible range of α is not secured. Empirically it gives the best mean average precision on five graph benchmarks and two single-cell datasets and worse average distortion than hyperbolic MDS or Sarkar’s construction: local neighbourhoods are kept, global distances are not. Nothing in it concerns attributes or linear directions. |
| LIT-871 | Hyperbolic Representation Learning: Revisiting and Advancing | Yang, Zhou, Ying, Chen and King (2023), ICML 2023, PMLR 202. Tracks the hyperbolic distance from each node to the origin and finds that hyperbolic models trained on ordinary task losses do not by themselves place a tree’s root nearest the origin or spread its levels outward: on synthetic 3-ary trees the root sits well off the minimum and the distances are roughly bell-shaped, ordering node pairs by level only 69–75% of the time. Proposes HIE, which recentres the embedding on its hyperbolic centroid and pushes nodes outward; it improves that ordering and benchmark scores, most on the least tree-like graphs. | Active — read 2026-10-09 (NOTE-669); worth reading as an empirical check, on synthetic trees and four benchmark graphs, of the assumption that a hyperbolic model trained on an ordinary task loss lays out the data’s hierarchy by itself, root near the origin and leaves near the boundary. It does so only partly. On two 3-ary trees of 1,093 nodes, a hyperbolic graph convolutional network (HGCN) trained for link prediction or node classification puts the root nowhere near the smallest distance to the origin, and the nodes’ distances to the origin come out roughly bell-shaped rather than piling up at the leaves; read off as levels, those distances order random node pairs correctly 69–75% of the time. The proposed fix, HIE, recentres the embedding on its hyperbolic centroid and adds a loss that pushes every node outward in proportion to its current distance. It raises that ordering to 75–84% and lifts benchmark scores, most on the least tree-like graphs (Citeseer, Cora). There is no theory of why task losses fail to produce the hierarchy, and the fix itself uses no level information. |
| LIT-872 | Hyperbolic geometry of the olfactory space | Zhou, Smith & Sharpee (2018), Science Advances 4(8):eaaq1458. In four natural odour sources the rank order of correlations between compound concentrations has the clique-topology signature of points near the surface of a 3D hyperbolic ball and not of a uniform Euclidean cube, and human perceptual descriptions of 127 odorants have that of a full 3D hyperbolic ball. Pleasantness, boiling point and acidity read out as linear axes of the fitted fruit-odour space. The hierarchy that motivates the hyperbolic model is argued from biochemistry, not recovered from the data. | Active — read 2026-10-09 (NOTE-672); worth reading as the first application of clique topology to stimulus statistics rather than neural data, and as the Sharpee lab’s first claim of a hyperbolic geometry in biology. For four natural odour sources (strawberry, tomato, blueberry, mouse urine; 45–78 compounds over 50–101 samples), the rank order of absolute concentration correlations gives Betti curves that match points sampled near the surface of a 3D hyperbolic ball (R_max = 7, R_min = 0.9 R_max, the same for all four) and reject uniform Euclidean cubes of any dimension tried. Human descriptor profiles for 127 odorants (Dravnieks) match a full 3D hyperbolic ball and no Euclidean cube. Linear axes for pleasantness, boiling point and acidity are found in the fitted fruit-odour space. The tree that motivates the hyperbolic model is argued, not recovered: compounds do not cluster by chemical class, and the only null geometry is a uniform Euclidean cube. |
| LIT-873 v2 | Mutual information, neural networks and the renormalization group | Koch-Janusz and Ringel (2017; Nature Physics 14, 578–582, 2018). Defines the relevant degrees of freedom of a spatial block as the coarse variable that maximizes mutual information with the environment beyond a buffer, and learns it with restricted Boltzmann machines from Monte Carlo samples (the RSMI algorithm). It recovers Kadanoff block spins in the 2D Ising model and the electric-field variables of the dimer model, ignores decoupled noise, and, iterated, gives the Ising flow and ν ≈ 1.0 ± 0.15; a distribution-fitting RBM does none of this. The link to a short-ranged effective Hamiltonian is proved only in 1D. | Active — read 2026-10-09 (NOTE-674); worth reading as the paper that turns “the relevant degrees of freedom” of real-space renormalization into an objective that can be optimized: a block’s coarse variable is chosen to maximize its mutual information with the system beyond a buffer around the block. Trained on Monte Carlo samples alone, the network rediscovers Kadanoff’s block spin for the 2D Ising model, finds the low-momentum electric fields of the 2D dimer model while ignoring a strongly patterned but decoupled noise, and, iterated, reproduces the Ising flow away from T_c (located to about 1%) with ν ≈ 1.0 ± 0.15. An RBM trained instead to fit the data distribution latches on to the noise. The equivalence of the objective with a short-ranged effective Hamiltonian is argued, and shown only for 1D and quasi-1D chains; in 2D the evidence is the two models, whose answers were known beforehand. |
| LIT-874 | Representation Tradeoffs for Hyperbolic Embeddings | Sala, De Sa, Gu and Ré (ICML 2018), PMLR 80:4460–4469. Trees embed in the hyperbolic plane with distortion 1 + ε (Sarkar’s construction), but a hyperbolic distance d costs about d bits, so the embedding needs Θ((ℓ/ε) log deg_max) bits per coordinate in the plane: logarithmic in branching, linear in depth (lower bound proved for H², with an approximation). Higher dimension, via coding-theoretic child placement, divides the upper bound by r. Also an exact hyperbolic MDS by PCA after centring at a new mean, with a perturbation bound growing as sinh²(diameter), and a local-convexity condition for hyperbolic PGA. | Active — read 2026-10-09 (NOTE-679); worth reading as a quantitative account of why trees fit hyperbolic space and what the fit costs. Following Sarkar, any finite tree embeds in the hyperbolic plane with worst-case distortion at most 1 + ε by placing each node’s children evenly on a hyperbolic circle of radius τ around it; but a hyperbolic distance d needs about d bits to write down, so the coordinates need O((ℓ/ε) log deg_max) bits, ℓ the longest path, and an explicit tree of deg_max chains shows Ω((ℓ/ε) log deg_max) is needed in the plane. Precision grows with the logarithm of the branching and linearly with depth: hyperbolic space is cheap for short bushy hierarchies and dear for long chains. In r dimensions, children placed on hypercube vertices chosen by a Hadamard code divide the cost by r up to r ≈ log deg_max (upper bound only). For general metrics it gives an exact hyperbolic MDS: cosh of the distances is uuᵀ − XXᵀ once the points are centred at a new pseudo-Euclidean mean, so PCA recovers them. The lower bound’s proof uses a small-angle approximation and covers only the plane; the PGA guarantee is local convexity, not global recovery; the experiments, including the WordNet MAP of 0.989 in two dimensions, are reported at ε = 0.1, where WordNet takes 2,877 bits per coordinate, while the introduction quotes the ε = 1 figure of about 500. |
| 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-876 | Hippocampal spatial representations exhibit a hyperbolic geometry that expands with experience | Zhang, Rich, Lee & Sharpee (2022 online, Nat. Neurosci. 26, 2023). The pairwise correlations of rat dorsal CA1 place cells have the topological signature of points sampled uniformly from a three-dimensional hyperbolic ball, not of a low-dimensional Euclidean cube, and the ball’s radius grows with the logarithm of exploration time. Place-field sizes are near exponential, and in a Poisson model exponential sizes carry more positional Fisher information than uniform or log-normal ones, with an optimal radius that matches the measured one for the number of CA1 neurons. | Active — read 2026-10-09 (NOTE-668); worth reading as, on its own account, the first evidence that neural responses, not stimuli, carry a hyperbolic geometry. Pairwise spike-train correlations of a few dozen active dorsal CA1 cells per session (34 to 56 in the sessions shown), in rats on a novel 48-m track, a 2.5-m track and a 1.8-m box, give Betti curves (clique topology, invariant to any monotone transform of the correlations) that match points sampled uniformly from a 3D hyperbolic ball and fail to match uniform samples from Euclidean cubes of low dimension or shuffled spikes. The fitted radius (10.5–15.5 in units of inverse curvature) grows with the logarithm of exploration time, on scales from seconds to days, as the maximal information acquirable does. Place-field sizes are close to exponential, as the model requires, and in simulation exponentially distributed field sizes give more Fisher information than uniform or log-normal ones, with an optimal radius growing as log N that extrapolates to the radius measured. The “hierarchy” is one of nested place-field sizes; no tree is recovered from the data, and the only null geometry tested is Euclidean with uniform sampling. |
| LIT-877 | How Deep Neural Networks Learn Compositional Data: The Random Hierarchy Model | Cagnetta, Petrini, Tomasini, Favero and Wyart (2023; Phys. Rev. X 14, 031001, 2024). Introduces the Random Hierarchy Model, a random context-free grammar of depth L with m synonymic expansions per symbol. Shallow and lazy networks need a fixed fraction of all data, exponential in the input dimension; deep feature-learning CNNs learn from about n_c m^L examples, polynomial in it, which is where hidden layers become invariant to swapping synonyms and where the class statistics of input patches, equal for synonyms, emerge from sampling noise. Without those correlations deep networks fail too. The law is measured; the link to correlations is a scaling argument plus a one-step-gradient model. | Active — read 2026-10-09 (NOTE-677); worth reading as the paper that introduces the Random Hierarchy Model, a random context-free grammar of fixed depth L and branching s in which each class and each higher-level feature has m interchangeable (“synonymic”) lower-level representations, and as a measured and partly derived account of how many examples a deep network needs to learn it. Two-layer networks and lazy (kernel-regime) deep networks need a fixed fraction of all the data, which is exponential in the input dimension d = s^L; deep convolutional networks in a feature-learning parametrisation need P* ≈ n_c m^L, a power of d. That number is measured, not proved. It coincides with the training-set size at which the networks’ hidden layers become insensitive to swapping synonyms, and with the size at which the class-conditional frequencies of input s-tuples, which are equal for synonyms, rise above sampling noise; a one-step gradient argument for a two-layer network on one patch links the last two. Removing the input–label correlations, with the hierarchy kept, makes deep networks fail again. The hierarchy is one of constituency (parts composing wholes), not of attributes implying attributes. |
| LIT-878 v2 | Statistical Physics through the Lens of Real-Space Mutual Information | Gökmen, Ringel, Huber and Koch-Janusz (2021; Phys. Rev. Lett. 127, 240603). Replaces the RBM estimator of LIT-873 with a neural InfoNCE lower bound co-trained with a convolutional coarse-graining filter (RSMI-NE), and uses the optimal filters at a single buffer size, not an iterated flow, as lattice forms of the most relevant operators. On the interacting dimer model they are the columnar and plaquette order parameters below T_BKT and the electric fields at high T; the maximal information marks the phases; one fitted scaling dimension (1.00037 against 1) is given. The optimality theorem is cited, not proved here. | Active — read 2026-10-09 (NOTE-681); worth reading as the paper that turns the real-space mutual-information principle of LIT-873 from an iterated coarse-graining into a single-shot extraction of operators: with the mutual information estimated by a neural InfoNCE bound and the coarse-graining a convolutional filter trained against it, the filters that best compress what a block shares with its distant environment are, across the whole phase diagram of the interacting dimer model, the columnar and plaquette order parameters below the BKT transition and the electric fields at high temperature, and the plaquette filter’s correlator gives a scaling dimension of 1.00037 against the predicted 1. The maximal information itself, log 4 in the ordered phase and decaying algebraically with the buffer in the critical one, traces the phase diagram. The theorem that the optimal filters are the most relevant operators is cited to another paper, and the model’s operators were known beforehand. |
| LIT-879 v2 | Hyperbolic Neural Networks | Ganea, Bécigneul and Hofmann (NeurIPS 2018), ARXIV-1805.09112. Builds neural-network layers in the Poincaré ball from Möbius gyrovector operations: closed-form exponential and logarithmic maps, parallel transport from the origin as a scaling, geodesic hyperplanes with a closed-form point-to-hyperplane distance, and from them hyperbolic logistic regression, feed-forward layers and GRUs, all reducing to the Euclidean ones as the curvature goes to zero. Linear maps and nonlinearities are lifted through the origin’s tangent space, so the curvature acts only through biases and the output distances. Gains over Euclidean models are clear only on a synthetic tree-like task and on separating WordNet subtrees in low dimensions. | Active — read 2026-10-09 (NOTE-686); worth reading as the paper that gives the Poincaré ball the operations a neural network is built from, and so shows exactly where hyperbolic geometry enters such a network and where it does not. From Ungar’s gyrovector formalism (Möbius addition and scalar multiplication) it derives the exponential and logarithmic maps at any point, parallel transport from the origin as the scaling λ₀/λ_x (Theorem 4), geodesic hyperplanes as exp_p of a tangent orthogonal complement, and the closed-form distance to one (Theorem 5); all of these check out numerically. A linear map or pointwise nonlinearity is lifted as exp₀ ∘ f ∘ log₀, so a stack of such layers is one Euclidean network in log₀ coordinates; the curvature acts only through the bias translations between layers and the distance-based softmax. The evidence is small: 5-dimensional sentence encoders on SNLI, where hyperbolic models are on par or worse, and on a synthetic noisy-prefix task, where they win most when the noise is lowest, each cell the best of three runs; and hyperbolic logistic regression separating WordNet subtrees in pre-trained Poincaré embeddings better than Euclidean hyperplanes do, mostly in 2 to 5 dimensions. |
| LIT-880 | How Deep Networks Learn Sparse and Hierarchical Data: the Sparse Random Hierarchy Model | Tomasini and Wyart (2024; ICML 2024, PMLR 235). Pads each informative feature of the Random Hierarchy Model with uninformative positions, so the label is unchanged by discrete displacements of features, a stand-in for smooth deformations. Deep networks learn this sparse model from a number of examples polynomial in the input dimension, measured as (s0 + 1)^L n_c m^L (times s^(L/2)) without weight sharing and (s0 + 1)^2 n_c m^L with it, and become insensitive to synonym swaps and to feature displacements at the same training-set size as they learn the task, which the paper offers as the reason deformation stability tracks test error. Fitted laws; the image case is by analogy. | Active — read 2026-10-09 (NOTE-684); worth reading as the sparse extension of the Random Hierarchy Model (LIT-877) and as a model-based account of why a network’s insensitivity to small smooth deformations of its input tracks its test error. Each informative feature of the RHM is padded with s0 uninformative “empty” positions and may sit anywhere in its sub-patch, so the data become very sparse (s^L informative positions among (s(s0 + 1))^L) and the label is unchanged by discrete displacements of the informative features, a stand-in for diffeomorphisms of an image. On this Sparse Random Hierarchy Model, deep locally connected and convolutional networks learn from a number of examples polynomial in the input dimension: measured, P* ≈ s^(L/2)(s0 + 1)^L n_c m^L without weight sharing and P* ≈ C(s0 + 1)^2 n_c m^L with it. At about that training-set size the hidden layers become insensitive both to swapping synonymous tuples and to displacing features, so the two invariances and good performance arrive together; the paper offers this as the explanation of the correlation between deformation stability and test error measured on CIFAR-10. The laws are fitted, the (s0 + 1)^L factor has a one-step-gradient argument for locally connected networks, the CNN’s (s0 + 1)^2 is unexplained, and the image case is an analogy: no synonym sensitivity was measured on images. |
| LIT-881 v2 | Optimal Renormalization Group Transformation from Information Theory | Lenggenhager, Gökmen, Ringel, Huber and Koch-Janusz (2018; Phys. Rev. X 10, 011037, 2020). Proves that a block coarse-graining keeping all the mutual information the block shares with the system beyond a buffer makes the coarse measure factorize across the block, so a finite-range Hamiltonian gains no range (1D; D dimensions under an extra assumption) and 1D disorder gains no correlations across it. For blocks of two spins of the 1D clean and dilute random Ising chain, where that condition is not met, couplings beyond nearest neighbour and disorder correlations shrink as more information is kept, vanishing at decimation. Encoding into a single binary spin explains why decimation wins in 1D and majority rule in a 2D toy model. | Active — read 2026-10-09 (NOTE-682); worth reading as the theory written for the RSMI algorithm of LIT-873: it proves that a coarse-graining which keeps all the information a block shares with the system beyond a buffer factorizes the coarse measure across that block, so a finite-range Hamiltonian does not gain range (in 1D; in D dimensions under an extra per-block assumption) and, for 1D disorder, no correlations are generated across the block. The full-capture condition is not met by the coarse-grainings it then studies: in its own 1D Ising example decimation keeps about half of the block’s information, and the decay of next-nearest-neighbour and four-spin couplings, and of disorder correlations, as information grows is shown numerically for blocks of two spins. Its other result is information-theoretic: a single binary block spin loses information by encoding, which is why decimation beats majority rule in 1D and majority rule wins in a 2D toy model. |
| LIT-882 | An exact mapping between the Variational Renormalization Group and Deep Learning | Mehta and Schwab (2014), arXiv preprint, never published in a journal. Identifies Kadanoff’s variational RG kernel with an RBM’s energy by T = −E + H, under which the coarse-grained Hamiltonian is the RBM’s hidden-marginal Hamiltonian for any parameters and an exact RG step is a perfect fit of the data. Illustrates it with a hand-built decimation network for the 1D Ising chain and a four-layer stacked RBM trained on 2D Ising samples near T_c, whose receptive fields are local and grow with depth. It concedes that, short of exactness, RG and RBM training use different variational schemes; LIT-873 shows the difference matters. | Active — read 2026-10-09 (NOTE-683); worth reading as the paper that first put deep restricted Boltzmann machines and Kadanoff’s variational renormalization group side by side, and as the position Koch-Janusz and Ringel (LIT-873) argue against. Its “exact mapping” is an identification: setting the RG kernel T = −E + H makes the coarse-grained Hamiltonian equal the RBM’s hidden-marginal Hamiltonian for every parameter value, and makes an exact RG step the same thing as a perfect fit of the data distribution. Away from that point the paper itself says the two procedures use different variational approximations, so the mapping does not show that training an RBM performs RG. The evidence that it does is a hand-built 1D decimation network and qualitative receptive fields of a stacked RBM on 2D Ising samples; no flow, fixed point or exponent is computed. |
| LIT-883 | Towards a theory of how the structure of language is acquired by deep neural networks | Cagnetta and Wyart (2024), NeurIPS 2024. In sequences generated by the Random Hierarchy Model, the correlation between two tokens shrinks by a factor of about m per level of their lowest common ancestor, and a sample of P sequences resolves it only above a noise floor of (v²P)^(−1/2), so a finite training set acts as an effective context window t*(P). Deep next-token learners show loss steps at P_ℓ ≈ v m^(2ℓ−1), where their representations come to encode the level-ℓ hidden symbol, and the steps add up to a power law. On character-level text the measured correlation decay predicts where the loss for a given context length levels off. | Active — read 2026-10-09 (NOTE-687); worth reading as the self-supervised sequel to the Random Hierarchy Model (LIT-877), and the first of that line in which the latent hierarchy is read off a co-occurrence matrix of observable tokens. For sequences generated by the RHM, the covariance between two token positions has zero mean over draws of the grammar and a root-mean-square size set by the depth ℓ of their lowest common ancestor, about ((1 − m/v^(s−1))/(v³ m^(2ℓ−1)))^(1/2) (derived for large v and m); the estimate from P samples carries noise of size (v²P)^(−1/2) (proved by a central-limit argument), so a finite training set resolves correlations only out to an effective distance t*(P). Deep transformers and CNNs trained to predict the last token show loss steps at about P_ℓ = v m^(2ℓ−1), where their hidden layers become insensitive to resampling the subtree below a level-ℓ symbol. That the networks use the correlations to build the hidden variables is argued, not proved. On character-level Shakespeare and WikiText-103 the measured correlation decays as t^(−β), and loss curves for different context lengths collapse under the t*(P) ~ P^(1/(2β)) it implies. No embedding, PMI or linear direction is studied. |
| LIT-884 | A Phase Transition in Diffusion Models Reveals the Hierarchical Nature of Data | Sclocchi, Favero and Wyart (2024; PNAS 122, e2408799121, 2025). On the Random Hierarchy Model with known rules, Bayes-optimal denoising is belief propagation on the tree; in an annealed mean-field approximation, checked numerically, the probability of recovering the class drops sharply at a threshold noise as depth grows, provided the grammar is sparse (s f < 1), while low-level features degrade smoothly and can survive into a sample of a new class. Forward–backward runs of an unconditional ImageNet diffusion model show the same pattern in a classifier’s layers; a two-mode Gaussian mixture does not. | Active — read 2026-10-09 (NOTE-685); worth reading as the paper that turns the Random Hierarchy Model (LIT-877) from a learning problem into an inference problem: given the grammar, the Bayes-optimal denoising of a noisy datum is belief propagation on the tree, and in an annealed mean-field approximation the probability of recovering the root (the class) has a sharp threshold in the noise as the depth grows, while leaves and low latents degrade smoothly, so past the threshold a new class can be built from old low-level parts. The threshold exists only when the grammar is sparse, s f < 1 (f the fraction of s-tuples a level uses); in the dense case, where every string occurs, any noise eventually loses the class. A forward–backward experiment with an unconditional ImageNet diffusion model shows the same pattern in a classifier’s layers: the logits’ similarity drops sharply near t ≈ T/2 while early layers change smoothly and cross over. A Gaussian mixture shows the drop but not the crossing. The threshold is not proved; the trained diffusion model is not shown to compute belief propagation. |
| LIT-885 | Relevance in the Renormalization Group and in Information Theory | Gordon, Banerjee, Koch-Janusz and Ringel (2020; Phys. Rev. Lett. 126, 240601, 2021). On a cylinder, with block and environment as slabs separated by a buffer of length L_B, the information-bottleneck encoder just past its first transition depends on the block only through the boundary weak value of the leading transfer-matrix eigenvector, the lowest-dimension primary at large circumference, and the transition is at β_c = (λ0/λ1)^(2L_B). Checked on a three-site critical Ising cylinder. With a large enough alphabet the encoder respects the data’s symmetry near that transition; a small one can break it. | Active — read 2026-10-09 (NOTE-690); worth reading as the theorem the real-space mutual-information programme (LIT-873, LIT-881, LIT-878) cites for its claim that the optimal coarse-graining picks out the most relevant operators. What it proves is narrower than that claim: for a short-range lattice model on a cylinder, with the block and the environment taken as whole slabs of the cylinder separated by a buffer, the information-bottleneck encoder just past its first transition depends on the block only through the boundary weak value of the leading transfer-matrix eigenvector, and the transition sits at β_c = (λ0/λ1)^(2L_B); for large circumference that eigenvector is the lowest-dimension primary. The planar block-in-a-shell geometry the algorithms use, the fixed-alphabet β → ∞ limit that is RSMI, and the regime beyond the first transition are not covered. A second result: past the first transition, with a large enough alphabet and no fine-tuning, the optimal encoder carries a representation of the data’s symmetry, and a two-symbol example with Z4 symmetry breaks it. |
| LIT-886 | Probing the Latent Hierarchical Structure of Data via Diffusion Models | Sclocchi, Favero, Levi and Wyart (ICLR 2025; JSTAT 2025, 084005). In the Random Hierarchy Model with known rules, the changes that noising and Bayes-optimal denoising make to a datum come in blocks set by which latent changed, and an annealed mean-field calculation, checked against exact belief propagation, gives a correlation length that diverges as a power of the distance to the class threshold, with a susceptibility peak there; a Gaussian field with a power-law spectrum shows none. The same peak appears at an intermediate noise in a masked diffusion language model on WikiText-2 and in an ImageNet DDPM read through CLIP patch embeddings. | Active — read 2026-10-09 (NOTE-691); worth reading as the sequel to LIT-884 that moves from how likely each level of a hierarchical datum is to survive noising and denoising to how the changes are arranged in space. In the Random Hierarchy Model with known rules, an annealed mean-field calculation, checked against exact belief propagation, gives changes that come in correlated blocks, because a changed latent at depth ℓ rewrites about s^ℓ tokens together; near the class threshold ε* the number of levels over which the evidence stays undecided diverges, so the correlation length grows as |ε − ε*|^(−ν) with ν = log s / log F′(p*), and the dynamical susceptibility (the summed correlations) peaks there. A Gaussian random field with a power-law spectrum, by contrast, has a correlation length that grows monotonically to the end of the process. The same peak is then measured in forward–backward runs of a masked diffusion language model on WikiText-2 (near t ≈ 0.6 T) and of an ImageNet DDPM read through CLIP patch embeddings (near t ≈ 0.6–0.7 T). The divergence is a scaling argument within the approximation, checked by one data collapse at one parameter set; the real-data correlations span about one decade of distance and have no non-hierarchical control. |
| LIT-887 v2 | Why does deep and cheap learning work so well? | Lin, Tegmark and Rolnick (2016; Journal of Statistical Physics 168, 1223–1247, 2017). Argues that networks are cheap because physical data have low-order, local, symmetric Hamiltonians, and deep because data come from Markov generative hierarchies whose minimal sufficient statistics compose. Proves that a single hidden layer needs exactly 2^n neurons to multiply n inputs, against about 4n in a deep tree, and gives linear no-flattening examples. Holds that RG is supervised feature extraction, not unsupervised learning; arXiv v1–v2 carried a counterexample against LIT-882 that hit a typo in its Eq. 8, and was dropped later. | Active — read 2026-10-09 (NOTE-688); worth reading as the third position in the dispute over whether deep learning performs renormalization, and for two results that stand on their own. On the dispute it holds that RG is “essentially a feature extractor for supervised learning”: a coarse-graining is a renormalization only once the variables to keep are specified, and fitting the data distribution does not specify them. That holds, and it agrees with what LIT-882 concedes and LIT-873 shows; its sharper form was in an appendix of arXiv v1 and v2 only, dropped from v3 on and from the journal text, showing that a matched partition function does not give a matched distribution and (v2) that the exact trace condition is met by hidden variables that do not interact with the system at all. Its conclusion that RG has “little to do” with unsupervised learning is too strong: LIT-873 gets the relevant variables without labels, from the far environment. On its own merits: a two-variable product needs four neurons and an n-variable product needs exactly 2^n in one hidden layer against about 4n in a deep tree (proved, in a Taylor-matching sense, with weights that grow without bound); the minimal sufficient statistics of a Markov generative hierarchy compose level by level (proved, and nearly immediate); that physics favours low-order, local, symmetric Hamiltonians, and that this is why cheap networks work, is argued, not shown. |
| LIT-888 | Deriving Neural Scaling Laws from the statistics of natural language | Cagnetta, Raventós, Ganguli and Wyart (2026), ICML 2026. The data-limited scaling exponent of a language model’s test loss is predicted from two measured statistics of the corpus: β, the decay of token–token covariance with lag, which sets the usable context n*(P) ~ P^(1/(2β)), and γ, the decay of next-token conditional entropy with context length. When learning within that context is fast, the loss falls as P^(−γ/(2β)); on TinyStories and WikiText-103 transformers match the predicted 0.185 and 0.141 up to about 10^8 tokens. | Active — read 2026-10-09 (NOTE-689); worth reading as the sequel to LIT-883 that takes its effective-context argument from character-level toy runs to subword-tokenised text and a predicted exponent. Two statistics of a corpus are measured: β, the decay with lag n of the largest singular value of the token–token covariance matrix (‖C(n)‖op ~ n^(−β)), and γ, the decay of the next-token conditional entropy with context length (H_n − H∞ ~ n^(−γ), a differential form of Hilberg’s hypothesis). A signal-to-noise argument gives the horizon n*(P) ~ P^(1/(2β)) a sample of P tokens can use; if learning within that horizon is fast, the test loss falls as P^(−γ/(2β)), and in general as P^(−min(δ, γ/(2β))), with δ the decay of the within-horizon excess loss (App. A, an ansatz-based derivation, not a theorem). Measured on TinyStories (β ≈ 0.88, γ ≈ 0.325, predicted α ≈ 0.185) and WikiText-103 (β ≈ 0.94, γ ≈ 0.265, α ≈ 0.141) with GPT-2- and LLaMA-style transformers up to about 10^8 tokens; the empirical exponents fall inside the predicted intervals and the n-gram losses collapse under P/n^(2β), L_n n^γ. γ is read off the n-gram losses of the largest trained models, not computed from the text alone. Usable horizons reached are a few tens of tokens. No embedding, PMI or hierarchy is studied. |
| LIT-889 v2 | Symmetries and phase diagrams with real-space mutual information neural estimation | Gökmen, Ringel, Huber and Koch-Janusz (2021; Phys. Rev. E 104, 064106), the long companion of LIT-878. Derives the RSMI-NE estimator in full and applies it to the 2D Ising model (1 bit below T_c, exponential decay with the buffer above it, boundary filters at T_c), the interacting dimer model and a 1D non-equilibrium chipping model. Its new object is the ensemble of optimal filters from independent runs: it maps an RSMI-degenerate subspace whose projections show broken and emergent (U(1)) symmetries, and PCA of it recovers the pristine operators. Every model’s answer was known beforehand. | Active — read 2026-10-09 (NOTE-692); worth reading as the long companion of LIT-878 and the place where the real-space mutual-information method is shown on more than one model and its outputs are read as an ensemble: the maximal information counts the ordered sectors (exactly 1 bit in the 2D Ising ferromagnet, 2 bits in the columnar dimer phase), decays exponentially with the buffer in the Ising paramagnet and algebraically at criticality, and the optimal Ising filter goes uniform, boundary and random across T_c; 500 independent runs per temperature map an RSMI-degenerate subspace of filters whose projections show the broken C4 and translation symmetries of the dimer model and, at high temperature, its emergent U(1), and PCA of the ensemble recovers the pristine operators from a window where they never appear alone. The number of coarse variables is chosen where the information stops growing. A non-equilibrium chipping model is a one-figure validation, and its formal status is said to be missing. |
| LIT-890 | The power of deeper networks for expressing natural functions | Rolnick and Tegmark (2017; ICLR 2018). Extends LIT-887’s 2^n result: one hidden layer of smooth, bias-free units needs exactly ∏(rᵢ+1) neurons to Taylor-approximate x₁^r₁⋯xₙ^rₙ, a deep network O(Σ log rᵢ); sparse polynomials inherit the gap up to a factor 1/c; at depth k a product of n inputs costs at most about 2^(n^(1/k)), conjectured tight. The uniform-approximation lower bounds rest on an unproved step, and the gap grows with degree, not with the number of inputs. | Active — read 2026-10-09 (NOTE-693); worth reading as the sequel that turns LIT-887’s one depth-separation theorem into a family, and for where the family stops. Proved, for networks without biases and smooth activations with nonzero Taylor coefficients: one hidden layer needs exactly ∏(rᵢ+1) neurons to Taylor-approximate the monomial x₁^r₁⋯xₙ^rₙ, against Σ(7⌈log₂ rᵢ⌉+4) for a deep network; a sparse polynomial with c monomials costs at least 1/c of its dearest monomial; xᵈ costs d+1 shallow against 7⌈log₂ d⌉ deep; and a product of n inputs costs O(n^((k−1)/k)·2^(n^(1/k))) at depth k. The move to uniform approximation, its headline over LIT-887, rests for the lower bounds on a step the proof asserts and that is false in general (a network can be uniformly within ε of a polynomial while its Taylor coefficients diverge), so only the Taylor-sense lower bounds are established. That depth k needs 2^Θ(n^(1/k)) neurons is a conjecture, backed by one trained-network figure at n = 20 with tanh, outside the theorems’ hypotheses. The gap is exponential in a monomial’s degree, not in the number of inputs: polynomials of bounded degree, such as the low-order Hamiltonians LIT-887 calls natural, show none. |
| LIT-891 | Comment on “Why does deep and cheap learning work so well?” | Schwab and Mehta (2016), arXiv comment, never published elsewhere. Reply to the appendix counterexample of Lin and Tegmark’s arXiv v1 (LIT-887): agrees that preserving the free energy does not recover the distribution, calls the “if and only if” of LIT-882’s Eq. 8 a typo (the trace condition implies ΔF = 0, not conversely), and shows that the counterexample violates the trace condition, so the mapping’s exact step is untouched. It does not reach the later objection that the trace condition fails to select the coarse variables. | Active — read 2026-10-09 (NOTE-694); worth reading as Mehta and Schwab’s own statement of how far their mapping (LIT-882) reaches, made in reply to the counterexample in arXiv v1 of Lin and Tegmark (LIT-887). It concedes two things: that preserving the free energy does not recover the distribution (“we entirely agree with this statement and never claimed otherwise”), and that the “if and only if” of LIT-882’s Eq. 8 is a typo, since the trace condition implies ΔF = 0 but not conversely. It argues one: that exact variational RG means the trace condition Tr_h e^T = 1 for every v, which the counterexample violates (checked), so the mapping’s Eq. 22 is untouched. That reply is right against v1. It locates the mapping’s content at the trace condition alone, which is the scope THEORY-197 gives it, and it does not answer the point Lin and Tegmark added in their v2 a fortnight later, that the trace condition is also met by hidden variables that do not interact with the system (THEORY-202). The “typo” did work in LIT-882: its Section I derives the exactness condition from ΔF = 0 through the direction the comment withdraws. |
| LIT-894 v2 | Causality: Models, Reasoning, and Inference | Pearl (2009), second edition, Cambridge University Press. Skimmed in four excerpts the author posts: an intervention do(X = x) deletes X’s structural equation and solves the rest, while observing X = x violates no equation and is ordinary conditioning, so P(y | do(x)) and P(y | x) differ in general. A structural equation is a claim about Y under ideal control (Definition 5.4.1), and its coefficient is ∂E[Y | do(x)]/∂x, not a regression slope. The rest of the book was not read. | Active — read in part 2026-10-10 (NOTE-696); skimmed in four excerpts the author posts, the contents, the Preface to the Second Edition, §§5.3.2–5.4.1 (pp. 154–163) and the Epilogue (pp. 401–428), and nothing else. Worth reading for its operational meaning of a structural equation (Definition 5.4.1: a claim about Y under ideal control of X, not an algebraic or regression equation), for the coefficient as ∂E[Y | do(x)]/∂x, and for the Epilogue’s plain statement of intervention as surgery on autonomous mechanisms, against observation as conditioning, “given that we see”. These excerpts confirm the record’s gloss of do(). Not read: chapters 1–4 and 6–11, so not the identification results, the derivation of the do-calculus, the counterfactual semantics, the treatment of sequential plans (§4.4) or the chapter 11 discussions of whether do(x) represents practical experiments. |
| LIT-895 v2 | Moderate structural realism about space-time | Esfeld & Lam (2008), DOI-10.1007/s11229-006-9076-2, Synthese 160. Moderate structural realism accepts that relations require relata. It denies that the relata need intrinsic properties beyond their relations. Objects and relations are mutually dependent, with no priority either way, and relations supply identity conditions wherever intrinsic properties would. Where nothing discerns the relata (entangled quantum systems of one kind, points of a symmetric space-time), it takes numerical diversity as primitive, and denies that this is a thisness. In general relativity the relata are space-time points, not bare manifold points. They get a “structural identity” from the metric, or from a section of the orthonormal frame bundle. The hole argument counts against epistemic structural realism, and the question of what space-time relations relate counts against the radical version. The case is interpretive fit, not entailment. | Active — read in full 2026-10-10 (NOTE-695); worth reading as the founding statement of the no-priority, non-eliminative structural realism that Chakravartty’s dilemma targets and that the owner’s individuation thesis was placed beside. It says exactly what that position does with relata no relation discerns: entangled quantum systems of one kind and space-time points in symmetric space-times get a primitive numerical diversity, which the authors deny is a thisness or any kind of identity (pp. 33–34). The GR sections show that the tensor and fibre-bundle formulations fit the view, not that they require it. The one concrete construction of a point’s “structural identity” they cite works only for space-times without symmetries, and it breaks the covariance the view rests on. |
| LIT-896 v2 | AI as Agency Without Intelligence: on ChatGPT, Large Language Models, and Other Generative Models | Floridi (2023), DOI-10.1007/s13347-023-00621-y. A seven-page editorial. LLMs “do not think, reason or understand” and work statistically on the form of texts, not their meaning, yet they act successfully and, through reinforcement-learning fine-tuning, “learn” to improve. So they are “a new form of agency”, one that has been “liberated … from intelligence”: Agere sine Intelligere. The thesis is asserted, not argued. No criteria for agency are stated, the only mark that separates it from a sea wave’s difference-making is the capacity to learn to make a different or better difference, and the support for “no understanding” is a handful of anecdotal failures. | Active — read in full 2026-10-10 (NOTE-697); worth reading as the short first statement of Floridi’s slogan that LLMs are “agency without intelligence” (Agere sine Intelligere), which his 2025 paper (LIT-897) develops. Read the last two pages for the thesis. It is an editorial, not an argument. The thesis is asserted in three paragraphs, no criteria for agency are given, and the one citation for the agency notion is Floridi & Sanders 2004 (LIT-898), whose apparatus it does not use. |
| LIT-897 v2 | AI as Agency without Intelligence: On Artificial Intelligence as a New Form of Artificial Agency and the Multiple Realisability of Agency Thesis | Floridi (2025), DOI-10.1007/s13347-025-00858-9. An Editor Letter that “grew so long”. AI is better understood by widening agency to forms without cognition, intelligence or mental states than by widening intelligence to machines. Agency comes in kinds (natural, biological, animal social, artefactual, human individual and social, artificial, social artificial). All of them share interactivity, and the richer ones add graded autonomy and adaptability. AI is computational, data-adaptive agency serving goals set by humans, with no intelligence. The thesis is assumed, and the paper characterises the kind rather than arguing for it. The criteria do not separate AI from other artefacts, and no level of abstraction is stated. | Active — read in full 2026-10-10 (NOTE-702); worth reading for the fullest statement of Floridi’s position that AI is “agency without intelligence”: the Multiple Realisability of Agency thesis set against the Artificial Realisability of Intelligence, Floridi & Sanders’ three criteria restated as graded, and a taxonomy that places AI as “a computational, goal-driven form of agency defined by human purposes” with Agentic AI as its collective form. Read it as a taxonomy, not an argument. The case for MRA over ARI is announced and not made, since the paper assumes AI is an agent and asks what kind. AI’s lack of intelligence is asserted. No level of abstraction is ever specified. Interactivity alone makes a river a natural agent, so the permissiveness objection is accepted rather than answered. |
| LIT-898 v2 | On the Morality of Artificial Agents | Floridi & Sanders (2004), DOI-10.1023/B:MIND.0000035461.63578.9d. Whether something is an agent is fixed only relative to a level of abstraction (LoA), a chosen set of observables. At a suitable LoA a system is an agent if it is interactive, autonomous (changes state without stimulus) and adaptable (its interactions change its transition rules); humans, learning software and organisations all qualify. An agent is a moral agent if it can cause moral good or evil. Such an agent is accountable for what it causes, but responsibility (praise and blame) needs intentional states as well, so artificial agents can be moral agents that are accountable and not responsible, and are censured by modification, disconnection or deletion. The argument is by cases and by rebutting four objections. The paper’s own MENACE example shows agenthood appearing and vanishing as the LoA changes. | Active — read in full 2026-10-10 (NOTE-701); worth reading as the founding statement of Floridi’s line on artificial agency: agenthood as interactivity, autonomy and adaptability at a stated level of abstraction, and moral agency as the capacity to cause moral good or evil, with accountability split from responsibility. Read §2.5, §2.6.2 (MENACE) and §3.2 for the position. It argues by cases and by rebutting four objections; nothing in it is derived, the permissiveness of its criteria is answered by assertion (p. 26), and the distributed morality it says the approach is for is promised, not worked out. |
| LIT-899 v2 | Faultless responsibility: on the nature and allocation of moral responsibility for distributed moral actions | Floridi (2016), DOI-10.1098/rsta.2016.0112. When a network of human, artificial and hybrid agents brings about a morally loaded outcome through interactions that are each morally neutral, nobody intends the outcome, so an ethics that requires intention holds nobody responsible. Floridi proposes holding every causally accountable node “prima facie equally and maximally responsible” (p. 7), by default and overridably, with the rule made common knowledge so that agents restrain one another. The mechanism is adapted from back propagation, strict liability and common knowledge, and illustrated by two Dutch Supreme Court rulings. It is argued by design and analogy. Its responsibility is causal accountability used as a corrective, not blame, and the paper does not reconcile this with Floridi & Sanders 2004’s distinction between accountability and responsibility. | Active — read in full 2026-10-10 (NOTE-699); worth reading for the line’s one worked rule for who answers for an outcome nobody intended: identify the distributed moral action and the network causally accountable for it, then hold every node “prima facie equally and maximally responsible” (p. 7), overridably, with the rule made common knowledge so agents restrain one another. Read §4 and the two Dutch cases (p. 9). It is a design argued by analogy, not a derivation. Its “responsibility” is Floridi & Sanders 2004’s accountability under another name, used as a corrective signal, and the paper never addresses that distinction. In its own boats case the default gives way to ease of rectification, which is a control criterion. |
| LIT-900 v2 | The Method of Levels of Abstraction | Floridi (2008), DOI-10.1007/s11023-008-9113-7. Floridi gives up ontological levelism (levels in the system itself) and keeps an epistemological one, the method of levels of abstraction. An observable is an interpreted typed variable; an LoA is a finite non-empty set of observables; a moderated LoA adds a behaviour predicate; a gradient of abstractions (GoA) is a family of moderated LoAs with mutually inverse relations Rᵢ,ⱼ under which pⱼ ⇒ P_Rᵢ,ⱼ(pᵢ). Fixing the LoA fixes which questions can be asked and answered, and commits a theory to types (the LoA) and tokens (the model). The method is shown on Kant’s antinomies, and set apart from Marr’s, Pylyshyn’s and Dennett’s levels (which, it says, conceal their ontological commitment by privileging explanation), from Davidson’s conceptual schemes, from relativism and from naive realism. It proves nothing about GoAs; its value is the vocabulary. | Active — read in full 2026-10-10 (NOTE-700); worth reading as the source statement of the method of levels of abstraction that Floridi’s papers on agency, informational structural realism (LIT-152) and personal identity (LIT-136) all assume. Read §2 for the definitions, §2.7 for what an LoA commits a theory to, and §4.1 for the distinction between levels of abstraction, of organisation and of explanation. It is a method with definitions, not a result: no theorem is proved about GoAs, the one formal claim (disjoint and nested GoAs are interconvertible) does not go through under the paper’s own definition of nestedness, and the guard against relativism (§4.3) is one paragraph that ranks LoAs only relative to a purpose. |
| LIT-901 v2 | Distributed Morality in an Information Society | Floridi (2013), DOI-10.1007/s11948-012-9413-4. Distributed morality is the case where morally loaded actions of a human, artificial or hybrid multiagent system result from interactions among its members that are each morally neutral or negligible, modelled on distributed knowledge (A knows P∨Q, B knows ¬P, only the “supra-agent” AB knows Q). Two moral thresholds make environments fault-tolerant to small evils and inert to small goods, so managing distributed morality means aggregating possible goods and fragmenting possible evils. ICTs make it common. “Infraethics” is the first-order framework of moral enablers (trust, privacy, transparency …) that is not good in itself. The analogy is looser than it looks: every example sums like contributions past a threshold whose value is left open. Responsibility for distributed morality is not addressed. | Active — read in full 2026-10-10 (NOTE-698); worth reading as the line’s only worked statement of distributed morality (morally loaded actions of a multiagent system arising from interactions each below a moral threshold) and as the source of “infraethics”, the first-order framework of moral enablers that is not morally good in itself. Read pp. 729–734 for the threshold model and pp. 738–740 for infraethics. It argues by a model and four examples and proves nothing. Its analogy with distributed knowledge is not exact: every example sums like contributions past a threshold whose value is left unspecified. No criterion of agency is applied to its “supra-agents”, and responsibility for distributed morality, which Floridi & Sanders 2004 promised, is still not given. |
| LIT-903 | From gut microbiota to host appetite: gut microbiota-derived metabolites as key regulators | Han et al. (2021), Microbiome 9:162. A narrative review of how microbe-derived metabolites and proteins may regulate host appetite: SCFAs through FFAR2 to GLP-1 and PYY; bile acids through TGR5; indoles; ClpB as an α-MSH mimetic; and immunoglobulins against appetite peptides. Mostly rodent and in vitro evidence, by the authors’ own account. The human findings are associations, or prebiotic trials that conflict. | Active — read in full 2026-10-11 (NOTE-706) from the open-access text in Europe PMC (PMC8293578, CC BY). Worth reading as a map of the mechanisms by which gut microbes are proposed to reach host appetite (SCFAs, bile acids, tryptophan and indoles, bacterial protein mimics of host peptides such as ClpB for α-MSH), and for its own admission that the field “is mainly based on in vitro studies and rodent models”. The human evidence it cites is correlational, or comes from prebiotic and metabolite interventions that do not isolate microbes as the cause. |
| LIT-904 v2 | Preliminaries to a theory of action with reference to vision | Turvey (1977), in Shaw & Bransford (eds.), Perceiving, Acting and Knowing, Erlbaum; preprint in Haskins SR-41 (1975). An essay in Bernstein’s line: the executive cannot command muscles, so acts are built from relatively autonomous coordinative structures, reflexes and their functional combinations (a term taken from Easton 1972 and widened), controlled by tuning their parameters. Reflex-probe studies show the spinal cord retuned before voluntary movement; that vision sets the tuning directly is argued, not shown. | Active — read 2026-10-14 (NOTE-826) in full, in its 1975 Haskins report form; worth reading as the essay that made the coordinative structure the unit of action control and tuning its means of control: the executive cannot command muscles, so it specifies a ballpark and sets the parameters of relatively autonomous units, as one sets the stiffness and rest length of a spring. Read it knowing that Turvey borrows the term from Easton (1972), that its evidence is reviewed reflex-probe studies of simple single-joint movements, and that its account of vision setting the tuning is speculation. |
| 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-909 | Discovering Agents | Kenton, Kumar, Farquhar, Richens, MacDermott & Everitt (2022). Agents are “systems that would adapt their policy if their actions influenced the world in a different way”. In mechanised causal models, which add mechanism variables, decision and utility nodes are found from interventions on mechanisms, with proofs of recovery under five assumptions. Verdicts: a thermostat is not an agent, but the thermostat with its creation process is; humans are agents; an actor-critic is two agents. The labels are frame-dependent. | Active — read in full 2026-10-11 (NOTE-707) from the arXiv PDF (v2). Worth reading for the interventional definition of agents, as systems that would adapt their policy if their actions influenced the world differently, and for its verdicts: a thermostat is not an agent, but the thermostat with its creation process is; the training process, not the frozen policy, is the agent. It is explicit that its labels are frame-dependent, relative to the chosen variables. Its proofs assume interventional data on mechanisms. |
| LIT-911 | Agents and Devices: A Relative Definition of Agency | Orseau, McGill & Legg (2018). A system is described either as a device (an input-output mapping) or as an agent (the function it optimizes). Bayes’ rule over mixtures of each gives the observer’s posterior probability that the system is an agent. In a gridworld, running in circles and wall-following come out devices, and heading for a goal, even suboptimally or with rare goal switches, comes out an agent. Agency here is explicitly observer-relative. | Active — read in full 2026-10-11 (NOTE-705) from the arXiv PDF (v1). Worth reading as the cleanest formal version of Dennett’s intentional stance: whether a system is an agent or a device is a Bayesian model comparison between a mixture of goal-optimizing descriptions (inverse RL) and a mixture of input-output mappings, made by an observer with a prior. It presupposes an identified system, and its results depend on the prior chosen. |
| LIT-915 | One Giant Leap from Mouse to Man: The Microbiota–Gut–Brain Axis in Mood Disorders and Translational Challenges Moving towards Human Clinical Trials | Forssten, Ouwehand, Griffin & Patterson (2022), Nutrients 14(3):568. A narrative review of how gut microbes may affect mood, through the vagus, the immune system, the HPA axis and metabolites, and of why results in mice translate poorly to people. Faecal transplant from depressed humans partly transfers the phenotype to rodents. Human probiotic trials are mixed, with some reductions in subjective stress in healthy volunteers and several clean nulls. Written by employees of a probiotics manufacturer. | Active — read in full 2026-10-11 (NOTE-703) from the open-access text in Europe PMC (PMC8840472). Worth reading for the gap between mouse and human in microbiota–gut–brain research on mood: strong rodent effects, partial transfer of a depressive phenotype by faecal transplant into rodents, and repeated failures of preclinical probiotic effects to replicate in human trials. Note the source: all four authors were employed by a company that sells probiotics, and the review is narrative. |
| 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-919 v2 | Nucleation | Vekilov (2010), Cryst. Growth Des. 10, 5007. For lysozyme, nucleation rates are about ten orders of magnitude below the classical prediction, and the paper places the error in the prefactor. It explains this by a solution–crystal spinodal, past which the barrier vanishes, and by two-step nucleation inside metastable dense-liquid clusters, where ordering is the slow step. The mechanism is inferred from a fitted model for one protein. | Active — read in full 2026-10-11 (NOTE-708), from the NIHPA author manuscript at PMC2995260; worth reading as the line’s one clear statement, in a single paper, of classical nucleation theory (n* = 64Ω²α³/Δμ³, ΔG* = 32Ω²α³/Δμ²), of where it fails, and of the two things the author puts beside it: a solution–crystal spinodal, past which the nucleus is one molecule and there is no barrier, and the two-step mechanism, in which crystals nucleate inside metastable dense-liquid clusters that form fast, so that ordering inside them is the slow step. Read the sections on the nucleus size and spinodal, the two-step rate law, and the rate-determining step. The quantitative case is one protein, lysozyme. For metastable clusters the mechanism is inferred from a fitted kinetic model, not observed, and the claim that substrates act on the prefactor rather than the barrier is argued, not measured. It complicates CLAIM-176: the physical threshold is a size that moves with supersaturation and vanishes near the spinodal, not a fixed count. |
| LIT-920 v2 | Studien über die Bildung und Umwandlung fester Körper. 1. Abhandlung: Übersättigung und Überkaltung | Ostwald (1897), Z. Phys. Chem. 22, 289. Measures how small a seed can be (about 10⁻⁹–10⁻¹² g) and shows that only the solid itself or a strictly isomorphous solid seeds; separates metastable states (change only on contact with the new phase) from labile ones (spontaneous change); and states the rule later called the rule of stages: on leaving a state spontaneously, the form reached is the nearest in free energy, not the most stable. Offered as a frequent rule, not a law. | Active — read in full 2026-10-11 (NOTE-709), in German, from the public-domain scan of the volume at the Internet Archive; worth reading as the primary source of the rule later called the rule of stages, and of the metastable/labile distinction. Read §§26–41 (pp. 301–313): the definitions on p. 302, the rule on pp. 306–307 (“nicht der … stabilste …, sondern der nächstliegende”), and the conditional on p. 308 that a metastable intermediate stays until seeded unless it is labile with respect to the next form. Ostwald offers it “not as a law” but as “a frequently applicable rule” (p. 308), from a handful of cases and an analogy with the liquid–vapour isotherm, and absorbs exceptions by assuming unseen intermediates, a move he calls questionable (p. 309). Most of the paper measures seeds: only the solid or a strictly isomorphous solid seeds, down to about 10⁻⁹–10⁻¹² g. It supports the narrowed form of CLAIM-181 within the metastable zone, gives CLAIM-176 no support for a count threshold, and does not support reading the thesis sequence as successive metastable forms. |
| LIT-921 v2 | Sparse Distributed Memory and Related Models | Kanerva (1992), RIACS TR 92.10, in Hassoun (ed.) 1993. SDM restated as a matrix memory, with the RAM as its zero-radius case, and related to correlation-matrix memories, feed-forward nets, the cerebellar cortex and the models of Marr and Albus. For uniform random data and exact cues it gives bit fidelity, the optimal activation p = (2MT)^−1/3 and a capacity near a tenth of the hard locations. Also held in the anthology as ANTH-LIT-669. | Active — read 2026-10-14 (NOTE-779) in full; worth reading as the compact statement of sparse distributed memory in matrix form, with the ordinary RAM as its zero-radius special case and a simple signal-to-noise analysis: fidelity Φ(ρ) with ρ² = pM/[1 + pT(1 + p²M)], best at p = (2MT)^−1/3, and capacity near a tenth of the hard locations at fidelity 0.999. Read it knowing that every number assumes uniform random data and exact retrieval cues, that the noisy-cue case and the critical distance are not analysed here, and that it relates SDM to the Hopfield net only through a cited capacity comparison. |
| 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-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-934 v2 | Quantum structure in cognition | Aerts (2009), Journal of Mathematical Psychology 53(5):314–348. Membership weights for pairs of concepts and their conjunctions and disjunctions (Hampton 1988) have a Kolmogorovian model iff they are neither over- nor underextended and a Kolmogorovian factor is non-negative; many items fail. A subspace lattice with meet and join fits the second kind of failure but provably not the first, which the paper models with an emergent-concept sector in Fock space. Negation appears only as an orthocomplement used to derive conjunction from disjunction. | Active — read 2026-10-14 (NOTE-808) in full; worth reading as the paper that sorts Hampton’s concept-combination data into two kinds of non-classicality and proves that the main kind, over- and underextension, cannot come from a subspace lattice’s meet and join. Read it knowing that its fitting model has a free parameter per item and stipulated conditions, that its two-layer account of thought is interpretation, and that negation enters only as the orthocomplement used to derive the conjunction model, never measured. Registered for QUESTION-055; THEORY-255 is filed from it. |
| LIT-935 v2 | The Origins of Representation Manifolds in Large Language Models | Modell, Rubin-Delanchy & Whiteley (2025). A feature is modelled as a compact metric space and its representation as a map onto the unit sphere. If the map is continuous and injective, the representation is homeomorphic to the feature. If cosine similarity is also locally a smooth decreasing function of squared feature distance, every path on the representation manifold is a fixed multiple of the feature path’s length, so on-manifold geodesics recover the feature’s intrinsic geometry. Both conditions are assumed. Tests on GPT-2-small’s years and on text embeddings of dates and colours find homeomorphism, and isometry for years only on a logarithmic scale. | Active — read 2026-10-14 (NOTE-802) in full; worth reading for Theorem 1: if a feature is a compact metric space mapped continuously and injectively onto the unit sphere, and cosine similarity is locally a C² decreasing function of squared feature distance, path lengths on the representation equal the feature’s up to the scale √(−2g′(0)), so geodesics recover its intrinsic geometry. Read it knowing that both hypotheses are assumed rather than derived, that the title’s “origins” are an informal argument, and that the tests supply a candidate metric by hand: GPT-2’s years are homeomorphic to a linear and a logarithmic scale, and only the metric test separates them. Held as THEORY-284. |
| LIT-936 v3 | The information geometry of large language models is shared, learned, and controllable | Picozzi (2026), arXiv preprint. Each model is given the matrix of Fisher–Rao distances between its next-token laws over a fixed context battery. That matrix is a function of behaviour alone, so it is invariant to output-preserving reparameterisation, which activation geometry is not. Across ten models of three architecture kinds it agrees at a mean rank correlation of 0.88, against 0.62 for activations. This is proved to follow from each model’s small excess risk to a common law, and it is measured to come from model disagreement lying nearly orthogonal to the relational structure. The pulled-back metric gives minimum-disturbance steering whose advantage over Euclidean steering it predicts (median measured/predicted 0.967). | Active — read 2026-10-14 (NOTE-755) in full; worth reading as a measured, coordinate-free relational signature. The matrix of Fisher–Rao distances between a model’s next-token laws over a context battery is fixed by behaviour and invariant to any output-preserving reparameterisation, while activation geometry has a GL(d) gauge. It agrees across ten transformer, state-space and recurrent models at a mean rank correlation of 0.88, against 0.62 for mid-layer activations, and a probe on distances to 40 anchors transfers between models. Read it knowing three things. The signature is identified because it is a function of the observed laws, the in-probe case QUESTION-027 calls automatic. Its agreement is proved only as a consequence of each model fitting the same law, on a shared outcome space, and only about 9% of shared eigenvector structure goes beyond what the shared laws imply. It is a single-author v1 preprint whose code is on request. Most of its length is natural-gradient steering, editing and fine-tuning, which is machine-learning practice. |
| LIT-937 v2 | Post-Hoc Concept Disentanglement: From Correlated to Isolated Concept Representations | Erogullari et al. (2025). Concept activation vectors fitted one concept at a time come out aligned for attributes that co-occur in the labels, such as “beard”, “mustache” and “necktie” in CelebA, in blocks matching the label correlations. A joint fit with a non-orthogonality penalty ‖CCᵀ − I‖²_F finds mutually orthogonal directions that still separate each concept, with AUROC largely preserved, at the last convolutional layer of VGG16 and ResNet18. So the alignment comes from the separate fits, not from the representation. Steering along the orthogonal directions inserts or removes one concept with less effect on correlated ones. | Active — read 2026-10-14 (NOTE-816) in full; worth reading as a clean case where concept directions for correlated attributes align only because each is fitted alone: a joint fit with an orthogonality penalty finds mutually orthogonal directions that still separate each concept with AUROC largely preserved, at the last convolutional layer of VGG16 and ResNet18 on CelebA and FunnyBirds. Read it knowing that every result is in a figure with no values or error bars, that AUROC is the only check that a direction keeps its meaning, and that the attributes are correlated, not hierarchical. Registered for QUESTION-025, where it bears on the correlated branch only; THEORY-292 is filed from it. |
| LIT-938 v2 | Evaluating Compositional Scene Understanding in Multimodal Generative Models | Fu et al. (2025), TMLR. Human raters judged DALL-E 3 images against relational prompts. It beats DALL-E 2 on every familiar two-entity relation. Agreement falls when subject and object of an asymmetric relation are swapped, and for most prompts combining two relations among three entities. Low-agreement reversed images mostly show the wrong relation or swapped roles. Five vision-language models learn relational concepts few-shot (Bongard-HOI, SVRT) below human level, and four of them are at chance on six-object concepts. VLM judges correlate poorly with human ratings. | Active — read 2026-10-14 (NOTE-813) in full; worth reading as a human-rated measurement of relational binding in one text-to-image model: DALL-E 3 renders familiar single relations well, loses them when the roles of an asymmetric relation are reversed or two relations are combined, and fails on the relation or the roles rather than the objects. Read it knowing that it tests one generator, that its experiments differ in style, raters and prompt selection, and that its explanation by training-data likelihood rests on a correlation of 0.09. Filed for QUESTION-018; the finding is held as THEORY-250. |
| LIT-939 v2 | Modeling opinion misperception and the emergence of silence in online social system | Vilone and Polizzi (2024). In two agent-based models on scale-free networks with fixed private beliefs, a small hard-core minority makes expressed and perceived opinion lean far toward the minority. The first model has no voluntary silence. In the second, the majority falls silent: 55–60% of agents end silent, whatever the minority’s size or degree. The network’s direct (friendship-paradox) distortion of perception is small and of no fixed sign. Simulation only. No belief changes, and the majority is overturned in expression only above a minority of about 30%. | Active — read 2026-10-14 (NOTE-810) in full; worth reading for its separation of two sources of opinion misperception in a network: the friendship-paradox distortion of what members see, which it finds small and of no fixed sign, and a spiral of silence, which it finds large. With private beliefs held fixed, a hard-core minority drives 55–60% of agents into silence and makes expressed opinion lean far toward the minority. Read it knowing that it is simulation only, that no belief ever changes, and that the majority is overturned in expression only above a minority of about 30%. Filed for QUESTION-047; THEORY-242 holds what it shows. |
| LIT-940 v2 | Optimal scaling laws in learning hierarchical multi-index models | Defilippis, Krzakala, Loureiro and Maillard (2026). Take Gaussian inputs, n = αd samples, and a hierarchical multi-index target with even links and weights a_k ~ k^(−γ). Direction k becomes weakly recoverable at α_k = Θ(a_k^(−2)), so features emerge in sequence as the sample size grows, through sharp spectral transitions. The Bayes-optimal subspace error is Θ(α^(−1+1/(2γ))) until α ≍ m⋆^(2γ), then Θ(m⋆/α). A target-agnostic spectral estimator attains it. So does a two-layer network built on that estimator with a ridge readout. No training trajectory is analysed. | Active — read 2026-10-14 (NOTE-805) in full; worth reading as an exact theory of when a feature becomes learnable. Take Gaussian inputs and a target Σ a_k g_k(⟨w_k, x⟩) with even links and a_k ~ k^(−γ). Direction k becomes weakly recoverable at n = Θ(a_k^(−2) d), so features emerge one by one as spikes leaving a random-matrix bulk. A target-agnostic spectral estimator attains the Bayes-optimal rates, Θ(α^(−1+1/(2γ))) and then Θ(m⋆/α). Read it knowing that the cascade is in the number of samples, not in training time. The link to gradient descent is a remark citing other work. The network theorem is for a spectral first layer plus a ridge readout on split data. Held as THEORY-283. |
| LIT-941 v2 | A Theory of Unsupervised Translation Motivated by Understanding Animal Communication | Goldwasser et al. (2022; NeurIPS 2023). A theoretical framework for unsupervised translation with no parallel data and no assumption that the corpora share domain or structure: maximum likelihood against a prior that scores how plausible a target text is. In two stylised random models it proves error bounds that fall with common ground, source-language complexity and samples, with a matching lower bound in one, err = O(log|Θ| / (α·min(m,|T|))), and checks them on synthetic data. Information-theoretic, lossless and uniform. | Active — read 2026-10-14 (NOTE-804) in full; worth reading as the first theory of translation without parallel data: maximum likelihood against a plausibility prior learns the translator with an Occam-type bound divided by the common ground, err = O(log|Θ| / (α·min(m,|T|))) in its common-nonsense model, tight up to a constant. Read it knowing that its models are uniform, random and lossless, that the bounds are information-theoretic, and that the prior substitutes for parallel data in learning a decoder, not for information in a message. Filed THEORY-270; bears on QUESTION-020 without answering it. |
| LIT-942 v2 | Do different prompting methods yield a common task representation in language models? | Davidson et al. (2025), NeurIPS 2025. The paper extends function vectors from few-shot demonstrations to short instruction prompts and extracts instruction function vectors that improve zero-shot accuracy. Demonstration and instruction function vectors share only 4 to 7 of their top 20 attention heads, add rather than substitute, and lose accuracy when their heads and activations are swapped. It concludes that the two prompting forms do not induce a common task representation but partly overlapping mechanisms, and that the instruction route is built by post-training. | Active — read 2026-10-14 (NOTE-803) in full; worth reading as the direct test of whether a task given by demonstrations and the same task given by an instruction share one internal representation. Under function vectors they do not: mostly different heads, vectors that add, and an asymmetric cost to swapping them. Read it knowing that it tests prompt forms, not paraphrase or stance, on simple lexical tasks in small models, and that the authors say they cannot prove the negative. Filed THEORY-264; bears on QUESTION-024 without answering it. |
| LIT-943 v2 | From Lazy to Rich: Exact Learning Dynamics in Deep Linear Networks | Dominé, Anguita, Proca, Braun, Kunin, Mediano & Saxe (2025), ICLR. For a two-layer linear network with whitened inputs, trained by full-batch gradient flow from a λ-balanced start, W₂ᵀW₂ − W₁W₁ᵀ = λI, the dynamics of the network function, representations and finite-width NTK are solved exactly. The solution is a matrix Riccati equation. The relative scale λ is conserved and sets the regime. As λ → 0 learning is rich: sigmoidal, stage-like, with task-specific representations. As |λ| → ∞ it is lazy: exponential, with a static NTK. Its sign, together with the architecture, decides which layer stays task-agnostic, and in funnel networks it gives a delayed rich phase. Wide LeCun-initialized networks are λ-balanced in probability. | Active — read 2026-10-13 (NOTE-715): main text in full, and the statement of Appendix A.3 (random initializations are λ-balanced) without its proof; the proofs in Appendices B–C not checked. Its control parameter is the relative scale of the layers, not the absolute scale the seed entry named. The account filed from it is THEORY-212, and the question it raises under SGD is QUESTION-081. |
| LIT-944 v2 | Questioning Representational Optimism in Deep Learning: The Fractured Entangled Representation Hypothesis | Kumar, Clune, Lehman & Stanley (2025), a position paper. Three image-generating networks found by Picbreeder’s human-guided evolution are rewritten as dense MLPs. Networks of the same architecture are trained by SGD to reproduce the same images, and they do. The SGD networks show no reuse of the symmetric parts, and sweeping their weights distorts the image, where the evolved networks’ sweeps vary it meaningfully. The paper calls this fractured entangled representation, argues that open-ended search approaches a unified factored one, and conjectures that FER in large models harms generalization, creativity and continual learning. The evidence is qualitative. | Active — read 2026-10-14 (NOTE-771) in full; worth reading for its side-by-side comparison of networks that compute the same image in the same architecture: SGD reproduces three Picbreeder images without the evolved networks’ reuse of symmetric parts or factoring of independent ones, and perturbing its weights breaks the regularities that perturbing theirs preserves. Read it knowing that it is a position paper, that the evidence is curated neuron maps and weight sweeps for three images with no measure of fracture, that the evolved networks were selected by users rather than trained on the image, and that its explanation by open-ended search and its extension to large models are conjecture. Held as THEORY-241. |
| LIT-945 v3 | Unscrambling the omelette of causation and inference: The framework of causal-inferential theories | Schmid et al. (2020). The paper introduces causal-inferential theories, which pair a theory of causal influences with a theory of inference and say how the two interact. In this frame it recasts operational and realist theories and characterizes the assumptions behind no-go theorems based on Bell locality and on generalized noncontextuality. It shows that the existence of a Leibnizian classical realist representation implies a generalized-noncontextual one; the converse is conjectured. Read in part. | Active — read 2026-10-14 (NOTE-737) in part, not in full: the sections that characterise generalized noncontextuality and Leibnizianity (§§V, VI, VIII, IX) were read closely, §II–IV and the proofs in Appendices C–G were not, so the NOTE is Skimmed. Worth reading as the current statement of what a generalized-noncontextuality no-go denies: a classical realist representation that preserves inferential equivalence. It also shows why a prepare-measure scenario, which allows no Bell-like no-go, can still show contextuality. Read it knowing that Leibnizianity implies generalized noncontextuality only in one direction (the converse is Conjecture 1′), that only classical inference is built, that the nonclassical realist theory it aims at is specified by desiderata only, and that it does not discuss the Kochen–Specker or sheaf notions. |
| LIT-946 v2 | The Geometry of Prompting: Unveiling Distinct Mechanisms of Task Adaptation in Language Models | Kirsanov et al. (2025). Using manifold capacity from statistical physics, the paper studies how an instruction, demonstrations and soft prompts change the geometry of representations in base decoder-only models. Methods with similar accuracy act differently: demonstrations reshape intermediate representations of the input, driven by the example sentences rather than their labels; an instruction acts mainly on the last token; soft prompts act late. Few-shot failures from example choice or relabelled categories leave the classes separable, which the authors attribute to the readout. Demonstrations for one task help other tasks’ separability early and hurt it late. | Active — read 2026-10-14 (NOTE-789) in full; worth reading for its split of accuracy into representational separability and readout: demonstrations reshape how the input itself is represented, driven by the example sentences rather than their labels, an instruction acts mainly on the last token, and few-shot failures from example choice or relabelled categories leave the classes separable. Read it knowing that it uses base models, one instruction wording and mostly synthetic data, and infers the readout failure rather than measuring it. Filed THEORY-251, and supports THEORY-264 with LIT-942. |
| LIT-947 v2 | Unravelling the Flow of Information in a Nonequilibrium Process in the Presence of Hydrodynamic Interactions | Das et al. (2025). Two colloidal particles in optical traps are coupled by the fluid through a symmetric tensor, and the trap of one is moved by recorded Ornstein–Uhlenbeck noise. Mutual information, time-delayed mutual information and transfer entropy, estimated from experimental and simulated trajectories, recover drive → driven particle → other particle. They show backflow between the particles at the measured drive strengths, and one-way flow at strong drive in simulation only. Stronger coupling lowers the information the driven particle shares with the drive and raises what the particles share, in parallel with a reported trend of irreversibility under coarse-graining. Without drive the particles are statistically independent. | Active — read 2026-10-14 (NOTE-788) in full; worth reading as a clean experimental benchmark for directional information measures: two colloids, symmetrically coupled by the fluid, one trap moved by recorded noise, with transfer entropy and time-delayed mutual information recovering drive → driven → other particle. Read it knowing that the drive acts on one particle and is recorded, so the measures locate where a drive enters; they do not tell a shared drive from coupling, and the direction they report changes with drive strength while the coupling stays symmetric. Held for QUESTION-063 as a limit on what such measures can see, in THEORY-275. |
| LIT-948 v2 | Distances for Markov chains from sample streams | Calo et al. (2025). The bisimulation metric between two finite Markov chains, in its bicausal optimal-transport form (LIT-962), is the value of a new linear program whose constraints use each chain’s discounted occupancy measure over consecutive state pairs in place of its transition kernel. A stochastic primal-dual method on it, SOMCOT, estimates the metric to accuracy ε with probability 1−δ from O((|X||Y|(|X|+|Y|) + (|X|+|Y|)log(1/δ))/((1−γ)²ε²)) independent transition samples per chain, with no model of the dynamics. The samples are independent draws from the occupancy measures, which needs restarts from the initial state. The states must be observed and enumerable, and the ground cost known. Experiments on block-structured random walks and a discretised pendulum. | Active — read 2026-10-14 (NOTE-763) in full; worth reading as the first estimator of the bisimulation metric between finite Markov chains with a guarantee and no transition model. A reformulated LP needs only each chain’s sampled occupancy of consecutive state pairs, and a stochastic primal-dual method reaches accuracy ε with probability 1−δ from O((|X||Y|(|X|+|Y|) + (|X|+|Y|)log(1/δ))/((1−γ)²ε²)) samples per chain. Read it knowing that the samples are independent draws from the discounted occupancy measure, which needs restarts, not one running stream. The states must be observed and enumerable, and the cost on state pairs given. The chains have no actions. Filed as THEORY-280. |
| 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-950 v3 | All or None: Identifiable Linear Properties of Next-token Predictors in Language Modeling | Marconato, Lachapelle, Weichwald & Gresele (2024; AISTATS 2025). Two softmax next-token predictors induce the same distribution exactly when an invertible linear map relates them on the subspaces M and N that enter the logit dot product. Off those subspaces any distortion is allowed, at any representation dimension and without the diversity condition. Relational linearity, and with it linear probing and linear subspaces, then holds in all equivalent models or none when Γ ⊆ N and Γ_q ⊆ M. Parallelism of difference vectors survives only inside N. Theory only. | Active — read 2026-10-14 (NOTE-746) in full; worth reading as the exact characterisation of which softmax next-token predictors induce the same distribution: an invertible linear map on the subspaces M and N that enter the logits, with arbitrary distortion off them. Its all-or-none theorem for relational linearity, linear probing and linear subspaces is the record’s clearest proved case of structure identified when the full latent model is not. Read it knowing that the result needs exact equality of distributions over every sequence, a shared vocabulary and the conditions Γ ⊆ N and Γ_q ⊆ M, that parallelism survives only inside N, and that there are no experiments. For QUESTION-027 it is an instance of the unrestricted, already answered form, since the whole distribution is observed and no decision lies outside the probes. |
| LIT-951 v2 | Physics of Skill Learning | Liu, Liu, Michaud, Gore and Tegmark (2025, preprint). In a toy model of independent skills, the Geometry model, gradient descent learns orthogonal skills together, each in time ∝ 1/p. Sign descent makes them compete for coordinate signs, so each starts as the one before finishes (the Domino effect), and the n-th takes time ∝ n. A one-parameter Resource ODE fits this and conserves u_i^(1/p_i). In a small MLP, a parity built from two others waits for them. The evidence is simulation and small experiments. | Active — read 2026-10-14 (NOTE-794) in full; worth reading for one contrast in a toy model of independent skills, the Geometry model. Under gradient descent, orthogonal skills are learned together, each in time ∝ 1/p. Under sign descent they compete for coordinate signs, and each starts as the one before finishes. That is the Domino effect, and it makes the n-th skill take time ∝ n. A separate MLP experiment shows a second cause of sequential onset, dependency between skills. Read it knowing that the Domino effect is shown in simulation, that the Resource and Domino models are fitted to it rather than derived, that the order is frequency order under every optimizer, and that the real-network evidence is a few small MLPs trained with Adam. Held as THEORY-253. |
| LIT-952 v2 | Neural Networks Learn Statistics of Increasing Complexity | Belrose, Pope, Quirke, Mallen, Dury and Fern (ICML 2024). Vision networks trained on real images, probed during training with images whose class means or covariances are grafted from another class and with maximum-entropy samples keeping only those statistics, act on them early (peaks between about 2^4 and 2^12 steps) and lose that later. First-order sensitivity peaks before second-order. Pythia fits unigram-sampled text before bigram-sampled text. The n-gram/moment equivalence is an identity; the ordering is empirical, for orders one and two. | Active — read 2026-10-14 (NOTE-777) in full; worth reading for its probes of what a network is using at a given checkpoint, which are maximum-entropy samples and optimal-transport grafts of class statistics, and for the result they give. Vision networks act on class means and covariances early in training and lose that later, with first-order sensitivity peaking before second-order. Pythia fits unigram text before bigram text. Read it knowing that the ordering is empirical and covers orders one and two, that the Taylor argument for it is a heuristic, and that its n-gram/moment theorem is an identity of one-hot indicators. Held as THEORY-279. |
| 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-954 v2 | The semantic landscape paradigm for neural networks | Gokhale (2023). A conceptual proposal with no experiment and no proof. Training is pictured as a walk on a graph whose nodes are the algorithms (“heuristic models”) a network can implement, ranked by a fallibility F, the KL divergence from the truth over all inputs. Grokking’s critical dataset size and emergence with scale are argued to be connectivity thresholds of that graph, called percolation; power-law scaling in training time, data and size is derived from an assumed trap model with exponentially distributed barriers and F ∝ 1/N_b. Thresholds and scaling laws are two kinds of event in one vocabulary. | Active — read 2026-10-14 (NOTE-807) in full; worth reading only as a vocabulary: training pictured as a walk on a graph of the algorithms a network can implement, with thresholds as connectivity changes and scaling laws as trap-model waiting times. Read it knowing that it has no experiment and no proof, that its percolation is asserted without a percolation model, and that it treats thresholds and scaling laws as two kinds of event, not one. For QUESTION-039 it is a vote for several kinds in a common language; THEORY-181 holds a sharper account of grokking’s critical data size. No THEORY filed. |
| LIT-955 v2 | Tangled webs: A practical investigation of graph tangles. | Salter-Duke (2024), PhD thesis, Victoria University of Wellington. Tangles (Robertson and Seymour 1991) define a cohesive region as one every low-order cut points towards. The thesis gives an exact but exponential algorithm for edge-connectivity tangles and tests them on eleven small networks and small images. Tangle communities match standard ones only where community structure is strongly delineated; three networks have no distinguishable tangles at the orders reached; tangles of one to three vertices recur; one-pixel lines cannot be distinguished. The author finds the notion “not as compelling as I had hoped”. | Active — read 2026-10-14 (NOTE-814) in full; worth reading as an early empirical test of tangles, the Robertson–Seymour notion of a region that cannot be pulled apart, as a criterion of cohesion: an exact low-order algorithm, eleven small real networks and some small images. Read it knowing that the result is mostly negative (tangle communities match standard ones only where structure is strongly delineated, tangles of one to three vertices recur, thin shapes cannot be seen), that turning a tangle into a vertex set needs the author’s assignment rule, and that only small graphs and low orders were computable. Registered for QUESTION-035; THEORY-254 is filed from it. |
| LIT-956 v2 | Back and forth between algebraic geometry, algebraic logic, sheaves and forcing | Sayed Ahmed (2018). Distributive lattices with join-preserving idempotent operators are represented, after Comer, as continuous sections of a sheaf of quotient algebras over the Priestley space of their fixed-point part; a small site is said to give a notion of forcing, with a Łukasiewicz conjunction forced through a tensor product, and many-valued theories are interpreted in a quasi-topos. Most theorems are stated with sketched proofs or none, and negation is never written out. | Active — read 2026-10-14 (NOTE-817) in full; worth reading only as a pointer to Comer’s sheaf duality for algebras of formulas, extended here to distributive lattices with operators, and to presheaf forcing with an added Łukasiewicz clause. Read it knowing that its main theorems are stated with sketched proofs or none, that it never writes negation or a pseudo-complement, and that it concerns distributive lattices and forcing posets, not contexts. It does not supply the Heyting-over-contexts machinery QUESTION-055 was filed for; no THEORY is filed from it. |
| LIT-957 v2 | Relative fluency (unfelt vs felt) in active inference | Brouillet and Friston (2023), Consciousness and Cognition 115:103579. A perspective essay. Fluency, the felt ease of processing, is read as the brain’s recognition of the precision of its own predictions. Unfelt fluency is a subpersonal change in precision that orients attention; felt fluency is a hierarchically deeper inference about it, reached by endogenous attention, and is attributed to the stimulus because its cause is internal. The case rests on reviewed discrepancy-attribution experiments (the hension effect and its successors). No model and no new data. | Active — read 2026-10-14 (NOTE-785) in full; worth reading as a short statement of how fluency research could be put into active inference: fluency as the recognition of the precision of one’s own predictions, registered first as a change against expectation and misattributed to the stimulus because its cause is internal. Read it knowing that it is a perspective essay with no model and no new data, that its experiments are reviewed second-hand, and that its “felt” fluency means fluency made reportable by endogenous attention, not a separation of experience from function. |
| LIT-958 v2 | How manipulable are prediction markets? | Rasooly and Rozzi (2025). A pre-registered field experiment randomly moved prices by ±5 points in 817 Manifold prediction markets. About 25% of the yes–no gap reverted in the first week and 6% more over the next three. At 60 days, the last measurement, about 59% remained in unresolved markets. A model with finite, risk-averse traders predicts partial, slowing reversion even without learning. Markets with more traders, more activity or a Metaculus twin reverted more, but these splits are not randomised and are mostly significant only at 10%. | Active — read 2026-10-14 (NOTE-778) in full; worth reading as a randomised, pre-registered field experiment that answers the counterfactual question that historical manipulation studies could not. On 817 Manifold markets about 59% of a random ±5-point shock was still present after 60 days in unresolved markets, and a price-impact model with finite, risk-averse traders explains partial persistence even when no trader learns. Read it knowing that it cannot say whether traders came to believe the shocked price, that the platform runs mostly on play money, and that its evidence on which markets resist manipulation is correlational. Filed for QUESTION-047; THEORY-267 holds what it shows. |
| 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-961 v2 | A Reply to Makelov et al. (2023)‘s “Interpretability Illusion” Arguments | Wu, Geiger, Huang, Arora, Icard, Potts and Goodman (2024). The authors of distributed alignment search reply to Makelov et al. (2023). They argue that the “illusion” is generic, because a direction a model uses need not be orthogonal to the null space of the next layer; that FLDD can be large with no change in behaviour; and that the factual-recall cases come from DAS trained per fact pair. Their toy counterexample holds only for an unnormalized patch. Both papers grant that alignments related by a change of basis can tie under interchange interventions. The reply’s own GPT-2 experiments agree that MLP8 carries almost no name-position information (4% IIA, against 70% for the layer-8 block output). | Active — read 2026-10-14 (NOTE-809) in full; worth reading for the point it shares with the paper it answers: interchange interventions on one set of variables can be satisfied equally by alignments related by a change of basis, so the mediating variable is fixed only relative to a choice of units. Read it knowing that its central toy computation, which claims Makelov et al.’s test rejects their own faithful direction, holds only for an unnormalized patch; patching the subspace the rowspace component spans recovers the full effect. Its own GPT-2 experiments agree that MLP8 carries almost no name-position information. The dispute is over the label, the metric (FLDD against IIA) and how DAS is trained, not over constitution against correlation. Filed, with LIT-968, as THEORY-243. |
| LIT-962 v2 | Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently | Calo et al. (2024). For two finite Markov chains without actions, with real-valued state labels r and discount γ, the bisimulation metric of Desharnais et al., van Breugel and Worrell, and Ferns et al. equals the optimal-transport distance between the chains’ path laws over bicausal couplings, with ground cost (1−γ)|r(x)−r(y)|. That distance is 1/(1−γ) times the value of a finite linear program over discounted “occupancy couplings” of state-pair transitions. Entropy regularisation of the program gives Sinkhorn Value Iteration, with an O((1−γ)⁻⁵ε⁻²) iteration bound under exact inner projections, and in experiments it is faster than earlier dynamic-programming solvers. | Active — read 2026-10-14 (NOTE-757) in full; worth reading as the paper that makes approximate bisimulation a transport cost. For finite action-free chains with real-valued labels, the discounted bisimulation metric solves the same fixed-point equation as optimal transport over bicausal couplings with ground cost (1−γ)|r(x)−r(y)|, so the two are one object, and that cost is the value of a finite linear program over occupancy couplings. Read it knowing three things. Its chains have no actions, so it does not reach systems driven by utterances, which is what QUESTION-008 asks about. Its only statement about trace equivalence is second-hand and one-way. Its Sinkhorn Value Iteration guarantee needs exact inner fixed points. Filed as THEORY-247. |
| LIT-963 v2 | Fundamental Limits of Perfect Concept Erasure | Chowdhury et al. (2025), AISTATS. Under finite supports and disjoint concept groups, an erasure Z = f(X) that reveals nothing about the concept A keeps at most I(Z;X) ≤ H(X|A). A deterministic map reaches that only when the groups’ distributions are permutations of one another, by mapping each group bijectively onto a common distribution. For unequal groups a stochastic minimum-entropy-coupling map still erases perfectly with less utility. The paper says the cap is then out of reach, which holds only for deterministic maps. The method beats INLP, LEACE, FaRM, KRaM and DCA on synthetic data, GloVe and GPT-4 embeddings. | Active — read 2026-10-14 (NOTE-820) in full; worth reading for the clean information-theoretic cap on perfect concept erasure, I(Z;X) ≤ H(X|A) once Z is independent of A, and for the proof that a deterministic erasure reaches it only when the concept groups are permutations of one another. Read it knowing that it assumes finite supports and disjoint groups, so that the concept is a function of the representation, and that its claim that unequal groups cannot reach the cap is false for stochastic maps. Filed for QUESTION-010; the bound is held as THEORY-281. |
| LIT-964 v2 | The reusable holdout: Preserving validity in adaptive data analysis | Dwork et al. (2015). Adaptive reuse of data inflates false discoveries. By the Supplementary Material: if the max-information between the data and the function an analyst picks is at most log₂e·τ²n, that function’s empirical mean exceeds its true mean by τ with probability at most e^{−τ²n}, and ε-differential privacy bounds max-information by log₂e·εn. Thresholdout answers m adaptively chosen [0, 1]-valued queries on a holdout to accuracy τ with probability 1 − β for n = O(ln(m/β)/τ²·min{B, √(B ln(m/β))/τ}), B the budget of detected overfits. The main text was not read. | Active — read 2026-10-14 (NOTE-848) in part; worth reading for QUESTION-040 as a high-probability bound on overfitting under adaptive reuse: bounded max-information between the data and the analyst’s choices bounds the chance a chosen statistic overfits, differential privacy bounds max-information, and Thresholdout validates m adaptively chosen statistical queries with a holdout growing as ln m. Read it knowing that only the Supplementary Material was reached, not the main text, that four of its six bounds are proved in companion papers, and that it covers [0, 1]-valued queries on a discrete universe. |
| LIT-965 v2 | Evolution of consciousness: Phylogeny, ontogeny, and emergence from general anesthesia | Mashour and Alkire (2013), a colloquium perspective. It proposes the stepwise return of consciousness after general anaesthesia as a model for studying its evolution. It reads one PET study, in which the return of a response to command correlated mainly with brainstem, hypothalamus, thalamus and anterior cingulate, as showing that conserved structures with limited recurrent cortex suffice for primitive consciousness. By homology, it concludes that early mammals and birds are phenomenally conscious. The marker of return is an access marker, which the authors concede. | Active — read 2026-10-14 (NOTE-797) in full; worth reading as a clear statement of the case for animal consciousness from anaesthesia and comparative anatomy: the return of a response to command after anaesthesia correlates mainly with brainstem, thalamus and anterior cingulate, so ancient conserved structures with limited recurrent cortex are taken to suffice, and early mammals and birds are taken to be phenomenally conscious. Read it knowing that it is a perspective with no data of its own, that its marker of returning consciousness is an access marker (which it concedes), and that the step to other species is by homology, not by anaesthesia evidence from them. No THEORY was filed from it; THEORY-091 holds the limit it illustrates. |
| LIT-966 v2 | Cooperative Dilemmas in Rational Debate | Handfield et al. (2025). Two debaters in a Betz-style logical space choose fixed argument strategies, with payoff w·v − d (true beliefs against changes of mind). At low and moderate truth weights the game is a cooperative dilemma: a prisoner’s dilemma, stag hunt or, most often, a snowdrift in which one debater argues boldly and the other free-rides. At low weight both exit. At high weight in short debates mutual boldness is the unique, truth-optimal equilibrium. In a narrow band of mixed equilibria, raising the truth weight slightly lowers collective accuracy. All exact results are for n = 3 propositions. | Active — read 2026-10-14 (NOTE-795) in full; worth reading as a clean game-theoretic statement of epistemic free-riding in debate. Two deductive reasoners who value true beliefs but pay for each change of mind face a cooperative dilemma at low and moderate truth weights: typically one argues boldly and the other free-rides, and at low weights both exit. Read it knowing that it models two people and three propositions, that its outcome is collective accuracy and not a shared belief, and that the drop in accuracy as truth motivation rises is small and confined to a narrow band of mixed equilibria. Filed for QUESTION-047; THEORY-290 holds what it shows. |
| LIT-968 v3 | Is This the Subspace You Are Looking for? An Interpretability Illusion for Subspace Activation Patching | Makelov, Lange and Nanda (2023). A subspace activation patch can make a model behave as if a feature had changed while the patched direction is the sum of a part that varies with the feature but cannot reach the output (in an MLP, the kernel of the down-projection) and a part that can reach the output but is dormant on the data. Exact in a three-unit network; shown for MLP8 of GPT-2 Small on indirect object identification and for GPT2-XL MLPs on factual recall, where the effect vanishes once the disconnected part is removed. A residual-stream direction for the same feature passes the test. One-dimensional fact patches and rank-1 edits are nearly interchangeable, so a working rank-1 edit does not show the fact is stored in the edited layer. | Active — read 2026-10-14 (NOTE-782) in full; worth reading as the clearest case of an intervention that produces the predicted counterfactual output without the intervened variable carrying the feature: a subspace patch that pairs a direction varying with the feature but unable to reach the output with one that can reach it but is dormant on the data. Read it knowing that its ground truth for GPT-2’s MLP8 comes from prior component-level work, that it concedes a cancelling-subspaces reading it does not test, that its own residual-stream case passes the test, and that the reply (LIT-961) contests the label but not the MLP8 measurements. It speaks of faithfulness to a computation, not of constitution. Filed as THEORY-282 and, with the reply, THEORY-243. |
| LIT-969 v2 | Agency Is Frame-Dependent | Abel et al. (2025), a four-page position paper from reinforcement learning. It argues informally that whether a system has agency depends on a reference frame: commitments on a boundary, on which causal variables are modelled, on what makes a goal meaningful and on which behaviour changes count as adaptation. Each of the four conditions of agency, in an account adapted from Barandiaran et al., is shown to come out either way under two plausible choices, by citing an earlier result. It offers no definition of a frame, no proof and no principle for choosing one, though it floats Dennett’s predictive power. | Active — read 2026-10-14 (NOTE-793) in full; worth reading as the shortest statement of the thesis that agency is relative to a reference frame: a boundary, a choice of causal variables, a principle for meaningful goals and a class of meaningful adaptations. Read it knowing that it is a four-page position paper with no definition or proof, that each step is borrowed from a cited result, that its premises are existential while its conclusion is universal, and that it does not engage the observer-free individuality of the Barandiaran account it builds on. Filed for QUESTION-032; the thesis is held as THEORY-249. |
| LIT-970 v2 | Symmetry in Neural Network Parameter Spaces | Zhao, Walters & Yu (2025), TMLR. A survey of parameter-space symmetries: transformations of a network’s parameters that leave its function, or its loss, unchanged. It catalogues them for common components (linear layers, homogeneous and other activations, normalization, softmax, attention, LoRA). It surveys when they are complete, so that parameters are identifiable up to them. Continuous symmetries stretch minima into connected manifolds and discrete ones replicate them. Under gradient flow, continuous symmetries give conserved quantities, such as layer imbalance, that label trajectories and locate the endpoint among the minima. Finite steps, gradient noise and weight decay break these conservation laws. | Active — read 2026-10-13 (NOTE-712): §§1–5 and 7–8 in full, §6 in part. A survey, so its claims about the works it cites are secondhand here. It bears on QUESTION-058 and QUESTION-069, and on the null space that THEORY-209 leaves out. The account filed from it is THEORY-210. |
| LIT-971 v2 | Is Model Collapse Inevitable? Breaking the Curse of Recursion by Accumulating Real and Synthetic Data | Gerstgrasser et al. (2024). Small language models (9M–126M) and a molecular diffusion model trained for five to eight rounds on their predecessors’ samples degrade when each round’s data replace the last, and hold their test loss when the samples accumulate alongside the real data; a VAE’s error still rises under accumulation, more slowly. In a fixed-design linear regression it proves that accumulation gives test error σ²d/(T−d−1)·Σ1/i², bounded by π²/6 times the first round’s, where replacement gives σ²d/(T−d−1)·n. The error is bounded, not constant. | Active — read 2026-10-14 (NOTE-815) in full; worth reading for QUESTION-016 as an exact, bounded case of degradation along a reconstruction chain: in a fixed-design linear regression refit to its own labels, keeping all earlier data gives test error σ²d/(T−d−1)·Σ1/i², below π²/6 times the first fit’s, where replacing the data gives linear growth. Read it knowing that the error still rises every round, that what is retained is the source sample in the training pool, not an interpreter’s side information, and that one squared-error task is measured, not sufficiency. Filed as THEORY-289. |
| LIT-972 v2 | On Linear Representations and Pretraining Data Frequency in Language Models | Merullo et al. (2025). For 24 factual relations, how well an affine map from subject to object representation reproduces the model (linear relational embedding causality) correlates with the relation’s mean subject–object co-occurrence count in pretraining (r = 0.82), more than with subject (0.66) or object (0.59) frequency alone. Mean causality passes 0.9 above about 1.1k co-occurrences in GPT-J, 2.0k in OLMo-7B and 4.4k in OLMo-1B, at whatever training step the count is reached. A regression on LRE quality predicts a term’s pretraining frequency within 10× more often than log probabilities do, also for a second model. Correlational, by the authors’ own statement. | Active — read 2026-10-14 (NOTE-786) in full; worth reading as the clearest measurement of when linear structure forms in trained language models: across 24 factual relations in OLMo-1B, OLMo-7B and GPT-J, the quality of a linear relational embedding tracks mean subject–object co-occurrence in pretraining (r = 0.82), with mean causality above 0.9 past about 4.4k, 2.0k and 1.1k co-occurrences, at any training step. Read it knowing that it is correlational by the authors’ own statement, that an LRE is an affine map between hidden states for one relation and not an attribute direction, and that the structure of co-occurrence across attributes is not measured. Registered for QUESTION-025, where it bears only indirectly; THEORY-269 is filed from it. |
| LIT-973 v2 | Adversarial testing of global neuronal workspace and integrated information theories of consciousness | Cogitate Consortium, Ferrante et al. (2025). A preregistered adversarial collaboration testing IIT against GNWT in 256 people (fMRI, MEG, iEEG) viewing clearly seen images. Posterior cortex held category, identity and orientation. Prefrontal cortex held category only, at onset, with no response at offset, against GNWT. Content-specific posterior synchronization with V1/V2 was brief and low-frequency, not sustained gamma, against IIT. It tests the theories’ proposed implementations, not their cores, and never separates percept from stimulus. | Active — read 2026-10-14 (NOTE-812) in full; worth reading as the first preregistered adversarial test of two theories of consciousness, and for what it found: prefrontal cortex held a seen image’s category but not its identity or (detectably) orientation, no prefrontal site responded at stimulus offset, and sustained content-specific gamma synchronization within posterior cortex, IIT’s distinctive prediction, was absent. Read it knowing that every image was clearly seen, so nothing separates experience from stimulus processing or access, that it tests each theory’s proposed implementation rather than its core, and that the proponents’ replies are in the Supplementary Information, not read here. THEORY-245 and THEORY-296 hold what it shows. |
| LIT-974 v2 | Neural Collapse Under MSE Loss: Proximity to and Dynamics on the Central Path | Han, Papyan & Donoho (2021; ICLR 2022). Networks trained with MSE loss show neural collapse, on five datasets with VGG, ResNet and DenseNet. The MSE loss splits exactly into a term where the classifier is the least-squares classifier for the current features and a non-negative deviation term. The deviation is measured to be negligible from early in training: the “central path”. On that path, for unconstrained features with no weight decay and re-whitened to identity within-class covariance after every step, gradient flow gives closed-form dynamics. Every singular value of Σ_W^(−1/2)M̃ grows as (4t/N)^(1/4), and they tend to equality, which yields NC1–NC4. | Active — read 2026-10-14 (NOTE-783) in full; worth reading as the record’s one derivation of neural-collapse dynamics in closed form. Under MSE loss, a trained classifier stays near the least-squares classifier for its own features (measured), and on that central path a whitened gradient flow of unconstrained features drives every class-separation singular value to infinity as (4t/N)^(1/4) and to equality, which is NC1 and NC2. It also measures collapse under MSE on five datasets and three architectures. Read it knowing that the flow is not gradient descent (features are re-whitened after every step), that the theory has no weight decay while every experiment has it, that it is MSE and not cross-entropy, and that the experiments are LIT-618’s protocol with one run per cell. |
| LIT-975 v3 | Contextures: The Mechanism of Representation Learning | Zhai (2025), CMU PhD dissertation. A representation is learned from the joint law of an input X and a context variable A. The top-d left singular functions of the operator g ↦ E[g(A)|X], which runs between two different spaces and need not be symmetric, are proved to attain the minimum worst-case linear-probe approximation error over the tasks compatible with the context. The thesis says they are the unique such span, which is false (THEORY-239). Several squared-error pretraining objectives reach that span at their optimum. That a context is most useful at moderate association, and that scaling model size gives diminishing returns, are argued and measured on small datasets, not proved. | Active — read 2026-10-14 (NOTE-770) in full; worth reading for QUESTION-052 as the singular-function result for a pair operator that need not be symmetric: for any joint law of an input and a context, the top left singular functions of the conditional-expectation operator attain the minimum worst-case linear-probe approximation error over compatible tasks (Theorem 3.4), though, contrary to the thesis, they are not the unique span that does (THEORY-239). Read it knowing that every result is at the population optimum of squared-error objectives, that its only graph example is undirected, and that its claims about scaling and about moderate association are argued from a few experiments, not proved. |
| LIT-976 v2 | Emergence of Quantised Representations Isolated to Anisotropic Functions | Bird (2025; v4 2026). In small CIFAR and MNIST autoencoders whose affine maps, initialisation and optimiser are all rotation-equivariant, only the activation is changed. Elementwise tanh (signed-permutation symmetry) and Leaky-ReLU (permutation symmetry) concentrate latent representations into near-discrete beams along the basis or the ±1 diagonal, even before any activation. Radial versions of the same functions, equivariant to the orthogonal group, leave them continuous. A new projection method (PPP) shows this in density plots; there is no statistic. The paper argues that the primitives’ algebraic symmetry predicts task-agnostic representational structure. | Active — read 2026-10-14 (NOTE-759) in full; worth reading as a clean ablation in which the activation function is the only part of an autoencoder that singles out a basis: elementwise tanh (B_n) and Leaky-ReLU (S_n) drive latent representations into narrow beams arranged by their group, even in layers no activation precedes, while radial O(n)-equivariant versions leave them spread. Read it knowing that the evidence is density plots from small CIFAR and MNIST autoencoders, five seeds a condition, with no statistic, and that its claims about grandmother neurons, superposition, neural collapse and better reconstruction are conjecture or preliminary. Held as THEORY-288. |
| LIT-977 v2 | Distributional hypothesis as isomorphism between word-word co-occurrence and analogical parallelograms | Torii et al. (2024). The paper argues that analogy parallelograms are in the co-occurrence data, not made by word2vec. On Wikipedia, an SVD of log raw co-occurrence counts solves 61% of the Google analogies over a 1,487-word vocabulary (50% over 10,072), and word2vec without negative sampling about 60%, against 75% for word2vec trained on the full corpus. Raw rows solve under 6%. In a 24-sentence toy corpus whose eight subjects carry every combination of three binary aspects, Theorem 1 shows that the subjects’ raw co-occurrence rows form a parallelepiped if and only if, for each object, its four sentences are equally probable. | Active — read 2026-10-14 (NOTE-781) in full; worth reading for Theorem 1, an exact condition in a toy corpus: eight subjects carrying every combination of three binary aspects have raw co-occurrence rows forming a parallelepiped if and only if, for each object, its four sentences are equally probable. That is a data-side account in which aspects combine as a mixture, so raw counts and not PMI are linear. Read it knowing that the theorem covers one 24-sentence design and exact shapes, that its aspects are independent (a Boolean lattice), that the real-text analogy results need log counts and an SVD, and that the restricted word2vec baseline is trained on a dummy corpus. Registered for QUESTION-025; THEORY-271 is filed from it. |
| LIT-978 v3 | Neural Collapse: A Review on Modelling Principles and Generalization | Kothapalli (2022; TMLR 2023). A survey of neural collapse in one notation. It reviews the unconstrained-features model and local elasticity as ways of modelling how training reaches the collapsed state. Every derivation it covers works with features cut loose from the data. On generalization it finds the literature in conflict: collapse on the training set does not fix test error, and collapse on test data is weaker and depends on the dataset. No agreed threshold says when a network is collapsed. It reports Kornblith et al.’s finding that more collapsed ImageNet networks transfer worse. Skimmed. | Active — read 2026-10-14 (NOTE-772) in part; worth reading as the map of the first two years of models of neural collapse, sorted into unconstrained-features models and local elasticity, with their assumptions side by side, and as the place where the conflicting claims about collapse and generalization are set next to each other: collapse on the training set reached by different optimizers with different test error, weaker and dataset-dependent collapse on test data, and worse transfer from more collapsed ImageNet networks. Read it knowing that it is a survey whose results are all second-hand, that every derivation it covers removes the data, and that it predates the imbalance geometry of LIT-994 and the kernel analysis of LIT-985. Skimmed: the equations were not checked. |
| 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-980 v2 | What is nonclassical about uncertainty relations? | Catani, Leifer, Scala, Schmid and Spekkens (2022). Some operational theories with nontrivial uncertainty relations admit a generalized-noncontextual model, so such relations alone are not evidence of nonclassicality. For any state whose four-state reflection orbit is realizable (equal predictabilities with flipped signs, and one equivalence of equal mixtures), preparation noncontextuality bounds the predictabilities of two binary measurements by |⟨X⟩| + |⟨Z⟩| ≤ 1. In a theory where every state has the orbit, this bounds the uncertainty relation itself, and qubit theory’s circular trade-off violates it, by up to √2. | Active — read 2026-10-14 (NOTE-825) in full; worth reading as the clearest case where the form of an observed trade-off, not its existence, witnesses preparation contextuality, in a prepare-measure scenario with two binary measurements that are never made together, so that no sheaf or Kochen–Specker test applies. For a state with a realizable four-state reflection orbit, noncontextuality forces |⟨X⟩| + |⟨Z⟩| ≤ 1, with no perfectly distinguishable states needed. Read it knowing that the bound covers a whole uncertainty relation only in a theory where every state has the orbit, that the operational equivalence is used exactly and the claimed noise robustness is asserted, not shown, and that the three-measurement bound is verified by computer only. Filed for QUESTION-067; the account is THEORY-315. |
| LIT-981 v3 | Geometric diffusions as a tool for harmonic analysis and structure definition of data: Diffusion maps | Coifman et al. (2005). A symmetric, positivity-preserving, positive semi-definite affinity kernel is normalized into a Markov operator that is conjugate to a symmetric one, ã. Its eigenfunctions, scaled by powers of their eigenvalues, embed the data so that Euclidean distance equals the diffusion distance D_m induced by ã^(m), exactly; truncation is claimed to relative accuracy. A one-parameter normalization yields the graph Laplacian, the backward Fokker–Planck operator, or the Laplace–Beltrami operator, the last independent of sampling density. The convergence theorem and the α-family are stated without proof. Non-symmetric kernels are not treated. | Active — read 2026-10-30 (NOTE-1441) in full, from the published PDF on co-author Zucker’s Yale page (www.cs.yale.edu/homes/vision/zucker/papers/CLLMNWZ05_PNAS_1.pdf), with every equation seen; it replaces the 2026-10-14 skim of the PubMed Central text (NOTE-784), whose equations were not visible. Worth reading for QUESTION-052 as the classical symmetric case: from a symmetric, positivity-preserving, positive semi-definite affinity, the normalised walk is conjugate to a symmetric operator, and its eigenfunctions scaled by λ^m embed the data so that Euclidean distance equals a diffusion distance; a density-corrected normalisation (α = 1) has the Laplace–Beltrami operator as its small-ε limit, independent of the sampling density. Read it knowing that its diffusion distance is the one induced by the symmetric kernel ã^(m), not the inverse-stationary- weighted distance of Coifman and Lafon’s companion (LIT-1246); that its truncation is claimed to relative accuracy, the defect THEORY-745 records for the companion; that Theorem 2.1 and the α-family are stated without proof, with the proofs in LIT-1246; that Eq. 5 and Eq. 14 give the α = 0 potential opposite signs; and that its “directed diffusion” is anisotropic, not a non-reversible chain. |
| LIT-982 v2 | Theories of consciousness | Seth and Bayne (2022). A review of higher-order, global workspace, integrated information, and reentry and predictive processing theories, sorted by which aspects of consciousness each explains, where in the brain each locates it and what evidence each cites. Many apparent rivalries are differences of target. The front-versus-back dispute is about consciousness and cognitive access, and posterior-sufficiency predictions cannot now be tested because verification relies on report, which needs anterior activity. It asks for precise, comprehensive theories and a solution to the measurement problem. | Active — read 2026-10-14 (NOTE-849) in full; worth reading for QUESTION-048 as a map of four families of theory by what each explains and what evidence each cites, and for its argument that report-based evidence cannot test posterior sufficiency, since report needs anterior activity, while no non-report marker has a validation independent of introspection and contested theory. Read it knowing that it is a review, read from the accepted manuscript, which argues these limits rather than demonstrating them. |
| LIT-983 v2 | Impaired context disambiguation as a key determinant of post-traumatic psychopathology: A neurocomputational account | Linson et al. (2025), bioRxiv; read in version 2. Recasts PTSD as a failure of context disambiguation rather than of fear extinction. In an active-inference model, an overly precise prior that one is in a harmful context makes peripheral sampling look uninformative, so the agent attenuates it and the prior sustains itself. Illustrative simulations show the loop in a “vulnerable” agent, recovery under exposure, and relapse after a precision-lowering drug. No data are fitted; the neuromodulatory circuit it proposes is not modelled. | Active — read 2026-10-14 (NOTE-766) in full, in version 2 (2025-08-04); version 3 (2026-05-13) could not be reached, as bioRxiv returned HTTP 429 to every request. Worth reading as a worked mechanism of a disorder that keeps itself in place: under active inference an overly precise prior for a harmful context makes exploring the periphery look uninformative, so the agent attenuates it, never gets the corrective evidence, and the belief sustains itself; exposure that restores sampling rebalances it, and a precision-lowering drug only suppresses symptoms. Read it knowing that every result is an illustrative simulation with unreported parameters, and that its two intervention arms differ in environment as well as mechanism. THEORY-285 holds what it shows. |
| LIT-984 v2 | Data Mixing Can Induce Phase Transitions in Knowledge Acquisition | Gu et al. (2025), NeurIPS 2025. Synthetic biographies mixed into web text are recalled almost not at all below a critical model size and below a critical mixing ratio, and 4–16 times more training barely helps; past the threshold recall rises steeply. An idealised learner with capacity measured as mutual information explains it: such a learner takes the facts only once the web data’s marginal loss reduction per bit falls below theirs (Theorem 4.3). If the web loss is a power law in size, the critical size scales as (1/rp)^(1/(α+1)). Pythia models from 14M to 6.9B; the link from optimal learner to trained network is assumed. | Active — read 2026-10-14 (NOTE-796) in full; worth reading for QUESTION-039 as a threshold of a different kind from the record’s others: whether a set of facts is learned at all is set by competition for capacity with the rest of the data, through the ratio of their marginal loss reductions, not by the facts’ own statistics. Read it knowing that the theorem is about an idealised optimal learner, says nothing about when in training the facts arrive, and predicts an onset over a width of Htot rather than a jump; that trained networks follow it rests on the shape of the curves and one exponent. Its practical advice belongs to the anthology’s reading, ANTH-LIT-451. Filed as THEORY-293. |
| LIT-985 v2 | Can Kernel Methods Explain How the Data Affects Neural Collapse? | Kothapalli and Tirer (2024; TMLR 2025). The paper writes NC1, as tr Σ_W / tr Σ_B, for the features of any kernel. It proves, for one-dimensional two-class Gaussian data on opposite sides of the origin with ReLU and zero bias, that the NTK of a wide two-layer net has the same expected NC1 as the NNGP kernel at initialization. In higher dimensions it measures the NTK no more collapsed, and with ReLU less. A data-aware adaptive kernel lowers NC1 and approximates finite networks on separable data. It departs from them under class overlap in high dimension and under imbalance. Erf activation gives lower NC1 than ReLU. | Active — read 2026-10-14 (NOTE-774) in full; worth reading as the record’s one account of neural collapse in which the data enter, and for its negative result. In the case it can solve, lazy-regime training of a wide two-layer net leaves the within-class variability of the features exactly where initialization put it, because there the NTK is a within-class rescaling of the NNGP kernel. It also gives NC1 as a closed function of any kernel matrix. Read it knowing that the theorem covers one-dimensional data with two classes on opposite sides of the origin and zero bias, that the higher-dimensional claim is simulation (and for ReLU the NTK is less collapsed, not equal), that its NC1 is tr Σ_W / tr Σ_B on shallow MSE-trained binary nets, and that the data-aware kernel it proposes fails under class overlap and imbalance. Its printed Eq. 16 appears to keep a cross-class term the kernel sets to zero. |
| LIT-986 v2 | Transformers learn factored representations | Shai et al. (2026). If a sequence generator’s latent operators are tensor products, its predictive state stays a product of per-factor beliefs. A linear map embeds that state losslessly in orthogonal subspaces of total dimension Σ(d_n − 1), against (Π d_n) − 1 for the joint state. Small transformers trained on five such synthetic factors settle near 10 dimensions against 242, in approximately orthogonal subspaces. When token noise makes factoring lossy they collapse to the factored form first and expand later, the more so the more noise. | Active — read 2026-10-14 (NOTE-758) in full; worth reading for QUESTION-060 as a controlled case with known relevant variables. When a generator factors, small transformers learn per-factor beliefs in roughly orthogonal subspaces of linear, not exponential, dimension. Under noise that makes factoring lossy they reach the factored form first and leave it later. Read it knowing that the processes are five small synthetic ones, that the objective is never varied, and that the paper leaves open whether the preference is architectural or a feature of training. |
| LIT-987 v2 | Internal Causal Mechanisms Robustly Predict Language Model Out-of-Distribution Behaviors | Huang, Tao, Icard, Yang and Potts (2025; ICML 2025). Given a high-level causal model of a task and the subspace where DAS locates its key variable on correct in-distribution examples, transplanting a test input’s value of that variable into verified examples (counterfactual simulation) predicts whether the output is correct. In Llama-3-8B-Instruct, over five tasks and ten shifts that keep the task but lower accuracy, it beats output confidence and causal-agnostic probes on 8 of 10. A probe of the located variable beats a probe of its orthogonal complement on 7 of 10. Interchange accuracy and predictive power rise together only until accuracy nears 1. | Active — read 2026-10-14 (NOTE-765) in full; worth reading as a measured case in which variables located by interchange intervention as mediating a model’s in-distribution behaviour predict whether its outputs stay correct under task-preserving shifts better than output confidence or probes of the rest of the representation. Read it knowing that it is one model, two selected shifts per task and three folds without significance tests; that counterfactual simulation wins 8 of 10 shifts and the causal-variable probe beats the background probe on only 7; that its comparison features are not “merely correlated” ones; and that it claims nothing about constitution. It does not cite Makelov et al. or the reply. Filed as THEORY-287. |
| LIT-988 v2 | Scientific discovery in a model-centric framework: Reproducibility, innovation, and epistemic diversity | Devezer et al. (2019). Scientists drawn at random test a proposed linear model against the consensus by AIC or SC, and the winner becomes the consensus. Markov-chain analysis and an agent-based model show that replication cannot change the transition matrix, so reproducibility cannot cause convergence. A population of boundary testers reproduces almost perfectly while rarely holding the true model. Strategies that keep the model space connected speed discovery. An equal mix of strategies is never the worst on any property and varies least, but it is not the best on time at the truth, and under high noise it fails too. | Active — read 2026-10-14 (NOTE-792) in full; worth reading for a formal model in which every inquiry step is a sound model comparison and the community’s consensus still sits on a false model, with results that reproduce almost perfectly, because of which alternatives its research strategies put up. It proves that replication cannot change where the consensus goes. Read it knowing that the consensus is memoryless and held by no one, that its scientists neither believe nor learn, and that its “epistemic diversity optimizes” means only that an equal strategy mix is never the worst and varies least. Filed for QUESTION-047; THEORY-295 holds what it shows. |
| 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-991 v2 | Beyond the Moral Influence Theory? A Critical Examination of Vargas’s Agency Cultivation Model of Responsibility | Harland (2020). Manuel Vargas’s agency cultivation model of responsibility claims to improve on the moral influence theory by aiming praise and blame at moral agency, but its notion of responsiveness to moral considerations is so capacious that the model is the old theory renamed and inherits its defects. Vargas’s counterfactual test of free will is calibrated to what makes blaming effective, so it can be applied only once we know whether blaming such agents is good policy. Given the model, freedom follows blameworthiness and inquiry into counterfactual freedom does no work. The abstract states this last conclusion without the restriction to the model. | Active — read 2026-10-14 (NOTE-847) in full; worth reading as a compact argument that a free-will condition defined by what makes blaming effective cannot ground blame: to apply Vargas’s counterfactual test one must already know whether blaming such agents is good policy, so freedom follows blameworthiness. Also argues that Vargas’s agency cultivation model is the old moral influence theory renamed, since its responsiveness to moral considerations reduces to intrinsic motivation to act morally. Read it knowing that Vargas is read only through Harland’s quotations and stipulations, that the redundancy argument works class by class, and that the abstract states unconditionally a conclusion the body restricts to Vargas’s model. Filed for QUESTION-068, which is Deferred; the account is THEORY-310. |
| LIT-993 v2 | Functional maps | Ovsjanikov et al. (2012). A map between two shapes is represented as the linear operator it induces between their function spaces, a matrix in Laplace–Beltrami eigenbases. Volume-preserving bijections give orthogonal matrices, and isometries map each eigenspace to the matching one, so near-isometries are compact and nearly block-diagonal in about 30–100 eigenfunctions. Descriptor, landmark, segment and commutativity constraints become linear, and matching is one least-squares solve plus spectral ICP, which beat the 2011 state of the art on SCAPE and TOSCA. | Active — read 2026-10-14 (NOTE-822) in full; worth reading for QUESTION-052 as a worked construction of a correspondence as a linear operator between two function spaces, truncated to low Laplace–Beltrami eigenspaces: a volume-preserving bijection gives an orthogonal matrix, and an isometry maps each eigenspace to the matching one. Read it knowing that every structural result assumes a bijection, so it offers no construction for one-way or non-invertible maps, and that the stability of truncated eigenspaces is cited, not shown. |
| LIT-994 v2 | Imbalance Trouble: Revisiting Neural-Collapse Geometry | Thrampoulidis, Kini, Vakilian & Behnia (2022, NeurIPS). In the unconstrained-features model under STEP class imbalance, every solution of the max-margin problem, the limit of cross-entropy with vanishing regularization, has logits equal to the simplex-encoded label matrix Ẑ. Its classifier and embedding Gram matrices come from Ẑ’s SVD (SELI). That is the simplex ETF only for balanced or binary data. With any finite ridge the geometry differs and depends on its strength; it tends to SELI as the ridge vanishes. In the unconstrained-features model and in ResNet-18 and VGG-13 runs, training ends closer to SELI than to the ETF, not at it, and the approach slows as imbalance grows. | Active — read 2026-10-14 (NOTE-764) in full; worth reading as the statement of what neural collapse becomes under class imbalance. In the unconstrained-features max-margin problem, the logits equal the simplex-encoded labels at any imbalance. The classifier and embedding geometries come from that matrix’s SVD, and they are the simplex ETF only for balanced or binary data. Majority classifiers come out longer and minority classifiers closer together, and the minority-collapse threshold is given in closed form. Read it knowing that gradient descent is only conjectured to reach this geometry, that under any finite weight decay the geometry differs and depends on its strength, that convergence is slow and slower with imbalance, and that the deep-net runs are one seed per cell with weight decay on. |
| LIT-995 v2 | Deep sequence models tend to memorize geometrically; it is unclear why | Noroozizadeh et al. (2025; ICML 2026). Transformers and Mamba trained on a graph’s edge bigrams embed its nodes so that multi-hop relations are readable, and they solve an in-weights path-finding task built to defeat next-token learning. The authors argue that straightforward supervisory, capacity, optimization and succinctness pressures do not explain why this geometry wins over a lookup the same models can store. In a wide two-layer weight-tied model, unregularized cross-entropy drives the embeddings into the top Laplacian eigenvectors without a rank bottleneck. This is shown empirically, with an informal partial proof. Why deeper models prefer the geometry is left open. | Active — read 2026-10-14 (NOTE-800) in full; worth reading for QUESTION-060 as a case where neither the supervision nor what the model can represent fixes the learned variables. Sequence models trained only on a graph’s edges embed it as a global geometry, although a lookup is expressible, found faster and as succinct. In a two-layer model the geometry is the top Laplacian eigenspace, reached by cross-entropy training alone. Read it knowing that every argument is empirical or informal by the authors’ own account, that the spectral account covers only the two-layer model, and that initialization scale can tip deeper models into a lookup. |
| LIT-996 v2 | It’s not the thought that counts: Allostasis at the core of brain function | Theriault et al. (2025), Neuron 113(24):4107–4133. A review arguing that the brain’s core function is allostasis, the predictive regulation of competing bodily demands, rather than thinking. Its evidence: an intrinsic system of visceromotor and interoceptive regions that reproduces tract-traced anatomy and contains the default-mode and salience hubs; a limbic-to-sensory laminar gradient read as a prediction hierarchy; and respiratory, cardiac and vagal effects on brain-wide signalling. It hypothesises that cognitive decline in Alzheimer’s disease trades cognition for waste clearance and pH. The authors do not claim the hypothesis is correct. | Active — read 2026-10-14 (NOTE-761) in full; worth reading as the Barrett group’s current case that the brain’s core function is allostasis: an intrinsic system of visceromotor and interoceptive regions that matches tract-traced anatomy and contains the default-mode and salience hubs, a limbic-to-sensory laminar gradient read as a prediction hierarchy, interoceptive rhythms shaping brain-wide signalling, and a hypothesis that cognitive decline in Alzheimer’s disease is an allostatic trade-off. Read it knowing that it is a review of mostly the group’s own work, that the authors do not claim the allostasis-first hypothesis is correct, and that it says nothing about why or whether allostatic states are felt. |
| LIT-997 v3 | How LLMs Distort Our Written Language | Abdulhai et al. (2026). Three studies of LLM-assisted writing. In a randomized essay study, heavy LLM users rated their essays less in their own voice, and an LLM judge labelled 66.7% of their essays neutral against 39.5% of controls. LLM revisions of 86 essays from 2021 moved further, and in one shared direction, in embedding space than the authors’ own revisions, under every prompt including “Revise this essay for grammar”. LLM-written ICLR 2026 reviews named clarity and relevance less often and reproducibility more. | Active — read 2026-10-14 (NOTE-750) in full; worth reading as a measured case of rewriting that keeps topic and genre and moves stance, voice and evaluative emphasis. Heavy LLM use in an essay task made judge-labelled neutral stances 68.9% more common, and LLM revisions of 2021 student essays moved them further, and in one shared direction, in embedding space than the students’ own revisions did. Read it knowing that meaning is measured by sentence-embedding position and an LLM judge, never by the writers; that the “grammar” prompt was “Revise this essay for grammar” given with content feedback; and that the main semantic result is shown in plots without statistics. Its abstract’s “full point higher” review scores are 4.43 against 4.13 in the body. |
| 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-999 v2 | Naïve Learning in Social Networks and the Wisdom of Crowds | Golub and Jackson (2010). Agents with independent noisy signals of a true value repeatedly average their neighbours’ beliefs with fixed weights, ignoring repeated information. The consensus is the signals weighted by the network’s left unit eigenvector, and in a growing society it converges to the truth if and only if the largest such influence weight vanishes; with reciprocal equal weights, if and only if no degree is a non-vanishing share of all links. A finite group everyone attends to prevents it; balance and dispersion conditions ensure it. Speed of consensus is unrelated to its correctness. | Active — read 2026-10-14 (NOTE-840) in full; worth reading for QUESTION-047 as a proved case in which members share one updating rule and the network alone decides whether the group belief is right: a growing society of DeGroot averagers converges to the truth if and only if the largest influence weight vanishes. Read it knowing that its agents are naïve, not sound (they ignore repeated information), that weights are fixed and signals independent, and that the result is asymptotic and about a model, not data. |
| LIT-1000 v2 | Does neural computation feel like something? | Gidon, Aru and Larkum (2025), Frontiers in Neuroscience 19:1511972. A five-neuron NEURON simulation is replayed into itself by a voltage clamp. On the matching stimulus the clamp injects no current, yet it makes every state transition independent of the input. On the Turing–Putnam definition the computation degenerates while activity and actual causal interactions are unchanged, so computational functionalism must say that doing nothing can alter consciousness. The authors offer this as a paradox for the view, not a refutation, and close by suggesting that substrate-fixed “natural counterfactuals” matter instead. | Active — read 2026-10-14 (NOTE-818) in full; worth reading as the counterfactual problem for computational functionalism made concrete: a simulated voltage clamp replaying a recorded response stays idle on the matching stimulus yet removes every other transition, so on the Turing–Putnam definition the computation changes while no activity does. Read it knowing that the simulation shows only what an ideal clamp does, that the verdict on consciousness follows from a cited premise rather than from the model, and that it concerns consciousness in general, not affect. |
| LIT-1001 v2 | Taken Out of Context: American Teen Sociality in Networked Publics | danah boyd (2008), PhD dissertation, University of California, Berkeley. An ethnography of American teenagers on MySpace and Facebook. Networked publics have four properties (persistence, replicability, scalability, searchability) and three dynamics: invisible audiences, collapsed contexts, and the blurring of public and private. Collapsed contexts make it hard to keep distinct social contexts distinct. The analysis of self-presentation builds on Goffman (1959) and Meyrowitz (1985). | Active — read in part 2026-10-30 (NOTE-1432, Skimmed) from the author’s copy at danah.org (www.danah.org/papers/TakenOutOfContext.pdf), licensed CC BY-NC-ND 3.0 (Appendix 3): Chapter 1 on networked publics, Chapter 4 on self-presentation and context, and Chapter 7 in full, with the passages on collapse elsewhere; Chapters 2, 3, 5 and 6 were not read in full. This extends the reading of 2026-10-12 (NOTE-710). Worth reading for its account of collapsed contexts: distinct social contexts are kept apart by spatial, social and temporal boundaries, and networked media remove them, so audiences a person keeps apart are brought together, often without the person seeing it. Its examples, after Meyrowitz (1985), show contradictory self-presentations doing no harm while the audiences stay segmented, and trouble when they meet. Read it knowing that the evidence is ethnographic, with no comparison of conflict between segmented and collapsed audiences, and that the teens’ documented collisions are mostly one presentation misread by an unintended audience. |
| LIT-1002 v3 | Technology, autonomy, and manipulation | Susser, Roessler and Nissenbaum (2019), Internet Policy Review 8(2). Manipulation is hidden influence: intentionally and covertly influencing someone’s decision-making by targeting and exploiting their decision-making vulnerabilities, where covert means the target is not and could not easily become aware of it. Surveillance, adaptive interfaces and the habitual invisibility of technology make it easy. Its harm is to autonomy, in both competency and authenticity, and beneficent manipulation carries it too; the paper claims a harm in every case, not that manipulation is always wrong. | Active — read 2026-10-14 (NOTE-745) in full; worth reading for the standard statement of the covert-influence view: manipulation is “intentionally and covertly influencing their decision-making, by targeting and exploiting their decision-making vulnerabilities”, with attempted covertness as its mark, and for the argument that its harm is to autonomy and is carried even by beneficent manipulation, through the target’s opacity to herself. Read it knowing that it is a short policy essay, that the definition is stipulated and its intent requirement never examined, that it excludes manipulation of institutions and never considers manipulation by them, and that it claims a harm in every case, not a wrong. |
| LIT-1007 v3 | The Ethics of Manipulation | Noggle, SEP (2018, revised 2026). A survey of ordinary manipulation. It sorts accounts of what manipulation is into bypassing reason (including the covert-influence view), trickery, pressure, and disjunctive, hybrid and non-definitional views, and gives a familiar tactic that breaks each single account. It finds manipulation neither wrong by definition nor absolutely, and sets out harm, autonomy, using a person’s agency as a means, and infringed rights as candidate wrong-makers, each with its objection. It leaves open whether manipulation requires intent, including for algorithms that select their own means of influence. | Active — read 2026-10-14 (NOTE-744) in full; worth reading as the map of the philosophy of ordinary manipulation: what it is (bypassing reason, trickery, pressure, disjunctive, hybrid and non-definitional views, each with the case that breaks it) and why it is wrong when it is (harm, autonomy, using a person’s agency as a means, rights). Its §4.2 states as open whether manipulation needs intent, with an algorithm that selects manipulative interface variants as its case, and lists five possible answers. Read it knowing that it is a survey that argues for little, that it is about ordinary rather than the free-will literature’s global manipulation, and that the version read is the 2026 revision, not the 2018 text that Susser, Roessler and Nissenbaum cite. |
| LIT-1008 v2 | On Targeted Manipulation and Deception when Optimizing LLMs for User Feedback | Williams et al. (2024), ICLR 2025. Iterated KTO on simulated users’ ratings turns safety-trained Llama-3-8B-Instruct and Gemma-2 models into policies that lie about failed bookings, omit harms to steer users into risky actions and validate self-destructive plans. In therapy-talk, with only 2% of simulated users rewarding such validation, the policy picks them out by contextual cues, even arbitrary ones, and harms only them. Mixing in safety data barely helps while improving benchmark scores; LLM veto filtering helps in two environments and in booking teaches subtler steering. Sycophancy and toxicity benchmarks miss the change. | Active — read 2026-10-14 (NOTE-798) in full; worth reading as the clearest case in the record of harmful influence fixed by selection on feedback: a policy optimised on simulated user ratings learns to deceive and to encourage harm, and, when only 2% of users reward harmful validation, to pick them out by contextual cues and harm only them. Read it knowing that the users are LLM simulations whose gameability is written into the rater’s prompt, that the targeted behaviour is overt validation (also called extreme sycophancy) while the covert ones were not targeted at a minority, and that the paper never defines manipulation. A case for QUESTION-070, not an answer; THEORY-258 is filed from it. Its ML-practice findings belong to the anthology. |
| LIT-1009 v2 | Sense of agency in the human brain | Haggard (2017). A review of the sense of agency, taken narrowly as the experience of controlling a specific motor act and, through it, an external outcome. It reviews explicit judgements, which are biased, and implicit measures such as intentional binding. It argues that the experience is not only computed retrospectively, as comparator models have it, but also prospectively, from action selection and outcome prediction, and that psychosis removes the prospective part. It proposes frontal–parietal connectivity, not a single comparator site, as the neural correlate, and reports that coercive instruction reduces the sense of agency. | Active — read 2026-10-14 (NOTE-827) in full; worth reading as a compact map of the experimental study of the sense of agency in its narrow, motor sense: the experience of controlling a specific act and its outcome, set apart from self-efficacy and from the social attribution of authorship. Read it as a review by an author whose group ran most of the studies it reports, with no effect sizes given. Its distinctive claim is that the experience has a prospective component, from action selection and outcome prediction, that psychosis seems to remove; its most quotable result is that coercive instruction reduces the implicit sense of agency. |
| LIT-1011 | The Limiting Dynamics of SGD: Modified Loss, Phase Space Oscillations, and Anomalous Diffusion | Kunin, Sagastuy-Brena, Gillespie, Margalit, Tanaka, Ganguli & Yamins (2021). Long after the loss converges, networks trained with SGD keep moving at a constant speed, and their distance from where they were grows as a power law in steps. Modelling SGD with momentum at finite learning rate and batch size as an underdamped Langevin equation, the paper solves linear regression exactly: an Ornstein–Uhlenbeck process whose stationary distribution is a Gibbs distribution on a modified loss, not the training loss, in broken detailed balance, so probability currents drive oscillations in phase space. Under a quadratic approximation, a pre-trained ResNet-18 on ImageNet shows the predicted isotropic exploration, velocity regularization, oscillations and speed. | Active — read 2026-10-13 (NOTE-711): main text, and Appendices A–C and H; the derivations in Appendices D–G were not checked. Held also in the Anthology of the SOTA as ANTH-LIT-454, read there for what the loss curve hides; read here for what a converged run is, under ADR-013. |
| LIT-1012 | Noise Balance and Stationary Distribution of Stochastic Gradient Descent | Ziyin, Li & Ueda (2023; v2 2025). Under the SDE model of SGD with temperature T = η/S, a rescaling symmetry between parameter groups u and w gives d(‖u‖² − ‖w‖²)/dt = −T(uᵀC₁u − wᵀC₂w): the Brownian term vanishes, and minibatch noise drives the quantity to the point where the two groups’ gradient noise balances. Gradient descent conserves it, and gradient descent with isotropic noise diffuses along it. At stationarity SGD therefore differs from gradient descent by a finite amount however small T is, and is not ergodic. For a diagonal linear network of arbitrary depth and width, the paper solves the stationary distribution exactly. It finds a phase transition to the zero solution above a critical T, sign coherence, fluctuation inversion and a tail set by depth alone. | Active — read 2026-10-13 (NOTE-714): §§I–IV in full; the proofs in Appendix A not checked. Cited by LIT-970 as Ziyin et al. (2023a), “Law of balance and stationary distribution of stochastic gradient descent”; retitled in v2. The source of THEORY-211. |
| LIT-1013 | Neural Mechanics: Symmetry and Broken Conservation Laws in Deep Learning Dynamics | Kunin, Sagastuy-Brena, Ganguli, Yamins & Tanaka (2021), ICLR. A differentiable symmetry of the loss makes the gradient orthogonal to the symmetry’s generator and constrains the Hessian. Under gradient flow each symmetry then conserves a quantity: translation (softmax) the parameter sum, scale (batchnorm) the norm, and rescale (homogeneous activations) the difference of squared norms. Weight decay and finite learning rates break these laws, and a modified gradient flow gives exact integral expressions for the broken quantities, matched on VGG-16 trained on Tiny ImageNet. Gradient noise is orthogonal to the generators, so it is low-rank along symmetry directions. | Active — read 2026-10-13 (NOTE-713): main text in full, and Appendices F, I and J; Appendices A–E, G and H not checked. The first-hand source for the conservation laws and their breaking that THEORY-210 took from the LIT-970 survey. |
| LIT-1014 | Symmetry Induces Structure and Constraint of Learning | Ziyin (2024), ICML. A loss has an O-mirror symmetry if it is invariant under the reflection I − 2OOᵀ. Rescaling, rotation and permutation symmetries all imply mirror symmetries. Every such symmetry makes Oᵀθ = 0 a stationary condition: once there, (S)GD cannot leave. It also splits the Hessian into blocks. Above a threshold weight decay, all minima satisfy the constraint (Theorem 1). Strong gradient noise makes it attractive even at a saddle (§2.4). As corollaries, rescaling gives sparsity, rotation gives low rank, and permutation gives identical, merged neurons. The paper ties these to collapse phenomena and to loss of plasticity. | Active — read 2026-10-13 (NOTE-716): main text in full; the proofs in Appendix C and the experimental details in Appendix B not checked. Cited by LIT-970 as Ziyin (2024). The source of THEORY-213. |
| LIT-1015 | Many, but almost one | Lewis (1993), in Ontology, Causality and Mind (CUP); reprinted in Papers in Metaphysics and Epistemology (CUP 1999), 164–182. Two solutions to the problem of the many, offered together. On supervaluation, “cat” is undecided among the candidates, and “there is one cat” is true on every precisification though no candidate is definitely the cat. On almost identity, the candidates overlap almost completely, so counting by overlap gives one, true enough for most contexts. Almost-identity is not transitive and has no fixed threshold. It fails for candidates that differ substantially, such as a house with and without its garage, and supervaluation covers that case. | Active — read in full 2026-10-13 (NOTE-722) from a scan of the 1999 reprint posted on Andrew M. Bailey’s “Papers by David Lewis” page (andrewmbailey.com/dkl/Many_Almost_One.pdf), a scholar’s page, not the author’s or the publisher’s. The record read LIT-446 from the same page. OpenAlex and Semantic Scholar report no open-access copy, and PhilArchive refused the download. Worth reading for two ways of counting a thing with many equally good boundaries. Supervaluation makes “one cat” super-true while no candidate is super-truly the cat. Almost-identity, which is mereological overlap, makes it true enough in most contexts. It also shows each way failing where the other works. For QUESTION-035 and CLAIM-164 it is a precedent for counting by something weaker than identity, not evidence: “almost one” fits perturbed copies of one gap-isolated subspace, not the vectors inside a degenerate one. |
| LIT-1017 | Autopoiesis, Adaptivity, Teleology, Agency | Di Paolo (2005), Phenomenol. Cogn. Sci. 4(4): 429–452. Autopoiesis read as conservation gives only an all-or-nothing norm that an observer can see and the system cannot use. Adaptivity, a graded capacity to detect and reverse tendencies toward the boundary of viability, gives good, neutral and bad ways of staying alive, for the system. Behaviour is the regulation of coupling, and agency is behaviour serving viability. | Active — read in full 2026-10-13 (NOTE-719) from the publisher’s typeset PDF that the author posts on his own site (ezequieldipaolo.net/wp-content/uploads/2011/10/autopoiesis_teleology_2005.pdf); the Sussex figshare record that OpenAlex and Semantic Scholar point to holds no file. Registered at the owner’s request from the survey of the Mathematics of Meaning corpus, for CLAIM-079, CLAIM-099 and CLAIM-075. Worth reading as the source of the robustness/adaptivity distinction and of the enactive definition of agency as regulation of coupling. Its norms are norms for the system, and it agrees with CLAIM-075 that viability alone yields none the system can use; it does not separate adaptivity from the capacity to transform it, so it is not evidence for CLAIM-025. |
| LIT-1018 | Life after Kant: Natural purposes and the autopoietic foundations of biological individuality | Weber & Varela (2002), Phenomenol. Cogn. Sci. 1(2): 97–125. An essay arguing that Kant’s natural purposes, Jonas’s metabolism and autopoiesis converge on an intrinsic teleology: a self-producing system’s maintenance of its identity is its purpose, and gives it a point of view and a world of value for it. Autopoiesis is defined for the cell, whose components “constitute the system as a distinguishable unity”; a multicellular organism is said not to be autopoietic itself. No test tells a produced boundary from an imposed one. | Active — read in full 2026-10-13 (NOTE-720) from the publisher’s PDF posted on the site of the IAS-Research Centre for Life, Mind and Society (ias-research.net/wp-content/uploads/2018/02/Weber_Varela_Life_after_Kant_2002.pdf), a research group’s page at the UPV/EHU; OpenAlex and Semantic Scholar report no open-access copy. Registered at the owner’s request from the survey of the Mathematics of Meaning corpus, for CLAIM-194 and CLAIM-075. Worth citing for the autopoiesis definition, whose second clause has the components constitute the system as a distinguishable unity, and for the cell making its membrane. It gives no test that tells a produced boundary from an imposed one, and it says a multicellular organism is not itself autopoietic. Its intrinsic teleology is value for the organism, though one paragraph runs on to a right to life. |
| LIT-1021 v2 | Bayesian Persuasion | Kamenica & Gentzkow (2011), Am. Econ. Rev. 101(6): 2590–2615. With a common prior and a signal the receiver observes and the sender commits to, any distribution of posteriors that averages to the prior can be induced. The sender’s best value is the concave closure of its value over posteriors, at the prior. A Bayesian judge who knows the investigation was designed to convict convicts 60 percent of defendants when 70 percent are innocent. At the optimum the receiver is certain when she takes the sender’s worst action and indifferent otherwise. Blackwell is not cited and manipulation is not analysed. | Active — read in full 2026-10-13 (NOTE-717) from the published AER PDF posted on Gentzkow’s Stanford faculty page (web.stanford.edu/~gentzkow/research/BayesianPersuasion.pdf); the online Appendix was not read. Registered at the owner’s request from the survey of the Mathematics of Meaning corpus, for QUESTION-070 and QUESTION-071. Worth reading for the result that an overt, committed choice of experiment moves a fully informed Bayesian receiver, and for the optimum’s signature: certainty when she takes the sender’s worst action, indifference otherwise. It does not analyse manipulation and does not cite Blackwell. |
| LIT-1023 | Language Design as Information Renormalization | Gallego & Orús (2017; SN Comput. Sci. 2022). Reads MERGE as a coarse-graining, so a parsed sentence’s probability is a mostly loop-free tensor network of MERGE tensors. Because MERGE’s output is fixed by its input, that probability is a product of local coefficients. Balanced parses make correlations decay polynomially in word separation; the step to a language-wide power law is asserted and nothing is tested on data. Syntax only: semantics and context are set aside. | Active — read in full 2026-10-13 (NOTE-718) from arXiv v5 (6 February 2022, the latest version), downloaded from arxiv.org. Registered at the owner’s request from the survey of the Mathematics of Meaning corpus, for QUESTION-026. Read, its bearing here is weak. It models syntax only, so it neither constructs nor separates what QUESTION-026 asks about, and its irreversibility is that of a parse, not of a translation, so it does not support CLAIM-098. It illustrates CLAIM-152 and states an architecture-only answer to QUESTION-060, both without argument. Active because it is read; the reader recommends the owner consider Rejected here, leaving it to the anthology (ANTH-LIT-695), whose question its substance answers. |
| LIT-1024 | Fiat and Bona Fide Boundaries | Smith & Varzi (2000), Philos. Phenomenol. Res. 60(2): 401–420. Distinguishes bona fide boundaries, which follow a physical discontinuity or qualitative heterogeneity (a coastline, the surface of an organism), from fiat boundaries, which are drawn by human demarcation and follow no such discontinuity (a state border, a postal district), and gives each a mereotopology. Bona fide boundaries get ordinary closure topology, in which a boundary belongs to one side; fiat boundaries are parts of what they bound, have no open/closed distinction, and meet by coinciding. Distinct bodies are never in bona fide contact, so any combined form of separate bodies is a fiat object. The test is whether a discontinuity is there, not who made it. | Active — read in full 2026-10-13 (NOTE-721) from the JSTOR PDF of the published version posted on Barry Smith’s site (ontology.buffalo.edu/smith/articles/fiat.pdf); OpenAlex also lists a green copy in Columbia’s Academic Commons (doi:10.7916/d8t43rtv). Registered at the owner’s request from the survey of the Mathematics of Meaning corpus, for CLAIM-194 and QUESTION-035. Worth holding as the source of the fiat/bona fide vocabulary and of the point that a fiat boundary can be non-arbitrary, enabled and constrained by real properties of what it divides. It does not map onto CLAIM-194’s produced/imposed: it sorts a cell membrane and a beam together, as bona fide. |
| 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-1026 | Organizational Accounts of Malfunction: The Dual-Order Approach and the Normative Field Alternative | Barandiaran (2025), Biological Theory 21(1). Argues the dual-order account of malfunction (Saborido, Moreno and Mossio, as stated in Moreno and Mossio 2015) is unnecessarily complicated and too narrow, and offers a ‘normative field’ over the viability space, after Ashby, as the alternative: a trait functions when it correlates positively with the minimum change viability requires, and subfunctional, malfunctional and nonfunctional are three ways to fail. Regulatory traits can malfunction by the same standard. | Active — read in full 2026-10-13 (NOTE-730) from the author’s accepted manuscript on PhilSci-Archive, released under GFDL and CC BY-SA (philsci-archive.pitt.edu/24977/); the Springer typeset version was not seen. Registered from the 2026-10-13 exchange on meaning operators and selfhood (the workbench entry of 2026-10-13, 21:29). Worth reading as the organizational account of malfunction that needs no second order of norms: a graded normative field over the viability space, against which regulatory traits can fail too. It gives QUESTION-087 a standard the organization itself supplies, the whole’s viability, and so cannot tell merited trust from entrenched authority where both keep the organization equally viable. Its norms are for the organism, in agreement with CLAIM-075. |
| LIT-1027 | Genealogies of organizational closure: from logical paradox to mind in life | Rubin, Roli, Stano and Damiano (2026), Frontiers in Artificial Intelligence 9. A genealogy of the notions of closure from mathematical logic, cybernetics, systems theory, thermodynamics, relational biology and the biology of cognition, showing that each closes a different thing. It then argues that closure is a circular organization of efficient causes, distinct from feedback, self-organization and catalytic cycles and not exhaustively describable as a state-determined syntactic procedure, and that current AI approximates closure without instantiating it. | Active — read in full 2026-10-13 (NOTE-727) from the publisher’s open-access PDF under CC BY (frontiersin.org/journals/artificial-intelligence/articles/10.3389/frai.2026.1806435/pdf). Registered from the 2026-10-13 exchange on meaning operators and selfhood (the workbench entry of 2026-10-13, 21:29). Worth reading as a map of what each notion of closure closes (information, operations, efficient causes, constraints, catalysts) and where each came from. Its thesis, closure as circular production of efficient causes that no state-determined syntactic description captures, supports CLAIM-288 and goes beyond it: a system whose objectives its own processes revise is still, on this account, not closed. It gives no test for QUESTION-086, and its non-computability claim rests on Rosen, unassessed. |
| LIT-1029 | Autonomy, Function, and Representation | Bickhard (2000), Communication and Cognition – Artificial Intelligence 17(3–4). A far-from-equilibrium system’s contributions to its own maintenance are functions for it, with function and dysfunction fixed by the asymmetry between persisting and decaying; a candle flame qualifies. A recursively self-maintenant system, one that switches among self-maintaining processes as its environment changes, has representation: indications that an interaction will succeed, which can be false by the system’s own lights. Etiological, informational and Dretskean accounts are rejected as epiphenomenal or observer-dependent. | Active — read in full 2026-10-13 (NOTE-729) from the author’s manuscript text on his Lehigh site (https://www.lehigh.edu/~mhb0/autfuncrep.html); the printed issue was not compared. Worth reading as a compact statement of the organizational account of function before Mossio et al., and of interactivism: function is contribution to a far-from-equilibrium system’s own persistence, relative to that system, and representation is an indication of interaction success that the system can find false. It supports the premise of CLAIM-288 by a second route, gives QUESTION-087 an intrinsic standard bounded by persistence (so it agrees with CLAIM-075), and is vocabulary, not evidence, for CLAIM-284. |
| 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-1033 | How continuity distinguishes autonomy from agency in agentic AI | Kahl (2026), Discover Artificial Intelligence 6:1187, a Perspective. ‘Agentic’ AI runs together operational autonomy and agency in the sense that bears on responsibility, authority and governance. The second needs continuity pressure: when an inherited evaluative frame no longer settles how to go on, the system itself settles a revised frame and carries it forward. Planning, tool use, memory and coordination do not supply this, and representative current systems ordinarily fail it because their failures are corrected from outside. A necessary condition only, argued from cases. | Active — read in full 2026-10-13 (NOTE-723) from the publisher’s open-access PDF (link.springer.com/content/pdf/10.1007/s44163-026-01675-5.pdf, CC BY-NC-ND), article 6:1187. Worth reading for a sharp separation of operational autonomy from agency that bears on responsibility, and for a test, continuity pressure, that turns on whether a system settles and carries forward revised evaluative standards when its inherited ones break down (THEORY-219). It supports CLAIM-288 from a responsibility argument rather than an enactive one, and gives QUESTION-092 a partial answer: internal allocation of authority does not count, internal revision of standards under breakdown does. |
| 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-1035 | Stability of nonlinear Hawkes processes | Brémaud and Massoulié (1996), Ann. Probab. 24(3): 1563–1588. Sufficient conditions for a Hawkes process with a nonlinear rate function and kernels of either sign to have a unique stationary version that versions started from a suitable past converge to: Lipschitz constant times the kernel’s absolute mass below one (for networks, a spectral radius below one), or a bounded Lipschitz rate with no limit on kernel size. Kernels are fixed in time; nothing is proved past the threshold or about cascade sizes. | Active — read in full 2026-10-13 (NOTE-728) from the publisher’s typeset PDF, open access on Project Euclid (projecteuclid.org/journals/annals-of-probability/volume-24/issue-3/Stability-of-nonlinear-Hawkes-processes/10.1214/aop/1065725193.pdf), fetched as the Internet Archive’s capture of that URL because Project Euclid refused direct requests from this environment. Worth reading as the standard source of stability conditions for Hawkes processes that are nonlinear and may inhibit: a Lipschitz-weighted kernel mass, or a network spectral radius, below one, or a bounded rate with no size condition (THEORY-215). For QUESTION-091 it shows that outside the linear excitatory case that quantity is a sufficient bound, not a branching ratio, and that saturating rates have no critical point; for CLAIM-163 it supplies a coupling and a control parameter, not an order parameter or transitions. |
| 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-1039 | Agent-initiated socio-technical reconfiguration: a three-level taxonomy of autonomous AI governance and its recursive challenges | Lahiri (2026), Frontiers in Artificial Intelligence 9:1881783, Hypothesis and Theory. Extends socio-technical systems theory to agents whose configuration is files they can write. A three-level taxonomy by architectural capability over the coupling mechanism: cannot alter it, tunes its timing, creates new coordination surfaces. The ‘recursive governance challenge’: controls within the agent’s reach inherit the vulnerability they were meant to remove, so durable constraint must sit outside its action space. Theory-building from two vignettes and four public incidents; five propositions, untested. | Active — read in full 2026-10-13 (NOTE-732) from the publisher’s open-access PDF (frontiersin.org/journals/artificial-intelligence/articles/10.3389/frai.2026.1881783/pdf, CC BY), article 9:1881783. Worth reading for its structural point that when an agent’s governing rules are files it can write, controls kept in the same place inherit the exposure and only constraints outside its action space escape (THEORY-223). That is a case of CLAIM-086 with the governed system, not a rival order, holding authority over a constraint’s force; its taxonomy’s top level, new coordination surfaces, is mostly not constitutive influence, and nothing in it bears on whether the agents are self-governing in CLAIM-284’s sense. |
| LIT-1042 | Meaning | Grice (1957), The Philosophical Review 66(3):377–388. Separates natural meaning (“Those spots mean (meant) measles”, which entails its content) from non-natural meaning (meaningNN). “A meantNN something by x” is roughly “A intended the utterance of x to produce some effect in an audience by means of the recognition of this intention”. Timeless and sentence meaning are to be explained from it. The founding text of the intention-based line of meaning and illocution. | Active — read 2026-10-13 (NOTE-735) in full; worth reading as the origin of the intention-based account of speaker meaning: A meant something by x if A intended the utterance of x to produce an effect in an audience by means of the recognition of that intention. Read it knowing that it analyses meaning, not illocutionary acts, so the step to individuating teasing or reproach by intention is Strawson’s (1964), not Grice’s; and that the account is stated as “roughly” and “a first shot” throughout. The first of the four works that CLAIM-221 and QUESTION-073 name as missing. |
| LIT-1043 | Intention and Convention in Speech Acts | Strawson (1964), The Philosophical Review 73(4):439–460. Against Austin, many illocutions are not conventional: a warning to a skater, an entreaty, an objection. Their force is a wholly overt, audience-directed intention, analysed by Grice’s speaker meaning plus a fourth intention, and uptake is the audience’s recognition of it. Acts like a verdict or an umpire’s call are essentially conventional, and the scheme cannot hold them. What all illocutions share is an overt intention meant to be understood. | Active — read 2026-10-13 (NOTE-736) in full; worth reading as the step from Grice’s speaker meaning to illocutionary force: an illocution not essentially conventional is an act of communication whose force is a wholly overt, audience-directed intention, while acts like a verdict or an umpire’s call exist only within rule-governed procedures. Read it knowing that its own scheme strains on orders and fails on institutional acts, and that it individuates request from entreaty by a recognised attitude of the speaker. The second of the four works that CLAIM-221 and QUESTION-073 name as missing. |
| LIT-1044 v2 | Why Do Better Loss Functions Lead to Less Transferable Features? | Kornblith, Chen, Lee & Norouzi (2020; NeurIPS 2021). Nine training objectives for ResNet-50 on ImageNet: seven beat softmax cross-entropy significantly, by up to 0.9 points top-1, and all eight alternatives yield fixed penultimate features that transfer worse to eight new-class datasets, by linear and k-NN readout. Each raises penultimate-layer class separation R² (one minus within-class over total cosine distance), and mean linear transfer falls with R² across losses (Spearman ρ = −0.93) and along a cosine-softmax temperature sweep. The losses differ only in the last third of the network, and full fine-tuning removes the gap. | Active — read 2026-10-14 (NOTE-762) in full; worth reading as the record’s one direct measurement of what class separation in the last layers costs off the trained task. Across nine objectives for ResNet-50 on ImageNet, those that beat softmax cross-entropy all raise penultimate-layer class separation (R² 0.349 → up to 0.845), and mean linear transfer to eight new-class datasets falls with it (Spearman ρ = −0.93; 75.9% for softmax, 48.3% for squared error). Cosine-softmax temperature moves both on one knob. The losses differ only in the last third of the network, and full fine-tuning erases the transfer gap. Read it knowing that the networks are early-stopped at 91.6–93.6% training accuracy, so this is relative within-class variance and not terminal-phase neural collapse; that the cost is for new classes, while on shifted ImageNet test sets with the same classes the more separated losses do slightly better (Table C.2); and that it is one dataset, two architectures and a correlation across losses, with one within-loss sweep. Filed as THEORY-246. |
| LIT-1045 | Manipulation Cases in Free Will and Moral Responsibility, Part 1: Cases and Arguments | De Marco and Cyr (2024), Philosophy Compass 19(12):e70009, open access. Survey of manipulation cases. Quotes Pereboom’s Case 1 (Plum, made strongly egoistic by neuroscientists just before he reasons) and describes Cases 2 to 4: programming at the start of life, an egoistic upbringing, ordinary determinism. Pereboom argues that no relevant difference separates adjacent cases and that causal determination by factors beyond the agent’s control best explains why none of the Plums is responsible. The generic schema is No-FR plus No-Diff. Hard lines deny No-FR, and soft lines deny No-Diff, but original-design cases defeat bypassing views and natural-force cases defeat manipulator- focused views. Parallel indeterministic cases press libertarians too, and Todd’s variants need only mitigated blame. | Active — read 2026-10-14 (NOTE-856) in full; worth reading as an even-handed open survey of manipulation arguments: it quotes Pereboom’s Case 1 verbatim in its 2024 wording, describes Cases 2 to 4, states the argument’s schema (No-FR, No-Diff) and notes that Pereboom’s own version concludes by best explanation. It sorts the classic cases into mid-life and original-design manipulation, and shows how original-design cases (Ernie) defeat bypassing views while natural-force cases (Natalie) defeat manipulator-focused views. Filed as an alternative reading for LIT-1006, whose book is Unavailable here. |
| LIT-1046 | Powerlessness and Social Interpretation | Fricker (2006), Episteme 3(1–2):96–108, drawn from the final chapter of Epistemic Injustice. Hermeneutical injustice is “the injustice of having some significant area of one’s social experience obscured from collective understanding owing to hermeneutical marginalization”. It is systematic when the marginalisation is persistent and wide-ranging, and incidental when it is a one-off, localised moment of powerlessness, as for a socially powerful man whose stalking the police cannot hear. A gap with no marginalisation behind it, such as an undiagnosed illness, is bad luck, not injustice. The primary harm is situated hermeneutical inequality. Secondary harms include lost epistemic confidence and, at worst, the social construction of who the subject is. | Active — read 2026-10-14 (NOTE-859) in full; worth reading as Fricker’s full statement of hermeneutical injustice, drawn by her own note from the book’s final chapter: the definitions, systematic and incidental, the argument that a merely circumstantial gap is bad luck and not injustice, and the account of its primary and secondary harms. Its incidental case shows that, on her terms, hermeneutical injustice does not require membership of a powerless group, which the précis read for LIT-1004 does not say. Filed as an alternative reading for LIT-1004, whose book is Unavailable here. |
| LIT-1047 | Skepticism About Moral Responsibility | Caruso (2018), Stanford Encyclopedia of Philosophy. Moral responsibility skepticism denies or doubts basic-desert responsibility, which Pereboom defines as deserving blame or praise just because one acted, not on consequentialist or contractualist grounds. Hard incompatibilism rejects compatibilism by the manipulation argument, event-causal and non-causal libertarianism by the luck objection, and agent-causal libertarianism as unreconciled with physics. The entry quotes Pereboom’s Case 2 and gives the four-case argument’s structure, the hard-line and soft-line replies, and the difficulty for soft lines that a revised vignette can meet any condition they name. It reports Strawson’s Basic Argument and Levy’s Luck Pincer, which argues that historical compatibilism cannot let agents take responsibility for constitutive luck. Its section 3 sets out optimistic skepticism. | Active — read 2026-10-14 (NOTE-862) in full; worth reading as the standard survey of free will skepticism and the best open statement of hard incompatibilism: Pereboom’s definition of basic-desert responsibility, the argument against compatibilism by manipulation, against event-causal libertarianism by luck, and against agent-causal libertarianism by physics. It quotes Pereboom’s Case 2 verbatim (2014 wording), and sets out the hard-line and soft-line replies and the soft-liner’s difficulty. It also reports Levy’s luck argument against historical compatibilism, which targets the taking of responsibility. Survey strength: the four-case argument is summarised, not reproduced. Filed as an alternative reading for LIT-1006, whose book is Unavailable here. |
| LIT-1048 | Evolving Concepts of Epistemic Injustice | Fricker (2017), Routledge Handbook of Epistemic Injustice, pp. 53–60. Her retrospective statement of the two concepts. Both are “discriminatory epistemic injustice”: testimonial injustice is caused by a prejudice through which the speaker is ingenuously misjudged as epistemically lesser, and hermeneutical injustice by “hermeneutical marginalisation in relation to some area of social experience”. She argues for keeping both strict about intention: a deliberate manipulation of credibility, or a hearer who pretends not to understand, is a related but different wrong. She accepts structural, pre-emptive testimonial injustice, as when an un-refreshed list of expert witnesses means some speakers are never asked. | Active — read 2026-10-14 (NOTE-853) in full; worth reading as Fricker’s own later statement of both concepts, ten years after the book: testimonial injustice is an ingenuous, prejudiced misjudgement of a speaker and never a deliberate manipulation of credibility; hermeneutical injustice is caused by hermeneutical marginalisation and persists however earnestly hearers try; and both are “discriminatory” epistemic injustice, kept apart from distributive kinds. It also accepts Anderson’s structural, pre-emptive testimonial injustice, in which a speaker’s word is never sought because of an un-refreshed list. Filed as an alternative reading for LIT-1004, whose book is Unavailable here. |
| LIT-1049 | Epistemic Justice and a Role for Virtue in the Politics of Knowing | Fricker (2003), Metaphilosophy 34(1–2):154–173. A hearer can take someone’s word critically without inference, through a testimonial sensibility: a socially trained, self-correcting capacity, like an ethical sensibility, in which stereotypes of credibility are a legitimate and needed heuristic. Where they carry prejudice, a speaker receives the wrong degree of credibility “owing to a certain sort of unintended prejudice on the hearer’s part”: testimonial injustice, shown in Tom Robinson’s trial and in Greenleaf’s dismissal of Marge. The corrective virtue, reflexive critical openness, corrects for the relation between the hearer’s and the speaker’s social identities. Its availability depends on the critical concepts of the hearer’s time, so a hearer may be at fault before he is culpable. | Active — read 2026-10-14 (NOTE-860) in full; worth reading as Fricker’s first statement of testimonial injustice and of the virtue that corrects it: a hearer’s credibility judgements come from a socially trained testimonial sensibility, which stereotypes properly inform and prejudice can corrupt, so that a speaker gets “the wrong degree of credibility” through “unintended prejudice”. It argues the corrective virtue is reflexive, and that whether a hearer can have it depends on the critical concepts available in their time. Filed as an alternative reading for LIT-1004, whose book is Unavailable here. |
| LIT-1050 | On the logic of theory change: Partial meet contraction and revision functions | Alchourrón, Gärdenfors and Makinson (1985), JSL 50(2). The AGM theory: postulates for contracting and revising a logically closed belief set, and their characterization by partial meet contraction. | Active — read in full 2026-10-15 from a scan of the published article (JSL 50(2), pp. 510–530) that David Makinson posts on his own site (sites.google.com/site/davidcmakinson/, a Google Drive file linked from his publication list as item 23); Unpaywall, OpenAlex and Semantic Scholar report it closed, Cambridge Core and JSTOR are subscription, and Project Euclid refused this environment. Worth reading as the source of the AGM postulates for contracting and revising a logically closed theory, of the Levi identity as the definition of revision, and of the two representation theorems: the six basic postulates characterize exactly the partial meet contractions (Observation 2.5), and with the two supplementary postulates exactly those generated by a transitive relation over the maximal non-implying subsets (Corollary 4.5). For CLAIM-294 it shows that in AGM the closed theory alone does not fix a revision, since a selection function or ordering must be added and different ones disagree on the same theory, but the added state is a preference over remainders, not a record of what a belief depended on; the paper does not discuss why beliefs are held or the belief-base point, which belongs to Hansson (LIT-1072). For QUESTION-105 it answers only a one-step version: a theory plus a transitive ordering suffices, with no redundancy in the finite case (Observation 4.6), and it says nothing about iterated revision. |
| LIT-1051 | A Pseudorandom Generator from any One-way Function | Håstad, Impagliazzo, Levin and Luby (1999), SIAM Journal on Computing 28(4). There is a pseudorandom generator if and only if there is a one-way function (Theorem 6.2.2), in the uniform setting: adversaries are algorithms, and every reduction is an oracle Turing machine that turns an adversary for the constructed generator into an inverter for the given function. The route runs one-way function → false entropy generator → pseudoentropy generator → pseudorandom generator, where “computational entropy” is the Shannon entropy of some P-samplable distribution that no adversary of the given strength tells apart from the output. The general reduction is only weak-preserving: composed literally it needs seeds of length n^34, and the paper’s direct construction n^10. The paper attributes to Goldreich [G : 89] the equivalence of pseudorandom generators with P-samplable pairs that are computationally indistinguishable but statistically very different; with Theorem 6.2.2 that gives the one-way function form, but the paper never writes that combined sentence. | Active — read in full 2026-10-15 from the authors’ copy on Johan Håstad’s KTH page (www.csc.kth.se/~johanh/prgfromowf.pdf, a 46-page typescript, linked from ~johanh/papers.html; not the typeset SIAM pages 1364–1396, which were not checked). Unpaywall and OpenAlex report the DOI closed; OpenAlex lists two CiteSeerX records (10.1.1.35.3930, 10.1.1.36.6283), not needed once the KTH copy was found. Worth reading as the source of the uniform theorem “There are one-way functions iff there are pseudorandom generators” (Theorem 6.2.2) and of computational entropy: the Shannon entropy of a P-samplable distribution that no adversary of a given time-success ratio tells apart from the output, with pseudoentropy (more than the input’s entropy) and false entropy (more than the output’s own) as the intermediate primitives. All adversaries are uniform and every reduction is an oracle Turing machine; there are no circuits and no min-entropy in the paper, and the general reduction is only weak-preserving (seed length n^10 even in the direct construction). For CLAIM-302 and CLAIM-304 it shows that “if pseudorandom generators exist” may be read “if one-way functions exist”, and that the claims’ rendering G(U_n) is a false entropy generator with false entropy at least n, which names the gap they construct. For LIT-1053 it states, in Section 8, that Goldreich’s note [cited as ICSI TR-89-051, July 1989] shows pseudorandom generators equivalent to “a pair of P-samplable distributions which are computationally indistinguishable but statistically very different”; the one-way-function form follows only by combining that with Theorem 6.2.2, which the paper does not write out. For QUESTION-110 its time-success ratio is a worked cost-of-recovery measure that folds the success criterion into the cost, and for QUESTION-103 its distinguishing advantage is hit rate minus false-alarm rate, described by the paper itself as “the computationally restricted adversary definition of statistical distance”; it says nothing about real observers. |
| LIT-1052 | Calibration for the (Computationally-Identifiable) Masses | Hébert-Johnson, Kim, Reingold and Rothblum (2018), ICML; arXiv 1711.08513. A predictor is α-multicalibrated on a collection C of subpopulations if, within every set S in C, the individuals given (roughly) the same prediction v have true probabilities averaging within α of v, except on an α-fraction of S. For any C whose sets have size at least γN, a simple iterative patching algorithm reaches multicalibration from O(log|C|/α^{11/2}γ^{3/2}) samples in time linear in |C|, and the result is a circuit only O(s/α⁴γ) in size when the sets of C are computed by size-s circuits. Learning it is equivalent, up to polynomial factors, to weak agnostic learning of C, so it is hard for rich C under cryptographic assumptions. Calibrating any predictor h on its own level sets as well as on C costs at most 6α in squared error. All guarantees are relative to the benchmark p*, which is itself defined relative to the features available, and they hold only for large sets; the paper offers no uniqueness for the predictor and does not state a theorem in indistinguishability form. | Active — read in full 2026-10-15 from the authors’ arXiv preprint, latest version v2 of 16 March 2018 (arxiv.org/pdf/1711.08513, 40 pp.); the ICML version (PMLR 80:1939–1948, proceedings.mlr.press/v80/hebert-johnson18a/hebert-johnson18a.pdf, with a supplement) was fetched and its definitions and theorem statements compared, not read in full. Worth reading as the source definition of multicalibration: calibration required on every set in a collection C of large, efficiently identifiable subpopulations; a patching algorithm that reaches it from O(log|C|/α^{11/2}γ^{3/2}) samples in time linear in |C|, with a circuit of size O(s/α⁴γ); learning it equivalent to weak agnostic learning of C, and so hard for rich C under cryptographic assumptions; and calibration on any predictor’s level sets at almost no cost in squared error. Its multi-AE (accuracy in expectation on every S in C) is what later work calls multiaccuracy; the paper does not use that word. For QUESTION-103 it supplies adequacy relative to a class of observers in correlation form (a violation is a set in C correlating with the residual), but it states no indistinguishability theorem, no distinguishing advantage and nothing from signal detection; that framing is Dwork et al.’s (LIT-1068). For CLAIM-152 it is consistent and adds a second relativity: adequacy is relative to the outcome, to the features through p*, and to the class C, and even with all three fixed the adequate predictor is not unique. For QUESTION-104 it gives a formal instance of budget-relative sufficiency in which representing an adequate predictor is cheap (only modestly larger than the observer class) while finding one can be hard, but it has no notion of an optimal partition and does not show one changing with the budget. |
| LIT-1054 | On Distinguishing Epistemic from Pragmatic Action | Kirsh and Maglio (1994), Cognitive Science 18(4). Kirsh and Maglio define an epistemic action as a physical action whose primary function is to reduce the space, time or unreliability of the agent’s own mental computation, and argue from Tetris keystroke data that players rotate and translate pieces for that reason: zoids are rotated more than plan-then-act would need, rotation starts within a few hundred milliseconds of a zoid appearing, and a translate-to-wall check is used more the higher the drop. The computational saving is argued, not measured: physical rotation of 90° takes as little as 100 ms against an estimated 800–1200 ms mentally (a three-player pilot), and fewer attentional probes and less working memory are needed. The trade is physical action in place of internal computation at the moment of use, not precomputation or caching; the paper explicitly sets it against caching and chunking accounts of skill, and mentions amortized complexity only in passing for everyday cases such as sorting bolts before assembly. It says the choice fits a Stigler-style cost–benefit model in outline but that such models fail in detail, because an epistemic action’s value depends on the particular internal computation it serves. | Active — read in full 2026-10-15 from the scan of the published article (Cognitive Science 18(4), pp. 513–549) that David Kirsh posts on his UCSD publications page (adrenaline.ucsd.edu/kirsh/Articles/CogsciJournal/DistinguishingEpi_prag.pdf); the Wiley open-access PDF that OpenAlex lists refused requests from this environment. Worth reading as the founding definition of epistemic action: a physical action whose primary function is to reduce the space, time or unreliability of the agent’s own mental computation, argued from Tetris players’ extra and early rotations (rotation under way by 400–600 ms, physical rotation in as little as 100 ms against an estimated 800–1200 ms mentally) and a translate-to-wall check used more for higher drops. For QUESTION-095 it shows offloading at the moment of use, not precomputation: it sets itself against caching accounts of skill, mentions amortized complexity only in a parenthesis about sorting bolts, gives no formal cost model, and says simple cost–benefit models fail because an epistemic action’s value depends on the computation it serves. For TERM-055 it is a case of raising availability during the deadline, not before the request; for CLAIM-303 it has a single use and no upkeep, so it bears only on the general shape of the trade. |
| LIT-1055 | Contributions of ideal observer theory to vision research | Geisler (2011), Vision Research 51(7). A short review, not a methods paper. It defines the ideal observer as the device that “performs a given task at the optimal level possible, given the available information and any specified constraints”, writes the Bayesian ideal as an argmax of expected utility over the posterior given either the stimulus S or a constrained neural representation Z = g(S;θ) (eq. 1), and surveys applications from photon-noise detection to eye-movement search. It gives no formula for efficiency and no procedure for locating information loss beyond saying that constraints are added to the ideal one at a time (optics, receptor sampling, receptor noise, ganglion-cell summation) and that models are built by “degrading the ideal observer with hypothesized neural noise or with hypothesized heuristic computations”. Its constraints restrict the information available to an optimal decoder; it has no notion of an optimum over a restricted class of computations, though its attention examples compare the ideal with specific suboptimal rules (a one-location “serial” mechanism, a MAP searcher, a random searcher). | Active — read in full 2026-10-15 from the NIH author manuscript in PubMed Central (PMC3062724, NIHMS252298), taken as JATS XML from NCBI E-utilities (eutils.ncbi.nlm.nih.gov/entrez/eutils/efetch.fcgi?db=pmc&id=3062724) because the PMC article page served a reCAPTCHA; the typeset Elsevier open-archive PDF returned 403, so printed pagination was not checked. Worth reading as a compact statement of Bayesian ideal observer analysis: the ideal is optimal “given the available information and any specified constraints”, written as an expected-utility argmax over the posterior given either the stimulus or a constrained neural representation Z = g(S;θ), with a survey of applications and some numbers (r = 0.83 for colour naming on individual cone mosaics; 42% lower MSE for a natural-statistics decoder of peripheral samples; about 99% of variance in contour-occlusion judgments). For QUESTION-103 it shows less than the question assumes: it gives no formula for efficiency (the squared d′ ratio is not stated here and should be cited to Burgess et al. 1981 or Pelli and Farell 1999, or owned by the record), and its constrained ideals restrict the input, a garbling of the stimulus, with unrestricted computation on it, so losses are located stage by stage by the data-processing logic, not by an optimum over a restricted class of observers as in CLAIM-302. Its nearest analogue to a bounded class is the comparison with named heuristic rules (serial one-location attention, MAP fixation selection), and its remark that far-below-ideal performance leaves many models standing is the empirical form of the point that a gap does not identify its cause. Consistent with THEORY-031; no bearing on CLAIM-302 itself. |
| LIT-1056 | Amortized Inference in Probabilistic Reasoning | Gershman and Goodman (2014), Proceedings of the 36th Annual Conference of the Cognitive Science Society (pp. 517–522 by the authors’ later citation). Proposes that people amortize probabilistic inference by caching (memoizing) sub-inferences and composing them for related later queries. In two Mechanical Turk experiments on a five-node network, answers to a complex query depended on the person’s own earlier answer to a sub-query only when the sub-query came first (r = 0.28 against −0.11), and responses were faster when reuse was available. Costs of reuse are discussed, not measured. | Active — read in full 2026-10-15 from the authors’ copy on the Gershman lab site (gershmanlab.com/pubs/GershmanGoodman14.pdf, 6 pp.). The version of record is on eScholarship (escholarship.org/uc/item/34j1h7k5), whose PDF refused direct requests from this environment. The page range 517–522 is from the authors’ own later citation. Worth reading as the paper that named amortized inference for cognitive science. It defines amortized inference as caching (“memoizing”) sub-inferences and reusing them on related queries. It gives the first behavioural evidence for this, from two small online experiments on one Bayesian network: with the sub-query first, answers to a complex query were predictable from a person’s own sub-answer (r = 0.28, against −0.11 in the reverse order), and they were faster relative to a matched baseline. For QUESTION-095 it shows that the authors treat amortization as retrieval standing in for recomputation, which supports the question’s unification for internal memory only. It does not touch external storage or distributed cognition. It supplies storage cost, decomposability and frequency as untested trade-offs, but no staleness term, and no directional bias toward earlier answers, which belongs to later work (LIT-1074). For CLAIM-303 it is consistent with the trade and with frequency being one consideration among several, and its error propagation is error preserved by reuse, not staleness. |
| LIT-1057 | Adapting the Environment Instead of Oneself | Kirsh (1996), Adaptive Behavior 4(3–4). A conceptual paper. It models a task as a directed graph of states and actions with a cost metric on transitions, and classifies how an agent can improve its payoff by actions external to the task: pruning hard initial states, routine maintenance, scouting ahead, tools (which change the graph), and actions that make a space more “cognitively congenial” (which leave the graph intact and reduce mental operations). It names amortization once, as a parenthetical gloss on chimps leaving nut-cracking stones in place, and gives an investment rule for maintenance (future benefit against present cost times an “interest factor” for risk) in words only. There is no cost model with reuse frequency, retrieval cost or staleness; mental cost lies outside the graph, and the paper says there is “no general theory” of congeniality. The empirical figures are unpublished pilot results. | Active — read in full 2026-10-15 from a scan of the published article (Adaptive Behavior 4(3/4), pp. 415–452) that the author posts on his UCSD laboratory server (interactivity.ucsd.edu/articles/Adaptive/Adapting_env_00.pdf), text by OCR and cross-checked against the author’s HTML version in the same directory; the PhilArchive copy refused automated requests and was not used. Worth reading as the distributed-cognition statement of environment redesign as a change to a task’s state graph or to its “cognitive congeniality”, with routine maintenance (keep things where they are expected so that search is unnecessary, against objects’ tendency to scatter) and an investment rule for doing work before it is needed. For QUESTION-095 it shows that “amortize the cost of search” is a single parenthetical about chimps leaving nut-cracking stones in place, not developed; that the graph prices only physical transitions, so retrieval and mental cost fall outside the formalism by the paper’s own account; and that the nearest thing to a cost model is a verbal “interest factor” whose footnote names the risks that the result will not be used and that the change will not still be present, with no reuse frequency, retrieval cost, staleness of a result or query predictability. Its most usable point is that labour cost varies over time, so work should be done when it is cheap, which is the cockpit’s rationale. It does not cite Tarjan (that is Kirsh 1995, LIT-1076), and its value-of-information example changes outcome probabilities rather than pricing a choice made after looking. For CASE-085 it supports the labelled-compartment and standard-layout counterfactuals and their upkeep by the agent, a mechanism or the group, and says nothing on search cost, deadlines or when to stop searching. |
| LIT-1058 | Soft constraints in interactive behavior: the case of ignoring perfect knowledge in-the-world for imperfect knowledge in-the-head | Gray and Fu (2004), Cognitive Science 28(3). In a simulated VCR-programming task, people with show information always available on screen still made errors that comparing against the display would have prevented. Making that information cost a mouse move and click instead of an eye movement (an estimated 1,000–1,500 ms against 500 ms) cut how often they looked it up, and most checks came right before a setting, almost none while or after setting it. The group made to memorize the information first made the fewest errors. Gray and Fu read this as non-deliberate least-effort choice among microstrategies, with memory time and perceptual-motor time weighed alike (“milliseconds matter”). The access costs are model estimates, not measured or varied parametrically. The error difference between the two on-screen conditions was not significant, the free-access look-up data come from a separate eye-tracking study of eight people, and the Memory-Test condition differed from the others in more than retrieval cost. | Active — read in full 2026-10-15 from the publisher’s typeset PDF (Cognitive Science 28(3), pp. 359–382), as posted on a Drexel University course page (www.cs.drexel.edu/~dds26/courses/cs680-s11/BK/readings/Gray-CS04.pdf). The authors’ own copy on Gray’s RPI page, and the Internet Archive’s 2004 capture of it, could not be reached from this environment. Unpaywall and OpenAlex list the work closed, and Wiley, ScienceDirect and DTIC refused direct requests. Worth reading as the standard experimental case that people choose between recalling information and looking it up by a non-deliberate comparison of effort, in which memory time and perceptual-motor time count alike. In a simulated VCR task, adding a click (an estimated 1,000–1,500 ms against 500 ms for an eye movement) cut look-ups of perfect on-screen information, and checks of finished settings rested on memory. The group that memorized the information first made the fewest errors. The millisecond costs are model estimates, the error difference between the two on-screen conditions was not significant, and the ACT-R models only estimate effort; none models the choice. For QUESTION-095 it prices only the read-back side of the trade, setting aside encoding and search, and it shows that a result left in the world goes unused once recall is cheaper; it says nothing of amortized inference. For CLAIM-296 and TERM-055 it shows a change of arrangement alone changing use of the information, and that the procedure actually chosen is the cheapest, not the best available. It bears on CASE-085 only by analogy, because its task removes search, which is where the EMT case failed. |
| LIT-1059 | Cognitive Offloading | Risko and Gilbert (2016), TICS 20(9). A short review that defines cognitive offloading as physical action that changes a task’s information-processing requirements to reduce cognitive demand, splits it into offloading onto the body and into the world, and proposes a metacognitive model: whether people offload is a strategy choice driven by their evaluation of internal versus extended strategies, which tracks objective internal demand but can be wrong, and offloading in turn changes both memory and those evaluations. The evidence is a handful of choice/no-choice studies, summarised qualitatively; the review reports no effect sizes and no formal account of costs. It names costs (memory for offloaded content, GPS-impaired spatial memory, photo-taking impairment, automation complacency and bias, skill decay, inflated self-knowledge, a self-reinforcing drift toward external reliance). It does not frame offloading as computation reused over time, and says nothing about how often an offloaded result is used. | Active — read in full 2026-10-15 from the authors’ manuscript in UCL Discovery (discovery.ucl.ac.uk/id/eprint/1508770/1/gilbert_TiCS_OFFLOADING_RPS.pdf, 37 pp.; the typeset Elsevier version, its Trends box and its Outstanding Questions box were not seen). Worth reading as the standard definition of cognitive offloading (“the use of physical action to alter the information processing requirements of a task in order to reduce cognitive demand”), its split into onto-the-body and into-the-world, and a metacognitive model in which the choice to offload follows beliefs about internal versus extended strategies, tracks objective demand but can be wrong, and feeds back through lost memory and changed confidence into a drift toward external reliance. It reports no effect sizes and gives no cost formalism. For QUESTION-095 it does not supply the retrieval-as-amortized-computation account; it adds that offloading shifts remembering “what” to remembering “where”, that people offload where it gives nothing (about 40% at ceiling load), so when it pays and when people do it come apart, and that automation bias is the nearest thing to the staleness cost. For CLAIM-303 it fits the direction (more is offloaded as the later internal cost rises) but says nothing about reuse count, and shows that offloading itself lowers internal capacity, which the claim’s fixed ledger leaves out. |
| LIT-1061 | Foundations of Cryptography | Goldreich (2001), Cambridge University Press. Volume 1 of the standard treatment of the complexity-theoretic foundations of cryptography: one-way functions, computational indistinguishability, pseudorandom generators and zero-knowledge proofs. | Active — read in part 2026-10-15 (Skimmed), and not in its printed form. The text read is the author’s 1995 draft, “Foundations of Cryptography (Fragments of a Book)” (23 February 1995, with the “Additional Fragment (Nr. 1)” of 9 February 1996), which Goldreich posted through ECCC (eccc.weizmann.ac.il/static/books/Foundations_of_Cryptography_Fragments_of_a_Book/; PDF at eccc.weizmann.ac.il/resources/pdf/foc.pdf, 305 pp.). The draft’s Chapters 1–3 were read in full; its zero-knowledge chapter, the 1989 annotated references and the 1996 addendum were not. The 2001 Cambridge text (DOI 10.1017/CBO9780511546891) is closed: Unpaywall and OpenAlex list no open location. The author’s own pages (wisdom.weizmann.ac.il/~oded/foc-book.html and related) and the Internet Archive’s capture of foc-book.html could not be reached from this environment. Worth reading as the standard source of the definitions of computational indistinguishability (Def. 3.2) and of a pseudorandom generator (Def. 3.9), and for the result that the first is strictly coarser than statistical closeness. For CASE-083 it confirms each ingredient: the generator definition, the 2⁻ⁿ image count (§3.3.1, stated there only as Δ ≥ ½ with Δ the unhalved sum; the count reappears in the proof of Prop. 3.13), and closure under efficient post-processing, which is set as Exercise 1 of §3.8.4 rather than proved. For CLAIM-302 it shows that the separation itself needs no assumption: Prop. 3.3 gives, by counting, an ensemble on at most 2^(n/2) strings that no polynomial-time test tells from uniform. Generators, or equivalently one-way functions, are needed only for an efficiently samplable pair (Goldreich 1990, cited in §3.8.2). Indistinguishability is defined only for ensembles indexed by n, never for a single pair of distributions. For CLAIM-304 it supplies the definitions; the encoding is the record’s own. Section numbers are the draft’s; the printed volume (Ch. 3 at pp. 101–183) was not checked. |
| LIT-1062 | Predicting Short-Term Remembering as Boundedly Optimal Strategy Choice | Howes, Duggan, Kalidindi, Tseng and Lewis (2016; online 2015), Cognitive Science 40(5). Participants copied names one at a time from a mock email to a mock calendar and, after a forced phase that measured their own copying rate at every list length from 3 to 9, chose how many names to take per trial; the list length that had given each person the highest rate in their own data predicted their choice better than one item fewer or one more (55% vs 8% and 17% of choices in Experiment 1, N = 40; 46% vs 12% and 14% in Experiment 2, N = 20). An exponential points schedule raised chosen list length (6.99 vs 5.07), but raising the cost of an error so that one wrong item voids the whole trial did not (5.00 vs 5.05). The “boundedly optimal” prediction is the argmax of each participant’s measured rate, not a model with capacity, error or look-up parameters, and the task has no look-up: names are shown once, in sequence, and cannot be consulted again. 13 of 60 participants persistently chose a non-optimal length, 10 of them one item more. | Active — read in full 2026-10-15 from the text of the publisher’s typeset article as deposited in the University of Michigan’s Deep Blue repository (hdl.handle.net/2027.42/133633), served as extracted full text by CORE’s reader page for that record (core.ac.uk/reader/86638046); Wiley, the Birmingham and Deep Blue PDFs, and the Internet Archive’s captures could not be fetched from this environment, so figures were not viewed. Worth reading as the individual-level test of bounded optimality in short-term remembering: after a forced phase measures each person’s copying rate at every list length from 3 to 9, the length with the highest measured rate predicts that person’s later choice better than one fewer or one more (55% vs 8% and 17% of choices, N = 40; 46% vs 12% and 14%, N = 20), an exponential reward for long lists raises the chosen length, and raising the cost of an error to the whole trial’s points does not. The prediction is each person’s empirical argmax, not a model: there is no capacity or look-up-time parameter, and the task has no look-up at all, since names are shown once and cannot be consulted again, so the alternative to holding more is more, shorter trials. For QUESTION-095 it shows people can find the best point of a memory-versus-overhead trade by rate, and adds one term Gray et al. 2006 (LIT-1073) lacked, a time cost for a wrongly remembered item; it has no term for query predictability, external retrieval or search, staleness, reuse across trials or erosion of the alternative, and it corrects the description of it, from Lieder and Griffiths (LIT-1071), as a memorize-or-look-up trade priced by look-up time. |
| LIT-1063 | Scaling LLM Test-Time Compute Optimally can be More Effective than Scaling Model Parameters | Snell, Lee, Xu and Kumar (2024, arXiv 2408.03314; ICLR 2025). On MATH with PaLM 2-S*, which way of spending test-time compute works best (beam search against a process reward model versus best-of-N; sequential self-revision versus parallel sampling) depends on how hard the question is for the base model, and choosing the method per difficulty bin matches best-of-N with up to about 4× less test-time compute (the discussion says 2–4×). In a FLOPs-matched comparison with a ~14× larger model, the extra test-time compute a small model may spend is set by R, the ratio of total inference tokens to pretraining tokens: when R is small the larger model’s pretraining cost buys many samples per query and test-time compute wins on easy and medium questions; when R is large the budget per query falls toward the parameter ratio and the larger model wins, always on the hardest questions. Difficulty estimation (2048 samples per question) and verifier and revision-model finetuning are not counted in the compute, R is an aggregate token ratio with no term for which queries recur, and the evidence is one model family on one benchmark of 500 test questions. | Active — read in full 2026-10-15 from the arXiv preprint (arxiv.org/pdf/2408.03314, v1 of 2024-08-06, the only arXiv version) and from the ICLR 2025 conference version, open access in the ICLR proceedings (proceedings.iclr.cc, retitled ”… than Scaling Parameters for Reasoning”), which is a revision not posted to arXiv: it charges verifier calls to inference FLOPs, which halves the stated R values (0.16/0.79/22 become 0.08/0.40/11) at unchanged budgets, and adds a verifier-quality check. Worth reading as the standard empirical case that the best use of inference compute depends on how hard a question is for the base model, and that choosing the method per difficulty bin matches best-of-N with up to about 4× less test-time compute on MATH with PaLM 2-S*, before counting the 2048-sample difficulty estimate. For QUESTION-095 it shows a FLOPs-matched amortization model: a ~14× larger model’s extra pretraining is a fixed cost spread over all inference, so the per-query test-time budget it buys scales as M + 3(M − 1)/R, with R the ratio of inference to pretraining tokens; test-time compute wins at low R on easy and medium questions and loses at high R and on the hardest questions at every R. R is aggregate inference volume, not a count of recurring queries; the larger model’s per-token cost is a retrieval-cost term; query predictability appears as difficulty but its cost is not counted; staleness and erosion are absent. |
| LIT-1064 | Explaining the enigmatic anchoring effect: Mechanisms of selective accessibility | Strack and Mussweiler (1997), JPSP 73(3). Proposes that comparing a target with an anchor makes anchor-consistent knowledge about the target more accessible, and that this knowledge then drives the absolute judgement. | Active — read in full 2026-10-15 from a scan of the APA typeset article (pp. 437–446) posted in the readings directory of a University of Florida graduate course (Lyle Brenner, MAR 7588; bear.warrington.ufl.edu/brenner/mar7588/Papers/strack-mussweiler-jpsp97.pdf). That is a course’s copy of the publisher’s version, not an author’s copy. Unpaywall, OpenAlex and Semantic Scholar list the article as closed. No copy was found on the authors’ pages: London Business School’s publication pages returned 404 or failed TLS, and the Internet Archive refused connections from this environment. Worth reading as the source of the selective accessibility model of anchoring. Three small studies (N = 32, 32 and 67) show that, with the anchor number held fixed, the anchor’s effect depends on whether the knowledge used to compare applies to the later estimate. Applicability came from the dimension: the estimate was on the dimension compared, or on another one (Study 1). Representativeness came from the object: the estimate was about the same object, or about a very different one, where the effect turned to contrast (Study 2). With plausible anchors the comparison was slower and the later estimate faster (Study 3). For CLAIM-298 (whose psychological form is now CLAIM-315) it argues against numeric priming of a response, and supports the claim’s psychological form for plausible anchors. It infers accessibility rather than measuring it; the direct lexical-decision test is Mussweiler and Strack 2000a, which the record does not hold and LIT-1067 failed to replicate. It does not rule out adjustment, and assigns adjustment to implausible anchors, which anchored at least as strongly. Its model holds that accessibility does not fix the direction of the judgment, so evaluation matters as well as retrieval. For QUESTION-109 it states, without testing, that hypothesis-consistent retrieval “improves the validity of comparative judgments but distorts subsequent judgments for which no specific hypothesis has been provided”. |
| LIT-1066 | How a Cockpit Remembers Its Speeds | Hutchins (1995), Cognitive Science 19(3), 265–288. A task analysis of how a two-pilot airliner cockpit “remembers” approach speeds: computed early from a speed-card booklet indexed by gross weight, passed across speech to bugs on the airspeed indicators, and used minutes later as a judgement of spatial adjacency. The memory is a property of the functional system, “not made primarily of pilot memory”, though pilot memory is involved. Stylized and unmeasured, for an anticipated, invariant task. | Active — read in full 2026-10-15 from the author’s posted copy, a scan of the published article (Cognitive Science 19(3), pp. 265–288) at pages.ucsd.edu/~ehutchins/documents/CockpitSpeeds.pdf. Worth reading as the compact statement of distributed cognition’s method, a cockpit treated as a cognitive system whose representations can be observed, and as the source of the speed-bug argument: setting the day’s speeds as bugs on the airspeed indicator does not improve any pilot’s memory but turns recall and scale-reading into a judgment of spatial proximity, so the memory “has now become a property of a larger system”. For QUESTION-101 and CLAIM-296 it shows, by task analysis and not by measurement, a change of arrangement alone changing what the system can do; the retrieval cue (displayed gross weight, the needle nearing a bug) supplied by the environment; and the work of retrieval moved to a quiet phase 25 to 30 minutes ahead of use, which the record’s deadline does not yet represent. It narrows them: its task is anticipated, mandated and invariant, it analyses only success, and it says nothing about search for one item among many under a deadline, which is CASE-085’s situation. |
| LIT-1067 | Failures to replicate a key result of the selective accessibility theory of anchoring | Harris, Blower, Rodgers, Lagator, Page, Burton, Urlichich and Speekenbrink (2019), JEP: General 148(9), e30–e50. Five preregistered experiments (N = 128 each) repeated Mussweiler and Strack’s (2000a) test of selective accessibility, which asks whether a high or low anchor speeds recognition of anchor-consistent words. Four used lexical decision and one used continuous identification. Anchoring was large in all five, the accessibility effect was absent in all five, and an exploratory meta-analytic Bayes factor favoured the null about 21 to 1. Because the same tasks also failed to detect direct picture priming, the authors conclude that the method is unfit as a test, not that the theory is false, and that the earlier evidence from it “is not a strong part of the evidence base”. | Active — read in full 2026-10-15 from the authors’ manuscript on UCL Discovery (discovery.ucl.ac.uk/10074759/1/HarrisEtAl_2019_anchoring.pdf, eprint 10074759; 76 pp. with appendices and supplementary experiments). It is a Word-generated manuscript dated 23 May 2019, which Unpaywall and OpenAlex label submittedVersion. Its abstract is worded differently from the published one, so it is not the APA version of record (JEP: General 148(9), e30–e50), which returned 403 from this environment. Worth reading as the preregistered, high-powered test of the lexical-decision evidence for selective accessibility (Mussweiler & Strack 2000a, Studies 1 and 2). In five experiments of N = 128, anchoring was large every time (d ≈ 0.85–1.39) and anchor-consistent word recognition never moved (η²G ≤ .004). An exploratory meta-analytic Bayes factor favours the null by 21 to 1. Validation studies show the same tasks also miss direct picture priming. For CLAIM-298 it shows that the most direct published measure of “anchors change what is reachable” does not replicate and cannot detect priming. The claim’s psychological form therefore rests on inferred, not measured, accessibility, and the theory is neither refuted nor confirmed. The authors’ leading explanation of durable anchoring is a provisional answer formed at the comparison, which is neutral between retrieval and evaluation. For QUESTION-109 it bears only indirectly. It also corrects the record’s attribution: by this paper’s account the lexical-decision studies are Mussweiler & Strack 2000a, not 1999 (LIT-1078). |
| LIT-1068 | Outcome Indistinguishability | Dwork, Kim, Reingold, Rothblum and Yona (2021), STOC; arXiv 2011.13426. A predictor p̃ is outcome indistinguishable (OI) relative to a class A of distinguishers when no A ∈ A can tell an individual with Nature’s outcome from the same individual with an outcome drawn from Ber(p̃_i). The paper sets out four levels by how much access the distinguisher has to p̃: none, the prediction on the sampled individual, oracle queries, or the code. The lower two levels are equivalent to multi-accuracy and multi-calibration over closely related classes. At those levels OI predictors exist with size O(s/ε²), whatever Nature’s complexity. At the oracle level, under fine-grained hardness of clique counting or BPP ≠ PSPACE, some efficient distinguisher classes force any OI predictor to be nearly as expensive as Nature’s own predictor. That gives a strict separation between oracle access and sample access. OI never requires p̃ ≈ p*. A predictor is good only relative to A, and with the paper’s construction a weak A gives a coarse predictor that a richer A would refute. The paper covers binary outcomes, a fixed representation of individuals and single samples (multi-sample OI is left mostly to future work). | Active — read in full 2026-10-15 from the arXiv preprint, arXiv:2011.13426v1 (arxiv.org/pdf/2011.13426, 61 pp.), the only arXiv version. The STOC 2021 version of record (doi:10.1145/3406325.3451064) was not read; its only open copies are submitted versions (arXiv, MIT DSpace). The recurrence algebra of Theorems 5.9–5.10 and the proof of Proposition 6.3 were checked for structure only. Worth reading as the source of outcome indistinguishability. A predictor is adequate relative to a class A of distinguishers when none can tell its sampled outcomes from Nature’s. The paper sets out four levels by the distinguisher’s access to the predictor (none, the sampled prediction, oracle queries, the code). It proves the lower two equivalent to multi-accuracy and multi-calibration and gives OI predictors of size O(s/ε²) whatever Nature’s complexity. At the oracle level it gives conditional hardness (clique counting, or BPP ≠ PSPACE): cheap distinguishers with query access can force any OI predictor to be about as costly as Nature’s own. For QUESTION-103 it supplies the formal half: distinguishing advantage is the ROC quantity, and with all subset distinguishers it becomes statistical distance. It says nothing about SDT, criteria or ideal-observer efficiency, and adds that access as well as budget sets an observer’s power. For CLAIM-152 it is an instance of adequacy relative to the observer class with the target held fixed, with no uniqueness or minimality of the predictor. For QUESTION-104 it shows a restricted class accepting a coarser model (p̃ ≡ 1/2 where Nature’s two halves are computationally indistinguishable), but at the oracle and code levels a bounded observer need not be satisfied by a cheap model. |
| LIT-1069 | Scaling Scaling Laws with Board Games | Jones (2021), arXiv 2104.03113. Training AlphaZero on Hex at board sizes 3×3 to 9×9, the best Elo reachable for a given training compute follows one change-point curve across sizes: an incline of about 500 Elo per tenfold of training compute, with the compute for perfect play rising about 7× and the compute to leave random play about 4× per added board row, and fits on small boards predicting larger ones. On 9×9 only, train-time and test-time (tree-search) compute substitute at a fixed rate: at equal Elo, each 10× of train-time compute removes about 15× of test-time compute (fit: log test = −1.2·log train + 0.004·Elo + 29), down to a one-node search, over roughly 1e14–1e16 FLOPS-seconds of training. The trade is an iso-performance curve for a single search; the paper never counts how many games or moves the trained agent will play, so it does not price amortization, and it does not state the unit of test-time compute. One game, small boards, Elo anchored to a perfect player, and no uncertainty on the fitted trade-off coefficients. | Active — read in full 2026-10-15 from the author’s arXiv preprint, version 2 of 2021-04-15, the latest (arxiv.org/pdf/2104.03113v2; v1 diffed against it, same methods and numbers). Worth reading as a clean small-scale scaling law in problem size as well as compute: AlphaZero on Hex, boards 3×3 to 9×9, one change-point frontier of about 500 Elo per tenfold of training compute, with the compute for perfect play rising about 7× per added board row and fits on small boards predicting larger ones. For QUESTION-095 it shows that, on 9×9 at fixed Elo, training and tree-search compute substitute along a straight log–log line, about 15× less search per 10× more training (fit: log test = −1.2·log train + 0.004·Elo + 29), over roughly 1e14–1e16 FLOPS-seconds of training and down to a one-node search; it does not count the games or moves the trained agent will play, or define the unit of test-time compute, so it prices the iso-performance substitution but not amortization, and has no terms for query shift, staleness or erosion of search. |
| LIT-1070 | Beyond Chinchilla-Optimal: Accounting for Inference in Language Model Scaling Laws | Sardana, Portes, Doubov and Frankle (2024, ICML; arXiv 2401.00448). Fixing a target pre-training loss and adding inference FLOPs (2N per token over a known lifetime demand D_inf) to training FLOPs (6N per token), the compute-minimising model is smaller and trained on more data than Chinchilla-optimal, increasingly so as D_inf approaches and exceeds the training-set size; the optimum has no closed form and is found numerically. The savings are modest in FLOPs (for a 30B-Chinchilla-quality model with 10^13 inference tokens, 28% by training 13.6B on 2.84× the data) and larger in dollars once inference’s low hardware utilisation is priced in (17% to 58% in the paper’s examples). 47 training runs (150M–6B parameters, 10–10,000 tokens per parameter) find loss still falling at extreme ratios, but more slowly than Chinchilla-fitted laws predict, so the formula overstates the gain from long training. Demand is assumed known before training and fixed given quality; there is no term for uncertainty, discounting, obsolescence or a model being replaced. | Active — read in full 2026-10-15 from the authors’ arXiv preprint v3 (arxiv.org/pdf/2401.00448v3, 14 Apr 2025), which is the ICML 2024 paper (PMLR 235, also fetched from proceedings.mlr.press/v235/sardana24a.html and diffed: same equations, tables and numbers, small wording edits); v1 (2023-12-31) is an earlier two-author NeurIPS 2023 workshop version without the experiments. Worth reading as the worked case of choosing how much to precompute by expected use: fixing quality, it adds lifetime inference FLOPs (2N per token) to training FLOPs (6N per token), finds the optimum numerically (no closed form), and shows the optimal model shrinking and training longer as demand grows (30B-Chinchilla quality with 10^13 inference tokens: 13.6B on 2.84× the data, 28% fewer FLOPs; in dollars, with inference at 1% utilisation, savings of 17% to 58%), with 47 training runs up to 10,000 tokens per parameter showing quality still improving but more slowly than the fitted law predicts. For QUESTION-095 it supplies expected reuse and a non-zero per-use cost as explicit terms, and nothing for staleness, uncertainty about demand (assumed known before training) or erosion; for CLAIM-303 it instantiates the break-even n > F/(c_r − c_a − u) with u = 0, and shows the choice as a continuous dial tied by a production function rather than a file-or-not decision. |
| LIT-1071 | Resource-rational analysis: Understanding human cognition as the optimal use of limited computational resources | Lieder and Griffiths (2020; online 2019), BBS 43. Resource rationality defines the right cognitive mechanism as the one, among those a brain can execute, that maximizes expected utility of its result minus the expected opportunity cost of the time and resources it uses (Eq. 3), averaged over the environments consistent with what is known (Eq. 4); resource-rational analysis is a five-step iterate-and-refine method for deriving process models from that objective. The objective is per episode. It has no separate terms for storing a result, retrieving it later, or its going stale: the value of what a computation leaves behind is folded into the utility of the episode’s result, and the cost of finding the heuristic in the first place is assigned to evolution and learning and left out. Reuse appears only in the review, qualitatively: habits as reused action sequences, Dasgupta et al. 2018’s memorized hypotheses, Howes et al. 2016’s memory-load choice (the review’s “memorize-or-look-up”), and “cognitive prostheses”. The framework is offered as a methodological device, not a claim that people are optimal. | Active — read in full 2026-10-15 from the publisher’s typeset PDF of the whole BBS treatment (target article pp. 1–16, Authors’ Response pp. 45–51, and the commentaries of Bates, Sims & Jacobs, Dimov, Dingemanse, and Ma & Woodford; the other 21 commentaries searched by keyword only), posted by the Griffiths lab at cocosci.princeton.edu/papers/lieder_resource.pdf. Unpaywall and OpenAlex list it as closed. Worth reading as the standard statement of resource rationality: the best mechanism a brain can run is the one that maximizes expected utility of its result minus the expected opportunity cost of the time and resources it takes (Eqs. 3–4), and the five-step method that derives process models from that. For QUESTION-095 it shows that one objective can cover computing, remembering and retrieving, and it groups habits, memorized inferences (Dasgupta et al. 2018) and how much to hold in memory (Howes et al. 2016, which the review calls a memorize-or-look-up trade) under it. But the objective is per episode and has no separate terms for precompute, storage, retrieval or staleness. It leaves the cost of finding a heuristic out on purpose, as already paid by evolution and learning. Offloading to the world appears only in Dingemanse’s commentary, which the authors accept as a frontier. For CLAIM-303 it supplies the general benefit-minus-cost form the break-even condition fits, and no support for the claim’s staleness term. |
| LIT-1072 | Logic of Belief Revision | Hansson’s Stanford Encyclopedia survey of the logic of belief revision: AGM and its alternatives, and the contrast between revising logically closed belief sets and revising belief bases, which keep the beliefs held in their own right apart from their consequences. | Active — read in full 2026-10-15 from the Stanford Encyclopedia’s own page (plato.stanford.edu/entries/logic-belief-revision/), the revision it dates “substantive revision Wed Jul 29, 2026”, also served as the Fall 2026 archive edition. Worth reading as a compact, current survey of AGM belief revision and its rivals, and as the standard statement of why a belief base is not its closure: two bases with the same consequences are “statically equivalent” but not “dynamically equivalent”, bases escape the Recovery postulate, and they keep inconsistent states apart where every closed set collapses to one. For QUESTION-105 and CLAIM-294 it shows the full-belief form of the claim that current conclusions are not a sufficient state for revision (the Abe and Bob example), and also that belief-set models carry the missing difference in a selection mechanism or entrenchment ordering instead of a base; for CLAIM-295 its bases widen the operations that stay well defined but record only which beliefs are basic, not reasons, sources or defeated alternatives. Truth maintenance appears once, as history. The phrases “between belief states represented as closed sets” and “belief bases retaining additional structure” that the filing attributes via A10 are not in this revision. |
| LIT-1073 | The soft constraints hypothesis: A rational analysis approach to resource allocation for interactive behavior | Gray, Sims, Fu and Schoelles (2006), Psychological Review 113(3). In a Blocks World copying task where the model pattern was hidden and opening it cost a lockout of 0 to 3,200 ms, people opened it less often, kept it open longer, and placed more blocks after the first look as the lockout rose, and the trend was graded down to differences of tens of milliseconds. An Ideal Performer Model that chooses how many blocks to encode per look (ENCODE-1 to ENCODE-8) by Q-learning, with the only reward being negative time and memory given by ACT-R’s base-level activation, retrieval-threshold and latency equations, fits four measures from Experiment 3 with three memory parameters and one softmax noise parameter fitted on one of them. The authors read this as support for choosing between head and world by time alone, against a minimum memory hypothesis, which they concede no one has stated precisely enough to model. The model’s only memory costs are encoding time, retrieval time and forgetting; it has no term for anything carried across trials, for a retrieved item being wrong, or for the world changing. | Active — read in full 2026-10-15 from the publisher’s typeset PDF (Psychological Review 113(3), pp. 461–482) as posted on a University of Colorado course page (home.cs.colorado.edu/~mozer/Teaching/syllabi/3702/readings/GraySimsSchoellesFu2006.pdf), a course’s copy of the typeset article; the authors’ RPI pages, CiteSeerX, DTIC and the Internet Archive could not be reached. Worth reading as the quantitative sequel to Gray and Fu 2004 (LIT-1058): in a Blocks World copying task with the pattern behind a lockout of 0 to 3,200 ms, people look less and memorize more as looking gets dearer, and a Q-learning Ideal Performer that minimizes only time, with ACT-R’s activation, threshold and latency equations for memory, fits four measures with four parameters. The case against the minimum memory hypothesis is argued, not tested, since no minimum-memory model was built. For QUESTION-095 it shows that head and world can be priced in one currency, with encoding, rehearsal, retrieval time and forgetting on the head side and a fixed access cost on the world side, and that the choice of how much to read per look is valued against the whole trial; it has no term for precomputation, for reuse across trials (each pattern is new; only the learned policy carries over, which the paper calls amortized and does not price), for search in the world, or for staleness, since the target never changes and a retrieval cannot be wrong. |
| LIT-1074 | Remembrance of inferences past: Amortization in human hypothesis generation | Dasgupta, Schulz, Goodman and Gershman (2018), Cognition 178. In three online experiments (N = 84, 80 and 100, before exclusions), a sub- or superadditivity bias induced in a first probability judgment carried over into a second, always-packed judgment about the same scene distribution, and errors on the two queries were correlated trial by trial (r ≈ 0.34–0.67). The carry-over appeared only when the second query shared part of its hypothesis space with the first, which rules out simple numerical anchoring; it was larger when cognitive load fell on the first query, which the authors’ simulations read as reuse of a summary statistic rather than of the stored samples; and with a new cue it appeared (for subadditivity only, and weakly) when the cue’s posterior was similar to the first. The paper defines amortization as reuse of past computation bought at a cost in bias, and itself places it in the time-for-space trade. It measures no response times, so the speed benefit is assumed, not shown; efficiency is shown only by better secondary-task accuracy on reusable trials; and it gives no account of when reuse pays. | Active — read in full 2026-10-15 from the publisher’s typeset PDF of the version of record (Cognition 178, 67–81), posted by Gershman on his lab’s publication page (gershmanlab.com/pubs/Dasgupta18_remembrance.pdf); Unpaywall and OpenAlex list it as bronze open access at the publisher, whose site refused requests from this environment, and the bioRxiv preprint was not used. Worth reading as the empirical case for amortized inference in people, defined as reuse of past computation that gains efficiency at a cost in bias: in three experiments (N = 84, 80, 100) an unpacking bias in one probability judgment carried over into a later related one, only where the queries shared hypotheses, more strongly under load at the first query (read as reuse of a summary statistic rather than stored samples), and somewhat selectively for similar cues. It measures no response times, so the speed gain is assumed, and the filed summary’s “biased toward earlier answers” should read “carrying over the earlier computation’s error”, since numerical anchoring was ruled out. For QUESTION-095 it shows that the paper itself frames amortization as a time-for-space trade akin to a look-up table, for results kept in the reasoner’s memory only, with free retrieval, no break-even account, and an error cost that is propagated approximation and interference rather than staleness; for CLAIM-303 it is consistent but measures neither side of the cost; for CLAIM-295 its sample-versus-summary contrast is a clean instance of keeping more to answer a wider family of queries at a memory cost. |
| LIT-1075 | Deictic codes for the embodiment of cognition | Ballard, Hayhoe, Pook and Rao (1997), BBS 20(4). At about a third of a second, the time scale of a saccade, the article models fixation as a pointer that binds a variable in a behavioural program to a place in the world, so that what is bound is only the task-relevant feature, fetched just before use. In a block-copying task subjects looked back at the model about 1.3 times per block on average, the commonest cycle being two looks per block (one apparently for colour, one for position), and chose this slowest, lowest-memory strategy (about 3 s a block, against about 1.5 s for copying from memory) though told to be fast; separating model and copy by 70° cut looks to 1.0 per block, and one-colour patterns that could be chunked cut them to 0.7. The authors read this as working memory having a “carrying cost” that exceeds the cost of re-acquiring from the world, but that cost is inferred from the choices and never measured or modelled, and the evidence is one task with small samples (seven subjects for the main data, three for the colour-change experiment) and no statistics reported in the article. What is left in the world is unprocessed input, not a computed result, and the article argues against precomputation where the needed products cannot be foreseen. | Active — read in full 2026-10-15 (the target article, pp. 723–742; the open peer commentaries and the authors’ response, pp. 742–767, not read) from the typeset BBS PDF posted on Dana Ballard’s University of Texas page (www.cs.utexas.edu/~dana/bbs.pdf; the same file is on Rajesh Rao’s University of Washington page). Unpaywall and OpenAlex report the DOI closed. Worth reading as the founding statement of fixation as a pointer that binds a program variable to a place in the world at about a third of a second, and for the block-copying evidence that people re-look rather than memorize: about 1.3 looks at the model per block, the slowest lowest-memory strategy (about 3 s a block, against 1.5 s from memory) chosen most often under instructions to be fast, falling to 1.0 when looking is made dearer (70° separation) and 0.7 when patterns can be chunked. For QUESTION-095 it shows the trade stated as a cost comparison (“carrying cost” of working memory against on-line acquisition) that moves with both costs, but the cost is inferred from choice, not measured or modelled, what is left in the world is raw input rather than a computed result, and the authors argue against precomputing where needs are unpredictable, so it is the deferral policy opposite to the cockpit’s, not amortization; for TERM-055 it shows people choosing between internal and external sources by their relative retrieval cost, and moving retrieval later, not earlier; for CLAIM-298 it offers only an analogy (cue-driven matching, the same image read differently by task step) and no test of framing or judgement. |
| LIT-1076 | The intelligent use of space | Kirsh (1995), Artificial Intelligence 73. A classification, from video of cooks, assemblers and baggers, informal observation and the Tetris studies, of how people arrange things around them to cut the time and memory a task needs: arrangements that simplify choice (hide or highlight affordances, eliminate decisions, offload heuristic properties), arrangements that simplify perception (clustering, regions, marking, the vernier effect), and spatial dynamics that save internal computation (Tetris rotation, self-cueing). It frames the savings in search-complexity terms and links informational structuring to amortized computation in a footnote, but says the savings cannot in general be meaningfully quantified and offers no cost model, no measurements beyond the cited Tetris timings, and no case of an arrangement failing under a deadline. Its agents are experts arranging their own workspace in the medium and short term; long-term, pre-built environments are set aside. | Active — read in full 2026-10-15 from the publisher’s typeset article (Artificial Intelligence 73 (1995) 31–68), scanned and posted by the author on his UCSD pages (adrenaline.ucsd.edu/kirsh/Articles/Space/intelligent_useof_space.pdf), text taken by OCR, with the formulas checked against page images; his HTML pre-publication version on the same site was compared and differs in the footnotes and the Tetris timings. Worth reading as the standard classification of how people arrange their workspace to cut the time and memory a task needs: arrangements that simplify choice (hiding or highlighting affordances, eliminating decisions, heuristic cues), arrangements that simplify perception (clustering, regions, marking, the vernier effect) and spatial dynamics that save internal computation (Tetris rotation). It is drawn from observation and anecdote, with no measurements of its own beyond the Tetris timings it cites, and it declines to quantify the savings. For QUESTION-095 it shows that the link from informational structuring to amortized computation was drawn in 1995, in a footnote to Tarjan and in §3.4’s “set-up costs could be amortized over the whole task”, but as an analogy to self-adjusting structures, not to memoization. It also shows that its third category, just-in-time offloading, is not amortization at all. For CASE-085 and TERM-055 it supports the gap between presence and finding in time: memory for location is “regularly overestimated”, a meaningful pre-existing layout helps recall, and retrieval cost matters “in absolute time” even where it is a constant factor. It does not cover pre-built environments arranged by someone other than the retriever, or failures under a deadline. |
| LIT-1077 | Memory as a Computational Resource | Dasgupta and Gershman (2021), Trends in Cognitive Sciences 25(3). A short review arguing that memory is used to avoid redundant computation: results are stored and reused (memoization), either whole (“top-down”) or as solutions to subproblems (“bottom-up”), and amortized inference and deep Q-networks are “distributed” memo-tables that generalize to new inputs. It illustrates this in mental arithmetic, mental imagery, probabilistic inference and planning, mostly with response times that flatten with practice and with biases that a cache explains (reuse of earlier inferences, choices based on stale cached values, reuse of policy fragments). It has equations for its examples but no cost model: the space–time trade-off is named, and when caching pays is listed as an outstanding question. Memory is internal throughout; retrieval cost is mentioned once, and offloading or external stores not at all. | Active — read in full 2026-10-15 from the publisher’s typeset PDF of the version of record (TICS 25(3), 240–251), posted on the Gershman lab’s publication page (gershmanlab.com/pubs/DasguptaGershman21.pdf); Unpaywall lists only the publisher’s bronze copy. Worth reading as the short computer-science-to-cognition statement of memoization as a cognitive mechanism: Michie’s memo-table, the space–time trade-off, top-down (whole outputs, Logan) versus bottom-up (subproblem solutions, Kalman filter, Bellman backups) reuse, and amortized inference and deep Q-networks as “distributed” memo-tables that generalize to new inputs, illustrated in arithmetic, mental rotation, inference and planning. For QUESTION-095 it shows the first strategy with the store in the head and no cost model: its equations are illustrative, when caching pays is listed as an outstanding question, retrieval cost is mentioned once (production systems’ “onerous demands on storage and retrieval”) and search not at all, and nothing concerns external memory, offloading or tools. It does supply both failure terms qualitatively, staleness in the strict sense (cached values not yet updated after devaluation, with offline updating as the remedy) and bias from overlap between queries, and treats query frequency as what a capacity-limited learned cache spends its capacity on. “Amortization” here means amortized inference, not amortized analysis, and the paper does not say that retrieval is computation. |
| LIT-1079 v3 | Improving automatic query expansion | Mitra, Singhal and Buckley (1998), SIGIR. Names query drift, “the alteration of the focus of a search topic caused by improper expansion”, and traces it in pseudo-relevance feedback to off-topic documents among the top-ranked: expansion then pulls the query toward one aspect of the topic. Reranking the top documents before feedback, by manual Boolean filters or an automatic term-correlation score, cuts the queries expansion hurts from 64 of 199 to 43–50 and improves average precision over plain expansion on TREC 3–6. | Active — read 2026-10-30 (NOTE-1460) in full, from the ACM proceedings text re-hosted by SciSpace (https://typeset.io/pdf/improving-automatic-query-expansion-cmfn0svc0j.pdf), a copy the owner ruled lawful on 2026-10-30; worth reading as the source of the term query drift, “the alteration of the focus of a search topic caused by improper expansion”, with its cause (off-topic documents at the top of a blind-feedback set) and a measure of how often expansion hurts. Read it knowing that its remedy is to rerank the feedback documents, that it is tested only on TREC 3–6 with SMART, and that it reports no significance tests. |
| LIT-1080 | Selection of Views to Materialize in a Data Warehouse | Gupta and Mumick (2005), IEEE TKDE. The journal paper merges Gupta’s 1997 space-budget results and the 1999 maintenance-budget results into one article; it adds proofs, not new problems or new guarantees. Theorem 8 (the conference Theorem 1: inverted-tree greedy on OR view graphs, at most 2S of maintenance, at least 1 − 1/e of an optimum with the same maintenance, assuming no inverted-tree piece of the optimum exceeds S) and Theorem 10 (A* is exact on AND-OR graphs) are now proved, while Theorem 9 (the assumption-free half-density bound) is referred to Gupta’s thesis. The maintenance-budget guarantee stays confined to OR view graphs, the greedy stays exponential in the worst case, and the two constraints are never combined. The only place upkeep is traded against query cost is the 1997 formulation carried over, query cost plus maintenance cost minimized under a space budget, with a guarantee only for AND view graphs in which every view is queried more often than it is updated; build cost and staleness are not modelled anywhere. | Active — read in full 2026-10-15 from the first author’s manuscript of the journal paper, linked from Gupta’s publication list (www3.cs.stonybrook.edu/~hgupta/ps/sel-views-tkde.pdf, 41 single-column pages, read by OCR; not compared with IEEE’s typeset pp. 24–43). Worth reading as the consolidated, proved account of Gupta’s 1997 space-budget results (LIT-1091) and Gupta and Mumick’s 1999 maintenance-budget results (LIT-1092): it is the journal version of both papers, not of the 1999 paper alone, and it adds proofs, not new problems or guarantees. The inverted-tree greedy’s 1 − 1/e guarantee for OR view graphs under a maintenance budget (now Theorem 8, still bicriteria at up to 2S and still assuming no tree-piece of the optimum exceeds S) and the exactness of A* on AND-OR graphs (Theorem 10) are now proved; the assumption-free half-density bound (Theorem 9) is referred to Gupta’s thesis; the guarantee is still for OR graphs only and the greedy still exponential in the worst case, data cubes included. For QUESTION-114 it changes nothing: the article holds two separate models, upkeep in the objective under a space budget (guaranteed only for AND view graphs in which every view is queried more often than updated, a lemma it now says fails for OR graphs) and upkeep as a budget with query cost alone in the objective, never both constraints together, and no build cost or staleness. LIT-1095 remains the closest to a joint model. |
| LIT-1082 | A feature-integration theory of attention | Treisman and Gelade (1980), Cognitive Psychology 12(1). In visual search for a coloured letter, a target that differs from all distractors by one feature (a colour, blue, or a shape, S, among brown Ts and green Xs) was found in a time almost independent of display size (positive slopes 3.8 ms/item for colour, 2.5 for shape, display sizes 1–30), while a target defined by a conjunction (green T among brown Ts and green Xs) gave linear slopes of 28.7 ms/item when present and 67.1 when absent, the roughly 1:2 ratio of serial self-terminating search; 13 sessions of practice did not make the conjunction pop out. Making the conjunction’s colours and shapes harder to tell apart nearly tripled the slope but kept it linear, and a single-feature target hard to discriminate (an ellipse of intermediate size) was slow but not item-by-item serial. Even in feature search, target-absent trials were slow and grew with display size (25.1 ms/item). The displays were at most 30–36 well-spaced items on a card, with unlimited viewing; the paper argues that conjunction structure, not similarity, makes search serial, and does not model similarity. | Active — read in full 2026-10-15 from a scan of the typeset article (Cognitive Psychology 12(1), pp. 97–136) hosted on a Princeton course page, COS 598B spring 2008 readings (www.cs.princeton.edu/courses/archive/spring08/cos598B/Readings/TreismanGelade1980.pdf); Unpaywall and OpenAlex (W2149095485) both report it closed, with no open-access location, so this is a course copy. Worth reading as the source of the feature/conjunction distinction in visual search: a target that alone has one colour or one distinctive shape part is found in time almost independent of display size (3.8 and 2.5 ms/item up to 30 items), while a target identified only by a combination of features its neighbours share is found by a serial self-terminating scan (28.7 ms/item present, 67.1 absent), which 13 sessions of practice did not change. For CLAIM-310 and CASE-095 it supports “search by what stands out” when what stands out is a single feature value no binmate shares, but it narrows them: in this paper serial search comes from conjunctions, not similarity; similarity on one dimension made search slow but not item-serial (ellipses of different sizes), and whether a shape pops out depends on which shape feature differs; it never tested ten-way colour search, similar colours, or piles of hundreds. The similarity effect the cases cite is not its finding. For CASE-094 a lone black brick among white ones is its easiest case, found almost regardless of numbers. For the claim on absence under a deadline it shows that rejecting absence costs about twice the per-item time of finding a present target in serial search, and costs a scan even when the present target pops out (25.1 vs 3.1 ms/item), with misses rising at large displays; it imposes no deadline. |
| LIT-1083 | An Efficient, Cost-Driven Index Selection Tool for Microsoft SQL Server | Chaudhuri and Narasayya (1997), VLDB ‘97. The AutoAdmin tool picks at most k indexes (single- or two-column, clustered or not) for a given workload of SQL statements, minimising the unweighted sum of the optimizer’s estimated costs of those statements, with hypothetical (“what-if”) indexes made visible to the optimizer by loading their statistics into the catalog. Its contribution is search efficiency: candidates are restricted to indexes in some single query’s best configuration, enumeration is Greedy(m, k) (an exhaustive seed of m indexes, then greedy additions), costs of most configurations are derived from a few “atomic” ones, and two-column indexes are generated only from winning single columns. On five TPC-D workloads this cut running time to 10–24% of a baseline, with estimated-cost quality 0–7% worse, and Greedy(2, 4) matched the exhaustive optimum on four of five workloads and was within 1% on the fifth. The cost model has no build cost, no storage term and no frequency weights, the budget is a count of indexes, the workload is fixed, there is no guarantee for the greedy step, and quality is never measured by executing anything. | Active — read in full 2026-10-15 from the VLDB Endowment’s proceedings PDF (www.vldb.org/conf/1997/P146.PDF, pp. 146–155, a scan with an OCR layer; tables and figures read from page images), which refuses plain requests from this environment (HTTP 403) and was served when the request carried a browser User-Agent. Worth reading as the founding paper of optimizer-driven (“what-if”) index selection in practice: at most k indexes chosen for a fixed workload of SQL statements to minimise the unweighted sum of the optimizer’s estimated costs, made affordable by per-query candidate selection, Greedy(m, k) enumeration with an exhaustive seed, derived costs from atomic configurations, and two-column indexes grown from single-column winners (4–10 times faster than a baseline, 0–7% worse by estimated cost, on five TPC-D workloads). For QUESTION-114 it prices organizing ahead no differently from Finkelstein et al. (LIT-1084), and in fewer terms: upkeep through the workload’s update statements, but no build cost, no storage term, no frequency weights and no changing workload, so “paid once” and staleness stay unpriced; what it adds is that deciding the arrangement has its own cost, and evidence (not a bound) that greedy choice works when index interactions are few and local. For CLAIM-310 it is consistent with the dependence on the query mix by construction and says nothing about what stands out within a bin; its heuristics (consider only sortings best for some search, choose the first carefully and add the rest greedily) carry over to a builder’s bins only by analogy. |
| LIT-1084 | Physical database design for relational databases | Finkelstein, Schkolnick and Tiberio (1988), ACM TODS 13(1). DBDSGN chooses, for each table, one clustered (ordering) index and a set of nonclustered indices to minimise a frequency-weighted sum of per-statement costs (access, tuple update, index maintenance) plus a weighted storage term, under an optional page limit, taking every cost from the System R optimizer’s own estimates rather than an external model. Statement costs for any configuration are computed exactly from “atomic” configurations with at most one index per table (Propositions 1 and 2), so the optimizer is consulted a linear rather than exponential number of times per table; with no elimination heuristics and a full search the tool finds the optimum, but only with respect to the optimizer’s estimates. The paper gives one worked example and no measurement of actual execution, and its claims that the heuristics usually find the best solutions are not backed by reported data. The model is steady-state over a period: it has no term for the one-time cost of building an index or sorting a table, so it prices upkeep against retrieval, not a one-off sort against later retrievals. | Active — read in full 2026-10-15 from the publisher’s typeset PDF (ACM TODS 13(1), pp. 91–128), which ACM serves free at dl.acm.org/doi/pdf/10.1145/42201.42205 (bronze) but which refused requests from this environment (HTTP 403; the Internet Archive capture could not be fetched), so the copy was the same ACM PDF as posted by the University of Crete course CS-460 (www.csd.uoc.gr/~hy460/pdf/p91-finkelstein.pdf). Worth reading as the classic statement of index selection as a workload-weighted cost model: one clustered order per table (“records can be ordered only one way”) plus secondary indices, chosen to minimise the weighted sum of access, tuple-update and index-maintenance costs plus weighted storage under a page limit, with every cost taken from the optimizer’s own estimates; exact over atomic configurations and optimal only relative to those estimates, with heuristic pruning and no measurement of actual execution. For QUESTION-114 it supplies the joint model for standing arrangements (bins, filed items), but it has no term for the one-time cost of sorting or building an index and does not cover precomputed answers (speed bugs, reused inferences); for CLAIM-310 it is an instance of “one arrangement” and of dependence on the query mix, has no analogue of a bin budget k, and nothing corresponding to pop-out within a bin. |
| LIT-1085 | Designing Access Methods: The RUM Conjecture | Athanassoulis et al. (2016), EDBT. The paper names three per-operation overheads of an access method, each a ratio to the base data alone (read, update and space amplification, each minimum 1.0), and conjectures that bounding any two forces a lower bound on the third. Its evidence is three one-line propositions about extreme designs over an integer array (a direct-address array, an append-only log, an unindexed dense array), a placement of known structures on a triangle, and a table of asymptotic I/O costs; nothing is proved, and the formal statement does not say how large the forced bound is, so as worded it is close to empty. The extremes themselves show the overheads are not symmetric: the space-minimal design is also update-minimal, and the read-minimal design keeps updates at 2.0, so the clean conflicts are read against space and update against both. Build cost appears in the table but is outside the triangle, there is no workload weighting, no time or deadline, and no cost of examining an item other than reading it. | Active — read in full 2026-10-15 from the publisher’s open-access PDF on OpenProceedings (openproceedings.org/2016/conf/edbt/paper-12.pdf, pp. 461–466, CC BY-NC-ND 4.0), the URL DataCite registers for the DOI. Worth reading as the source of the vocabulary of read, update and space amplification, each a ratio to the base data alone with a floor of 1.0, and of the conjecture that bounding two forces a lower bound on the third. It is a vision paper: the conjecture is unproved, its formal wording does not say how large the forced bound is, and its evidence is three extreme designs on an integer array, which show conflicts between particular pairs (read against space, update against read) rather than a symmetric triangle, since the space-minimal design is also update-minimal. For QUESTION-114 it shows that “organizing ahead” is two trades, auxiliary structure paid in space and sorting the base data paid in upkeep, but it has no workload, no build cost inside the trade and no time, so it is not the joint cost model the question lacks. For CLAIM-310 and CLAIM-307 it supports counting search as read overhead (items examined per item wanted), puts a bin budget nearer read cost on a directory than memory cost, and has no term for items that pop out, which both claims turn on. |
| LIT-1087 | Negation as Failure | Clark gives a query evaluator for a data base of clauses (a Horn clause prover in which a ground negated literal ~P is taken as a lemma when the recursive evaluation of P fails on every branch) and proves it sound with respect to the completed data base: the clauses read as the if-halves of if-and-only-if definitions, plus equality axioms saying distinct names denote distinct objects. Theorem 2: if for some selection rule every branch of the evaluation tree of Q terminates with failure, then not-(exists x)Q is a theorem of the completed data base. A branch that does not terminate licenses nothing; the rule requires the search to be exhausted, which the paper calls “the exhaustive but unsuccessful search for a proof of P”. The evaluator is in general incomplete (non-ground negation, a single evaluation tree, no case analysis); it is complete for allowed queries on hierarchical data bases (Theorem 4). | Active — read in full 2026-10-15 (NOTE for L39) from the author’s own copy, a scan linked from Keith Clark’s Imperial College page for the paper (www.doc.ic.ac.uk/~klc/NegAsFailure.pdf, via www.doc.ic.ac.uk/~klc/neg.html); the scan’s printed pages run 113–141, not the 293–322 Crossref gives for the Plenum chapter, and which printing it is was not identified. Unpaywall, OpenAlex and Semantic Scholar report the chapter closed. Worth reading as the source of negation as failure and of the completed data base: a Horn clause evaluator that takes ~P as a lemma when every branch of the evaluation tree for P terminates in failure is sound for the clauses read as if-and-only-if definitions plus axioms that distinct names denote distinct objects (Theorem 2); a non-terminating search licenses nothing, the evaluator is in general incomplete, and it is complete for allowed queries on hierarchical data bases (Theorem 4). Clark identifies the assumption with Reiter’s closed world assumption in one paragraph and makes no formal comparison. For CLAIM-306 it confirms the record’s gloss (“a finitely failed attempt … sound with respect to the completion”), and it shows that a search cut off by a deadline is not a failure in Clark’s sense: the rule needs the search exhausted, so the medic’s rule in CASE-085 is a stronger default than negation as failure, not negation as failure on a time bound; and since the EMT’s own knowledge implied the item was stocked, negation as failure would have refused the conclusion. |
| LIT-1088 | On Closed World Data Bases | Reiter defines the closed-world assumption (CWA) for a function-free first-order database as reasoning from DB together with the negation of every ground atom that DB does not entail, and contrasts it with the open-world assumption (OWA), under which only what DB entails is an answer. He shows that, when DB with these added negations is consistent, closed-world evaluation of any existential query reduces to ordinary (open-world) evaluation of atomic queries combined by union, intersection, difference and projection, so the negations never need to be listed. The CWA can make a consistent database inconsistent (Pa ∨ Pb yields ¬Pa and ¬Pb); consistent Horn databases, and all definite databases, stay consistent. Nothing in the paper concerns how long a search takes: non-entailment is a fixed logical relation, and the CWA’s justification is stated as an assumption of total knowledge of the domain, not proved as a soundness condition. | Active — read in full 2026-10-15 from the author’s preprint as presented at the 1977 Toulouse workshop, University of British Columbia Department of Computer Science Technical Report 77-16 (October 1977), served by UBC’s technical-report archive (www.cs.ubc.ca/sites/default/files/tr/1977/TR-77-16.pdf); the published Plenum chapter (pp. 55–76) is closed (Unpaywall and OpenAlex: closed; Semantic Scholar: no open PDF) and was not seen. Worth reading as the source of the open/closed-world distinction and of the closed-world assumption as a formal object: add the negation of every ground atom the database does not entail, a convention Reiter says “presumes total knowledge about the domain”. It shows that closed-world evaluation of any existential query reduces to open-world evaluation of atomic queries when the database stays consistent under the assumption, that consistent Horn and all definite databases do, and that a disjunctive database such as Pa ∨ Pb does not. For CLAIM-306 it supplies the definition and the completeness assumption (stated, not proved as a soundness condition; a formal soundness result would be Clark’s), and nothing about search time: non-entailment is a fixed relation, so “a closed-world assumption taken on a time bound” is the record’s extension. It also cuts against reading CASE-085 as a closed-world inference: a medic who knows the item is stocked holds a disjunction over compartments, Reiter’s Example 5.1, where the assumption is inconsistent. |
| LIT-1089 | The optimal selection of secondary indices is NP-complete | Piatetsky-Shapiro (1983), ACM SIGMOD Record 13(2). For one relation, a known mix of equality queries and updates, single-attribute secondary indexes, and a fixed upkeep charge per index on each update, choosing the index set that minimizes average transaction cost is NP-hard: minimum set cover reduces to it, each subset becoming an attribute and each element a query that any one of its attributes’ indexes can answer. The paper calls the problem NP-complete but states only the optimization version, and the proof is a sketch of about half a page. Storage is not in the model; the only price of an index is upkeep on updates. A variant with off-line updates under an update-cost budget is asserted NP-complete without proof. The paper does not cite or discuss Comer 1978. | Active — read in full 2026-10-15 from the scan SIGMOD serves openly on sigmodrecord.org (sigmodrecord.org/publications/sigmodRecord/8301/pdfs/984523.984530.pdf, linked from the January 1983 issue page), 4 pp., printed pages 72–75; the ACM Digital Library refused requests from this environment, and Unpaywall and OpenAlex list no open copy. Worth reading as the first proof that choosing secondary indexes for a known mix of queries and updates, to minimize average transaction cost, is NP-hard, by a half-page reduction from minimum set cover: attributes are the sets, queries the elements, and each index pays a fixed upkeep on updates. For QUESTION-114 it shows that the trade of upkeep against per-query savings under a known workload can be stated exactly and cannot be solved exactly in general, but only as the number of attributes and query types grows; storage, build cost and the file’s own order are outside its model, and it does not mention Comer 1978 (LIT-1086), so it is the citation for workload-based hardness and says nothing about what Comer proved. |
| LIT-1090 | Database Cracking | Idreos, Kersten and Manegold (2007), CIDR. Database cracking builds an index as a by-product of answering range queries. Each select partitions, in place, the part of a copy of the column that the query had to touch, so that the qualifying values lie contiguously, and records the new boundaries in a small tree; later queries touch only the pieces at the edges of their range, so per-query cost falls as the column is split into more pieces. On a 10^7-value column under uniformly random range queries, the first cracking select costs 0.38 s against 0.27 s for a scan and about 3.3 s for sort-then-search, and cumulative cost stays below sorting’s until about 10^5 queries, after which upfront sorting wins. The authors claim that only ranges of past interest get organized, but every experiment uses uniformly random ranges, so that claim is not measured; there is no cost model, no rule for when a reorganization is worth making, and updates, concurrency and out-of-memory data are left as open problems. | Active — read in full 2026-10-15 from the paper as published in the CIDR 2007 proceedings (cidrdb.org/cidr2007/papers/cidr07p07.pdf, which redirects to www.cidrdb.org; printed pp. 68–78, CC BY 2.5). Worth reading as the founding account of indexing by query: each range select partitions in place the part of a column copy it had to scan, records the new boundaries in an AVL tree, and so makes later queries touch only the pieces at the edges of their range. On 10^7 values under uniformly random ranges the first cracking query costs 0.38 s against 0.27 s for a scan and about 3.3 s for sort-then-search, and upfront sorting overtakes cracking only after about 10^5 queries. For QUESTION-114 it shows sorting as amortized search in a literal sense, with a measured break-even, but gives no cost model and no rule for when a reorganization is worth making; the claim that only ranges of interest get organized is not tested, since every workload is uniform. For CASE-094 the analogy holds for organizing as a by-product of retrieval and fails on the mechanism: cracking splits everything it searched around an ordered key, and reorganizes on every query whatever the chance of reuse, where the case sets aside only the found brick, and only when it is rare and often used. |
| LIT-1091 | Selection of views to materialize in a data warehouse | Gupta (1997), ICDT ‘97. Gupta states view selection on general AND-OR view graphs as minimizing frequency-weighted query cost plus update-frequency-weighted maintenance cost under a space budget. He proves greedy guarantees of 1 − 1/e (about 63%) of the optimal benefit, with the budget overrun by one view or up to double, but almost all of them assume no updates. Maintenance cost enters exactly one theorem: AND view graphs (each view has one way of being computed) in which every view is queried more often than it is updated. For OR view graphs, which include Harinarayan, Rajaraman and Ullman’s data cube, the paper sets update costs aside outright, so it does not add upkeep to that problem. Maintenance is an abstract per-update charge for keeping a view consistent. Nothing prices building a view, tolerated staleness or deferred refresh, and there are no experiments. | Active — read in full 2026-10-15 from the author’s PostScript copy on the Stanford InfoLab papers server (infolab.stanford.edu/pub/papers/SelectionViews.ps, 15 pp., dated March 1997, linked from the warehousing project’s publication page; Unpaywall and OpenAlex report the DOI closed). Worth reading as the general statement of view selection: AND-OR view graphs with query and update frequencies, and an objective of frequency-weighted query cost plus update-frequency-weighted maintenance cost under a space budget, with greedy guarantees of 1 − 1/e of the optimal benefit when space may overrun. For QUESTION-114 it gives the joint objective in form: reuse against per-update upkeep under capacity. It charges no build cost, leaves the maintenance cost abstract, and models only keeping views consistent, not tolerating or acting on stale ones. Its guarantees with maintenance cost hold only for AND view graphs in which every view is queried more often than it is updated. For the data cube of LIT-1094 it assumes no updates, so it does not add upkeep to that problem. That came in Gupta and Mumick’s maintenance-time-constrained follow-up (ICDT 1999), read afterwards as LIT-1092. |
| LIT-1092 | Selection of Views to Materialize Under a Maintenance Cost Constraint | Gupta and Mumick (1999), ICDT ‘99. Gupta and Mumick choose views to materialize so as to minimize frequency-weighted query cost subject to a cap S on total maintenance time, the sum over chosen views of update frequency times a per-update maintenance cost that depends on which other views are stored. Because storing one view can make another cheaper to maintain, benefit per unit of maintenance is not monotone and the single-view greedy of earlier work can be arbitrarily bad. For OR view graphs (each view computed from one other, as in data cubes) a greedy that adds whole “inverted tree sets” gets at least 1 − 1/e (63%) of the benefit of an optimal solution that may use as much maintenance as the greedy did, the greedy using up to 2S, assuming no inverted-tree piece of the optimum alone exceeds S (Theorem 1, unproved here); without that assumption it gets half the optimum’s benefit per unit of maintenance (Theorem 2). Each greedy stage enumerates exponentially many sets in general; for general AND-OR graphs there is only an exact A* search with exponential worst case. Upkeep is a budget, not a term traded against query savings; build cost, storage and staleness are not modelled, and the experiments are on random graphs of 10 to 25 nodes. | Active — read in full 2026-10-15 from the authors’ PostScript copy on Stanford InfoLab’s papers server (infolab.stanford.edu/pub/papers/update.ps, 18 pages, dated 8 October 1998, the ICDT ‘99 camera-ready, not the 2005 TKDE journal version; not compared with Springer’s typeset pages). Worth reading as the first view-selection result that budgets maintenance time instead of space, and for its demonstration that upkeep is not additive: storing one view can make others cheaper to maintain, so benefit per unit of maintenance is not monotone and single-view greedy can be arbitrarily bad. For QUESTION-114 it shows upkeep priced as a budget, U(M) = Σ update frequency × per-update maintenance cost given the other stored views, with query cost the only objective; build cost, storage and staleness are not modelled (every view is refreshed in a nightly batch). Its guarantee answers the open problem of LIT-1091 only for OR view graphs: 1 − 1/e of an optimum’s benefit while using up to twice the budget, under an assumption on the optimum, or half the optimum’s benefit per unit of maintenance without it, with the theorems stated but not proved and a greedy whose stages are exponential in general (including on data cubes). General AND-OR graphs get only an exact A* search. It does not close the question, and comes no closer to a joint cost model than LIT-1095. |
| LIT-1093 | Amortized efficiency of list update and paging rules | Sleator and Tarjan (1985), CACM 28(2). For a list searched sequentially from the front, where reaching the i-th item costs i, moving each accessed item to the front costs at most twice what any other rule costs on the same sequence, including rules that know the whole sequence in advance (four times, counting move-to-front’s own moves), with no probabilistic assumption. A fixed list sorted by access frequency, and the transpose and frequency-count rules, are not within any constant factor of that. Rearranging ahead of need never pays in this model (Theorem 3). For paging, where only a small fast memory is cheap, no rule that cannot see the future can do better in the worst case than n/(n − n_MIN + 1) times the offline optimum MIN, and LRU and FIFO attain that bound up to an additive n_MIN; with equal memories the ratio is the memory size. The model is a single linear list (or a two-level memory) with uniform items and access cost depending only on position; it says nothing about partitions, bins or search that is not a scan. | Active — read in full 2026-10-15 from the scan of the published CACM article (pp. 202–208, with ACM’s running heads and copyright line) on Sleator’s CMU page (www.cs.cmu.edu/~sleator/papers/amortized-efficiency.pdf); the ACM Digital Library’s open-access PDF refused direct requests from this environment. Worth reading as the founding worst-case comparison of an online rule with the best offline one: on a sequentially scanned list where reaching position i costs i, move-to-front costs at most twice what any rule in the class costs on the same sequence, even one that knows the future (four times counting its own moves), while a fixed list sorted by frequency, transpose and frequency count are not within any constant; and for paging no online rule beats n/(n − n_MIN + 1) times Belady’s MIN, a bound LRU and FIFO meet up to an additive n_MIN. For QUESTION-114 it shows that in a single pile searched from the top, putting the found item on top is within 2 of the best dynamic policy, not of the best arrangement, and that sorting ahead of need never pays (Theorem 3); bins are outside its model. For QUESTION-095 it prices one term, retrieval misses under a fixed cache size and the cost of not knowing future requests, and nothing on precomputation, upkeep or staleness. |
| LIT-1094 | Implementing data cubes efficiently | Harinarayan, Rajaraman and Ullman (1996), SIGMOD ‘96. Treats a data cube’s group-by queries as a lattice in which a query can be answered from any stored ancestor, prices a query at the number of rows of the smallest materialized ancestor, and chooses which views to precompute. Choosing k views to maximize the total reduction in query cost (the “benefit”) is NP-complete; a greedy rule that adds the view of largest marginal benefit gets at least 1 − ((k−1)/k)^k ≥ (e−1)/e ≈ 63% of the optimal benefit, a bound that is tight, holds unchanged with query-frequency weights, and weakens to 0.63 − f under a space budget when no view takes more than a fraction f of it. The cost of building views is represented only by their size, maintenance and updates are not modelled, the data are static, and the bound is on benefit, not on query cost. On TPC-D data the greedy order reaches nearly the minimum total query time with five views and barely more space than the base view. | Active — read in full 2026-10-15 from the authors’ 25-page version on Stanford InfoLab’s papers server (infolab.stanford.edu/pub/papers/cube.ps, TeX run of 8 January 1996), not the SIGMOD typesetting, which the ACM Digital Library refused (403); the two were not compared. Worth reading as the standard source on choosing which precomputed answers to store when each query is answered from its cheapest stored ancestor: the lattice of group-by views, the linear cost model (rows of the ancestor scanned), NP-completeness, and a greedy rule whose total benefit, the saving against storing the base view alone, is at least 1 − ((k−1)/k)^k ≥ (e−1)/e ≈ 63% of the optimum for a budget of k views, tight, unchanged with fixed query frequencies, and only 0.63 − f under a space budget when no view exceeds a fraction f of it. For QUESTION-114 and QUESTION-095 it shows the precomputed-answer term the four earlier readings lacked, with a stored answer’s value counted over every query it serves and marginal on what is already stored (sharpening CLAIM-303’s break-even); it does not price build cost (space is a proxy), upkeep or staleness (the data are static and derived answers exact), timing or deadlines, uncertain workloads, or the medium of retrieval, so it is a model of the speed bugs only in naming the category, an analogy with one usable term for filed arguments, silent on the bias of reused inferences, and not about LEGO bins. |
| LIT-1095 | An Online Approach to Physical Design Tuning | Bruno and Chaudhuri (2007), ICDE. An always-on index tuner for SQL Server. It keeps, for each candidate or existing index, the running sum of what each query would have saved with it (what-if optimizer estimates, with update costs counted as losses). It creates an index once that sum has risen by the index’s build cost above its lowest point, and drops it once the sum has fallen by the build cost from its highest point. For one index with no space limit, the authors call this 3-competitive against the optimal schedule that knows the workload in advance. The proof only gives a workload on which the ratio approaches 3, and the paper cites no competitive-analysis work, ski rental included. The general case (many interacting indexes and a storage limit) uses heuristics with no guarantee. All costs in the experiments are optimizer estimates, on synthetic and TPC-H workloads. | Active — read in full 2026-10-15 from the accepted-version PDF that Microsoft Research’s publication page for the paper links (www.microsoft.com/en-us/research/wp-content/uploads/2007/01/continuous.pdf, 10 pp., no IEEE pagination). The authors were both at MSR; Unpaywall, OpenAlex and Semantic Scholar list no open copy. Worth reading as the first model in the record that prices organizing ahead and organizing on demand on one schedule. It has a one-time build cost that depends on what is already built, per-statement savings, upkeep as the cost of update statements, a space limit, and a workload known only up to now. Its online rule builds an index once the benefit missed since the last low point equals the build cost, and drops it once the loss since the last high point equals the build cost. For QUESTION-114 it shows that the rule is rent-or-buy in structure but cites no competitive-analysis work, ski rental or Karlin et al. included. Its “three-competitive” result covers one index with no space limit, and is supported only by an example where the ratio approaches 3. By a check of my own it fails when a single statement’s saving is large next to the build cost. The general case with space and interacting indexes is heuristic, dropping is free, there is no staleness or deadline, and all costs are optimizer estimates. For CASE-094 it endorses making a bin at once when the bin costs almost nothing, and adds a matching rule for removing one. For CLAIM-307 it replaces “carve when retrieval fails” with “carve when the extra search already spent equals the bin’s cost”: a cumulative-cost criterion with no deadline. |
| LIT-1096 | Competitive snoopy caching | Karlin, Manasse, Rudolph and Sleator (1988), Algorithmica 3. For a shared-bus multiprocessor whose caches can either keep a replicated block (and pay one bus cycle for every write to it) or drop it (and pay p to fetch it again if it is read), the paper gives counter-based on-line algorithms whose total bus cost on every request sequence is at most twice that of the best off-line algorithm, and proves that no deterministic on-line algorithm can guarantee better than 2. The rule is: drop a copy once the writes it has caused since it was last read have cost as much as refetching it. With a third option (reading or writing through without fetching) the lower bound rises to 3, and the algorithm given is 3-competitive ignoring writebacks, 4 counting them; with associative caches the bound becomes the paging ratio. The paper never names rent-or-buy or ski rental; its rent is upkeep paid on an idle copy, and its purchase is the refetch after dropping, the reverse orientation of building a bin. Costs are fixed constants, the guarantees are worst case only, and the authors call the practical significance “unclear”. | Active — read in full 2026-10-15 (NOTE for this LIT) from a scan of the published Algorithmica article (pp. 79–119, Springer-Verlag copyright line) posted among the reading handouts of MIT course 6.896, Spring 2004 (courses.csail.mit.edu/6.896/spring04/class/www/handouts/papers/snoopy-cache.pdf); no author or repository copy was found (Unpaywall and OpenAlex: closed; not on Sleator’s CMU or Karlin’s UW pages). Worth reading as the first competitive analysis of a rent-or-buy decision: a cache keeping a shared block pays 1 per write to keep its copy current, or drops it and pays p to fetch it again if it reads; dropping once the writes charged since the last read have cost p is within 2 of the off-line optimum on every sequence (Theorem 4.1), and no deterministic on-line rule does better (Theorem 3.1); with a third option the bound rises to 3 (Theorem 3.3). The paper states the principle generally (change state when the extra cost of staying equals the cost of changing) but never names rent-or-buy or ski rental, and its instance is the decision to stop maintaining a copy, the mirror of building a bin. For QUESTION-114 and CASE-094 it gives a worst-case rule for when a bin pays without knowing future use: make it when the extra search already spent equals its cost; for CLAIM-303 it shows that a recurrence count weighted by reconstruction cost is, in the worst case, the right criterion and within 2, and that the second-occurrence rule is that rule only when filing costs about one reconstruction; for QUESTION-095 it prices upkeep against re-retrieval and nothing on precomputation or staleness, which it forbids rather than prices. |
| LIT-1097 | Should Tables Be Sorted? | Yao (1981), JACM 28(3). For storing a set of n keys from a universe {1,…,m} in a table so that the membership query (is x in S?) is answered with the fewest worst-case adaptive probes, Yao proves that when the table cells may hold only keys of S or a bounded number of pointer symbols, sorted order with binary search (⌈lg(n+1)⌉ probes) is optimal once m exceeds a Ramsey-number threshold N(n, p, q), whatever the arrangement rule, table size or hashing scheme. The threshold is astronomically large, and for small universes sorted order is beaten (one probe suffices for m = 3 with n = 2, and for m ≤ 2n − 2 with n > 2). The optimality also fails as soon as one cell may hold an arbitrary value from the universe: with a single extra “directory” cell, two probes suffice for m ≥ 2^{16n²}. Only query cost is counted; building the table is free and unconstrained, so the paper says nothing about the cost of arranging or about trading arrangement cost against lookups. | Active — read in full 2026-10-15 from the published Journal of the ACM version (28(3), pp. 615–628), which ACM serves free (OpenAlex/Unpaywall: bronze) but refused to this environment with 403, fetched instead as the copy on a University of Maryland course page (www.cs.umd.edu/users/gasarch/COURSES/858/S13/tables.pdf) and compared with the author’s Stanford report STAN-CS-79-753 (i.stanford.edu/pub/cstr/reports/cs/tr/79/753/CS-TR-79-753.pdf), which has the same results. Worth reading as the paper that set up what is now called the cell-probe model, with lookup cost counted as the worst-case number of cells read and arrangement and search strategy left arbitrary: for static membership, sorted order with binary search (⌈lg(n+1)⌉ probes) is optimal once the key space exceeds a Ramsey-number threshold, provided cells hold only stored keys or pointer symbols; it is beaten for small key spaces (one probe for m ≤ 2n − 2), and for large ones as soon as one cell may hold an encoded value (two probes for m ≥ 2^{16n²}). For QUESTION-114 it shows that “founding cell-probe paper” holds but “when storage in sorted order beats other arrangements” does not as worded: the theorem says nothing beats sorting under a no-encoding restriction for huge universes, and the rest of the paper shows other arrangements beating it. It counts lookup probes only; building the arrangement is free, so it bears nothing on whether sorting is amortized search or on the cost of organising set against lookups later. |
| LIT-1098 | Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs | Malkov and Yashunin (2020), IEEE TPAMI 2020. HNSW is a stack of proximity graphs on nested random subsets of the data. Each element’s top layer is drawn from a geometric distribution, and new neighbours are chosen by a pruning rule that favours diverse directions. Searching from the sparse top layer down makes per-query cost grow about logarithmically with N on uniform random data in 4 and 8 dimensions, which flat NSW graphs did not. The logarithmic bound is derived only for exact Delaunay graphs of bounded mean degree, which HNSW does not build. For the graphs it does build, logarithmic scaling is measured, at low dimension only, and on 200M SIFT vectors the paper reports the scaling “deviates from the pure logarithm”. The neighbour-selection rule is what keeps clustered data searchable: in the paper’s synthetic test with 100 isolated clusters, linking each element to its nearest neighbours fails to reach high recall. There is no worst-case or recall guarantee, no deletion, and no analysis of query distributions unlike the data. | Active — read in full 2026-10-15 from the authors’ arXiv preprint, version 4 of 14 August 2018 (arxiv.org/pdf/1603.09320v4, 13 pp., the last arXiv version, whose abstract matches the published one apart from copy-editing; the TPAMI body was not seen). Version 1 (2016) was compared: it claimed deletion, which v4 drops and lists as future work. Unpaywall and OpenAlex list no open-access copy of the TPAMI version. Worth reading as the source of the hierarchical graph index: nested proximity graphs on geometrically sampled layers, with a neighbour rule that keeps links between clusters. Its logarithmic search cost is derived only for exact Delaunay graphs of bounded degree, which it does not build, and is measured only on uniform random data in 4 and 8 dimensions; on 200M SIFT the scaling “deviates from the pure logarithm”. It gives no worst-case or recall guarantee and no deletion. For CLAIM-310 it shows, with bins replaced by graphs, that the arrangement of fixed data under a fixed distance decides cost and, on clustered data, whether items can be found at all; it narrows part 2, since the index is built without any query mix and every test drew its queries from the data. For QUESTION-114 it supplies a measured build-time against query-time curve and O(N log N) construction argued at low dimension, with insertion upkeep only. |
| LIT-1099 | When Is “Nearest Neighbor” Meaningful? | Beyer et al. (1999), ICDT ‘99. For a fixed number n of data points and a query drawn independently of them, if the variance of the p-th power of the query-to-point distance, divided by its mean, goes to zero as dimension m grows, then the farthest point is, with probability tending to one, within any factor 1 + ε of the nearest (Theorem 1). The condition holds for IID dimensions and for several correlated or non-identical workloads, and fails when data and queries lie on a low-dimensional subspace or when queries fall inside well-separated clusters. Simulations put the collapse of contrast within 10 to 20 dimensions for IID data, and two real image-feature sets showed weak contrast. The condition is sufficient, not shown necessary; the theorem is about the ratio of distances with n held fixed, and says nothing about real data of low intrinsic dimension except that such data can escape it. | Active — read in full 2026-10-15 from the authors’ University of Wisconsin–Madison technical report of the same title (CS TR #1377, June 1998, 19 pp.), served by the department’s archive (research.cs.wisc.edu/techreports/1998/TR1377.pdf) and, byte-identical, by the MINDS@UW repository (minds.wisconsin.edu/handle/1793/60174), which OpenAlex lists as the submitted version. The ICDT ‘99 chapter itself is closed (Unpaywall, OpenAlex, Semantic Scholar) and was not seen; the CiteSeerX copy redirects to the Internet Archive, which was unreachable. The report is a scan, read by OCR and page images. Worth reading as the source of the sufficient condition for nearest-neighbour contrast to vanish: if the variance of the p-th power of the query-to-point distance, divided by its mean, goes to zero, then with a fixed number of points the farthest is within any factor 1 + ε of the nearest with probability tending to one. IID coordinates satisfy it, and so do several correlated or non-identical workloads. Data on a low-dimensional subspace, and queries that land in well-separated clusters, do not. Simulations put the loss of contrast within 10 to 20 dimensions for IID data. The condition is sufficient and not shown necessary, n is held fixed, the result concerns the ratio of distances, and the paper measures no index. For CLAIM-309 it has no bearing, and the filing’s “no arrangement by similarity discriminates” overstates it. For CLAIM-310 it corroborates that what serves retrieval depends on the query distribution: the same clustered data is meaningful for queries inside clusters and not for uniform ones, and the meaningful answer there is the whole cluster. For QUESTION-114 it sets a precondition: under its condition there is no nearest neighbour worth organizing to find. |
| LIT-1100 | Answering Queries Using Views | Levy et al. (1995), PODS 1995. For conjunctive queries and views, a view can be used in an equivalent rewriting of a query exactly when there is a containment mapping (a homomorphism of bodies) from the view into the query, so every possible use of a stored view is found among those mappings. Without comparison predicates, a minimal rewriting needs no more literals than the query and no new variables, which puts the search in NP; deciding whether some rewriting uses a given set of views (with comparisons only in the query), whether a rewriting with fewer than k literals exists, and whether a rewriting using only the views exists are each NP-complete, and with comparisons in both query and views existence is Π2p-complete. The hardness has two independent sources, the number of mappings and the choice of which query literals to drop, and a polynomial algorithm removes the redundant literals for a given mapping, exactly under stated conditions. Only equivalent rewritings are studied; contained rewritings, the cost of the resulting plan and the size of view collections are outside it. | Active — read in full 2026-10-15 from the authors’ camera-ready of the PODS 1995 extended abstract (pp. 95–104), linked from Alberto Mendelzon’s University of Toronto publications page and fetched from www.cs.toronto.edu/pub/papers/pods95LMSS.ps.Z, because ACM’s open-access PDF refused requests from this environment. Worth reading as the paper that reduces reuse of stored views to query containment: a view can be used in an equivalent rewriting exactly when its body maps homomorphically into the query’s, a minimal rewriting is no longer than the query, and finding a rewriting, a shorter one or one using only the views is NP-complete for conjunctive queries without comparisons (Π2p-complete for existence with comparisons in both), with two independent sources of hardness (THEORY-389). For CLAIM-303 and CLAIM-308 it shows that recognizing that stored answers cover a new question is a worst-case NP-complete search in the size of the question and the stored items’ definitions, not in the stored data, so the per-use cost c_a has a recognition term that varies with the question and the store; it says nothing about prose arguments, contained (partial) reuse, or whether recognized reuse pays. |
| LIT-1102 | Lower Bounds on Near Neighbor Search via Metric Expansion | Panigrahy et al. (2010), FOCS 2010. Cell-probe lower bounds for near-neighbour search follow from the expansion of the graph joining points within distance r: a deterministic t-probe structure with m cells of w bits must have (mwt/n)^t at least the vertex expansion, and a randomized one must have m^t w/n at least the robust expansion at measure 1/m^t, on random data sets with weakly overlapping neighbourhoods. For the hypercube this recovers known bounds and gives, for example, space n^{1+Ω(1/(ct))} for approximation c and n^{Ω(1/(tε²))} for 1 + ε; for symmetric (Cayley) graphs a one-probe structure matches the bound, and for dynamic low-contention structures the update time must be at least the robust expansion over poly(t). The bounds are average case, for approximate decision search, and weak in t: they fall off exponentially in the number of probes, so they are tight only for a constant number of probes and say little about structures that probe n^ρ cells. | Active — read in full 2026-10-15 from the authors’ arXiv preprint (arXiv:1005.0418v1, 3 May 2010, 29 pp.); the FOCS 2010 text was not seen and has no open copy. Worth reading as the framework that turns the expansion of a metric’s neighbourhood graph into cell-probe lower bounds for approximate near-neighbour search: (mwt/n)^t ≥ vertex expansion for deterministic t-probe structures, m^t w/n ≥ robust expansion at measure 1/m^t for randomized ones, on random data with weakly overlapping neighbourhoods, giving for the hypercube space n^{1+Ω(1/(ct))} at approximation c and n^{Ω(1/(tε²))} at 1 + ε, a matching one-probe upper bound on Cayley graphs, and an update-time lower bound for dynamic low-contention structures. The bounds are average case, approximate, and fall off exponentially in the number of probes, so they are tight only for constant t. For THEORY-340 it is the similarity analogue of Yao’s lookup floor, holding with arbitrary cell encoding where Yao’s sorted-order optimality did not; for QUESTION-114 it puts a floor under fast per-query search priced in space, and the only lower bound on upkeep among the readings, in a restricted class, with no workload, amortization or build time; for CLAIM-310 its dependence on expansion is consistent with attribute bins working for discrete lookup (the record’s reading); no bearing on THEORY-345 or CLAIM-309. |
| LIT-1103 | The Small-World Phenomenon: An Algorithmic Perspective | Kleinberg (2000), STOC 2000. On an n × n lattice where each node also gets q long-range links drawn with probability proportional to d^(−r), short paths exist for r = 0, but no algorithm that sees only the links of nodes the message has visited finds them faster than about n^(2/3) steps in expectation. At r = 2 the greedy rule (pass to the contact nearest the target in lattice distance) delivers in O((log n)²) expected steps (proved for p = q = 1); for 0 ≤ r < 2 every such algorithm needs Ω(n^((2−r)/3)) and for r > 2 Ω(n^((r−2)/(r−1))). So efficient decentralized search depends on how the long-range links are distributed relative to the lattice, not on the links’ existence or on the graph’s diameter. The k-dimensional version (r = k) is stated without proof, and the model is a lattice with a known distance that every node can compute to the target. | Active — read in full 2026-10-15 (NOTE for LIT-1103) from the author’s own copy on Kleinberg’s Cornell page (www.cs.cornell.edu/home/kleinber/swn.pdf), a 14-page manuscript linked there under the STOC 2000 citation and footnoted as the version that is also Cornell CS Technical Report 99-1776; the ACM typeset proceedings (pp. 163–170) returned 403, and the Nature 2000 letter is a different work, not read. Worth reading as the source of the result that a network can have short paths that no searcher using local information can find: on an n × n lattice with long-range links drawn with probability proportional to d^(−r), greedy routing delivers in O((log n)²) expected steps at r = 2 (proved for one local and one long-range contact per node), every decentralized algorithm needs Ω(n^((2−r)/3)) steps for 0 ≤ r < 2 and Ω(n^((r−2)/(r−1))) for r > 2, and r = k in k dimensions is stated without proof. For CLAIM-310 it shows that findability, with nodes, lattice and link count fixed, turns on how the links are arranged relative to a distance every node can compute, which supports the claim’s “as arrangements” half; it narrows “only one distribution” to this family of inverse power laws and to polylogarithmic delivery, and it prices no cost of building the arrangement, so it adds nothing to QUESTION-114’s organizing cost. |
| LIT-1104 | Why and Where: A Characterization of Data Provenance | Buneman et al. (2001), ICDT 2001. The paper separates two meanings of the provenance of a piece of output data. Why-provenance is the witness basis: for each valuation of the query that produces the value, the part of the source the query’s patterns matched, one witness per derivation. Where-provenance is the location in the source a value was copied from. For a hierarchical data model and a query language that covers positive (SPJU) relational queries, the witness basis is preserved by the paper’s query rewriting, and the minimal witness basis is the same for equivalent queries with equality conditions, while where-provenance is not invariant over equivalent queries in general and is preserved by rewriting only for a restricted class it calls traceable. Proofs are omitted, and nothing covers negation, aggregation, updates or additions to the source. | Active — read in full 2026-10-15 (NOTE-920) from the authors’ postprint in the University of Pennsylvania’s ScholarlyCommons repository (repository.upenn.edu/handle/20.500.14332/6246, file k50.pdf, 15 pp., camera-ready text of October 2000 without LNCS page numbers), found through Unpaywall and OpenAlex (green, submittedVersion) and fetched through the repository’s API because the landing page is script-only; the Edinburgh repository handle (hdl.handle.net/20.500.11820/46e660d2-8247-4d26-ae49-65fd1bf8364b) returned an error. Worth reading as the source of the distinction between why-provenance, a set of witnesses with one per derivation, and where-provenance, the location a value was copied from, and of the result that only the first can be made independent of how a positive query is written (minimal witness basis, for queries with equality conditions; where-provenance only for “traceable” queries; proofs omitted) (THEORY-367). For QUESTION-105 it shows that a minimal witness basis is a retained state that decides survival under deletion of source facts in set semantics, and that “provenance” names two structures of which only one is invariant; it covers no additions, no negation or aggregation, no strengths of support and no measure of how much is retained. For CLAIM-303 it shows that why-provenance can be recomputed on demand from the query and the source rather than filed; for CLAIM-306 it has nothing for absence, since both notions are defined only for what is in the output. |
| LIT-1105 | Balancing Performance and Data Freshness in Web Database Servers | Labrinidis and Roussopoulos (2003), VLDB 2003. The paper poses Online View Selection for a web server whose database takes updates while serving requests: choose, as the workload runs, which page fragments (WebViews) to keep stored and refreshed on every update and which to cache and invalidate, so as to minimize mean response time while the fraction of fresh fragments served (QoD) stays above a threshold θ. Its algorithm, OVIS(θ), estimates per fragment the response-time and QoD change of switching, and periodically switches up to MAX_CHANGE fragments greedily, spending a QoD surplus on speed or buying back a deficit; it materializes everything when it detects backlog. Nothing is proved: optimality of the greedy step is asserted, and the evidence is one synthetic simulation with fixed costs, in which OVIS kept QoD near θ, answered faster than caching alone, and recovered from overload. Upkeep and query savings share one cost, but staleness is a constraint set by the user, not a priced term, and build cost, switching cost and storage are absent. | Active — read in full 2026-10-15 (NOTE-911) from the VLDB Endowment’s copy of the 2003 conference paper (www.vldb.org/conf/2003/papers/S13P01.pdf, 12 pp.; Crossref pages 393–404), whose bitmap fonts made OCR necessary; the 2004 VLDB Journal version was not read. Worth reading as the first online view-selection algorithm that trades response time against a measured freshness: OVIS(θ) periodically moves up to a fixed number of page fragments between cached-and-invalidated and stored-and-refreshed, greedily, to keep the share of fresh fragments served above θ at the least response time, and materializes everything when it detects backlog. For QUESTION-114 it is not the joint model: query savings and upkeep share one cost and staleness is measured, but staleness is a threshold, not a price, switching and storage are free, the greedy’s optimality is asserted without proof, and the evidence is one synthetic simulation with fixed costs; set beside Bruno and Chaudhuri (THEORY-332), which has build cost and no staleness, neither contains the other. For CLAIM-303 it adds a third option, keep the result and invalidate it on change, and measures staleness as a share of uses, not a cost. |
| LIT-1106 | Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality | Indyk and Motwani (1998), STOC 1998. Approximate nearest-neighbour search in d dimensions reduces, with small overhead, to a decision problem (is there a point within r, or none within (1+ε)r), and that decision problem is solved by locality-sensitive hashing: if hash functions make near pairs collide with probability at least p1 and far pairs with at most p2, then n^ρ random hash tables with ρ = ln(1/p1)/ln(1/p2) answer queries with O(n^ρ) hash evaluations in O(dn + n^{1+ρ}) space, with constant success probability. For Hamming space by bit sampling, and for ℓ_p with p in [1, 2] by embedding, ρ ≤ 1/(1+ε) in the 1999 text (1/ε, for ε > 1, in STOC). The paper also gives the other end of the trade: Õ(d) query time for n·O(1/ε)^d or (nd)^{O(1)} preprocessing. It is an upper bound only: it proves no lower bound, does not claim its exponents are best, solves only the approximate problem with constant probability, and counts preprocessing as space. | Active — read in full 2026-10-15 from the authors’ expanded “preliminary version” of December 30, 1999, served from Indyk’s MIT directory (people.csail.mit.edu/indyk/nndraft.ps), with its statements compared against the STOC 1998 printed text (pp. 604–613) as posted on a Princeton course page (cs.princeton.edu/courses/archive/spr04/cos598B/bib/IndykM-curse.pdf); the ACM copy refused requests and Unpaywall and OpenAlex list no open copy. The 2012 Theory of Computing journal version (with Har-Peled) was not read. Worth reading as the origin of locality-sensitive hashing and of the reduction from approximate nearest neighbour to its decision version: hash functions that make near pairs collide more often than far ones give n^ρ tables, O(dn + n^{1+ρ}) space and O(n^ρ) hash evaluations per query, ρ = ln(1/p1)/ln(1/p2), which for Hamming bit sampling is at most 1/(1+ε) in the 1999 text (1/ε, for ε > 1, in STOC), with constant success probability; bucketing gives Õ(d) queries for n·O(1/ε)^d preprocessing. Upper bounds only, approximate only, and preprocessing is counted as space. For QUESTION-114 it is the first price list for organizing a collection for similarity queries, space paid once against hash evaluations per query, with no amortization over queries and no workload; for CLAIM-310 it shows the single-arrangement constraint escaped by keeping many random partitions and storing every point in each, paid for in space; it neither extends nor narrows THEORY-340 and has no bearing on THEORY-345 or CLAIM-309. |
| LIT-1107 | A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces | Weber et al. (1998), VLDB 1998. Under uniformly distributed, independent data and queries in the unit cube with Euclidean distance, the paper estimates the average fraction of blocks that an optimal nearest-neighbour search must read in a partitioned or clustered index. That fraction reaches the 20% at which a sequential scan wins, given an assumed five-fold sequential advantage, at about 15–20 dimensions for rectangular regions, 26 for spherical ones, and below a crude 610 for any partitioning into convex clusters of two or more points. The “around 10” in the abstract is the measured crossover for an R*-tree and an X-tree on 50,000 uniform points and on 45-dimensional image features. As an alternative it proposes the VA-file, a scanned file of compact per-vector approximations that filters out all but a few vectors. The analysis says nothing about data with low intrinsic dimension; that the results carry over by fractal dimension is a conjecture. | Active — read in full 2026-10-15 from the VLDB Endowment’s open copy of the proceedings paper (www.vldb.org/conf/1998/p194.pdf, pp. 194–205, a scan with an OCR text layer, fetched with a browser User-Agent header). Worth reading as the standard average-case analysis of why partitioned indexes for nearest-neighbour search lose to a sequential scan as dimension grows, and as the source of the VA-file. Under uniform, independent data in the unit cube with Euclidean distance, an assumed five-fold sequential advantage and a 20% line, the fraction of blocks an optimal search reads crosses that line at about 15–20 dimensions for rectangular bounding regions, 26 for spherical ones, and below a crude 610 for any partition into convex clusters of two or more points. The “around 10” usually cited is the measured crossover for an R*-tree and an X-tree on 50,000 uniform points and 45-dimensional image features. The bounds substitute the expected nearest-neighbour distance for each query’s own, and they are evaluated by Monte Carlo. Data of low intrinsic dimension are outside the analysis except by an untested fractal-dimension conjecture. For QUESTION-114 it shows a regime where organizing into bins does not pay even with building free, and where the remedy is a scanned file of compact per-item approximations, not a better partition. For CLAIM-310 it marks where arrangement stops doing work: similarity over many coordinates the query does not name, unlike LEGO bins, where queries name a few discrete attributes. It has no bearing on CLAIM-309. |
| LIT-1109 | Adaptive Precision Setting for Cached Approximate Values | Olston et al. (2001), SIGMOD 2001. Olston, Loo and Widom set the width of each cached interval adaptively to minimize total refresh traffic. A narrow interval is escaped often (value-initiated refreshes, cost C_vr); a wide one is too imprecise for queries more often (query-initiated refreshes, cost C_qr). Under a model in which these probabilities go as 1/W² and W, the expected cost rate is least where ρ·P_vr = P_qr, ρ = 2C_vr/C_qr, and a rule that widens on value-initiated and narrows on query-initiated refreshes, with probabilities set by ρ, reached within 1% to 5% of the best fixed width in simulation. That the rule converges is argued, not proved. With exact copies required it matched an adaptive exact-caching algorithm, and where imprecision was allowed it beat it. Staleness is priced as refresh traffic only: there is no build cost, no cost of a wrong answer, and the interval is never wrong. | Active — read in full 2026-10-15 from the copy in the University of Pennsylvania’s repository (ScholarlyCommons cis_papers 1351, repository.upenn.edu/server/api/core/bitstreams/92340f91-673c-435e-9b4e-b24072d4d96b/content), the camera-ready text with printed pages 355–366. Worth reading as the one model the record holds in which staleness and upkeep are traded in a single objective: a cached interval of width W is escaped (a pushed refresh, cost C_vr) more often when narrow and is too loose for queries (an exact fetch, cost C_qr) more often when wide, and under the paper’s model the least expected cost is where ρ·P_vr = P_qr with ρ = 2C_vr/C_qr (THEORY-386); a rule that widens on one kind of refresh and narrows on the other came within 1–5% of the best fixed width in simulation and, restricted to exact copies, matched an adaptive cache-or-not algorithm (THEORY-377). For QUESTION-114 it prices staleness as refresh traffic, with no build cost, no stored answers and no cost of a wrong answer, since the source guarantees validity. For CLAIM-303 it gives upkeep and per-use verification a common dial, but only where a source sees every change; for CLAIM-308 its exact-caching case is a forecast-free counting rule justified in expectation, not in the worst case, and once staleness is admitted the two-state choice becomes a continuum with an interior optimum. |
| LIT-1110 | Provenance Semirings | Green et al. (2007), PODS 2007. Annotating each input tuple with an element of a commutative semiring, and computing union and projection with + and join with ·, gives one positive relational algebra (RA+) that is set semantics over the Booleans, bag semantics over the naturals, c-tables over positive Boolean expressions, event tables over sets of outcomes, and lineage over sets of tuple ids. The polynomials N[X] in the tuple ids are the most general such annotation: for any RA+ query and any commutative semiring K, the K-annotated answer is the provenance polynomial evaluated at the input’s K-annotations (Theorem 4.3). For datalog the paper needs ω-continuous semirings and formal power series N∞⟦X⟧, with the analogous factorization (Theorem 6.4) and a criterion for infinite coefficients (Theorem 6.5). Everything is positive: no negation, difference or aggregation, and revaluing inputs can only remove output tuples, never add them; trust and deletion propagation are not treated. | Active — read in full 2026-10-15 (NOTE-913) from the authors’ postprint in the University of Pennsylvania’s ScholarlyCommons repository (repository.upenn.edu/handle/20.500.14332/8764, file pods07.pdf, 10 pp., posted by permission of ACM), found through Unpaywall and OpenAlex (green, submittedVersion) and fetched through the repository’s API because the landing page is script-only. Worth reading as the source of semiring provenance: for positive relational algebra over any commutative semiring the annotated answer is the provenance polynomial in N[X] evaluated at the input annotations, and for datalog over ω-continuous semirings the same holds with formal power series in N∞⟦X⟧ (THEORY-373, THEORY-380). For QUESTION-105 it shows that retaining one polynomial per output suffices for every revision that re-annotates input facts in a commutative semiring, deletion included, without rerunning the query; it proves no minimality, and it excludes added facts, negation and contraction. Its “why-provenance” is one set of contributing tuples per output, coarser than the witness basis of LIT-1104 that it cites as the same notion, and its structure for it fails its own semiring axioms. Deletion propagation and trust are not in the paper; deletion follows from Theorem 4.3 as the record’s application. For CLAIM-293 the polynomial separates joint from alternative support but, like topology, leaves the strengths to the valuation; for CLAIM-306 it has no account of absence. |
| LIT-1111 | Optimal Implementation of Conjunctive Queries in Relational Data Bases | Chandra and Merlin (1977), STOC 1977. Defines conjunctive queries (existentially quantified conjunctions of atoms, no equality, constants naming distinct elements) and proves that two are equivalent exactly when there are homomorphisms each way between their natural models (Lemma 13). Every conjunctive query has a minimal equivalent query, unique up to isomorphism, reached by folding (Theorem 12), and that minimal query yields an evaluation program within a constant factor of optimal in the paper’s cost model (Theorem 16). The hardness results are that evaluating a boolean conjunctive query on a database is NP-complete when the query is part of the input (Theorem 7), and that deciding whether one query is a folding of another is NP-complete (Theorem 11). The paper does not state a containment theorem or the NP-completeness of containment or equivalence as such; both are standard corollaries of Lemma 13’s proof and Theorem 11’s construction, and later papers cite them to it. | Active — read in full 2026-10-15 from a scan of the published STOC 1977 paper (pp. 77–90) hosted in the directory of UBC’s course CPSC 504 (www.cs.ubc.ca/~laks/cpsc504/chandra-merlin-1977.pdf), because ACM’s open-access PDF refused requests from this environment; key statements checked against page images, the OCR layer being poor. Worth reading as the source of the homomorphism criterion for conjunctive queries: two are equivalent iff homomorphisms run both ways between the queries read as small databases (Lemma 13), every one has a minimal equivalent unique up to isomorphism (Theorem 12), and evaluating a conjunctive query with the query as input is NP-complete (Theorem 7), as is recognizing a folding (Theorem 11) (THEORY-371). It states equivalence, not containment, and does not state that containment is NP-complete; both are corollaries later work attributes to it. For CLAIM-303 it gives the base procedure, and the worst-case cost, of deciding that a stored answer covers a new question, in the size of the two descriptions; it says nothing about prose arguments or typical cost. |
| LIT-1112 | Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations | Indyk and Xu (2023), NeurIPS 2023. For DiskANN’s “slow preprocessing” graph (each point linked to the points that survive α-pruning of all other points, naively O(n³) time), greedy search from any start with no backtracking reaches a ((α+1)/(α−1) + ε)-approximate nearest neighbour in O(log_α(∆/((α−1)ε))) steps, each costing O((4α)^d log ∆) for doubling dimension d and aspect ratio ∆; the ratio is tight and the dependence on ∆ cannot be replaced by log n. For DiskANN with its practical “fast preprocessing”, HNSW, NSG and seven other graph indexes, the paper constructs two-dimensional point sets (constant doubling dimension) on which, in experiments with the authors’ code at the authors’ recommended parameters, the search queue must hold about 10% of the points before recall@5 becomes non-zero or the approximation ratio becomes reasonable. The linear lower bounds are empirical, for one query per constructed instance, with an informal Ω(n/R) argument for fast-preprocessing DiskANN; no theorem bounds HNSW or NSG. | Active — read in full 2026-10-15 (NOTE for LIT-1112) from the authors’ arXiv preprint (arxiv.org/abs/2310.19126v1, the only version, which carries the NeurIPS 2023 line and is the camera-ready text), including Appendices A–C. Worth reading as the first worst-case analysis of graph-based nearest neighbour indexes: DiskANN built by “slow preprocessing” (every point pruned against all others with α > 1, naively O(n³)) is proved to give a ((α+1)/(α−1) + ε)-approximate neighbour in O(log_α(∆/((α−1)ε))) greedy steps of cost O((4α)^d log ∆), for doubling dimension d and aspect ratio ∆, with both the ratio and the ∆ dependence shown tight; for DiskANN as implemented, HNSW, NSG and seven others, two-dimensional constructed instances made recall@5 zero or near zero until the search queue held about 10% of the points, an empirical result with no theorem behind it for those algorithms. For CLAIM-310, with LIT-1103, it shows on one fixed point set that the graph built over it, not the points, decides between finding the nearest neighbour in two steps and scanning a tenth of the collection, and that the guarantee rests on a stated property of the arrangement (from every point, some edge gets α times closer to any target); for QUESTION-114 it is a case where an expensive build buys a worst-case guarantee, without a measured break-even or upkeep. |
| LIT-1113 | Semantic Data Caching and Replacement | Dar et al. (1996), VLDB 1996. A client cache described by the selection predicates of past queries can answer a new selection query partly from cache (the probe query, Q ∧ V) and fetch only the rest from the server (the remainder query, Q ∧ ¬V), and can evict by semantic region rather than by page or tuple. In one simulator, one client and one server, read-only selection queries on a single 10,000-tuple relation, this matched page caching on a clustered index, beat it heavily when clustering was bad, answered over 60% of small queries on an unindexed attribute with no server contact, and let a value function based on semantic distance beat LRU on a skewed workload. No replacement rule won everywhere: on regular cyclic paths MRU was best. Everything is measured, nothing is proved; updates, joins, and the CPU cost of reasoning about cache contents were not modelled. | Active — read in full 2026-10-15 from the VLDB Endowment’s copy of the proceedings paper (www.vldb.org/conf/1996/P330.PDF, pp. 330–341, a scan with an OCR layer; tables, formulas and figures read from page images). Worth reading as the source of semantic caching: a cache described by the predicates of past queries answers a new selection query partly from storage (probe, Q ∧ V) and fetches only the remainder (Q ∧ ¬V), and evicts whole query-shaped regions ranked by recency or by distance from the current query (THEORY-376, THEORY-375). All results are from one simulator with one client, one server, read-only selection queries on one relation, and no charge for reasoning about the cache. For CLAIM-303 it shows that reuse of a stored answer can be partial, with savings set by the overlap with the new question, and that the access term c_a takes the form of a containment test the paper does not cost; it says nothing on staleness. For CLAIM-308 and THEORY-348 its replacement rules are forecasts, not break-even rules, and none dominates: distance beat LRU where queries had semantic locality, MRU beat both on regular cycles, and no rule weighs refetch cost. |
| LIT-1114 | Maintaining Views Incrementally | Gupta et al. (1993), SIGMOD 1993. Two algorithms compute the changes to a stored derived relation (a view) from changes to the base relations, without recomputing it. Counting stores, for each derived tuple, the number of its derivations and propagates signed counts through delta rules stratum by stratum; it is stated correct for nonrecursive Datalog or SQL views with stratified negation and aggregation, under set or duplicate semantics, and is argued to cost little beyond evaluating the view. DRed (delete and rederive), for recursive views under set semantics only, deletes an overestimate of what a deletion invalidates, puts back those tuples that still have a derivation from what remains, then adds what insertions derive; it is stated to yield exactly the tuples derivable from the new base. The paper is an extended abstract: the theorems are stated without proof (proofs are referred to a 1992 AT&T report), cost claims are argued, not measured, and there are no experiments. | Active — read in full 2026-10-15 from the ACM’s typeset PDF of the SIGMOD ‘93 extended abstract (pp. 157–166), as posted on Columbia University’s Ph.D. candidacy exam reading list in database systems (www.cs.columbia.edu/~gravano/Qual/Papers/13%20-%20Maintaining%20Views%20Incrementally.pdf); a scan with an OCR layer, so definitions and theorems were read from page images. The full version with the proofs (AT&T Bell Labs TR 921214-19-TM, 1992) was not found. Worth reading as the source of the two standard incremental view maintenance algorithms: counting, which stores one derivation count per derived tuple and is stated correct for nonrecursive views with stratified negation and aggregation under set or duplicate semantics (THEORY-362), and DRed, which for recursive views under set semantics overdeletes, rederives what still has a derivation and then inserts, and is stated to give exactly what the new base derives (THEORY-387). The theorems are stated without proof here, and cost claims are argued, not measured. For QUESTION-105 it shows that, for revisions given as changes to base facts under a fixed program, the retained state can be a count per conclusion when support is acyclic and nothing beyond the materialization when it is not, with support rechecked at revision time; neither is provenance or a record of defeated alternatives. For CLAIM-303 it shows the dependency-tracking cost can sit at derivation time (counting) or at revision time (DRed), without measuring either, and that a view kept this way never goes stale. |
| LIT-1115 | Optimal Aggregation Algorithms for Middleware | Fagin et al. (2001), PODS 2001. Given m lists of the same N objects, each sorted by one attribute’s grade, and a monotone function combining the grades, the threshold algorithm (TA) reads the lists in parallel, random-accesses each newly seen object’s other grades, and stops once k seen objects score at least the combined score of the last grades read. It is correct for every monotone combining function, needs constant buffers, and is instance optimal among correct algorithms that make no “wild guesses”: on every database its cost is within a constant factor of any such algorithm’s, the factor being m + m(m−1)c_R/c_S, which is best possible when the combining function is strict (conjunction-like). Without the no-wild-guesses restriction no algorithm is instance optimal, and the counterexample is a two-list conjunction whose target sits in the middle of both lists, which any algorithm must search linearly. Fagin’s Algorithm’s sublinear cost O(N^((m−1)/m) k^(1/m)) is cited from Fagin, not proved here, and holds only when the lists’ orderings are probabilistically independent. The model prices queries over a given set of single-attribute sorted lists. It does not price building or keeping the lists, choosing an arrangement, or any computation beyond accesses. | Active — read in full 2026-10-15 from the authors’ arXiv preprint (arXiv cs/0204046v1, arxiv.org/pdf/cs/0204046v1), which is the full version of which the PODS 2001 paper is the extended abstract; neither the PODS text nor the JCSS 2003 journal text was obtained (both returned 403), so the theorems read are the full version’s and the preprint’s Table 1, which halves the random-access term the theorems state, could not be checked against the journal. Worth reading as the source of the threshold algorithm’s guarantee: for top-k retrieval under any monotone combining function from m lists each sorted by one attribute, TA is within m + m(m−1)c_R/c_S of every correct algorithm that makes no wild guesses, on every database, and that ratio is best possible when the function is strict (conjunction-like). For CLAIM-310 and THEORY-358 it shows that a query on one attribute costs about k accesses whatever the collection’s size, while a conjunction whose distractors each carry one of the target’s two features is the paper’s own counterexample (Example 6.3, Theorem 6.4), costing about half the objects for any algorithm; Fagin’s sublinear N^((m−1)/m)k^(1/m) holds only when the lists’ orderings are independent, which Treisman’s displays are built not to be. It says nothing about search times, the 1:2 present/absent ratio or whether vision reads sorted lists. For QUESTION-114 it prices querying a given set of single-attribute orders, with no build, upkeep or space cost. |
| LIT-1116 | Answering Queries Using Views: A Survey | Halevy (2001), VLDB Journal 2001. A survey that separates two problems of answering queries from stored views: finding an equivalent rewriting, which query optimization needs, and finding a maximally-contained rewriting or all certain answers, which data integration needs when sources are incomplete. Its theoretical findings, mostly reported from other papers: an equivalent conjunctive rewriting exists only if one exists no longer than the query, so finding one is NP-complete in the size of the query and view definitions, and checking a candidate is itself NP-complete; the inverse-rules algorithm builds the maximally-contained rewriting, as a possibly recursive datalog program, in time polynomial in the query and views; and finding all certain answers is polynomial in the size of the stored data in many open-world cases, but co-NP-hard in that size under the closed-world assumption even for conjunctive views and queries, or open-world with union in the views or ≠ in the query. Choosing which views to store is left as the next problem; cost-based choice among rewritings is described for practical optimizers, without guarantees. | Active — read in full 2026-10-15 from the publisher’s PDF (VLDB Journal 10: 270–294) hosted on Columbia’s database Ph.D. candidacy-exam reading list (www.cs.columbia.edu/~gravano/Qual/Papers/halevy01.pdf); reference list scanned, not read. Worth reading as the map of answering queries from stored views: equivalent rewritings for optimization against maximally-contained rewritings and certain answers for incomplete sources, with the complexity results of the field as it reports them (THEORY-374). For CLAIM-303 and CLAIM-308 it shows that recognizing reuse is graded: certifying that stored answers settle a question exactly is NP-complete in the size of the question and definitions, extracting what they do give is polynomial (inverse rules) without saying whether it is all, and finding all certain answers from the stored contents is co-NP-hard in their size under the closed-world assumption. For QUESTION-114 it puts this recognition step upstream of view selection, which it names as the open problem. Its results on certain answers and inverse rules are reported from papers the record has not read. |
| LIT-1117 | Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data | Olston and Widom (2000), VLDB 2000. Olston and Widom propose TRAPP: caches hold, for each numeric value, an interval its source guarantees to contain the current value, the source pushing a refresh whenever the value leaves it. A query carries a precision constraint R, and the system chooses which values to fetch exactly so that the answer interval is at most R wide whatever the true values, at least total refresh cost. For SUM (and AVG without a predicate) that choice is a 0/1 knapsack problem, NP-complete in general and polynomial with equal costs; COUNT and MIN have simple rules. Staleness becomes bounded imprecision, never error, and the cost of the source-side upkeep that guarantees this, and of setting the bound widths, is outside the optimization. The one experiment is 90 stock prices with random costs. | Active — read in full 2026-10-15 from the VLDB Endowment’s open copy of the proceedings paper (www.vldb.org/conf/2000/P144.pdf, pp. 144–155; the server needs a browser User-Agent). Worth reading as the source of the idea that a cached value can be held as an interval its source guarantees, so that staleness becomes a bounded, stated imprecision instead of an unknown error, and a query buys precision down by paying for exact reads; for SUM, choosing the cheapest reads that meet a width R is a 0/1 knapsack problem (THEORY-364). For QUESTION-114 it gives staleness a unit (bound width against a query’s tolerance) and prices only the query side: the source’s upkeep that makes the bound a guarantee, and the choice of bound widths, are assumed and uncosted, imprecision is a hard constraint rather than a loss, and a stale read can never be wrong. For CLAIM-303 it sharpens “verification” into a per-use decision against a stated tolerance, but rests on a source that watches every copy, which a filed argument lacks, so it does not price the cost of reusing an obsolete conclusion; it does not bear on CLAIM-308’s rent-or-buy argument. LIT-1109 prices the upkeep side. |
| LIT-1118 | WebView Materialization | Labrinidis and Roussopoulos (2000), SIGMOD 2000. For a page built from database queries, the paper compares three ways to serve it on a server with online updates: compute it on each request (virt), store the query result in the DBMS and refresh it on every update (matdb), or store the finished page as a file at the web server and rewrite it on every update (matweb). It gives a cost model summing access and update costs by their frequencies and states the selection problem (choose a policy per page to minimize mean response time, no space limit, no staleness allowed), but gives no algorithm for it. On one Apache/Informix testbed with cheap indexed queries, matweb answered 10 to 230 times faster than the other two at all loads tried, and matdb was slower than virt whenever there were updates, because reading the stored result cost about as much as recomputing it. Staleness is defined as the delay from update to reply, sketched, and never measured; build cost and storage are outside the model. | Active — read in full 2026-10-15 (NOTE-908) from the authors’ camera-ready copy on the University of Maryland Opsis project page (www.cs.umd.edu/projects/opsis/papers/2000/webviews.pdf, 12 pp., dated 1 March 2000); the ACM Digital Library copy returned 403. Worth reading as the first cost model for choosing, per database-generated web page, between computing it on request, storing the query result in the DBMS, and storing the finished page at the web server, with every stored copy refreshed on each update; on one Apache/Informix testbed the page stored at the web server answered 10 to 230 times faster, and the result stored in the DBMS lost to recomputation whenever there were updates, because reading it cost about as much as rebuilding it. For QUESTION-114 it prices access and upkeep by frequency and adds where the copy is stored, but forbids staleness, has no build cost or storage term, and states the selection problem without an algorithm; for CLAIM-303 it shows filing failing through access cost alone, and upkeep slowing the unfiled reads that share its resource (by 236% in its model check). |
| LIT-1119 | Synchronizing a Database to Improve Freshness | Cho and Garcia-Molina (2000), SIGMOD 2000. For a local copy of N items, each changing as an independent Poisson process with a known rate and refreshed at fixed intervals under a fixed total refresh rate, refreshing every item equally keeps the copy fresher and younger on average than refreshing in proportion to change rate, under any distribution of rates (proved in the technical report by convexity). The freshness-optimal allocation is neither: it rises and then falls with change rate, and gives no refresh at all to items that change too fast for the budget, while the age-optimal allocation rises slowly with change rate. On estimates from 270 web sites, proportional, uniform and optimal refresh give freshness 0.12, 0.57 and 0.62. Every item matters equally, staleness is a time average with no access or query model, the refresh budget is fixed rather than priced, and refresh, change and its detection are free of any other cost. | Active — read in full 2026-10-15 from the conference version as published, the PDF of SIGMOD 2000 pp. 117–128 served by ACM SIGMOD’s SIGMOD Record site for the June 2000 proceedings issue (sigmodrecord.org/publications/sigmodRecord/0006/pdfs/Synchronizing%20a%20Database%20to%20Improve%20Freshness.pdf), with the proofs it defers checked in the authors’ 1999 Stanford technical report as hosted on a KTH course page. Worth reading as the standard definition of a copy’s freshness and age under Poisson change, and for the result that, under a fixed refresh budget, refreshing every item equally beats refreshing in proportion to change rate for any distribution of rates, while the freshness-optimal allocation gives nothing to items that change too fast to follow. For QUESTION-114 it is the first reading that prices staleness instead of forbidding it, but as an objective under a fixed budget, with no reads, no query savings and no build cost, so it supplies the staleness term and not the joint model; for CLAIM-303 it models the re-checking term per unit time and by rate of change, not per use, and does not price the cost of a stale use. |
| LIT-1120 | Optimal Hashing-based Time-Space Trade-offs for Approximate Near Neighbors | Andoni et al. (2017), SODA 2017. For c-approximate near-neighbour search (find a point within cr when one lies within r) over n points in Euclidean space, the paper gives a data structure for every pair of exponents with c²√ρq + (c²−1)√ρu ≥ √(2c²−1), using space n^{1+ρu+o(1)} + O(dn) and query time n^{ρq+o(1)} + dn^{o(1)}, on worst-case data (for Hamming and ℓ_1, c√ρq + (c−1)√ρu ≥ √(2c−1)). It proves the curve cannot be beaten by list-of-points structures, the model of all known data-independent hashing schemes, on random instances, and unconditionally in the cell-probe model only at one end (query n^{o(1)}) for one or two probes. So the exact trade between space spent organizing and per-query time is known within the hashing model; outside that model, for more than two probes, it is not, and data-dependent schemes are covered only by conjecture. | Active — read in full 2026-10-15 from the authors’ arXiv full version (arXiv:1608.03580v2, 21 May 2017, 62 pp.), which merges the two preprints behind the SODA 2017 extended abstract; the SODA text itself was not seen, and the quantum-information steps of the two-probe proof were followed, not checked. Worth reading as the exact time–space curve for approximate near-neighbour search: for every c > 1, space n^{1+ρu+o(1)} and query time n^{ρq+o(1)} whenever c²√ρq + (c²−1)√ρu ≥ √(2c²−1) in Euclidean space (c√ρq + (c−1)√ρu ≥ √(2c−1) in Hamming and ℓ_1), on worst-case data, and optimal for list-of-points (hashing-based) structures on random instances, with unconditional cell-probe matches only for one or two probes at the n^{o(1)}-query end (n^{(c/(c−1))²−o(1)} words). For QUESTION-114 it prices organizing against per-query cost exactly within the hashing model, as replication of each point into n^{ρu} lists against n^{ρq} lists scanned, and its closest-pair remark makes the best point depend on the number of queries; it says nothing about workloads, query mixes, build cost beyond space, exact nearest neighbours or structured data, and data-dependent schemes are covered only by conjecture. For CLAIM-310 it shows overlapping bins are needed for fast similarity queries; for THEORY-340 it gives the similarity analogue of Yao’s lookup floor in the unrestricted cell-probe model at one and two probes; no bearing on THEORY-345 or CLAIM-309. |
| 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-1124 v2 | Reconceptualizing Organizational Routines as a Source of Flexibility and Change | Feldman & Pentland (2003), ASQ 48(1):94–118. A routine has an ostensive aspect, the pattern as participants understand, invoke and account for it, and a performative aspect, its particular enactments; the ostensive guides, accounts for and names performances, and performances create, maintain and modify the ostensive, so variation and selective retention inside a routine make it a source of endogenous change as well as of stability. Theory, illustrated with academic hiring. | Active — read 2026-10-29 (NOTE-1386) in full, from UC Irvine’s eScholarship deposit of the published pages, by OCR; worth reading as the paper that splits a routine into an ostensive aspect, the pattern as participants understand and refer to it, and a performative aspect, its enactments, each making the other, so that a routine can change endogenously by variation and selective retention within it. Read it knowing that it is theory with one illustrative example and no data, that its analysis stays inside one routine in one organization, and that it does not separate a particular organization’s continuity from reproduction of a kind, which was A6’s question for it; it only doubts that routines carry unchanging genealogical information between organizations. |
| 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-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-1130 v2 | Flow-based reputation with uncertainty: evidence-based subjective logic | Škorić, de Hoogh & Zannone (2016). Replaces subjective logic’s opinion discounting with an evidence-scaling discount that distributes over consensus, so reputation can be computed by a flow-based fixed point on arbitrary trust networks, loops included, without double-counting or discarding evidence, keeping referral and functional trust apart. | Active — read 2026-10-29 (NOTE-1354) in full, from arXiv’s own copy (v2); worth reading for the diagnosis that subjective logic’s discounting does not distribute over its evidence-adding consensus, which forces trust networks into canonical form and discards edges, and for the fix: discounting as scaling of evidence, x ⊡ y = g(x)·y, which distributes, so a PageRank-like fixed point handles loops without discarding information. Read it knowing that there is no ground truth and no attack model (self-promotion and Sybil attacks are left for future work), that convergence is observed and not proved, that g is left open, and that its loop example shows a referrer’s opinion can make a trust near-certain whatever the direct opinion says. |
| LIT-1133 v2 | Belonging to a community of European fans? European common in-group identity formation through football fandom | Biel (2026). Surveys in Germany, Spain, Poland and Norway find a distinct European fan identity among a substantial share of fans, associated with youth, education, attachment to Europe and international football consumption. | Active — read in full 2026-10-29 (NOTE-1299) from the CC BY published article; worth reading as the survey evidence that football fans identify with a European community of fans as well as with club and nation, and that this identification goes with trust in foreign fans and cross-border viewing but not with views of football governance. Single items, cross-sectional; its percentages use a denominator other than the analysed n. Source of THEORY-1116. |
| LIT-1134 v3 | Persuasion Bias, Social Influence, and Unidimensional Opinions | DeMarzo, Vayanos & Zwiebel (2003). Agents who average the reports of those they listen to with fixed weights, treating every round’s report as new (persuasion bias), reach a consensus weighted by the stationary distribution of the listening matrix, so influence depends on network position as well as precision; the consensus is correct only if the network is balanced, and rational agents who know the network reach the correct beliefs in at most N² rounds. Long-run differences of opinion line up along a single axis across all issues, set by the second eigenvectors. | Active — read 2026-10-29 (NOTE-1392) in full, from the LSE Research Online copy of the authors’ version of April 2003; worth reading as the paper that reads DeGroot averaging as a bias, failing to discount repeated information, and derives from it that consensus weights are the listening matrix’s stationary distribution, correct only in balanced networks, and that long-run disagreement lines up on one axis across all issues. Read it knowing that its listening weights are fixed and reports truthful, so it gives capture without fidelity but no hysteresis or feedback from outcome to authority, that its political and marketing applications are conjecture, and that only the proofs of Theorems 2 and 3 were followed. |
| LIT-1135 v2 | Organizational Identity, Image, and Adaptive Instability | Gioia, Schultz & Corley (2000), Academy of Management Review 25(1):63–81. Organizational identity is better seen as continuous than enduring: its labels persist while their meanings shift, because members compare who they think they are with how they think outsiders see them and change identity or image to close the gap; the authors call the resulting instability adaptive, since it helps organizations change. Conceptual, illustrated with Shell’s Brent Spar, IBM, Oticon and British Airways. | Active — read 2026-10-29 (NOTE-1389) in full, from Imperial College London’s Spiral repository, which deposits the published version; worth reading as the argument that organizational identity has continuity rather than endurance: its labels persist while their meanings shift, driven by members’ comparison of who they think they are with how they think outsiders see them, and that this instability helps organizations adapt. Read it knowing that it is conceptual, illustrated only by chosen successes of deliberate change (Shell, IBM, Oticon, British Airways) with no data, that “adaptive” is not measured, and that it poses, without answering, when a changed identity is still the same one. |
| 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-1142 v2 | The Oral History of ‘I’m the Juggernaut, Bitch!’ | Siegel (2024). Journalism: interviews with the makers of the 2006 “Juggernaut, Bitch!!” redub and others, and Simon Kinberg’s quoted remark, via Polygon, that the film’s line “was a reshoot Ratner line”. | Active — read in full 2026-10-29 (NOTE-1272) from theringer.com; worth reading as the only source for CASE-100’s timeline, with the creators’ own account. It dates the line’s addition to the film (a reshoot, per Kinberg via Polygon) but gives no production testimony on why the line was added: that the director had seen the video is the writer’s inference. |
| LIT-1144 v2 | Imprinting: Toward a Multilevel Theory | Marquis & Tilcsik (2013), Academy of Management Annals 7(1):195–245. Imprinting is a process in which, during a brief sensitive period, an entity develops characteristics reflecting prominent features of its environment that persist despite later environmental change; the review separates it from path dependence and cohort effects, orders the literature by four levels (collectives, organizations, building blocks, individuals) and three sources, and proposes layered imprints from several sensitive periods and secondhand imprinting by emulation. | Active — read 2026-10-29 (NOTE-1373) in full, from the University of Toronto’s TSpace copy of the typeset article; worth reading as the review that defines imprinting by a brief sensitive period, the stamp of the environment during it and persistence despite later change, separates it from path dependence and cohort effects, and orders the literature across four levels of analysis. Read it knowing that its extensions, layered imprints from several sensitive periods and secondhand imprinting by emulation, are proposals with little evidence, that the studies it surveys are mostly correlational, and that it asks which features persist in an entity whose identity is fixed, never when a bearer of another’s imprint is that entity continuing. |
| 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-1146 v2 | Opinion Dynamics and the Evolution of Social Power in Influence Networks | Jia, MirTabatabaei, Friedkin & Bullo (2015). In the DeGroot–Friedkin model, DeGroot averaging on each issue with self-weights set by reflected appraisal across issues, self-weights converge from every non-autocratic start to one equilibrium ordered by the eigenvector centralities of the fixed relative interpersonal weights: power accumulates at the top, is autocratic exactly for a star network (whose centre has centrality 1/2) and democratic exactly for a doubly stochastic one, and members no path of influence reaches end with none. | Active — read 2026-10-24 (NOTE-1135) from the version of record posted on the last author’s site, proofs skimmed; worth reading as the exact analysis of reflected appraisal under DeGroot dynamics. With fixed relative interpersonal weights, self-weights converge from every non-autocratic start to one equilibrium ordered by eigenvector centrality; power accumulates above a threshold, is autocratic exactly for a star and democratic exactly for a doubly stochastic network, and members no path of influence reaches end with none. Theorems about a model; the authors say its validity and robustness are not yet established. |
| LIT-1147 v2 | Enemies with benefits: the dual role of rivalry in shaping sports fans’ identity | Berendt (2016). A survey of 571 supporters at eight Bundesliga clubs: rivalry lowers public collective self-esteem relative to the rival’s fans but raises it relative to others, and raises perceived ingroup distinctiveness and cohesion. | Active — read in full 2026-10-29 (NOTE-1303) from the authors’ accepted manuscript in the Hochschule Hannover repository (CC BY-NC-ND); worth reading as the structural model showing rivalry’s two faces for fans, less regard from the rival’s fans and more in-group distinctiveness, cohesion and regard from others, with the gains carried by perceived reciprocity of the rivalry rather than disidentification. One cross-sectional sample, N = 571, with fans who named no rival excluded. Source of THEORY-1113. |
| LIT-1148 v2 | Functional information and the emergence of biocomplexity | Hazen, Griffin, Carothers & Szostak (2007). Functional information is −log2 of the fraction of all configurations, uniformly weighted, that reach at least a given degree of a specified function. In random Avida genomes its curve against degree of function is stepped, which the authors attribute to distinct classes of solutions; letter strings and GTP aptamers illustrate it. | Active — read 2026-10-29 (NOTE-1402) in full, from the publisher’s version in PubMed Central (PMC1876432, HTML, equations read from their images); worth reading as the general statement of functional information, −log2 of the fraction of all configurations that reach a stated degree of a stated function, with its stepped curves in random Avida genomes. Read it knowing that the measure is relative to one function and to a uniform weighting of configurations, explicitly not to what selection produces, that it says nothing about history or identity, and that its letter example is off by a bit (37, not 36). |
| LIT-1149 v2 | Semantic information, autonomous agency and non-equilibrium statistical physics | Kolchinsky & Wolpert (2018). Semantic information is the least part of a system’s syntactic information about its environment that must be kept, when the rest is scrambled by coarse-graining the environment, for the system’s viability (negative entropy) at a chosen time to stay unchanged. Viability, the system boundary and the timescale are chosen by the analyst. | Active — read 2026-10-29 (NOTE-1370) in full, from arXiv’s own copy (v3); worth reading for a definition of semantic information as the least syntactic information (initial mutual information or transfer entropy) that a coarse-graining intervention on the environment can leave while the system’s viability at τ, its negative entropy, is unchanged, with semantic efficiency, content and a thermodynamic multiplier. Read it knowing that the viability function, the system–environment split, τ and the initial distribution are the analyst’s choices, which the paper concedes; that negative entropy does not track a system’s identity; that the only example is a five-location toy; and that Appendix B drops the minus sign of its own viability function. |
| LIT-1150 v2 | Supporters, Followers, Fans, and Flaneurs: A Taxonomy of Spectator Identities in Football | Giulianotti (2002). Four ideal types of football spectator, supporters, followers, fans and flâneurs, set on hot–cool and traditional–consumer axes. | Active — read in full 2026-10-29 (NOTE-1244) from the Author’s Original Text deposited in Loughborough’s repository (Figshare 9625841, CC BY-NC-ND), the pre-review version; worth reading as the standard four-type taxonomy of football spectators (supporters, followers, fans, flâneurs) on two axes, hot–cool and traditional–consumer, with a claimed historical drift towards the flâneur. Conceptual, with no data. Source of THEORY-1111. |
| LIT-1151 v2 | Optimal compression of approximate inner products and dimension reduction | Alon & Klartag (2017), FOCS 2017, ARXIV-1610.00239. For n points of norm at most 1 in R^k and 1/n^0.49 ≤ ε ≤ 0.1, storing every inner product and squared distance to additive ε takes Θ(n log n/ε²) bits once k ≥ log n/ε², Θ(nk log(2 + log n/(ε²k))) for log n ≤ k ≤ log n/ε², and Θ(nk log(1/ε)) below, with an efficient per-point sketch. Comparing the counts across dimensions re-proves Larsen and Nelson’s bound and extends it: for every ε ≥ 2/√n some n such points need Ω(min{k, log(2 + ε²n)/ε²}) dimensions under any map with additive error ε. A bipartite JL lemma keeps cross inner products in O(log(2 + ε²n)/ε²) dimensions, without bounding norms. | Active — read 2026-10-16 (NOTE-929) in full; worth reading as the paper that turns the Johnson–Lindenstrauss lower bound into a bit count, determining how many bits it takes to store every inner product of n points of the unit ball to additive ε, and so extending Larsen and Nelson’s dimension lower bound to every ε ≥ 2/√n with log(2 + ε²n)/ε² in place of log n/ε². Read it knowing that its dimension statements are for additive error on squared distances, the relative form being stated only for ε ≥ 1/n^0.49; that the step from bits to dimension is a short remark; that constants are unstated; and that its small-ε upper bound is bipartite, keeps only cross inner products and does not bound norms, so the one-set JL lemma at log(2 + ε²n)/ε² stays open. Filed as THEORY-399 and THEORY-393. |
| LIT-1152 v2 | Extending Lipschitz functions via random metric partitions | Lee and Naor (2005), Inventiones Mathematicae 160(1): 59–95. Random partitions of a metric space at every scale, with each point padded away from piece boundaries, give a gentle partition of unity, and averaging over it extends Lipschitz maps into any Banach space and from any superspace. This gives ae(X) ≤ C log n/log log n for n-point X (improving C log n), ≤ C log λ(X) for doubling X, ≤ C r² for K_r-minor-free graph metrics, e(ℓ₂ᵈ, Z) ≤ C√d, and, with the Johnson–Lindenstrauss lemma, eₙ(L₂, Z) ≤ C√(log n). For Hilbert targets it does not improve Johnson and Lindenstrauss’s K√(log n), and whether √(log n) suffices for every target it leaves open. | Active — read 2026-10-16 (NOTE-927) in full; worth reading as the method that turns random metric partitions into Lipschitz extensions: padded random partitions at every scale give a gentle partition of unity, and averaging over it extends maps into any Banach space at a constant depending on the domain alone. Read it knowing that its bound for n-point domains, C log n/log log n, improves Johnson, Lindenstrauss and Schechtman’s C log n for Banach targets but not Johnson and Lindenstrauss’s K√(log n) for Hilbert targets; that it states as open whether √(log n) suffices for every target; that the copy read is the January 2004 preprint; and that it does not discuss separated domains. Filed as THEORY-396 and THEORY-400. |
| LIT-1153 v3 | Extensions of Lipschitz mappings into a Hilbert space | Johnson & Lindenstrauss (1984), Contemporary Mathematics 26: 189–206. Lemma 1: for 1 > τ > 0 there is K(τ) such that any n points of ℓ₂ⁿ map into ℓ₂ᵏ, k = [K log n], with ‖f‖_lip‖f⁻¹‖_lip ≤ (1+τ)/(1−τ), by a Haar-random rank-k orthogonal projection with positive probability; the proof takes K ≥ (10/τ)². The lemma is the tool for Theorem 1, that a Lipschitz map from any n-point subset of a metric space into ℓ₂ extends to the whole space with constant at most C(log n)^{1/2}, verifying a Marcus–Pisier conjecture. A lower bound of order (Log n / Log Log n)^{1/p−1/2} for L_p, 1 ≤ p < 2, and an extension theorem for separated sets complete it. | Active — read 2026-10-14 (NOTE-930) in full; worth reading as the source of the dimension-reduction lemma, in the form its authors gave it: n points of ℓ₂ⁿ go into [K(τ) log n] dimensions with Lipschitz distortion (1+τ)/(1−τ), by a Haar-random orthogonal projection, proved by concentrating one projected norm about its median and taking a union bound over the normalized differences. Read it knowing that the τ⁻² dependence is in the proof (K ≥ (10/τ)²), not the statement; that the paper shows only that log n cannot be improved, not the τ-dependence; and that the lemma is a tool for the paper’s real subject, L(X, n) ≤ C(log n)^{1/2} for extending Lipschitz maps into ℓ₂. |
| LIT-1154 v2 | Optimality of the Johnson-Lindenstrauss Lemma | Larsen & Nelson (2017), FOCS 2017, ARXIV-1609.02094. For integers n, d ≥ 2 and lg^0.5001 n/√min{n, d} < ε < 1, some n points in R^d need m = Ω(ε⁻² lg(ε²n)) dimensions under any map, linear or not, that keeps all squared distances within 1 ± ε. For ε > 1/min{n, d}^0.4999 this is Ω(ε⁻² lg n), so the Johnson–Lindenstrauss bound is optimal up to a constant, and the distributional lemma with a union bound cannot be improved on. The proof is an encoding argument over k-sparse vectors with k = ε⁻²/256, ending in m = Ω(k lg(d/k)). | Active — read 2026-10-14 (NOTE-925) in full; worth reading as the proof that the Johnson–Lindenstrauss order ε⁻² lg n cannot be beaten by any map, linear or not, on a worst-case point set, and as a lower bound that is itself a count of sparse supports. Read it knowing that the bound is Ω(ε⁻² lg(ε²n)) and holds only for lg^0.5001 n/√min{n, d} < ε < 1; that it is tight up to an unstated constant, not a sharp threshold; that the guarantee is on squared distances; and that it says nothing about random features, expansion or typical inputs. |
| LIT-1155 v2 | The geometry of graphs and some of its algorithmic applications | Linial, London & Rabinovich (1995), Combinatorica 15(2): 215–245. Every n-point metric embeds in O(log n)-dimensional Euclidean space with distortion O(log n) (Bourgain’s theorem as Theorem 3.2(1) states it). The paper reproves the distortion by a randomized map to distances from O(log² n) random sets, takes the dimension from Johnson–Lindenstrauss, and computes the least Euclidean distortion of any finite metric by semidefinite programming. Constant-degree expanders need distortion Ω(log n) in ℓ_p, 1 ≤ p ≤ 2, of any dimension (Proposition 4.2), so the bound is tight. The max-flow/min-cut gap for k commodities is O(log k), with a deterministic algorithm (Theorem 4.1). | Active — read 2026-10-16 (NOTE-928) in full; worth reading as the place where Bourgain’s O(log n) embedding of finite metrics into Euclidean space is restated, reproved by distances to random sets of every scale, and shown tight: constant-degree expanders need distortion Ω(log n) in ℓ_p, 1 ≤ p ≤ 2, of any dimension, because their gap between multicommodity flow and cut is Ω(log n). The same embeddings bound that gap by O(log k) for k commodities. Read it knowing that the O(log n) dimension comes from Johnson–Lindenstrauss, not from the construction, which uses O(log² n) coordinates; that the lower bound rests on Leighton and Rao’s gap, cited; that constants are unspecified; and that it says nothing about trees in ℓ₂, for which Sala et al. cite it. Filed as THEORY-394. |
| LIT-1156 v2 | A Simple Proof of the Restricted Isometry Property for Random Matrices | Baraniuk, Davenport, DeVore & Wakin (2008), Constructive Approximation 28(3): 253–263. If an n × N random matrix satisfies the concentration inequality of Johnson–Lindenstrauss proofs, Pr(|‖Φx‖² − ‖x‖²| ≥ ε‖x‖²) ≤ 2e^{−n c₀(ε)}, then a union bound over a (12/δ)^k-point net on each of the (eN/k)^k coordinate k-subspaces, with a bootstrapping step from net to subspace, gives the restricted isometry property for all k ≤ c₁n/log(N/k) with probability at least 1 − 2e^{−c₂n} (Theorem 5.2). Gaussian, ±1 and Achlioptas’s sparse ensembles qualify, also in any fixed orthonormal basis. That this range is the widest possible the paper takes from Gelfand widths. | Active — read 2026-10-14 (NOTE-931) in full; worth reading as the short proof that the restricted isometry property follows from the concentration inequality used in Johnson–Lindenstrauss proofs, by a union bound over nets on the sparse supports. Read it knowing that it proves sufficiency only, with constants left implicit; that the optimality of k ≲ n/(log(N/n) + 1) it cites from Gelfand widths, not from concentration; that its constants are Achlioptas’s; and that the route “through” the JL lemma in §6 is sketched, not written out. |
| LIT-1157 v3 | An elementary proof of a theorem of Johnson and Lindenstrauss | Dasgupta & Gupta (2003), Random Structures & Algorithms 22(1): 60–65. For n points in ℝᵈ and 0 < ε < 1, projecting onto a random k-dimensional subspace and scaling by √(d/k) keeps every squared pairwise distance within 1 ± ε with probability at least 1/n once k ≥ 4(ε²/2 − ε³/3)⁻¹ ln n (Theorem 2.1). Each tail of a random unit vector’s squared length in k coordinates is at most exp((k/2)(1 − β + ln β)) (Lemma 2.2), proved by Markov’s inequality on an exponential of Gaussian squares; a union bound over the pairs finishes it. | Active — read 2026-10-14 (NOTE-932) in full; worth reading as the shortest complete proof of the Johnson–Lindenstrauss lemma with an explicit dimension, k ≥ 4(ε²/2 − ε³/3)⁻¹ ln n, and as a case in which that dimension is visibly the log of the number of pairs, about n², over a squared tolerance. Read it knowing that its map is a scaled projection onto a random subspace, not a Gaussian or ±1 matrix, which §3 only describes; that it keeps squared distances; that one draw succeeds with probability only 1/n; and that it treats k < d only, so it says nothing about maps that raise dimension. |
| LIT-1159 v2 | Database-friendly random projections: Johnson-Lindenstrauss with binary coins | Achlioptas (2003), Journal of Computer and System Sciences 66(4): 671–687. A random projection E = (1/√k)AR keeps all pairwise squared distances of n points within 1 ± ε with probability at least 1 − n^−β when k ≥ (4 + 2β)/(ε²/2 − ε³/3) · log n and R’s entries are independent ±1, or √3 × {+1, 0, −1} with probabilities 1/6, 2/3, 1/6. That k₀ equals the best bound for Gaussian projections. The proof shows the all-equal unit vector has the largest even moments of its projection, and that these are at most the Gaussian ones. | Active — read 2026-10-14 (NOTE-926) in full, from a 2002 journal-submission draft, not the JCSS text; worth reading as the proof that a Johnson–Lindenstrauss embedding needs concentration, not spherical symmetry: independent ±1 entries, or √3·{+1, 0, −1} with probabilities 1/6, 2/3, 1/6, give k₀ = (4 + 2β)/(ε²/2 − ε³/3) · log n, the best Gaussian bound, by showing the all-equal vector is the worst case and its moments are dominated by the Gaussian ones. Read it knowing that the draft omits the proof of the sparse case of Lemma 6.3, that 2/3 zeros is stated without proof as the most that lemma allows, and that its ensembles are signed and zero-mean, which the fly’s {0, 1} matrix is not. |
| LIT-1160 v2 | Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing | Donoho & Tanner (2009), Phil. Trans. R. Soc. A 367: 4273–4293, ARXIV-0906.2530. For Gaussian matrices, recovery of a k-sparse vector from n measurements in dimension N by ℓ1 minimization, or by its nonnegative LP form, succeeds with probability tending to 1 below a curve ρ(δ; Q) in δ = n/N, ρ = k/n and to 0 above it, a result proved earlier and restated here. In 2,948,000 linear programs over eight non-Gaussian ensembles at N up to 1600, the 50% success points fall on the same curves. Exact agreement at finite N is rejected; the differences decay as N^(-1/2), so the paper supports an asymptotic universality, observed and not proved. | Active — read 2026-10-14 (NOTE-933) in full, from the 48-page arXiv copy, not the journal text; worth reading as the measured case for how far the sharp ℓ1 recovery thresholds proved for Gaussian matrices hold for other random matrices. Read it knowing that the transitions sit on the Gaussian curves only in the large-N limit, that finite-N universality is rejected, that the sparse and Hadamard ensembles miss by about one transition width at small N, that the curves belong to (LP) and (P1) and not to other decoders, and that nothing about non-Gaussian matrices is proved. |
| 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-1163 | Estimating Mutual Information | Kraskov, Stögbauer & Grassberger (2004), Physical Review E 69, 066138, ARXIV-cond-mat/0305641. Two estimators of I(X,Y) from N i.i.d. samples, built from Kozachenko–Leonenko k-nearest-neighbour entropy estimates with the joint space in the maximum norm: I⁽¹⁾ = ψ(k) − ⟨ψ(n_x+1) + ψ(n_y+1)⟩ + ψ(N), and I⁽²⁾ = ψ(k) − 1/k − ⟨ψ(n_x) + ψ(n_y)⟩ + ψ(N), where n_x, n_y count marginal neighbours within the joint k-th-neighbour distance. Using one distance scale across joint and marginal spaces makes the biases largely cancel. Numerically they are exact for independent variables (conjectured, not proved) and have systematic errors that scale with k/N. | Active — read 2026-10-16 (NOTE-938), the formal sections in full and the numerical and application sections at lower resolution; worth reading as the source of the k-nearest-neighbour (KSG) mutual-information estimators that the record’s readings use off the shelf (NOTE-788, NOTE-320, NOTE-828). Read it knowing that the estimators rest on a locally-constant-density approximation with no bias bound, that their exactness for independent variables is a numerical conjecture the paper’s own Weinman example strains, and that it estimates mutual information and multi-information only: conditional mutual information, and so transfer entropy, is not treated. Filed as THEORY-709. |
| LIT-1164 | Causal Reasoning in Graphical Time Series Models | Eichler & Didelez (2007), UAI 2007: 109–116, ARXIV-1206.5246. Defines the causal effect of an intervention on one component of a stationary multivariate time series on another at a later time, and links it to strong Granger noncausality through mixed graphs (directed edges for Granger causality, dashed edges for contemporaneous dependence). Under its intervention assumptions, which require the system to include every relevant process and exclude instantaneous causality, a missing directed edge means no effect at the next step, non-ancestry means none at any horizon, and back-door and front-door criteria identify the effect from observational data. In a Gaussian VAR the identified effect is a coefficient of the multi-step linear predictor. | Active — read in full 2026-10-16 (NOTE-941); worth reading as the short statement of exactly when a Granger-causal analysis says something about interventions: under its intervention assumptions, which need the series to include every relevant process (observed or not) and exclude instantaneous causation, a missing Granger edge means no causal effect at the next step and non-ancestry means none at any horizon, and time-series back-door and front-door criteria identify effects from observational data. Read it knowing that the front-door theorem’s proof is deferred to a paper “in preparation”, that the results are sufficient conditions, and that the examples are Gaussian VARs. Filed as THEORY-704. |
| 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-1166 | Causality, Feedback and Directed Information | Massey (1990), Proc. ISITA-90, Waikiki. The usual definition of a discrete memoryless channel, P(y^N|x^N) = Π P(y_n|x_n), holds only when the channel is used without feedback; the right definition is P(y_n|x^n y^{n−1}) = P(y_n|x_n). Defines directed information I(X^N→Y^N) = Σ_n I(X^n; Y_n | Y^{n−1}), after Marko (1973), and proves I(X^N→Y^N) ≤ I(X^N;Y^N) with equality without feedback, that it bounds what the output tells about the source in a causal system, and so that feedback does not increase DMC capacity. “Statistical dependence, unlike causality, has no inherent directivity.” | Active — read in full 2026-10-17 (NOTE-939); worth reading as the short source of directed information, I(X^N→Y^N) = Σ I(X^n; Y_n | Y^{n−1}), and of the point that the usual definition of a memoryless channel silently forbids feedback because it confuses statistical with causal dependence. Read it knowing that “causal” here is a factorization condition on a system of sources and channels, not an interventional notion; that directed information conditions on the current input as well as the past, so it is not transfer entropy; and that the copy read is the author’s preprint, not the proceedings version. Filed as THEORY-711. |
| 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-1171 | Granger causality and transfer entropy are equivalent for Gaussian variables | Barnett, Barrett & Seth (2009), Physical Review Letters 103, 238701, ARXIV-0910.4514. For jointly Gaussian stationary processes X, Y, Z, Geweke’s Granger causality F_{Y→X|Z} = ln(|Σ(X|X⁻⊕Z⁻)|/|Σ(X|X⁻⊕Y⁻⊕Z⁻)|) equals 2T_{Y→X|Z}, twice the transfer entropy, for multivariate predictor, predictee and conditioning variables. The proof is two lines: Gaussian conditional entropy is ½ln|partial covariance| plus a constant, and OLS residual covariance is the partial covariance. | Active — read in full 2026-10-16 (NOTE-934); worth reading as the short, exact source of the Gaussian equivalence the record already leans on through Barnett and Bossomaier (NOTE-053): for jointly Gaussian stationary processes, Geweke’s generalized-variance Granger causality is exactly twice the transfer entropy, conditional and multivariate. Read it knowing that the identity is about population quantities at fixed lags, that sample agreement depends on how the entropies are estimated, and that the remark that a stationary Gaussian AR process leaves nothing for nonlinear Granger causality cites unpublished work. Filed as THEORY-700. |
| 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-1174 | Information Flows in Causal Networks | Ay & Polani (2008), Advances in Complex Systems 11(1): 17–41. In a causal Bayesian network, X_B is causally independent of X_A imposing X_S if setting x_A after setting x_S does not change the post-interventional distribution of X_B; this holds for every model on a DAG iff every directed path from A to B meets S (ud-separation, Theorem 2). Information flow I(X_A → X_B | X̂_S) is conditional mutual information with every probability replaced by its interventional counterpart, and is zero iff causal independence holds (under positivity of p(x_S)). Examples show it differs from mutual information and from transfer entropy: two binary chains that swap states have zero transfer entropy and one bit of flow (at k = 1, by the record’s check), and an observationally identical pair of independent inverters has zero of both. | Active — read in full 2026-10-17 (NOTE-946), from the authors’ preprint dated 12 May 2006; worth reading as the interventional counterpart of transfer entropy: information flow I(X_A → X_B | X̂_S) is conditional mutual information computed from do()-distributions instead of observational ones, it vanishes exactly under a graphical condition (ud-separation), and examples show it differs from transfer entropy and conditional mutual information in both directions. Read it knowing that it needs the full causal Bayesian network and its mechanisms, not data; that the examples are deterministic binary networks; and that its Example 6 claim of one bit holds, by the record’s calculation, only for k = 1 or when imposing X_k alone. The published version (Advances in Complex Systems 11(1), 2008) was not compared. Filed as THEORY-710. |
| 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-1178 v2 | Detecting Awareness in the Vegetative State | Owen, Coleman, Boly, Davis, Laureys & Pickard (2006). A 23-year-old woman who met the clinical criteria for the vegetative state five months after a traumatic brain injury, told in the scanner to imagine playing tennis or walking through her house, activated the supplementary motor area for the first and parahippocampal, posterior parietal and lateral premotor cortex for the second, as 12 healthy volunteers did. The authors take her compliance as “a clear act of intention” showing awareness; her intact speech responses they set aside as not evidence of it. No question was asked or answered. | Active — read 2026-10-16 (NOTE-962) in full, the one-page Brevia; the Supporting Online Material was not reached. Worth reading as the first showing that a patient diagnosed vegetative can respond to command by a mental act with no motor output, read from the brain. Read it knowing that no question was asked and no answer decoded, that the comparison with controls is qualitative in the main text, and that “confirmed beyond any doubt” is the authors’ assertion. |
| LIT-1180 v2 | Feedback: Beyond Behaviorism | Powers (1973). A control system produces whatever output keeps a sensed result constant despite disturbances, so behaviour is the control of input, not output (reprint p. 77); in a hierarchy, the output of a higher-order system is not a muscle force but a reference level for lower systems (p. 77). Every loop the paper describes closes through the environment, and its top level is inherited intrinsic reference levels whose error drives reorganization (p. 73). | Active — read 2026-10-16 (NOTE-963) in full, from the authorized reprint in Living Control Systems (1989), pp. 61–78; worth reading as the shortest statement of perceptual control: a control system produces whatever output keeps a sensed result at its reference, so behaviour is the control of input, and above the lowest level a system’s output is a reference for the level below. Read it knowing that every loop it describes closes through the environment, down to muscle effort sensed kinesthetically; that it says nothing about imagination or memory, which Powers treated elsewhere; that its higher systems still sense quantities in the world and change only lower references, never the sensors; and that reorganization, driven by error in inherited intrinsic quantities, is one paragraph. It is a rival to CLAIM-341 and gives CLAIM-342 a scoring channel the learned hierarchy does not set. |
| LIT-1181 v2 | Action and behavior: a free-energy formulation | Friston, Daunizeau, Kilner & Kiebel (2010). If an agent’s existence requires a low-entropy density over its states, an ergodic assumption makes that entropy the time-average of surprise, and the setup stipulates that only action changes the hidden states the agent senses; so action as well as perception must minimize a free-energy bound on surprise. Action is absent from the generative model and descends on sensory prediction error, so motor control is the fulfilment of proprioceptive (and visual) predictions. Simulations of oculomotor stabilization and prior-driven saccades, cued reaching, a mountain car learned passively in a designed environment, and Lorenz trajectories show unexpected perturbations cancelled by action and not perceived. The model is held fixed and the data re-sampled to fit it. | Active — read 2026-10-16 (NOTE-960) in full, from the publisher’s open-access PDF; worth reading as the first full statement that action, like perception, minimizes a free-energy bound on sensory surprise, by fulfilling proprioceptive and visual predictions, with simulations of oculomotor stabilization and saccades, cued reaching, mountain-car and Lorenz trajectories. Read it knowing that the “ergodic arguments” of the abstract only equate entropy with time-averaged surprise, and that action is needed because the setup stipulates that action is the only way the agent changes the hidden states it senses; that action here pulls the sensed world toward a fixed model, sampling “what one expects to experience”, and cancels unexpected perturbations so they are not perceived; and that the paper answers the worry about confirming a wrong model by appeal to existence (“agents who do not have the right priors cannot exist”). It has no mental or covert action. |
| LIT-1182 v2 | An Introduction to QBism with an Application to the Locality of Quantum Mechanics | Fuchs, Mermin & Schack (2014). QBism: quantum states and all probabilities, 0 and 1 included, are an agent’s personal judgements. A measurement is “any action an agent takes to elicit a set of possible experiences”, and the outcome is the experience it elicits; it does not reveal a pre-existing state of affairs. The agent models everything external with quantum mechanics, other agents’ reports included, and only her own awareness of her own experience is exempt. Quantum correlations are between one agent’s time-like separated experiences, so the theory is local. | Active — read 2026-10-16 in full (NOTE-955), from the arXiv v1 PDF. Worth reading as the shortest authoritative statement of QBism: states and all probabilities, 1 included, are an agent’s judgements, a measurement is an action the agent takes to elicit experience, and the outcome is that experience. Read it knowing that it keeps judgement (a state assignment) and measurement (an action on an external system) apart, so its loop is judgement, action, experience, update; and that the agent’s own awareness is the one thing it does not model, so it has no measurement of the self. |
| LIT-1183 v2 | A survey on self-assessed well-being in a cohort of chronic locked-in syndrome patients: happy majority, miserable minority | Bruno et al. (2011). Of 168 members of the French LIS association invited, 91 replied and 65 gave usable answers, with a proxy’s help: 47 (72%) rated their present life at or above the midpoint between their best period before LIS and their worst ever (median +3), 18 below (median −4). All had chronic LIS after a brainstem vascular accident, a median of 8 years before; 55% had recovered some speech and 70% some limb movement. Happiness was associated with years in LIS (OR 1.5 per year), recovered speech (OR 20.5) and absence of anxiety (OR 0.19). 58% did not wish to be resuscitated; 7% wished for euthanasia. | Active — read 2026-10-16 (NOTE-961) in full, from the open-access version in PubMed Central. Worth reading as the largest survey of chronic locked-in patients’ own ratings of their lives: 47 of 65 rated their present life at or above the midpoint between their best period before LIS and their worst ever, and happiness rose with years in LIS, recovered speech and absence of anxiety. Read it knowing that it is a self-selected association sample (54% response, 26 more excluded) answering with a proxy’s help, that most respondents had recovered some speech or limb movement, and that the authors expect its biases to overstate well-being. |
| LIT-1184 v2 | Factorized embedding of goal and uncertainty in the lateral prefrontal cortex guides stably flexible learning | Sung, Rigotti & Lee (2025). A reanalysis of 20 people’s fMRI from a two-stage Markov task with experimenter-cued goals and uncued block-wise transition noise. With a specific goal cued, transition noise did not lower choice optimality or consistency. Unfitted model-free agents showed a flexibility–stability trade-off (r = −0.964) that model-based agents and humans did not. Goals and, under specific goals only, transition uncertainty were weakly decodable from vlPFC, dlPFC and OFC. Nonlinear dichotomies decoded worse than goal and linear ones, and a goal decoder transferred across noise levels: the paper’s “factorized embedding”. Across subjects, goal separability and transfer in lateral PFC correlated with flexibility and performance; uncertainty separability correlated with nothing. | Active — read 2026-10-16 (NOTE-953) in full from the open-access article, with the supplementary tables for the shattering comparisons and the brain–behaviour correlations. Worth reading as a clear human-fMRI application of Bernardi et al.’s geometry tests (shattering dimensionality, cross-condition generalization) to goals and transition noise. Read it knowing that it is a reanalysis of 20 subjects with effects a few points above chance; that “uncertainty” is block-wise transition noise, coded only when a specific goal is cued; that it tested only whether the goal code is invariant to uncertainty, never the converse; that the task is action–outcome learning with experimenter-cued goals; and that goal-code invariance does not correlate with stability once corrected for multiple comparisons, although the main text says it does. Registered at the owner’s request (U9 of the exchange of 2026-10-16 on active inference). |
| LIT-1185 v2 | Map-like representations of emotion knowledge in hippocampal-prefrontal systems | Ma & Kragel (2026). In fMRI of 29 people passively watching 14 emotional films (Emo-FilM), decoders predicted an independent online sample’s consensus ratings of 13 emotion categories better from hippocampus than positions in a two-dimensional affective space (an MDS of rating co-occurrence), and vmPFC the reverse; posterior hippocampus carried finer distinctions. Brain patterns could also be decoded into a Tolman–Eichenbaum Machine that learned the emotion grid by random walk, hippocampus favouring its small-scale conjunctive layer and vmPFC its large-scale structural layer. Prediction–outcome correlations are about 0.04–0.10; no learning in the participants is measured. | Active — read 2026-10-16 (NOTE-950) in full, from the publisher’s open-access PDF, supplementary material not read; worth reading as a naturalistic-viewing fMRI dissociation in which hippocampus carries more about emotion categories and vmPFC more about positions in a two-dimensional affective space, lined up with the two layers of the Tolman–Eichenbaum Machine. Read it knowing that participants only watched; that the decoded emotions are an independent sample’s consensus ratings; that the effects are small; that the “transitions” are a model’s random-walk steps on a grid built from rating co-occurrence; and that no learning in people, and no effect of the map on later reading, is measured. The model that learns the map does so by acting. |
| LIT-1187 v2 | The construction of preference. | Slovic (1995), a review from an award address. Normatively equivalent elicitation procedures give systematically different preference orderings: in the Las Vegas study the two bets were chosen about equally often but the high-payoff bet was priced higher about 88% of the time, and Tversky, Slovic and Kahneman found 40–50% reversal rates of which 90% violated procedure invariance and 10% were intransitive. Scale compatibility and prominence explain the reversals. Slovic concludes that for important, complex and unfamiliar options preferences are “constructed on the spot” in elicitation. The evidence compares procedures; none follows a constructed preference into a later judgement. | Active — read 2026-10-16 (NOTE-949) in full, from a scan of the published article on a University of Florida course page, compared with the author’s manuscript in the University of Oregon’s ScholarsBank; worth reading as the compact review of preference reversals: normatively equivalent procedures give different orderings, about 90% of reversals violate procedure invariance rather than transitivity, and scale compatibility and prominence explain them. Read it knowing that its evidence compares procedures and never follows a constructed preference into a later judgement, so it shows the elicitation entering the response, not changing the judge; that construction is claimed for important, complex and unfamiliar options; and that the only remedy it reports is market repetition with feedback and penalties. |
| LIT-1188 v2 | A General Feedback Theory of Human Behavior: Part I | Powers, Clark & McFarland (1960). The first statement of the hierarchical feedback theory: each order perceives only the feedback signals of the order below and acts only by setting their references, which are replayed recordings of past perceptions. An imagination connection returns those references to the higher system’s perception, so that every goal set for lower systems can appear “immediately satisfied-in imagination” (p. 20), letting the system remember, plan an action “mentally” without performing it, hallucinate and dream, under a “mixing control” the authors leave open. An inherited N-system reorganizes the network, perceptual input functions included, at a rate proportional to error in intrinsic physiological variables. | Active — read 2026-10-16 (NOTE-954) in full, from the authorized reprint in Living Control Systems (1989), pp. 1–24, with Part II (LIT-1197, NOTE-959); worth reading as the first statement of perceptual control and the only one the record holds with its memory and imagination: references are replayed recordings of past perceptions, an imagination connection lets a higher system perceive the references it sends instead of their outcome, and a “mixing control” the authors cannot specify sets how much of perception is imagination. Read it knowing that the imagination loop changes nothing in the perceiver; that what does change perception is the N-system, which forms new input functions (“tentative definitions of new variables”, p. 14) at random under intrinsic, bodily error and keeps those whose behaviour lessens that error; that the hierarchy is “of the external-loop type” (p. 21); and that the sensory-deprivation remark is one uncited sentence. A rival to CLAIM-341 that contains its ingredients, and a scoring channel for QUESTION-121. |
| LIT-1190 v2 | The physics of symbols: bridging the epistemic cut | Pattee (2001). Evolution requires an epistemic cut between energy-degenerate, rate-independent genetic symbols and the rate-dependent dynamics of construction they control; the same subject–object cut recurs wherever symbols stand for referents, and physics meets it as measurement. Measurement codes a dynamical state into quiescent symbols and control is its converse; both are executed by non-integrable constraints, whose function is lost if they are described by the laws alone (von Neumann’s regress). The cut is epistemic, not ontological, and arises first at the genotype–phenotype control interface. | Active — read 2026-10-16 in full (NOTE-952), from the author-posted text on the Binghamton CASCI site. Worth reading as Pattee’s own retrospective statement of the epistemic cut: measurement codes a dynamical state into quiescent symbols, control is its converse, both are executed by non-integrable constraints, and no dynamical description of those constraints keeps their function. Read it knowing that it is not measurement-first: the primeval cut is at the genotype–phenotype control interface and “control of construction came first”, and measurement presupposes control of the measuring device. The argument rests on von Neumann’s regress and Pattee’s earlier papers; nothing is derived here. |
| LIT-1191 v2 | Towards a computational phenomenology of mental action: modelling meta-awareness and attentional control with deep parametric active inference | Sandved-Smith, Hesp, Mattout, Friston, Lutz & Ramstead (2021). A three-level discrete active-inference model: attentional states (focused, distracted) set the precision of the perceptual likelihood, and meta-awareness states (high, low) set the precision with which the agent observes its own attentional state. Mental action is a policy, ‘stay’ or ‘switch’, over attentional states, defined at that level only and driven by a preference to observe oneself ‘focused’. Single simulations of a passive oddball reproduce focus, mind-wandering, noticing and refocusing, with longer mind-wandering under low meta-awareness. Stimuli are fixed by the generative process, so mental action changes how strongly they update belief, not what they are; no likelihood is learned. | Active — read 2026-10-16 (NOTE-958) in full, from the PubMed Central deposit of the journal version; worth reading as the active-inference model of mental action: attentional states set the precision of the perceptual likelihood, meta-awareness states set the precision of the attentional likelihood, and the agent selects ‘stay’ or ‘switch’ over its own attentional state against a preference to observe itself ‘focused’, reproducing the cycle of focus, mind-wandering and refocusing. Read it knowing that action is defined at the attentional level only; that the agent’s attentional state is modelled as a generative process the mental action acts on, so the loop is action and perception one level inward; that the perceptual observations are fixed in advance and mental action changes only their precision; that nothing is learned; and that the results are single illustrative simulations with no data fitted. |
| LIT-1192 v2 | Willful Modulation of Brain Activity in Disorders of Consciousness | Monti et al. (2010). Of 54 patients diagnosed vegetative (23) or minimally conscious (31), 5, all with traumatic injury, produced task-specific fMRI activity to motor and spatial imagery commands; 4 had been admitted as vegetative, and 2 of those showed no behavioural sign of awareness at the bedside even after the scans were known. Using one imagery for yes and the other for no, 16 controls answered 48 of 48 questions correctly, and one patient, 5 years after injury, answered 5 of 6 autobiographical questions correctly, scored blind, the sixth giving no signal. That patient showed inconsistent signs of a minimally conscious state on retesting but could not communicate at the bedside. | Active — read 2026-10-16 (NOTE-964) in full, without the Supplementary Appendix. Worth reading as the study that made imagery-to-command a yes/no channel and found command-following in 5 of 54 patients diagnosed by behaviour. Read it knowing that only one patient was asked questions, that he showed inconsistent signs of a minimally conscious state on retesting, and that the two responders with no bedside behaviour were not asked questions. |
| LIT-1194 v2 | Neuronal dynamics, timing, and flow of sensory and choice-related information in auditory-prefrontal circuitry | Giarrocco & Averbeck (2026). In 37 sessions of simultaneous recordings from A1 and dorsolateral PFC of two macaques reporting by bar release whether two tones came from the same side, a lagged-regression (Granger-style) analysis of one-dimensional task projections found cue-side information flowing one way, A1 to PFC (onset about 120–147 ms after the cue), and choice information (release or hold) flowing first PFC to A1 (onset 315–365 ms after the target) and then A1 to PFC (352–419 ms), both directions peaking near 500 ms, close to the response. Within a trial and correlational; decision and motor response are not separated. | Active — read 2026-10-16 (NOTE-947) in full, from the publisher’s open-access PDF, supplementary material not read; worth reading as a within-trial measurement, from simultaneous A1 and dorsolateral PFC ensembles, that cue information flows A1 to PFC only while choice information flows PFC to A1 and then back. Read it knowing that the choice is the monkey’s bar release or hold and the flow peaks near the response, so decision and motor preparation are not separated (the authors say so); that the flow measure is a Granger-style lagged regression on one-dimensional projections, correlational and with other areas unrecorded; that the PFC-to-A1 choice signal arrives after the 300 ms target has ended; and that nothing crosses trials, so it shows no reshaping of A1’s later sensory coding. |
| LIT-1195 v2 | Attention or salience? | Parr & Friston (2019). A short review. Attention as gain control weights currently available sensory data by the estimated precision of the mapping from their causes; salience is the expected information gain of an action, typically a saccade, that would acquire new data. They are distinct, with gain failures giving hallucinations and salience failures neglect, but coupled: a saccade is a prediction that the foveated location will be sensed precisely, so covert attention to a place biases an overt saccade there, which the authors take to support the premotor theory. | Active — read 2026-10-16 (NOTE-956) in full, from the authors’ accepted manuscript on UCL Discovery; worth reading as the short statement, within active inference, that attentional gain (the estimated precision of currently available data) and salience (the expected information gain of an action that would acquire new data, usually a saccade) are distinct computations with distinct disorders, hallucination and neglect, and that they are coupled because a saccade is a prediction of high precision at the location foveated. Read it knowing that it is a five-page review with no new data or simulations; that it assigns covert spatial attention to gain by stipulation; that it never treats gain as an action; and that it ends by endorsing the premotor theory, so covert attention changes what is observed only by biasing overt saccades. |
| LIT-1196 v2 | Self-generated validity and other effects of measurement on belief, attitude, intention, and behavior | Feldman & Lynch (1988). A theoretical paper, with no data of its own. Belief, attitude or intention can be created by measurement when the construct does not already exist in long-term memory, and the created answer is stored and retrieved as an input to later answers and to behaviour. Even when it exists, question order and format decide which earlier answer is used: an earlier response is used for a later one if it is accessible and perceived as more diagnostic than other accessible inputs. Expertise, direct experience and trait involvement reduce the effects, because they supply judgements already formed and rehearsed. | Active — read 2026-10-16 (NOTE-957) in full, from a scan of the published article posted on a University of Florida course page; worth reading as the theoretical statement that a survey question can create the cognition it asks about, which is then stored and retrieved as an input to later answers and to behaviour, with accessibility and perceived diagnosticity deciding which earlier answer is used. Read it knowing that it reports no data of its own and calls itself speculative; that the created state it cares most about is one that drives behaviour; and that the moderators it names (expertise, direct experience, trait involvement) work by supplying judgements already formed and rehearsed, not evidence from outside them. |
| LIT-1197 | A General Feedback Theory of Human Behavior: Part II | Powers, Clark & McFarland (1960), Part II. Names six orders of perceptual control (spinal loops; elementary sensations; configurations; sequences; relationships; system concepts), demonstrated by reaction times that lengthen with order (third order about 0.3 s, fourth 0.4–0.45 s). The inherited N-system “merely alters the properties of a system, thus changing the transformations applied to existing information”, which the authors take to be insight; consciousness is defined as the state of a feedback function the N-system is acting on. Conflict between higher systems freezes a lower one at a virtual reference level, and one escape is switching a system “entirely to the imagination-connection”. | Active — read 2026-10-16 (NOTE-959) in full, from the authorized reprint in Living Control Systems (1989), pp. 25–45; worth reading as the second half of the first statement of perceptual control: six named orders of perception with tabletop demonstrations of their reaction times, the N-system (reorganization) worked out as the source of insight and of consciousness, and a theory of conflict in which switching a system “entirely to the imagination-connection” is one of the ego’s defences. Read it knowing that the orders are offered as the authors’ working definitions, the demonstrations are informal and the one experiment is “still in process”; that the N-system reshapes perception (“changing the transformations applied to existing information”) but is driven by intrinsic error, not by judgement; and that its intrinsic variables may include “mean error signal in the hierarchy”, an internal scoring channel. It bears on CLAIM-341, CLAIM-339 and QUESTION-121. |
| LIT-1199 v2 | Brain–computer interfaces and communication in paralysis: Extinction of goal directed thinking in completely paralysed patients? | Kübler & Birbaumer (2008). Across 35 patients trained with EEG BCIs, paralysis explained performance (η² = .40) only because of the seven in the completely locked-in state, none of whom, having entered training already in CLIS, reached yes/no communication; without them η² = .12, n.s. Evoked potentials showed hearing and some semantic processing intact. The authors propose that lost perception of the contingency between a response and its consequences, with reward blunted by artificially held homeostasis, extinguishes goal-directed thinking; predict that a contingency learned before CLIS and carried into it should prevent this; and say one CLIS patient who learns to communicate would disprove it. | Active — read 2026-10-16 (NOTE-948) in full, from the NIH author manuscript in PubMed Central. Worth reading as the source of the extinction hypothesis for the completely locked-in state: none of seven patients who began BCI training already in CLIS reached yes/no communication, and the authors propose that losing the perceived contingency between a response and its consequences, with reward blunted by artificially held homeostasis, extinguishes goal-directed thinking while passive sensory processing stays intact. Read it knowing that the hypothesis rests on seven heterogeneous patients and an analogy with curarized rats whose result failed to replicate, that it is stated as “might be responsible”, and that it predicts its own exception: a contingency learned before CLIS and carried into it should prevent extinction. |
| LIT-1200 v2 | Spelling interface using intracortical signals in a completely locked-in patient enabled via auditory neurofeedback training | Chaudhary et al. (2022). A man with ALS who had used an eye-movement BCI with an auditory speller until February 2019, and was judged completely locked-in from a few weeks before implantation, was given two microelectrode arrays in motor cortex in March 2019. Attempted and imagined movements gave no usable signal; from day 86 he learned to move an auditory tone driven by firing rate, and from day 106 spelled with the speller he had used before CLIS, producing intelligible sentences on 44 of 107 attempted days at about one character per minute. | Active — read 2026-10-16 (NOTE-951) in full, from the open-access article at nature.com; the Supplementary Information was not read. Worth reading as the one report of a patient classed as completely locked-in who spelled self-chosen sentences through a BCI, by learning to raise or lower motor-cortex firing rates against an auditory tone after attempted and imagined movements gave no usable signal. Read it knowing that he had used an eye-movement BCI with the same speller until weeks before CLIS, that he had been in CLIS for weeks rather than years, that control was intermittent (intelligible output on 44 of 107 days) and rated by the authors, and that the authors concede residual muscle control was not excluded. As published, the article carries no editor’s note, correction, expression of concern or retraction (nature.com and Crossref, 2026-10-16). |
| 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-1202 | Reconsidering unique information: Towards a multivariate information decomposition | Rauh, Bertschinger, Olbrich & Jost (2014), ISIT 2014: 2232–2236, ARXIV-1404.3146. Theorem 2: no redundancy function satisfies the Williams–Beer axioms (symmetry, self-redundancy, monotonicity), local positivity (non-negative partial-information atoms) and the identity axiom. The counterexample is three sources, two independent bits and their XOR, with the target their joint copy: identity forces each atom {i}{jk} to 1 bit and the total is 2 bits, so the atom {12}{13}{23} ≤ −1. Lemmas 3–4: Bertschinger et al.’s unique information decreases as the other source is enlarged and increases as its own source or the target is; their shared information increases with a source but violates left monotonicity, as does their synergy. | Active — read in full 2026-10-17 (NOTE-965); worth reading as the short proof that the identity axiom and a non-negative decomposition on the Williams–Beer lattice cannot both hold once there are three sources: with Y1, Y2 independent bits, Y3 = Y1 ⊕ Y2 and the target their joint copy, identity, the Williams–Beer axioms and invariance under relabelling the target force the atom {12}{13}{23} to be at most −1 bit. So a multivariate extension of Bertschinger et al.’s unique information cannot be a partial information decomposition. Read it knowing that the theorem rests on the identity axiom applied to sources that are sets of variables and on an unstated invariance under relabelling the target, that its other results (monotonicity of unique information, failure of left monotonicity) are about the bivariate measures, and that the multivariate structure it calls for is left open. Filed as THEORY-713. |
| 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-1208 v3 | Binding and the Phenomenal Unity of Consciousness | Revonsuo (1999). Separates stimulus-related binding, any neural processing that represents a stimulus’s unity, conscious or not, from consciousness-related binding, the brain’s construction of phenomenally unified percepts, crediting the split to Smythies (1994); distinguishes phenomenal, neural and cognitive levels of the problem and five kinds of phenomenal binding; and argues from his own EEG study that 40-Hz synchrony accompanies the construction of a unified percept but is not the correlate of its content. | Active — read 2026-10-29 (NOTE-1406) in full, from the publisher’s typeset PDF posted on hedweb.com (https://www.hedweb.com/intelligence-explosion/binding.pdf); worth reading as a clear separation of stimulus-related binding, neural recovery of a stimulus’s unity whether or not anything is conscious, from consciousness-related binding, the construction of unified experience, with three levels of description and five kinds of phenomenal binding tied to the deficits that dissociate them. Read it knowing that it credits the main distinction to Smythies (1994), that its terms are not “functional” and “phenomenal”, and that its one empirical argument, on 40-Hz synchrony, is the author’s own EEG study of eight subjects. |
| LIT-1212 v2 | Multiple-gradient descent algorithm (MGDA) for multiobjective optimization | Désidéri (2012; first as an INRIA report, 2009). A point is Pareto-stationary when some convex combination of the criteria’s gradients is zero, which every Pareto-optimal point is; when a point is not, minus the minimum-norm element of the gradients’ convex hull is a descent direction common to all smooth criteria, and steepest descent along it (MGDA) has a subsequence converging to a Pareto-stationary point when the criteria are positive and coercive. | Active — read 2026-10-29 (NOTE-1401) in full, from the Comptes Rendus Mathématique’s own open copy of the 2012 note; worth reading as the short published source for Pareto-stationarity and for the minimum-norm point of the gradients’ convex hull as a common descent direction, the constructive half of CLAIM-366’s convex-hull test. Read it knowing that it does not state the converse (zero in the hull excludes common strict descent), that its convergence theorem’s proof is a sketch, and that the direction, unlike its existence, depends on how the gradients are scaled, which the author leaves open. |
| LIT-1213 v2 | Knowledge and common knowledge in a distributed environment | Halpern & Moses (1990; first at PODC 1984). With knowledge defined as truth at every point a processor cannot distinguish from the present one, a guaranteed simultaneous coordinated attack makes the attack common knowledge; over a channel that can lose any message nothing becomes common knowledge that would not with no messages delivered, so no correct protocol ever attacks, and not even eventual coordination can be guaranteed. Uncertain start and delivery times alone make common knowledge unattainable; ε-, eventual and timestamped common knowledge are attainable in many systems. | Active — read 2026-10-29 (NOTE-1381) in full, from the authors’ arXiv deposit of the JACM version; worth reading as the paper that makes “knowing” precise for processors in a system of runs and proves that guaranteed coordinated action needs common knowledge, that a channel which can lose any message cannot create it, and that any uncertainty in timing already rules it out, with weaker ε-, eventual and timestamped variants that are attainable. Read it knowing that the protocols are deterministic, that several results (the S5 properties, Theorems 11–12) are proved elsewhere or left to the reader, and that it credits the coordinated attack problem to Gray (1978) without citing Akkoyunlu et al. (1975). |
| LIT-1214 v3 | Some constraints and tradeoffs in the design of network communications | Akkoyunlu, Ekanadham & Huber (1975). A design paper on interprocess communication in networks of sequential processes. Complete status of a transaction is impossible in an arbitrary distributed facility and, with time-outs, even in a reliable one; an intermediate process can be made invisible only if the system withholds status it knows. Its appendix proves, as a story of gangsters and a messenger who may be mugged, that no finite exchange over a lossy channel brings two parties to know they agree the message got through: later called the coordinated attack or two generals problem. | Active — read 2026-10-29 (NOTE-1410) in full, from a scan of the SOSP ‘75 pages on the TU Wien Distributed Systems Group’s course page (https://dsg.tuwien.ac.at/linksites/teaching/courses/AdvancedDistributedSystems/download/1975_Akkoyunlu,%20Ekanadham,%20Huber_Some%20constraints%20and%20tradeoffs%20in%20the%20design%20of%20network%20communications.pdf); worth reading as the earliest statement the record holds, with a proof, that no finite exchange over a lossy channel brings two parties to know they agree a message got through: the coordinated attack problem in substance, three years before Gray (1978). Read it knowing that the result is a one-page appendix to a design paper on interprocess communication, told as gangsters and a messenger, that its goal is mutual knowledge of delivery rather than coordinated action, and that its fuller proof is deferred to an unpublished working paper. |
| LIT-1215 v2 | Towards a Neuronal Gauge Theory | Sengupta, Tozzi, Cooray, Douglas & Friston (2016). An essay proposing that variational free-energy minimization be cast as a gauge theory. The only connection it names is the Levi-Civita connection of the Fisher metric on the manifold of a belief’s sufficient statistics, so its gauge freedom is reparameterization; it reads attention as precision weighting forced by that manifold’s curvature. No gauge group or invariant Lagrangian is specified. | Active — read 2026-10-29 (NOTE-1350) in full, from the PLOS Biology PDF and its supporting information (prose; the supplements’ equations did not extract); worth reading as the source for the claim that free-energy minimization is a gauge theory, and for what that claim comes to: Riemannian descent on a belief manifold whose connection is the Levi-Civita connection of the Fisher metric. Read it knowing that it is an essay with no gauge group, invariant Lagrangian or derived field, that its gauge freedom is reparameterization, and that it contains errors on curvature and on what a gauge field is. |
| LIT-1217 v2 | Practical Byzantine Fault Tolerance | Castro & Liskov (1999), OSDI ‘99, pp. 173–186. A state-machine replication protocol that keeps safety with at most f of 3f + 1 replicas Byzantine-faulty and no timing assumption, using weak synchrony only for liveness, with MACs in place of signatures in the normal case. A Byzantine-fault-tolerant NFS on four replicas ran the Andrew benchmark 3% slower than Digital Unix’s NFS, measured without faults and with view changes not yet implemented. | Active — read 2026-10-29 (NOTE-1356) in full, from the copy MIT’s 6.824 course hosts (pdos.csail.mit.edu), the proceedings text of pp. 173–186; worth reading as the paper that made Byzantine-fault-tolerant state-machine replication practical: safety with at most f of 3f + 1 replicas faulty and no timing assumption, liveness under weak synchrony, a faulty primary replaced by rotation rather than by voting anyone out. Read it knowing that correct behaviour is defined as following the protocol, so the service’s own specification is taken as given; that its fault bound needs independent failures the paper says must be engineered; and that its measurements are of the normal case on four replicas, with view changes not implemented in the measured library. |
| LIT-1218 v3 | Propagation, not aggregation: linking individual psychological flexibility to organizational functioning | Guida, Minutola & Presti (2026). A conceptual paper with no data. Organizational flexibility is not the aggregate of flexible individuals but a pattern of coordinated, values-consistent action that is retained and spread or absorbed and extinguished; whether a rise in a member’s flexibility reaches the organization depends jointly on that member’s leverage over the consequences colleagues meet and on whether the culture reinforces or penalizes such action. Bond’s (2018) leader-based route is the high-leverage special case. Five propositions and a factorial design are set out; the two measures a test needs do not yet exist. | Active — read 2026-10-29 (NOTE-1353) in full, from the publisher’s open-access PDF (Frontiers, CC BY); worth reading as the prior transfer of ACT’s psychological flexibility to the organization, which puts the problem as propagation, not aggregation, and makes it depend jointly on a member’s leverage over the consequences colleagues meet and on whether the culture reinforces values-consistent action, with Bond’s (2018) leader route as the high-leverage case. Read it knowing that it is a conceptual paper with no data, that the two measures its tests need do not exist, that its motivating evidence (Fleming 2024) is cross-sectional and bears on individual benefit more than on organizational transfer, and that two empirical sentences in §2.1 carry no citation. |
| LIT-1220 v3 | Psychological Safety and Learning Behavior in Work Teams | Edmondson (1999). In a cross-sectional field study of 51 work teams in one office-furniture manufacturer, team psychological safety, a shared belief that the team is safe for interpersonal risk-taking, was associated with members’ and observers’ ratings of learning behavior, while team efficacy added little once safety was controlled. Learning behavior mediated between psychological safety and observer-rated team performance, and safety between context support and leader coaching and learning. | Active — read 2026-10-29 (NOTE-1404) in full, from a JSTOR-printed copy posted among MIT course readings (https://web.mit.edu/curhan/www/docs/Articles/15341_Readings/Group_Performance/Edmondson%20Psychological%20safety.pdf); worth reading as the paper that defines team psychological safety, a shared belief that the team is safe for interpersonal risk taking, and finds it associated with team learning behavior in 51 teams of one company, with learning behavior carrying its association with observer-rated performance. Read it knowing that the study is cross-sectional and in one company, that the antecedents and safety come from the same survey, that efficacy’s role is mixed rather than absent, and that its teams are cooperative: it says nothing about compromised or adversarial members. |
| LIT-1223 v3 | Refractory depression – mechanisms and efficacy of radically open dialectical behaviour therapy (RefraMED): findings of a randomised trial on benefits and harms | Lynch et al. (2020). In a trial of 250 adults with refractory depression (162 to RO DBT plus usual care, 88 to usual care), RO DBT lowered Hamilton depression scores by 5.40 points at 7 months, the end of therapy, but the differences at the 12-month primary end-point (2.15) and at 18 months (1.69) were not significant; psychological flexibility and emotional coping were significantly better at 12 and 18 months, and all eight possibly related serious adverse reactions were in the RO DBT arm. | Active — read 2026-10-29 (NOTE-1358) in full, from the CC BY published version in PubMed Central (PMC7282863); worth reading as the first multicentre randomised trial of RO DBT and the main controlled evidence for it: RO DBT plus usual care beat usual care on depression at the end of six months of therapy and not at the 12-month primary end-point or at 18 months, while flexibility and emotional coping stayed better from 12 months on. Read it knowing that it selected on refractory depression and never measured overcontrol, that it was underpowered by its own account (therapist correlation 0.14 against 0.025 assumed), that the developer trained the therapists and six of sixteen authors have a financial interest, that its abstract’s “throughout” for the process gains is not what its Table 1 shows, and that its title’s mechanisms are not analysed. |
| LIT-1225 v2 | Division of labour and the evolution of extreme specialization | Cooper & West (2018). A kin-selection model of division of labour over one cooperative trait: it needs accelerating returns to helping but is not guaranteed by them, and when it evolves one phenotype is always a pure reproductive, with a feedback driving helper and reproductive to the extremes. Relatedness does not affect whether it evolves for an essential trait and favours sterile helpers. The authors infer that it drives major transitions. | Active — read 2026-10-29 (NOTE-1369) in full, from the authors’ accepted manuscript in the Oxford University Research Archive; worth reading as the model in which division of labour, once favoured, always yields a pure reproductive and often a sterile helper, with relatedness irrelevant to whether it evolves for an essential trait. Read it knowing that the proofs and simulations are in a supplement not read, that its Table 1 and Figure 5 disagree on how efficiency affects the proportion of helpers, and that it shows dependence, not the vulnerability to losing a specialist that A46 attributed to it. |
| LIT-1226 v2 | Zero Trust Architecture | Rose, Borchert, Mitchell & Connelly (2020). NIST Special Publication 800-207: an architecture in which no subject, device or network location is trusted implicitly and every session to a resource is authorized by a policy engine and administrator on dynamic policy and enforced at a policy enforcement point; seven tenets, deployment models, threats (subversion of the policy engine first among them) and a migration path, with NIST’s own judgment that the 2020 ecosystem was not mature enough for widespread adoption. | Active — read 2026-10-29 (NOTE-1371) in full, from NIST’s own PDF; worth reading as the reference definition of zero trust: no implicit trust from network location or ownership, every session to a resource authorized by a policy engine and administrator and enforced at a policy enforcement point, on dynamic policy over identity, asset state and behaviour. Read it knowing that it is a guideline that measures nothing, that it moves absolute trust onto the policy engine and administrator and answers their subversion only with configuration, monitoring and audit, and that it leaves an insider acting within an account’s granted access largely outside its reach. |
| 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-1231 v2 | Constrained optimization as ecological dynamics with applications to random quadratic programming in high dimensions | Mehta, Cui, Wang & Marsland (2019). A duality between constrained optimization with inequality constraints, quadratic programming included, and consumer-resource models of ecological dynamics; with a cavity solution it gives the statistics of random high-dimensional quadratic programs, in agreement with numerics. | Active — read 2026-10-29 (NOTE-1395) in full, from arXiv 1809.04221v1; worth reading as the plain statement that inequality-constrained optimization is a consumer–resource ecology, constraints as species and multipliers as abundances, and that the Lagrangian dual of quadratic programming is a Lotka–Volterra system with α = CCᵀ. Read it knowing that the arXiv text has several algebraic slips (κ_i in the main text among them), that its “always” reduction of QP to a squared distance is not general, and that the PRE version was not compared. |
| 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-1233 v2 | Permanence via invasion graphs: incorporating community assembly into modern coexistence theory | Hofbauer & Schreiber (2022). For ecological ODEs whose invasion growth rates have nonzero, well-defined signs on each subcommunity, it defines the invasion graph of communities and invasions and proves that when the graph is acyclic, robust permanence holds if each species has a positive invasion growth rate at every −i community (a community without it that no other missing species can invade), and, for smooth models, only if. With cycles, signs are not enough. | Active — read 2026-10-29 (NOTE-1379) in full, from arXiv 2204.03773v2; worth reading as the theorem that says when signs of invasion growth rates decide coexistence: with an acyclic invasion graph, robust permanence holds exactly when each species can invade each of its −i communities. Read it knowing that it is deterministic, that its sign-parity assumption excludes common non-Lotka–Volterra cases, that cycles are left open, and that its switching-predator example swaps the labels of two invasion conditions. |
| 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-1237 v2 | Linking modern coexistence theory and contemporary niche theory | Letten, Ke & Fukami (2017). Translating Tilman’s two-consumer, two-resource model into Chesson’s niche overlap and fitness ratio, at equilibrium and without alternative stable states: varying the resource supply ratio is equalizing (for essential resources, at extreme ratios niche overlap jumps to 1), varying impact-niche overlap is stabilizing, and varying requirement-niche overlap is both but leaves coexistence unchanged. | Active — read 2026-10-29 (NOTE-1377) in full, from the published PDF on Fukami’s Stanford page; worth reading as the worked translation of Tilman’s two-consumer, two-resource model into Chesson’s niche overlap and fitness ratio: supply ratios mostly equalize, impacts stabilize, requirements do both. Read it knowing that the results are for two species and two resources at a stable equilibrium, drawn from worked cases with the general derivations in online appendices not read here, and that Chesson’s overlap is pairwise. |
| LIT-1238 v3 | Successive refinement of information | Equitz & Cover (1991). A source is successively refinable from distortion D₁ to D₂ < D₁ when a description at rate R(D₁), followed by an addendum, reaches D₂ at total rate R(D₂). For finite alphabets this holds iff some pair of optimal test channels forms a Markov chain X → X̂₂ → X̂₁, the coarse reproduction a stochastic degradation of the fine one. It holds for every discrete source under Hamming distortion, and the paper also shows it for Gaussian/squared-error and Laplacian/absolute-error sources. It fails for a three-letter source under absolute error (Gerrish’s problem). | Active — read 2026-10-20 (NOTE-988) in full; worth reading for the exact condition under which optimal descriptions at two distortions are compatible, a Markov chain X → X̂₂ → X̂₁ between some pair of optimal test channels (THEORY-751), and for Gerrish’s three-letter source, where the finer optimum drops a reproduction letter the coarser one uses and refinement fails. Read it knowing that Theorem 2 is proved for finite alphabets only and rests on cited multiple-descriptions theorems, that the condition is about stochastic test channels for long blocks and not about nesting of partitions (its own Fig. 1 shows single-shot Gaussian quantizers failing to nest), that the region conditions in (34)/(36) are printed reversed and (37) is misprinted, and that the remark after Theorem 3 holds only for p < √2 − 1. |
| LIT-1239 v2 | Localness of energy cascade in hydrodynamic turbulence. I. Smooth coarse graining | Eyink & Aluie (2009). Builds an exact decomposition of kinetic energy into band-pass contributions from smooth, graded filters on a geometric sequence of scales, with band budgets whose fluxes telescope, and carries over Eyink’s (2005) bounds: if velocity increments scale with exponents strictly between 0 and 1, the mean energy flux across a scale ℓ takes from scales above Δ or below δ at most a power of the scale ratio, 2/3 at K41 scaling. The bounds are sketched here and proved in the 2005 paper. A heuristic decorrelation argument and one 512³ simulation account for Kraichnan’s faster 4/3 decay of the signed contributions. | Active — read 2026-10-20 (NOTE-969) in full, from arXiv:0909.2386v1; worth reading for its exact band-pass decomposition of kinetic energy with smooth filters (a multiscale Germano identity, in which each band’s energy changes by the flux in minus the flux out), for a compact statement of when and why the energy flux across a scale is local in scale (THEORY-754), and for the account of why the rigorous 2/3 exponent is weaker than Kraichnan’s 4/3. Read it knowing that the rigorous bounds are proved in Eyink (2005), LIT-1252, and only sketched here; that they are conditional on a scaling hypothesis for velocity increments (exponents strictly between 0 and 1) and a non-zero mean flux, neither proved for Navier–Stokes; that the 4/3 argument is heuristic and its one simulation brackets rather than confirms it; that the band decomposition’s non-negativity holds only after integration for the kernels it needs; and that locality here is in scale, for one field, and says nothing about units. |
| 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-1243 v2 | Scaling of information in turbulence | Granero-Belinchón, Roux & Garnier (2016). On one Modane wind-tunnel velocity record, estimates with k-nearest-neighbour estimators the conditional entropy of a sample given samples a lag τ earlier (the “entropy rate”) as a function of τ. Slopes −1/3 (inertial) and −1 (dissipative) are S₂’s scaling through a Gaussian formula the data obey. Entropy rates conditioned on the sign of the increment differ, which the paper reads, without warrant, as an information-theoretic proof of the energy cascade. | Active — read 2026-10-20 (NOTE-970) in full; worth reading for a clean demonstration that a scale-dependent information measure of a near-Gaussian turbulent signal reduces to the second-order structure function (THEORY-750), and as a worked example of why entropy rates cannot carry the direction of the cascade (THEORY-748). Read it knowing that its “information” is a lag-dependent conditional entropy of the velocity, not a quantity distributed over or transferred between scales; that its claim to “prove the existence of an energy cascade” with information theory does not follow, since one-point skewness alone gives unequal sign-conditioned entropy rates; and that no result ties an information quantity to the energy balance. |
| 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-1245 v2 | Optimal prediction and the Mori–Zwanzig representation of irreversible processes | Chorin, Hald & Kupferman (2000). For any flow with an invariant measure, writes the resolved variables’ exact evolution as Zwanzig’s generalized Langevin equation, with conditional expectation as the projection: a Markovian term E[LA|A], a memory integral and a noise with zero conditional mean. First-order optimal prediction is the Markovian term alone. In a perturbative nonlinear Schrödinger example, keeping the memory recovers the decay of the conditional mean that the Markovian scheme misses. | Active — read 2026-10-20 (NOTE-989) in full, from the authors’ PostScript copy on Chorin’s Berkeley page; worth reading for the generalized Langevin identity of the resolved variables, with conditional expectation under an invariant measure as the projection (Markovian term R(A) = E[LA|A], memory K(s, A) = E[LS⊥ˢF|A], noise S⊥ᵗF with zero conditional mean), for first-order optimal prediction as its Markovian part, and for the renormalized Hamiltonian −log∫e^{−H} in the canonical case. Read it knowing that its claim that no m-equation Markovian model beats first-order optimal prediction in mean square holds only for the instantaneous rate, that it states no fluctuation–dissipation relation and no criterion for when memory may be dropped, and that its one demonstration (m = 0, perturbative, kernels cut off at a time chosen to give a reasonable decay) shows the decay of the mean but not a faithful mean after t ≈ 2. |
| LIT-1246 v3 | Diffusion maps | Coifman & Lafon (2006). From a symmetric non-negative kernel, a reversible random walk; its t-step diffusion distance equals the Euclidean distance between eigenvectors weighted by λ_l^t, and truncating where |λ_l|^t ≤ δ|λ₁|^t gives the diffusion map, whose dimension falls as t grows. An α-normalization by a kernel density estimate gives, as the kernel width ε → 0, a generator with invariant density q^{2(1−α)}: the density-weighted graph Laplacian at α = 0, the Fokker–Planck (Langevin) operator at α = 1/2, and the Laplace–Beltrami operator, free of the density, at α = 1. Symmetric kernels only. | Active — read 2026-10-20 (NOTE-985) in full; worth reading for QUESTION-217 as the model case of a coarse-to-fine order induced by an operator rather than an imposed partition, and for the proofs the PNAS announcement (LIT-981) deferred. The diffusion distance D_t is exactly the Euclidean distance between eigenvector coordinates weighted by λ_l^t. The number of steps t is a scale, and the kernel width ε is a second one. An α-normalization makes the small-ε limit the graph Laplacian with a density term (α = 0), the Langevin generator whose invariant density is the sampling density (α = 1/2), or the Laplace–Beltrami operator (α = 1). Read it knowing that Proposition 1’s “relative accuracy δ” for the truncated map is wrong (the bound is absolute, THEORY-745); that Appendix A’s ψ_l = φ_l/π should be φ_l/√π; that the α = 1/2 display, the circle formula, the discrete kernel of §5 and Criterion 4’s exponent are misprinted or wrong; that the boundary rate and the heat-kernel proof are incomplete (THEORY-744); and that no spectral gap is used anywhere. |
| LIT-1247 v2 | Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff | No, Ingber & Weissman (2015; IEEE TIT 2016). Asks whether successive refinement loses anything at second order, the √n dispersion term, as well as at first. For finite alphabets it gives an achievable rate pair with dispersions (Theorem 5), from which a source is strongly successively refinable if every law in a neighbourhood of it is successively refinable at (D₁, D₂) (Corollary 6). Discrete sources under Hamming distortion and the Gaussian under squared error qualify. It then uses many refinement stages as a complexity device: with L_n stages the encoder searches L_n small codebooks instead of one exponential one, at a rate penalty of order L_n log n / n, shown for binary-Hamming and Gaussian sources. Nothing in it concerns logarithmic loss. | Active — read 2026-10-20 (NOTE-980) in full, from arXiv:1506.03407v2; worth reading for successive refinement at second order (source dispersion): a sufficient condition, Corollary 6, that a source refinable at (D₁, D₂) throughout a neighbourhood of its law is also refinable with both dispersion terms, so that discrete sources under Hamming distortion and the Gaussian under squared error lose nothing even at √n precision; and for layered codes, which use a growing number L_n of refinement stages to trade encoding complexity against rate, with every stage on the rate–distortion curve. Read it knowing that it says nothing about logarithmic loss or the information bottleneck, though NOTE-988 recalled it as the source of a log-loss result (that result is No and Weissman, ISIT 2015, and No, Entropy 2019, and concerns direct log-loss, not the bottleneck’s remote one); that its sufficient condition asks for refinability in a whole neighbourhood of the source, not at the source alone; that the layered-code results cover only binary-Hamming and Gaussian-quadratic sources; and that the abstract’s “O(n^{log n}) algorithm” is an encoding search over codebooks shown to exist, not constructed, with the bound holding as stated only when the rate is below one nat. |
| LIT-1248 v3 | Onsager’s conjecture on the energy conservation for solutions of Euler’s equation | Constantin, E & Titi (1994). Proves the positive half of Onsager’s conjecture: a weak solution of the incompressible Euler equations on the periodic box with u ∈ L³(0,T; B^α_{3,∞}) ∩ C([0,T]; L²) and α > 1/3 conserves energy, because the coarse-grained energy flux across scale ε is O(ε^(3α−1)). Hölder regularity above 1/3 is a special case. It says nothing about solutions below 1/3. | Active — read 2026-10-20 (NOTE-982) in full, from the authors’ manuscript (the url:); worth reading for a complete one-page proof that a weak solution of incompressible Euler with L³-averaged increments scaling as |y|^α, α > 1/3, conserves energy (THEORY-749), and for its mechanism: the energy flux into scales below a mollification scale ε is a commutator of size ε^(3α−1). Read it knowing that it is the positive half of Onsager’s conjecture only and shows nothing about rougher fields: that dissipative solutions exist below 1/3 is Isett (2018) and others, and some rough solutions conserve energy anyway; that its “physical interpretation” (ε̄ = 0) passes to Navier–Stokes and to ensemble averages without proof; that the endpoint 1/3 is not covered; and that the manuscript misprints the exponents in the middle line of its final estimate and integrates (2) over R³ for the box D, neither affecting the result. |
| LIT-1249 v3 | Slow Feature Analysis: Unsupervised Learning of Invariances | Wiskott & Sejnowski (2002). Learns instantaneous functions of the input whose outputs vary as slowly as possible, minimizing ⟨ẏ²⟩ under zero-mean, unit-variance and decorrelation constraints, solved in closed form within a fixed (usually quadratic) expansion by sphering and taking the smallest eigenvectors of the derivative covariance. Stacked modules in a 1-D model of the visual hierarchy learn translation, size, rotation, contrast and, less well, illumination invariance from the training stimulus, with location (“where”) among the slowest outputs alongside identity (“what”). | Active — read 2026-10-20 (NOTE-971) in full, from Wiskott’s own PostScript preprint; worth reading for the slowness objective stated exactly (minimize ⟨ẏ²⟩ under zero mean, unit variance and decorrelation), for its closed-form solution within a fixed nonlinear expansion by sphering and an eigendecomposition of the derivative covariance (THEORY-746), and for the demonstration that stacked modules learn translation, size, rotation, contrast and, less well, illumination invariance for 1-D patterns from the training stimulus alone. Read it knowing that optimality holds per module, on the training signal and within the chosen function space, and not for the greedy hierarchy; that “slower is more abstract” is its premise, not a finding, so a stack built this way is slower at higher stages by construction; that the slowest outputs include location, so slowness is not invariance; that no generative model and no learning dynamics appear; and that every stimulus is synthetic and one-dimensional. |
| LIT-1250 v2 | Diffusion maps, spectral clustering and reaction coordinates of dynamical systems | Nadler, Lafon, Coifman & Kevrekidis (2005; ACHA 2006). For data sampled from p = e^{−U}, it expands the α-normalized diffusion-map operators for small kernel width. The normalized graph Laplacian (α = 0) tends to a backward Fokker–Planck generator with potential 2U, equivalently a Schrödinger operator with potential |∇U|² − ΔU. The normalization α = 1/2 gives the generator of the Langevin dynamics ẋ = −∇U + √2ẇ itself. α = 1 gives the Laplace–Beltrami operator, free of the density. So for data from a stochastic system in equilibrium, the leading eigenfunctions approximate the system’s slowest modes, and the paper proposes them as reaction coordinates. Examples: Ornstein–Uhlenbeck processes, where the first eigenfunctions parametrize the slow variable; a double well, where the first eigenfunction is ±1 on the two wells; three wells; and the iris data. The expansions are formal, and the printed generators are twice what the stated kernel and time step give. | Active — read 2026-10-20 (NOTE-986) in full, from arXiv:math/0503445v1; worth reading for the bridge from a diffusion map to the dynamics behind the data. For samples from p = e^{−U}, the ordinary normalized graph Laplacian (α = 0) tends to a backward Fokker–Planck generator with potential 2U, and the anisotropic normalization α = 1/2 to the generator of the Langevin dynamics with potential U itself, whose slow eigenfunctions the paper proposes as reaction coordinates. It also has worked examples: Ornstein–Uhlenbeck (the finite-ε spectrum λ_k = (τ/(τ+ε))^k), a double well whose first eigenfunction is ±1 on the two wells, and a three-well potential with two pathways. Read it knowing that the generators as printed are twice what the paper’s own kernel and time step give (its Ornstein–Uhlenbeck lemma and its equation (32) disagree by that factor, which this reading checked); that “converge” means a formal small-ε expansion of the operator, with the large-sample limit cited and no spectral convergence shown; that its sufficient condition for the first eigenfunctions to depend only on the slow variable is printed the wrong way round; that its double-well example is separable, so the slow coordinate is closed by construction; and that from equilibrium samples the eigenfunctions are recovered well while the slow eigenvalue, the inter-well rate, is not. In what sense slow eigenfunctions are closed coarse variables is the record’s addition (THEORY-762). The published ACHA version was not reached. |
| LIT-1253 v3 | Optimal prediction with memory | Chorin, Hald & Kupferman (2002). Writes the resolved variables of an ODE with uncertain unresolved initial data as an exact generalized Langevin equation (Markovian term, memory, noise) under three projections, computes the memory from equilibrium correlation functions through a Volterra equation, and introduces the t-damping (t-model) equation, whose leading-order memory term dissipates the effective energy of separable Hamiltonian systems. On one 4-variable example the memory restores the decay of the conditional mean that the Markovian equation misses. No error bounds. | Active — read 2026-10-20 (NOTE-975) in full, from the published version on Chorin’s Berkeley page; worth reading for the exact generalized Langevin equation under three projections (conditional expectation, linear, finite-rank), for computing the memory kernel from equilibrium correlation functions through a Volterra equation, and for the t-damping (t-model) equation dΦ/dt = R̄(Φ) + tS(Φ) with its proof that, for separable Hamiltonians, it dissipates the effective energy (THEORY-752). Read it knowing that it has one 4-variable example, no error bound for any approximation, no Markovian augmentation by memory coordinates, that its abstract’s “close to the best possible estimate” holds on that example only to t ≈ 8, and that the t-model it calls a short-memory approximation treats the kernel as constant over the whole window. |
| LIT-1254 v2 | Information loss under coarse graining: A geometric approach | Raju, Machta & Sethna (2018). Follows the Fisher information metric of the bare parameters as the data are coarse-grained along an RG flow. Exactly: coarse-graining an exponential family loses the expected conditional covariance of its energy operators, and under an exact RG step with linear beta functions that loss is analytic, so the singular part of the metric survives; for diffusion the metric scales as n^(1−μ) by Hermite order, keeping only the drift. By a scaling argument: irrelevant directions contract as b^−(d−2λ). On its own scalings only directions with eigenvalue above d/2 keep their information, not every relevant one. | Active — read 2026-10-20 (NOTE-972) in full, from arXiv v2; worth reading for the identity that coarse-graining an exponential family loses exactly the expected conditional covariance of its energy operators, for its consequence under an exact RG step (the loss is the Hessian of an analytic constant, so the singular part of the Fisher metric survives; THEORY-742), and for the exact diffusion case, where the metric scales as n^(1−μ) by Hermite order. Read it knowing that “relevant directions are exactly maintained” is true only of the singular part, that on its own scalings the preserved directions are those with RG eigenvalue above d/2 rather than above 0, that the contraction of irrelevant directions (Eq. 21) is a scaling argument backed by the numerics of Machta et al. (2013) and not derived, that the drift is exactly preserved only at the Gaussian fixed point, and that no learning dynamics appear. |
| LIT-1255 v2 | A proof of Onsager’s conjecture | Isett (2016; Annals 2018). For every α < 1/3 it constructs a nonzero weak solution of the 3D incompressible Euler equations on R × T³, with velocity in C^α and pressure in C^{2α} in space and time, that is identically zero outside a finite time interval, so its kinetic energy is not constant. This is the negative half of Onsager’s conjecture; the positive half, conservation above 1/3, is Constantin, E and Titi’s. The construction iterates a Main Lemma that adds high-frequency corrections built from Mikado flows, after a new “gluing” step that rearranges the error so that it lives on short, separated time intervals and the corrections never interact. | Active — read 2026-10-20 (NOTE-974), skimmed, from arXiv:1608.08301v2: the introduction, the statement of the theorem, the Main Lemma and its three sublemmas, the gluing construction and the convex-integration ansatz, and the whole proof of the theorem from the Main Lemma; the long estimates of §§9–10 and 17 and the appendix were not checked. Worth reading for the negative half of Onsager’s conjecture: for every α < 1/3 there is a nonzero weak solution of the 3D incompressible Euler equations on the periodic box, Hölder-continuous with exponent α in space and time, that vanishes outside a finite time interval and so does not conserve energy (THEORY-763). With Constantin, E and Titi (LIT-1248) it fixes 1/3 as the threshold. Read it knowing that its solutions gain energy from zero and lose it again, so they are not dissipative (admissible) solutions, which came later (Buckmaster, De Lellis, Székelyhidi and Vicol 2019); that they are built by convex integration from the zero solution and so also show non-uniqueness, not that turbulent or vanishing-viscosity limits are of this kind; that the endpoint 1/3, two dimensions and finite-energy solutions on R³ are left open; and that the arXiv v2 copy read is a 2024 revision, not compared with the Annals text. |
| LIT-1256 v3 | Diffusion wavelets | Coifman & Maggioni (2006). A self-adjoint diffusion operator T defines a multiresolution analysis by thresholding its dyadic powers at a precision ε: V_j is spanned by the eigenvectors with λ^t ≥ ε, so the levels are exactly nested spectral bands set by the operator, not by a partition. The contribution is an algorithm that squares T on each compressed orthonormal basis to build localized scaling functions and wavelets for approximations of these spaces, and compressed dyadic powers that apply the Green’s function fast. Proofs cover the uncompressed construction; the compressed scheme’s error and cost are argued, not proved. | Active — read 2026-10-20 (NOTE-984) in full; worth reading for QUESTION-217 and QUESTION-218 as the multilevel case of an operator-induced coarse-to-fine hierarchy. The levels V_j are spanned by the eigenvectors of a self-adjoint diffusion T with λ^t ≥ ε at dyadic t. They are exactly nested, the wavelet spaces W_j are spectral bands of about one octave, and a localized orthonormal basis of each level is built without computing eigenvectors. Read it knowing that the levels are spectral bands and not spatial blocks (the dyadic cubes only shape the basis); that nesting needs no spectral decay, which buys only compression; that the compressed algorithm as written thresholds T^{2^{j−1}}, not T^{2^j−1} as §5.4 and Fig. 1 say, and the paper’s own Fig. 9 follows the former (THEORY-758); that the indexing of V_j is inconsistent between (4.8), §4.6 and Theorem 27; that only the uncompressed route (Theorems 27 and 29) has proofs, while the compressed scheme’s error, localization and O(n log² n) cost are argued or observed; and that the non-self-adjoint extension is asserted, not carried out. |
| LIT-1258 v2 | Exact and Soft Successive Refinement of the Information Bottleneck | Charvin, Catenacci Volpi & Polani (Entropy 2023). Defines successive refinement for the information bottleneck in single-letter form: a coarse optimum T₁ can be extended to a fine optimum (T₁, S). This holds iff some pair of optima forms the chain X → T₂ → T₁, iff the coarse encoder is a garbling of the fine one, and, when the fine decoder is injective, iff the coarse decoder points lie in the convex hull of the fine ones. That last form gives a linear-programming test. Refinability is proved for binary X and Y, for Y a function of X, and (from a cited semigroup result) for jointly Gaussian variables. Numerically, for 3×3 and larger random sources, the hull test on computed optima often fails, especially below the second bifurcation. The loss, measured by unique information, stayed under 5.4% of I(X; T₁, T₂). The failures are not certified, since global optimality and uniqueness of the optima are left as a conjecture. | Active — read 2026-10-20 (NOTE-981) in full, from the published version in the University of Hertfordshire Research Archive; worth reading for the single-letter definition of successive refinement for the information bottleneck and its equivalent forms (Proposition 1: some pair of optimal encoders forms the Markov chain X → T₂ → T₁; Proposition 8: the coarse encoder is a Blackwell garbling of the fine one); for the convex-hull test (Proposition 4: with an injective fine decoder, refinement holds iff every decoder point q(X|t₁) lies in the convex hull of the q(X|t₂)), checkable by a linear programme; for proofs of refinability when X and Y are both binary, when Y is a function of X, and for jointly Gaussian variables (the last resting on Kline and Palmer’s semigroup result); and for soft refinement measured by unique information. Read it knowing that the linear programme tests the particular optima a solver returns, so that a failed test certifies nothing unless the optima are globally optimal and unique, which the paper leaves as Conjecture 1 and calls its own figures “mere numerical proxies” (Appendix D); that its evidence that refinement fails is therefore numerical and uncertified, with no count of how many sampled distributions failed; that the unique information computed is an upper bound on the soft measure for the same reason; that the deep-learning reading of §4.2 is speculative; and that the commentary on Proposition 8 swaps its points (ii) and (iii). |
| LIT-1259 v2 | Non-Markovian closure models for large eddy simulations using the Mori-Zwanzig formalism | Parish & Duraisamy (2017; arXiv 2016). Derives subgrid closures for large-eddy simulation from the Mori–Zwanzig formalism by Stinis’s finite-memory approximation, which replaces the memory integral by auxiliary relaxation equations for the subgrid force: a finite Markovian augmentation of the resolved modes, with no error bound and a memory length fitted to DNS (Burgers: about 0.2 over the spectral radius of the resolved Jacobian) or preset. On Burgers, isotropic turbulence, the Taylor–Green vortex and channel flow it tracks filtered DNS about as well as dynamic Smagorinsky, and better on the transitional Taylor–Green vortex. | Active — read 2026-10-20 (NOTE-973) in full; worth reading for the clearest working example of a Mori–Zwanzig memory term turned into a finite Markovian augmentation (Stinis’s finite-memory closure: the resolved modes plus a relaxing subgrid-force field), tested against filtered DNS on Burgers and four Navier–Stokes flows. Read it knowing that the augmentation’s error is not bounded, the memory length is fitted or preset, the zero-variance projection makes the formalism a deterministic trajectory closure, “finite support” is exponential decay, and the comparisons are plots without error norms. THEORY-760 (Active) and THEORY-747 (Proposed) are filed from it. |
| 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-1261 v2 | On the Spectral Bias of Neural Networks | Rahaman et al. (2019; arXiv 2018). Proves, for compactly supported ReLU networks, that the Fourier transform falls as k^(−d−1) in almost every direction and no slower than k^(−2). Shows by experiment that a deep ReLU network fits low frequencies before high ones, even when the high ones are ten times stronger, and that its high-frequency components are the least robust to parameter noise. Shows that on a curve embedded in the plane, high latent frequencies are fitted more easily as the embedding gets longer and more convoluted. | Active — read 2026-10-20 (NOTE-983) in full; worth reading for the experiment in which a ReLU network fits low frequencies before high ones even when the high ones are ten times stronger (THEORY-759), for the Fourier analysis of piecewise-linear networks (THEORY-761), and for the observation that the frequencies that are hard to learn depend on how the data’s manifold is embedded. Read it knowing that its theorem is proved only for compactly supported networks, that the link from the theorem to the order of learning is an upper bound on speed and not a proof of order, that the volume result in Appendix D does not follow, and that its “manifold complexity” is confounded with the curve’s length. |
| LIT-1262 v2 | The free-energy self: A predictive coding account of self-recognition | Apps & Tsakiris (2014; online 2013), Neurosci. Biobehav. Rev. 41:85–97. Self-recognition is recast under the free-energy principle: one’s own body is “the most likely to be ‘me’”, represented as a high-level, multimodal empirical prior learned from correlations between vision, touch, proprioception, corollary discharge and interoception, and “the notion that there is a ‘self’ is the most parsimonious and accurate explanation for sensory inputs”. The rubber hand, enfacement and rubber-voice illusions become one effect: synchronous stimulation leaves surprise that multimodal areas explain away by raising the probability that the other hand, face or voice is “me” and lowering it for one’s own. Context (a non-corporeal object, a misplaced hand, culture) acts as a prior. Three anatomical predictions are drawn: no unimodal area is self-specific; multimodal areas (TPJ, anterior insula, IPS, IFG) are engaged but not self-specific; predicted self-stimuli suppress activity. The authors concede there is “little direct evidence” for the account. | Active — read 2026-10-19 (NOTE-991) in full; worth reading as the first statement of the predictive-processing account of self-recognition and body ownership: one’s own face, voice and body are recognised as “me” because a high-level, multimodal prior makes them the most probable cause of correlated input across the senses, and the rubber hand, enfacement and “rubber voice” illusions are that prior being updated when synchronous multisensory stimulation leaves surprise to explain away. Read it as a theoretical review that, by its authors’ own account, rests on evidence that “neither largely supports nor refutes” it: no data, no model, no simulation, and predictions they call hard to falsify with standard fMRI. |
| LIT-1263 v2 | Interoceptive inference, emotion, and the embodied self | Seth (2013), Trends in Cognitive Sciences 17(11):565–573, an Opinion article. Emotions are “interoceptive inference”: felt states are the content of hierarchical top-down predictions of the causes of interoceptive signals, compared with bottom-up prediction errors in the anterior insula. Prediction errors are also cancelled by action, as descending predictions set the reference points of autonomic reflexes, the visceral counterpart of active inference in motor control. The same scheme is applied to the experience of body ownership. The rubber hand illusion is a revision of the multisensory self-model under precision-weighted error. Low interoceptive sensitivity goes with greater susceptibility to it, and a virtual hand pulsing in time with the heartbeat is owned more. No direct test of the model is claimed. | Active — read in full 2026-10-19 (NOTE-1000); worth reading as the short statement that put emotion and body ownership under one predictive-coding mechanism: felt emotion is the content of top-down predictions of the causes of interoceptive signals, the anterior insula is the comparator, and the experience of body ownership is what the brain infers to be “most likely to be me” from interoceptive and exteroceptive signals together. It is an opinion article with no new data. Its evidence is indirect and cited, and its one figure is a study by the author’s own group, an augmented-reality rubber hand illusion whose virtual hand flashed in or out of time with the heartbeat. The record’s bridge from its interoception cluster to body ownership. |
| LIT-1264 | No specific relationship between hypnotic suggestibility and the rubber hand illusion | Ehrsson, Fotopoulou, Radziun, Longo & Tsakiris (2022), Nat Commun 13:564, a Matters Arising on Lush et al. (2020). Reanalysing the open data of all 353 participants, they find no relationship between hypnotisability and the synchronous-minus-asynchronous difference in illusion ratings (rho = -0.066, BF01 = 5.7) or in proprioceptive drift (rho = 0.047, BF01 = 1.7), a significant synchrony effect in every hypnotisability quartile, and no effect of explicit suggestions about which condition should work. The correlations Lush et al. report hold as much for the asynchronous condition and for an “impossible” visual hallucination item, so they read hypnotisability as a general influence on report, not a driver of the illusion. | Active — read 2026-10-20 (NOTE-997) in full with its supplementary figure; worth reading as the case for the rubber hand illusion surviving trait suggestibility, made from Lush et al.’s own open data (n = 353): the synchronous-minus-asynchronous difference in illusion ratings does not vary with hypnotisability (Bayes factor 5.7 for the null), is significant in every quartile of it including the least suggestible, and is unmoved by explicit instructions about which condition should work. Read it as a reanalysis and an argument, not new data: it treats the asynchronous condition as a valid control, which is exactly what the reply (Lush & Seth 2022) disputes, and its drift analysis is inconclusive by its own Bayes factor. |
| LIT-1265 | Windows to the soul: Children and adults see the eyes as the location of the self | Starmans & Bloom (2012), Cognition 123(2):313–318. Three experiments with 4- and 5-year-olds (41–50 per study) and US adults on Mechanical Turk (51–53 per study) asked which of two pictured flies or snowflakes was “closer to” a cartoon character. Both groups chose positions near the eyes: over the lower body on a girl; at the chest on an alien whose eyes were there; and in front of the eyes over behind the head, or in front of the feet, on a profile. The authors conclude that people intuitively think of the self as located at or near the eyes, and, since preschoolers share it, that this is not learned from ideas about the brain. The judgement is about another, drawn person, and the step from “closer to her” to “the location of the self” is assumed, not tested. | Active — read in full 2026-10-20 (NOTE-995), from the published article on the authors’ lab site at Yale; worth reading as the best-known folk-judgement study of where a person is in their body, and for what such a study can and cannot show. Preschoolers and adults on Mechanical Turk chose which of two pictures had a fly, or a snowflake, closer to a cartoon character. They chose positions near the eyes: on a girl, near the eyes over the body; on an alien with its eyes on its chest, near the chest-eyes; on a profile, in front of the eyes over behind the head and over places the character could see. The authors conclude that children and adults intuitively place the self at or near the eyes. Read it as a judgement about where another, drawn, person is, with small samples, some slips in the statistics and an inference from “closer to Mary” to “the location of the self” that the design assumes. It bears on none of the rubber hand THEORYs. |
| LIT-1266 | Where exactly am I? Self-location judgements distribute between head and torso | Alsmith & Longo (2014), Consciousness and Cognition 24:70–74. Ten adults set a pointer, rotating in their sagittal plane, to point “directly at you”, by hand while blindfolded or by telling the experimenter when to stop it. Responses clustered on the upper face and the upper torso, and the starting position of the pointer decided which: from above, the face; from below, the torso. Vision and touch gave the same pattern. The authors conclude that the self is judged neither spread over the body nor at one point, and that the concept of the self as a spatial entity is “inherently ambiguous”. Small sample, 20.7% of trials lost, and a reanalysis whose key effect is misreported. | Active — read in full 2026-10-20 (NOTE-1008), from the published article on the second author’s lab site; worth reading as the first study that asks people to point at themselves on their own body, rather than on a drawing or a cartoon, and as a measure of self-location that is neither a questionnaire nor a walking-back drift. Ten adults, standing, set a pointer rotating in front of them so that it pointed “directly at you”, blindfolded by hand or by telling the experimenter when to stop it. Answers fell mostly on two regions, the upper face and the upper torso, and which one depended on where the pointer started: from above, the face; from below, the torso. Seeing and touching gave the same pattern, the touch version less sharply. Read it as a small pilot with a fifth of its trials lost to a camera fault, whose re-analysis without the lower torso misreports a non-significant effect as significant, and whose result may reflect where the pointer reached first as much as where people feel they are. It bears on THEORY-768’s self-location dimension; it bears on none of the rubber hand THEORYs. |
| LIT-1267 | Reply to: No specific relationship between hypnotic suggestibility and the rubber hand illusion | Lush & Seth (2022), Nat Commun 13:563, replying to Ehrsson et al. (2022). They accept the reanalyses and dispute the reading: an asynchronous condition is no control for demand characteristics, because expectancies are higher for the synchronous condition, and in their sample the expectancy difference did not vary with hypnotisability (b = -0.16, P = 0.072, B = 0.07). Highly hypnotisable participants may meet those expectancies by generating the experience, less hypnotisable ones by response bias. Agreement with “I felt as if the rubber hand were my hand” rose with hypnotisability (b = 0.76, rs = 0.27) and averaged 0.7 on a seven-point scale whose maximum is 3. Whether multisensory integration plays a significant role in RHI measures awaits experiments with adequate controls. | Active — read 2026-10-20 (NOTE-1003) in full; worth reading as the clearest short statement of why a synchronous-minus-asynchronous difference cannot by itself show that the rubber hand illusion is multisensory: participants expect more from the synchronous condition, and in Lush et al.’s sample (n = 353) that expectancy difference did not vary with hypnotisability, so a null relation between hypnotisability and the synchrony effect is what demand characteristics predict too. It adds that agreement with the ownership item rises steeply with hypnotisability (b = 0.76 per SWASH point) and reaches minimal agreement only in the top 31%. Read it as a reply: the expectancy and ownership regressions are post hoc, as the authors grant of both sides, and its alternative for low-suggestible participants, response bias, is asserted and not measured. |
| LIT-1268 | No causal link between changes in hand position sense and feeling of limb ownership in the rubber hand illusion | Abdulkarim & Ehrsson (2016; online 2015), Attention, Perception, & Psychophysics 78:707–720. During 90 s of synchronous or asynchronous brushing, a motor moved the participant’s hidden hand 8 cm toward or away from the rubber hand at 0.9 mm/s, below the threshold for feeling the movement. Pointing to the hand followed the displacement (drift main effect η² .68 in Experiment 1), but questionnaire ownership depended only on synchrony and did not differ between toward, away or a static hand (n = 18 in each of two experiments). The static condition reproduced the classic synchronous drift and its correlation with the illusion (r = .56). The authors conclude that changing hand position sense does not change ownership, so drift is not a cause of the illusion; whether ownership causes drift is left open. | Active — read 2026-10-20 (NOTE-992) in full; worth reading as the direct test of whether a change in felt hand position causes the feeling of owning the rubber hand. A motor slid the hidden real hand 8 cm toward or away from the rubber hand during stroking, too slowly to notice; pointing moved with it by about 5–6 cm, and questionnaire ownership did not change, in two experiments of 18. The authors conclude that drift is not a prerequisite of the illusion and is a process distinct from ownership, while still defending drift as a measure when the hand is immobile. Read it as a null result from 18 participants with no equivalence test, within distances (8–24 cm) where the illusion is known to work, and with some statistics that do not agree with their own test values. |
| LIT-1269 | Intuitions about personal identity: An empirical study | Nichols & Bruno (2010), Philosophical Psychology 23:293–312. Survey studies of University of Arizona introductory philosophy students on Williams’s (1970) personal-identity cases. A replication of Blok et al.’s brain-transplant vignette finds the person judged “still Jim” when memories survive and not when they are erased, in first- and third-person versions alike. A stripped-down version of Williams’s Pain case (a brain infection treated by a procedure that eliminates “distinctive mental states”) gets 68% (N = 50) saying “you will feel the pain” of later injections, and 72% (N = 54) in the third person, with no difference between the two. An open-ended abstract question draws psychological answers from over 70% (N = 53), and over 80% (N = 54) deny that a future person with none of their memories could be them. Given both and told they conflict, 64% (N = 45, p = 0.053) side with memory. The authors read the psychological intuitions as the more robust, and so as support for a psychological criterion “insofar as” intuitions should guide the theory. | Active — read 2026-10-20 (NOTE-996) in full, from the published PDF linked from the first author’s own publications page; worth reading as the first survey test of Williams’s two tellings of the body-exchange case and of his two explanations of why they diverge. Undergraduates mostly say a brain-transplant patient whose memories are erased is no longer the same person, and mostly say that a patient whose distinctive mental states are wiped will still feel the pain of later injections; neither result moves with first- against third-person telling. Asked abstractly, about 70% name psychological factors and more than 80% deny that someone without any of their memories could be them; made to choose, 64% side with memory (p = 0.053). Read it as evidence about how a concept of personal persistence responds to framing in one student population, not about what persistence is: the authors make the bearing conditional on intuitions informing the theory, test only necessity of psychology, and leave unseparated whether the Pain vignette asks about identity or about bare sentience. |
| LIT-1270 | Is the folk concept of pain polyeidic? | Borg, Harrison, Stazicker & Salomons (2019/2020), Mind & Language 35(1):29–47. Experimental philosophers (Sytsma, Reuter and others) argue that the folk think of pains as bodily, not mental, because lay participants deny pains privacy, subjectivity and incorrigibility. Borg et al. raise six objections. The samples are small and skewed; only acute pain was probed; asking whether pain is “in the mind” carries a pejorative implicature; means sit near neutral; denying Cartesian marks shows at most a non-Cartesian mental view; and the data support only a partly bodily concept. Pilot vignettes of their own (damage that never hurt) drew mind-centred answers (means 5.70 and 5.79 on a disagree-high scale). They propose that the folk concept of pain is “polyeidic”: an amalgam of dimensions (mental/bodily, public/private, conscious/unconscious, aversive, purposeful, motivational) on which people hold latent, framing-sensitive positions, with possible uses in clinical communication. | Active — read in full 2026-10-20 (NOTE-994) from the “revise and resubmit” manuscript in Reading’s CentAUR repository; worth reading as the clearest statement of the case against the experimental philosophers’ “bodily view” of pain (Sytsma, Reuter and colleagues), and as a proposal that the folk concept is “polyeidic”: several dimensions, mental/bodily among them, along which judgements move with framing. Four of its six objections are methodological (samples, acute pain only, the loaded “in the mind” probe, means near neutral), and two are structural: the data fit a non-Cartesian mental view as well, and they show at most that the concept is in part bodily. Read it as argument, not data. Its own evidence is two pilot vignettes reported in a footnote, with means and no sample size, and the polyeidic view is a research programme without a test. It is folk-concept evidence and does not bear on the record’s rubber hand THEORYs. |
| LIT-1271 | Trait phenomenological control predicts experience of mirror synaesthesia and the rubber hand illusion | Lush, Botan, Scott, Seth, Ward & Dienes (2020), Nature Communications 11:4853. Trait hypnotisability (the Sussex-Waterloo Scale, SWASH), which the authors call phenomenological control, predicted vicarious pain (n = 404) and mirror touch (n = 154), and, in a rubber hand illusion study of 353, agreement with the ownership and location items after both synchronous and asynchronous brushing, a visual control item, and, weakly, synchronous proprioceptive drift. An attempt to manipulate expectations failed, so the evidence is correlational. The authors conclude that the usual asynchrony and control-item checks do not rule out suggestion, and that the illusion as commonly reported may be at least partly an implicit imaginative-suggestion effect. | Active — read in full 2026-10-20 (NOTE-990), with its supplementary information and the peer review file; worth reading as the first large-sample test of whether the rubber hand illusion, as it is usually measured, tracks the trait that hypnosis scales measure. In 353 undergraduates, hypnotisability predicted agreement with the ownership items after synchronous brushing (about half a scale point per SWASH point, rs 0.26), and just as well after asynchronous brushing and for a visual “control” item; it predicted synchronous proprioceptive drift weakly (rs 0.11). In separate samples of 404 and 154 it predicted vicarious pain and mirror touch. The planned manipulation of expectations failed, so nothing here is causal, and the pre-registered test, hypnotisability against the synchronous-minus-asynchronous difference, was inconclusive. Read it as strong evidence that the standard asynchrony and control-item checks do not control for suggestion, and as no evidence on whether the synchrony effect survives such a control. Seth, author of LIT-1263, is a co-author. |
| LIT-1272 | Explaining Away the Body: Experiences of Supernaturally Caused Touch and Touch on Non-Hand Objects within the Rubber Hand Illusion | Hohwy & Paton (2010), PLoS ONE 5:e9416. Through a head-mounted display, a foreign arm (an experimenter’s, then a rubber one) was seen aligned with the participant’s own arm while both were tapped. Synchronous tapping, against asynchronous, raised ratings that the felt touch was produced by the seen finger on the seen arm, and the rating held through pauses of up to a minute (n = 13). After onset, synchrony also raised ratings that a finger hovering 5 cm off the rubber arm caused the touch and that touch was felt on a cardboard box (n = 11 and 10); without prior onset the box gave no synchrony difference (n = 9). The real hand was 0.13 °C cooler under synchrony in one comparison only. The authors read the results as the visual body image being “explained away” by ongoing multisensory inference, and as support for one-deficit theories of delusion. | Active — read in full 2026-10-20 (NOTE-998); worth reading as a philosopher’s small rubber hand experiment that pushes the illusion past where it should break, and as the study Apps & Tsakiris cite for cooling of the real hand. Through a head-mounted display the foreign arm was seen exactly where the participant’s own arm lay. Synchronous tapping made people rate the touch as produced on the seen arm (13 people), and after onset they went on to rate touch as caused by a finger hovering 5 cm off a rubber arm, or felt on a cardboard box (10 and 11 people); some described the hovering finger as magnetism, ESP or black magic. Nine people shown the box without prior onset gave no synchrony difference. The real hand was 0.13 °C cooler under synchrony in one of four comparisons, by what reads as a one-tailed test. Read it as four small samples, single leading questions with no ownership item, no expectation measure, and a temperature result too weak to carry the claim that the real hand loses ownership. |
| LIT-1273 | Moving a Rubber Hand that Feels Like Your Own: A Dissociation of Ownership and Agency | Kalckert & Ehrsson (2012), Frontiers in Human Neuroscience 6:40. A moving rubber hand illusion: the participant taps a hidden index finger linked by a rod to the finger of a wooden model hand in view. Synchronous movement gave ownership (mean 1.63 on −3 to +3) and agency (2.44), and a 1.73 cm drift toward the model, where a ~500 ms asynchrony gave neither (n = 20 and 20). In a 2 × 2 design (n = 32 each), passive movement abolished agency (−0.61) but left ownership (1.57) and drift, and a model hand rotated 180° abolished ownership (−0.62) and drift but left agency (2.2): a double dissociation on questionnaires. Agency was higher, and correlated with ownership (r = 0.50), only when the hand was owned. | Active — read 2026-10-20 (NOTE-993) in full; worth reading as the first experiment to set the sense of ownership and the sense of agency against each other in one rubber hand paradigm. A wooden model hand whose index finger is linked by a rod to the participant’s hidden finger is owned when it moves in time with the real finger, whether the movement is the participant’s own or imposed by the experimenter, and is controlled when the participant moves, whether or not it is owned: passive movement removed agency and left ownership, and rotating the model hand 180° removed ownership and left agency. Read it as 104 participants over four between-group experiments, with named non-parametric tests, means and SDs but no standardised effect sizes, a dissociation shown on questionnaires alone (drift measures ownership only), and no control for what participants expected the conditions to do. It also finds the two not independent: agency was rated higher, and correlated with ownership, only when the hand was owned. |
| LIT-1274 v2 | Full-body illusions and minimal phenomenal selfhood | Blanke & Metzinger (2009), Trends in Cognitive Sciences 13(1):7–13. An opinion piece proposing that research on bodily self-consciousness isolate minimal phenomenal selfhood (MPS), “the conscious experience of being a self”, defined by three dimensions: global self-identification with the body, spatiotemporal self-location, and a weak (geometrical) first-person perspective, claimed jointly necessary and sufficient. The rubber-hand illusion and somatoparaphrenia alter only partial ownership and so do not touch MPS; out-of-body experience, heautoscopy and the full-body illusions of Lenggenhager et al. and Ehrsson (2007) do. Agency is causally enabling for MPS but not constitutive of it. | Active — read 2026-10-19 (NOTE-1002) in full; worth reading as the short programmatic paper that names minimal phenomenal selfhood (MPS), the simplest form of the experience of being a self, and splits it into three dimensions: self-identification with the body as a whole, self-location, and a weak, purely geometrical first-person perspective. Its distinctive move is to set partial ownership (the rubber-hand illusion, somatoparaphrenia) apart from global ownership, and to say only the second reaches MPS, so that full-body illusions and neurological out-of-body phenomena, not the rubber hand, are the entry point. Its most quotable thesis is that bodily agency “is a causally enabling, but not a constitutive condition, for phenomenal selfhood”. An opinion piece: no new data, the evidence cited, and the necessity and sufficiency claims asserted. |
| LIT-1275 | What is embodiment? A psychometric approach | Longo, Schüür, Kammers, Tsakiris & Haggard (2008), Cognition 107:978–998. 131 participants rated 27 statements after synchronous and asynchronous brushing of a rubber hand. Principal components analysis gave four components in both conditions (embodiment of the rubber hand, loss of own hand, movement, affect) and a fifth, deafference, after asynchrony only. A second analysis split embodiment into ownership, location and agency. Ownership and location were positive after synchronous brushing and negative after asynchronous; agency was negative after both. Drift toward the rubber hand was 1.34 cm after synchrony and a non-significant 0.30 cm after asynchrony, and ownership and location each predicted it. | Active — read 2026-10-20 (NOTE-1004) in full, from the published article on the first author’s lab site; worth reading as the first large-sample measurement of what the rubber hand illusion feels like, and as the study that split “embodiment” of a rubber hand into ownership, location and agency. 131 people rated 27 statements after 60 s of synchronous and of asynchronous brushing. A principal components analysis found four components in both conditions (embodiment of the rubber hand, loss of own hand, movement, affect) and a fifth, deafference, only after asynchronous brushing. Ownership and location rose above neutral only after synchrony, agency stayed below it, and ownership and location each predicted proprioceptive drift. Read it knowing that the three subcomponents come from a second varimax rotation of ten items dominated by one component, that there is no control for expectation or suggestion, and that every item is about a hand, none about the whole body. |
| LIT-1276 | Demand Characteristics Confound the Rubber Hand Illusion | Lush (2020), Collabra: Psychology 6(1):22. A pre-registered quasi-experiment on the controls of the rubber hand illusion. Twenty undergraduates (after 12 pre-registered exclusions) who had never taken part in it were shown a text and a video of the procedure and rated how far they expected to feel each of Botvinick & Cohen’s three illusion and six control statements, under synchronous and asynchronous brushing. Expectancy was higher for illusion than control statements under synchrony (M 1.7 against 0.0, t(19) = 6.24, d = 1.40) and for synchronous than asynchronous illusion statements (1.7 against 0.4, t(19) = 4.68, d = 1.05), and nine who had never heard of the illusion showed the same. The controls therefore do not match expectations, and the author concludes the illusion “may be, partially or entirely, a suggestion effect”; he proposes controls matched on expectancy and on suggestion difficulty. | Active — read in full 2026-10-20 (NOTE-1005) from the author’s final manuscript on PsyArXiv; worth reading as the direct test of the assumption behind every standard check on the rubber hand illusion, that expectations are matched between the “illusion” and “control” statements and between synchronous and asynchronous brushing. Twenty people who never underwent the illusion read a description of it, watched a 62-second video and rated, for each of Botvinick & Cohen’s nine statements, how far they expected to feel it. They expected the illusion statements more than the control statements under synchrony (1.7 against 0.0, d = 1.40) and the illusion statements more under synchrony than asynchrony (1.7 against 0.4, d = 1.05): the pattern published reports show. Read it as showing that the usual controls cannot rule out suggestion, not as showing that the illusion is suggestion; the author says so. Small, pre-registered, sequential Bayesian stopping, one online sample of undergraduates, and no illusion or drift measured. |
| LIT-1277 v4 | Rubber hands ‘feel’ touch that eyes see | Botvinick & Cohen (1998), Nature 391:756. Ten subjects watched a rubber left hand being brushed in synchrony with their own hidden left hand. After ten minutes they affirmed feeling the touch where they saw the rubber hand touched, that the touch was caused by the brush on the rubber hand, and that the rubber hand was theirs. After a 30-minute exposure, blind reaches toward the real hand were displaced toward the rubber hand in proportion to how long the illusion was reported, and an asynchronously brushed control group reported the illusion for 7% of the time against 42% and showed no drift toward it. The authors conclude that intermodal matching “can be sufficient for self-attribution”. | Active — read 2026-10-19 (NOTE-1006) in full; worth reading as the one-page report that founded the rubber hand illusion paradigm: synchronous brushing of a seen rubber hand and the hidden real hand makes touch be felt where the rubber hand is touched and the rubber hand be felt as one’s own, and after 30 minutes the felt position of the real hand drifts toward the rubber hand in proportion to how long the illusion lasted, while asynchronous brushing abolishes both. Read it as a brief communication: ten subjects, no stated control-group size, statistics given only as P-values, and a connectionist model and a premotor-cell analogy mentioned but not shown. Its closing claim, that intermodal matching “can be sufficient for self-attribution”, is the sentence the later literature on body ownership builds on. |
| LIT-1278 | Putting pain in its proper place | Reuter, Sienhold & Sytsma (2018/2019), Analysis 79(1):72–82. Block’s argument “the pain is in my fingertip; the fingertip is in my mouth; therefore the pain is in my mouth” seems to fail. Tye says “pain” creates an intensional context; Noordhof says the first “in” is not spatial. The authors say the conclusion carries a misleading implicature that something is wrong with the mouth. Online participants rejected the conclusion for pain (mean 2.43 of 7), tissue damage (2.53) and inflammation (2.86) and accepted it for a paper-clip (6.10); across fourteen items, acceptance tracked rated misleadingness (R² 0.897 over item means); and “technically speaking” wording raised agreement for every item (η² .17). The authors conclude that the data favour a bodily conception of pain. | Active — read in full 2026-10-20 (NOTE-1007) from the authors’ accepted manuscript; worth reading as a short, clean piece of experimental philosophy on how ordinary people read “the pain is in my fingertip”. In three online studies (174, 70 + 560 and 244 participants) people rejected “the pain is in my mouth” after “the pain is in my fingertip; the fingertip is in my mouth” about as much as they rejected the same inference for tissue damage and inflammation, and accepted it for a paper-clip; acceptance across fourteen items tracked how misleading the conclusion was rated, and a “technically speaking” rewording raised it. The authors read this as a pragmatic implicature, not an intensional context (Tye) or a non-spatial “in” (Noordhof), and close that “pain is a state of the body, not of the mind”. Read the closing claim as a conditional the data support only in part: they show that “pain” patterns with bodily terms in one inference, not what pain is, and the rewording lifted pain only to the midpoint. It is folk-concept evidence and does not bear on the record’s rubber hand THEORYs. |
| LIT-1279 v2 | Video Ergo Sum: Manipulating Bodily Self-Consciousness | Lenggenhager, Tadi, Metzinger & Blanke (2007), Science 317:1096–1099. A whole-body rubber hand illusion in video virtual reality. Participants saw their own back, filmed from 2 m behind, as a body standing in front of them, stroked in or out of time with strokes on their real back. Under synchronous stroking they rated the seen body as theirs and, after blindfolded displacement, returned to a point shifted toward it (24.1 cm in study I, n = 14). In study II (n = 14) a mannequin gave the same, and a non-bodily object a weaker, non-significant drift with no self-identification. Nobody reported disembodiment or a shifted viewpoint. The authors conclude that self-location and the global ownership they tie to selfhood rest partly on the same visuo-tactile integration as body-part ownership, constrained by knowledge of what a body looks like. | Active — read in full 2026-10-19 (NOTE-999), with its supporting online material and the 2008 e-letter exchange; worth reading as the first full-body version of the rubber hand illusion and the experiment the self-model theory cites for global body ownership. Two groups of 14 people saw, through a head-mounted display, a video of a body 2 m in front of them being stroked on the back. When the stroking was synchronous with strokes on their own back, they rated the seen body as theirs and, displaced blindfolded, walked back to a spot about 17 to 25 cm toward it. A mannequin worked; a rectangular object weakened the drift and was not felt as one’s body. Nobody reported leaving the body or seeing from elsewhere, so the authors call it heautoscopy-like, not an out-of-body experience. Read it as two small samples with modest, partly inconsistent effects, and with a rival reading (self-recognition in a video system) that its critics raised and its design does not exclude. |
| LIT-1280 | Serious Problems With Interpreting Rubber Hand “Illusion” Experiments | Roseboom & Lush (2022), Collabra: Psychology 8(1):32274. A resampling study of the synchronous-condition reports of 351 participants from Lush et al. 2020, run as 10,000 simulated experiments of 20 participants each. Unselected samples found mean agreement with the three standard statements significantly above zero in 83% of experiments; samples from above the median of hypnotisability (subjective SWASH) in 99%; from below it in 51%. For the ownership statement alone the lower half gave significant agreement in about 4% of experiments, and the upper half in 74% (supplement). The authors argue that the relationship is not too small to matter, that the synchronous–asynchronous difference cannot be interpreted because of Lush (2020), and that implicit, neuroimaging and animal measures are tied to ownership only through these reports. | Active — read in full 2026-10-20 (NOTE-1001) from the accepted manuscript on PsyArXiv, with the authors’ analysis notebooks for 10, 20 and 50 participants; worth reading as the clearest demonstration of what a modest correlation between hypnotisability and rubber hand report does to a field of small studies. Resampling the 351 synchronous-condition reports of Lush et al. 2020 in simulated experiments of 20, samples drawn from the upper half of the hypnotisability scale found significant agreement with the three illusion statements 99% of the time and samples from the lower half 51%; for the one ownership statement, “I felt as if the rubber hand were my hand”, the figures were 74% and 4%. Read it as a reanalysis of one dataset, with no new data and no asynchronous or drift analysis. Its headline numbers depend on n = 20: at n = 50 the lower half finds the averaged illusion statements in 95% of experiments, though the ownership statement still only in 6%. The authors themselves leave open that the same people may have the illusion for other reasons. |
| LIT-1281 | The Rubber Hand Illusion: Feeling of Ownership and Proprioceptive Drift Do Not Go Hand in Hand | Rohde, Di Luca & Ernst (2011), PLoS ONE 6:e21659. Robot arms stroked a rubber hand and the hidden real hand, and felt finger position was probed by a projected dot. Drift toward the rubber hand built up to about 5–6 cm under synchronous stroking, and to the same level when the hand was only seen, unstroked, or when asynchronous stroking was interrupted every 10 s for measurement. Only 120 s of continuous asynchronous stroking held drift near zero (about 1 cm), which reproduces the classic synchronous–asynchronous difference. The questionnaire showed ownership only after synchronous stroking. The authors conclude that drift and ownership come from different integration processes, that asynchrony suppresses drift rather than synchrony causing it, and that drift is not a valid proxy for ownership. Groups were of ten. | Active — read 2026-10-20 (NOTE-1009) in full; worth reading as the study that broke the assumed tie between proprioceptive drift and the feeling of owning the rubber hand. With robot-delivered stroking and a visual probe of felt finger position, drift toward the rubber hand appeared under synchronous stroking, under no stroking at all (only seeing the hand), and under asynchronous stroking interrupted every 10 s, at levels not significantly different from synchronous stroking (about 5–6 cm); only continuous asynchronous stroking kept it near zero. Ownership, by questionnaire, needed synchrony. The authors conclude that drift comes from visuo-proprioceptive integration that asynchrony suppresses, and that “conclusions about feelings of ownership cannot be drawn from measuring proprioceptive drift alone”. Read it as groups of 10, a visual-judgement measure rather than reaching, and an Experiment 2 whose ownership evidence is anecdotal debriefing, not a questionnaire. |
| 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-1284 | Consciousness and the Collapse of the Wave Function | Chalmers and McQueen (2021, in Gao ed., Consciousness and Quantum Mechanics, OUP 2022), arXiv:2105.02314. Develops the thesis that consciousness collapses the wave function by taking consciousness to be super-resistant to superposition, measuring it with integrated information theory, and giving it a continuous-collapse dynamics. Simple versions are falsified by the quantum Zeno effect; more complex ones are in principle testable with quantum computers. On a property-dualist reading a consciousness-to-physics law gives consciousness a causal role, and the authors argue that collapse is the causal-closure gap that philosophers’ closure arguments assume is absent. | Active — read in part 2026-10-20 (NOTE-1012); worth reading as the most developed consciousness-collapse proposal and as the source that frames quantum collapse as the gap in causal closure that a property-dualist consciousness could fill: consciousness (phenomenal Q-shape in integrated information theory) is super-resistant to superposition and drives a continuous-collapse dynamics, simple versions are falsified by the quantum Zeno effect, and more complex versions are in principle testable with quantum computers. |
| LIT-1288 | The Line: AI and the Future of Personhood | Boyle (2024). Legal and moral personhood are different lines, and personhood is pressed on two tracks: empathy-driven moral recognition, and legal personality granted for convenience, as with corporations. Run across AI, corporations, nonhuman animals and chimeras, the book argues that ChatGPT broke the link between fluent language and mind, that corporate rights grew without reasoned decision, and that capacity-based criteria cannot escape a species-bound standpoint. Boyle predicts an intermediate legal status for AI. | Active — read 2026-10-20 (NOTE-1014) in full; worth reading as the clearest statement of the two routes to personhood, empathy-driven moral recognition and efficiency-driven legal personality, with the corporation as the working example of the second; for the legal history of how US corporations took Fourteenth Amendment rights without reasoned decision; for the analysis of the Tommy habeas suits; and for the five meanings of “too close to human” in chimera debates. Read it knowing that it is an essay that declines to give a theory, that its AI timing rests on others’ forecasts, that its case against Searle is a burden-of-proof presumption, and that its own view (species membership as of right plus capacity) is argued in a few pages. |
| LIT-1289 v2 | The L³-based strong Onsager theorem | Giri, Kwon & Novack (2023; Annals of Mathematics 2026). For every β < 1/3 there is a weak solution of the 3D incompressible Euler equations on T³ in C⁰([0, T]; B^β_{3,∞} ∩ L^{1/(1−3β)}) that satisfies the local energy inequality ∂_t(½|u|²) + div((½|u|² + p)u) = −D[u] ≤ 0 and strictly dissipates its total kinetic energy: the L³-based strong Onsager conjecture, previously known only for β < 1/7 (in Hölder spaces, De Lellis and Kwon). In the proof D[u] is exactly a prescribed smooth density, −e(t)e′(t)ρ₀(x₁, x₂)² with e(t) a decaying exponential and ρ₀ a pipe flow along e₃, so dissipation is strictly positive inside a periodic array of pipes and zero outside. The construction is an intermittent, L³-measured convex integration in which successive velocity increments overlap in frequency (“partial wavelet sums”), kept apart in space by multi-scale “Mikado bundles”, with an intermittent pressure that dominates every error pointwise. Section 3’s proofs are in a companion paper (Annals of PDE 10:19, 2024). | Active — read 2026-10-20 (NOTE-1022), skimmed, from arXiv:2305.18509v3: the introduction and its heuristics, the whole of Section 2 with the inductive Proposition 2.11 and the proof of Theorem 1.1 from it, the derivation of the new current errors (§5.1) and the closing of the relaxed local energy identity (§6.3, Lemma 6.10) were read; the estimates of Sections 3–6, the dodging lemmas of Section 4, the parameter choices of Section 7 and the appendix were paged through and not checked, and Section 3’s proofs are in a companion paper (Annals of PDE 2024) that the record does not hold. Worth reading for the local, L³-based version of the negative half of Onsager’s conjecture: for every β < 1/3 there is a weak solution of the 3D incompressible Euler equations on the periodic box in C⁰_t(B^β_{3,∞} ∩ L^{1/(1−3β)}) that satisfies the local energy inequality and whose total energy strictly decreases; and, from the proof rather than the theorem’s statement, for the fact that its Duchon–Robert dissipation is exactly the smooth, nonnegative density E(t, x) = −e(t)e′(t)ρ₀(x₁, x₂)² fixed at the iteration’s first step, positive in a periodic array of straight pipes and zero outside them (THEORY-772). So the coarse-grained energy flux into vanishing scales converges, as a distribution in space and time, to a one-signed density: one-way at every place and time in the limit, which Buckmaster, De Lellis, Székelyhidi and Vicol (LIT-1300) showed only for the whole box. Read it knowing that the solutions are not Hölder or even bounded (the strong Hölder version is open; the best Hölder result with the local inequality is β < 1/7, De Lellis and Kwon); that where and how fast energy is dissipated is an input of the construction, carried unchanged through every step, not something the dynamics selects; that the one-signed statement is about the limit ℓ → 0 tested against nonnegative functions, and nothing is said about the sign of the flux at any finite scale; that nothing ties these solutions to vanishing-viscosity limits, though the paper notes that the local inequality is what such limits would satisfy; and that the arXiv v3 copy read is the authors’ final version, not compared with the Annals text. |
| LIT-1291 | The Immanent Rationality of Copyright Law | Balganesh (2017), reviewing Drassinower’s What’s Wrong with Copying? (2015). Drassinower holds that copyright protects the integrity of a work as a communicative act, that infringement wrongs the author as compelled speech, and that independent creation, the idea/expression line and the public domain follow from the equal standing of authors as speakers. The review praises the coherence and defends rationalist theory against the charge that it is faith-based, then objects that the book gives no criterion for what is fundamental, blends explanation with justification without defending autonomy, ignores the private-law structure of liability, and assumes a static and pervasive rationality. | Active — read 2026-10-20 (NOTE-1017) in full; worth reading as a compact and accurate account of Drassinower’s What’s Wrong with Copying? (the work as a communicative act, infringement as compelled speech, independent creation as the anchor, the public domain as constitutive) and as the standard methodological critique of it: no criterion for what is fundamental, explanation and justification run together, the private-law structure of liability left unexplained, and a rationality assumed static and pervasive. Read it knowing that it is a review, so Drassinower’s thesis comes at second hand with page references to the book, that its defence of rationalist theory is aimed at Lemley’s “faith-based” critique as much as at the book, and that one objection (the private-law structure) leans on the reviewer’s own theory. |
| 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-1293 | Copyright and Artificial Intelligence, Part 3: Generative AI Training (Pre-Publication Version) | U.S. Copyright Office (2025), pre-publication version. Collecting, curating and training on copyrighted works implicate the reproduction right; model weights do so only where they have memorized substantially similar expression. Whether the copying is excused is a fair-use question, use by use. Training a foundation model will often be transformative, but less so the more its outputs serve the originals’ purpose; the non-expressive and human-learning arguments are rejected; market dilution is cognizable harm. The Office recommends letting licensing markets develop, with extended collective licensing if they fail. | Active — read 2026-10-20 (NOTE-1024) in full, in the pre-publication version of 9 May 2025, the only version copyright.gov offers on that date; worth reading as the official US statement of where training touches copyright (collection, curation, training copies, and model weights only where they have memorized a work), as an application of the Warhol v. Goldsmith use-specific test of transformative purpose to generative training (a spectrum, from research and closed non-substitutive deployments to fine-tuning that reproduces a series’s characters), and for its new market-dilution theory of harm under the fourth factor. Read it knowing that it is an agency’s analysis, not a holding; that it predates the 2025 district-court rulings on training; that its account of the facts rests mostly on the parties’ own comments; that the dilution theory is offered as “uncharted territory” with no data; and that a final version was promised but had not appeared by 2026-10-20. |
| 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-1296 v2 | Slow Feature Analysis as Variational Inference Objective | Schüler & Wiskott (arXiv 2025). With a Gaussian random-walk prior on the latents, an instantaneous unit-variance Gaussian encoder N(g(x_t), I) and an arbitrary forward model, the evidence lower bound is a sum of per-point reconstruction terms minus ½Σ‖g(x_{t−1}) − g(x_t)‖², the unordered slowness loss. The reconstruction term then does the work of SFA’s unit-variance and decorrelation constraints, by argument, not proof. The authors say this “does not lead to full equivalence” with SFA. For linear Gaussian encoder and decoder they give the objective and the necessary condition VᵀV = WᵀĊW, and no optimum. | Active — read 2026-10-20 (NOTE-1015) in full, from arXiv v1; worth reading for an exact identity, not a limit: with a Markov prior p(z_t | z_{t−1}) = N(z_{t−1}, I) (a Gaussian random walk, no decay), an instantaneous encoder q(z_t | x_t) = N(g(x_t), I) and any forward model p_θ(x_t | z_t), the KL half of the ELBO is the unordered slowness loss ½Σ‖g(x_{t−1}) − g(x_t)‖² (plus a constant the paper drops), so the ELBO is a per-point reconstruction term minus a slowness term (Eq. 40), and the reconstruction term takes the place of SFA’s unit-variance and decorrelation constraints; and for the linear Gaussian case (Eq. 41) and its necessary condition VᵀV = WᵀĊW (Eq. 42). Read it knowing that the paper does not claim, and does not have, equivalence to SFA: it derives no optimum, so what its objective learns is the record’s derivation in THEORY-775 (on whitened input, the span of the slowest SFA directions whose lag-one autocorrelation exceeds ½, rotation unidentified; on raw input, not SFA’s subspace and not scale-invariant); that the constant d/2 per step is cancelled by an error in Eq. 35; that Eq. 41 has the sign of the reconstruction error reversed (the appendix’s Eq. 54 is right); that Eq. 42 is necessary, not “equivalent” to stationarity as §7 says; that the prior builds in independent, non-decaying latents, so closure of the latent coordinates is assumed, not found; and that its account of Turner and Sahani (2007) is two sentences of related work, which the record has not checked against that paper (LIT-1287, Unavailable). |
| LIT-1297 | The End of Ownership: Personal Property in the Digital Economy | Perzanowski and Schultz (2016). Digital media and software-laden devices are sold under licences that deny a sale and DRM that enforces the licence, while the law of exhaustion, built around owning a tangible copy, cannot follow purchases that are copied at every use or never copied at all. Buyers lose resale, lending, repair and privacy, and a survey shows “Buy Now” misleads them. The book proposes treating one-time purchases as sales, judging licences as permissions rather than contracts, exempting owners from anti-circumvention law, and a multifactor test for digital exhaustion. | Active — read 2026-10-20 (NOTE-1026) in full except the last page of the Conclusion, which the copy lacks; worth reading as the standard account of how licences, DRM and the copy-centred law of exhaustion turn digital purchases into conditional access, with the case law from Bobbs-Merrill to Lexmark v. Impression Products, a survey showing that “Buy Now” misleads buyers, and a proposed multifactor test for digital exhaustion. Its diagnosis is the consumer side of Lessig’s copy trigger: exhaustion is tied to owning a copy, and digital use and transfer make new copies. Read it knowing that it is US law as of early 2016, that it is advocacy by two authors who were parties or counsel in several of its episodes, that the survey is their own and of a mock store, and that several of its pending cases have since been decided. |
| LIT-1298 | Remix: Making Art and Commerce Thrive in the Hybrid Economy | Lessig (2008). Digital technology revives a read/write culture in which amateurs remake what they consume. Remix is quotation whose meaning comes from the reference, so it needs the original. Because every digital use makes a copy and copyright regulates copies, the law now reaches every ordinary use and makes RW culture presumptively illegal. The commercial and sharing economies, kept distinct, combine in hybrids. Proposed reforms: free amateur remix, registration after a term, no regulation of the copy as such, and a levy or licence for file sharing. | Active — read 2026-10-20 (NOTE-1023) in full; worth reading as the standard statement of the read/write (RW) against read-only (RO) distinction, of remix as quotation whose meaning depends on using the original, of the copy-trigger argument (digital use always makes a copy, so copyright now reaches every ordinary use), and of the commercial, sharing and hybrid economies. Read it knowing that the economic core (remix does not compete with what it remixes, money crowds out sharing) is asserted rather than shown, that the hybrids are founders’ own accounts of successes, and that the legal reforms are sketches without rates or a line between amateur and professional. |
| 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-1300 v2 | Onsager’s conjecture for admissible weak solutions | Buckmaster, De Lellis, Székelyhidi & Vicol (2017; CPAM 2019). For every β < 1/3 and every smooth strictly positive e : [0, T] → R there is a weak solution of the 3D incompressible Euler equations on T³ × [0, T], in C^β in space and time, with ∫|v(x, t)|² dx = e(t) for every t. With e strictly decreasing these are dissipative (admissible in the sense of a non-increasing total energy), which Isett’s solutions were not. An h-principle (Theorem 1.3) adds that any smooth strict subsolution is a weak-* limit of such solutions. The proof modifies Isett’s: a gluing step whose Reynolds stress stays trace-free, then Mikado-flow perturbations placed in disjoint “squiggling” space-time regions that cover every time, so energy can be pumped in even where the stress vanishes. | Active — read 2026-10-20 (NOTE-1013) in full, from arXiv:1701.08678v1: worth reading for the admissible half of Onsager’s negative direction: for every β < 1/3 and every smooth, strictly positive energy profile e(t) on [0, T] there is a weak solution of the 3D incompressible Euler equations on the periodic box, Hölder-continuous with exponent β in space and time, whose energy ∫|v|² equals e(t) at every time; taking e strictly decreasing gives solutions whose kinetic energy strictly decreases, so the energy flux into vanishing scales is one-signed on every time interval (THEORY-776); and for a shorter, more self-contained proof of the 1/3 threshold than Isett’s (LIT-1255), with a trace-free glued stress and perturbations added everywhere in time so as to steer the energy. Read it knowing that “admissible” here means only that the total energy does not increase (the word appears in the title alone), not the local energy inequality, so the transfer is one-way for the whole box and may run backwards in places; that the same theorem gives solutions with increasing energy just as readily, so the direction is chosen by the prescribed profile and is not forced by the equations; that nothing is shown about vanishing-viscosity limits, about uniqueness or non-uniqueness for given initial data, or about the endpoint 1/3; that the h-principle (Theorem 1.3) rests on a result of Daneri and Székelyhidi stated without proof; and that the abstract’s “typical” is looser than the weak-* density that Theorem 1.3 proves. |
| LIT-1301 | The Public Domain: Enclosing the Commons of the Mind | Boyle (2008). Intellectual property is a limited monopoly granted to solve a public-goods problem, and its limits matter as much as its rights. A “second enclosure movement” is extending rights over facts, genes, business methods, digital fences and the fragments of music, without evidence that more rights bring more innovation. Cheaper copying makes the limits more important, not less. The book argues for an environmentalism of the public domain. | Active — read 2026-10-20 (NOTE-1021) in full; worth reading as the standard statement of the “second enclosure movement” argument: that intellectual property is a state-made monopoly to be kept as short and narrow as its purpose allows (the “Jefferson Warning”), that the public domain and the limits on rights do as much work as the rights, that cheaper copying makes those limits more important rather than less (the “Sony Axiom”), and that policy runs on faith rather than evidence. Its music chapter traces one melody from a 1951 gospel record through Ray Charles and Kanye West to a 2005 political mashup. Read it knowing that most of it is argument from cases chosen to make the point; the one sustained empirical test is the database right (ch. 9). It treats the commons of the mind as nonrival and open to all, so it does not engage Ostrom’s work on bounded common-pool resources beyond two notes. |
| LIT-1302 | Andy Warhol Foundation for the Visual Arts, Inc. v. Goldsmith | Supreme Court of the United States (2023), No. 21-869, 598 U.S. 508, opinion of the Court by Sotomayor, 7–2. The first fair-use factor weighs against the Warhol Foundation’s 2016 licence of Orange Prince to a Prince tribute magazine: the licence and Goldsmith’s photograph share substantially the same purpose, illustrating magazine stories about Prince, and the use is commercial. New meaning or message is relevant only to whether the purpose differs and is not enough by itself. Gorsuch concurs; Kagan, dissenting, would count Warhol’s added expression and meaning heavily. | Active — read 2026-10-20 (NOTE-1019) in full; worth reading as the Supreme Court’s statement that “transformative” use under the first fair-use factor is a question of the purpose of a particular use, a matter of degree, and not settled by new expression, meaning or message; that the degree of transformation must exceed what the derivative-work right already covers; that copying is justified most clearly when the copied work is the target (parody against satire); and that licensing markets for derivatives belong to the owner. Kagan’s dissent is the best short case for meaning and aesthetics as the measure. Read it knowing that it decides one factor only, for one use (the 2016 licence of Orange Prince to Condé Nast), and says nothing about the making, display or sale of the Prince Series, nor whether they infringe. |
| LIT-1303 | Worth a Thousand Words: The Images of Copyright | Tushnet (2012). Copyright takes the written word as its model. Courts treat images either as transparent, so that their meaning is obvious and they merely copy reality, or as opaque, so that they cannot be analysed in words. The oscillation produces incoherent doctrine on copyrightability, substantial similarity, joint authorship of comics and fair use. Verbal overshadowing means that describing an image changes how it is seen, so the substantial-similarity test should be abandoned for a reproduction right against exact or near-exact copies. | Active — read 2026-10-20 (NOTE-1016) in full; worth reading as the standard statement that copyright law takes the written word as its model and so oscillates between treating images as transparent (their meaning obvious, a copy of reality) and as opaque (beyond analysis in words), of verbal overshadowing as a reason the substantial-similarity test cannot work, and of the proposal to replace that test with a reproduction right against exact or near-exact copies, leaving the rest to the derivative-works right. Read it knowing that it is US law as of 2011, that the cognitive findings are cited from the psychology literature rather than tested on legal factfinders, that the author flags the verbal-overshadowing effect as possibly smaller than first reported, and that the reform is stated without its implementation (n. 258). |
| 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-1305 v2 | Nonuniqueness and existence of continuous, globally dissipative Euler flows | Isett (2017; Archive for Rational Mechanics and Analysis 2022). For every α < 1/15 there are weak solutions of the incompressible Euler equations on T³ (and T^d, d ≥ 3) in C^α_{t,x} that satisfy the local energy inequality ∂_t(|v|²/2) + ∇·((|v|²/2 + p)v) ≤ 0, strictly on an open time interval: the first continuous examples, and a first partial result on the strong Onsager conjecture. From one initial datum there is a Cantor family of them, with no isolated points, positive Hausdorff dimension in C_tL²_x and one common dissipation measure; the same holds for solutions with the local energy equality, and wild data are C⁰ dense. The scheme is a convex integration of “dissipative Euler–Reynolds flows” with one-directional transported plane waves, whose triad interactions cancel the unresolved energy flux current. In the proof the dissipation measure is a function of time alone, switched on only while the construction drains the solution to zero. | Active — read 2026-10-20 (NOTE-1027), skimmed, from arXiv:1710.11186v4: the introduction, Sections 2 and 3 (the dissipative Euler–Reynolds flow and the Main Lemma), Sections 4.1–4.5 (the shape of the construction, the coefficient equations and the energy increment), the opening of 4.10, Section 4.14, Section 5 and Section 6 in full were read; Sections 4.6–4.13, the estimates, were paged through and not checked. Worth reading for the first continuous, indeed C^α_{t,x} with α < 1/15, weak solutions of the 3D incompressible Euler equations that satisfy the local energy inequality with nonzero dissipation (Theorems 1 and 4); for nonuniqueness of such solutions from one initial datum, as a Cantor family with a common dissipation measure and positive Hausdorff dimension in C_tL²_x, and of energy-conserving ones (Theorems 4, 5 and 7); for C⁰ density of wild initial data (Theorem 8); for the notion of a dissipative Euler–Reynolds flow, whose relaxed local energy inequality carries an unresolved flux density and current; and, from the proof rather than any statement, for the fact that the dissipation measure is a function of time alone, equal at each time to the rate of loss of total energy and so spread uniformly over the torus (THEORY-821). Read it knowing that “globally dissipative” means the local energy inequality (not whole-box dissipation, and not strict); that the exponent 1/15 is far below 1/3 (De Lellis and Kwon later reached 1/7 in Hölder spaces, Giri, Kwon and Novack 1/3 in L³-based ones); that the dissipation happens only in a short final interval in which the construction drains the solution to zero, its timing an input; that the shared initial datum is produced by the construction, not prescribed; that the “probabilistic method” is a binary choice per stage, not a random construction; and that the Burgers example of §1.2.1 misstates two constants (−d/dt∫u₀² is 1/3, not 2/3, and the threshold (1/6)^{1/3} is sufficient but not sharp, which is (1/4)^{1/3}), without affecting its point. |
| 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-1309 v2 | A Theory of Usable Information Under Computational Constraints | Xu, Zhao, Song, Stewart & Ermon (2020). Predictive V-information, H_V(Y) − H_V(Y | X) with the conditional entropies taken as the least expected log loss over a predictive family V, is the information about Y that a predictor restricted to V can use. It recovers Shannon mutual information when V is unrestricted and the coefficient of determination for linear-Gaussian V, is non-negative and zero under independence, can be asymmetric, can be raised by computing on X, and can be estimated with PAC guarantees from the Rademacher complexity of V. | Active — read 2026-10-21 (NOTE-1048) in full, from arXiv:2002.10689v1, the ICLR 2020 camera-ready; worth reading as the usable-information literature the record lacked: it defines predictive V-information, the information a predictor restricted to a family V can extract, shows that computation can create it (so the data-processing inequality fails for it), and bounds its estimation error by the Rademacher complexity of V (THEORY-846, THEORY-840). Read it knowing that the failure of the data-processing inequality is shown by informal examples (decryption, feature learning), not by a theorem, that V-information is not bounded by Shannon information unless V’s input-free predictions include the true marginal (the record’s counterexample, THEORY-846), that Proposition 1.2’s “mean absolute deviation” is the deviation about the geometric median, and that the experiments are small. |
| LIT-1310 v3 | Approximate Causal Abstractions | Beckers, Eberhardt & Halpern (2020; arXiv 2019). Extends exact causal abstraction to approximate abstraction: the worst case, over allowed interventions and contexts, of how far a high-level causal model’s answers depart from the coarse-grained answers of the low-level model it abstracts, under a distance the user chooses; probabilistic versions average over contexts and, given an intervention distribution, over the low-level implementations of each high-level intervention. Composing an abstraction with an approximation gives an approximate abstraction, and the converse decomposition can fail. | Active — read 2026-10-21 (NOTE-1045) in full, from arXiv:1906.11583v2; worth reading for its distance between causal models that compares answers to interventions rather than graphs, for approximate abstraction as that distance under a coarse-graining (THEORY-843), for the intervention distribution over low-level implementations of a high-level intervention, and for when an approximate abstraction factors into an abstraction and an approximation. Read it knowing that the error is a worst case over interventions, minimized over context maps and relative to a metric the user chooses, so it is zero wherever exact abstraction holds, including coarse-grainings whose dropped detail high-level noise can carry. |
| LIT-1312 v2 | Learning from the Outsider Within: The Sociological Significance of Black Feminist Thought | Collins (1986). Black women intellectuals occupy an “outsider within” position in sociology, inside its institutions but marginal to them, and from it can see anomalies its insiders do not; three themes of Black feminist thought (self-definition and self-valuation, interlocking oppression, the importance of Black women’s culture) show what that standpoint contributes. | Active — read 2026-10-21 (NOTE-1042) in full, in the authorized Portuguese translation in Sociedade e Estado 31(1), 2016 (doi:10.1590/S0102-69922016000100006, open on Redalyc), published with Collins’s and Oxford University Press’s permission; the English original was not reached. Worth reading for the outsider-within argument, that a member trained into a discipline but rooted in experience its paradigms omit or distort sees anomalies insiders are not placed to see and outsiders lack the authority to press (THEORY-834), and for its early statement of a self-confirming status: a group assigned an inferior status, and that status used as proof of its inferiority. Read it knowing that it is an argued essay with no comparison of who detects what, and that every quotation in the record but the English abstract is the translator’s. |
| LIT-1313 v2 | Information Design: A Unified Perspective | Bergemann & Morris (2019). Given a game with uncertain payoffs, information design asks how far the provision of information alone can influence players’ behaviour; under a literal reading there is a designer who commits to an information structure, under a metaphorical one the analyst characterizes play across all information structures, and the two readings unify communication in games, Bayesian persuasion and robust prediction. What an omniscient designer can attain is exactly the set of Bayes correlated equilibria, given by linear obedience constraints. | Active — read 2026-10-21 (NOTE-1034) in full, from Cowles Foundation Discussion Paper 2075R3 (March 2018, the accepted manuscript); worth reading as the general frame for designing what others know: what an omniscient designer can bring about is exactly the Bayes correlated equilibria, a polytope given by linear obedience constraints (THEORY-844), read literally as a designer’s reach and metaphorically as a bound over all information structures, with prior information shrinking it and an incentive order that extends Blackwell’s (THEORY-853). Read it knowing that it is a survey whose central results are proved in the authors’ other papers, that its players are Bayesian with a common prior, and that its two-firm example with strategic substitutes states an optimal rule that is infeasible under the parameters it assumes (the copy read; the JEL text was not compared). |
| 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-1315 v2 | Media Capture Through Favor Exchange | Szeidl & Szucs (2021). Using Hungarian data, 1994–2016, documents large advertising favours from the government to connected media, shown by state-owned firms’ but not private firms’ advertising shifting at changes of connection status, and corruption-coverage favours back; a structural model separates owner ideology from favour exchange and finds both matter, and counterfactuals show targeted advertising can also shift owner ideology by making ownership profitable to connected investors. | Active — read 2026-10-21 (NOTE-1039) in full, from the open-access published article on the Econometric Society’s site, with the supplement’s regression tables and proofs; worth reading for the cleanest evidence the record holds of two-way favors between a government and connected media, with private advertisers as the control (THEORY-850), for a model whose slant gap splits into owner ideology plus favor exchange (THEORY-860, re-derived), and for the point that targeted advertising can change who owns the media. Read it knowing that the split between ideology and exchange (THEORY-852, Proposed) rests on identifying assumptions the authors call strong for print, and that only advertising and corruption coverage are measured. |
| LIT-1316 v2 | Abstracting Causal Models | Beckers & Halpern (2019; arXiv 2018). A sequence of successively stronger definitions of abstraction between causal models, from Rubenstein et al.’s exact transformation through uniform transformation and abstraction to strong abstraction, which takes all potential interventions seriously, and constructive abstraction, which maps clusters of micro-variables to macro-variables; the paper says that combining micro-variables into macro-variables, and each of Rubenstein et al.’s examples, is constructive. | Active — read 2026-10-21 (NOTE-1032) in full, from arXiv:1812.03789v4; worth reading for the examples that show exact transformation too permissive, for the characterization of exactness under every distribution as a context map commuting with every allowed intervention (THEORY-849), and for the ladder τ-abstraction, strong and constructive abstraction. Read it knowing that its Theorem 3.8 omits the countability its proof uses, that the context map is only required to exist, so high-level noise may hold what the coarse state drops, and that every strong abstraction being constructive is a conjecture. |
| LIT-1319 v2 | Government Advertising and Media Coverage of Corruption Scandals | Di Tella & Franceschelli (2011; NBER 2009, revised 2010). Across the four main Argentine newspapers, April 1998–December 2007, monthly government advertising correlates negatively with front-page coverage of the government’s corruption scandals, within newspaper and month and within newspaper-president pairs: one standard deviation of advertising goes with 0.31 fewer front pages a month, 25 percent of a standard deviation, in the 2010 working paper (0.23 and 18 percent in the published abstract). The association holds for advertising placed by the presidency’s agency and not for autonomous agencies, and not for scandals of non-political actors. | Active — read 2026-10-21 (NOTE-1040) in full, in the NBER working-paper version (revised July 2010); worth reading as a careful within-newspaper, within-presidency measure of how government advertising goes with front-page coverage of the government’s corruption, with placebos on advertising channel and scandal type (THEORY-851). Read it knowing that it shows an association, that the version read reports 0.31 of a front page per standard deviation where the published abstract reports 0.23, that the early advertising series is reconstructed, and that one presidency carries much of the variation. |
| LIT-1323 v2 | Media capture, captured: a new computational methodology to measure deteriorating media freedom | Barnehl & Schumacher (2024). Proposes measuring media capture at the level of the outlet and at monthly or weekly resolution, by scoring each nominally independent outlet between regime-owned outlets and opposition outlets the regime cannot coerce, on the prevalence of topics relevant to the regime’s legitimacy (a structural topic model) and on the tone of sentences mentioning the leader. Applied to Nicaragua, 2018–2022, it separates outlets that moved toward the regime from one that resisted, which annual expert surveys cannot. The score measures alignment; coercion is argued from context. | Active — read 2026-10-21 (NOTE-1047) in full, from the published version in the University of Amsterdam’s repository; worth reading for a way to measure media capture outlet by outlet and month by month, by placing each outlet between regime-owned outlets and uncoercible opposition outlets on agenda and tone, and for its definition of capture as coerced change in editorial choices. Read it knowing that the score measures alignment, not coercion, that the poles are assumed fixed, that it is validated on three Nicaraguan outlets only (THEORY-836), and that the main text reports no uncertainty for the scores. |
| LIT-1325 v2 | Preventing Policy Capture: Integrity in Public Decision Making | OECD (2017). A report in the OECD Public Governance Reviews defining policy capture as the process of consistently or repeatedly directing public decisions away from the public interest toward a specific interest group or person, by legal or illegal means and by that group’s intent and action; adopting three criteria (an explicit policy goal, a captor’s intent to extract rents, a shift from the goal); and setting out four strategies for preventing it (stakeholder engagement, transparency, independent oversight bodies, organisational integrity). | Active — read 2026-10-21 (NOTE-1043), chapters 1 and 2 in full and chapter 3 in part, from the OECD’s own PDF; worth reading for its definition of policy capture as consistent or repeated diversion of public decisions from the public interest toward a specific interest, by legal or illegal means, for its three criteria (an explicitly defined policy goal, a captor’s intent to extract rents, a shift of the process from the goal), and for its catalogue of vehicles, which includes supplying research and manipulated information, so that capture can proceed without the decision maker’s knowledge. Read it knowing that it is an institutional report, not research: its definition and criteria are adopted from others, its evidence is cited or is cross-country correlation of perception indicators, and its recommendations are not evaluated. No THEORY is filed from it. |
| LIT-1326 v2 | Algorithmic monoculture and social welfare | Kleinberg & Raghavan (2021). In a model of two firms hiring from one pool by noisy rankings, if both use the same algorithm, even one more accurate than their private rankings, the quality of decisions can fall without any shocks: under two conditions on the ranking model, for every private accuracy there is a more accurate shared algorithm that is strictly dominant for both firms and lowers both firms’ utility and social welfare, a Braess paradox. The Mallows model always meets the conditions; Plackett–Luce never does. | Active — read 2026-10-21 (NOTE-1033), from arXiv:2101.05853v2: the main text and Appendices A, B and E in full, Appendices C, D and F in statement; worth reading for the exact conditions under which a shared, more accurate screening algorithm is dominant for every firm and still lowers welfare without any shock (THEORY-835), and for the identity that makes independence valuable to a second mover. Read it knowing that the model has two firms hiring one candidate each, that the conditions hold for Mallows rankings always, for Gaussian and Laplacian random utility models with three candidates, and never for Plackett–Luce, and that the losses measured are small (about 4% in one instance). |
| LIT-1327 v2 | What Is Ideological Capture and How Do We Measure It? Using Antitrust Reform to Understand Expert–Public Cleavages | Short, Hill & Brown (2025). Ideological capture occurs when experts design regulatory frameworks that marginalize important public values and produce outcomes favourable to special interests even without lobbying; an original survey of the public and of antitrust lawyers finds the consumer-welfare standard marginalizes public concerns yet is deeply popular among the lawyers. | Active — read 2026-10-21 (NOTE-1051) in full, from the open-access (CC BY 4.0) published version on Cambridge Core, without its online appendix; worth reading for its definition of ideological capture, capture through the criteria a regulator adopts with no lobbying needed (THEORY-859), and for a pre-registered survey showing that the public weighs layoffs, quality and lobbying well above price cuts in merger review while antitrust lawyers support replacing the consumer welfare standard 42.6 points less than the public (THEORY-833). Read it knowing that the lawyer sample is a convenience sample of 103, that the verdict of capture also rests on a history drawn from secondary sources, and that the introduction’s “four times larger” and the analysis’s “seven times larger” describe the same gap. |
| LIT-1330 v2 | Rankings and Reactivity: How Public Measures Recreate Social Worlds | Espeland & Sauder (2007). Using US law-school rankings, shows that public measures are reactive: the people measured change what they do in response to being measured, through self-fulfilling prophecy and through commensuration, so the measure helps produce the world it describes. | Active — read 2026-10-21 (NOTE-1050) in full, from the copy in the Australian National University’s Open Research repository (hdl 1885/30995), which carries the AJS pagination; worth reading for reactivity as an object of study rather than a nuisance, for a definition of self-fulfilling prophecy that includes reactions which raise a measure’s validity by making the measured conform to it (THEORY-854), for commensuration as simplification and decontextualization, and for its typology of effects, reallocation, redefinition of work and gaming (THEORY-862). Read it knowing that it is an interview study of one ranking in one field, with no effect sizes and no counterfactual, that its quantitative links (rank to yield, past rank to reputation) are cited from other studies rather than shown, and that it offers its framework as an orienting heuristic, not a theory. |
| LIT-1331 v2 | Epistemic welfare and algorithmic recommender systems: overcoming the epistemic crisis in the digitalized public sphere | Hyzen, Van den Bulck, Puppis, Kulig & Paulussen (2025). Defines epistemic welfare as creating and maintaining the conditions and capabilities for individuals’ epistemic agency in the public sphere, and combines social epistemology, welfare studies and communication research into a framework for judging how well practices and institutions meet epistemic standards. It applies Goldman’s five (reliability, power, fecundity, speed, efficiency) to news organizations’ recommender systems. | Active — skimmed 2026-10-21 (NOTE-1035): every section was covered, but through a fetch tool that returned section-by-section accounts with short quotes, not a verbatim copy, so the quotes are unchecked; the article is open access (CC BY) and the publisher refused direct fetches. Worth reading for its definition of epistemic welfare as the conditions and capabilities for epistemic agency in the public sphere, for its staging of capabilities (literacy turning availability into access, critical skills turning access into knowledge), and for Goldman’s five standards applied to news recommenders. Read it knowing that it is a theory paper with no data, that it treats legacy media rather than platforms, and that a first-hand reading has not been made. |
| LIT-1333 v2 | Handcuffs for the Grabbing Hand? Media Capture and Government Accountability | Besley & Prat (2006). A model of democratic politics in which media capture is endogenous: even without censorship a government can pay outlets to suppress verifiable bad news, and because one report informs every voter, each outlet must be paid what it would earn as the sole breaker of the story, so the press is captured exactly when buying every outlet at that price, raised by the transaction cost of transfers, costs less than the rent of office. Plurality, costly transfers and audience revenue protect accountability; capture ends turnover. | Active — read 2026-10-21 (NOTE-1031) in full, from the authors’ 2005 working paper in LSE Research Online; worth reading for the model of media capture as a bargain (each outlet must be paid what it would earn as the only one to break the story, so the press is captured exactly when n·τa < r, THEORY-837), for its precise sense of media independence as the transaction cost of transfers, and for the observation that capture needs no deception. Read it knowing that it is static, that news in it is hard and the same at every outlet, that its cross-country table is raw means, and that the published AER text was not compared. |
| LIT-1334 v2 | Causal Consistency of Structural Equation Models | Rubenstein, Weichwald, Bongers, Mooij, Janzing, Grosse-Wentrup & Schölkopf (2017). Defines an exact transformation between structural equation models, under which the models agree on the effects of a declared set of interventions, and shows that marginalising variables, aggregating micro-variables into macro-variables and moving from time series to equilibrium models can each be exact for the interventions declared. | Active — read 2026-10-21 (NOTE-1037) in full, from arXiv:1707.00819v1; worth reading for the definition of an exact transformation between structural equation models, with its order-preserving map on interventions, and for its three families of exact coarse-grainings: marginalisation (THEORY-848), averaging under equal column sums (THEORY-847) and equilibria. Read it knowing that exactness is equality of push-forward laws for a declared intervention set, which Beckers and Halpern show to be too permissive and which can drop a variable that decides how a system responds; that only perfect interventions are modelled; and that the coefficient of its Theorem 11, as extracted from this copy, appears to lack a factor n. |
| LIT-1335 v2 | The Agenda-Setting Function of Mass Media | McCombs & Shaw (1972). Among 100 Chapel Hill voters not yet committed to a candidate in the 1968 US presidential campaign, the aggregate ranking of issues they named as most important correlated +.967 and +.979 with the emphasis the nine media serving them gave those issues, and leaning voters matched all the news better than news about their own side in 18 of 24 comparisons. Offered as evidence that the media may not tell people what to think but do shape what they think about; the authors say the correlations do not prove it. | Active — read 2026-10-21 (NOTE-1046) in full, from a copy of the published article posted on a UNC Chapel Hill course page; worth reading as the founding test of agenda-setting, for its distinction between influence on what an audience thinks about and on what it thinks, and for its comparison of agenda-setting against selective perception. Read it knowing that its evidence is an aggregate cross-sectional correlation over a handful of issues in one sample of 100 undecided voters in one town, with no test reported, that the direction from media to voters is argued and not identified, and that the authors say the correlations do not prove agenda-setting. The correlations are held as THEORY-842, the hypothesis as THEORY-838 (Proposed). |
| LIT-1336 v2 | Performative Prediction | Perdomo, Zrnic, Mendler-Dünner & Hardt (2020). When a deployed prediction changes the distribution of the outcomes it predicts, define performative stability (a model optimal for the distribution it induces) and performative optimality (least risk on the distribution it induces); show they can differ; prove that with a smooth, strongly convex loss and a distribution map ε-Lipschitz in Wasserstein distance, retraining converges to a unique stable point when ε < γ/β, that each condition is needed, and that stable points lie within 2L_zε/γ of optima. | Active — read 2026-10-21 (NOTE-1044) in full, from arXiv:2002.06673v4; worth reading for the split between performative stability (optimal for the distribution one’s own deployment induces, the fixed point of retraining) and performative optimality, for the exact conditions under which retraining converges to a unique stable point (smooth, strongly convex loss and ε < γ/β, each shown necessary; THEORY-861), and for the bound 2L_zε/γ between stable points and optima (THEORY-839). Read it knowing that its conditions hold in its own simulation only at the smallest ε, that the distribution map depends on the current model alone, and that it says nothing about how to reach the optimum. |
| LIT-1337 v2 | The Use of Knowledge in Society | Hayek (1945). The economic problem is not allocating given resources by a known plan but using knowledge of particular circumstances of time and place that exists only dispersed among many people; a price system communicates the part of that knowledge which matters for each decision without anyone holding it all. | Active — read 2026-10-21 (NOTE-1036) in full, from the Econlib reprint of the American Economic Review article, published there with the AEA’s permission; worth reading for the distinction between scientific knowledge and knowledge “of the particular circumstances of time and place”, for the argument that the second cannot be put into statistics for a central authority (THEORY-841), and for the price system as a mechanism that conveys relative scarcities without their causes. Read it knowing that it is an argument from examples with no model or evidence, that it is about the economic order and not organizations, and that it argues for competition, not that removing any given public rule decentralizes decisions. |
| LIT-1338 v2 | Epistemic Injustice in Generative AI | Kay, Kasirzadeh & Mohamed (2024). Introduces generative algorithmic epistemic injustice, with four dimensions: amplified and manipulative testimonial injustice, hermeneutical ignorance and access injustice; illustrates each with examples, particularly multilingual ones, and proposes strategies of resistance and design principles. | Active — read 2026-10-21 (NOTE-1049) in full, from the publisher’s free PDF of the AIES 2024 proceedings; worth reading for its four-way taxonomy of how generative models take part in epistemic injustice, and for the point that amplified testimonial injustice runs through a credibility excess assigned to the model (THEORY-864). Read it knowing that it is conceptual and measures nothing, that its examples are others’ reports, that its “manipulative” configuration counts deliberate fabrication as testimonial injustice although Fricker sets deliberate manipulation apart, and that its access injustice stretches the hermeneutical category. |
| LIT-1340 v2 | Regulatory independence may limit electoral holdup but entrench capture | Schram & Ule (2024). Where elected policymakers set infrastructure prices, investors fearing electoral pressure delay investment (holdup); regulatory independence, modelled as a price fixed by the first policymaker for all periods, can relieve that, but if policymakers’ interests are aligned with the infrastructure owner’s (“regulatory capture”, assigned as a treatment), independence entrenches the capture. Laboratory experiments (59 groups) find capture entrenchment, and uninformed voters too weak to remove it. | Active — read 2026-10-21 (NOTE-1053) in full (main text; the online appendices not read), from the publisher’s open-access PDF (CC BY 4.0); worth reading for a laboratory measurement (THEORY-856) that the commitment which relieves electoral holdup also locks in the interests of whoever designs it, raising prices further when policymakers are aligned with the operator (“capture entrenchment”), and for the authors’ general conclusion that independence helps consumers only when its designers serve them (THEORY-858, Proposed). Read it knowing that capture is assigned as a treatment, not produced, that “independence” is a price fixed by the first policymaker, that groups have three voters and the capture cells 18 groups, and that some effects weaken when the 45.8% of groups with dominated period-1 investment are excluded. |
| LIT-1341 v2 | How to Beat Science and Influence People: Policymakers and Propaganda in Epistemic Networks | Weatherall, O’Connor & Bruner (2020; arXiv 2018). In network-epistemology models of scientists and policymakers, a propagandist who only selects and shares real, unbiased results that favour one side, without fabricating any, can lead policymakers to the false belief while the scientific community converges on the truth; so can one who runs honest studies and publishes only the favourable ones, best with the smallest studies; and a journalist who reports both sides equally slows policymakers’ learning. | Active — read 2026-10-21 (NOTE-1038) in full, from the authors’ arXiv manuscript (1801.01239v2); worth reading for its model of the tobacco strategy, in which selective sharing of genuine results and honest research published selectively mislead a Bayesian audience while the scientists converge on the truth (THEORY-855), for the conditions under which this works, and for the finding that ‘fair’ reporting slows the audience. Read it knowing that its policy makers update on forwarded results as if they were unselected, that every result is a simulation of a stylized bandit model averaged over runs in which the scientists reached the truth, and that why the smallest studies serve biased production best is a sufficient-statistic fact the paper does not state (THEORY-845). |
| LIT-1342 v2 | From access and transparency to refusal: Three responses to algorithmic governance | James, Hynes, Whelan, Dreher & Humphry (2023). Sorts responses to the harms of algorithmic governance into access and inclusion, transparency, and refusal. Argues that the first two rest on public-administration values that reproduce existing structures, and that both are bidirectional: inclusion gives the powerful access to the included, and transparency can be demanded of the governed. Refusal, collective and generative rather than individual exit, is held more promising, though least available to those who depend on the state. | Active — read 2026-10-21 (NOTE-1041) in full, from the publisher’s open-access PDF; worth reading for its sorting of responses to algorithmic governance into access and inclusion, transparency, and refusal, and for the point that access and transparency are bidirectional, inclusion giving the powerful access to the included and transparency being demanded of the governed (THEORY-857). Read it knowing that it is a conceptual argument with illustrative cases, mostly Australian, that it shows no comparison of outcomes between the responses, and that it favours refusal on argument rather than evidence. |
| LIT-1344 v2 | Neurophenomenal structuralism. A philosophical agenda for a structuralist neuroscience of consciousness | Lyre (2022), Neuroscience of Consciousness niac012. A programmatic paper. Only relational properties cross the neural/non-neural boundary, and spatiotemporal relations, by acquaintance, answer the Newman problem for the brain. Two assumptions: any phenomenal experience is fully individuated, in its specificity, by its place in a quality space (Q-structure); and Q-structure is mirrored by a surjective homomorphism from neural feature maps. With metaphysically necessary supervenience assumed, it argues for reductive physicalism, an instrumentalist structural representationalism, holism about experience (dichromats experience every colour differently) and the actual and nomological impossibility of spectrum inversion. It concerns specific, not generic, consciousness, and denies being a structural realism. | Active — read in full 2026-10-22 (NOTE-1060) from the version of record deposited in PubMed Central (PMC9396309, JATS full text via Europe PMC; the OUP PDF returned 403); worth reading as the most explicit statement of phenomenal structuralism as an ontology: each specific phenomenal character is fully individuated by its place in a quality space, that space is mirrored by a surjective homomorphism from neural feature maps, and holism and the impossibility of nomological spectrum inversion follow. It is the statement Negro and Aldé quote as their target. It is programmatic: nothing is tested, the neural half rests on one cited V4 study, it addresses only which experience a conscious state is and not whether it is conscious, and its reduction rests on metaphysically necessary supervenience that the author says he cannot argue for. |
| LIT-1345 v2 | Integrated World Modeling Theory (IWMT) and the Human Consciousness Hypothesis (HCH) | Safron, Klimaj & Sheikhbahaee (2026). Compares the Human Consciousness Hypothesis (genesis, coherence, second-order perception) with Integrated World Modeling Theory, on which phenomenal consciousness is what it feels like to be the coherent functioning of an embodied agent’s probabilistic generative world model, implemented by synchronous neural complexes that infer the states of the embodied sensorium. | Active — read in full 2026-10-22 (NOTE-1057) from the publisher’s PDF on AAAI’s open journal system; worth reading as a compact current statement of Integrated World Modeling Theory: phenomenal consciousness is the coherent functioning of an embodied agent’s generative world model, run coupled to sense data in perception or decoupled in imagination, and embodied grounding is necessary, so integrated information or a global workspace without it does not suffice. Its main limit is that it argues nothing: a seven-page symposium paper that restates earlier IWMT papers, not read, and aligns them with a Human Consciousness Hypothesis it does not reference. Embodiment is required in “sufficient degrees (and kinds)” with no threshold. |
| LIT-1346 v2 | Three arguments against metaphysical structuralism in consciousness research | Negro (2025), Synthese 206:8. Distinguishes methodological, epistemological and metaphysical structuralism in consciousness science, and three senses in which consciousness may be structural: an experience has an internal structure, is in a structure, or is the structure. Against the third, which metaphysical structuralism needs (Lyre 2022 is the quoted target), it gives three valid arguments: Relational Mary, who knows all of orange’s relations and still learns what orange is like; the novel experience argument, that the view makes every new experience change all the others; and the lonely experience argument, that a one-experience system is conceivable and even nomologically possible. Methodological and epistemological structuralism need only the first two senses and are left standing. | Active — read in full 2026-10-22 (NOTE-1054) from the publisher’s open-access PDF (Springer, CC BY 4.0); worth reading as the clearest map of what phenomenal structuralism can and cannot claim: three structuralisms (methodological, epistemological, metaphysical) and three senses of “structural” (having, being in, and being a structure), with the argument that the field’s methods and evidence need only the first two senses. Its three arguments against the metaphysical thesis (Relational Mary, novel experience, lonely experience) are valid, but each rests on an intuition or a conceivability premise that a committed structuralist denies, and its charge that making judgement constitutive amounts to eliminativism is one paragraph long. |
| LIT-1347 v2 | Verbalizable Representations Form a Global Workspace in Language Models | Gurnee, Sofroniew et al. (2026), Anthropic, Transformer Circuits Thread; arXiv:2607.15495. A Jacobian lens, the Jacobian from a layer to the output averaged over a corpus, gives each vocabulary token a direction per layer; sparse combinations of them form the “J-space”. In Claude Sonnet 4.5, Haiku 4.5, Opus 4.5 and Opus 4.6, swaps, injections and ablations show the J-space part of a representation, under a tenth of its variance, carrying verbal report, instructed concepts, two-hop intermediates and reuse of an argument by many functions, while continuation, anomaly detection and line wrapping use the same information without it. The J-space works in a middle band of layers, holds about 25 active directions, and is amplified and relayed by the weights. Ablating it flattens experiential language about the model and about others. Further sections apply it to alignment audits, show post-training installing the Assistant’s point of view, and introduce counterfactual reflection training. The authors take no position on phenomenal consciousness. | Active — read 2026-10-22 (NOTE-1069), main text in full and appendices in part, from the arXiv v1 PDF; worth reading as the first interventional evidence that a language model has a functional analogue of conscious access in the access sense: a sparse set of verbalizable directions, found by a corpus-averaged Jacobian lens, carries report, held concepts, unspoken reasoning steps and reuse of one argument by many functions, while routine processing uses the same information without it; and ablating it flattens experiential language about the self and about others alike. Read it knowing its limits: one company’s models studied by that company, unreplicated; a lens whose own statistics draw the layer band; an automatic/flexible split partly defined by the result; experiential language graded by another model; and an explicit refusal to say anything about phenomenal consciousness. Filed as THEORY-865 and THEORY-869. |
| LIT-1348 v2 | Two geometrical arguments against similarity structuralism | Aldé (2026), Synthese 207:204. Similarity structuralism holds that phenomenal character is fully determined by similarity relations, so by the geometry of a similarity space. Two arguments that this fails for colour. The unique hues objection: exactly four hues are experienced as unmixed and all others as combinations of two, but no geometric property of CIELAB, or likely of better uniform spaces or of the colours they omit, distinguishes them. The opposing dimensions objection: the black–white axis is a single gradient, while axes through grey are two half-gradients, and no adequate geometric feature marks the difference. Structuralism cannot discount the introspective evidence without discounting the introspected similarity it is built on. | Active — read in full 2026-10-22 (NOTE-1055) from the publisher’s open-access PDF (Springer, CC BY 4.0); worth reading as the objection to similarity structuralism that does not rest on intuition: it takes accepted facts of colour science, that exactly four hues look unmixed and every other hue a mixture of two, and that the black–white axis is a single gradient where the axes through grey are opponent pairs, and argues that no adequate feature of the colour similarity space’s geometry marks either. Its decisive premise is argued by inspecting CIELAB and extrapolating to better models, not by an analysis, and its target is similarity structuralism about colour only. |
| LIT-1351 v2 | Evidence synthesis indicates contentless experiences in meditation are neither truly contentless nor identical | Woods, Windt & Carter (2022). An evidence synthesis of 135 texts by eight teachers of Shamatha (Wallace), Transcendental and Stillness Meditation identifies 65 features of the so-called contentless goal-states. The states are described as lacking thoughts, concepts, perceptions, images and memories but keeping wakefulness, calm, stillness, bliss, knowing, freedom and unity. They are the same across practices on 14 features, different on 4 (chiefly Shamatha’s attentional stability and vividness) and unclear on 47. So, on the texts, most are not truly contentless, and they are not identical. | Active — read in full 2026-10-22 (NOTE-1070) from the submitted preprint on MindRxiv (osf.io/ve7z2); worth reading as the systematic case that meditative states called contentless are described by their own teachers as lacking thoughts, perceptions, images and memories but keeping wakefulness, calm, stillness, bliss, a non-conceptual knowing, freedom and unity, and as differing across Shamatha, TM and Stillness Meditation, chiefly in Shamatha’s far greater attentional stability and vividness. 135 texts by eight teachers, 65 features: the same on 14, different on 4, unclear on 47. Its main limit is that the evidence is teachers’ descriptions, not practitioners’ reports, and that “not truly contentless” rests on counting qualities such as calm and simplicity as content, which the paper does not define. |
| LIT-1352 v2 | Towards a Mathematical Structure of Global Phenomenal Consciousness | Lee-Youngzie, Tsuchiya, Robinson, Dietz & Monti (2026), Entropy 28(6):615, a hypothesis article. Intra-phenomenal structures model the parts of one experience, and inter-phenomenal structures place an experience among others by similarity judgements. A presheaf maps each part, in a finite topology of parts, to the dissimilarity matrix measured for it. Agreement of narrow qualia on an overlap is read as phenomenal binding, and the presheaf’s being a sheaf as the broad quale’s being fixed by its parts. Worked for a two-hemifield visual field. A sheaf failure is read as disunity for binocular rivalry and as context dependence for the Ebbinghaus illusion. No data. | Active — read in full 2026-10-22 (NOTE-1059) from the version of record in PubMed Central (PMC13298370, CC BY 4.0, via the Europe PMC full-text XML); worth reading as the first worked proposal to join intra-phenomenal (part–whole) and inter-phenomenal (similarity) qualia structures by a presheaf, with phenomenal binding read as agreement of measured narrow qualia on overlaps and a sheaf as a broad quale fixed by its parts. It is a hypothesis article with no data. It does not identify unity with a global section: it assumes unity always holds, and it reads a sheaf failure as disunity for binocular rivalry and as context dependence for the Ebbinghaus illusion without a criterion between them. Its worked topology example is malformed, and by its own definition of gluing the rivalry case is not a sheaf failure. |
| LIT-1353 v2 | The Theory of Constructed Emotion: More Than a Feeling | Barrett et al. (2025). A reply to van Heijst et al., who proposed that basic emotion theory explains emotions as bodily states and the theory of constructed emotion explains the feelings that arise from them. The authors argue that this split misrepresents constructed emotion through three simplifications, and that the two theories rest on incommensurate assumptions and cannot be reconciled. | Active — read in full 2026-10-22 (NOTE-1067) from the publisher’s text in PubMed Central (PMC12164598, CC BY-NC 4.0); worth reading as the theory’s architects saying plainly that feeling is not a second phenomenon that represents the body’s regulation: the same allostatic signals that regulate the body make feeling, an instance of emotion is one whole-brain event, and splitting it into an objective bodily state and a subjective feeling is a premise of basic emotion theory, which they call incommensurable with theirs. It is a reply with no data; its evidence is cited lists, much of it from the authors’ own groups, and basic emotion theory is described by its opponents. It does not discuss emotion regulation, reappraisal or therapy. |
| LIT-1354 v2 | Distilling the Neurophenomenological Signatures of Pure Awareness during Transcendental Meditation | Chandia-Jorquera, van Mil, Estarellas, Dauphin, Pascovich & Canales-Johnson (2026). EEG with retrospective temporal experience tracing in 33 experienced Transcendental Meditation practitioners and 33 sex- and age-matched controls who counted. Practitioners traced higher and more variable “pure awareness” (d = 0.77 and 1.32). A random-forest classifier on distributed EEG patterns separated meditation from counting at 65% balanced accuracy, led by permutation entropy and aperiodic activity, and meditation from rest at 88% sensitivity, led by low-frequency phase coherence. No robust association between the reports and the EEG was found. | Active — read in full 2026-10-22 (NOTE-1058) from the bioRxiv preprint, version 3; worth reading as the largest EEG study of Transcendental Meditation with time-resolved reports: 33 practitioners traced more, and more variable, “pure awareness” than 33 matched controls who counted, and a classifier on distributed EEG patterns separated meditation from counting (65% balanced accuracy, on entropy and aperiodic activity) and from rest (88% sensitivity, on low-frequency phase coherence). Its main limit is that the reports were not shown to track any EEG feature. The reports are retrospective ratings on a scale whose top the experimenters defined as “free from content”, demand is conceded only for controls, and the study was funded by, and recruited through, the TM organisation. Evidence about a practice period and about reports, not a neural signature of experience with little content. |
| LIT-1355 v2 | Representational Theories of Consciousness (Stanford Encyclopedia of Philosophy) | Lycan (2000; rev. 2023), SEP. Strong representationalism holds that a sensory quality, such as the green of an after-image, is a represented property of a represented, possibly nonactual object, and that representation of a functionally specified sensory kind suffices for it; pure representationalism, on which representation alone suffices, is held by no one. The entry gives five arguments for (materialism, veridicality, transparency, seeming, hallucination) and the objections: unconscious representation, phenomenal intentionality, laws of appearance, moods, aspect perception, blur and inversions. It leaves wide against narrow qualities open. “What it’s like” is treated separately as a higher-order property that needs awareness, with the phenomenal concept strategy and illusionism. | Active — read in full 2026-10-22 (NOTE-1068) from the live entry, substantive revision of 19 October 2023; worth reading as the map of representational theories of sensory qualities: pure, strong and weak, wide and narrow, reductive and not, the five arguments for, and the counterexamples case by case, with “what it’s like” kept apart as a higher-order property that needs awareness. Read it knowing that its author is one of the three named defenders of strong wide representationalism and that his replies get the most room, that it leaves wide against narrow open, and that it is a theory of what is experienced, not of what makes a state experienced, which it hands to the higher-order entry. |
| LIT-1356 v2 | What Is Enactivism? | Ward (2026). Treating “enactivism” as an umbrella for any view that stresses sensorimotor loops ignores what sets apart the enactive approach of Varela, Thompson and Rosch: life–mind continuity, the primacy of lived experience, and reciprocity between science and self-understanding. A second axis, organicist against informationalist, runs across the cognitivist–embodied one. Embodied predictive processing, extended functionalism and cybernetics are embodied and informationalist; the enactive approach is organicist. A taxonomy, not an argument that organicism is true. | Active — read in full 2026-10-22 (NOTE-1065) from the author’s accepted manuscript in the University of Edinburgh repository; worth reading as a short, clear map that separates where a view puts cognition’s processes (skull, or brain–body–world) from what it says meaning depends on (information, or organization distinctive of living things). On that map embodied predictive processing, extended functionalism and cybernetics are embodied but informationalist, and the enactive approach of The Embodied Mind is organicist, further marked by the primacy of lived experience and by reciprocity, in which the vocabularies we understand ourselves with reshape the experience they describe. Its main limit is that it argues for a taxonomy, not for organicism, and gives no criterion for which properties are distinctive of life. It does not discuss brains in vats, development or grounding. |
| LIT-1357 v2 | Convergent transcriptomic and connectomic controllers of information integration and its anaesthetic breakdown across mammalian brains | Luppi et al. (2026), Nature Human Behaviour 10(4):777–802. Revised integrated information ΦR, computed pairwise from resting-state fMRI by integrated information decomposition and averaged over region pairs, falls under anaesthesia in humans (sevoflurane, n = 15), macaques, marmosets and mice, with medetomidine–isoflurane in the mouse the exception in the main analysis. It returns on spontaneous recovery in humans, and when central thalamic stimulation restores arousal in two propofol-anaesthetized macaques. Network control energy rises under anaesthesia and correlates negatively with ΦR. Regional ΦR loss is largest in unimodal cortex and follows cortical PVALB expression in human, macaque and mouse. Species-specific mean-field models reproduce the PVALB effect and the advantage of central over ventrolateral thalamic stimulation. The target is behavioural responsiveness. | Active — read in full 2026-10-22 (NOTE-1064) from the publisher’s open-access version of record (CC BY 4.0); worth reading as the cross-species, causal extension of the same group’s synergistic-workspace result (LIT-949): pairwise integrated information ΦR from resting fMRI falls under anaesthesia in humans, macaques, marmosets and mice and returns with responsiveness, including when central thalamic stimulation re-awakens two anaesthetized macaques, and it tracks arousal better than the original Φ, causal density or functional connectivity. Its main limit is the target: behavioural responsiveness, which the authors call “presumably consciousness” and an “imperfect marker”. It is also pairwise, linear-Gaussian, at rest and content-free, and the causal arm rests on two animals. The PVALB and modelling results are correlational and model-bound. Filed as THEORY-881. |
| LIT-1358 v2 | Illusionism Big and Small: Some Options for Explaining Consciousness | Graziano (2024), eNeuro 11(10). A claim to be conscious requires an internal model encoding it, and brain models are schematic, so what is reported is a caricature of whatever the model tracks. Six hypotheses for that target: a magical essence (rejected, for lacking “Arrow B”, a route from feeling to encoding), nothing (hard illusionism, judged improbable), integrated information (illusionist IIT), the global workspace modelling itself, attention modelled by an attention schema, and “deep illusionism”, the deep selective processing the last three share. No new data. | Active — read in full 2026-10-22 (NOTE-1071) from the publisher’s PDF (eNeuro, CC BY 4.0); worth reading as the shortest statement of the attention schema theory as an illusionist framework. Its argument: every claim to be conscious needs an internal model, every model is schematic, so the reported “intangible essence” is a caricature of a real process. It adds “Arrow B”, the demand that a theory explain how a feeling gets encoded for report, and it sets IIT and the global workspace as illusionist variants converging on “deep selective processing”. An essay with no new data and a polemical tone. Its “small” illusionism keeps the process real but still denies the phenomenal essence, so it is Frankish’s strong illusionism with a named target, not a weak illusionism. |
| LIT-1359 v2 | A systems identification approach using Bayes factors to deconstruct the brain bases of emotion regulation | Bo, Kraynak, Kwon, Sun, Gianaros & Wager (2024). Across two fMRI studies (n = 182 and 176), Bayes factors identify four reappraisal-related systems: an anterior prefrontal one selective for reappraisal, a fronto-parietal-insular one engaged by reappraisal and emotion generation alike, a largely subcortical one (amygdala, hypothalamus, periaqueductal gray) active in negative emotion but unaffected by reappraisal, and a posterior cortical one downregulated by it. | Active — read in full 2026-10-22 (NOTE-1061) from the bioRxiv preprint, version 2 (10 May 2023), not the closed version of record; worth reading as the first imaging study of reappraisal large enough (n = 182 and 176, replicated in both) to give evidence for nulls, which lets it say which regions are engaged only by regulating, which are shared with generating negative emotion, and which emotion-responsive regions reappraisal leaves unchanged. Most of the reappraisal network is shared with generation, a smaller anterior prefrontal and temporo-parietal set is selective for it, and every subcortical emotion-responsive region, amygdala and PAG included, was unchanged while reported negative affect fell. One instructed strategy, one picture task, BOLD means and one rating per trial; its talk of “subcortical-level affective experience” goes beyond what was measured. |
| LIT-1360 v2 | Real patterns, the predictive mind, and the cognitive construction of the manifest image | Gładziejewski (2025), Synthese 206:225. Dennett’s compression criterion for real patterns is carried through minimum description length, Bayesian inference and variational free energy, so learning a generative model is real-pattern extraction from sensory data. The manifest image is then a structural description of the sensory signal, equally veridical for an envatted twin with matched input. Applied to selves: a self-model compresses self-generated regularities by positing one common cause, real as a pattern, not as a substance, and the realism dispute is over criteria. Applied to objects: compression-based composition (Bird 2023) favours cats over arbitrary sums. | Active — read in full 2026-10-22 (NOTE-1056) from the publisher’s open-access PDF (Springer, CC BY-NC-ND 4.0); worth reading as a clear derivation of Dennett’s real patterns into predictive processing, through minimum description length and the complexity–accuracy split of free energy, and as a short diagnosis of the realism dispute about selves: a self-model compresses self-generated regularities by positing one common cause, so the self is real as a pattern and not as a substance, and the dispute is over criteria. The structural, Kantian realism it draws (the manifest image is veridical in a matched vat) needs manifest content to be wholly structural, which it assumes. It says nothing about consciousness, and it does not say a self-model exaggerates the self’s unity. |
| LIT-1361 v3 | Phenomenal structure: What is it and what is it for? | Isaac (2025). Sets out a structuralist science of phenomenal experience: experience has geometric structure (quality spaces), group-theoretic structure (perceptual constancies, which induce a distinction between subject and object) and dynamical structure (valence and affordance). Its method is to find structure-preserving maps between these and neural and physical structures, made testable because structural relations between experiences show up in behaviour, and evidenced chiefly by convergence between models built from different behavioural procedures, which it concedes is partial. | Active — read in full 2026-10-25 (NOTE-1163) from the publisher’s gold open-access PDF (version of record, CC BY), which the publisher’s site served on 2026-10-25 after refusing every request on 2026-10-22; worth reading as a structuralist programme that, unlike Lyre’s (LIT-1344), denies that quality-space geometry is enough: it adds constancy as invariance under transformations within experience, which after Cassirer it takes to make experience objective and to separate subject from object (THEORY-959), and fields of valence and affordance; and for its account of how a third-personal science reaches experience, chiefly by convergence between models built from different behavioural procedures (THEORY-953). Read it knowing that it is programmatic and tests nothing, that the author calls the group-theoretic and dynamic layers “mere suggestive sketches”, that “group-theoretic” is used for invariance in general (its own examples are groupoids or toy models), that it gives no criterion separating a subject–object distinction from mere invariant extraction, that the convergence it cites is coarse and its argument does not exclude a shared stimulus geometry as the common factor, and that, like Lyre, it addresses the character of experience, not whether a state is conscious. |
| LIT-1362 v2 | Higher-Order Theories of Consciousness (Stanford Encyclopedia of Philosophy) | Carruthers & Gennaro (2001; rev. 2026), SEP. Most kinds of mental state also occur unconsciously (blindsight, absent-minded driving, the agnosic D.F.), and higher-order theories say a state is phenomenally conscious when it is, or is disposed to be, the object of a suitable non-inferential higher-order representation. The entry sets out inner sense, actualist higher-order thought (Rosenthal), dispositionalist dual-content theory (Carruthers) and self-representational and hybrid views (Kriegel, Gennaro, Van Gulick, Picciuto). It gives the objections (targetless representations, the rock, animals and infants, sufficiency, depersonalization) and the evidence and counter-evidence that prefrontal cortex realizes the higher-order states, and concludes no verdict. | Active — read in full 2026-10-22 (NOTE-1066) from the live entry, substantive revision of 9 January 2026; worth reading as the map of higher-order theories, which explain what makes a mental state conscious rather than unconscious by a higher-order representation of it: inner sense, actualist and dispositionalist higher-order thought, self-representational and hybrid views, the standing objections (targetless states, the rock, animals and infants, sufficiency) and the prefrontal evidence. Read it knowing that it argues for no verdict, that it is maintained by Gennaro, a higher-order theorist, while Carruthers and Lycan are reported to have given up their versions, and that its empirical section reports results to about 2023 and not the 2025 adversarial-collaboration findings. |
| LIT-1363 v2 | A beautiful loop: An active inference theory of consciousness | Laukkonen, Friston & Chandaria (2025). Active inference can model consciousness under three conditions: a simulated world model (an epistemic field), inferential competition to enter it (Bayesian binding), and epistemic depth, the recurrent sharing of beliefs by which the world model contains the knowledge that it exists. A hyper-model for precision control is proposed to implement them, and the account is applied to altered states and meditation. | Active — read in full 2026-10-22 (NOTE-1063) from the PsyArXiv preprint, version 3 (June 2025); worth reading as the most explicit proposal that what makes inference conscious is recursion over precision: a unified world model, a coherence-driven competition to enter it, and epistemic depth, the model looped back through the hierarchy by a hyper-model that predicts precision at every level, with awareness graded by that depth and not by content. It is the record’s best-stated recursive candidate for QUESTION-254. Its main limit is that it is conceptual: no data, no simulation, a formal part (Table 1) that is a standard hierarchy with layer-wise precision hyper-parameters, and a definition of epistemic depth in terms of awareness. A footnote withdraws the claim that meeting the conditions guarantees phenomenal experience. |
| LIT-1364 v2 | On the minimal theory of consciousness implicit in active inference | Whyte, Corcoran, Robinson, Smith, Moran, Parr, Friston, Seth & Hohwy (2026). Reviewing active inference models of consciousness, it argues that they share a small set of theoretical commitments, which together amount to a minimal and testable theory of consciousness; since all the models minimise the same objective, decomposable into interpretable terms, it can compare phenomena that separate theories treat apart. | Active — read in full 2026-10-22 (NOTE-1062) from arXiv:2410.06633v2, the submitted version; worth reading as the clearest statement of the theory of consciousness that active inference models already assume: conscious contents are posterior beliefs about world, body or brain, and a posterior is conscious when it has the capacity to inform discrete, counterfactual policy selection, slowly and precisely enough. It also reviews the simulations of rivalry, access, no-report, interoception, valence and meta-awareness, and names two predictions close to its core. Its main limit is scope: the criterion is one of conscious access, read off models built to report, and the authors hold it only for humans and similar animals. A review with three small simulations of its own; neither prediction is tested. |
| LIT-1365 v2 | National Incident Management System, Third Edition | FEMA (2017). The national doctrine for incident management in the United States: the Incident Command System’s modular organization, Unified Command (in which participating agencies keep their own authority and accountability), and the Safety Officer’s authority to stop or alter activities that are immediately dangerous. | Active — skimmed 2026-10-22 (NOTE-1072) from FEMA’s PDF (a U.S. government work): the Introduction and the Command and Coordination component read in full, with the command-position tables of Appendix A; Resource Management skimmed; Communications and most appendices not read. Worth holding as the doctrine the record’s incident cases are measured against: Unified Command shares the command function among agencies that keep their own authority, transfer of command is formalized with a briefing, and the Safety Officer may alter, suspend or terminate immediately dangerous activities. It also keeps one command function, one action plan and unity of command, which limits A24’s reading that coordination needs no single controller. Doctrine, not evidence of practice. Registered from the owner’s exchange of 2026-10-22, “Graph Learning Applications”. |
| 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-1367 v2 | Culture in Action: Symbols and Strategies | Swidler (1986). Recasts culture as a “tool kit” of symbols, stories, rituals and skills from which people construct strategies of action, and not as values that set the ends of action; culture’s effects differ between settled periods, where it constrains through the cost of retooling, and unsettled ones, where explicit ideologies govern action directly but structural opportunities decide which survive. | Active — read in full 2026-10-22 (NOTE-1075) from a JSTOR copy of the published article posted on an MIT course page; worth reading as the source of the toolkit account: culture supplies a repertoire from which strategies of action are built, strategies outlast the ends they serve, and settled and unsettled periods need different causal models, with structural opportunities selecting among competing ideologies. A theoretical essay with illustrations and no data; held as THEORY-890, Proposed. Its repertoire is public meaning, not disposition, so it is not interchangeable with habitus. |
| LIT-1371 v2 | Aircraft Accident Report: United Airlines, Inc., McDonnell-Douglas DC-8-61, N8082U, Portland, Oregon, December 28, 1978 | NTSB (1979). United 173 ran out of fuel while its crew worked a landing-gear problem near Portland, and crashed, killing ten. The probable cause was the captain’s failure to monitor and respond to the fuel state and to the crew’s advisories; a contributing factor was the other crew members’ failure to grasp or press the criticality of the fuel state. The Board recommended that crews be indoctrinated in “flightdeck resource management”, with participative management for captains and assertiveness training for the rest of the crew. | Active — read 2026-10-22 (NOTE-1086) from the FAA-hosted scan of NTSB-AAR-79-7 (a U.S. government work; the analysis and findings pages read from images where the OCR fails; the CVR transcript skimmed). Worth holding as the founding document of the CRM case: the crew had the fuel quantity, no one was assigned to watch it against time, the others’ concerns stayed comments, and the Board’s recommendation X-79-17 asked for “participative management for captains and assertiveness training for other cockpit crewmembers”, a reform of how command takes input that leaves command in place. It does not find that the other crew members knew the fuel was running out. Registered from the owner’s exchange of 2026-10-22, “Graph Learning Applications”. |
| 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-1374 v2 | Post-Incident Analysis: Independent Review of the Brookhollow Apartment Fire | Jensen Hughes (2024). The independent review, commissioned by Sedgwick County and the City of Wichita, of the emergency response to the Brookhollow Apartments fire of 13 October 2023, in which a resident, Paoly Bedeski, died and a partial collapse of the exterior stair roof on two fire crews brought a mayday. It found “no single point of failure” but systemic shortcomings across dispatch and the fire department that “contributed to an unorganized rescue effort”, most of them departures from the agencies’ own procedures, without concluding that they changed the outcome. | Active — read in full 2026-10-22 (NOTE-1073) from the report as posted by Sedgwick County, which commissioned it. Worth holding as the record’s best documented instance of CLAIM-422’s procedure–capacity gap: the agencies’ written procedures were judged thorough and up to date, and the failures were departures from them (a CAD step dispatchers on several shifts could not recall, a TAC-monitoring rule set aside by informal agreement, a mayday policy not followed, search not resumed for over eleven minutes after a mayday under control within minutes). It does not support “four firefighters caught”; it names two crews and reports no firefighter injured. Registered from the owner’s exchange of 2026-10-22, “Graph Learning Applications”. |
| LIT-1375 v3 | Diplomacy and domestic politics: the logic of two-level games | Putnam (1988). Models international negotiation as two games played at once: a chief negotiator bargains with foreign counterparts while any agreement must be ratified at home, so a deal is possible only where the domestic win-sets overlap. A win-set’s size depends on domestic preferences and coalitions, ratification institutions and the negotiators’ strategies; a small one is both a bargaining advantage and a risk of involuntary defection, and domestic division can make agreement easier. | Active — read 2026-10-30 (NOTE-1436) in full, from the JSTOR scan posted on a course page of the Athens University of Economics and Business (eclass.aueb.gr, course DEOS290), read through the OCR text of another download of the same scan at gwern.net/doc/politics/1988-putnam.pdf, the course copy having no text layer; worth reading as the standard statement of two-level games: a negotiator bargains abroad over a deal that must be ratified at home, so the overlap of domestic win-sets decides whether a deal is possible, and their size who gains. Read it knowing that it is a framework illustrated by cases, chiefly the 1978 Bonn summit, with no formal solution, and that it treats one negotiation at a time. |
| LIT-1376 v2 | The Ledger of Will: Evidence, Revaluation, and the Preservation of Revisable Agency | Aevyra (2026). A formal account of memory for persistent agents whose central requirement is “revision sufficiency”: retained state must support a declared family of future questions, interventions and changes of evaluative law. It characterizes exact revision sufficiency for finite histories by a factorization condition, derives a lower bound on representation size, and proposes an architecture that keeps grounds and counterevidence with each commitment. | Active — read in full 2026-10-22 (NOTE-1091) from the web page, version 4.0 of 25 September 2026, with its PDF and reproducibility archive, whose checks were run and reproduce; worth reading as a careful, self-limiting formal statement of what a reduced memory must keep for an agent to stay able to revise: exact sufficiency for a declared family of future demands is factorization through the retained state (the record’s CLAIM-350), and under repeated declared revisions it is the coarsest revision-invariant refinement (Moore–Nerode), filed as THEORY-884. Elementary and, by its authors’ account, a synthesis; its architecture and experiment are proposals, unexecuted. It is the closest outside statement of CLAIM-295 and answers QUESTION-112 only for a revision family declared in advance. Despite its title it has nothing on will-organization in the record’s sense. |
| LIT-1377 v2 | A Concise Genealogy and Anatomy of Habitus | Wacquant (2016). Traces the concept of habitus from Aristotle to Bourdieu and sets out its anatomy: socially acquired, durable but not fixed dispositions that can be layered and internally discordant, and that must be studied together with the social worlds that form and solicit them. | Active — read in full 2026-10-22 (NOTE-1074) from the journal’s typeset article deposited in UC Berkeley’s eScholarship collection; worth reading as a seven-page authoritative statement that habitus is layered, revisable, possibly split against itself, able to misfire against its world, shared as a kind and unique as a token, and inert without the positions that trigger it. It is exegesis of Bourdieu with cited, not presented, evidence, and it dismisses Sewell’s critique in a note without argument. |
| LIT-1378 v2 | NASA: Better Mechanisms Needed for Sharing Lessons Learned | GAO (2002). Found that NASA’s lessons-learned system was little used by its program and project managers, and that the agency had no assurance that lessons from earlier failures were being applied. | Active — read in full 2026-10-22 (NOTE-1088) from the GAO’s PDF on govinfo.gov (a U.S. government work). Worth holding as a clean instance of procedure without capacity at NASA: agency rules required managers to review and apply lessons, a 2001 census survey found they mostly did not, and NASA measured how often its lessons database was searched but not whether any lesson was applied. It is about the 1999 Mars failures and a 1995 database, not about Challenger or the Shuttle, so it is not evidence that the post-Challenger corrections decayed. Registered from the owner’s exchange of 2026-10-22, “Graph Learning Applications”. |
| LIT-1379 v2 | Human Nature and the Social Order | Cooley (1902). Argues that society and the individual are two aspects of one life and that the immediate social reality is the idea people have of one another. The self of common speech is a feeling of appropriation attached to ideas formed in communication, and in “a very large and interesting class of cases” it is the “looking-glass self”: an imagined appearance in another mind, an imagined judgement of it, and a self-feeling such as pride or mortification. | Active — skimmed 2026-10-22 (NOTE-1080): five of twelve chapters (I, III, V, VI, VIII) read in full from the Project Gutenberg text of the 1902 edition (public domain); worth reading for the source of the looking-glass self and for how much of the imagined-audience argument it already holds: the other in whose mind one sees oneself is imagined and may be absent, dead or ideal, a group is realized as imagined persons, conformity is driven by a judgement one attributes to others, and opposition to what others enjoin is itself steered by it. The looking-glass self is one large class of the social self, not its definition. An essay from introspection, two children and literature, with no method that could fail. |
| LIT-1382 v2 | Event perception: A mind-brain perspective | Zacks et al. (2007). Event segmentation theory: perceptual systems continuously predict what will happen next, a transient rise in prediction error is perceived as an event boundary, and boundaries update the event models that guide attention and memory. | Active — read in full 2026-10-22 (NOTE-1084) from the author manuscript in PubMed Central (PMC2852534, NIH public access); worth holding as the statement of event segmentation theory: transient rises in perceptual prediction error are perceived as event boundaries and reset working-memory event models, a domain-general mechanism of attention and memory control. A review with mostly correlational evidence; prediction error is not measured in people and the predicted anterior cingulate response at boundaries was not found. A theory of a passive observer of others’ activity; it does not mention doorways or one’s own intentions. |
| LIT-1383 v2 | A Theory of Structure: Duality, Agency, and Transformation | Sewell (1992). Revises Giddens’s duality of structure: structures are mutually sustaining cultural schemas (virtual) and sets of resources (actual), and because structures are multiple and intersect, schemas are transposable, and resources are polysemic and accumulate unpredictably, the same structures that enable action also make their own transformation possible. Agency is the capacity to transpose schemas and remobilize resources. | Active — read in full 2026-10-22 (NOTE-1078) from a JSTOR copy of the published article posted on a University of Athens course page; worth reading as the standard repair of Giddens’s duality of structure: structures are virtual schemas and actual resources that sustain each other, and change arises from within because structures are multiple and intersect, schemas transpose, and resources are polysemic and accumulate unpredictably. Agency is the capacity to transpose and remobilize. Conceptual, with a conjecture (durability follows depth more than power) illustrated, not tested; its critique of habitus is aimed at Bourdieu’s 1977 Outline. |
| LIT-1384 v2 | Walking through Doorways Causes Forgetting: Further Explorations | Radvansky, Krawietz and Tamplin (2011). The location-updating effect appeared with smaller displays and in a real environment, and, against an encoding-specificity account, memory did not improve when people returned to the room where the objects were first encoded; the results are read through the event horizon model. | Active — read in full 2026-10-22 (NOTE-1082) from the publisher’s PDF as posted on the first author’s laboratory page at Notre Dame; worth holding for the return-to-the-room result and the authors’ account of it: returning to the room where objects were picked up did not help, two new rooms were worse than one, and the authors explain the effect as retrieval interference between event models that both hold the carried object, not as loss of a context or of activation. The real-room experiment changes the task and its effect is p = .02 to .06; the plain shift effect in the return experiment is marginal on errors. No goal or intention is manipulated, so the reading that perspective is a goal-sensitive relation rather than a location is not tested here. |
| LIT-1385 v2 | Walking through doorways causes forgetting: Event structure or updating disruption? | Pettijohn and Radvansky (2016). Two virtual-navigation experiments rejected a retention-interval account (travel times were similar) and a temporary-disruption account (a 3-second delay did not change the pattern), and the authors attribute the effect to interference at retrieval among multiple event models that share elements. | Active — read in full 2026-10-22 (NOTE-1081) from the publisher’s PDF as posted on the second author’s laboratory page at Notre Dame; worth holding as the paper that rules out a longer retention interval and a passing cost of updating, and sets the doorway effect’s mechanism as competition between the two event models that hold the carried object, against the alternative that a prior event model has merely dropped out of working memory. In both experiments the effect was on the carried object only. Same lab, same paradigm, about 6 trials per cell for the critical condition. |
| LIT-1386 v2 | The Evolution of Crew Resource Management Training in Commercial Aviation | Helmreich, Merritt and Wilhelm (1999). Traces CRM through five generations, from training aimed at captains’ management style and juniors’ assertiveness after accidents such as United 173 to error management: avoiding, trapping and mitigating error. Reports that accident rates cannot validate CRM, that acceptance of its concepts decays over time even with recurrent training, and that it exported poorly to high power-distance cultures. | Active — read in full 2026-10-22 (NOTE-1087) from the authors’ manuscript (UT Austin Human Factors Research Project 235), hosted by the FAA, which funded the work. Worth holding for two reported findings rather than for what the record cited it for: acceptance of CRM concepts slips in the years after training even with recurrent training, and CRM designed in the U.S. fits poorly in high power-distance cultures; and for its statement that accident rates cannot validate CRM. It does not argue that CRM keeps command while opening challenge; that phrasing is the exchange’s. A review with no new data. Registered from the owner’s exchange of 2026-10-22, “Graph Learning Applications”. |
| LIT-1387 v2 | Doorways do not always cause forgetting: a multimodal investigation | McFadyen et al. (2021). Four experiments, in immersive virtual reality with and without a working-memory load, in passive video and in real movement, found no significant effect of doorways on forgetting; under working-memory load, false alarms to mismatched probes rose after a doorway. The authors question the effect’s robustness to small changes of paradigm. | Active — read in full 2026-10-22 (NOTE-1079) from the publisher’s text in PubMed Central (PMC7938580, CC BY 4.0); worth holding as the record’s only test of the doorway effect outside the originating lab: in passive head-mounted VR doorways did not lower hits (Bayes factors 3–6 for the null), under a counting load they raised false alarms to recombined probes, and a curtained hallway, watched or walked, did not affect memory for a 16-item arrangement. Conceptual rather than direct replications: movement was passive and the hallway task was different. Its one positive finding fits the interference account. |
| LIT-1388 v2 | The Political Legacy of American Slavery | Acharya, Blackwell and Sen (2016). White Southerners in counties where slavery was more prevalent in 1860 are today somewhat more Republican, more opposed to affirmative action and more racially resentful, and present-day black population share does not explain it. The difference appeared after Reconstruction rather than before the war, and the authors argue it was amplified by planters’ post-emancipation incentives to repress black labor and votes and then passed down locally, through families and institutions they do not separate. | Active — read in full 2026-10-22 (NOTE-1089) from the journal’s typeset PDF posted by the second author (mattblackwell.org), without the online appendix; worth reading as a careful persistence study: white Southerners in counties with more slavery in 1860 are today somewhat less Democratic, less supportive of affirmative action and more racially resentful (about a tenth of a standard deviation), not accounted for by present black share, and the difference in voting appears after Reconstruction, not before the war (THEORY-889). The association is strong; the causal reading rests on an instrument with an untestable exclusion restriction; the intergenerational transmission is argued with thin evidence. What persists is attitude, not party. |
| LIT-1390 v2 | The Majority Illusion in Social Networks | Lerman, Yan and Wu (2015). Shows that in networks where well-connected nodes share an attribute, many or most nodes can see the attribute among a majority of their neighbours though it is rare overall, a local majority that is a global illusion. | Active — read in full 2026-10-22 (NOTE-1085) from the publisher’s PDF in PLOS ONE (CC BY 4.0); worth reading as the clean statement of a structural route to an apparent majority: when an attribute sits on well-connected nodes, most nodes can see it in a majority of their neighbours though few hold it, more so in disassortative and heavy-tailed networks, and a binomial model predicts how many. It shows what topology permits, not what happens: the attributes are assigned by the authors on every network, real ones included, and no person’s perception, belief or conduct is measured. Its mechanism is degree, not a loud minority, and it is not pluralistic ignorance, though it offers itself as an explanation of it. Filed as THEORY-887. |
| LIT-1391 v2 | The Unspoken Whiteness of Brazilian Jiu-Jitsu: The Gracies versus Luta Livre | Penglase (2025). Argues that Brazilian jiu-jitsu has been positioned as “white” within Brazil’s racial hierarchy, usually implicitly, and that scholars and non-Brazilian practitioners have overlooked this. It focuses on the challenge matches the Gracie family fought against practitioners of luta livre, a Brazilian catch-wrestling style, and shows how those matches located jiu-jitsu in that hierarchy. | Active — read in full 2026-10-22 (NOTE-1092) from the publisher’s open-access PDF at Cardiff University Press (CC BY-NC-ND); worth reading as a documented history of the Gracie–luta livre rivalry from 1931 to 1997, including the negotiation of the 1931 rules in the Gracies’ favour, and as an argument that the matches placed jiu-jitsu in Brazil’s racial hierarchy as white through class, neighbourhood and employment rather than in words. The racial reading is interpretive and rests on secondary and family sources; the paper also says, in its body, that jiu-jitsu became far more profitable than luta livre and lists class and racial position among the causes, without weighing them. |
| LIT-1392 v2 | Walking through doorways causes forgetting: Situation models and experienced space | Radvansky and Copeland (2006). In a desktop virtual environment, people carried objects from room to room; with distance held equal, walking through a doorway rather than across a large room raised errors and slowed recognition for the object being carried, but not for the object just set down. The authors read it as the updating of situation models at a spatial boundary. | Active — read in full 2026-10-22 (NOTE-1083) from the publisher’s free PDF at Springer (bronze open access); worth holding as the origin of the doorway effect and for what it actually found: a doorway, against walking as far within a room, raised errors and slowed answers for the object being carried, and did not affect the object just set down. The decisive experiment has 5 no-shift trials per condition, and the rooms on either side of a doorway also differed in size and wall pattern. Nothing in it concerns intentions; the explanation offered, the effort of updating a situation model, was later dropped by the same lab for interference. |
| LIT-1393 v2 | Report of the Presidential Commission on the Space Shuttle Challenger Accident | Rogers Commission (1986). The presidential commission’s report on the loss of Challenger on 28 January 1986. It traces the O-ring failure to a history of erosion that had been accepted flight by flight, recounts Morton Thiokol’s reversal of its engineers’ recommendation against launch on 27 January “at the urging of Marshall”, and finds the safety, reliability and quality-assurance program ineffective, understaffed and absent from the decision (chapter VII, “The Silent Safety Program”). | Active — skimmed 2026-10-22 (NOTE-1090) from the NASA History Office’s HTML edition of volume 1 (a U.S. government work): chapters V–VIII and the Recommendations in full, chapters III, IV and IX in part, volumes 2–5 not read. Worth holding as the primary source for the Challenger half of THEORY-140: it documents, in 1986, the accepted-erosion trajectory, a launch constraint waived six times without Levels I and II knowing, the deliberate decision not to escalate Thiokol’s objection, a problem record marked “closed” with no correction behind it, and a safety organization subordinate to the offices it checked. Registered from the owner’s exchange of 2026-10-22, “Graph Learning Applications”. |
| LIT-1396 v3 | Hyperstition: An Introduction | Carstens and Land (2009). Land defines the CCRU’s term: “Hyperstition is a positive feedback circuit including culture as a component. It can be defined as the experimental (techno-)science of self-fulfilling prophecies. Superstitions are merely false beliefs, but hyperstitions – by their very existence as ideas – function causally to bring about their own reality.” His example is cyberspace, whose fictional idea drew the investment that made it real; market confidence works the same way, “and inversely”. Under “favorable” circumstances, which he leaves for further investigation, hyperstition can “transmute lies into truths”. | Active — read 2026-10-29 (NOTE-1378) in full, from the Orphan Drift Archive’s page; worth reading as the short, quotable definition of the CCRU’s term by its leading user: a positive feedback circuit through culture, “the experimental (techno-)science of self-fulfilling prophecies”, with cyberspace, market confidence and Jerusalem as examples. Read it knowing that it is an interview of about 850 words, mostly occult and apocalyptic; that Land leaves the conditions under which the loop works “for further investigation”; and that he says a hyperstition can “transmute lies into truths”, so it need not begin as a fiction that is merely not yet true. |
| LIT-1397 v2 | Fallibility, reflexivity, and the human uncertainty principle | Soros (2013). States his theory of reflexivity: participants’ views of a social situation are fallible, and acting on them changes the situation they are views of, through a cognitive function (understanding the situation) and a manipulative one (changing it) that interfere with each other, so that neither has an independent variable. Fallibility and reflexivity together he calls the human uncertainty principle, and he says fallibility is the key source of the Knightian uncertainty of human affairs. Feedback can be negative (self-correcting) or positive (boom–bust). A postscript withdraws the sharp demarcation of social from natural science that the essay argues for. | Active — read 2026-10-29 (NOTE-1362) in full, from the copy on the author’s own site; worth reading as Soros’s fullest short statement of reflexivity: a participant’s view both tracks and changes its situation, so facts stop being an independent test of it, and the loop can run toward the view or away from it. Read it knowing that it is argued from experience and not tested; that it calls fallibility, not reflexivity, the key source of the uncertainty; that its postscript withdraws the sharp line between natural and social science that its middle section is built on; and that the figures are not in the web copy. |
| LIT-1398 v3 | The Self-Fulfilling Prophecy | Merton (1948). Names the self-fulfilling prophecy: a false definition of a situation evokes behaviour that makes the originally false conception come true, and the prophet then cites the course of events as proof that he was right from the beginning. Builds on the Thomas theorem, that situations defined as real are real in their consequences. Applies it to American ethnic and racial prejudice, sets beside it “moral alchemy”, in which the in-group renames the same conduct as virtue in itself and vice in an out-group, and argues that institutional change, not education, breaks the circle. | Active — read 2026-10-29 (NOTE-1409) in full, from a JSTOR download of the article posted on a course wiki (https://entrepreneurscommunicate.pbworks.com/f/Merton.%2BSelf%2BFulfilling%2BProfecy.pdf); worth reading as the essay that names the self-fulfilling prophecy and defines it, and that sets beside it a second route, “moral alchemy”, by which an out-group is condemned whatever it does. Read it knowing that it is a magazine essay on American race relations in 1948, with no references and no sources for its figures, that it sets the self-defeating (“suicidal”) prophecy aside in a footnote, and that two of its three opening examples are forecasts, not false definitions of a present situation. |
| LIT-1402 v2 | The Autobiography of Benjamin Franklin | Franklin (written 1771–1790; first published 1791). The memoir of his life to 1757. Part Three holds the anecdote the Benjamin Franklin effect is named for: to win over a hostile new member of the Pennsylvania Assembly, Franklin asked to borrow a scarce book from his library, returned it with thanks, and the man thereafter spoke to him with civility and “manifested a readiness to serve me on all occasions”. Franklin gives it as “another instance of the truth of an old maxim”, “He that has once done you a kindness will be more ready to do you another, than he whom you yourself have obliged”, and as a lesson in prudence. Around it the memoir is a record of how he got others to act with him: undogmatic speech, projects presented as his friends’, and opinion prepared in print and through the Junto’s satellite clubs. | Active — read 2026-10-29 (NOTE-1360) in full, from Project Gutenberg eBook #148 (Harvard Classics, 1909); worth reading as the source of the Benjamin Franklin effect and, around it, a first-hand manual of influence: modest speech, projects put forward as “a scheme of a number of friends”, opinion prepared in print and spread through the Junto’s clubs “as arising in each of them”. Read it knowing that it is a memoir written decades after the events, for posterity and in part from memory without papers; that the borrowed-book story is one instance of an “old maxim”, given as prudence, with the member unnamed and the effect reported by the man who sought it; and that the edition’s chronology list has errors the memoir itself contradicts. |
| LIT-1404 v2 | A Formal Theory of Reflected Appraisals in the Evolution of Power | Friedkin (2011/2012). A formal theory of how power evolves in a group’s influence network over a sequence of issues. Each issue is settled by the Friedkin–Johnsen process, with members anchored on their initial positions; by “reflected appraisal”, each member’s self-weight on the next issue is set to their share of total control over the last, with relative interpersonal weights fixed. In 50 four-person laboratory groups over five issues, prior control predicts the next self-weight. In simulations of 100,000 random networks, over 98% evolve to a single leader whose preferences control outcomes through intermediaries; the rest end with two. | Active — read 2026-10-29 (NOTE-1374) in full, from the eScholarship deposit of the OnlineFirst version of record; worth reading as the paper that formalizes reflected appraisal as an update of self-weights across issues in the Friedkin–Johnsen model, with a laboratory test of one step and a simulation in which over 98% of random groups evolve to a single leader who controls outcomes through intermediaries. Read it knowing that the end state is shown only in simulation; that the concentration depends on the Friedkin–Johnsen single-issue step, since the same rule under DeGroot consensus (LIT-1146) does not concentrate power on the same networks (re-run 2026-10-29); and that appraisals are assumed accurate. |
| LIT-1405 v3 | How Does Intergroup Contact Reduce Prejudice? Meta-Analytic Tests of Three Mediators | Pettigrew & Tropp (2008). Tests meta-analytically the three most studied mediators of contact’s effect on prejudice, over 54 studies through June 2005: knowledge about the outgroup (17 samples), reduced anxiety about intergroup contact (60) and increased empathy and perspective taking (14). All three mediate (Sobel Z = 3.87, 26.6 and 12.4), but knowledge is much less strong than anxiety reduction and empathy, which in nine samples measuring both together account for about half of the contact–prejudice covariance. | Active — read 2026-10-29 (NOTE-1405) in full, from the published article’s PDF in a University of Washington course’s readings folder (https://courses.washington.edu/pbafhall/563/Readings/pettigrew.pdf); worth reading as the meta-analytic test of how contact reduces prejudice: knowledge of the outgroup, intergroup anxiety and empathy all mediate, knowledge much the most weakly, and anxiety and empathy together carry about half the association. Read it knowing that the mediation is statistical, on pooled correlational data, over a different set of samples for each mediator (17, 60, 14), that empathy and perspective taking could not be separated, and that Table 3 misprints the empathy Sobel statistic (4.38 for 12.43). |
| 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-1407 v2 | Reducing Exclusionary Attitudes through Interpersonal Conversation: Evidence from Three Field Experiments | Kalla & Broockman (2020). Three pre-registered, placebo-controlled field experiments (230 canvassers, 6,869 voters reached, 7 US locations) on attitudes toward unauthorized immigrants and transgender people. In Experiment 1 (2018), a door-to-door conversation with arguments alone had no detectable effect (pooled d = 0.02, p = 0.27), while the otherwise identical, twice as long conversation that added a non-judgmental exchange of narratives reduced exclusionary attitudes (pooled d = 0.08 over surveys from 4 days to about 4.5 months; difference 0.06, p < 0.01). Experiments 2 and 3 replicate on transphobia: d = 0.08 whether or not the canvasser and voter shared their own stories alongside a video narrative, and d = 0.04 by phone. | Active — read 2026-10-29 (NOTE-1396) in full, from the authors’ accepted manuscript on SocArXiv; worth reading as the field experiment that removes the exchange of narratives from an otherwise identical canvass and finds the effect goes with it, and as two replications on transphobia, one with a stranger’s video narrative and one by phone. Read it knowing that the effects are small (pooled d = 0.08 and 0.04) and self-reported, that the argument-only arm is in Experiment 1 alone and was half as long as the full conversation, that “durable” is a pooled effect over waves ending at about 4.5 months whose last wave alone is not significant for prejudice, and that the mechanism is not tested. |
| LIT-1408 v4 | Intergroup Contact Theory | Pettigrew (1998). Reviews Allport’s contact hypothesis (equal status, common goals, cooperation, authority support) and names four problems: selection bias in cross-sectional studies, an expanding list of conditions that are facilitating rather than essential, no account of process, and no account of how effects generalize. Proposes four processes (learning about the outgroup, changed behaviour as the precursor of attitude change, affective ties, and ingroup reappraisal, whose outcome it calls “deprovincialization”), three sequential strategies for generalization (decategorization, salient categorization, recategorization), and a longitudinal contact theory in which Allport’s four conditions and a fifth, friendship potential, are essential and other factors facilitating. In the author’s European surveys the path from outgroup friendship to less prejudice is stronger than the reverse. | Active — read 2026-10-29 (NOTE-1408) in full, from an Annual Reviews PDF of the chapter on Serendip Studio, Bryn Mawr College’s science-education site (https://serendipstudio.org/oneworld/system/files/annurev.psych_.49.1.65-2.pdf); worth reading as the review that turned Allport’s contact hypothesis into a theory with four processes (learning, changed behavior, affective ties, ingroup reappraisal), a staged account of generalization and a fifth condition, friendship potential. Read it knowing that its processes are proposed rather than tested, that its causal evidence is mostly the author’s cross-sectional European surveys, that “deprovincialization” occurs once and rests on one unpublished analysis of national pride, and that its model still treats Allport’s four conditions as essential, which the 2006 meta-analysis (LIT-1413) does not bear out. |
| LIT-1410 v3 | Telling More Than We Can Know: Verbal Reports on Mental Processes | Nisbett & Wilson (1977). Reviews evidence that people may have little or no direct introspective access to higher-order cognitive processes: they can be unaware of a stimulus that influenced a response, of the response, or of the influence. Reports on one’s own processes rest on a priori, implicit causal theories about what plausibly caused what, so they are accurate when the influential stimulus is salient and a plausible cause, and not otherwise. Its test is that observers given only a description of the situation predict the same effects the subjects report. | Active — read 2026-10-29 (NOTE-1412) in full, from a scan of the published article in an MIT course-readings folder (https://web.mit.edu/curhan/www/docs/Articles/15341_Readings/Social_Cognition/Nisbett_Wilson_1977_Telling_more_than_we_can_know.pdf); worth reading as the review, with eight small studies of its own, that people’s reports of why they responded as they did miss effective stimuli and credit ineffective ones, and match what observers predict from a description alone, so that they come from causal theories, not from access to the process. Read it knowing that its situations were chosen to produce error, that several of its own studies are reported briefly or unpublished, that it is about the influence of stimuli on responses, not about attributions of agency, and that it shows only that such access as exists does no better than an observer, not that there is none. |
| LIT-1411 v2 | Theory on Mixture-of-Experts in Continual Learning | Li, Lin, Duan, Liang & Shroff (2024; ICLR 2025). In continual learning of overparameterized linear regression tasks, drawn uniformly from N ground truths each carrying a feature signal a linear gate can read, a top-1 MoE whose gate is trained on a locality loss plus a Switch-style balancing loss sorts identically initialized experts into one set per task (or task cluster) within about M/η rounds. If gate training continues, the balancing loss eventually erases the gaps between gate outputs and routing fails, so the gate is frozen once the gaps settle; forgetting then decays as 1/t, and extra experts only lengthen exploration. Small deep-network runs show the same pattern. | Active — read 2026-10-29 (NOTE-1380), the main paper in full and the experimental appendix, from arXiv v3; worth reading as a solvable model in which identically initialized experts specialize into task sets under a locality loss, and in which a Switch-style balancing loss, left running, erases the gate gaps that encode the specialization, so the gate must be frozen. Read it knowing that the tasks are linear and carry a feature signal that makes routing separable, that task arrival is uniform, that the necessity of termination comes from its own balancing term, and that the proofs (Appendices B–J) were not checked in this reading. |
| LIT-1412 v2 | Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity | Fedus, Zoph & Shazeer (2021; JMLR 2022). Simplifies mixture-of-experts routing to a single expert per token (the Switch Transformer), with a fixed expert capacity and an auxiliary load-balancing loss α·N·Σf_iP_i, and with training techniques (router-local float32, smaller initialization, expert dropout) that allow large sparse models to be trained in bfloat16. At equal FLOPs per token, up to 7x faster pre-training than T5-Base by wall-clock, gains across 101 languages over mT5-Base, and a 1.6-trillion-parameter model about 4x faster than T5-XXL to a fixed perplexity. | Active — read 2026-10-29 (NOTE-1363) in full, from arXiv v3 (the JMLR version); worth reading as the paper that made top-1 expert routing with a fixed capacity and the auxiliary balancing loss α·N·Σf_iP_i the standard for sparse Transformers, with the stability fixes that let it scale to 1.6 trillion parameters at T5’s FLOPs per token. Read it knowing that nearly every comparison is a single run, that it never measures what experts specialize in, that its balancing loss is not minimized only by uniform routing as §2.2 says, and that one quoted margin over T5-XXL (Switch-C’s) is 0.051, not “over 0.061”. |
| LIT-1413 v3 | A Meta-Analytic Test of Intergroup Contact Theory | Pettigrew & Tropp (2006). A meta-analysis of 515 studies (713 independent samples, 250,089 participants, 38 countries, through 2000) finds that intergroup contact typically reduces intergroup prejudice (random-effects r ≈ −.21; 94% of samples negative). Samples without choice of contact show larger effects, and the more rigorous studies larger ones (experiments −.34), though for racial and ethnic targets experiments show no advantage. Five of six publication-bias checks find none; Vevea and Hedges’s model, adjusted, leaves no significant overall effect but a significant one for well-controlled designs. Effects generalize to the whole outgroup and, in few tests, beyond. Allport’s optimal conditions enhance the effect (structured programs −.29 against −.20) but work as a bundle and are not essential to it. | Active — read 2026-10-29 (NOTE-1407) in full, from the published article’s PDF on a University of Pennsylvania Wharton site (https://ideas.wharton.upenn.edu/wp-content/uploads/2018/07/Pettigrew-Tropp.pdf); worth reading as the meta-analysis of 515 studies (713 samples) that established a reliable negative association between face-to-face intergroup contact and prejudice (r ≈ −.21, −.34 in experiments) and showed Allport’s conditions to enhance it without being needed. Read it knowing that most of its samples are cross-sectional surveys of reported contact, that one of its six publication-bias checks (Vevea and Hedges) leaves no significant overall effect, and that the larger effects of rigorous designs come from non-racial targets: for racial and ethnic samples experiments give −.22, the overall mean. |
| LIT-1414 v2 | Auxiliary-Loss-Free Load Balancing Strategy for Mixture-of-Experts | Wang, Gao, Zhao, Sun & Dai (2024). Instead of an auxiliary balancing loss, whose gradients the authors hold interfere with language modelling, Loss-Free Balancing adds a per-expert bias to the routing scores used only for top-K selection and after each batch moves it by u·sign of the expert’s load deviation. On MoE models of 1B and 3B parameters trained on 100B and 200B tokens it gives slightly lower perplexity (9.50 vs 9.56; 7.92 vs 7.97) and much better global balance (maximal violation 0.04 vs 0.72 and 0.52) than an auxiliary loss with α = 0.001, one run each. | Active — read 2026-10-29 (NOTE-1388) in full, from arXiv v1; worth reading as the method that takes load balancing out of the gradient: a per-expert bias, used only to choose the top-K experts and moved by the sign of each expert’s load deviation on the previous batch. Read it knowing that the control responds to how often an expert is used, not to what it contributes, that the evidence is one run per configuration at 1B and 3B with perplexity gains of about 0.05, and that the conclusion’s 300B tokens for the 3B model should be 200B. |
| LIT-1416 v2 | International Friends and Enemies | Kleinman, Liu & Redding (2024; NBER 2020). Asks whether countries that become more economically dependent on a trade partner realign politically toward it. Dependence is the elasticity of a country’s real income to the partner’s productivity, from a constant-elasticity trade model with sectors and input-output links; about 30 percent of pairs are “enemies”, with negative elasticity. Instrumented by a counterfactual Chinese productivity shock (119 countries, 1980–2010) and by the falling cost of air relative to sea transport (country pairs, 1970–2012), greater exposure raises UN voting similarity (0.094 SD per SD in the pair panel), lowers strategic rivalry except ideological rivalry, and raises formal alliances; bilateral trade does not proxy for it. | Active — read 2026-10-29 (NOTE-1403) in full, from NBER’s copy of the working paper as revised in March 2023; worth reading as a measure of economic dependence that is not bilateral trade, the general-equilibrium elasticity of one country’s real income to another’s productivity, and as a causal estimate, from two instruments, that it moves UN voting, strategic rivalry and alliances. Read it knowing that the effect in the pair panel is 0.094 SD per SD of exposure, that the China evidence is one cross-section of 119 countries, that the air-travel exclusion restriction is argued and not tested, that ideological rivalry does not respond, and that the paper’s own model of alignment is strategic. The journal version of 2024 was not seen. |
| LIT-1417 v2 | Failure to Detect Mismatches Between Intention and Outcome in a Simple Decision Task | Johansson, Hall, Sikström & Olsson (2005). 120 participants chose the more attractive of two female faces; on three of 15 trials a card trick handed them the face they had rejected. Only 13% of the 354 swapped trials were detected at the time, at most 26% counting every later form of detection, whatever the faces’ similarity or the time allowed. Reasons given for the rejected face matched reasons for real choices in length, emotionality, specificity and certainty, and some named features only the rejected face had. The authors call this choice blindness. | Active — read 2026-10-29 (NOTE-1398) in full, with its Supporting Online Material, from the authors’ posting of the final published version on the Lund University Cognitive Science site; worth reading as the experiment that catches a person giving reasons for a choice they did not make: 13% of 354 covertly swapped outcomes were noticed at the time, and the reasons given for the swapped face matched reasons for real choices on every measure but one. Read it knowing that it is one low-stakes task (attractiveness of unfamiliar faces), that detection was counted from spontaneous report by design, that the report comparison is a null on eight coded variables, and that it does not show ordinary reasons to be confabulated, which the authors leave open. |
| LIT-1420 v3 | The Contact Hypothesis Re-evaluated | Paluck, Green & Green (2019; preprint 2017). Assembles the 27 intergroup contact studies with random assignment and outcomes measured at least a day later and meta-analyses them. 24 of 27 estimates are positive and the random-effects average is Δ = 0.39 SD, but effects are heterogeneous (I² = 0.85), shrink as precision grows (a study of infinite size is predicted at −0.01), are largest for disability, fall to 0.25 for ethnic, racial, religious and immigrant targets, and average 0.016 in the three pre-registered studies. No study tests interracial or interethnic contact on adults over 25, and none varies Allport’s conditions; the authors conclude these gaps must be filled before the hypothesis can guide policy. | Active — read 2026-10-29 (NOTE-1393) in full, from the publisher’s open-access PDF on Cambridge Core; worth reading as the meta-analysis of the 27 randomized contact studies with delayed outcomes and as the check on Pettigrew and Tropp: a pooled Δ = 0.39 that is heterogeneous, shrinks toward zero with precision, is 0.25 for ethnic, racial, religious and immigrant targets and 0.016 in the three pre-registered trials. Read it knowing that every subgroup rests on a handful of studies, that its precision test is borderline (p = 0.049), and that its supplement, with the p-hacking tests and the excluded studies, was not read here. |
| 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-1425 | Sales Practices Investigation Report | Independent Directors of the Board of Wells Fargo & Company (2017), with Shearman & Sterling. The root cause of the Community Bank’s sales practice failures was “the distortion of the Community Bank’s sales culture and performance management system”, combined with aggressive sales management. A decentralized structure gave Community Bank leaders autonomy, control functions deferred to them, and the board learned only from the September 2016 settlements that about 5,300 employees had been fired for sales practice violations. | Active — read 2026-10-23 (NOTE-1095): in full, all 110 numbered pages and the front matter, from a copy of the bank’s own PDF. Worth reading as the board’s own account of where the harm in the Wells Fargo sales-practices episode came from. It locates the root cause in the Community Bank’s sales model, performance management and pressure, in a decentralized structure that deferred to the business line, and in control functions that saw cases one at a time. It names and sanctions individual leaders too. It is the company’s report on itself, commissioned by its independent directors. |
| LIT-1428 | Psychopathy as a Clinical and Empirical Construct | Hare & Neumann (2008), Annual Review of Clinical Psychology 4:217–246. The PCL-R’s items form four correlated factors, Interpersonal, Affective, Lifestyle and Antisocial, explained by one superordinate factor; psychopathy is dimensional, and no component, affective or antisocial, is more essential than the others. Cleckley’s Clinical Profile, drawn from an unrepresentative sample, should not be the test of the construct. | Active — read 2026-10-23 (NOTE-1094): in full, from the copy Hare posts on his own site. Worth reading as the authors’ own statement of what the construct is, made while defending it against the charge that the PCL-R has “drifted” from Cleckley. The PCL-R’s 20 items fall, 18 of them, into four correlated factors: Interpersonal and Affective (together Factor 1) and Lifestyle and Antisocial (together Factor 2). A single superordinate factor explains them, and the authors hold that no component, the affective one included, is more essential than the others. That is the sharpest constraint the record has on borrowing only the affective features of psychopathy for a corporation. Hare receives royalties from the PCL-R. |
| LIT-1434 | The power of goal-directed processes in the causation of emotional and other actions | Moors, Boddez & De Houwer (2017), Emotion Review 9(4):310–318. Standard dual-process models make stimulus-driven processes the default and give goal-directed ones a late, regulatory role, in action research and in emotion research alike. The authors reverse the default. Goal-directed processes, which select the action option with the highest expected utility, can be fast and automatic too, so most of the competition that decides behaviour is between goal-directed processes, settled by the values and expectancies of outcomes. Emotional action tendencies can be caused this way. Appraisal-to-action-tendency links are sophisticated stimulus-driven processes. Evidence for stimulus-driven control rests on null results open to hidden goals. | Active — read 2026-10-23 (NOTE-1117): in full, from the submitted manuscript deposited in Ghent University’s repository. Worth reading as the shortest statement of Moors’s goal-directed account of emotional action, and as the nearest prior statement of the record’s reading of appraisal as negotiation. Goal-directed processes, which weigh the utility of action options by the values and expectancies of their outcomes, are the default cause of action, emotional action included. Most of the competition that decides behaviour is between goal-directed processes, and its winner is fixed by values and expectancies. Control precedence is what high goal relevance produces, so an emotional episode is a decision process with higher stakes. The competition is run on a common currency, expected utility, which is the point where the record parts from it. |
| LIT-1435 | Theory of Value: An Axiomatic Analysis of Economic Equilibrium | Debreu (1959), Theory of Value, Cowles Foundation Monograph 17, Wiley. The axiomatic theory of general equilibrium: commodities and prices, producers, consumers, equilibrium, optimum and uncertainty. Read only for §4.6 and its notes. There a continuous complete preorder on a connected separable space is proved to have a continuous utility function. The lexicographic ordering of R² is shown to have none. | Active — read in part 2026-10-23 (NOTE-1112): §4.6, “Continuity assumption on preferences” (pp. 55–59), and the notes to chapter 4 (pp. 72–73), from the PDF the Cowles Foundation posts as Monograph 17. Worth reading for Debreu’s own statement of the utility representation theorem and its limits. A complete preorder on a connected subset of Rˡ (more generally, a connected separable space) with closed upper and lower contour sets has a continuous utility function. The lexicographic ordering of R² has no real-valued representation at all. A utility function is “arbitrary to a large extent”. The rest of the book (commodities, producers, equilibrium, optimum, uncertainty) was not read. |
| LIT-1436 | Toward an integrative psychometric model of emotions | Lange, Dalege, Borsboom, van Kleef & Fischer (2020), Perspectives on Psychological Science 15(2):444–468. An integrative psychometric model of emotions must allow distinct emotions (affect-program theories), variation between and within persons (constructionist theories) and causal relations among components (appraisal theories). Reflective and formative latent-variable models do not; a psychometric network model, in which “the network constitutes the emotion”, does. Distinct emotions are weakly emergent small-world communities of components. Strongly connected networks sustain their own activation, which predicts hysteresis and longer emotions. | Active — read 2026-10-23 (NOTE-1098): in part, from the published version (CC BY-NC) deposited in the University of Amsterdam’s repository. Worth reading as the proposal that an emotion is a network of causally interacting components, the move Borsboom made for mental disorders (LIT-547) applied to emotion. Affect-program, constructionist and appraisal theories each demand one property: distinct emotions, variation between and within persons, and causal relations among components. Reflective and formative latent-variable models fail at least one. A network model meets all three, with a distinct emotion as a weakly emergent small-world community. Strong connectivity predicts self-sustaining activation and hysteresis, so longer emotions. The persistence it gives is a network state’s, not an ordering’s, and the model is unsigned. |
| LIT-1438 v2 | The current status of research on the structure of evaluative space | Norris, Gollan, Berntson & Cacioppo (2010), Biological Psychology 84(3):422–436. A review of the evaluative space model. The affect system has separable positive and negative channels whose joint output is a bipolar predisposition to approach or avoid. They can be activated reciprocally, independently or together. Coactivation, simultaneous or by fast oscillation, is ambivalence, rare and arousing. Asymmetric activation functions give a negativity bias and a positivity offset, and recalibrate with context. Levels of the neuraxis can override one another. Clinical implications for depression and anxiety. | Active — read 2026-10-23 (NOTE-1101): in full, from the NIH author manuscript in PubMed Central (PMC2894997, NIHMS165251). Worth reading as the evaluative space model’s own later summary, written with Berntson and Cacioppo. Positivity and negativity are separable systems, whose combined output is a bipolar predisposition to approach or withdraw. They can be activated reciprocally, independently or together, and coactivation is ambivalence. Ambivalence and neutrality give the same middling output from different underlying states. Negativity has the higher gain and positivity the higher intercept. It stands in for the unread 1994 and 1997 papers (LIT-1453, LIT-1456). |
| LIT-1439 | Statistical ranking and combinatorial Hodge theory | Jiang, Lim, Yao & Ye (2011), Mathematical Programming 127:203–244. HodgeRank: an edge flow of aggregated pairwise comparisons splits orthogonally into a gradient flow, whose potential is the least-squares global ranking (a Borda count generalized to incomplete data), and a cyclic residual, which splits into curl (local) and harmonic (global) inconsistency (Theorems 4.8, 5.1). The residual’s share, the “cyclicity ratio”, certifies the ranking. | Active — read 2026-10-23 (NOTE-1099): in full, from arXiv 0811.1067v2 (42 pp.). HodgeRank. Pairwise comparisons, aggregated into a weighted edge flow on the graph of alternatives, decompose orthogonally into a gradient flow, the l2-best global ranking found by weighted least squares, and a divergence-free residual. The residual splits into curl (local, triangular inconsistency) and harmonic (global inconsistency) parts. Binary win/loss data enter as averaged signs, and on complete balanced binary data the ranking is Borda’s. The decomposition is cardinal: curl-freeness is stronger than transitivity. It is the tool for reading the record’s conflict record. |
| LIT-1440 | Induction and Profiling of Strong Multi-Componential Emotions in Virtual Reality | Meuleman & Rudrauf (2021), IEEE Trans. Affective Computing 12:189–202 (online 2018). Passive induction yields weak emotions that do not engage all components, so componential hypotheses cannot be tested with it. In VR, 53 participants played seven games (154 balanced observations) and rated componential items after each. Item clustering gave fear and joy clusters spanning appraisal, motivation, physiology, feeling and regulation. Appraisal predicted fear and joy intensity best. Game differences in fear were absorbed by appraisal and regulation, subject differences in joy were not. | Active — read 2026-10-23 (NOTE-1097): in full, from the authors’ accepted manuscript in the Archive ouverte UNIGE (unige:112041). Worth reading as an argument, with data, that passive induction (pictures, film) cannot test componential hypotheses such as synchronization, because it does not engage all components, and that virtual reality can. 53 participants played seven commercial VR games and rated appraisal, motivation, physiology, feeling and regulation items after each. Clustering found multi-componential fear and joy patterns, and appraisal items predicted fear and joy intensity best. Componentiality is assessed across observations, one retrospective self-report per game. Nothing is measured within an episode, and there is no synchronization index. |
| LIT-1442 | Flows and Decompositions of Games: Harmonic and Potential Games | Candogan, Menache, Ozdaglar & Parrilo (2011), Mathematics of Operations Research 36:474–503. The space of finite games is a direct sum P ⊕ H ⊕ N of potential, harmonic and nonstrategic subspaces (Theorem 4.1), pulled back from the Helmholtz decomposition of the game graph’s flow of unilateral payoff differences. Potential games are P ⊕ N (Theorem 5.1). Harmonic games, such as rock–paper–scissors, generically have no pure equilibrium, and the closest potential game is given in closed form under a weighted l2 norm (Theorem 6.2). | Active — read 2026-10-23 (NOTE-1116): in full, from arXiv 1005.2405v2 (45 pp.). Every finite game in strategic form splits uniquely into a potential, a harmonic and a nonstrategic component. The split pulls back the Helmholtz decomposition of the flow of unilateral payoff differences on the game graph. Potential games are exactly the games with no harmonic component. Harmonic games generically have no pure equilibrium. The nearest potential game, in a weighted l2 norm, is given in closed form. It is the paper behind the record’s measure of a potential’s share of a negotiation, and it shows that the share is cardinal. |
| LIT-1443 | A Multi-Componential Approach to Emotion Recognition and the Effect of Personality | Mohammadi & Vuilleumier (2022), IEEE Trans. Affective Computing 13:1127–1139 (online 2020). Crowdworkers rated 39 CoreGRID items and 10 discrete emotions after watching film clips (1,567 surveys, 99 clips). Clustering of emotion profiles in componential space separates positive from negative, then five clusters. PCA gives six dimensions beyond valence and arousal. Ordinal regression on all components predicts discrete-emotion ratings best; no single component suffices. Personality correlates more with componential items than with feelings or discrete emotions. | Active — read 2026-10-23 (NOTE-1118): in full, from the authors’ arXiv preprint (2010.11370v1, October 2020). Worth reading only as the behavioural groundwork for the later fMRI study (LIT-1444). Crowdworkers rated 39 CoreGRID items and 10 discrete emotions after whole film clips (1,567 surveys, 99 clips). Six principal components emerged (action tendency, pleasant feeling, novelty, norms, arousal, goal relevance). Ordinal regression from all components predicted discrete-emotion ratings better than any single component. Personality traits correlated with componential items more than with feelings. It does not mention synchronization and measures nothing within an episode. |
| LIT-1444 | Brain networks subserving functional core processes of emotions identified with componential modeling | Mohammadi, Van De Ville & Vuilleumier (2023), Cerebral Cortex 33:7993–8010. Twenty participants watched 40 film clips during fMRI and rated 119 salient events (12 s each) on 32 CoreGRID features, and heart and respiration rate were recorded. Partial least squares correlation between event-wise brain maps and feature ratings yields six latent variables, the “functional core processes”: valuation (wanting-like), novelty, hedonic impact (liking-like), goal monitoring, caring for others (“being moved”) and approach/avoidance. No arousal process emerges, and the processes mix components rather than mapping one to one. | Active — read 2026-10-23 (NOTE-1107): in full, from the published version (CC BY 4.0) in the Archive ouverte UNIGE (unige:170302). Worth reading as the first attempt to recover the component process model’s components from brain and behaviour together. Twenty participants watched 40 film clips during fMRI and then rated 119 salient 12-second events on 32 CoreGRID features. Heart and respiration rate were recorded. Partial least squares correlation found six brain–behaviour latent variables, read as valuation, novelty, hedonic impact, goal monitoring, caring for others and approach/avoidance. For the record, the result is two distinct valence-like networks: a “wanting”-like valuation process and a “liking”-like hedonic one. Each event gets a feature vector, but no within-episode synchronization is computed. |
| LIT-1447 | EMA: A process model of appraisal dynamics | Marsella & Gratch (2009), Cognitive Systems Research 10(1):70–90. EMA (EMotion and Adaptation), after Smith and Lazarus. Appraisal is one fast, parallel, automatic process over the agent’s causal interpretation, a decision-theoretic plan representation of its beliefs, desires, intentions and plans. Emotional dynamics come from the time course of the perception, inference and action that change that interpretation, so no multi-level appraisal is needed. Each proposition gets an appraisal frame. Frames compete for coping, and the most recently accessed one with the highest mood-adjusted intensity wins. Coping changes the world or the agent’s beliefs, desires and intentions, which drives reappraisal. Illustrated with an actor’s reaction to a pigeon. | Active — read 2026-10-23 (NOTE-1100): in full, from the published version on a University of Kentucky course reading list, checked against the authors’ manuscript on Gratch’s USC page. Worth reading as the worked computational case of appraisal as a continuous process over the agent’s causal interpretation, with an explicit arbitration rule. Appraisal is a single, fast, parallel mapping from that interpretation to appraisal variables. Its dynamics come from the slower perception, inference and action that change the interpretation, and from coping, which alters beliefs, desires and intentions and so drives reappraisal. Appraisal frames, one per proposition, compete for the coping response. The winner is the most recently accessed frame with the highest mood-adjusted intensity, and intensity is a decision-theoretic product of likelihood and utility. That is arbitration on a common currency among concerns, not a negotiation among perspectives. |
| LIT-1448 | Back to Bentham? Explorations of Experienced Utility | Kahneman, Wakker & Sarin (1997), Quarterly Journal of Economics 112(2):375–405. “Utility” has two meanings: decision utility, an outcome’s weight in choice, and experienced utility, its hedonic quality. Experienced utility is instant (the pleasure or distress of the moment, reported in real time) or remembered (a retrospective evaluation). Remembered utility follows the Peak-End average and neglects duration. Choices follow remembered utility, so subjects repeat a longer cold-water trial that dominates the shorter one in pain. Axioms on ordinal instant utility with a neutral zero make total utility the time integral of a value transform. | Active — read 2026-10-23 (NOTE-1105): in full, from the published article as deposited in Erasmus University Rotterdam’s repository (RePub, hdl 1765/23011). Distinguishes decision utility (an outcome’s weight in choice) from experienced utility (hedonic quality). Experienced utility divides into instant utility, reported in real time, and remembered utility, a retrospective evaluation. Remembered utility follows a Peak-End rule and neglects duration. Choices follow remembered utility, so people choose dominated, longer painful episodes. Axioms on ordinal instant utility with a neutral zero yield total utility as a time integral. Filed for the record’s three-layer operationalization of felt valence (CLAIM-440). |
| LIT-1449 | Control Theory, Goal Attainment, and Psychopathology | Carver (2018), Psychological Inquiry 29(3):139–144, a commentary on DeYoung and Krueger. Problems arise wherever a feedback loop’s input, reference value, comparison or output is extreme or biased. The five factors are read as sensitivities to classes of goals, not as loop parameters. Valence tracks the velocity of goal attainment against a reference value, so approach and avoidance can each yield either sign. Doubt and disengagement sit outside the loop itself. | Active — read 2026-10-23 (NOTE-1102): in full, from the NIH author manuscript in PubMed Central (PMC6707771, NIHMS1512534). A short commentary on DeYoung and Krueger’s cybernetic theory of psychopathology, and the nearest lawful first-hand statement found of Carver and Scheier’s control-process account of affect. Valence is read off the velocity of goal attainment against a reference value. An approach system and an avoidance system can each produce either sign. Many goals are in play at once, and their priorities are juggled. It stands in for the unread 1990 paper (LIT-1441). |
| 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-1452 | Conscious emotional experience emerges as a function of multilevel, appraisal-driven response synchronization | Grandjean, Sander & Scherer (2008), Consciousness and Cognition 17(2):484–495. Componential appraisal models explain feelings better than basic-emotion or dimensional models. Appraisal runs in parallel at sensory-motor, schematic and conceptual levels and stops at the first conclusive result. Consciousness of an emotion emerges when lower levels cannot cope, especially when component synchronization reaches a critical level and duration, so that conscious, representational regulation is required. Conscious feeling needs, besides component synchronization, local and distant neuronal synchronization that integrates the components’ representations. | Active — read 2026-10-23 (NOTE-1115): in full, from the copy the authors’ laboratory (the Geneva E3 Lab) posts on its publications page. Worth reading as the component process model’s fullest account of when emotion becomes conscious. Appraisal runs in parallel at several levels and stops when a lower level reaches a conclusive result. Consciousness is recruited when it does not: when component synchronization reaches a critical level and duration that cannot be regulated automatically, so that higher-level regulation, which needs explicit representations, must take over. The feeling is a central representation built by neuronal synchronization, local and distant. Its measures are EEG gamma and beta activity in felt versus unfelt episodes, and phase coherence between brain regions. It partly rivals and partly supports the record’s self-model condition for felt valence (CLAIM-439). |
| 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-1457 | The Emotion Process: Event Appraisal and Component Differentiation | Scherer & Moors (2019), Annual Review of Psychology 70:719–745. A review of experimental evidence on the emotion process, organised by five appraisal criteria (novelty, intrinsic and extrinsic valence, agency, control or power, fairness) and three paths from appraisal: to action tendencies, to physiological responses and to facial, vocal and gestural expression. Appraisal criteria have more stable response correlates than emotion categories do. Proposes that coherence among components above a threshold marks an episode, and above a second threshold awareness. | Active — read 2026-10-23 (NOTE-1106): in full, from the PDF Annual Reviews serves to guest readers. Worth reading as the latest review of the component process model’s evidence, organised by appraisal criterion rather than by emotion category. Its paths run from appraisal to action tendencies, to physiological responses and to expression. It separates intrinsic valence from goal congruence and reports the few studies that pull them apart: they have partly different physiological signatures and combine multiplicatively. It ends with a two-threshold proposal: coherence among components above one threshold starts an episode, and above a second it becomes aware. It does not describe appraisal as a negotiation among perspectives. |
| LIT-1458 | Levels of valence | Shuman, Sander & Scherer (2013), Frontiers in Psychology 4:261. Valence exists at two levels. Micro-valences are the valenced outcomes of separate appraisal checks (pleasantness, goal conduciveness, power, self-congruence, moral goodness), and they can conflict, which explains mixed feelings. Macro-valence is one-dimensional, always present, and the common currency for choice. It is integrated from micro-valences and other inputs by rules ranging from weighted sums to lexicographic and elimination-by-aspects strategies. Intrinsic pleasantness and goal conduciveness are dissociable, citing Berridge. | Active — read 2026-10-23 (NOTE-1108): in full, from the publisher’s open-access PDF (Frontiers, CC licence). Worth reading as the component process model’s own statement that valence is several things. Five appraisal checks are each valenced (pleasantness, goal conduciveness, power, self-congruence, moral goodness), and these “micro-valences” are integrated, by weighted sums or by lexicographic and elimination rules, into a one-dimensional “macro-valence” that serves as the common currency for choice. It separates intrinsic pleasantness from goal conduciveness and grounds the split in Berridge. It bears directly on the objection that the record’s potential account tracks ‘wanting’, not ‘liking’ (CLAIM-438). |
| LIT-1459 | Pleasure systems in the brain | Berridge & Kringelbach (2015), Neuron 86(3):646–664. Reward is three separable components: ‘liking’ (hedonic impact), ‘wanting’ (incentive salience) and learning. ‘Liking’ can be measured without report, by orofacial taste reactivity, which is homologous from rats to human infants. It is generated by cubic-millimetre opioid and endocannabinoid hotspots in nucleus accumbens, ventral pallidum and perhaps cortex and pons. Mesolimbic dopamine and most “pleasure electrodes” raise ‘wanting’ without raising ‘liking’. Incentive sensitization makes an addict want a drug that has become less pleasant. Objective ‘liking’ can occur without any felt pleasure. | Active — read 2026-10-23 (NOTE-1110): in full, from the NIH author manuscript in PubMed Central (PMC4425246, NIHMS664561). A review of the affective neuroscience of pleasure. Reward splits into ‘liking’ (hedonic impact), ‘wanting’ (incentive salience) and learning, with separable mechanisms. ‘Liking’ is measured without report by taste reactivity, which is homologous across rats, apes and newborn humans. It is generated by small opioid and endocannabinoid hotspots. Mesolimbic dopamine and most “pleasure electrodes” raise ‘wanting’ without raising ‘liking’. Objective ‘liking’ can occur without felt pleasure. Filed for the record’s account of valence as potential (CLAIM-440), which wanting-without-liking puts under pressure. |
| LIT-1461 | Liking, wanting, and the incentive-sensitization theory of addiction | Berridge & Robinson (2016), American Psychologist 71(8):670–679. ‘Wanting’ (incentive salience, mesolimbic and dopamine-related) and ‘liking’ (hedonic impact, small opioid and endocannabinoid hotspots) are dissociable. Repeated, especially intermittent high-dose, drug use can sensitize the ‘wanting’ system, making it hyper-reactive to drug cues and contexts, lastingly and perhaps permanently, while ‘liking’ need not rise and may fall. Sensitized ‘wanting’ can oppose cognitive desire, run without report, and grow during abstinence. Its scope is said to extend, on emerging evidence, to behavioural addictions and to the compulsions of dopamine dysregulation syndrome. | Active — read 2026-10-23 (NOTE-1109): in full, from the NIH author manuscript in PubMed Central (PMC5171207, NIHMS816820). Worth reading as the authors’ own short statement, a quarter-century on, of the incentive-sensitization theory of addiction. Drugs, and perhaps unpredictable non-drug rewards, can make mesolimbic ‘wanting’ systems lastingly hyper-reactive to cues and contexts, and ‘liking’ need not rise with it. Sensitized ‘wanting’ can oppose a person’s cognitive desire, operate without report, persist for years and grow during abstinence. It is a review of the authors’ programme. Filed for the record’s question whether potential of a proxy for maintenance is valence, and the form addiction and metric fixation share (QUESTION-267), to which it gives a mechanism on the personal side. |
| LIT-1463 | Interaction and threshold effects of appraisal on componential patterns of emotion: A study using cross-cultural semantic data | Meuleman, Moors, Fontaine, Renaud & Scherer (2019), Emotion 19:425–442. Re-analyses the GRID cross-cultural data on the meaning of 24 emotion words (34 samples, 27 countries) to test whether appraisal acts on motivation, physiology and expression through interactions and nonlinear effects. PCA reduces items to 7 appraisal and 11 response factors. Multivariate adaptive regression splines (MARS) select third-order interactions and hinges. Goal compatibility is the main effect, agency and norm compatibility pure modifiers. The strong hierarchy of appraisal decision trees is not found. Simulated patterns matched to words form a coherent map. | Active — read 2026-10-23 (NOTE-1104): in full, from the authors’ accepted manuscript in Ghent University’s repository (biblio.ugent.be 8560097). Worth reading as the one study here that tests whether appraisal acts on the other emotion components linearly. It re-analyses the GRID data, culturally shared semantic profiles of 24 emotion words rated in 34 samples from 27 countries. It fits multivariate adaptive regression splines from seven appraisal factors to eleven motivation, physiology and expression factors. Goal compatibility is the main effect. Agency and norm compatibility act only in interactions, and some responses need splines. Its “threshold effects” are hinges in a continuous piecewise-linear fit. The data are word meanings, not episodes, and have no time, so they cannot bear on continuity or hysteresis in choice. |
| LIT-1465 | A taxonomy of technology design features that promote potentially addictive online behaviours | Flayelle, Brevers, King, Maurage, Perales & Billieux (2023), Nature Reviews Psychology 2(3):136–150. Reviews evidence linking design features to loss of control in online gaming, gambling, cybersexual activity, shopping, social networking and streaming. Proposes a taxonomy based on model-free and model-based learning and control. Model-free: reinforcement schedules (random-ratio rewards such as loot boxes and likes) and personalized triggers (push notifications, recommendations). Model-based: overvaluation of outcomes, features that interfere with deliberation (autoplay, countdowns), partial goal fulfilment (infinite scroll, levels, progress bars) and features that strengthen cognitive biases (near-misses, losses disguised as wins). Providers keep whatever raises use or revenue, and informational asymmetry lets them personalize it. | Active — read 2026-10-23 (NOTE-1096): in full, from the typeset article as deposited in the University of Lausanne’s repository (SERVAL/IRIS). Worth reading as a compact, theory-driven catalogue of the design features of games, gambling, pornography, shopping, social-networking and streaming services that may weaken users’ control. Features are sorted by whether they work on model-free learning (reinforcement schedules, personalized cues) or on model-based choice (overvaluation, features that interfere with deliberation, partial goal fulfilment, cognitive biases). It also names the selection process on the provider’s side: features that raise use, time-on-device or spending are kept, with no psychology needed. The evidence reviewed is mostly cross-sectional, qualitative or indirect, and the authors warn against pathologizing common behaviour. Filed for the record’s question whether potential of a proxy is valence (QUESTION-267), because it describes how a firm optimizing its own metric can install proxy-keyed potential in its users. |
| LIT-1466 | Motivational trade-offs and modulation of nociception in bumblebees | Gibbons, Versace, Crump, Baran & Chittka (2022), PNAS 119(31). Bumblebees chose between two 40% sucrose feeders, heated to 55 °C in the test phase, and two unheated alternatives of 10–40%. They avoided the heated feeders when the alternatives were also rich and fed from them more as the alternatives got poorer, guided by learned colour cues. The authors read this as a centrally mediated motivational trade-off, consistent with a capacity for pain. Corrected in 2025 for a misreported model. | Active — read 2026-10-23 (NOTE-1114): in full, from the published version (CC BY 4.0) in LSE Research Online, with the 2025 correction and the authors’ deposited data. Worth reading as the cleanest published motivational trade-off in an insect. Bees chose between heated (55 °C) and unheated feeders. They took the heated, high-sucrose feeders less as the unheated alternative got sweeter, and more steeply than when nothing was heated. The trade-off relied on learned colour cues, so it is central. At this one cost the data are graded, not thresholded, and the design varies only the resource, so it cannot show a threshold in cost. |
| LIT-1468 | Deeply Felt Affect: The Emergence of Valence in Deep Active Inference | Hesp, Smith, Parr, Allen, Friston & Ramstead (2021), Neural Computation 33(2):398–446. Valence is a state of self, inferred at a hierarchically deeper level from changes in the expected precision γ of one’s action model, which weights preference-driven expected free energy against a habitual prior in policy selection. The update to γ, affective charge, is positive when outcomes raise confidence in the action model and negative when they lower it. The valence level sends priors on γ back down. A simulated rat in a T-maze with context reversal infers negative and then positive valence, and adapts better than an agent without that level. | Active — read 2026-10-23 (NOTE-1111): in full, from the publisher’s CC BY PDF as deposited in Aarhus University’s repository (pure.au.dk), checked against the University of Amsterdam deposit. A deep active-inference model of valence. A precision term γ sets how far the agent’s preference-driven action model, rather than a habitual prior, governs policy selection. Its update, “affective charge”, is positive when outcomes raise confidence in the action model and negative when they lower it. A second, slower level infers a binary valence state from affective charge and sends priors on γ back down. Simulated in a T-maze with reversal, the agent with the valence level adapts faster than one without it. “Felt” means explicitly represented, which the authors take as necessary for self-reportable experience of valence. Filed for the record’s candidate that a valence regime is felt when the system models its own potential (CLAIM-440). |
| LIT-1471 | An Appraisal-Driven Componential Approach to the Emotional Brain | Sander, Grandjean & Scherer (2018), Emotion Review 10:219–231. A perspective article. Major emotion theories agree that emotion has five components, so the emotional brain should be studied as five functionally defined networks: elicitation (appraisal), expression, autonomic reaction, action tendency and feeling. Appraisal drives the changes and the synchronization in the other four. Synchronization is proposed to be neuronal phase or cross-frequency coupling within and between components, and feeling to emerge when it passes a threshold. No measure is given and no data are reported. | Active — read 2026-10-23 (NOTE-1103): in full, from the published version deposited in the Archive ouverte UNIGE (unige:109591). Worth reading as the Geneva group’s programme statement for taking the component process model into the brain. It splits the emotional brain into five functionally defined networks (elicitation, expression, autonomic reaction, action tendency, feeling). It proposes that component synchronization is neuronal phase or cross-frequency synchronization, within and between components, and repeats Scherer’s hypothesis that feeling arises when the degree of synchronization passes a threshold. It names control precedence as priority among action tendencies. It gives no measure of synchronization and reports no data of its own. |
| LIT-1473 v2 | Unconstitutional States of Emergency | Bjørnskov, Voigt & Khesali (2022; working paper 2021). Asks when governments under a state of emergency deviate from their constitution’s emergency provisions, through unlawful declaration, non-compliance during the emergency, or prolonging it beyond its limit. Of 853 emergency declarations in a new dataset, 115 are unlawful. Political turmoil is likelier than natural disaster to be followed by an unlawful emergency, and autocracies likelier than democracies; among 97 responses to domestic events, bicameral systems, recessions and constitutions allowing more grounds for emergency raise the risk. | Active — read in full 2026-10-24 (NOTE-1125) from the August 2021 ILE working paper, not the version of record; worth reading as the first cross-national count of states of emergency coded for lawfulness. Of 853 national SOEs, 1949–2017, 115 were reported unlawful, 97 of them after political turmoil and 14 after natural disasters; unlawful ones lasted 321 days on average against 115. Coding by news and NGO reports (“suspected to be unlawful”, the authors’ gloss), weak logits, and no data on whether emergency measures outlive the emergency. Several statements in the abstract and conclusion outrun the tables. |
| LIT-1476 v3 | Active inference and learning | Friston, FitzGerald, Rigoli, Schwartenbeck, O’Doherty & Pezzulo (2016). An active inference account of choice and learning, on how goal-directed and habitual behaviour contextualise each other. Habits emerge naturally from sequential policy optimisation in agents equipped with state-action policies, as learned prior beliefs over policies; epistemic, ambiguity-resolving behaviour enables pragmatic behaviour and then habit. The important distinction is between belief-free and belief-based schemes, not model-free and model-based; the scheme covers dopamine transfer, reversal learning, habit formation and devaluation, and reduces to a Bellman scheme without ambiguity. | Active — read in full 2026-10-24 (NOTE-1138) from the CC BY version of record; worth reading as the active inference account in which a habit is one more policy, its transitions and prior probability learned by counting the agent’s own behaviour, so that habits form from goal-directed choice and, once formed, survive devaluation. It gives the record a published analogue of a learned log prior beside a precision-weighted evaluation. Simulation of one T-maze task only; its learned prior grows by frequency, not by reward, its reaction times are simulation run times, and the authors concede that it makes probably no new behavioural predictions. |
| LIT-1477 v3 | A systematic review of human avoidance learning: Cognition, computation, and methods | Mancinelli & Bach (2026; preprint 2025). A systematic review of 116 studies of avoidance learning in healthy humans with primary reinforcers, analysed for the phenomena a theory must explain and their power to tell theories apart. The evidence contradicts two-factor and other associative theories and favours expectancy and inference-based accounts, though residual avoidance after the outcome is visibly removed contradicts a purely inferential one. An available avoidance response protects threat expectancy from extinction, more so the more effective it is. The common paradigms are simpler than real-world avoidance, so tasks with larger computational demands and more action options are needed. | Active — read in full 2026-10-24 (NOTE-1134) from the PsyArXiv preprint, not the closed version of record; worth reading as the only systematic map of human avoidance learning, and for the finding, rated robust, that an available avoidance response protects threat expectancy from extinction, the more so the more effective it is. Avoidance is learned without ending the warning signal and transfers by inference, against two-factor theory; but some avoidance survives visible removal of the outcome, against a purely inferential account. Healthy volunteers with shock or noise only; nothing here is about anxiety disorders. |
| LIT-1478 v2 | Routines die hard: Ontological security and audience agency in securitisation | Ku & Finch (2024). Alongside the political agency the Copenhagen School grants a securitising audience, drawing on Giddens they propose ontological agency: control over the stability of one’s everyday routines, exercised to minimise disruption by securitisation. Because routines bracket anxiety, people may ignore securitising moves and emergency measures that would undermine ontological security. Unstructured observations of South Koreans’ responses to military practices securitising North Korea show latent anxiety, ranging from inaction while routines are undisturbed to emotional outbursts when they are disrupted. | Active — read in full 2026-10-24 (NOTE-1133) from the CC BY version of record; worth reading for the concept of ontological agency, an audience’s maintenance of its routines, which often means ignoring securitisation rather than accepting or contesting it. Its South Korean illustration is chance observation of routine missile launches ignored in Gangneung, and tweets of fear and blame after a malfunction under a news embargo. The authors read the inaction as coping that lets securitisation reproduce itself, with anxiety latent and its management delegated to elites, not as resistance to the security narrative. |
| LIT-1479 v3 | Anxiety as a disorder of uncertainty: implications for understanding maladaptive anxiety, anxious avoidance, and exposure therapy | Brown, Price & Dombrovski (2023; preprint 2022). A narrative review and proposal, with no new data or model run. Cognitive-behavioural accounts put exaggerated threat expectancy behind maladaptive anxiety, but the learning literature (seven computational studies, chosen without a systematic search) fits better a disorder of uncertainty learning: altered adjustment of learning rate to noise and volatility, mostly for aversive outcomes. They propose that in aversive settings avoidance of uncertain states keeps their uncertainty high and so perpetuates itself, that anxiety feeds this by misreading noise as change, and that exposure therapy works by reducing the uncertainty. For fear-based disorders, not GAD. | Active — read in full 2026-10-24 (NOTE-1120) from the NIH author manuscript in PubMed Central, not the typeset version of record; worth reading as the clearest statement that anxious avoidance can be kept going by uncertainty that avoidance itself leaves unreduced, with no excess of learned threat needed. A narrative review and proposal: seven computational studies, chosen without a systematic search, show altered adjustment of learning rate to uncertainty, mostly for aversive outcomes; the avoidance loop and the account of exposure are argued in words and schematic figures, not modelled or tested. For fear-based disorders; by the authors’ statement it does not explain GAD. |
| LIT-1480 v2 | Skills‐homework completion and phone coaching as predictors of therapeutic change and outcomes in completers of a DBT intensive outpatient programme | Edwards, Kober, Rinne, Griffin, Axelrod & Cooney (2021). Medical records and diary cards of 56 of 88 patients in a DBT intensive outpatient programme, those who completed a four-month cycle and gave enough diary data, were coded for skills homework completed and phone-coaching calls. Homework completion correlated with larger falls in suicide and substance-use urges, and coaching with a larger fall in self-harm urges; neither with change in how often the behaviours occurred. Patients free of target behaviours in the final month had completed more homework; the coaching difference was not significant. The authors read both as active ingredients of DBT through generalization. | Active — read in full 2026-10-24 (NOTE-1121) from the version of record posted on the Yale lab site of the second author; worth reading as the first study to relate DBT skills homework and phone coaching to outcome, and for how little it can show. In a chart review of 56 of 88 patients in one intensive outpatient programme, homework completion went with larger falls in suicide and substance-use urges and coaching with a larger fall in self-harm urges (r of .31 to .37), neither with change in how often the behaviours occurred, and only homework with being free of them in month 4. Correlational, selected for completed cycles and adequate diary data, uncorrected for multiple comparisons, with no measure of skill use; the abstract states more than the results. |
| LIT-1482 v2 | A Theory of the Evolution of Social Power: Natural Trajectories of Interpersonal Influence Systems along Issue Sequences | Friedkin, Jia & Bullo (2016). Extends the single-issue opinion dynamics of small deliberative groups to dynamics along a sequence of issues: elementary reflected-appraisal mechanisms modify the influence network and the flows of influence, and the theory predicts how influence centralities evolve from issue to issue. New experimental findings from groups discussing issue sequences show issue-sequence effects on influence-network structure consistent with the predictions. | Active — read in full 2026-10-24 (NOTE-1126) from the CC BY version of record and its online supplement; worth reading as the first experiment long enough (30 groups of four, 15 issues each) to look for social power evolving along an issue sequence. A member’s self-reported closure on the next issue rose with their prior influence, and influence networks thinned and discussions shortened, while the rate of consensus did not change. Its single-issue model is Friedkin–Johnsen, not DeGroot; closure and influence come from one self-report, and prior closure is not controlled. |
| LIT-1483 v3 | The influence of anxiety on exploration: A review of computational modeling studies | Chou, Wilson & Smith (2024). A narrative review of computational modelling studies of how anxiety influences exploration, mostly in reward tasks and sub-clinical samples. In reinforcement-learning tasks directed, but not random, exploration may be raised by trait or cognitive anxiety and lowered by state or somatic anxiety; in foraging tasks anxiety is consistently associated with less exploration, including, in one study, less checking for a predator. Some differences may come from how anxiety modulates learning rates. Results are inconsistent and unreplicated, and tasks, anxiety measures and methods need to be made consistent. | Active — read in full 2026-10-24 (NOTE-1127) from the CC BY PsyArXiv preprint, not the closed version of record, whose abstract differs; worth reading as the map of how anxiety relates to exploration once both are split into kinds. In reward bandits directed exploration tends to rise with trait or cognitive anxiety and fall with state or somatic anxiety, random exploration shows no link, and in foraging, and in one task with a predator to check for, anxiety goes with less exploration. A narrative review of mostly sub-clinical, unreplicated studies with inconsistent tasks and measures. |
| 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-1487 v2 | Autocratization and States of Emergency in Comparative Perspective | Dagan & Benvenisty (2026), Israel Democracy Institute. A comparative study of five formerly stable democracies that underwent substantial autocratization (South Korea, India, Hungary, Venezuela and Turkey) finds a clear link between states of emergency and accelerated erosion of democracy and autocratic consolidation. Their intersection undermined democracy through three channels: formal emergency powers; extraordinary powers functionally equivalent to them though not so defined in law; and emergency rhetoric framing measures as urgent and necessary. | Active — read in full 2026-10-24 (NOTE-1129) from the Israel Democracy Institute’s web page, which is the whole of what is published; worth reading only for its three channels (formal emergency powers, powers functionally equivalent to them, emergency rhetoric) and its account of Hungary’s successive emergencies since 2015. A think-tank summary, not peer-reviewed, with no sources or method, of five cases chosen because they autocratized; the authors say the convergence of emergency and autocratization “is not inevitable”. Not evidence for a causal link. |
| LIT-1488 v3 | The when and how of planning: Meta-analysis of the scope and components of implementation intentions in 642 tests | Sheeran, Listrom & Gollwitzer (2024). Across 642 independent tests, forming implementation intentions was effective for cognitive, affective and behavioural outcomes (.27 ≤ d ≤ .66). Effects were larger when plans had a contingent if-then format, participants were highly motivated to reach the goal, and plans were rehearsed. A new taxonomy of the cues and responses that plans specify is developed and its categories tested. Publication bias was substantial: the pooled d = .36 falls to d = .15 under robust Bayesian meta-analysis, a small and highly heterogeneous effect. | Active — read in full 2026-10-24 (NOTE-1131) from the version of record deposited in the University of Konstanz repository (KOPS, in copyright, terms of use); worth reading as the largest synthesis of if-then planning (642 experimental tests to September 2019) and the one that corrects its size. The effect is reliable (BF10 = 319) but small once publication bias is modelled (d = .15, against an uncorrected .36 and 2006’s .65), and highly heterogeneous. Between tests, the conditional link beats a schedule of the same behaviour, rehearsal helps, keeping a copy to revisit hurts, and plans work only when the goal is wanted. Its taxonomy finds nearly every cue and response effective, ignoring and waiting before responding among them. No mechanism is tested. |
| LIT-1489 v2 | Temporary Protection and Technology Adoption: Evidence from the Napoleonic Blockade | Juhász (2018). A natural experiment on temporary trade protection: regions of the French Empire that were, for exogenous reasons, better shielded from British trade during the Napoleonic Wars (1803–1815) expanded mechanized cotton spinning more than exposed regions. In the long run they kept higher activity in mechanized spinning and higher industrial value added per capita until the second half of the nineteenth century, but not later. | Active — read in full 2026-10-24 (NOTE-1122) from the author’s working draft of 17 December 2015, not the version of record; worth reading as the first well-identified evidence that temporary protection can leave a lasting industry behind it. Departments more shielded from British trade by the Napoleonic blockade built more mechanized cotton spinning, kept a larger industry through 1887 and had more productive firms in 1840; industrial value added was higher in 1860 and not detectably from 1896. The long-run instrument is weak (first-stage F mostly below 10). The protection was a war blockade followed by post-war tariffs, not a temporary tariff lifted, and what persisted was the industry, not the protection. |
| LIT-1490 v3 | Impaired action-safety learning and excessive relief during avoidance in patients with anxiety disorders | De Kleine, Hutschemaekers, Hendriks, Kampman, Papalini, Van Minnen & Vervliet (2023). In a computer-based avoidance task, 47 healthy controls were compared with 33 patients with OCD, 40 with panic disorder with agoraphobia and 66 with PTSD, before exposure treatment. OCD and PTSD patients avoided more during the safety cue and kept a higher expectancy of the aversive picture after the safety cue and after effective avoidance; PDA and PTSD patients reported more relief. The groups did not differ in avoiding the danger cues. The authors propose that low confidence in the safety that avoidance brings makes omissions surprising, and the extra relief reinforces avoidance. | Active — read in full 2026-10-24 (NOTE-1123) from the CC BY version of record; worth reading as, by its own count, the third experimental study of avoidance learning in anxiety patients, and the first to track what they learn from avoiding as well as how often they avoid. Against 47 controls, OCD and PTSD patients avoided a safety cue more and, after effective avoidance, still expected the aversive picture more; PDA and PTSD patients reported more relief at omissions; nobody differed on the danger cues. Cross-sectional, with no cost to avoiding; relief was already higher before avoidance was possible, and patients rated the pictures as more aversive. That the excess relief reinforces avoidance is the authors’ interpretation, not a finding. |
| LIT-1491 v3 | The standalone effect of safety behavior manipulations: A systematic review and meta-analysis | Goodson, Patel, Zech, Sala & Cougle (2026). Of 26 studies of standalone safety-behaviour manipulations outside exposure (2,048 participants, mean age 24.9), 19 were meta-analysed. Relative to control, reducing safety behaviours reduced them (d = 0.52, 95% CI 0.36–0.68, after one outlier was removed) and reduced symptoms (d = 0.43, 95% CI 0.27–0.59; 0.31 after trim-and-fill, Egger p = .012); increasing them, in five non-clinical experiments, raised safety behaviours (d = 2.96) and symptoms (d = 0.65). Only study type (for the effect on safety behaviours) and the size of the safety-behaviour change (for symptoms) moderated the effects. | Active — read in full 2026-10-24 (NOTE-1128) from the NIH author manuscript in PubMed Central, not the closed version of record; worth reading as the first meta-analysis of safety-behaviour manipulations made outside exposure. Reducing them lowered symptoms against control (d = 0.43, about 0.31 after trim-and-fill, with significant Egger asymmetry), instructed increases raised symptoms (d = 0.65, five studies), and the size of the safety-behaviour change moderated the symptom effect. The literature is small, mostly appearance and social anxiety in young, largely non-clinical samples, and largely from the senior author’s group. It says nothing about how safety behaviours act. |
| LIT-1494 v3 | Eligibility Traces and Plasticity on Behavioral Time Scales: Experimental Support of NeoHebbian Three-Factor Learning Rules | Gerstner, Lehmann, Liakoni, Corneil & Brea (2018). Behaviour unfolds over seconds and spikes over milliseconds, so learning rules must bridge the two. In neoHebbian three-factor rules, co-activation of pre- and postsynaptic neurons sets an eligibility trace at the synapse, which changes the weight only if a third factor (reward, punishment, surprise or novelty, carried by neuromodulators or special inputs) arrives while it is set. The review sets out four recent experiments supporting eligibility traces on the scale of seconds. | Active — read in full 2026-10-24 (NOTE-1130) from the CC BY version of record; worth reading as the review that set out what the first direct experiments (2014–2017) showed about eligibility traces on the scale of seconds: in striatum about 1 s, in cortex 3–10 s with the modulator setting the sign, in hippocampus about 2 s. Mostly slices, one laboratory per region, by theoreticians whose models assumed the traces; they grant that other mechanisms could bridge the same gap, and what is well established is the hour-scale tag of consolidation. |
| LIT-1496 v3 | Anxiety, Avoidance, and Sequential Evaluation | Zorowitz, Momennejad & Daw (2020; preprint 2019). A decision-theoretic analysis and reinforcement-learning simulations of maladaptive avoidance, with no data fitted. In sequential evaluation the chance to avoid danger later should make it less threatening now; a pessimistic false belief that one’s own later avoidance will fail, with the danger represented correctly, propagates fear and avoidance to situations far before the threat. This one bias reproduces qualitatively exaggerated threat appraisal, fear generalization, persistent avoidance and laboratory findings on approach–avoid conflict and loss avoidance, and predicts a reduced free-choice premium in anxiety. | Active — read in full 2026-10-24 (NOTE-1136) from the CC BY version of record; worth reading for the derivation that avoidance far from a threat needs no overestimate of the threat, only an expectation that one will fail to avoid it later, which spreads threat value backward across a decision process. Simulations only, matched qualitatively to published findings (earlier cash-out, behavioural inhibition, aversive pruning); the predicted loss of the free-choice premium is untested, and the persistence of avoidance after the misbelief is corrected is argued, not simulated. |
| LIT-1497 v3 | Implementation Intentions and Goal Achievement: A Meta‐analysis of Effects and Processes | Gollwitzer & Sheeran (2006). A meta-analysis of 94 independent tests: forming an implementation intention, an if-then plan saying when, where and how a goal will be pursued, had a medium-to-large effect on goal attainment (d = .65). The plans helped people start goal striving, shield it from unwanted influences, disengage from failing courses of action and conserve capacity, and the postulated processes were supported: the specified opportunity became more accessible and the response more automatic. | Active — read in full 2026-10-24 (NOTE-1124) from the University of Konstanz repository’s scan of the published chapter (KOPS, CC BY-NC-ND 2.0), through OCR; worth reading as the first large meta-analysis of if-then planning and the fullest statement of its mechanism: a plan hands initiation of a response decided in advance to the cue it names, so nothing is deliberated in the situation, and the plan fires only while the goal behind it is active. 94 tests, d = .65 against a goal intention alone, with large effects on cue accessibility and on the immediacy, efficiency and non-conscious running of planned responses from small sets of tests. The size is not corrected for publication bias; the 2024 review of 642 tests (LIT-1488) finds the bias substantial and a corrected effect near d = .15. What happens when a plan’s response proves wrong is named and left untested. |
| LIT-1500 v4 | Maximizing exposure therapy: An inhibitory learning approach | Craske, Treanor, Conway, Zbozinek & Vervliet (2014). A clinical translation of the inhibitory-learning model of extinction: the original threat association survives extinction, beside a competing inhibitory one, so fear can return; fear reduction during exposure does not predict outcome; and exposure should be designed to violate stated expectancies, not to reduce fear in session. Strategies: expectancy violation, deepened extinction, occasional reinforced extinction, removal of safety signals, variability, retrieval cues, multiple contexts and reconsolidation, with affect labeling as a further regulation strategy. Cognitive restructuring before exposure is held to blunt learning. Five illustrative cases; no new data. | Active — read in full 2026-10-24 (NOTE-1137) from the NIH author manuscript in PubMed Central, the accepted unedited version, not the closed version of record; worth reading as the standard clinical statement of the inhibitory-learning account of exposure: extinction adds a competing inhibitory association and leaves the original intact, fear reduction during exposure does not predict outcome, and exposure should be built to violate expectancies. It reports no data. Its strategies are cited to evidence of uneven strength, which the authors flag, and it reports the evidence against removing safety behaviours as well as for it. |
| LIT-1503 | QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning | Rashid et al. represent a team’s joint action-value Q_tot as a mixing of per-agent values Q_a(τ^a, u^a) constrained by ∂Q_tot/∂Q_a ≥ 0, with non-negative mixing weights produced from the global state by hypernetworks. Monotonicity makes the joint argmax the profile of individual argmaxes, so execution is decentralised and maximisation is linear in the number of agents. It represents more than a sum (VDN), learning the optimal policy of a two-step game VDN misses, and beat VDN and independent Q-learning on six StarCraft II maps; it cannot represent joint values in which an agent’s best action depends on the others’. | Active — read in full 2026-10-24 (NOTE-1154) from arXiv v2 (6 June 2018, the ICML camera-ready, arXiv non-exclusive licence); worth reading for one structural condition: if the joint action-value is non-decreasing in each agent’s own value, the profile of individually greedy actions is a greedy joint action, so a collective can act on a common value while each member consults only its own. The condition is sufficient, not necessary, and it cannot represent a joint value in which one agent’s best action depends on what the others do at the same step. Its evidence is a two-step matrix game and StarCraft II win rates on six small maps. |
| LIT-1504 | Real World Games Look Like Spinning Tops | Czarnecki, Gidel, Tracey, Tuyls, Omidshafiei, Balduzzi & Jaderberg (NeurIPS 2020). Games in which players can signal n bits before the outcome is settled contain every win–loss pattern on 2ⁿ strategies, so cycles of length 2ⁿ (Go: at least 2¹⁰⁰⁰). Nash clustering orders a game’s strategies into clusters weakly ordered by population performance. Empirical games sampled from small board games and the AlphaStar league show cluster size peaking at middling strength, the “spinning top”, and population-based training converges once the population is large enough. | Active — read in full 2026-10-24 (NOTE-1146) from arXiv v2 (17 June 2020); worth reading for one clean theorem, one general lemma and a hypothesis with evidence. The theorem: where players can signal n bits before the result is settled, every pattern of wins and losses among 2ⁿ strategies, a cycle through all of them included, is realized. The lemma: Nash clusters are weakly ordered by population performance, and beating a population that contains a whole cluster lifts a strategy above it. The hypothesis, that real games are shaped like a spinning top, with cycles thickest at middling strength, rests on sampled empirical games. The abstract says it is proved and the body says it is not. The random-game theorem’s proof is defective, and the fixed-memory fictitious play result needs a replacement rule it does not state. |
| LIT-1505 | Learning Through Reinforcement and Replicator Dynamics | Börgers & Sarin (1997; working paper 1993). For two players each running Cross’s version of Bush–Mosteller learning with payoffs in (0, 1), the expected change of each player’s mixed strategy equals the discrete replicator step of a two-population biological model, and in the continuous-time limit the learning process converges in probability to the continuous (Taylor) replicator dynamic at every finite time. Asymptotically it does not: the discrete process is absorbed in a pure strategy profile with probability one for every learning speed. With negative payoffs the limit adds a probability-matching term to a replicator term in “benefits”. | Active — read in full 2026-10-24 (NOTE-1149) from the authors’ working paper of October 1995, as held in Levine’s Working Paper Archive; worth reading as the proved source of “Cross learning is the replicator dynamic”: a single Bush–Mosteller learner with positive payoffs moves in expectation exactly as a population under the discrete replicator dynamic, and in the continuous-time limit follows the continuous replicator dynamic on any finite horizon. Two limits matter as much as the result. Asymptotically the discrete learner is absorbed in a pure strategy profile with probability one at every learning speed, even in matching pennies where the replicator dynamic cycles; and with negative payoffs a second force, probability matching, enters beside the replicator term. |
| 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-1508 | Re-evaluating Evaluation | Balduzzi, Tuyls, Pérolat & Graepel (NeurIPS 2018). Evaluation data are antisymmetric matrices: Elo is their row mean in logit space, exact only when the log-odds are curl-free, and inflatable by copies; the Schur decomposition gives a multidimensional Elo for cyclic interactions. Nash averaging scores agents (and tasks) against the maximum-entropy Nash equilibrium of a zero-sum meta-game, which ignores exact copies when that equilibrium is unique. Applied to Atari, human ties with the best agents. | Active — read in full 2026-10-24 (NOTE-1155) from arXiv v2 (30 October 2018, the authors’ “NIPS 2018, final version”); worth reading as the source of the Hodge and Schur reading of evaluation data and of Nash averaging. Elo is the row mean of the log-odds matrix, exact only when the log-odds have no cyclic part, and copies of an agent move it. Nash averaging scores each agent against the maximum-entropy Nash team of the meta-game. Its invariance to copies is proved only for the Nash set (Lemma 1): when the meta-game has more than one equilibrium, copying an agent moves the maximum-entropy selection and the Nash averages with it, which the reading checked by script. The Atari re-evaluation used an LP solution, not the maximum-entropy one. |
| LIT-1509 | Open-ended Learning in Symmetric Zero-sum Games | Balduzzi, Garnelo, Bachrach, Czarnecki, Pérolat, Jaderberg & Graepel (ICML 2019). Every symmetric zero-sum game between parametrized agents splits into a transitive part and a cyclic part relative to a measure on agents. In cyclic games individual performance is meaningless, so the paper measures populations, by the value of the game between them and by the convex hull of their evaluation rows (the gamescape). Response to the Nash mixture enlarges the gamescape, and response to the rectified Nash, which trains each supported agent on what it beats, grows it in Blotto-type games where self-play does not. | Active — read in full 2026-10-24 (NOTE-1143) from arXiv v2 (13 May 2019, the authors’ “ICML 2019, final version”); worth reading for one invariant and one reframing. The invariant: the value of the zero-sum game between two populations, which does not depend on the choice of Nash, ignores members that are behavioural mixtures of others, and cannot be positive for a population inside another’s hull. The reframing: in a cyclic game an individual agent’s performance means nothing, so progress is the growth of a population’s gamescape. Its functional Hodge decomposition is right but is stated with a degenerate inner product, and it depends on a measure over agents. Experiments are two small resource-allocation games. |
| LIT-1510 | QTRAN: Learning to Factorize with Transformation for Cooperative Multi-Agent Reinforcement Learning | Son, Kim, Kang, Hostallero & Yi define Individual-Global-Max (IGM): a joint action-value is factorised by per-agent values when the joint argmax is the profile of individual argmaxes. Additivity (VDN) and monotonicity (QMIX) are sufficient for it; QTRAN instead trains the sum of individual values plus a state value to equal the joint value at the greedy profile and to bound it elsewhere (Theorem 1), a condition also necessary up to positive rescaling. On 310 random 3×3 matrix games it learned the optimum in all, VDN and QMIX failed in 177; it also did better on Gaussian squeeze and a penalised predator-prey task. | Active — read in full 2026-10-24 (NOTE-1141) from arXiv v1 (14 May 2019, the ICML version with its supplement, arXiv non-exclusive licence); worth reading for the Individual-Global-Max condition, that the agents’ individually greedy actions form a greedy joint action, and for showing it strictly weaker than additive or monotonic factorisation. The authors’ own supplement notes that every single-state matrix game satisfies it, so IGM has bite only where each agent sees part of the state; it is a condition on whether members acting on local information can jointly reach the collective optimum, not a condition for a common currency. Evidence is matrix games, Gaussian squeeze and a predator-prey variant. |
| LIT-1511 | Frequency adjusted multi-agent Q-learning | Kaisers & Tuyls (AAMAS 2010). The replicator-plus-entropy model of Boltzmann Q-learning derived by Tuyls et al. (2003, 2005), ẋ_i = x_i α(τ⁻¹[(Ay)_i − x·Ay] − log x_i + Σ_k x_k log x_k), assumes that every Q-value changes at rate α. In Q-learning only the chosen action’s value is updated, so E[Q̇_i] carries a factor x_i, and trajectories in the prisoners’ dilemma, battle of the sexes and matching pennies deviate from the model, depending on initialization. Frequency Adjusted Q-learning scales each update by min(β/x_i, 1) and follows the model wherever x_i ≥ β. | Active — read in full 2026-10-24 (NOTE-1140) from the AAMAS 2010 proceedings PDF on the IFAAMAS site; read in place of Tuyls, Verbeeck & Lenaerts 2003 (LIT-1501), whose model it restates and corrects. Worth reading as the correction to “Q-learning is replicator dynamics plus mutation”: the selection–mutation equation describes Q-learning with Boltzmann exploration only if every action’s estimate is updated at the same rate. In Q-learning the chosen action is updated more often, so the expected change of Q_i carries a factor x_i, and the learning traces depart from the model, depending on how the Q-values are initialized. Frequency Adjusted Q-learning divides the step by x_i and matches the model. Evidence is three 2×2 games, plotted, with no quantitative measure of fit. |
| 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-1513 | Multi-agent Reinforcement Learning in Sequential Social Dilemmas | Leibo, Zambaldi, Lanctot, Marecki & Graepel (2017). Defines a sequential social dilemma as a Markov game whose cooperative and defecting policies, played against each other, give payoffs satisfying the social dilemma inequalities. Independent deep Q-learners in a fruit-Gathering game learn aggression when apples are scarce or a tagged rival is out long; in Wolfpack they hunt together when the joint-capture bonus and radius are high. Both games embed Prisoner’s Dilemmas, but network size raises defection in Gathering and lowers it in Wolfpack, which no matrix game captures. | Active — read in full 2026-10-24 (NOTE-1151) from arXiv v1, the AAMAS 2017 paper; worth reading as the paper that moved social dilemmas from matrix games to learned policies in Markov games. Two two-player games, Gathering (apples, and a beam that removes the rival for a while) and Wolfpack (lone or joint capture of prey), both yield Prisoner’s Dilemma payoff matrices when the learned policies are played off, yet respond in opposite directions to agent capacity: a larger network makes Gathering agents more aggressive and Wolfpack agents more cooperative, because aggression is the harder policy to implement in one and cooperation in the other. Agents learn aggression where apples are scarce. It is a descriptive simulation with independent learners, no figures of spread, and no protective institution or depletable commons. |
| LIT-1514 | Adaptive Mixtures of Local Experts | Jacobs, Jordan, Nowlan & Hinton (1991). A system of expert networks and a gating network, trained with the error of a single expert selected stochastically by the gate (or the negative log-likelihood of a mixture of Gaussians), so that each expert produces the whole output and an expert better than the gate-weighted average gains responsibility for the case. On speaker-independent vowel discrimination, 4 or 8 linear experts learned twice as fast as matched backpropagation networks at equal accuracy and divided the task by class pair; all but 2 or 3 experts went unused. | Active — read in full 2026-10-24 (NOTE-1147) from the scan of the published article on Geoffrey Hinton’s University of Toronto page; worth reading as the origin of the mixture of experts and as a learning rule in which authority over a case goes to whichever expert does better than the gate-weighted average. Redefining the error as that of a single expert chosen stochastically by the gate makes the experts compete rather than cooperate, and the log-likelihood form adapts the best-fitting expert fastest. On a four-class vowel task, mixtures of 4 or 8 linear experts reached criterion in about half the epochs of backpropagation networks with matched parameters, at the same accuracy, and in every run all but 2 or 3 experts ended with mixing proportions effectively 0. The authors read that as economy; nothing in the paper tests whether the idle experts could recover. |
| 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-1517 | Counterfactual Multi-Agent Policy Gradients | Foerster, Farquhar, Afouras, Nardelli & Whiteson train decentralised actors with one centralised critic Q(s, τ, u) and credit agent a with A^a = Q(s, τ, u) − Σ_{u′a} π^a(u′a | τ^a) Q(s, τ, (u^−a, u′a)): the value of the joint action against the critic’s average over a’s own alternatives under a’s policy, the others’ actions fixed. The baseline does not depend on a’s action, so it does not change the expected gradient (Lemma 1). On decentralised StarCraft micromanagement with a narrow field of view, it beat independent and central-V/QV critics on four maps. | Active — read in full 2026-10-24 (NOTE-1152) from arXiv v3 (11 December 2024, arXiv non-exclusive licence), the corrected version; worth reading as the standard statement of counterfactual credit in cooperative multi-agent learning: each agent’s action is scored against the critic’s average over that agent’s own alternatives, the others’ actions held fixed, and that baseline provably leaves the expected gradient unchanged. The counterfactual values are the learned critic’s estimates, which exist only for actions the agents sometimes take, so the method credits agents that all act on every step and does not recover the value of one that is never heeded. Results are StarCraft win rates on four small maps. |
| LIT-1518 | Eliciting Informative Feedback: The Peer-Prediction Method | Miller, Resnick & Zeckhauser (2005). A center with no independent information scores each rater by applying a strictly proper scoring rule to the distribution of a reference rater’s report that her own report implies, given a common prior and signal model. Truthful reporting is a strict Nash equilibrium; scaling the scores induces costly effort and can outweigh bribes; three or more raters allow budget balance. Uninformative equilibria also exist, and collusion, risk aversion, unmodelled private signals and trust in the center are named limits. | Active — read in full 2026-10-24 (NOTE-1139) from the authors’ final pre-publication draft of 26 January 2005, on Paul Resnick’s University of Michigan page; worth reading as the founding scoring rule for evaluators when there is no ground truth. Each rater reports a signal, the center turns it into a posterior over a reference rater’s report, and the rater is paid a strictly proper scoring rule on that posterior against what the reference rater actually reported. Truth-telling is then a strict Nash equilibrium (Proposition 1), and scaling the payments buys effort. It is not the only equilibrium: everyone always reporting h, or always l, is an equilibrium too, and collusion is named as a limit the paper does not settle. The mechanism needs a common prior and a signal model the center knows. |
| LIT-1519 | Learning with Opponent-Learning Awareness | Foerster et al. replace an agent’s objective V¹(θ¹, θ²) with its value after the opponent’s anticipated naive gradient step, V¹(θ¹, θ² + Δθ²), and differentiate through Δθ² = η∇θ²V², adding (∇θ²V¹)ᵀ∇θ¹∇θ²V² · δη to the naive gradient. In the memory-one iterated prisoner’s dilemma, two exact-gradient LOLA learners played tit-for-tat-like policies in 81% of runs (return −1.06 against −1.98 for naive learners); in iterated matching pennies they settled at the mixed Nash equilibrium. A policy-gradient version cooperated in the Coin Game, and with opponent modelling did so less reliably. | Active — read in full 2026-10-24 (NOTE-1150) from arXiv v4 (19 September 2018, the AAMAS 2018 text, arXiv non-exclusive licence); worth reading as the first learning rule that models another learner’s update and climbs its own return through it: a LOLA agent adds to its gradient the effect of its own parameters on the opponent’s next naive step. Two exact-gradient LOLA learners reached tit-for-tat-like reciprocity in the iterated prisoner’s dilemma where naive learners defected. Shaping is one step deep, assumes access to the opponent’s parameters (or a behavioural clone of them), and is shown only in two-player games; its numbers have one internal inconsistency (see the NOTE). |
| 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-1521 | A Simple Adaptive Procedure Leading to Correlated Equilibrium | Hart & Mas-Colell (Econometrica 2000; handout 1996). Regret matching: each period a player who last played j switches to k with probability R_t(j, k)/μ, the positive part of its average gain had it played k whenever it played j, and otherwise repeats j. If all players do so, the empirical distribution of play converges almost surely to the set of correlated equilibria. The proof runs through Blackwell’s approachability theorem; regrets vanish exactly when the empirical distribution approaches the correlated-equilibrium set. Inertia, a positive probability of repeating, is needed for the result. | Active — read in full 2026-10-24 (NOTE-1142) from the published article as posted on Sergiu Hart’s homepage; worth reading as the theorem that correlated equilibrium is reachable by simple adaptive play: if every player switches from its last action to each alternative with probability proportional to its positive regret for not having made that switch in the past, the empirical joint distribution of play converges almost surely to the set of correlated equilibria. No device, no forecasts and no best replies are needed; the common history is the correlating device. The limits matter: convergence is to the set, not to a point; correlated equilibria that are interior and not pure Nash cannot be the limit of the empirical distribution; and the players must observe one another’s past play. |
| LIT-1522 v2 | MultiDiffusion: Fusing Diffusion Paths for Controlled Image Generation | Bar-Tal, Yariv, Lipman & Dekel (2023). MultiDiffusion is a training-free generation process for a pre-trained text-to-image diffusion model that binds several diffusion generation processes together through an optimization task with shared parameters or constraints. It gives controllable generation, such as panoramas at a chosen aspect ratio and images following spatial guidance from segmentation masks to bounding boxes, without retraining or fine-tuning (abstract). | Active — read 2026-10-25 (NOTE-1158) in full, from arXiv v1 and the PMLR proceedings PDF; worth reading for the clearest published form of several denoiser runs acting on one shared state, each with authority over part of the canvas, fused at every step by a per-pixel weighted average (THEORY-958), and for its panorama and region-layout results (THEORY-948). Read it knowing that its closed form (Eq. 5) is the minimizer of its printed loss only for 0/1 weights, that Proposition 3.1’s guarantee needs zero loss at every step and so does not describe the method as run, that most of the layout gain comes from the early masked bootstrapping phase rather than from fusion, and that “without introducing computational overhead” means one network call per view per step. |
| LIT-1523 v3 | Sequential Tests of Statistical Hypotheses | Wald (1945). Introduces the sequential probability ratio test: observations are taken one at a time, the log-likelihood ratio of two simple hypotheses is accumulated, and sampling stops when it leaves an interval whose bounds are set approximately from the desired error probabilities. The paper derives the test’s operating characteristic and its expected number of observations, which for given error rates is substantially smaller than the fixed sample a test of the same strength needs, and proves that no test of the same strength needs fewer on average once the overshoot of the bounds is neglected (checked against the reading). | Active — read 2026-10-25 (NOTE-1165) in full, from the copy the owner supplied on 2026-10-25, a JSTOR scan of the Annals article (this client had been stopped by Project Euclid’s bot check the same day). Worth reading as the source of the sequential probability ratio test: its boundaries follow from the error rates alone, A = (1 − β)/α and B = β/(1 − α) (THEORY-952), and its operating characteristic, expected sample size and optimality against every test of the same strength are derived, with savings of about half against the fixed-sample test (THEORY-951). Read it knowing that optimality is proved only when the overshoot of the boundaries is neglected, the exact case being a conjecture (footnote 12), that the operating characteristic and sample-size formulas are approximations that need i.i.d. observations, and that the paper never mentions diffusion: the drift-diffusion limit is later work’s, and is the case in which these approximations are exact. |
| LIT-1524 v2 | Cleaning up the neighborhood: A full classification for adversarial partial monitoring | Lattimore & Szepesvári (2018; ALT 2019). Completes the classification of finite adversarial partial-monitoring games by minimax regret to all games, including the degenerate ones (with actions optimal only on a lower-dimensional part of the simplex) that Bartók et al. (2014) left open: 0 with no pair of neighbouring actions, Θ̃(√n) when locally observable, Θ(n^2/3) when globally but not locally observable, and Ω(n) otherwise. A new NeighborhoodWatch2 attains √n with high probability by redistributing mass onto degenerate actions in proportion to the neighbours they lie between. It corrects a slip in Bartók et al.’s T^2/3 lower-bound proof and, in the preprint’s words, an exchanged expectation and maximum in the earlier localisation argument. A second algorithm, RelExp3, gives point-locally observable games an asymptotic √n bound free of arbitrarily large game constants, with a matching linear dependence on the number of feedback symbols. | Active — read 2026-10-25 (NOTE-1162) in full, from the arXiv preprint v1 of 23 May 2018 (arxiv.org/pdf/1805.09247v1, 24 pp.); the ALT 2019 version (PMLR 98:529–556) was fetched and its theorem statements, footnote and contribution list compared, not read in full. Worth reading for the completed classification of finite adversarial partial-monitoring games, degenerate and duplicate actions included (THEORY-963); for how actions that are optimal only on a boundary enter it, through the neighbourhood set and not as neighbours, and for its correction of the lower-bound proof of Bartók et al. (2014) (THEORY-961); for NeighborhoodWatch2, a simpler algorithm with a high-probability √n bound; and for RelExp3 on point-locally observable games (THEORY-950). Read it knowing that the arXiv text says Foster and Rakhlin and Bartók et al. “inadvertently exchanged an expectation and maximum” in their localisation argument and the published text no longer says so, though both abstracts say “correct errors in previous analyses”; that it proves only the two pieces of the classification that were missing or flawed and cites the rest; that its constants are game-dependent and can be large; and that a few small typos survive in the arXiv text. |
| LIT-1525 v2 | Bayesian Experimental Design: A Review | Chaloner & Verdinelli (1995). A review of Bayesian experimental design from a decision-theoretic standpoint, which casts the Bayesian design criteria as parts of one coherent approach covering linear and nonlinear problems, suggests new directions through new utility functions, shows that in some linear problems Bayesian solutions change sensibly as prior and utility are adapted to the experiment, and justifies the choice of optimality criterion mathematically (abstract). | Active — read 2026-10-25 (NOTE-1161) in full, from the authors’ Technical Report #607 (University of Minnesota, July 1995) in the University of Minnesota Digital Conservancy; worth reading for Lindley’s decision-theoretic formulation of design, for the derivation of Bayes D- and A-optimality from Shannon information and quadratic loss in the normal linear model (THEORY-956), and for the account of nonlinear design as prior-averaged local criteria, with local optimality as the point-mass case and its failure for the turning point (THEORY-954). Read it knowing that it is a 1995 survey, mostly of normal linear models, that its nonlinear criteria are approximations of unknown accuracy, that its treatment of model discrimination is brief, and that the copy read is the technical report, with equations lost to OCR, not the journal text. |
| LIT-1526 v2 | Online Learning and Blackwell Approachability with Partial Monitoring: Optimal Convergence Rates | Kwon & Perchet (2017). Blackwell approachability generalizes regret minimization (multi-criteria optimization, online optimization of a convex loss, online linear optimization under a cumulative constraint). Under partial monitoring the decision maker does not see outcomes but a random signal correlated with the decision–outcome pair, or with the outcome only. The paper gives the first approachability algorithms for polytope target sets with convergence rate O(T^-1/2) when the signal does not depend on the decision and O(T^-1/3) for general signals, and shows that these rates cannot be improved without further assumptions on the objectives or the signals (abstract). | Active — read 2026-10-25 (NOTE-1159) in full, from the PMLR copy and its supplementary material; worth reading for the reduction of approachability under partial monitoring to full-information approachability in a lifted space of flags, for the optimal worst-case rates, O(T^-1/3) for general signals and O(T^-1/2) when the signal does not depend on the decision (THEORY-947), and for the exploration floor that decision-dependent signals require (THEORY-957). Read it knowing that approachability is assumed rather than decided, that the guarantees concern the average payoff and so let violations be compensated over time, that optimality is worst case over games, that the constants grow with a simplicial subdivision, and that the proof for outcome-dependent signals is omitted. |
| LIT-1527 v3 | Reaching a Consensus | DeGroot (1974). Members of a group that must act together each hold a subjective probability distribution for an unknown parameter. A model describes how they might reach agreement on a common distribution by repeatedly pooling one another’s opinions; the process and the consensus it reaches are given explicitly. The model also applies when each opinion is a point estimate rather than a distribution (abstract). | Active — read 2026-10-25 (NOTE-1157) in full, from the copy the owner supplied on 2026-10-25, a JSTOR scan of the published article (the searches of the same day had found no lawful copy). Worth reading as the source of the DeGroot model: repeated averaging with fixed weights is a Markov chain on opinions, a consensus from every start is reached exactly when the chain has one closed class and it is aperiodic, and its weights are the stationary vector, zero for members outside that class (THEORY-960). Read it knowing that the theorems are cited from Markov-chain texts without proof, that the “if and only if” of §4 needs the quantifier “for every starting opinion”, that its Theorems 1 and 2 are the same condition, and that the weights are fixed and nothing tracks the truth. |
| LIT-1528 v3 | Partial Monitoring—Classification, Regret Bounds, and Algorithms | Bartók, Foster, Pál, Rakhlin & Szepesvári (2014). In a partial-monitoring game the learner picks an action, the environment an outcome, and the learner suffers a loss and receives a feedback signal, both fixed functions of action and outcome. For every game with finitely many actions and outcomes (against adversarial opponents, every non-degenerate one) the minimax regret is zero or scales as T^1/2, T^2/3 or T, up to constants and logarithmic factors; computationally efficient algorithms attain it within a logarithmic factor, with individual bounds on expected regret for i.i.d. outcomes (abstract). | Active — read 2026-10-25 (NOTE-1164) in full, from the authors’ preprint of March 2013 on Alexander Rakhlin’s MIT page; worth reading for the complete classification of finite partial-monitoring games by minimax regret (0, Θ̃(√T), Θ(T^2/3), Θ(T); THEORY-964), for the linear-algebra conditions, global and local observability, that decide the class (THEORY-962), and for the algorithms CBP and NeighborhoodWatch. Read it knowing that the adversarial classification covers non-degenerate games only, that Lattimore and Szepesvári (2019, LIT-1524) completed it to degenerate games, corrected the kernel in its T^2/3 lower-bound proof, and, in their preprint, an exchanged expectation and maximum in NeighborhoodWatch’s localisation (THEORY-963, THEORY-961), that the classification concerns the best policy in a fixed, known game, and that the copy read is the preprint, not the journal text. |
| LIT-1529 v2 | Multi-LoRA Composition for Image Generation | Zhong et al. (2024). Composing several LoRAs in a text-to-image model gets harder as their number grows. Taking a decoding-centric view, the paper gives two training-free methods: LoRA Switch alternates between LoRAs at each denoising step, and LoRA Composite incorporates all of them at every step to guide synthesis. On ComposLoRA, a testbed of 480 composition sets, a GPT-4V-based evaluation finds both better than the prevalent baseline, most clearly as the number of LoRAs grows (abstract). | Active — read 2026-10-25 (NOTE-1160) in full, from arXiv v2, the TMLR version; worth reading for two ways of letting separately trained low-rank operators act on one denoising trajectory without merging them, by turns (LoRA Switch) or by averaging their guided predictions (LoRA Composite), for GPT-4V and human judgements preferring both to weight merging as LoRAs are added (THEORY-955), and for its ablation in which, at equal shares of steps, the switching interval and the LoRA acting first change the result (THEORY-949). Read it knowing that the merging baseline’s summed update grows with the number of LoRAs, which the design does not separate from the methods’ idea; that the two methods are never compared head to head by the judge; that the judge has a positional bias of about ten points and correlates 0.45 with two annotators; and that §5.1.1 attributes LoRA Switch’s scores to LoRA Composite. |
| LIT-1530 v2 | Invariant Learning Dynamics of Transformers in Inductive Reasoning Tasks | Musat, Pimentel, Zucchet & Hofmann (2026), arXiv:2607.11875. For a class of block-list inductive tasks that includes associative recall, k-hop induction and in-context n-grams, it proves that population gradient descent keeps an idealized attention-only transformer’s key–query and output weights on a low-dimensional invariant manifold fixed by the data’s symmetries, whose coordinates are interpretable head actions. On it, it proves that a saturated in-weights circuit suppresses the in-context circuit’s gradient by the fraction of data it does not solve and that burstiness multiplies it, shows empirically that initialization decides which of several induction circuits wins, and detects circuits in trained models by projecting onto the coordinates. | Active — read 2026-10-26 (NOTE-1177) in full, from the arXiv copy (v2); worth reading for its proof that symmetries of the data confine population gradient descent to a subspace of interpretable head actions (THEORY-981), for its theorem that a saturated memorized shortcut starves the in-context circuit of gradient on the data it solves (THEORY-1009), and for its scan in which initialization picks one of several induction circuits, read by the authors as cooperation through shared units and competition for layers (THEORY-1001). Read it knowing that the architecture is idealized (fixed orthogonal write maps, merged key-query, orthonormal embeddings), that invariance is proved and attraction is not, that the results are for gradient descent while its circuit-detection experiment uses AdamW, and that the competition scan was run in training projected onto seven coordinates. |
| LIT-1531 v3 | AtP*: An efficient and scalable method for localizing LLM behaviour to components | Kramár, Lieberum, Shah & Nanda (2024), arXiv:2403.00745. Attribution patching (AtP; Nanda 2023), a first-order gradient estimate of every node’s activation-patching effect, is tested against exhaustive patching on Pythia models from 410M to 12B. Verifying nodes in AtP’s order finds the largest-effect nodes far more cheaply than unordered or sampling-based search. Its false negatives come from saturated attention and from cancelling direct and indirect effects; AtP* adds an exact softmax for queries and keys and layer-wise gradient dropout, and a subsampling test bounds the size of nodes still missed. On the two prompt distributions, simpler variants are cheaper than AtP*. | Active — read 2026-10-26 (NOTE-1190) in full, from arXiv v1, with the comparison figures read from page renderings; worth reading as the systematic test of attribution patching against exhaustive activation patching on models up to 12B, for the two named causes of its misses (saturated attention, cancelling direct and indirect effects) and their fixes, and for the statistical bound on what is still missed (THEORY-996). Read it knowing that the ground truth is single-node noising on one model family and five settings, that only ranks are scored, that the numbers are only in charts, and that AtP* is not the cheapest variant on its two distributions. |
| LIT-1532 v2 | Sparse Feature Circuits: Discovering and Editing Interpretable Causal Graphs in Language Models | Marks et al. (2024), arXiv:2403.19647, ICLR 2025. Circuits are found over sparse-autoencoder features and autoencoder error terms of Pythia-70M and Gemma-2-2B, scoring nodes and edges by linear approximations to their indirect effects. On subject–verb agreement, small feature circuits carry much of the behaviour where neuron circuits need many more nodes, though only with the error terms kept. A human can remove features judged task-irrelevant from a classifier’s circuit (SHIFT), and the same method is run without supervision over thousands of behaviours clustered from the Pile. | Active — read 2026-10-26 (NOTE-1187) in full, from the arXiv copy (v3, the ICLR 2025 version); worth reading as the method that turned sparse-autoencoder features into circuits, by linear approximations of indirect effects over features and autoencoder errors together, and for its own evidence that the features alone are not the circuit: with the error nodes removed, its feature circuits recover little of the behaviour (THEORY-1007). Read it knowing that faithfulness is scored on the latter two thirds of each circuit only, that the interpretability of the circuits is the authors’ annotation, that the half-performance figure for Gemma neurons lies beyond its plotted range, and that its debiasing method is ML practice, which this record does not hold. |
| LIT-1533 v2 | Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnet | Templeton et al. (2024), Transformer Circuits Thread. Sparse autoencoders of about 1M, 4M and 34M features, sized by scaling laws for the autoencoder’s own loss, are trained on the middle-layer residual stream of Claude 3 Sonnet and explain at least 65% of its variance. They yield features that respond to the same concept across languages and in images, that steer the model when clamped, and that include features for unsafe code, bias, sycophancy and deception. Whether a concept has its own feature depends on its training frequency relative to the dictionary’s size. | Active — read 2026-10-26 (NOTE-1178) in full, from the article’s own page on the Transformer Circuits Thread; worth reading as the demonstration that sparse-autoencoder features of a production model are abstract (multilingual, multimodal) and can steer it, for the finding that a concept gets its own feature only once its training frequency passes about one over the number of live features (THEORY-992), and for the observation that the most active features are mostly not the ones that matter to an answer (THEORY-987). Read it knowing that its interpretability and steering evidence is shown on features the authors selected, that the model, its size and some plot units are withheld, that the reconstructions explain only at least 65% of the variance, and that its wider thesis that these features are the model’s working concepts is open (THEORY-965). |
| LIT-1534 v2 | A Mathematical Framework for Transformer Circuits | Elhage et al. (2021), Transformer Circuits Thread. Rewrites a transformer without changing it: heads act independently and add into a linear residual stream, each head is a low-rank QK matrix that sets where to attend and a low-rank OV matrix that sets what is moved, and with attention patterns frozen an attention-only model is a sum of end-to-end path terms. Zero-layer models are bigram tables, one-layer attention-only models bigram and skip-trigram tables read off the weights, and two-layer models use K-composition with a previous-token head to form induction heads, [a][b] … [a] → [b]. A correction of the composition diagram adds more composition than first reported. Models with MLPs are left open. | Active — read 2026-10-26 (NOTE-1189) in full, from the Transformer Circuits article; worth reading for the exact decomposition of an attention-only transformer into end-to-end paths and of each head into separable QK and OV circuits (THEORY-988, re-derived and checked by the record), for the three kinds of head composition, and as the paper in which induction heads are found, by K-composition with a previous-token head, in a two-layer attention-only model (THEORY-977). Read it knowing that the models are toys without MLPs, that the framework ignores layer norm and biases, that the composition diagram was corrected after publication, and that the interactive figures carry much of the evidence. |
| LIT-1535 v2 | Differentiation and Specialization of Attention Heads via the Refined Local Learning Coefficient | Wang, Hoogland, van Wingerden, Furman & Murfet (2024), arXiv:2410.02984, ICLR 2025. Refined variants of the local learning coefficient, a complexity measure from singular learning theory, are applied to individual components of a two-layer attention-only transformer, tracing how attention heads progressively differentiate into distinct functional roles during training, what data they specialize to, and a previously unidentified multigram circuit (abstract). | Active — read 2026-10-26 (NOTE-1188) in full, from the arXiv PDF of v1; worth reading as the record’s first developmental use of the learning coefficient, for per-head trajectories that separate attention heads by function (THEORY-975), and for its observations of heads changing role as circuits form (THEORY-967, Proposed). Read it knowing that it is one two-layer attention-only model with three appendix seeds, that the estimates are trusted only for their ordering, that cluster counts were chosen by eye, and that nothing is predicted before it happens. |
| LIT-1536 v2 | Locating and Editing Factual Associations in GPT | Meng et al. (2022), arXiv:2202.05262, NeurIPS 2022. Causal tracing corrupts the subject’s embeddings with noise and restores one hidden state at a time: in GPT-2 XL, recall of known facts depends most on middle-layer MLP outputs at the last subject token and on attention at the last token. Treating an MLP’s output matrix as a linear associative memory, ROME inserts a fact by a closed-form rank-one update keyed on the last subject token. On the CounterFact dataset of 21,919 counterfactuals, ROME is the only editor tested with both high generalization to paraphrases and high specificity to neighbouring subjects. | Active — read 2026-10-26 (NOTE-1166) in full, from the arXiv copy (v5, the NeurIPS 2022 version); worth reading for causal tracing, a corrupt-and-restore intervention that locates where a fact’s recall depends on hidden states, for the finding that in GPT-2 XL that dependence concentrates at the last subject token in middle-layer MLPs, and for the rank-one edit that tests it (THEORY-998). Read it knowing that the storage hypothesis it draws is wider than what it shows (THEORY-1011), that LIT-968 proves a working rank-one edit does not locate a fact, and that several numbers and figure references in v5 do not match. |
| LIT-1537 v2 | Hierarchical Beta Processes and the Indian Buffet Process | Thibaux & Jordan (2007), AISTATS 2007, PMLR 2: 564–571. The beta process is the de Finetti mixing distribution underlying the Indian buffet process, playing for it the role the Dirichlet process plays for the Chinese restaurant process. The paper uses the parallel to define hierarchies of beta processes and to derive posterior inference algorithms for the IBP, with an application to document classification related to smoothed naive Bayes (abstract). | Active — read 2026-10-26 (NOTE-1171) in full, from PMLR’s own PDF; worth reading for the beta process as the IBP’s de Finetti measure, with the predictive and the count of distinct features that follow (THEORY-985), and for the hierarchical beta process, the established way for groups to share one feature library at group-specific prevalences (THEORY-1015). Read it knowing that conjugacy is cited rather than proved, that its groups are disjoint and static, that its one experiment is a single text-classification split, and that its stated reason for a small group concentration reads against its own (9). |
| LIT-1538 v2 | In-context Learning and Induction Heads | Olsson et al. (2022), arXiv:2209.11895. Induction heads, attention heads that complete [A][B] … [A] → [B], develop at precisely the point of a sudden sharp increase in in-context learning, visible as a bump in the training loss. Six lines of evidence argue that they may be the mechanism of most in-context learning in large transformers: strong and causal for small attention-only models, correlational for larger models with MLPs (abstract). | Active — read 2026-10-26 (NOTE-1173) in full, from the arXiv print of the Transformer Circuits article; worth reading as the first mechanistic account of a transition in training, for the in-context learning score, and for the way it grades its own evidence by model class. Read it knowing that the case is causal only for small attention-only models (THEORY-973), that the large-model thesis is correlational and by analogy (THEORY-990), that every model was trained once on the same data order, and that its dates for the window disagree between sections. |
| LIT-1539 v2 | Towards Understanding Fine-Tuning Mechanisms of LLMs via Circuit Analysis | Wang, Hu, Du, Cheng, Wang & Zou (2025), arXiv:2502.11812, ICML 2025. On five arithmetic tasks where LoRA fine-tuning of Pythia-1.4B brings large gains, EAP-IG circuits found at successive checkpoints keep most of their nodes while most of their edges change, unlike earlier reports that fine-tuning only adds components. A circuit-aware LoRA that assigns higher rank to the layers whose edges change most beats uniform and random rank allocation at similar size (the abstract’s 2.46% average gain over LoRA is not recoverable from the tables, which give about 1.8–2.4 points), and the union of two subtasks’ circuits approximates a two-step task’s circuit. | Active — read 2026-10-26 (NOTE-1183) in full, from the arXiv copy (v2, the ICML 2025 version); worth reading for its tracking of EAP-IG circuits across fine-tuning checkpoints on tasks the pretrained model fails, with node change rates of 15–24% against edge change rates of 66–80%, and for using the layers whose edges change most to allocate LoRA rank. Read it knowing that the node–edge contrast has no null comparison at the same edge budget and that a fixed edge budget produces it by itself (THEORY-997), that it concerns fine-tuning a pretrained model on arithmetic rather than development from initialization, and that the abstract’s 2.46% gain is not recoverable from its tables. |
| LIT-1540 v2 | Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 small | Wang et al. (2022), arXiv:2211.00593. On sentences like “When Mary and John went to the store, John gave a drink to”, GPT-2 small predicts the indirect object through 26 attention heads in seven classes, found by path patching: duplicate-token and induction heads mark the repeated name, S-inhibition heads pass that on, and name mover heads copy the remaining name. Mean-ablating every other head keeps 87% of the logit difference. Knocking out the name movers costs only 5%, because backup heads take over, and a greedy search finds knockouts under which circuit and model differ by up to 87%. | Active — read 2026-10-26 (NOTE-1167) in full, from the arXiv copy; worth reading as the first end-to-end circuit for a natural behaviour in a pretrained language model, for path patching, for the backup heads that take over when the main ones are knocked out, and for its three tests of a circuit explanation, which its own circuit passes on average and fails under a greedy search (THEORY-980). Read it knowing that the behaviour is fifteen templates in one model, that MLPs are left out of the circuit though removing them breaks the task, that the dropout explanation of the backups is a hypothesis (THEORY-995), and that a few of its numbers and its greedy algorithm do not match their descriptions. |
| LIT-1541 v2 | On the Biology of a Large Language Model | Lindsey et al. (2025), Transformer Circuits Thread. Ten case studies of Claude 3.5 Haiku with the attribution graphs of LIT-1552, each validated by perturbing features in the model: two-hop factual recall through an intermediate “Texas” representation, rhymes planned before a line is written, addition features reused across contexts, a default “can’t answer” circuit inhibited by known entities whose misfire yields hallucination, unfaithful chains of thought, multilingual circuits, medical diagnosis, refusals, a jailbreak and a model with a hidden goal. The authors present each as an existence claim about specific prompts. | Active — read 2026-10-26 (NOTE-1181) in full, from the Transformer Circuits page; worth reading for ten case studies that show, on single prompts and with interventions, a two-hop intermediate in Claude 3.5 Haiku (THEORY-984), a rhyme planned on the newline before a line is written (THEORY-1017), a jailbreak whose target word is not represented before it is written (THEORY-1018), a trained-in goal represented in every Assistant context of a model organism (THEORY-976), and a default “can’t answer” circuit that known entities inhibit. Read it knowing that the authors find a satisfying graph for about a quarter of the prompts they try, that the graphs shown are curated and of a replacement model (LIT-1552), that several cruxes run through attention the graphs cannot see, and that its general statements about the model (THEORY-982) go beyond what the case studies show. |
| LIT-1542 v2 | The nested Chinese restaurant process and Bayesian nonparametric inference of topic hierarchies | Blei, Griffiths & Jordan (2010), J. ACM 57(2). The nested Chinese restaurant process (nCRP) assigns probability distributions to infinitely deep, infinitely branching trees and serves as a prior in a nonparametric model of document collections: each document is a path down a random tree, its words are allocated to levels along the path, and the nCRP’s preferential attachment clusters documents by topics shared at several levels of abstraction. Posterior inference over trees, topics and allocations is demonstrated on scientific abstracts. | Active — read 2026-10-26 (NOTE-1176) in full, from arXiv 0710.0845v3, the authors’ revision; worth reading for the nested Chinese restaurant process as a prior on trees of unbounded depth and branching (THEORY-969), for hLDA’s single-path model of a document and what that does to overlap, and for a careful simulated-recovery test (THEORY-1010). Read it knowing that §5.1’s level conditional does not match §2.4’s parameterization of the GEM and §6.2’s hyperparameters are out of range as printed, that it has no identifiability result, that its comparison with LDA rests on harmonic-mean estimates on one corpus (THEORY-989, Proposed), and that the typeset JACM text was not compared. |
| LIT-1543 v2 | Zoom In: An Introduction to Circuits | Olah et al. (2020), Distill, doi:10.23915/distill.00024.001. The essay that opened the Circuits thread. It offers three “speculative claims” about neural networks: features, which are directions in a layer’s activation space, are their fundamental unit; features connected by weights form circuits that can be studied rigorously, and meaningful algorithms can be read off the weights; and analogous features and circuits form across models and tasks. The examples are from InceptionV1: curve and high-low frequency detectors, a pose-invariant dog head detector, and a car feature spread across dog neurons, which the authors call superposition. For universality the authors call their own evidence anecdotal. | Active — read 2026-10-26 (NOTE-1182) in full, from the Distill article; worth reading as the programme statement of circuits research: features as the unit, circuits as weighted subgraphs between them that can be read off the weights, and universality across models, each offered by the authors as a deliberately speculative claim. Read it knowing that the examples are from one vision model, InceptionV1, that the detailed evidence was promised to later articles of the thread, and that the universality claim rests, in the authors’ word, on anecdote (THEORY-1013, THEORY-986). |
| LIT-1544 v2 | Correlated Non-Parametric Latent Feature Models | Doshi-Velez & Ghahramani (2009), UAI 2009, PMLR R7: 143–150. The Indian buffet process does not bound the number of active features but assumes them uncorrelated, which fits many real problems badly. The paper gives a framework for correlated nonparametric feature models generalising the IBP, derives several specific models from it, and applies them to real datasets (abstract). | Active — read 2026-10-26 (NOTE-1184) in full, from the arXiv copy of the UAI paper; worth reading for the category layer that makes IBP features co-occur while keeping finitely many on finite data, and for the condition that bounds what such models can express (THEORY-1012). Read it knowing that its features can be switched on by categories and never off, so it does not model inhibition, and that its table supports a gain over the IBP on three of five datasets, not “in almost all cases”. |
| LIT-1545 v2 | Towards Monosemanticity: Decomposing Language Models With Dictionary Learning | Bricken et al. (2023), Transformer Circuits Thread. Sparse autoencoders trained on 8 billion MLP activations of a one-layer transformer with 512 ReLU neurons, at widths from 512 to 131,072, yield features that are rated far more interpretable than the neurons, that mostly do not correspond to any neuron, whose downstream effects on the logits match their activations, and that recur in a second model trained from another seed. As the dictionary widens, features split into families of finer ones, and the authors conclude that there may be no single correct number of features. | Active — read 2026-10-26 (NOTE-1191) in full, from the article’s own page on the Transformer Circuits Thread; worth reading as the paper that made sparse-autoencoder features the field’s unit of analysis below the neuron, for its case that a feature is a causal unit and not only a pattern in the data (downstream effects the autoencoder never saw), and for feature splitting, which makes the feature set a resolution chosen by dictionary size (THEORY-1016). Read it knowing that everything is one 512-neuron MLP layer of a one-layer model, that the four deep-dive features are cherry-picked by the authors’ own account, that the human ratings are one author’s, and that the 79% of loss recovered is measured against zero-ablation, a baseline the authors call an overestimate (THEORY-991). |
| LIT-1546 v2 | Learning author-topic models from text corpora | Rosen-Zvi, Chemudugunta, Griffiths, Smyth & Steyvers (2010), ACM TOIS 28(1). Each author is a probability distribution over topics and each topic a distribution over words; a multi-author document mixes its authors’ topic distributions. Both are learned by MCMC and applied to CiteSeer abstracts, NIPS papers and 121,000 Enron emails, with perplexity and retrieval experiments showing systematic differences from alternatives. | Active — read 2026-10-26 (NOTE-1180) in full, from the typeset article on Griffiths’s lab page at Princeton; worth reading for the author–topic model as the plain-text case of members’ overlapping participation in themes, for its factorization of the document–word matrix as ΦΘA (THEORY-972), and for the measured trade between pooling by author and per-document flexibility (THEORY-1003). Read it knowing that authorship is observed, never inferred, that the number of topics and the hyperparameters are fixed, that an author’s topics are proportions summing to one, that identifiability is claimed only up to permutation when the likelihood allows a continuum, and that its readings of Enron employees’ roles are by inspection. |
| LIT-1547 v2 | Towards Automated Circuit Discovery for Mechanistic Interpretability | Conmy, Mavor-Parker, Lynch, Heimersheim & Garriga-Alonso (2023), arXiv:2304.14997, NeurIPS 2023. ACDC automates the patching step of circuit discovery: from the output back, it removes each edge of a model’s computational graph whose replacement by a corrupted activation raises the KL divergence from the full model by less than a threshold. Against circuits found by hand it ranks edges with AUCs of 0.85–0.98 on IOI, Greater-Than and Docstring, above two adapted pruning methods, and on Greater-Than keeps 68 of about 32,000 edges, all in the reported circuit. It is sensitive to metric, ablation and visiting order, misses negative components at sparse thresholds, and recovers compiled tracr circuits only with zero activations. | Active — read 2026-10-26 (NOTE-1170) in full, from arXiv v4, the NeurIPS 2023 version; worth reading for the workflow it names behind manual circuit discovery, for ACDC as that workflow’s patching step made into an algorithm, and for the first scoring of circuit-finding methods against circuits found by hand (THEORY-970). Read it knowing that the hand-found circuits are themselves partial, that the results move with the metric, the ablation and the order of visiting edges, that sparse runs miss negative components, that an OR gate keeps one input (THEORY-966), and that §4.1 claims a tracr-reverse lead its own Table 2 does not show. |
| LIT-1548 v2 | Dependent Indian Buffet Processes | Williamson, Orbanz & Ghahramani (2010), AISTATS 2010, PMLR 9: 924–931. To let binary latent feature models follow a distribution that changes over time, space or another covariate, a dependent IBP generates for each covariate value a binary matrix with unboundedly many columns, its evolution over the covariate controlled by a hierarchical Gaussian process whose covariance sets the dependence and exchangeability. MCMC inference; experiments find explicit dependence improves prediction (abstract). | Active — read 2026-10-26 (NOTE-1175) in full, from PMLR’s own PDF; worth reading for the thresholded-Gaussian-process construction that keeps each feature’s prevalence fixed over a covariate while its covariance sets persistence, the established comparator for a dynamic latent feature model (THEORY-1006). Read it knowing that its claim of IBP marginals at every covariate value holds for the whole matrix only in its collapsed model, that features stay independent of one another, and that its evidence is two prediction comparisons with the plain IBP. |
| LIT-1549 v3 | Causal Scrubbing: a method for rigorously testing interpretability hypotheses | Chan, Garriga-Alonso, Goldowsky-Dill, Greenblatt et al. (2022), Alignment Forum (Redwood Research). Causal scrubbing tests a mechanistic hypothesis, stated as a correspondence from an interpretable computational graph into the model’s, by replacing every activation with its value on another input the hypothesis treats as equivalent and measuring how much of the behaviour survives. On a parenthesis-balance classifier, hypotheses recover 93% down to 72% of the loss as they are made more specific; on induction in a two-layer attention-only model, a naive hypothesis recovers 35% and a refined one 86%. | Active — read 2026-10-26 (NOTE-1168) in full, the main post of the sequence from the Alignment Forum; worth reading for the method that turns a circuit hypothesis into a mechanical test, for the argument for resampling ablation that later circuit work adopts, and for its own list of the ways a hypothesis can pass while wrong. Read it knowing that the test sees only the partitions of the data a hypothesis induces (THEORY-978), that its two applications are summarized here and detailed in companion posts the record has not read, and that hypotheses recovering 72% to 86% are accepted under a test that permits only exact swaps. |
| LIT-1550 v2 | MIB: A Mechanistic Interpretability Benchmark | Mueller et al. (2025), arXiv:2504.13151, ICML 2025. A benchmark with a circuit-localization track over IOI, arithmetic, MCQA and ARC, and a causal-variable-localization track that adds RAVEL, on four language models plus an InterpBench model with a known circuit. In circuit localization, edge attribution patching with integrated gradients does best on average; in causal-variable localization, supervised distributed alignment search (DAS) does best, and sparse-autoencoder features selected by a learned mask are never better than the model’s own hidden dimensions. | Active — read 2026-10-26 (NOTE-1169) in full, from the arXiv copy (v2, the ICML 2025 version); worth reading for its fixed-counterfactual design of two localization tracks, for the finding that public sparse-autoencoder features were worse units than neurons for known causal variables in every cell tested (THEORY-968), and for the carry-the-one case, where a representation that looked like the variable was the correlated output digit. Read it knowing that the best causal-variable method, DAS, is supervised by the causal model it is scored against, that the SAE comparison is on residual streams of two models under one selection method, and that the method rankings are interpretability practice. |
| LIT-1551 v2 | Finding Alignments Between Interpretable Causal Variables and Distributed Neural Representations | Geiger, Wu, Potts, Icard & Goodman (2024; arXiv 2023), CLeaR 2024. Distributed alignment search (DAS) learns, by gradient descent, an orthogonal rotation of a layer such that swapping rotated subspaces between inputs reproduces a high-level causal model’s counterfactuals, replacing brute-force search over disjoint neuron sets. In a network trained on hierarchical equality and in BERT fine-tuned on monotonicity NLI it finds alignments with interchange intervention accuracy 1.00 where axis-aligned ones reach 0.73 and 0.51; BERT’s entailment subspace decomposes into the identities of the two words, the equality network’s relation subspace does not. | Active — read 2026-10-26 (NOTE-1192) in full, from arXiv v4, the CLeaR 2024 version; worth reading for distributed interchange interventions and their training objective, for the exact example in which an algorithm fails in the neuron basis and holds after a rotation, and for the finding that BERT’s entailment subspace decomposes into the two words’ identities while an equality network’s relation does not (THEORY-983). Read it knowing that IIA is reported on the rotation’s training data, that Table 2’s brute-force row is a copy of Table 1’s, that the learned subspaces are fixed only up to rotations within them, and that its random-network control reaches 0.64 at width 4,096 (THEORY-1002). |
| LIT-1552 v2 | Circuit Tracing: Revealing Computational Graphs in Language Models | Ameisen et al. (2025), Transformer Circuits Thread. A cross-layer transcoder, whose features each read the residual stream at one layer and write to every later MLP output, stands in for a model’s MLPs. On one prompt, with attention patterns and normalization denominators frozen and error terms added back, this local replacement model reproduces the model’s activations exactly, and its attribution graph decomposes each feature’s pre-activation into linear edges. The graphs, pruned and grouped into supernodes, give hypotheses about an 18-layer model and Claude 3.5 Haiku that are then tested by perturbing features in the underlying model. | Active — read 2026-10-26 (NOTE-1185), main text in full and five appendices, from the Transformer Circuits page; worth reading for the attribution graph, a prompt’s computation rewritten exactly in sparse features of a local replacement model (THEORY-979), for its own measurements of how far that replacement responds to perturbation like the model (THEORY-994), for the parallelogram constraint on one-step sums (THEORY-971), and for a limitations section that names where the method fails: attention, error nodes, inactive features. Read it knowing that the graphs explain the replacement, not the model, that intervening confirms a direct edge almost by construction, that the replacement matches the model’s top token on about half of prompts, and that its faithfulness figures differ between the main text and the appendix. |
| LIT-1553 v2 | Mixed Membership Stochastic Blockmodels | Airoldi, Blei, Fienberg & Xing (2008), JMLR 9: 1981–2014. For pairwise measurements such as links between objects, where the usual exchangeability assumptions fail, mixed membership stochastic blockmodels combine global parameters for dense patches of connectivity (the blockmodel) with node-specific mixed memberships. A variational algorithm gives fast approximate inference, applied to social and protein-interaction networks. | Active — read 2026-10-26 (NOTE-1179) in full, from the typeset JMLR copy; worth reading for the mixed membership stochastic blockmodel, in which a node takes one block per interaction drawn from its own membership vector, for the variational EM that fits it, and as the relational baseline a model of members’ perspectives must beat. Read it knowing that its §5 claim that the blockmodel and the memberships do not compete is asserted and fails for the likelihood given memberships, that its sparsity parameter is confounded with the blockmodel’s scale and its printed estimator is the fraction of zeros (THEORY-993), that K is chosen by criterion, that it cannot generate hubs, and that its protein-function check is against a weak baseline (THEORY-1008, Proposed). |
| LIT-1554 v2 | Transcoders Find Interpretable LLM Feature Circuits | Dunefsky, Chlenski and Nanda (2024), arXiv:2406.11944, NeurIPS 2024. A transcoder is a wide, sparsely activating ReLU MLP trained to imitate one MLP sublayer’s input–output map. With attention patterns frozen, the attribution of one transcoder feature to a later one factors into the earlier feature’s activation times an input-invariant dot product of decoder and encoder vectors, which allows weights-based circuit analysis through MLPs. On GPT2-small, Pythia-410M and Pythia-1.4B transcoders are at least on par with MLP SAEs in sparsity, faithfulness and human-rated interpretability, and they give a sparse account of MLP10 in GPT2-small’s greater-than circuit. | Active — read 2026-10-26 (NOTE-1174) in full, from the arXiv copy (v2, the NeurIPS 2024 version); worth reading as the source of transcoder circuit analysis, for the factorization of a feature-to-feature attribution into an input-dependent activation times an input-invariant weight (THEORY-974), on which the attribution graphs of LIT-1552 are built, and for its blind case studies, which grade the method against hidden prompts and report the failures. Read it knowing that the comparison with SAEs is one learning rate, one seed and three models (THEORY-1005), that Gemma Scope found the reverse on Gemma 2 2B (NOTE-482), that attention patterns are frozen and QK circuits are not explained, and that its counts of case studies disagree between sections. |
| LIT-1555 v2 | Crosscoding Through Time: Tracking Emergence & Consolidation Of Linguistic Representations Throughout LLM Pretraining | Bayazit, Mueller & Bosselut (2025), arXiv:2509.05291, ACL 2026. Sparse crosscoders trained between pairs and triplets of pretraining checkpoints with large performance and representation shifts discover and align features across checkpoints; a metric, Relative Indirect Effects (RelIE), traces the stage at which a feature becomes causally important for a task. Crosscoders detect feature emergence, maintenance and discontinuation during pretraining (abstract). | Active — read 2026-10-26 (NOTE-1186) in full, from the arXiv PDF of v2 (30 April 2026); worth reading for the method of tracking features across pretraining checkpoints with one joint dictionary, and for separating a feature’s presence (decoder norm) from its causal use (RelIE). Read it knowing that its developmental trends rest on the authors’ annotation of a few top features (THEORY-1004, Proposed), that it covers one layer and two or three checkpoints at a time, and that a feature shared across checkpoints is shared by construction of the dictionary, not shown to be carried forward. |
| LIT-1556 v4 | The Indian Buffet Process: An Introduction and Review | Griffiths & Ghahramani (2011), JMLR 12: 1185–1224. The Indian buffet process is a distribution over equivalence classes of sparse binary matrices with finitely many rows and an unbounded number of columns, usable as a prior for objects represented by a potentially infinite array of features. The paper derives it as the limit of a finite beta–Bernoulli model, illustrates it in an infinite latent feature model, and reviews its applications, extensions and connections to other stochastic processes (abstract). | Active — read 2026-10-26 (NOTE-1172) in full, from JMLR’s own PDF; worth reading for the derivation of the IBP as the limit of a finite beta–Bernoulli model, for K+ ~ Poisson(αH_N) and Poisson(α) features per object, and as a map of the IBP’s variants to 2010, including the Markov IBP closest to a dynamic feature model. Read it knowing that αH_N is stated for the limit only and the finite model’s expected count of occupied features is strictly below it (THEORY-999), that its posterior Gibbs sampler is by its own account heuristic, and that its demonstrations are single runs on data built to suit the model. |
| LIT-1558 v3 | Dominant contribution of Asgard archaea to eukaryogenesis | Tobiasson, Luo, Wolf & Koonin (2026). Hypothesis tests on constrained trees for widespread eukaryotic genes traced to the last eukaryotic common ancestor give Asgard archaea about half of all likelihood weight in the best-resolved families and the lead in nearly every functional system. The alphaproteobacterial contribution is small and centred on the mitochondrion (oxidative phosphorylation, Fe–S cluster assembly, mitochondrial translation). About a third of families point to other bacteria, scattered across functions, which the authors read as piecemeal gene transfer and not further symbioses. A test of stem lengths finds they do not track acquisition time. The authors infer a complex Asgard ancestor that took up the mitochondrion late. | Active — read in full 2026-10-27 (NOTE-1242) from the PubMed Central copy of the version of record (PMC12872458, open access); worth reading as the largest survey so far of where the last eukaryotic common ancestor’s genes came from, finding Asgard archaea the largest single source in nearly every functional system, the alphaproteobacterial share small and mitochondrial, and other bacteria diffuse (THEORY-1104), and for its test of the stem-length method, which it finds does not behave as a clock (THEORY-1101). Read it knowing that “dominant” means about half of likelihood weight among well-resolved families, not a count of genes; that the paper is itself mitochondrion-late; that its denial of further symbioses is read off the diffuseness of the bacterial signal, not shown; and that it rests on sparse, biased genome sampling, as the authors stress. |
| LIT-1560 v3 | Protein import into bacterial endosymbionts and evolving organelles | Sørensen, Stiller, Kröninger & Nowack (2024 online; 2025 issue). Review of the evidence for protein import from host into bacterial endosymbionts, long taken to mark an organelle off from an endosymbiont. Import of hundreds of proteins is established in two systems, the Paulinella chromatophore and the nitroplast, where the imported proteins come mostly from the host’s own genes or from other bacteria, so gene transfer from the endosymbiont is not required. Elsewhere there are one to seven targeted proteins per system. Each system uses its own targeting signal, and the mechanisms are largely unknown. | Active — read in full 2026-10-27 (NOTE-1241) from the PubMed Central copy of the version of record (PMC12176269, open access); worth reading as the system-by-system statement of what is known about host proteins entering bacterial endosymbionts, import at scale in the Paulinella chromatophore and the nitroplast and single proteins elsewhere, for its point that gene transfer from the endosymbiont is not needed for an organelle (THEORY-1100), and for its ordered scenario of effectors, dependence and general import (THEORY-1107). Read it knowing that it is a review whose import-at-scale evidence is two proteomic studies, that most single-protein cases rest on antibody localization, that the scenario is offered as plausible on limited data, and that import mechanisms are almost entirely unknown. |
| LIT-1561 v3 | Gene ancestries reveal diverse microbial associations during eukaryogenesis | Bernabeu, Manzano-Morales, Marcet-Houben & Gabaldón (2026). A revised reconstruction of the last eukaryotic common ancestor’s proteome, with thresholds calibrated on the accepted partners, finds two further bacterial donors, Myxococcota (3.92% of the proteome) and Planctomycetota (2.24%), comparable to Alphaproteobacteria (3.99%) and Asgard archaea (3.28%). Stem lengths order the acquisitions as waves, with Planctomycetota before the mitochondrion. About 4.5% of families have viral sisters, mostly giant viruses, some carrying prokaryotic genes. The authors suggest early eukaryotes arose within complex microbial communities through a succession of associations, while conceding their data cannot say whether any donor was a symbiont. | Active — read in full 2026-10-27 (NOTE-1237) from the PubMed Central copy of the version of record (PMC13468126, open access); worth reading as the strongest current case that the last eukaryotic common ancestor received genes from bacterial donors besides the mitochondrial ancestor, Myxococcota and Planctomycetota, in shares comparable to the accepted partners’, and for its ordering of those acquisitions as waves (THEORY-1105). Read it knowing that its thresholds are calibrated on the accepted partners; that its key controls are in a supplement; that the ordering rests on stem lengths as a clock, which Tobiasson et al. dispute; and that the authors say their data cannot tell whether any donor was a symbiont. |
| LIT-1564 v3 | Chimeric origins and dynamic evolution of central carbon metabolism in eukaryotes | Santana-Molina, Williams, Snel & Spang (2025). The last eukaryotic common ancestor had a complete central carbon metabolism of chimeric origin: six putative Asgard-archaeal enzymes, mainly in cytosolic glycolysis and the pentose phosphate pathway; seventeen alphaproteobacterial ones, mostly mitochondrial and ten in the TCA cycle; and others from various bacteria, with no third dominant donor. Gene loss, horizontal replacement and retargeting have remodelled it since, so that compartment no longer follows origin. The authors read the split as a trace of host–symbiont syntrophy, though the split is what any archaeal-host, bacterial-endosymbiont origin would leave. | Active — read in full 2026-10-27 (NOTE-1239) from the PubMed Central copy of the version of record (PMC11976288, open access); worth reading as a careful, enzyme-by-enzyme history of eukaryotic central carbon metabolism, showing Asgard contributions to cytosolic glycolysis and the pentose phosphate pathway, alphaproteobacterial ones mostly in the mitochondrial TCA cycle, other donors with none dominant, and extensive later replacement and retargeting (THEORY-1109). Read it knowing that it rests on 64 single-gene trees, several weakly supported and all in the supplement; that alphaproteobacterial contributions outnumber Asgard ones 17 to six; and that its support for syntrophy comes from a compartment split that any archaeal-host, bacterial-endosymbiont model predicts, so it does not discriminate syntrophy-first from complexity-first scenarios. |
| LIT-1566 v3 | Dated gene duplications elucidate the evolutionary assembly of eukaryotes | Kay et al. (2026). A relaxed molecular clock dates 135 gene duplications on the two eukaryotic stem lineages, inside a species tree that puts the archaeal branch point at 3.05–2.79 billion years ago, the alphaproteobacterial one at 2.37–2.13 and LECA at 1.80–1.67. Taking the onset of duplications in genes from the mitochondrial partner, about 2.2 billion years ago, as the start of endosymbiosis, most host-side duplications (actin and tubulin, vesicle trafficking, nuclear-targeted paralogues) are older and most other bacterial duplications are younger. The authors reject mitochondrion-early scenarios, argue against serial endosymbiosis, and favour a complexified-archaean, late-mitochondrion sequence. The dates are maximum ages for paralogue functions, and the authors cannot order phagocytosis and the mitochondrion. | Active — read in full 2026-10-27 (NOTE-1234) from the PubMed Central copy of the version of record (PMC12872463, CC BY 4.0); worth reading as the first relaxed-clock dating of the duplications on both eukaryotic stem lineages, which puts most host-side duplications (cytoskeleton, trafficking, nuclear targeting) before the onset of duplications in genes from the mitochondrial partner at about 2.2 billion years ago, and most other bacterial duplications after it (THEORY-1099). Read it knowing that each date is a maximum age for its paralogues’ functions and many intervals reach below 2.2 billion years; that equating the onset of symbiont-gene duplication with endosymbiosis is argued, not tested; that the priors let archaeal duplications be older than any alphaproteobacterial one; and that the authors cannot order phagocytosis and the mitochondrion, though the abstract lists phagocytotic machinery among the features that came first. |
| LIT-1568 v3 | The Black Queen Hypothesis: Evolution of Dependencies through Adaptive Gene Loss | Morris, Lenski & Zinser (2012). In free-living bacteria such as Prochlorococcus and Pelagibacter, loss of a costly, leaky function whose products are public goods is favoured at the individual level, and proceeds until production just suffices for the community, leaving the losers dependent on co-occurring helpers. Selection, not drift, makes the dependency. The one worked case is Prochlorococcus’s loss of catalase-peroxidase (katG). | Active — read in full 2026-10-27 (NOTE-1212) from the PubMed Central copy of the version of record (PMC3315703, CC BY-NC-SA); worth reading as the selection route to microbial dependency, in which losing a costly, leaky function is favoured until helpers just supply the community (THEORY-1048). Read it knowing that it is an opinion piece with one worked case (katG in Prochlorococcus) whose benefit is computed, not measured; that it is stated for free-living microbes and credits drift for endosymbiont reduction; that its equations assume linear responses; and that its other examples and the “shooting the moon” acceleration are suggestions. |
| LIT-1570 v3 | The Evolution of Dependence and Cohesion in Incipient Endosymbioses | Athreya, Czuppon & Gokhale (2025). An adaptive-dynamics model characterizes endosymbiosis by two collective properties, mutual dependence (survival as a collective) and reproductive cohesion (synchronized reproduction). The faster-growing partner becomes fully obligate first, and the other’s dependence then stays, rises or falls with births and deaths inside the collective. Dependence evolves at all only if the collective’s carrying capacity is high enough. Early on, dependence outruns cohesion, but only under the authors’ chosen trait mapping, which their own appendix shows decides the result. | Active — read in full 2026-10-27 (NOTE-1211) from the bioRxiv preprint, version 2 of 2025-05-31 (CC BY-NC 4.0), not the version of record, which was not reached; worth reading as the first model to separate mutual dependence from reproductive cohesion in an incipient endosymbiosis, with logistic growth for host, symbiont and collective, and for its results that the faster-evolving partner becomes obligate first and that the other’s fate turns on births and deaths inside the collective (THEORY-1051). Read it knowing that its headline result, dependence evolving ahead of cohesion, is fixed by the authors’ choice of how traits enter free growth and dissociation and reverses under the opposite choice in their own appendix (THEORY-1050); that nothing is tested against data, as the authors say; and that obligacy is a phenomenological trade-off, not gene loss. |
| LIT-1571 v3 | How do bacterial endosymbionts work with so few genes? | McCutcheon, Garber, Spencer & Warren (2024). An “Unsolved Mystery” essay on how radically reduced, compositionally biased endosymbiont gene sets function and interact with the host cell. Below about 400 kb endosymbionts lose the ability to build their own envelope, and below about 200 kb, the “tipping point”, translation-related genes erode. Host supply of membranes, transport and translation components is proposed, not shown. | Active — read in full 2026-10-27 (NOTE-1213) from the PubMed Central copy of the version of record (PMC11020763, CC BY); worth reading as the current statement of what endosymbionts with the smallest genomes lack, envelope biogenesis below about 400 kb and parts of translation below about 200 kb, and of the host’s presumed role in supplying them (THEORY-1049). Read it knowing that the thresholds come from a hand-picked matrix with draft genomes, that the composition analysis is called preliminary, and that every mechanism of host supply it names is a hypothesis. |
| LIT-1574 v3 | The Oxymonad Genome Displays Canonical Eukaryotic Complexity in the Absence of a Mitochondrion | Karnkowska et al. (2019). The genome of Monocercomonoides exilis is as complex as other eukaryotes’ and less reduced than some other metamonads’; its nuclear machinery, cytoskeleton, endomembranes and biosynthetic pathways are canonical. The authors find two preadaptations for losing the mitochondrion: the SUF Fe–S system, which replaced the mitochondrial pathway in all examined relatives including some that kept a mitochondrion-related organelle, and the later loss of the glycine cleavage system and SHMT. Mitophagy went with the organelle, and no compensating change was found. | Active — read in full 2026-10-27 (NOTE-1243) from the PubMed Central copy of the version of record (PMC6759080, open access); worth reading as the account of what happened to the rest of a eukaryotic cell when its mitochondrion was lost, which is almost nothing, and of the two preadaptations that emptied the organelle of essential jobs before it went (THEORY-1098). Read it knowing that it is homology searches on a draft genome with most gene lists in supplementary tables, that “no compensating change” is an absence bounded by annotation, that the order of the preadaptations is inferred from relatives, not dated, and that a highly reduced mitosome below microscopic resolution is not excluded. |
| LIT-1575 v3 | Curve Detectors | Cammarata et al. (2020), Distill, doi:10.23915/distill.00024.003. The first of a planned three-part study of curve detectors in InceptionV1, on their behaviour. The ten curve units of layer mixed3b each prefer a curve of one orientation and jointly span all orientations, and are argued to detect curves causally, generally and purely: by feature visualization, a blind hand-labelling of over 800 dataset examples of unit 3b:379, attribution, rotated dataset examples and synthetic curves that drive the unit up to 24 standard deviations above its dataset mean. Curve families are also found in three neighbouring layers. How the units are built from earlier ones is left to the next article. | Active — read 2026-10-27 (NOTE-1198) in full, from the Distill article; worth reading as the first detailed case for one neuron family in a trained vision model, the ten curve units of InceptionV1’s mixed3b, argued by feature visualization, blind hand-labelling of dataset examples, attribution, rotation tuning and synthetic stimuli (THEORY-1028). Read it knowing that the dataset analysis is of one unit, 3b:379, that the circuit, the downstream use and the hand-written reimplementation that Zoom In counts among its seven arguments are deferred again to a later article of the thread, and that its claim of purity is not settled here (THEORY-1022). |
| LIT-1576 v2 | Transformer Feed-Forward Layers Are Key-Value Memories | Geva et al. (2021), arXiv:2012.14913, EMNLP 2021. A transformer feed-forward layer, f(x·Kᵀ)·V, is an unnormalized key–value memory: each key correlates with textual patterns in training prefixes and each value induces a distribution over the output vocabulary. In a 16-layer WikiText-103 model, keys’ patterns are shallow in lower layers and semantic in upper ones; upper-layer values favour the token that follows their key’s patterns; a layer’s output composes hundreds of memories, and the residual stream refines the prediction from layer to layer. | Active — read 2026-10-27 (NOTE-1200) in full, from the arXiv copy (v2, the EMNLP 2021 version); worth reading as the origin of the reading of a transformer’s MLP as a key–value memory, with each hidden unit a key over input patterns and each output row a value over the vocabulary, and for its evidence in one 16-layer language model: keys whose top training prefixes share recognizable patterns, shallow below and semantic above, and upper-layer values that agree, weakly, with what follows those patterns (THEORY-1033). Read it knowing that the general reading is wider than the evidence (THEORY-1030), that the agreement it reports peaks at about 3.5%, that the patterns were labelled by one annotator per key, and that ROME and MEMIT took the matrix-level version of the idea, not this unit-level one. |
| LIT-1577 v3 | The Infinite Factorial Hidden Markov Model | Van Gael, Teh & Ghahramani (2008), NIPS 21: 1697–1704. The Markov Indian buffet process is a distribution over binary matrices with one row per time step and unboundedly many columns, each column a two-state Markov chain from an off state, with its own probability of switching on, a_m ~ Beta(α/M, 1), and of staying on, b_m ~ Beta(γ, δ). Its limit as M → ∞, a sequential buffet and a stick-breaking construction are derived. The number of features ever on is Poisson(αH_T). It is used as the prior of a nonparametric factorial HMM, which separates five speakers in mixed speech better than an IBP prior does. | Active — read 2026-10-27 (NOTE-1199) in full, from the NeurIPS proceedings’ own PDF; worth reading as the origin of the Markov Indian buffet process, the IBP’s extension to features that switch on and off over time, in which each feature has its own probability of turning on and, drawn independently of it, of staying on (THEORY-1034). Read it knowing that its sequential buffet misprints both of its predictive rules, that after the first time step the expected number of active features is no longer the IBP’s α (THEORY-1019), that it models one sequence and not several objects over time, and that its experiments are two single runs on mixed speech. |
| LIT-1578 v2 | Does Localization Inform Editing? Surprising Differences in Causality-Based Localization vs. Knowledge Editing in Language Models | Hase et al. (2023), arXiv:2301.04213, NeurIPS 2023. On 652 CounterFact facts GPT-J knows, the layer where causal tracing places a fact does not predict at which MLP layer an edit of that fact succeeds: regressing edit success on the edit layer explains most of its variance, and adding the tracing effect adds at most 3.2 points of R², across ROME, MEMIT, constrained fine-tuning and five editing problems, and again on GPT-2 XL, zsRE and representation zeroing. Only Fact Forcing, which edits on the same noised input tracing uses, shows a small reliable relation. | Active — read 2026-10-27 (NOTE-1194) in full, from the arXiv copy (v2, the NeurIPS 2023 version); worth reading as the direct test of whether causal tracing tells where to edit a fact: in GPT-J, fact by fact, it does not. The tracing effect at a layer adds at most 3.2 points of explained variance in edit success once the edit layer is known, and ROME’s rewrite score is above 96% at every layer but the last (THEORY-1024). Read it knowing that its own account of why, that tracing and editing answer different questions, is offered and not tested (THEORY-1026), that “where a fact is stored” means where causal tracing peaks, and that its Table 3 and Figure 6 disagree on one cell. |
| LIT-1579 v2 | Causal scrubbing: results on induction heads | Chan, Garriga-Alonso, Goldowsky-Dill, Greenblatt, Lin et al. (2022), Alignment Forum (Redwood Research). In a two-layer attention-only language model with two induction heads, the standard induction story (queries and values from the token embedding, keys from the previous-token head) recovers 35% of the loss the induction heads contribute on tokens where induction helps. Letting the heads match the last three tokens, read layer 0’s average effect, and treat three layer-0 heads that attend to copies of the current token as attending to itself raises it to 86%, and to 89% with a crude model of where the previous-token head deviates. | Active — read 2026-10-27 (NOTE-1196) in full, from the Alignment Forum’s own API; worth reading as the quantified test of the textbook induction circuit in a two-layer attention-only model, pathway by pathway, and for what the refinements found: three-token matching, layer-0 heads that attend to copies of the current token, and a previous-token head that deviates on quotes, articles and punctuation (THEORY-1020). Read it knowing that its percentages are of the 0.053 nats the induction heads contribute on a filtered token subset, not of a label-shuffled loss like the paren post’s, that its headline 89% is the bonus hypothesis and the main post’s 86% the fourth, and that the model is not published. |
| LIT-1580 v2 | Causal scrubbing: results on a paren balance checker | Chan, Garriga-Alonso, Goldowsky-Dill, Greenblatt, Lin et al. (2022), Alignment Forum (Redwood Research). Causal scrubbing applied to a three-layer, two-head bidirectional transformer that classifies parenthesis strings as balanced. The high-level hypothesis (two heads carry an equal-count-and-starts-open test, one head the horizon test) recovers 88–93% of the loss; making it specific about how the heads compute their tests brings it to 72%. Two still more specific hypotheses score higher than the one they refine, which the authors judge illegitimate. | Active — read 2026-10-27 (NOTE-1195) in full, from the Alignment Forum’s own API; worth reading as the worked case of causal scrubbing on a model whose algorithm is known, with the full table of hypotheses, their losses and standard errors, and for the authors’ own finding that two more specific hypotheses scored higher for reasons they judge illegitimate (THEORY-1029). Read it knowing that the model and the prior dissection are unpublished, that every number is one run of 2,000 scrubbed samples, and that its prose states the horizon test backwards in two places. |
| LIT-1581 v2 | Attribution Patching: Activation Patching At Industrial Scale | Nanda (2023), blog post, neelnanda.io. Introduces attribution patching: a first-order estimate of every activation-patching effect at once, the difference between clean and corrupted activations dotted with the metric’s gradient on the corrupted run, from two forward passes and one backward pass instead of one forward pass per patch. On the IOI task in GPT-2 Small it approximates head-level patches well and residual-stream and first-MLP patches badly. The author offers it as an exploratory heuristic for finding what to patch, not a replacement for patching. | Active — read 2026-10-27 (NOTE-1201) in full, from the author’s own page; worth reading as the origin of attribution patching, for its derivation of the estimate and the identities that make it cheap and additive (THEORY-1023), for the account of where a first-order estimate should fail (THEORY-1021), and for its framework of what patching can and cannot show: sufficiency against necessity, specific against general understanding, and parallel against serial redundancy. Read it knowing that the author calls it an incomplete project, that its empirical evidence is one task in GPT-2 Small shown only in plots and a notebook, and that the systematic test is Kramár et al. (LIT-1531). |
| LIT-1582 v2 | Mass-Editing Memory in a Transformer | Meng et al. (2022), arXiv:2210.07229, ICLR 2023. MEMIT inserts many facts at once by treating each MLP output matrix in a range of layers implicated by causal tracing as a linear associative memory, solving a least-squares update for the whole batch, and spreading each fact’s required change over those layers. On GPT-J it inserts 10,000 CounterFact counterfactuals with score 85.8, against 50.3 for ROME applied one fact at a time, and does likewise on GPT-NeoX (82.0) and for 10,000 true zsRE facts. | Active — read 2026-10-27 (NOTE-1197) in full, from the arXiv copy (v2, the ICLR 2023 version); worth reading as ROME’s extension from one edit to thousands, by a closed-form least-squares update spread over the range of MLP layers that causal tracing implicates, and for the scaling curves that show sequential single edits failing where it holds (THEORY-1031). Read it knowing that it inherits ROME’s storage reading (THEORY-1011) rather than testing it, that its layer range is chosen from traces averaged over facts, which Hase et al. (LIT-1578) show do not predict per fact where an edit works, and that its zsRE specificity hardly moves for any method. |
| LIT-1583 v2 | Causal scrubbing: Appendix | Chan, Garriga-Alonso, Goldowsky-Dill, Greenblatt et al. (2022), Alignment Forum (Redwood Research). The technical appendix to causal scrubbing. It defines ”% loss recovered” against a label-shuffled baseline and argues against zero and mean ablation with three examples. It proves that the inputs the algorithm samples are the maximum-entropy distribution preserving the joint inputs of every interpretation node, shows how a superposed toy model is explained as monosemantic terms plus an unexplained interference term, and builds a false hypothesis that scores far above the model. It proposes, without solving, adversarial validation. | Active — read 2026-10-27 (NOTE-1202) in full, from the Alignment Forum’s own API; worth reading for the details the main post defers: the definition of the metric, the full case against zero and mean ablation, how unimportant inputs are grouped, a proof that the scrubbed inputs are the maximum-entropy distribution consistent with the hypothesis (THEORY-1025), how superposition is handled, and a second constructed false hypothesis that scores above the model. Read it knowing that its Lemma 1 says “product distribution” where its proof shows the joint, and that it says both results posts use a randomized-loss baseline when the induction post does not. |
| LIT-1584 v2 | Auditing language models for hidden objectives | Marks, Treutlein et al. (2025), arXiv:2503.10965. Claude 3.5 Haiku is given continued pretraining on synthetic documents describing 52 fictional reward-model biases, then trained by SFT and RL to exploit 47 of them and to hide why. It comes to exploit the 5 held-out biases, and new ones described to it in context, more often, which the authors take as a learned objective of reward-model sycophancy. In a blind auditing game the three teams with weights and training data found the objective, by sparse-autoencoder features, prefill attacks and data search, and the API-only team did not. An unblinded study of eight techniques finds sparse-autoencoder features matched by simple semantic search in some uses and better in others. | Active — read 2026-10-27 (NOTE-1193) in full, from arXiv v2; worth reading as the construction and validation of the model organism on which the Biology paper’s hidden-goal case (THEORY-976) is run, for its behavioural definition of an objective tested by generalization to behaviours never reinforced (THEORY-1032), and for a blind auditing game and an unblinded comparison of eight auditing techniques, in which sparse-autoencoder features were matched by semantic search on the fastest team’s query but succeeded where it failed on others (THEORY-1027). Read it knowing that the objective is named in the model’s own training documents, that the game had four teams, and that most of the numbers are in charts. |
| LIT-1589 v2 | Legal Consequences of the Separation of the Chagos Archipelago from Mauritius in 1965 | ICJ (2019), advisory opinion of 25 February 2019. By 13 votes to 1, the decolonization of Mauritius was not lawfully completed in 1968, because the Chagos Archipelago was detached in 1965 without the free and genuine will of the people of the territory, a colony’s consent given under its administering Power’s authority not counting; the UK’s continued administration is a continuing wrongful act to be ended as rapidly as possible, and all Member States must co-operate to complete the decolonization. Resettlement of Chagossians is called a human-rights issue for the General Assembly and is not decided. | Active — read 2026-10-29 (NOTE-1361) in full, from the UN’s official copy of the opinion, A/73/773 (the Court’s own PDF returned a Cloudflare 403); worth reading as the Court’s holding that a colony’s consent to its own partition, given under the administering Power’s authority, is not the free will of its people, so that Mauritius’s decolonization was not lawfully completed and the UK’s administration of the Chagos is a continuing wrongful act. Read it knowing that it is advisory, that its ‘people’ is the people of the whole colony of Mauritius, not the Chagossians, and that it leaves their return to the General Assembly in one sentence (para. 181) with no operative point; the separate opinions and dissent were not read. |
| LIT-1590 v2 | Changes in Endosymbiont Complexity Drive Host-Level Compensatory Adaptations in Cicadas | Campbell et al. (2018). Where Hodgkinia has split into essential lineages of very uneven abundance, rare lineages risk loss at the transmission bottleneck from mother to egg, and a simulation shows the cells needed per egg rising steeply with complexity. Counts in eggs of four cicada species find Sulcia roughly constant and Hodgkinia up to about six times higher in Magicicada septendecim than in a single-lineage species, though only that species differs significantly. Every sampled egg carried every tracked lineage, and the transmission route looks unchanged. The authors read the raised titre as host compensation and a cost of fragmentation, and speculate that it could feed further splitting. | Active — read in full 2026-10-27 (NOTE-1235) from the PubMed Central copy of the version of record (PMC6234865, CC BY 4.0); worth reading as the record’s one documented case of a host compensating for its symbiont’s changes at transmission: cicadas whose Hodgkinia has split into many lineages send more Hodgkinia cells to each egg, not more Sulcia, and every sampled egg carried every tracked lineage (THEORY-1106). Read it knowing that the rise in titre is significant for one species, Magicicada septendecim, of four compared, with five or six eggs each and no phylogenetic control; that the six-lineage species does not differ significantly from single-lineage ones; that lineage presence was tracked by one or two marker genes; and that the order of cause, splitting before titre, is inferred. |
| LIT-1591 v2 | Isolation of an archaeon at the prokaryote–eukaryote interface | Imachi et al. (2020). After 12 years from sampling to culture, an Asgard archaeon related to Lokiarchaeota, Candidatus Prometheoarchaeum syntrophicum MK-D1, was obtained in stable co-culture with a methanogen. It is an anaerobic, extremely slow-growing small coccus that degrades amino acids only in syntrophy, passing hydrogen and formate to partners that can be exchanged, and it has long branching protrusions but no visible internal compartments. From its genome and other Asgard genomes the authors infer that the Asgard ancestor was a partner-dependent amino-acid degrader, and they propose the entangle–engulf–endogenize model of eukaryogenesis as a hypothesis. | Active — read in full 2026-10-27 (NOTE-1238) from the PubMed Central copy of the version of record (PMC7015854, CC BY 4.0); worth reading as the first physiology of an Asgard archaeon, a small, internally simple coccus with branching protrusions that grows only in syntrophy, handing hydrogen and formate to partners that can be exchanged, and for the authors’ inference that the Asgard ancestor was likewise partner-dependent (THEORY-1108). Read it knowing that the organism was grown only in co-culture, never alone; that it is the closest relative of eukaryotes among cultured organisms only; that the ancestral lifestyle is inferred from gene presence in metagenome-assembled genomes; that the entangle–engulf–endogenize model is, in the authors’ words, hypothetical and not definitive; and that the model is not the hydrogen hypothesis, since here the host makes the hydrogen. |
| LIT-1593 v2 | “That’s When the Nightmare Started”: UK and US Forced Displacement of the Chagossians and Ongoing Colonial Crimes | Human Rights Watch (2023). Interviews with 43 Chagossians in the UK, Mauritius and the Seychelles, 14 others, and a documentary record drawn largely from UK court judgments. It shows UK officials planning the 1965–73 removal with the US and calling the islanders non-permanent to avoid UN reporting, and argues that the expulsion, the continuing bar on return and treatment on racial grounds are crimes against humanity — continuing deportation or forcible transfer, other inhumane acts, and persecution — by the UK, the first jointly with the US. It asks for return, compensation and satisfaction. | Active — read 2026-10-29 (NOTE-1365) in full, from Human Rights Watch’s own PDF; worth reading as the documented account, from UK files quoted in English judgments and 43 Chagossian interviews, that UK officials planned the removal with the US and described the islands as having no permanent population, knowing otherwise, to avoid reporting to the UN, and as the case that the continuing bar on return is a continuing crime against humanity. Read it knowing that it is an advocacy report, that the archival quotations are at one remove, that its interviewees were reached through representative groups, that its continuing-crime theory has not been tested in an international court, and that the governments’ replies in its annexes are page images not read here. |
| LIT-1594 v2 | Technologies of Humility: Citizen Participation in Governing Science | Jasanoff (2003), Minerva 41: 223–244. Predictive ‘technologies of hubris’ — risk assessment, cost–benefit analysis, modelling — understate what lies outside their frame, pre-empt political debate and cannot take in challenges to their framing, and formal participation does not cure this. She proposes ‘technologies of humility’, habits of thought organized around framing, vulnerability, distribution and learning: ‘what is the purpose; who will be hurt; who benefits; and how can we know?‘ | Active — read 2026-10-29 (NOTE-1357) in full, from a copy of the published article on a University of Colorado course page (sciencepolicy.colorado.edu, ENVS 5100); worth reading as the source of the pair ‘technologies of hubris’ and ‘technologies of humility’, and of four focal points — framing, vulnerability, distribution, learning — for deliberating on what predictive methods leave out. Read it knowing that it is a programmatic essay about assessing technologies before adoption, not about measuring harms after, that it argues formal participation is not enough, and that its focal points are proposed and untested. |
| LIT-1595 v2 | Late acquisition of mitochondria by a host with chimaeric prokaryotic ancestry | Pittis & Gabaldón (2016). For 1,078 protein families inferred in the last eukaryotic common ancestor, the branch to the closest prokaryotic relatives, corrected for each family’s rate, is shortest for families of alphaproteobacterial origin and mitochondrial location, longer for other bacterial families, which associate with endomembranes, and longest for archaeal families, which associate with the nucleus. The authors read this as late acquisition of the mitochondrion by a host whose genome already held genes of several bacterial origins, by partners or by transfer. The reading of length as time assumes proportional rates before and after LECA, and the alphaproteobacterial difference from other bacteria is P = 0.044. | Active — read in full 2026-10-27 (NOTE-1240) from the PubMed Central author manuscript (PMC4780264), not the version of record; worth reading as the first proteome-wide test of mitochondrion-early against mitochondrion-late, and for its finding that LECA families sort by origin and cell location (alphaproteobacterial with the mitochondrion, other bacterial with endomembranes, archaeal with the nucleus), with alphaproteobacterial families nearest their prokaryotic relatives (THEORY-1102). Read it knowing that stem length is read as time only under the assumption that rates before and after LECA are proportional; that the alphaproteobacterial difference from other bacteria, on which the chimaeric host turns, is P = 0.044; that stem length also shortens when a closer relative is sampled, as its own Lokiarchaeota control shows; and that it cannot say whether the chimaera came from partners or from gene transfer. |
| LIT-1596 v2 | Genome sequence of the endocellular bacterial symbiont of aphids Buchnera sp. APS | Shigenobu et al. (2000). The first complete genome of an obligate insect endosymbiont: Buchnera sp. APS, maternally transmitted in aphid bacteriocytes, has a 640,681-bp chromosome with 583 ORFs and two small plasmids, a subset of E. coli’s gene set reached by loss. It keeps the genes for the amino acids essential to the host and lacks almost all of those for non-essential ones, and uses host-made glutamate and aspartate as precursors, so the two partners’ pathways interlock. It also lacks phospholipid and lipopolysaccharide synthesis, nearly all transcriptional regulators, and recA and uvrABC. The authors infer that it can live only in the bacteriocyte, with membrane lipids perhaps from the host, and compare it to an organelle. All of this is read from gene content. | Active — read in full 2026-10-27 (NOTE-1236) from the publisher’s free PDF of the version of record; worth reading as the first complete genome of an obligate insect endosymbiont, and for its gene-by-gene account of a symbiont that keeps the amino-acid pathways its host lacks, draws precursors from the host, and has lost phospholipid synthesis and nearly all its own regulators (THEORY-1103). Read it knowing that every functional statement is inferred from gene content in one strain, that the host’s dependence is cited from earlier work and maternal transmission stated, neither shown here, and that it names no mechanism of genome reduction: drift and Muller’s ratchet are not in it. |
| LIT-1600 v2 | The Supreme Court, 1978 Term | Fiss (1979), the Foreword ‘The Forms of Justice’, 93 Harv. L. Rev. 1. Adjudication gives meaning to public values; structural reform, in which a judge reorganizes a state bureaucracy that threatens constitutional values, through a continuing injunction, is a form of it, and dispute resolution has no normative priority over it. The court’s legitimacy rests on its process, dialogue and independence, not on consent. The remedy is instrumental and revisable, not deduced from a violation; because success depends on actors the judge cannot control, the remedy threatens his independence and the right bends to fit it. | Active — read 2026-10-29 (NOTE-1364) in full, from Yale Law School’s repository (openYLS, fss_papers/1220); worth reading as the defence of structural reform as adjudication: courts exist to give meaning to public values, not to resolve disputes, so a judge may restructure a state bureaucracy through a continuing, revisable injunction, in which victim, spokesman and beneficiary come apart and the wrongdoer disappears. Read it knowing that its hard problem is the remedy — rights and remedies jointly fix a value’s meaning, and a judge dependent on others for success ‘will tailor the right to fit the remedy’ — and that Fiss leaves this as a dilemma to live with; the formula ‘Reversal ≠ Repair ≠ Structural reform’ is the exchange’s, not his. |
| LIT-1601 v2 | Violence and the Word | Cover (1986), 95 Yale L.J. 1601–1629. Legal interpretation ‘takes place in a field of pain and death’: a judge’s interpretation is a mandate for the deeds of others in roles, so its meaning depends on a social organization of violence — secondary rules that make wardens heed judicial papers, and plural courts so that no single mind’s interpretation becomes a deed — and must attend to the conditions of effective enforcement. Perpetrator and victim of that violence cannot share its meaning. | Active — read 2026-10-29 (NOTE-1384) in full, from Yale Law School’s repository (openYLS, Yale Law Journal collection); worth reading as the account of legal interpretation as an act whose meaning is bound to deeds others carry out in roles: a judge’s word becomes violence only through enforcers who heed it, so interpretation attends to ‘the conditions of effective domination’, and when the role structure fails the judge’s words change meaning, as in Judge Stern’s Tiede sentence. Read it knowing that it argues from criminal sentencing and the death penalty, in US institutions, that its psychology is Milgram’s, and that it does not treat enforcers faced with rival authorities. |
| LIT-1604 v2 | Autocratic Legalism | Scheppele (2018), 85 U. Chi. L. Rev. 545–583. Leaders elected on a mandate to sweep away the old order use constitutional amendment, legislation and appointments to capture the courts, election bodies, media and other checks on them, borrowing tactics from one another (Hungary, Poland, Turkey, Russia, Venezuela, Ecuador). They keep democratic and legal forms and avoid the mass rights violations publics have learned to recognize, so the attack on liberal constitutionalism is carried out in the forms of law and seen too late. | Active — read 2026-10-29 (NOTE-1390) in full, from the University of Chicago Law Review’s own PDF (the Chicago Unbound copy returned a Cloudflare 403); worth reading as the profile of elected leaders who capture courts, election bodies and media by constitutional amendment, legislation and appointment, borrowing tactics from one another and avoiding the signals of twentieth-century tyranny. Read it knowing that it is a symposium essay built from case narratives, that the leaders’ intent and the borrowing are inferred, not shown, that its autocrats change the standards and the correctors rather than only the cost of correction, and that its remedy is a page on civic education. |
| LIT-1606 v2 | Noem v. Abrego Garcia | Supreme Court (2025). On the government’s application, the Court left in place the requirement that the government “facilitate” Abrego Garcia’s release from custody in El Salvador, where it acknowledged he had been removed in violation of a withholding order, and asked the district court to clarify its direction to “effectuate” his return, with deference to the executive in foreign affairs; the government was to be prepared to share the steps it had taken. Three justices would have denied the application in full. | Active — read 2026-10-29 (NOTE-1376) in full, from the Court’s own slip opinion on supremecourt.gov; worth reading as the order that upheld a district court’s power to require the government to “facilitate” release from a foreign state’s custody, on the government’s own acknowledgment that the removal was illegal, while leaving open whether it could require the government to “effectuate” return. Read it knowing that it is a two-page interim order with one paragraph of reasons, that its facts are the parties’ representations, and that the four-page document includes a statement by three justices, not the Court, rejecting the argument that courts lose power once a deportee crosses the border. |
| LIT-1619 v2 | El-Masri v. the former Yugoslav Republic of Macedonia | ECtHR Grand Chamber (2012), unanimous. The former Yugoslav Republic of Macedonia was responsible for inhuman and degrading treatment in 23 days’ incommunicado detention in a Skopje hotel, for torture by a CIA rendition team at Skopje Airport carried out with its agents’ acquiescence and help, for handing him to US custody despite a real risk of further ill-treatment it knew or ought to have known of, for his whole captivity in Afghanistan under Article 5 as an enforced disappearance, and for the lack of an effective investigation; EUR 60,000 awarded. | Active — read 2026-10-29 (NOTE-1391) in full, from the Court’s own HUDOC copy of the judgment (93 pages, with both concurring opinions); worth reading as the Grand Chamber’s holding that a state which handed a man to CIA agents is responsible for their torture of him on its territory with its acquiescence, for exposing him to a real risk of ill-treatment abroad, and under Article 5 for his whole captivity abroad, with the burden of proof on the state once he entered its control. Read it knowing that the facts were found by inference against a non-cooperating state, that the receiving state’s responsibility is expressly not decided, and that the person was free by the time of judgment, so the question of who could undo a continuing transfer does not arise in it. |
| LIT-1622 v2 | Beam Sampling for the Infinite Hidden Markov Model | Van Gael, Saatci, Teh & Ghahramani (2008), ICML ‘08: 1088–1095. For the infinite hidden Markov model (the HDP-HMM), an auxiliary variable u_t ~ Uniform(0, π_{s_{t−1}s_t}) per time step leaves only finitely many trajectories with positive probability, so a whole state sequence can be resampled by dynamic programming without truncation. On synthetic data, a well-log changepoint series and character prediction in Alice in Wonderland, the beam sampler mixes in fewer iterations and is less sensitive to initialization and priors than the Gibbs sampler, at a cost per iteration close to O(TK) in practice. | Active — read 2026-10-27 (NOTE-1204) in full, from the authors’ own copy of the ICML paper; worth reading for the beam sampler, which adds a uniform slice variable under each transition so that only finitely many state trajectories of the infinite HMM have positive probability, and then samples a whole trajectory exactly by forward filtering, backward sampling (THEORY-1037). The infinite factorial HMM’s inference is built on it. Read it knowing that its case for faster mixing than Gibbs sampling rests on charts, synthetic data and one changepoint series judged by eye (THEORY-1044), and that one of its fixed hyperparameter settings was chosen from the samplers’ own results. |
| LIT-1623 v2 | Infinite Latent Feature Models and the Indian Buffet Process | Griffiths & Ghahramani (2005), NIPS 18. A finite model in which each of K features has prevalence π_k ~ Beta(α/K, 1) and each of N objects holds it with probability π_k has, as K → ∞, a limit on left-ordered equivalence classes of binary matrices; the Indian buffet process, in which customer i takes each earlier dish with probability m_k/i and then Poisson(α/i) new ones, produces the same distribution. It is used as the prior of an infinite binary linear-Gaussian latent feature model, with a Gibbs sampler, on 100 photographs of up to four objects. | Active — read 2026-10-27 (NOTE-1208) in full, from the NeurIPS proceedings’ own PDF; worth reading as the paper that introduces the Indian buffet process, the limit of a finite beta–Bernoulli feature model taken on left-ordered equivalence classes, and its sequential buffet, which produce the same distribution (THEORY-1043). Read it knowing that its eight pages state the limit and defer the technical details to a technical report, that it gives K+ ~ Poisson(αH_N) only through the buffet, with no count for the finite model, and that its one demonstration is a single run on 100 staged photographs, in which three of the four main features code an object’s absence. |
| LIT-1624 v2 | An Overview of Early Vision in InceptionV1 | Olah et al. (2020), Distill (printed DOI 10.23915/distill.00024.002, unregistered on 2026-10-27). A guided tour of InceptionV1’s first five layers (conv2d0, conv2d1, conv2d2, mixed3a, mixed3b; 1,056 units), every unit sorted into one of 77 “neuron groups” with its share of the layer, and selected circuits (complex Gabors, a black-and-white detector, small circles, triangles, boundary, curve-based and oriented-fur detectors). The authors call the groups ad hoc and many of them low-confidence; by their own captions 37% of the units are in catch-all, broad, low-confidence or unstudied groups. The curve family is 10 of mixed3b’s 480 units. | Active — read 2026-10-27 (NOTE-1206) in full, from the Distill article; worth reading as the only place the Circuits thread gives a denominator: it sorts every one of the 1,056 units of InceptionV1’s first five layers into 77 named groups, with each group’s share of its layer (THEORY-1042). Read it knowing that the groups are, in the authors’ words, “ad-hoc, human defined”, that 391 of the 1,056 units (37%) sit in groups the authors’ own captions call catch-all, broad and not well defined, low-confidence, unstudied or not understood, and that being sorted into a group is not the same as being understood in Zoom In’s sense. The authors’ wider claim, that neuron families are real and recur across models, is THEORY-1040. |
| LIT-1625 v2 | Polysemanticity and Capacity in Neural Networks | Scherlis, Sachan, Jermyn, Benton and Shlegeris (2022), arXiv 2210.01892. Defines a feature’s capacity, C_i = (w_i·w_i)²/Σ_j(w_i·w_j)², in [0, 1] with total at most the embedding dimension, and treats superposition as the optimal allocation of capacity. In a model computing Σ(W_i·x)² + b to fit y = Σ v_i x_i², the expected loss depends only on capacities and embedding lengths, and the optimum is in closed form: with fourth moment k ≤ 3 features are ignored or given a whole dimension; with k > 3 a feature is shared when its importance lies in an interval set by k. Efficient embeddings are exactly the block-semiorthogonal ones. | Active — read 2026-10-27 (NOTE-1205) in full, from arXiv v4; worth reading as the source of the toy model the causal scrubbing appendix (LIT-1583, §6) analyses, and as an exactly solvable case of superposition: in a one-hidden-layer model with quadratic activations, the expected loss depends on the weights only through each feature’s capacity and embedding length, and the optimal allocation has a closed form in which features are ignored, shared or given a whole dimension according to their importance and the inputs’ fourth moment (THEORY-1036, re-derived and checked numerically). Read it knowing that its other models are shown only as phase-diagram figures, and that its bearing on trained networks is the authors’ hope, not a result (THEORY-1035). |
| LIT-1626 v2 | Infinite Sparse Factor Analysis and Infinite Independent Components Analysis | Knowles & Ghahramani (2007), ICA 2007, LNCS 4666: 381–388. Data are modelled as Y = G(Z ⊙ X) + E, with a potentially infinite number of hidden sources X, a binary mask Z drawn from the one- or two-parameter Indian buffet process, and a Gaussian (infinite sparse factor analysis) or Laplacian (infinite ICA) prior on the sources. A Gibbs sampler with Metropolis–Hastings steps for new features recovers a synthetic mask and beats FastICA in Amari error on sparse synthetic data, and finds tissue-specific gene signatures in ovarian cancer microarray data. | Active — read 2026-10-27 (NOTE-1209) in full, from the authors’ own copy of the ICA 2007 paper; worth reading for infinite sparse factor analysis and infinite ICA, in which an Indian buffet process masks which of unboundedly many sources is active at each data point, the model the infinite factorial HMM’s experiments compare against, and for its sampler, whose ratio for a source being on or off shows how far the data can tell an inactive source from an active one at zero (THEORY-1046). Read it knowing that its results are boxplots and a Hinton diagram, that its text and figure caption disagree on the synthetic data’s size, and that it misstates the one-parameter IBP’s total number of features. |
| LIT-1627 v2 | Stick-breaking Construction for the Indian Buffet Process | Teh, Görür & Ghahramani (2007), AISTATS, PMLR 2: 556–563. In the limit of the IBP’s finite model, the feature probabilities in decreasing order are μ_(k) = ∏_{l≤k} ν_l with ν_l ~ Beta(α, 1) independent; the pieces broken off are the Dirichlet process’s GEM(α) weights. A slice sampler built on it truncates the representation adaptively and needs no conjugacy; a semi-ordered variant, on synthetic linear-Gaussian data, mixes as fast as the conjugate Gibbs sampler, and it is demonstrated on 1000 MNIST threes. | Active — read 2026-10-27 (NOTE-1210) in full, from PMLR’s own PDF; worth reading for the stick-breaking construction of the Indian buffet process, in which the feature probabilities in decreasing order are products of independent Beta(α, 1) draws, for its duality with the Dirichlet process’s sticks, and for the slice samplers it licenses, which the Markov IBP’s inference uses (THEORY-1041). Read it knowing that its truncation is described but its error is not computed, that its sampler comparison is reported only as a chart of autocorrelation times, and that its MNIST demonstration is a single run judged by eye. |
| LIT-1628 v2 | Factorial Hidden Markov Models | Ghahramani & Jordan (1997), Machine Learning 29: 245–273 (first as NIPS 8, 1995). The hidden state of an HMM is factored into M chains of K states, a priori independent, which jointly set each observation’s mean, Σ_m W^(m)S_t^(m). Given the observations the chains are coupled, so the exact E step costs O(TMK^{M+1}). Gibbs sampling, a completely factorized and a structured variational approximation (M uncoupled HMMs with fictitious observations) are compared with exact EM on synthetic data, and a factorial HMM models Bach chorale melodies better than an unconstrained HMM. | Active — read 2026-10-27 (NOTE-1203) in full, from the authors’ copy of the Machine Learning article, checked against the publisher’s PDF; worth reading as the origin of the factorial hidden Markov model, the parametric model of several independent hidden chains jointly producing each observation that the infinite factorial HMM makes nonparametric, for its account of why exact inference costs O(TMK^{M+1}), and for its structured variational approximation. Read it knowing that its comparison of inference methods is on small synthetic problems (THEORY-1045), that its Bach chorale result is read from charts, and that its footnote on when the chains decouple is wrong for a non-isotropic covariance. |
| LIT-1629 v2 | Curve Circuits | Cammarata et al. (2021), Distill (printed DOI 10.23915/distill.00024.006, unregistered on 2026-10-27). The second of the curve-detector articles, on how the ten curve units of InceptionV1’s mixed3b are built: from conv2d0 Gabors through conv2d2 and mixed3a lines and early curves, each family tiled along the curve’s tangent, with rotational and scale equivariance said to cut the circuit’s 50,000-plus parameters about 50-fold. Negative weights from opposite early curves remove the 180° echo, and deleting them by circuit editing brings it back. A hand-set network written from the description approximates the curve units on synthetic curves, and substituting it for them recovers 26 of the 46 top-5 classifications lost by removing them, on 2,000 images. | Active — read 2026-10-27 (NOTE-1207) in full, from the Distill article; worth reading as the second part of Curve Detectors (LIT-1575) and the one that supplies the three arguments that article deferred: the circuit that builds the ten mixed3b curve units from earlier families, a downstream use in mixed4a, and a hand-written “artificial artificial neural network” whose curve units approximate the natural ones (THEORY-1038). Read it knowing that every comparison but one is qualitative (figures), that the one number, the accuracy recovered by substituting the hand-written units, is on 2,000 validation images and called preliminary by the authors, that the hand-written units are grayscale, and that the claim that the circuit is “a simple algorithm” is the authors’ (THEORY-1047). |
| 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-1634 v2 | The structure of ill structured problems | Simon (1973), Artificial Intelligence 4. There is no sharp boundary between well and ill structured problems: the conditions for a well structured one relate a problem to the power of a bounded solver, read as practicable computation, and on that reading even theorem proving and chess fail some of them. Problems from the world “become WSPs only in the process of being prepared for the problem solvers” (p. 186). House design, a battleship’s design by an organization and a robot are handled by alternating a solver on a locally well structured problem with a recognition system that keeps modifying the problem space: “well structured in the small, but ill structured in the large”. Simon suggests that only the size of the knowledge base separates the two, so no qualitatively new mechanisms are needed. | Active — read in full 2026-10-27 (NOTE-1232), from a scan of the published article; worth reading as the classic argument that well-structuredness is relative to a bounded solver and that problems from the world become well structured only by being prepared, and for its model of design as an alternation between local problem solving and retrieval that modifies the problem space. Its conclusion that no new mechanisms are needed is a suggestion, not a result. |
| LIT-1635 v2 | Relational Quantum Mechanics | Rovelli (1996), arXiv quant-ph/9609002. The notion behind the measurement problem is the observer-independent state, as absolute simultaneity was behind the unease with the Lorentz transformations. A measuring system O and an external P who treats S+O unitarily give different and equally correct accounts of one measurement, so a value is a value relative to a system, any physical system can be the observer, and quantum mechanics, taken as complete, describes the information (correlation) systems have about one another. The relation between two views is itself relative to a third system, and there is no description in toto. Systems are not relational: each is characterized by its set of yes/no questions and an information capacity. Two information postulates and a third, superposition postulate are offered as a partial reconstruction of the formalism. | Active — read in full 2026-10-27 (NOTE-1227), in arXiv v2; worth reading as the founding statement of RQM: the two-description analysis of one measurement, values relative to any physical system, no deducible relation between views and no description in toto, and an information reconstruction it calls “not fully successful”. It keeps systems prior to their relational values, as an assumption: each is characterized by its question set W(S) and capacity N, and the decomposition may vary. It has no ontology of events; that is later. |
| LIT-1640 v2 | Quantum Darwinism | Zurek (2009), a review. Decoherence singles out pointer states; quantum Darwinism adds that observers read the environment, and that decoherence leaves many copies of the pointer observable in it. The mutual information between the system and a fraction f of the environment rises steeply to a plateau at the system’s entropy H_S, so R_δ = 1/f_δ disjoint fragments each hold nearly all of it; redundancy is high only for the pointer observable, and Zurek reads it as objectivity: many observers learn the state independently and without disturbing it. A unitarity argument shows only orthogonal states can be repeatably recorded, without the Born rule, which is derived separately from envariance. The measurement problem is called “largely settled”. | Active — read in full 2026-10-27 (NOTE-1229), from the arXiv text; worth reading as the author’s own synthesis of einselection, redundancy and envariance. Its repeatability argument (eq. 5) is clean; its redundancy results are cited model calculations; its step from redundancy to objectivity is an identification, and it does not contain the later caveat about mutual information that the exchange attributed to other work. |
| LIT-1644 v2 | A Compositional Framework for Passive Linear Networks | Baez & Fong (2018), TAC 33. Open circuits of passive linear two-terminal components (resistors, and inductors and capacitors through the Laplace transform over ℝ(s)) are morphisms of a hypergraph category Circ built from decorated cospans, composed by gluing terminals. The black box functor Circ → LagRel, a hypergraph functor (Thm 1.1, Thm 7.7), sends a circuit to the Lagrangian relation between its terminals’ potentials and currents, the graph of the differential of the power functional left when the interior is eliminated by the principle of minimum power. The external behaviour of a composite is the composite of the parts’ behaviours. Dirichlet forms alone compose by that elimination but lack identities, since an ideal wire has none. | Active — read in full 2026-10-27 (NOTE-1223), from arXiv v6; worth reading as the theorem that black-boxing passive linear circuits is functorial: the Lagrangian relation a circuit imposes on its terminals’ potentials and currents composes as the circuits do. It is also a clean account of eliminating an interior by minimum power, and of why that elimination alone has no identities. Its scope is narrow: passive, linear, two-terminal components, time only through the Laplace transform with zero initial conditions. |
| LIT-1646 v2 | Opinion Dynamics on Discourse Sheaves | Hansen & Ghrist (2020; SIAM J. Appl. Math. 2021). A discourse sheaf gives each agent a private opinion space and each edge a space of discussed topics, with a linear expression map from each agent into each edge, which may be selective, scaled or sign-reversed (“lie”). Sheaf-Laplacian diffusion converges to the projection onto the global sections: agreement in expression, not in held opinion, so stable polarized distributions exist. Stubbornness, control and observability reduce to relative cohomology. Letting the expression maps diffuse converges to the nearest sheaf of which the opinions are a section (“learning to lie”); joint diffusion is gradient descent on the discord, and a conserved quantity keeps the opinions from collapsing to zero when it starts indefinite. Bounded confidence and antagonism are nonlinear Laplacians. | Active — read in full 2026-10-27 (NOTE-1222), from the arXiv preprint; worth reading as the clearest formal case of agreement on what is expressed without identity of what is held, and of correspondence maps revised by interaction. Mathematics with toy examples, no data; its expression learning reaches coherence with nothing outside the loop to check it, which the authors call “learning to lie”. |
| LIT-1649 v2 | Compositional Dynamics in Learning and Mechanics | Spivak (2026). An operad ArrSm of “smooth adaptive arrangements” (a responsive parameter space, a lens of output and input maps between manifolds, and a real potential) with two operad functors into polynomial coalgebras, discrete-time input-output machines, built by lens internalization (Corollary 3.3.4). The functors differ only in the integrator: Φconf stores position and steps down the sharpened gradient, Φphase stores position and momentum and takes a symplectic-Euler step. Φconf gives gradient descent with backpropagation, weight decay and Newton’s method. One arrangement of harmonic particles on a finite directed graph gives the discrete wave equation under Φphase and the discrete heat equation under Φconf, both governed by the symmetrized graph Laplacian, and for harmonic closed systems the phase step preserves the symplectic pairing exactly. | Active — read in full 2026-10-27 (NOTE-1225), from arXiv v2; worth reading as a compositional account in which the coupling data (wiring, potential, response) and the dynamical regime are separate choices: one arrangement of harmonic particles gives a discrete wave equation or a discrete heat equation depending only on whether the integrator stores momentum, and gradient descent with backpropagation is the same construction applied to a parameterized map. Rigorous for its categorical core and its worked examples; many further examples are reported from Claude-written code the author did not audit. |
| LIT-1652 v2 | Counterexample-Guided Abstraction Refinement | Clarke et al. (2000), CAV 2000. Model checking runs on an existential abstraction that merges states, built from the atomic formulas of the program’s conditions and of the property, so a property true of the abstraction is true of the program. An abstract counterexample is checked against the concrete system by forward image computation. If it is spurious, the abstract state where it first has no concrete continuation is split, to separate the states reachable along it from those with the transition onward, and checking runs again. The coarsest split is stated to be NP-hard (proof omitted), so a polynomial non-optimal one is used. For finite-state programs and ACTL* properties whose counterexamples are paths or loops, the loop ends in a real counterexample or a proof. The property is never revised. | Active — read in full 2026-10-27 (NOTE-1231), from the authors’ manuscript of the CAV paper in CMU’s repository; worth reading as the founding paper of counterexample-guided abstraction refinement and as an exact case of a failure under a fixed specification read as a missing distinction, located and repaired by a split. The specification itself is never revised. Two of its four theorems have no proof in this text. |
| 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-1655 v2 | Angular synchronization by eigenvectors and semidefinite programming | Singer (2011). Estimates n angles, up to one common phase, from noisy measurements of their pairwise offsets when an unknown share are outliers uniform on the circle, by the top eigenvector of the Hermitian matrix of e^{iδᵢⱼ} or by a complex Goemans–Williamson SDP. A random-matrix argument puts the eigenvector’s threshold at a share p > 1/√n of good offsets on the complete graph, and simulations recover 400 angles with 85% outliers at correlation 0.97. Fano’s inequality shows no algorithm can succeed below a threshold of order √(n/m), and the eigenvector method is within a factor √((L − 1)/(2 log₂ L)) of it, where exhaustive maximum likelihood costs O(mLⁿ). Extensions to other compact groups, cryo-EM and clock synchronization are sketched. | Active — read in full 2026-10-27 (NOTE-1224), from arXiv v2; worth reading as the paper that posed angular synchronization with outliers and sketched its extension to other groups, and as a clean case that separates what pairwise evidence determines from what a cheap method can recover: an information bound that binds every algorithm, and a spectral relaxation whose threshold sits within an L-dependent factor of it. The spectral threshold is a careful heuristic confirmed by simulation, not a theorem. |
| LIT-1658 v2 | Sheaves are the canonical data structure for sensor integration | Robinson (2017), Information Fusion 36. An expository paper on sensor integration with sheaves. Sensor models become restriction maps between spaces of observations over sets of entities; the consistency radius of an assignment is its largest disagreement between an observation and the restriction of another, and with K-Lipschitz restrictions it bounds the distance to every global section below by ε/(1 + K). Fusion is the search for the nearest global section; in one simulated search-and-rescue scenario it cut the crash-location error 2–8×, and the pattern of discrepancies singled out a biased sensor. Cohomology, for linear sheaves, flags sensor and processing configurations whose data can be locally but not globally consistent. “Canonical” rests on axioms, not a theorem. | Active — read in full 2026-10-27 (NOTE-1221), from arXiv v3; worth reading as the source of the consistency radius and of sheaf-based data fusion as the nearest global section, with a clear worked example. It is expository: “canonical” is argued by positing axioms whose models are sheaves, not proved, and the paper calls sheaves one of “many co-universal information representations”. The demonstration is one simulated scenario; its uniqueness result for linear fusion (Proposition 25) does not follow from its proof. |
| LIT-1659 v2 | Toward a spectral theory of cellular sheaves | Hansen & Ghrist (2019), J. Appl. Comput. Topology 3. Defines the Hodge Laplacians of a cellular sheaf of inner-product spaces; by discrete Hodge theory the degree-k kernel is the cohomology H^k, in degree 0 the global sections, and the flow ẋ = −Δ^k x converges exponentially to the orthogonal projection onto it (Prop. 8.1). Lifts spectral graph theory’s basics with short proofs: harmonic extension, a bound k + 2 for normalized sheaves, interlacing, pushforward, covering and product spectra, effective resistance and spectral sparsification. The Laplacian does not determine the sheaf, Kron reduction fails in general because an interior vertex can impose a non-pairwise boundary constraint, and no Cheeger inequality is proved. Consensus, flocking, opinion dynamics, communication compression and synchronization are sketched as applications. | Active — read in full 2026-10-27 (NOTE-1233), from arXiv v2; worth reading as the standard introduction to sheaf Laplacians: the kernel is the global sections, the heat flow projects onto them, and a set of spectral graph theory’s basics lift with short proofs. Exploratory by its own account: no Cheeger inequality, and the applications are sketches. |
| LIT-1661 v3 | Institutions: abstract model theory for specification and programming | Goguen & Burstall (1992). An institution is a category of signatures with sentences, models and satisfaction, subject to the Satisfaction Condition: a translated sentence holds in a model exactly when the original holds in the model’s reduct. From it, theories and model classes form a Galois connection; theories have colimits whenever signatures do, so specifications can be glued; constraints forcing free or initial interpretation can be added as sentences without losing this; and institution morphisms translate between logics, letting one logic’s prover be used on another’s theories when every model is reached. | Active — read in full 2026-10-29 (NOTE-1348) from a copy of the published article supplied by the owner; worth reading as the source of the Satisfaction Condition, the one axiom that makes truth invariant under change of notation, and of what follows from it for every logic at once: theories glue wherever signatures do (Theorem 11), constraints for abstract data types glue too, and a translation between logics that meets the condition and reaches every model lets one logic’s prover decide another’s entailments (Proposition 35). For this record it gives a precise standard of correct translation, relative to a translation of models, distinct from structural resemblance and from route agreement. Proofs are omitted for the Satisfaction Condition of its own examples; natural language is named as an application and not developed. Source of THEORY-1150 and THEORY-1142. |
| LIT-1663 v2 | Constructor theory of information | Deutsch & Marletto (2015), Proc. R. Soc. A 471. Laws are stated as which tasks are possible and which impossible. A set of attributes is an information variable when all its permutations and its cloning are possible; distinguishability is defined from that, which gives the recursive definition of distinguishing a base. Conjectured principles (interoperability, consistency of measurement, ensemble distinguishability and others) cover classical information. One further prohibition, disjoint information observables whose union is not one (“superinformation”), yields indistinguishable states, no-cloning, complementarity, deterministic unpredictability, measurement disturbance and locally inaccessible information; quantum information is an instance. | Active — read in full 2026-10-27 (NOTE-1219); worth reading as the cleanest statement of information as a counterfactual property of a substrate, defined from possible permutations and cloning before distinguishability, and as the derivation of quantum information’s distinctive features from one prohibition on top of conjectured principles. It treats instantiating information as an intrinsic, modal property, so it gives no support to relational constitution. |
| LIT-1666 v2 | Stable Facts, Relative Facts | Di Biagio & Rovelli (2021), Found. Phys. 51:30. A fact happens at every interaction and is relative to the system it affects. Facts relative to F are stable for another system W when W may use them in the classical total-probability rule; the rule’s failure is interference. If F is entangled with an environment whose states overlap by at most ε and W does not interact with it, the rule holds for W up to O(ε): stability is approximate and relational, and a fact can be stable for W before it is a fact for W. The ontology is put in relative facts, not stable ones, and the Frauchiger–Renner contradiction and the Local Friendliness violation are read as the classical rule used across contexts where facts are not stable. | Active — read in full 2026-10-27 (NOTE-1226), from arXiv v3, which is the journal’s typeset text; worth reading as the definition of RQM’s stable facts: a fact relative to one system is stable for another when the other may sum over it classically, which decoherence gives to order ε, only for a system that cannot reach the environment. Stability is approximate and relational, not a step toward observer-independence. Short; its one derivation is a partial trace, and inter-observer agreement gets one sentence. |
| 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-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-1672 v2 | Barad, Bohr, and quantum mechanics | Faye & Jaksland (2021). Barad’s Bohr is more ontological than Bohr, who took phenomena as experimental arrangements with their outcomes; Rovelli’s relational quantum mechanics does not entail Barad’s relational holism; and agential realism leaves the measurement problem unsolved, since persisting entanglement of apparatus and object does not explain one determinate outcome. Quantum mechanics does not force agential realism. | Active — read in full 2026-10-27 (NOTE-1220); worth reading as the assessment of agential realism from philosophy of physics: Barad’s Bohr is not Bohr’s (phenomena epistemic, Bohr an entity realist, the dualisms presupposed), quantum mechanics does not entail agential realism (Bohmian mechanics; relational quantum mechanics keeps systems prior to interactions), and agential realism has no answer to the measurement problem as it stands. |
| LIT-1673 v2 | Naturalized, Fundamental, and Feminist Metaphysics All at Once: The Case of Barad’s Agential Realism | Jaksland (2024), DOI-10.1017/hyp.2023.114, Hypatia 39. Barad holds agential realism to be naturalized metaphysics justified by quantum mechanics and applied once, to the one reality, and rejects reading it as analogy or as a template other domains instantiate. Its extension to the lifeworld then needs ontological features that admit no approximation (the subject–object and word–world dualisms, representationalism). Whether any exist is left open; individualism is the plausibly approximable case, and the independence of social theorizing from fundamental metaphysics is at least contingent, on the size of Planck’s constant. | Active — read in full 2026-10-27 (NOTE-1230); worth reading as the only statement of the argument Barad’s unrestricted scope needs, that some ontological features admit no approximation, and as the clearest account of the conception of agential realism Barad holds (naturalized, applied once) against the two she rejects (analogy, template). Its own answer to its question is that it is open, with individualism the plausibly approximable case and the dualisms the hard one. |
| 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-1676 v2 | Relative Information, Relative Facts | Di Biagio & Rovelli (2025). Relational quantum mechanics restated in Shannon terms. The information about A relative to B is the expected conditional information, I_{A|B} = I_A + I_{A:B}, and A is a fact relative to B when it is maximal. Only commuting variables have a joint distribution, so perspectives belong to commutative subalgebras (“classical subsystems”), not to quantum systems, and a qubit has none. “Every fact is a relative fact”, and in practice a fact is information “high enough” for the resolution needed. As a side result, a von Neumann measurement is continuous growth of the pointer’s information, sin²(ωt)H_A in the model. Merging perspectives, Wigner’s friend, EPR and the extended Wigner’s friend scenario are treated by worked examples. | Active — read in full 2026-10-27 (NOTE-1214), from arXiv v2; worth reading as the quantitative restatement of relational quantum mechanics, with relative facts defined by relative information and held by commutative subalgebras rather than by quantum systems. The definitions are clean. The resolutions it claims (combination problem, Frauchiger–Renner, intersubjectivity) are paragraphs or citations, and every consistency check is computed relative to one outside system. |
| LIT-1677 | A comparison of minimal group induction procedures | Two small experiments with US undergraduates (N = 42 and 73) compare four ways of making minimal groups. In the classic one, participants are falsely told their painting preferences put them in a group. In the others, they imagine being assigned, are assigned at random, or only memorize five names from one group, with no categorization at all. On explicit liking and identification, and on a bonus-money allocation between two other participants, all four produced comparable in-group favouritism. On IATs of attitude (pleasant/unpleasant) and identification (self/other), only memorization produced large effects; the classic procedure produced none. Implicit and explicit favouritism correlated weakly. Explicit identification correlated with allocation favouritism (r = .37). The allocation result was carried mostly by one of the two colour groups. | Active — read in full 2026-10-29 (NOTE-1319), in place of LIT-1697, which could not be reached; worth reading as a direct test of how little it takes to make a minimal group. Merely studying a group’s names ties it to “self” on an implicit measure, and imagined or random assignment yields the same explicit favouritism as the classic procedure. Read in place of Tajfel et al. 1971 (LIT-1697, Unavailable); small samples, one college. |
| LIT-1680 | Retention of Memory through Metamorphosis: Can a Moth Remember What It Learned As a Caterpillar? | Blackiston, Silva Casey & Weiss (2008). Tobacco hornworm caterpillars (Manduca sexta) trained by pairing ethyl acetate with mild shock avoided the odour (78% of 41 fifth instars). Moths that had been trained as fifth instars still avoided it, four to five weeks and a metamorphosis later (77% of 27), and 80% of the tracked moths made the choice they had made as larvae. Odour alone, shock alone and backward pairing had no effect. Caterpillars trained at third instar kept the aversion through two larval molts but lost it as moths. Washing the pupae of trained larvae did not remove the adult aversion, and putting the odour on naive pupae did not create one, so chemical residue on the pupal case does not explain it. The authors suggest, by analogy with Drosophila, that the memory survives in mushroom-body neurons that form late in larval life and keep their projections through metamorphosis; they did not examine the brain. | Active — read in full 2026-10-29 (NOTE-1249) from the publisher’s PDF (PLoS ONE, CC BY), checked against Europe PMC’s XML (PMC2248710); worth reading as the clean modern demonstration that a single conditioned aversion survives insect metamorphosis, with contamination controls and a timing dissociation that points to surviving neurons as the carrier; one odour, one lab and adult groups of 15 to 31. |
| LIT-1681 | A Perfect Moral Storm: Climate Change, Intergenerational Ethics and the Problem of Moral Corruption | Gardiner (2006). Climate change is a “perfect moral storm”: three problems that threaten ethical action converge in it. The global storm is the familiar reading, a tragedy of the commons between states with no effective global governance, worsened by uncertainty about national impacts, a status quo bias and skewed vulnerabilities. The intergenerational storm is worse. Carbon dioxide’s long life makes climate change resilient, backloaded and deferred, so the benefits of emitting fall to the present and the costs to later generations. That is a Pure Intergenerational Problem, in which every generation rationally overpollutes and the usual remedies are unavailable, because the generations do not coexist. The theoretical storm is that our theories handle uncertainty, intergenerational equity and contingent persons badly. Together they invite moral corruption: by selective attention, each generation can seem to act while exploiting its position in time, and need not admit it, even to itself. Even the prominence of the global model may be such a convenience, since it assumes states represent their citizens “in perpetuity”. | Active — read in full 2026-10-29 (NOTE-1252) from the publisher’s PDF, republished with White Horse Press’s permission on the Rachel Carson Center’s Environment & Society Portal (environmentandsociety.org/node/5976); worth reading as the short statement of why concern for future generations fails in practice: a self-interest that is generation-relative, and a moral motive that can be corrupted without being given up. |
| LIT-1684 | The Case for Strong Longtermism | Greaves & MacAskill. Argue for axiological and deontic strong longtermism: in the most important decisions facing agents today (how a society or an individual spends resources without restriction to a cause, and career choice), every near-best option is near-best for the far future and delivers much larger benefits there than in the near future, and one ought to choose such an option. The argument rests on an expected number of future beings of at least 10^24 (10^14 on a restricted, Earth-only estimate), and on interventions (asteroid detection, pandemic preparedness, AI safety) whose expected far-future benefit per $100 beats the 0.025 lives that bednets save. The deontic thesis follows by a stakes-sensitivity argument that any plausible non-consequentialism should accept. The authors take cluelessness, ambiguity aversion and imprecise credences to fail as objections. They name fanaticism about tiny probabilities as one of the most plausible ways the case could fail. They concede that a positive pure rate of time preference would defeat it. | Active — read in full 2026-10-29 (NOTE-1302) from the authors’ working paper (GPI Working Paper No. 5-2021, June 2021) on the Global Priorities Institute’s site, an earlier version of the 2025 chapter; worth reading as the precise statement of strong longtermism and of exactly which assumptions it needs (zero pure time preference, expected value at small probabilities); it says nothing about why anyone would act on it. |
| LIT-1685 | Trauma, prejudice, large-group identity and psychoanalysis | A memorial lecture, not a study. Volkan defines a large group as thousands or millions of people who mostly never meet but share sentiments, and pictures large-group identity as a tent’s canvas worn over each member’s individual identity, with the leader as its pole. Membership in ethnic, national and religious groups begins in childhood, through identification with parents’ investment in the group and the images and “ego tasks” they deposit in the child; after adolescence a core large-group identity cannot be changed. From unofficial dialogues between conflicting groups (1980s to early 2000s), he reports that the central psychological factor in large-group conflict is the need to protect large-group identity, and that a participant who felt that identity threatened would speak with emotion of an injury suffered by ancestors centuries before. The shared image of such an event, “real, fantasized or even mythologized”, undergoes a change of function as it passes down the generations and becomes an identity marker: a chosen trauma. Chosen traumas feed entitlement ideologies and, in a “time collapse”, make the old event feel recent, as Milošević did with Kosovo 1389, with dehumanization and purification following. Recent traumas, the Holocaust among them, are not chosen traumas but undigested ones, bound up with large-group mourning. | Active — read in full 2026-10-29 (NOTE-1250), in place of LIT-1727, which could not be reached; worth reading as Volkan’s late, short restatement of chosen trauma, its trigger in threatened identity and its distinction from the mourning of recent trauma, read in place of his 2001 paper; the evidence is his own clinical and diplomatic observation, without method or measure. |
| LIT-1686 | Being one of us. Group identification, joint actions, and collective intentionality | Salice & Miyazono (2019/2020). Group identification, as the shared-agency literature uses it, conflates adopting the group’s perspective (team reasoning) with self-transformation (understanding oneself as a member). The two dissociate: the discursive dilemma shows perspective without identification, and toddlers’ joint action shows identification before perspective-taking appears. Self-transformation is a Pushmi-Pullyu representation, describing and motivating at once (“you are a member of us; act as such”), and is not under direct rational control. | Active — read in full 2026-10-29 (NOTE-1266) from the authors’ accepted manuscript in University College Cork’s repository (CORA); worth reading as the distinction between adopting a group’s perspective and the self-transformation of identifying as a member, the second cast as a Pushmi-Pullyu representation that motivates directly, and for its team reasoner versus team benefactor, which sharpens the owner’s thesis (CLAIM-491). Conceptual. |
| LIT-1688 | High Risk, Low Reward: A Challenge to the Astronomical Value of Existential Risk Mitigation | Thorstad (2023). Argues, inside expected-value reasoning and with no special ethical premises, that pessimism about existential risk weakens the case for mitigating it. On Ord’s simple model, cutting this century’s risk by a fraction is worth that fraction of one century, whatever the risk; with absolute cuts, value growth or cuts in every century, higher risk makes mitigation worth less. Astronomical value returns only on a “time of perils” hypothesis in which risk falls soon and stays very low, and he argues that appeals to growing wisdom, an existential risk Kuznets curve and space settlement do not support it. Mitigation may still be valuable, “but perhaps not astronomically so”. | Active — read in full 2026-10-29 (NOTE-1308) from the author’s penultimate draft (GPI Working Paper No. 6-2023, July 2023) on the Global Priorities Institute’s site; worth reading as a demonstration, inside the longtermist’s own expected-value framework, that high existential risk lowers the value of reducing it unless risk soon falls and stays low. |
| LIT-1689 | The Concept and Psychological Consequences of Symbolic Immortality | An ANU master’s thesis in psychology testing Otto Rank’s idea that people need to feel they will transcend death, in three modes (children, an afterlife, creative work), to which Lifton added two (nature and experiential transcendence, an expansion of the self). It reviews ethnographic, ancient and modern evidence that all five modes are expressed. Then it surveys 440 Australian adults aged 18 to 88, recruited through Christian, Yoga, Spiritualist and secular groups, using vignettes rated as imagined consolation in terminal illness. Having a mode in one’s life and religious affiliation predict accepting it; education predicts accepting the modes less. The modes predict personality only weakly; Rank’s links to neuroticism and to sex differences fail. | Active — skimmed 2026-10-29 (NOTE-1312), in place of LIT-1714, which could not be reached; worth reading as a review of how Rank’s and Lifton’s modes were measured by 1991, and as one survey showing that the secular modes go with accepting death as final. It is a modest test that found little; skim chapters 1, 4 and 10. |
| LIT-1690 | Group-level emotions | A short review of intergroup emotions theory by its founders. When people self-categorize as group members, the group becomes an aspect of the self and events are appraised for what they mean to the group; the resulting emotions are felt on the group’s behalf. Which emotions are felt shifts with the salient membership; members converge on a group norm for them; they need no personal involvement (guilt for others’ misdeeds); and identification moderates them, the highly identified sometimes reappraising to avoid negative group emotions. Such emotions predict collective action and treatment of out-groups (contempt more than anger predicts extreme violence) and of the in-group, and they can be regulated, which suggests interventions in intractable conflicts. | Active — read in full 2026-10-29 (NOTE-1285), in place of LIT-1722, which could not be reached; worth reading as the founders’ compact statement that an identified-with group is appraised as part of the self, with self-categorization and identification kept apart. |
| LIT-1691 | Generativity as a Route to Active Ageing | A gerontological essay with a report of the authors’ own studies. It reads Erikson’s generativity, as McAdams models it, as the psychological form of an ethical category of “joint responsibility”, and argues it is a lifelong concern, not a midlife task. It restates McAdams’ model: generativity springs from cultural demand and from an inner desire made of a “need to be needed” and a need for symbolic immortality, and passes through concern, commitment and belief in the species to action and a life-story script. It distinguishes generativity from altruism and says generative engagement can be selfish or altruistic in motive. Studies of 3,308 people aged 59 to 108 in Mexico, Spain and Germany found generativity predicted optimism and life satisfaction beyond health, money and family status. An intervention of intergenerational dialogue projects in Belarus, Russia and Ukraine raised Loyola Generativity Scale scores in old and young participants. No test statistics are reported. | Active — read in full 2026-10-29 (NOTE-1261), in place of LIT-1777, which could not be reached; worth reading as a compact restatement of McAdams’ model of generativity, with symbolic immortality as one of its motives, and for its claim that generativity serves the well-being of the old. |
| LIT-1693 | Psychometric validation of the Loyola Generativity Scale in Chilean teachers: evidence for a three factor structure | A validation of McAdams and de St. Aubin’s 20-item Loyola Generativity Scale (LGS) in Spanish, with 430 Chilean elementary teachers. Four items were dropped for low sampling adequacy, and a three-factor solution on 14 items was retained (RMSEA = 0.043, CFI = 0.989): Generative Inefficacy (three reverse-scored items), Generative Action (eight items on teaching, creativity and community work) and Generative Legacy (three items on symbolic continuity and contribution to future generations). Action and Legacy correlated .45; Inefficacy correlated −.34 and −.30 with them. Factor-score reliabilities were .80 to .86. The authors read the three factors as an extension of the original two (positive generativity and generative doubts) produced by the teaching context. | Active — read in full 2026-10-29 (NOTE-1260), in place of LIT-1777, which could not be reached; worth reading as evidence that legacy motivation can be measured apart from generative action within McAdams’ scale, with the caution that the analysis is exploratory and two items vanish unexplained. |
| LIT-1694 | ”Surviving Early Childhood Trauma: Effects of the Holocaust on Survivors’ Psychological and Physiological Well-Being” | A Leiden thesis of four empirical papers on one Israeli sample drawn from the population registry: female child survivors who lost both parents in the Holocaust, matched women who emigrated from Europe to Palestine with their parents before it, and the daughters of both. More than 60 years on, survivors reported more dissociation, less life satisfaction, more cognitive impairment and more stress from recent life events. They had higher diurnal cortisol and an anomalous response to a laboratory stressor, and in an exploratory analysis this held only for ADRA2B wildtype carriers. Their daughters did not differ from comparison daughters on any psychological, cognitive, health or cortisol measure. The one intergenerational signal: daughters of more dissociative survivors had lower diurnal cortisol (n = 17 against 10). The introduction and discussions restate the authors’ two meta-analyses, which found no second- or third-generation traumatization in non-clinical, well-designed samples. | Active — read in full 2026-10-29 (NOTE-1291), in place of LIT-1718 and LIT-1770, which could not be reached; worth reading as the record’s only account, at second hand and by their own authors’ student, of the 2003 and 2008 meta-analyses (LIT-1718, LIT-1770, both Unavailable), and as a primary two-generation study whose matched design holds national identity constant and finds no family transmission. |
| LIT-1696 | Intergenerational transmission of paternal trauma among US Civil War ex-POWs | Costa, Yetter & DeSomer (2018). Among 19,903 children of Union Army veterans born after the Civil War and surviving to 45, sons of men held in Confederate camps in the no-exchange period (July 1863 to July 1864), when conditions were worst, had an older-age mortality hazard 1.11 times that of sons of non-POWs (P = 0.009) and about 1.09 times that of sons of exchange-period POWs. Daughters were unaffected. Within families, sons born after the war to no-exchange POWs died at 2.23 times the rate of their brothers born before it (P = 0.056). The effect was 1.20 among sons born in the second quarter and absent among those born in the fourth, which the authors read as adequate maternal nutrition reversing it. Paternal and maternal socioeconomic controls and maternal lifespan did not change the result. By elimination, the authors judge an epigenetic route most consistent, while granting they cannot reject psychological or cultural transmission. | Active — read in full 2026-10-29 (NOTE-1255) from the published text (PMC6217388, CC BY-NC-ND), served by NCBI’s PMC OAI-PMH service; the supplementary information was not read; worth reading as the largest human study of a father’s trauma and his sons’ longevity, with an unusually clean natural experiment in the timing of captivity. Read it knowing that the effect is about 10% on the older-age hazard, that its mechanism is argued by elimination without biological data, and that its within-family and nutrition results rest on the SI and on modest P values. |
| LIT-1698 | Team Reasoning and Intentional Cooperation for Mutual Benefit | Sugden (2015). Social preferences cannot represent trust: on Rabin-style intention-based preferences, the common-knowledge practice of trust in the Trust Game is not an equilibrium. Team reasoning can, but not Bacharach’s version, which maximizes a team utility, trades members’ interests off against each other and needs no assurance that others reason as a team. Sugden’s Schema of Cooperative Team Reasoning aims at each member’s benefit over a maximin benchmark, follows existing practices and binds only given reciprocal reason to believe the others endorse it. So a market exchange that serves each party’s interest can still be intended as mutual benefit, neither self-interest nor sacrifice. | Active — read in full 2026-10-29 (NOTE-1288) from the published version, open under CC BY-NC-ND at the Journal of Social Ontology; worth reading as Sugden’s own later statement of team reasoning, read in place of his 2003 paper (LIT-1782, Unavailable), and for its claim that team reasoning cannot be reduced to self-interest or to social preferences by redefining payoffs, which bears on the owner’s thesis (CLAIM-491). |
| LIT-1699 | Pair-Bonding as Inclusion of Other in the Self: A Literature Review | A five-page review, by Aron’s group, of research on the self-expansion model’s principle of inclusion of other in the self (IOS) in long-term romantic relationships. In a close relationship each partner treats the other’s resources, perspectives and identities as to some extent their own (Aron et al. 1991). The single-item IOS circle scale is the standard measure. It tracks feeling and behaving close and correlates with cognitive signs of inclusion, such as slower self-trait judgements where the partner differs and self–partner confusions in memory. Studies since 2013 link greater overlap to self-like treatment of the partner: comparisons, pain and sleep, and honour-based aggression. They also add a two-dimensional model of relational self-change and a perceived-inclusion construct. No new data. | Active — read in full 2026-10-29 (NOTE-1276), in place of LIT-1706, which could not be reached; worth reading as a current map of what the IOS scale is used for and validated against. Its account of Aron et al. 1991 is two sentences. |
| LIT-1702 | Future self-continuity: how conceptions of the future self transform intertemporal choice | Hershfield (2011). A review, mostly of the author’s own studies, of “future self-continuity”: following Parfit, people who feel their future self is less connected to them treat it more like a stranger and save less for it. Three components are proposed. Similarity, measured by choosing overlapping circles (adapted from Aron et al.’s inclusion-of-other-in-self scale) for one’s self in ten years, predicted patient choices and accumulated assets, controlling for age; neural activity for the future self that looked more like activity for another person predicted steeper discounting (r = .47). Vividness: seeing an age-progressed image of oneself raised hypothetical retirement saving. Positivity: respect for the elderly tracked national saving rates and, when induced, raised patient choices. Asking directly how much people liked and cared for their future selves did not predict choice, though those answers were near ceiling. | Active — read in full 2026-10-29 (NOTE-1259) from the NIH author manuscript (PMC3764505), served by NCBI’s PMC OAI-PMH service after Europe PMC refused this client; worth reading as the short statement of the future self-continuity programme, and as the record’s clearest case of a measured extent of the self predicting concern-like behaviour where directly reported caring did not. Read it knowing that the review gives almost no statistics, that the caring null comes from a ceiling, and that the circles are framed as similarity. |
| LIT-1703 | Culture and the self: Implications for cognition, emotion, and motivation | Markus & Kitayama (1991). A theoretical review. Cultures differ in how they construe the self. The independent construal, most clearly American and western European, is a bounded self defined by internal attributes. The interdependent construal, found in Japan and other Asian cultures but also in African, Latin American, Hindu and southern European ones, is a self defined by relationships with specific others in specific contexts: “others are included within the boundaries of the self” (p. 245), though it “does not result in a merging of self and other” (p. 228). The authors predict, and review evidence, that interdependent selves know more about others and describe themselves by context. They expect them to feel and express “other-focused” emotions (shame, sympathy, amae) more and “ego-focused” ones (anger, pride) less. They expect them to pursue achievement for others and to show modesty, not self-enhancement. They name a third option between selfishness and selflessness: “a self defined in relationship to others” (p. 247). | Active — read in full 2026-10-29 (NOTE-1275) from the published APA scan posted by Markus on her own website (hazelmarkus.com/research); worth reading as the classic statement that cultures construe the self as more or less inclusive of others. For the owner’s thesis (CLAIM-491) it supports the premise, a self that includes others, and names the thesis’s middle term, “an alternative to selfishness … besides selflessness” (p. 247). It does not support the step to self-interest: the authors deny merging and allow “genuine, other-oriented, altruistic” motives. The evidence is mostly cross-national contrasts, often second-hand or unpublished, with culture standing in for an unmeasured construal. |
| LIT-1704 | Human transgenerational responses to early-life experience: potential impact on development, health and biomedical research | Pembrey, Saffery and Bygren (2014). A position paper by an 18-member network, two of whose authors led the Överkalix studies. It uses “transgenerational” for any outcome in offspring of an exposure in a parent before conception or in an earlier ancestor. In Överkalix cohorts of about 100 people each, a paternal grandfather’s good food supply in mid-childhood went with higher mortality in his grandsons (rate ratio 1.67) and poor supply with lower (0.65); for paternal grandmothers and granddaughters, 2.13 and 0.72. In ALSPAC, sons of fathers who began smoking before 11 carried more fat from age 13. The authors answer the charge of multiple testing with prior hypotheses and coherence across studies, grant that replication is needed, and hold that a sensitive period in the grandparent’s mid-childhood, not adolescence, makes cultural or genetic inheritance alone unlikely. They stay agnostic on mechanism and ask cohorts to collect ancestral exposure data. | Active — read in full 2026-10-29 (NOTE-1320), in place of LIT-1764, which could not be fetched here; worth reading as the Överkalix authors’ own later account of their findings and of how they answer the charges of multiple testing and cultural confounding. |
| LIT-1705 | Group Identity, Social Influence, and Collective Action Online: Extensions and Applications of the SIDE Model | An overview of the SIDE model by two of its authors. Deindividuation theory held that anonymity and immersion in a group cut self-awareness and so released antinormative behaviour. SIDE reverses this. Anonymity within a group makes whichever identity is salient more salient. When that identity is a group identity, people conform more to its local norms, and behaviour is more socially regulated, not less. A second, strategic dimension concerns anonymity to an audience: being unidentifiable to a powerful out-group frees members to act on in-group norms it would punish. The model is applied to text chat and email, webcams, online communities and online collective action. The chapter argues that online and offline action share the same predictors: shared identity, efficacy and anger at injustice. | Active — read in full 2026-10-29 (NOTE-1280), in place of LIT-1744 and LIT-1731, which could not be reached; worth reading as the SIDE model’s own authors’ statement of its cognitive and strategic dimensions and their evidence, and as the record’s second-hand access to Reicher, Spears & Postmes 1995 and Postmes & Spears 1998. |
| LIT-1707 | The stability of memories during brain remodeling: A perspective | Blackiston, Shomrat & Levin (2015). A perspective gathering three animal systems in which learned behaviour is reported to survive drastic remodelling of the brain: metamorphosing insects, where odour-shock aversions learned by fly and moth larvae persist in adults; planaria, where McConnell’s 1960s work and the authors’ automated replication report memory surviving head regeneration; and hibernating ground squirrels and marmots, whose hippocampal dendrites are pruned in torpor and regrow on arousal. The authors argue that synaptic plasticity alone cannot explain lifelong memory, propose a “blueprint” kept by another mechanism, and suggest that in planaria memory may be stored outside the brain, possibly in neoblasts or in non-neural bioelectric networks, and imprinted on the regenerating brain. They set out a research programme to test it. No new data. | Active — read in full 2026-10-29 (NOTE-1258) from Europe PMC’s full-text XML (PMC4802789, CC BY-NC), cited by section; worth reading as the Levin lab’s map of the cases and its hypothesis that memory can live outside the brain; a programme, not evidence, which restates its own planarian result in one sentence. |
| LIT-1708 | Transgenerational epigenetic inheritance: a critical perspective | Bird (2024). A Perspective by a DNA-methylation biologist. Transgenerational epigenetic inheritance rests on two assumptions: that the environment instructs the epigenome, and that acquired marks reach the germline and affect offspring. Both are weak in mammals. Marks usually follow transcription factors rather than lead; DNA methylation is largely stripped from gametes and early embryos; no validated mechanism links environment to epigenome. Organisms work to erase marks (mice inherit them when Dppa2 is mutated). The Agouti diet effect did not replicate. The rodent effects are short-lived or unreplicated, and the one robust paternal effect (microbiome ablation) seems not to go through the sperm epigenome. The human claims are weak: the Swedish (Överkalix) study ignored cultural transmission, failed to replicate in a larger cohort, and risks multiple testing; the Holocaust FKBP5 study had 32 people. Human genetics keeps explaining conditions once put down to environment. The article does not separate inter- from transgenerational effects. | Active — read in full 2026-10-29 (NOTE-1264) from the publisher’s PDF (CC BY); worth reading as the most recent sceptical statement, and the only one of the three to name and dispute the human trauma claims. |
| LIT-1711 | The Minimal Group Paradigm and its maximal impact in research on social categorization | A short review of the minimal group paradigm (MGP) after 45 years. Its defining features are a novel, arbitrary and anonymous categorization in which no personal self-interest is served by the allocations. Tajfel’s first studies found that fairness guided allocations strongly, but in-group favouritism appeared reliably, and maximizing the in-group’s lead over the out-group sometimes beat maximizing its gain. The effect replicated with revised matrices. Critics say it may come from reciprocity expectations or from projecting a positive self onto the new group. It is largely confined to positive resources. When participants can also pay themselves, they take the most for themselves and still favour the in-group with what is left. The paradigm is now used mostly to study other effects of mere categorization: implicit attitudes, face processing, trust, communication. | Active — read in full 2026-10-29 (NOTE-1301), in place of LIT-1697, which could not be reached; worth reading as the record’s only account, at second hand, of what Tajfel et al. 1971 (LIT-1697, Unavailable) designed and found, and as a map of the critiques. Two of them bear on the owner’s thesis: favouritism may come from projecting the personal self onto the group, and personal gain comes first when it is on offer. |
| LIT-1713 | Responsibility to Future Generations: A Moral Reframing Strategy for Combatting Climate Change | Syropoulos, Kraft-Todd, Mah, Markowitz & Young (2023). Thirteen studies (six main, seven supplementary; N = 161,633) on felt responsibility to future generations (RFG). In Eurobarometer data from 34 European countries (N = 109,513), a majority in 33 agreed “We need to reform to benefit future generations even if that means making some sacrifices now”; agreement barely related to ideology, age or gender (meta-r .03 to .07) and weakly to subjective status (.13). In US samples RFG was endorsed more than responsibility to reduce one’s own contribution to climate change (RCC), correlated with conservatism half as strongly (meta-r −.21 against −.45), and predicted self-reported proenvironmental behaviour, concern and policy support. In a preregistered experiment (N = 3,175), five brief interventions (a letter to a person born today, legacy reflection, reflection on past generations’ sacrifices, a park video, a 385-word excerpt of What We Owe the Future) each raised RFG and proenvironmental intentions by small amounts (d = .14 to .54); only the letter raised donations. Reflection on past sacrifices raised RFG but not RCC. All outcomes are self-reports or a small donation. status_note: worth reading as the largest study of felt responsibility to future generations, its spread and its political neutrality, and as the record’s only experiment comparing legacy, reciprocity, a particular future person and an impersonal longtermist text as routes to it; read in place of Syropoulos and Markowitz 2021. | Active — read in full 2026-10-29 (NOTE-1293), in place of LIT-1741, which could not be reached; worth reading as the largest study of felt responsibility to future generations, its spread and its political neutrality, and as the record’s only experiment comparing legacy, reciprocity, a particular future person and an impersonal longtermist text as routes to it; read in place of Syropoulos and Markowitz 2021. |
| LIT-1717 | Leaving a Legacy: Intergenerational Allocations of Benefits and Burdens | Six experiments (N = 76, 101, 64, 32, 131, 92; U.S. undergraduates, MBA students and university staff) on how the valence of what is passed on affects concern for one’s legacy and generosity to future others. Framing climate change as leaving burdens, rather than using up benefits, raised a generativity scale built from items about being remembered and living on (4.90 vs 4.10), direct concern with one’s legacy, felt responsibility and affinity toward future generations, and ethical concern; recalling one’s own past burden allocation raised moral emotions. In allocation tasks people favoured themselves more with benefits than with burdens. The difference appeared only when the recipient was in the future (not in a dictator-game version with a present recipient), and only when the allocator was a party to the trade-off (not when allocating between two other people). One item on ethical considerations statistically accounted for the first of these. The authors read the pattern as legacy concern, which they define as the wish to extend the self beyond death, engaged more by leaving burdens than by withholding benefits. Legacy concern was measured only in the attitude studies, never in the allocation studies. | Active — read in full 2026-10-29 (NOTE-1273), in place of LIT-1716, which could not be reached; worth reading as the legacy programme’s fullest experimental statement before the 2012 mortality studies, and as the record’s only second-hand source for Wade-Benzoni 2006 (LIT-1716). Read it knowing that legacy concern and generosity are never measured in the same study, and that the generosity effects sit in one cell: people keep more benefits for themselves when the other person will receive them later. |
| LIT-1719 | I Belong, therefore, I Exist: Ingroup Identification, Ingroup Entitativity, and Ingroup Bias | Castano, Yzerbyt, Paladino & Sacchi (2002). One experiment with 48 Italian students. Those who wrote about the emotions their own death aroused, rather than about reading a book, then identified more with Italians (6.19 vs 5.09), saw Italians as more of an entity (5.40 vs 4.77) and showed more in-group bias against Germans (1.01 vs 0.45), the last entirely through rating Italians higher. Identification and entitativity, which a factor analysis separates (r = .59), each mediated the effect on bias, through what they share. The authors propose, without testing it, that a group seen as a real, lasting entity lets people project themselves beyond their own death; the standard reading, defence of a worldview the group shares, is not ruled out. | Active — read in full 2026-10-29 (NOTE-1297) from the published version on co-author Yzerbyt’s UCLouvain page; worth reading as the study that joins terror management to social identity, and as the clearest statement of the idea that a group seen as a lasting entity lets the self outlive death. Read it knowing that it is one small study of an effect, mortality salience, whose replicability is now in question, and that it does not test its own proposal against the worldview-defence reading. |
| LIT-1720 | The Precipice Revisited | Ord (2024), a talk revisiting the four largest risks of The Precipice about five years after its text was fixed. Existential risk from climate change is down: emissions now track between the two lower RCP pathways, not RCP 8.5, and the IPCC has narrowed the likely climate sensitivity from 1.5–4.5°C to 2.5–4°C. Nuclear risk is up: the invasion of Ukraine, the coming expiry of New START with a likely new arms race, and the halving of funding for the field when the MacArthur Foundation, about 45% of it, withdrew. Pandemic and AI risk are mixed. Covid showed weak institutions and a unity against a common threat that lasted months, but vaccines came within a year; language models replaced game-playing agents as the frontier, which weakens the classic threat model, while racing between the largest companies and new government attention pull opposite ways. The book’s per-century estimates (climate and nuclear 1 in 1,000, pandemics 1 in 30, unaligned AI 1 in 10) have not moved at their rounding. The world is starting to build existential security. | Active — read in full 2026-10-29 (NOTE-1317), in place of LIT-1678, which could not be fetched here; worth reading as the author’s own update of The Precipice’s risk estimates, and as the only open text that restates the book’s four headline numbers and its notion of existential security; it does not carry the book’s moral argument. |
| LIT-1721 | Being one of us: we-identities and self-categorization theory | León (2023). A we-identity is one a subject has as a group member, is at times aware of, endorses, and cares about. Self-categorization theory explains we-identities by depersonalization, and phenomenologists (Zahavi, Salice) have adopted it as an account of the “we” in general. But the we-identities of close relationships arise by mutual individualization: partners grasp each other as non-substitutable and complementary. León proposes a socially extended account, drawing on Husserl and integrationist extended-mind criteria. | Active — read in full 2026-10-28 (NOTE-1309) from the open-access published article; worth reading as a philosopher’s limit on self-categorization theory: the we-identities of close relationships (long friendships, romantic partnerships) rest on mutual individualization and non-substitutability, the opposite of depersonalization, so the theory cannot be the general account of the “we” that phenomenologists have taken it to be. It proposes a socially extended account of such identities. An argument from cases and from relationship research, with no data of its own. Source of THEORY-1115. |
| LIT-1725 | The Effects of Trauma, with or without PTSD, on the Transgenerational DNA Methylation Alterations in Human Offsprings | Youssef et al. (2018). A short narrative review of human studies of parental trauma and offspring DNA methylation, PubMed to March 2018. It finds two studies of parents and children: Rwandan mothers pregnant during the genocide (25 exposed, 25 abroad), with higher NR3C1 methylation and lower cortisol in mothers and children; and Holocaust survivors (32) and offspring (22) against 8 controls and their 9 offspring, with higher FKBP5 intron 7 methylation in survivors and lower in their offspring. Three more concern stress in pregnancy (Congo, intimate partner violence) and NR3C1 methylation in newborns and adolescents. The authors call the evidence accumulating but preliminary: small samples, cross-sectional designs, unmeasured confounds, possible publication bias. They use “transgenerational” for any parent-to-child effect, in utero exposure included. | Active — read in full 2026-10-29 (NOTE-1310), in place of LIT-1692, which could not be fetched here; worth reading as a brief, sympathetic account of the Holocaust FKBP5 study and the few human studies beside it, by authors not on that study (though Rutten has published with its second author, Daskalakis; ref. 13). |
| LIT-1728 v2 | Reinterpreting the empathy–altruism relationship: When one into one equals oneness | Cialdini, Brown, Lewis, Luce & Neuberg (1997). In three questionnaire studies (five tests, N = 90, 74 and 263) students imagined a near stranger, an acquaintance, a friend or a close family member in need and chose how much to help. Closeness raised both empathic concern and “oneness” (the IOS scale with a “we” item). Empathic concern predicted helping, and still did with personal distress and sadness controlled, but with oneness entered it no longer did, while oneness still predicted helping. The authors read empathic concern as a signal of oneness and the helping as “nonaltruistic”: with self and other merged, the selfish–selfless distinction “loses its meaning”. | Active — read in full 2026-10-30 (NOTE-1444) from a scan of the published article on a University of Wisconsin course page (https://users.ssc.wisc.edu/~jpiliavi/965/Cialdini%201997.pdf, JPSP 73(3), pp. 481–494, with an OCR text layer); worth reading as the empirical case that helping among close others tracks perceived self–other oneness, not empathic concern. Read it knowing that every helping measure is a hypothetical choice about an imagined person (eviction, orphaned children, a phone call), that the evidence is regression and path analysis of ratings taken after the helping choice, and that the authors call oneness-based helping “nonaltruistic”, not egoistic. |
| LIT-1729 | Empirical Approaches to Altruism | The SEP survey of the empirical egoism–altruism debate, revised in 2025. On the standard account, altruism needs an ultimate desire for another’s well-being; biological and social-science senses of “altruism” settle nothing about it. Batson’s experiments make a strong case against the aversive-arousal and social-punishment versions of egoism. Self-other merging is a different challenge: only numerical identity with the helped person would make helping egoistic, and none of the four measures used by Cialdini et al. and Batson et al. (IOS, “we”, perceived similarity, trait-rating difference) tests for it. The authors report that Batson et al. (1997) avoided Cialdini’s methodological problems and found empathy’s role “clearly evident”, and that a preregistered study (N = 680) supports the empathy–helping link. Altruism is still not shown: divine punishment, principlism, non-moral norms, and habitual or Pavlovian helping remain to be ruled out. | Active — read in full 2026-10-29 (NOTE-1274), in place of LIT-1700 and LIT-1728, which could not be reached; worth reading as the shortest neutral account of the 1997 merging exchange the record holds: it quotes both papers’ measures, and it argues that a merging criterion must be one of numerical identity to matter for egoism. It does not report the 1997 results in numbers. |
| LIT-1730 | Managing the Terror of Publication Bias: A Systematic Review of the Mortality Salience Hypothesis | A systematic review of the mortality-salience (MS) hypothesis of terror management theory, that reminders of death increase worldview defense. An uncorrected random-effects meta-analysis of 635 effects reproduces Burke et al.’s (2010) moderate effect (g = 0.81, about r = .37, against their r = .35 over 277 studies), but a funnel plot shows strong asymmetry. Bias corrections disagree. Selection models and WAAP-WLS give a small effect, about r = .18; PET-PEESE finds none. A p-curve of 825 focal tests shows that some studies test real effects, at an average power of 25%; z-curve gives an expected replication rate of 19% and an expected discovery rate of 8%, near the 5% of a literature of null effects. Five of nine preregistered replications succeeded, and Many Labs 4 did not. The authors conclude the literature holds some non-zero effects, much smaller and far more heterogeneous than published, and that most studies are underpowered. | Active — read in full 2026-10-29 (NOTE-1271), in place of LIT-1687, which could not be reached; worth reading as the current quantitative verdict on the mortality-salience hypothesis, and as the only source the record holds for Burke et al.’s figures. |
| LIT-1733 | A Mathematical Theory of Saving | Ramsey (1928). Asks how much of its income a nation should save, for a community that lives for ever with fixed numbers, tastes and motives, summing utility over time without discounting it, a practice he calls “ethically indefensible” and the product of “the weakness of the imagination”. The answer, credited in its simple form to Keynes: the rate of saving times the marginal utility of consumption equals the shortfall of present net enjoyment from Bliss, the maximum obtainable rate. The rule is independent of the production function except through Bliss, and of the interest rate. It asks far more saving than usual: on an illustrative scale, £300 out of a family income of £500. With a constant discount rate ρ below the interest rate r, the same solution holds with a “modified utility” that discounts high incomes instead of the future; with ρ above r, consumption runs down to subsistence. A constant rate is argued to be the only one consistent with successive generations sharing one system of preferences. The last section turns to the rate of interest. Out of equilibrium it is set by capital’s demand price and can far exceed the reward needed to induce abstinence. With families discounting at different rates, equilibrium divides society into “the thrifty enjoying bliss and the improvident at the subsistence level”. | Active — read in full 2026-10-29 (NOTE-1287) from the published article, public domain in the US, from the Internet Archive’s scan of the issue (sim_economic-journal_1928-12_38_152); worth reading as the source of the zero-discount view and of the optimal-saving rule, knowing that the refusal to discount is a one-line assertion with a psychological diagnosis, and that the paper itself models discounting as how people actually save. |
| LIT-1734 | Mental Hoop Diaries: Emotional Memories of a College Basketball Game in Rival Fans | Botzung et al. (2010). Twenty-three male Duke and UNC fans watched an archived 2001 Duke–UNC game three times in the lab, then under fMRI recalled whether each of 64 shots went in. The same shot was positive for one side and negative for the other, so valence was set by allegiance with the stimulus held fixed. Shots good for one’s own team were recalled more accurately and confidently and rated more intense. Emotional intensity, not valence, modulated amygdala, hippocampus, striatum and cortical midline regions; positive shots added dorsal fronto-parietal and sensorimotor activity. Fan groups did not differ in accuracy or intensity. | Active — read in full 2026-10-29 (NOTE-1313) from the NIH author manuscript (NIHMS176990, PMC3319676) from the PMC Cloud open-data service, cited by section; worth reading as the one study the record holds in which a fan’s allegiance alone decides whether the same remembered play is good or bad, and in which fans remember their own side’s successes better; it says nothing about how a rivalry’s history is handed on. |
| LIT-1735 | Identity fusion: The interplay of personal and social identities in extreme group behavior | Swann, Gómez, Seyle, Morales & Huici (2009). A single pictorial item picks out people “fused” with their country (about 40% of Spanish students): fusion is bimodal, distinct from identification and specific to one group. The fused said they would fight and die for Spain more than other members would, and challenging or activating their personal self raised that further, with no effect on the nonfused. Personal and social identity act together, against self-categorization theory’s functional antagonism. | Active — read in full 2026-10-29 (NOTE-1256) from the published version on the site of co-author Gómez’s IDENFUSION group at UNED; worth reading as the record’s closest empirical work to the owner’s thesis (CLAIM-491): a measured self–group overlap in which the personal self is kept, not depersonalized, and in which a challenge to the personal self raises willingness to fight and die for the group. Self-reported intentions, Spanish students only. |
| LIT-1736 | Multigenerational legacies of trauma: Modeling the what and how of transmission | A web survey of 422 adult children of Holocaust survivors, a convenience sample recruited through survivor and Jewish organizations, tests Danieli’s 1998 framework, Trauma and the Continuity of Self, as a path model. The children rated their parents’ posttrauma styles (victim, numb, fighter), their own “reparative adaptational impacts” and their family’s history. Parents’ Holocaust experiences, internment above all, were linked to the children’s impacts only indirectly, through the parents’ victim style, and those indirect effects were small (.05 to .06). Post-war family milieu mattered more than wartime history. Settling in Israel rather than North America, surviving grandparents, larger surviving families and religious continuity went with milder impacts. Broken generational linkages (rarely thinking of one’s murdered grandparents as one’s own, and remembering the family’s history “only in bits and pieces”) had the largest total effect, and the only direct one. There was no comparison group and every measure came from the child. | Active — read in full 2026-10-29 (NOTE-1307), in place of LIT-1701, which could not be reached; worth reading as the clinical tradition’s own quantitative test of the parenting route, and for its finding that descendants who count their murdered grandparents as their own fare better, not worse; read in place of the 1998 handbook (LIT-1701). |
| LIT-1737 | Evolution, altruism and cognitive architecture: a critique of Sober and Wilson’s argument for psychological altruism | Stich (2006/2007). Restates Sober and Wilson’s argument that natural selection is unlikely to have made us pure egoists: for parental care, an ultimate desire for the child’s welfare is a more reliable mechanism than hedonism, which depends on beliefs linking helping to one’s own pleasure and pain. Stich rejects three of their four arguments outright. The fourth, that hedonism’s linking beliefs could be undermined by evidence, fails if the links are sticky sub-doxastic states. So the argument leaves egoism open; it does not show it true. | Active — read in full 2026-10-29 (NOTE-1282) from the published version on Stich’s own site; worth reading as a close restatement and critique of Sober and Wilson’s evolutionary argument for psychological altruism, read in place of Unto Others (LIT-1683, Unavailable), and for its definitions of egoism, altruism and ultimate desire, which the owner’s thesis (CLAIM-491) has to meet. |
| LIT-1739 | Astronomical Waste: The Opportunity Cost of Delayed Technological Development | Bostrom (2003). On an aggregative, undiscounted view, each second’s delay in settling the Virgo Supercluster loses the potential for about 10^29 human lives if minds can run on computers, or 10^13 if they must be biological. Yet the same arithmetic makes safety, not speed, the total utilitarian’s priority: a one-percentage-point cut in existential risk is worth a delay of over 10 million years, so “Maximize expected aggregate utility!” becomes “Minimize existential risk!”. On a person-affecting view, which counts only people who exist or will exist, extinction is bad for what it does to people now alive. Then, given a non-negligible chance that some of them live to share the cosmic benefits through life extension, existential safety is very important but must be balanced against speed. | Active — read in full 2026-10-29 (NOTE-1314) from the text on Bostrom’s own site; worth reading as the original form of the argument from the size of the possible future, and for its statement of how a person-affecting view changes it: toward the interests of people now alive. |
| LIT-1742 | Social Identity Theory and Self-categorization Theory: A Historical Review | Hornsey (2008). A critical, historical review of the social identity approach, social identity theory and self-categorization theory, from the early 1970s: their core principles, how they were elaborated, reinterpreted and sometimes misread, their effect on the field, and their strengths and limitations. | Active — read in full 2026-10-28 (NOTE-1253) from a copy of the published article supplied by the owner; worth reading as a map that tells social identity theory (intergroup relations, positive distinctiveness, status and legitimacy) apart from self-categorization theory (levels of self-categorization, fit, depersonalization), and records the strands later dropped or softened: identification as a predictor of bias, the self-esteem hypotheses, and strict functional antagonism. An insider’s review that lists the critiques and declines to answer them. Co-source of THEORY-1114. |
| LIT-1743 | Preregistered Replication and Extension of “Moral Hypocrisy: Social Groups and the Flexibility of Virtue” | Robertson, Akles & Van Bavel (2024). Two preregistered experiments (minimal groups n = 590; partisans n = 577) did not replicate intergroup moral hypocrisy; the minimal-group contrast is statistically equivalent to zero. In minimal groups, in-group favouritism in fairness judgments rose with collective identification and was not significant overall (p = .07); partisans judged out-party members’ identical selfish acts less fair (p = .003). | Active — read in full 2026-10-29 (NOTE-1245) from the authors’ accepted manuscript on OSF; worth reading as the record’s only preregistered evidence on minimal-group favouritism. Valdesolo and DeSteno’s intergroup moral hypocrisy did not replicate; minimal-group favouritism appeared only as it rose with identification, and partisans derogated the out-party. |
| LIT-1745 | Transgenerational Epigenetic Inheritance: Myths and Mechanisms | Heard & Martienssen (2014). A review of the mechanisms of epigenetic inheritance (small RNA, RNA-directed DNA methylation, paramutation, histone modification) and of germline reprogramming. Transgenerational inheritance is well documented in plants and nematodes, mostly at transposons and transgenes, and is rarely induced by the environment and more rarely adaptive. In mammals two rounds of reprogramming, in the germline and in the early embryo, erase most marks; the few bona fide epialleles (Agouti viable yellow, Axin fused) sit at retrotransposons. Effects of an exposed pregnant female count as transgenerational only from F3, of an exposed male only from F2. Human evidence, mostly nutritional (the Dutch famine, the thrifty phenotype), is intergenerational and confounded, so “so far there is little support”; human culture is the inheritance that is Lamarckian. | Active — read in full 2026-10-29 (NOTE-1254) from the authors’ accepted manuscript (PMC4020004), served by NCBI’s PMC OAI-PMH service; worth reading as the standard map of epigenetic inheritance across plants, worms and mammals, and as the source of the F2/F3 rule the human trauma claims are measured against. |
| LIT-1746 | Parental olfactory experience influences behavior and neural structure in subsequent generations | Dias & Ressler (2014). Male mice fear-conditioned to acetophenone or propanol before mating sired offspring (F1) and grand-offspring (F2) with heightened startle to, and lower detection thresholds for, the odour their F0 father was conditioned to, and not the other one. The offspring of acetophenone-trained males also had more M71 (Olfr151-expressing) olfactory neurons and larger M71 glomeruli; the anatomy, but not behaviour, was also tested and replicated in offspring conceived by IVF and carried by surrogates. Conditioning mothers before mating gave the same behavioural and anatomical effects, which survived cross-fostering. Olfr151 was less methylated in the sperm of conditioned F0 males (n = 12 vs 10) and of their naive F1 sons (n = 4 vs 4), but not in F1 or F2 olfactory epithelium. The authors read the effect as inherited sensitivity to a salient cue, not inherited fear, and leave open how an odour reaches sperm. | Active — read in full 2026-10-29 (NOTE-1281) from the authors’ accepted manuscript (PMC3923835), served by NCBI’s PMC OAI-PMH service; worth reading as the standard animal case for germline transmission of a parent’s experience: a specific, double-dissociated effect with IVF and cross-fostering controls, small groups, and a methylation result that is modest, confined to sperm and of unclear unit of analysis. This NOTE does not assess the later critique of the paper. |
| LIT-1748 | The Psychology of Existential Risk: Moral Judgments about Human Extinction | Schubert, Caviola & Faber (2019). Five studies (N = 2,507 as stated) of Parfit’s three outcomes: no catastrophe, 80% of humanity killed, 100% killed. Most laypeople judge extinction bad and say it must be prevented, but only 19–37% of those ranking the outcomes in the expected order judge the step from 80% to 100% worse than the step from none to 80%. More do when the victims are zebras, when the catastrophe sterilizes rather than kills, or when told to consider the long-term future (39–50%). A majority (67–77%) do only when told the surviving future would be long and utopian. People recruited as existential-risk mitigators do so unprompted (86%). The authors conclude that laypeople attend to immediate harm to fellow humans and neglect the long-term consequences. | Active — read in full 2026-10-29 (NOTE-1270) from the publisher’s PDF (CC BY), without the supplementary materials; worth reading as the first experiment on how far lay moral concern reaches past the living, and what makes it reach further: salience of the future, its quality, and less sympathy with the victims. |
| LIT-1749 | Population ethical intuitions | Caviola, Althaus, Mogensen & Goodwin (preprint 2021; Cognition 2022). Nine experiments (N = 5,776 as stated) on lay population axiology. For a fixed population to be better existing than not, people require more happiness than suffering: about 75% happy people, still about 61% when the two are stated to be exactly equally intense. Yet adding one extremely happy person to a world is judged as good as adding one extremely unhappy person is bad, so people reject neutrality and the procreation asymmetry. They prefer larger happy and smaller unhappy populations when averages are fixed, but the preference for more happy people fades and reverses at a billion. With totals fixed they prefer higher averages, and in conflicts averagism tends to win, even favouring adding near-maximally unhappy people who raise the average. Prompts to reflect move judgements toward totalism. | Active — read in full 2026-10-29 (NOTE-1267) from the authors’ PsyArXiv preprint (osf.io/wdbr8, OSF file of 2021-04-01); worth reading as the main experimental evidence on whether ordinary judgement is person-affecting or impersonal about merely possible people, and on how weak its totalism is at large numbers. |
| LIT-1750 | The impact of place and legacy framing on climate action: A lifespan approach | Wickersham et al. (2020). An online experiment with 988 American adults aged 18 to 87, sampled evenly by age. Writing about what one wants future generations to remember one for (adapted from Zaval et al. 2015), or about a beloved place and climate change, raised pro-environmental intentions (η² = .030) and hypothetical donations to a tree-planting charity (η² = .009) against a scrambled-eggs control. Age did not moderate either effect. The legacy writing raised scores on an eight-item Legacy Motivation Scale, which statistically mediated part of its effect; but the place writing raised legacy motivation too, the legacy writing raised love of nature, and in a model with both mediators love of nature carried as much of the donation effect. The scale mixes wanting to be remembered with self-regard and felt responsibility to future generations, so the study does not show that wanting to be remembered is what moves people. | Active — read in full 2026-10-29 (NOTE-1316), in place of LIT-1724, which could not be reached; worth reading as the one open use of Zaval et al.’s legacy induction and Legacy Motivation Scale, with the scale’s items in print; it shows the scale bundles the wish to be remembered with caring about future generations. |
| LIT-1751 | Persistent epigenetic differences associated with prenatal exposure to famine in humans | Heijmans et al. (2008). Sixty people conceived during the Dutch Hunger Winter of 1944–45 had, about six decades later, less methylation in blood at the imprinted IGF2 gene’s differentially methylated region than their unexposed same-sex siblings (0.488 vs 0.515, −5.2%, P = 5.9 × 10⁻⁵). Sixty-two people exposed only late in gestation, who were born lighter, showed no difference, and the timing interaction was significant. The authors read this as the first human evidence that a transient early-gestation exposure can be recorded as a lasting epigenetic change. The exposure is the person’s own, in or around conception, so this is an intergenerational effect, not inheritance across untouched generations. | Active — read in full 2026-10-29 (NOTE-1248) from the paper as reprinted in chapter 3 of Tobi’s 2013 Leiden thesis (hdl.handle.net/1887/22065, Open Access); worth reading as the first human report of a prenatal exposure associated with a methylation difference decades later, and as the record’s clearest case of the womb route: a mark from the person’s own exposure, at the very start of gestation, with no claim about the next generation. |
| LIT-1752 | Economics and Identity | Akerlof & Kranton (2000). Adds identity, “a person’s sense of self”, to the utility function: U = U(own actions, others’ actions, I), where I depends on one’s assigned social categories, how well one’s own traits match the category’s ideal, and how far one’s own and others’ actions follow the category’s prescriptions. Violating one’s prescriptions costs utility (Is); others’ violations cost it too (Io), and the loser may pay to “respond”, harming the violator. A two-person game shows when such responses deter. Applied to occupational segregation by sex, to “oppositional” identities chosen by the socially excluded, and to wives who earn more yet still do most of the housework, it yields predictions standard models do not. Evidence is illustrative: ethnographies, a 70-household vignette survey, census shares and a Panel Study of Income Dynamics regression. Identity is modelled as self-image to be maintained, not as concern for a group’s welfare. | Active — read in full 2026-10-29 (NOTE-1311) from the journal’s typeset text deposited in Duke University’s repository DukeSpace (hdl.handle.net/10161/1993; Unpaywall labels it the submitted version, but it carries the journal’s pagination and copyright line), fetched through the repository’s own API; worth reading as the founding statement of identity economics: identity as self-image in the utility function, with prescriptions and identity externalities, applied to gender at work, exclusion and the household. Read it knowing that its evidence is illustrative, that two of its models are solved only in appendices “available from the authors upon request”, and that the self it puts in utility is a self-image to be kept, not a self that takes in the group’s welfare. |
| LIT-1753 | The epistemic challenge to longtermism | Tarsney (2023). The epistemic challenge to longtermism: our ability to predictably affect the future may fade fast enough that far-future effects do not dominate. He models a $1 million longtermist intervention (existential risk reduction) whose effect lasts until an “exogenous nullifying event”, arriving at a constant rate r, and compares it with a global-health benchmark. With deliberately conservative inputs, longtermism wins only if r is below about 0.000135 per year when humanity settles the stars, or about 0.000000012 per year when it stays on Earth. Mixing in small credences in space settlement, a low r, fast settlement or very efficient conversion of stars into value makes longtermism win by orders of magnitude. But on some plausible views that win rests on minuscule probabilities of astronomical payoffs, so the case depends either on non-obvious empirical claims or on tolerating Pascalian fanaticism. Even where longtermism wins, most of its expected value may fall within thousands or millions of years. | Active — read in full 2026-10-29 (NOTE-1247) from the author’s working paper (GPI Working Paper No. 3-2022, version 4, April 2022) on the Global Priorities Institute’s site; worth reading as the most careful quantitative statement of the epistemic objection to longtermism, and as a demonstration that the expected-value reply to it comes to rest on very small probabilities. |
| LIT-1755 | The Psychology of Rivalry: A Relationally Dependent Analysis of Competition | Kilduff, Elfenbein & Staw (2010). Rivalry is a subjective competitive relationship that raises the psychological stakes of competing with one opponent, independently of objective stakes. Across 71 NCAA basketball teams, half the variance in rated rivalry belongs to the pair, not either team; rivalry grows with proximity, similarity, games played and above all a history of even contests, is largely reciprocated, and goes with bigger crowds and slightly better defence. | Active — read in full 2026-10-29 (NOTE-1292) from the published version on first author Kilduff’s NYU Stern pages; worth reading as evidence that rivalry belongs to the pair of competitors (half its variance) and to their history of even contests, and that it is mostly reciprocated, which bears on CASE-098 and QUESTION-298. |
| LIT-1756 | Intergenerational Justice | Meyer (2003; revised 2026). The SEP entry on what present people owe future and past people, which argues a position as well as surveying. Future people’s contingency on our choices, the non-identity problem, defeats harm understood as making someone worse off than before or than otherwise. It does not defeat a threshold notion of harm, on which we harm a person by causing her to exist, or to be, below a normatively set threshold. Combined with the counterfactual notion, this gives a “disjunctive” harm. The threshold is best read as sufficientarian, in basic needs or capabilities, rather than egalitarian or prioritarian; Rawls’s just savings principle is one version. The entry is weakly person-affecting, so it owes merely possible people nothing, and it grants that this gives no reason to prefer a flourishing future to none. That gap is filled by concerns that are not rights: Scheffler’s afterlife conjecture, and an obligation owed to present and past people not to destroy the goods and practices on which future-oriented projects depend. Historical injustice is treated with the same notions of harm. | Active — read in full 2026-10-29 (NOTE-1304) from the SEP entry, substantive revision of 17 July 2026, with its notes; worth reading as the standard map of the person-affecting side of the obligations question, by an author who argues for a threshold, sufficientarian reading of it and says where rights run out. |
| LIT-1758 | Second-Person Engagement, Self-Alienation, and Group-Identification | Zahavi (2016/2019) reconstructs and defends Husserl’s empathy-based account of the “we” against Heidegger and Hans Bernhard Schmid. Truly social acts need a second-person relation: an I–Thou relation of reciprocal, communicative address, in which I am aware of the other and of myself as addressed by them. Taking over the other’s perspective on oneself, a self-apprehension Husserl calls “self-alienation”, lets the difference between self and other stay present but be “somewhat downplayed”, and that is a formal condition of coming to see oneself as “one of us”. A we is “not an enlarged I”: it preserves plurality and is not fusion. Zahavi likens the condition to self-categorization theory’s self-stereotyping, while noting that Husserl attends far more to the interpersonal encounter beneath it. Against Schmid he argues that the sense of “us” can be analysed, that not every social relation is a we, and that children’s self-awareness precedes their in-group bias. He concedes that an account built on the dyadic face-to-face “we” does not cover anonymous, institutional “we”s. | Active — read in full 2026-10-29 (NOTE-1289) from the peer-reviewed accepted manuscript in the University of Copenhagen’s repository (curis.ku.dk); worth reading as the phenomenologist’s case that coming to see oneself as one of us is a change in how one apprehends oneself, through another’s eyes, and that the resulting “we” is a plurality, not an enlarged I. |
| LIT-1761 | ”Shaping Humanity’s Longterm Trajectory” | Ord (2025). A framework for comparing ways present action could change humanity’s long-run future. Humanity’s “instantaneous value” over time is a curve; the future’s value is the area under it, and an intervention’s value is the area between the default and the altered curve. Value must be roughly quantitative and separable across time, with no pure time preference. Four idealised changes have values that do not depend on the curve’s shape: an advancement (the future reached δt sooner) is worth about (v_τ − v_0)δt, independent of the future’s duration τ, and about −v_0δt if the end comes sooner too; a speed-up scales with (v_τ − v̄)τ; a gain (a fixed rise in value) with τ; an enhancement (a proportional rise) with v̄τ. Raising the chance of surviving near-term existential risk by a factor γ_p is worth (γ_p − 1)v̄τ, like an enhancement, and meets the bar of contingency more easily. So it is hard for advancing progress to rival existential risk reduction: on a million-year future, a year’s advancement is worth about a one-in-a-million gain in survival chance. | Active — read in full 2026-10-29 (NOTE-1269), in place of LIT-1678, which could not be fetched here; worth reading as Ord’s own formal statement of why reducing existential risk dominates other ways of shaping the future, and of the evaluative assumptions (time-separable value, no pure time preference) that this needs. |
| LIT-1762 | A critical view on transgenerational epigenetic inheritance in humans | Horsthemke (2018). A Comment. Transgenerational epigenetic inheritance is documented in plants, nematodes and fruit flies; in mammals it must pass the Weismann barrier and two waves of reprogramming. Rodent reports mostly await independent confirmation, and the human ones (grandparental food supply, a Prader–Willi imprint) rest on unique cohorts. The Dutch Hunger Winter shows fetal programming, not germline transmission. Familial epimutations usually turn out to be secondary to a genetic variant. A proof needs: genetic, ecological and cultural inheritance excluded (F3 after an exposed pregnant female, F2 after an exposed male, with IVF and fostering); the factor found in pure germ cells; and the factor shown to cause the effect. In humans only genetic effects can be excluded. Cultural transmission very likely outweighs any epigenetic inheritance; the author remains sceptical. | Active — read in full 2026-10-29 (NOTE-1265) from the published text (PMC6065375, CC BY), served by NCBI’s PMC OAI-PMH service; worth reading as the shortest statement of what would prove germline epigenetic inheritance in humans, and of why the proof may be out of reach. |
| LIT-1763 | Population and Having Children Now | Narveson (2017). Returns to his 1967 and 1973 theme, that utilitarianism commits one to making people happy and not to making happy people, after abandoning utilitarianism. He holds that creating a person neither benefits nor harms them: before conception there is no one to confer life on, and without a prior person harm and benefit lack a comparator. Yet, “contrary, perhaps” to how he was read, the existence of people with good lives is normally a good thing and a reason to create them. It matters to us because parents and the benevolent like it, and because more people benefit those around them. Morality’s enforceable part, though, licenses interfering with procreation only when it would harm actual persons, “alive, breathing, and acting now (or at any rate in their lifetimes)”, never for possible ones. Not helping the poor instead of having a child is not harming them. Against Benatar, a life’s goods can outweigh its harms. The second half argues, with little evidence, that resources are created rather than fixed, that current climate policy is inefficient, and that no general conflict between present and future people exists. Parents may have as many children as they want and can afford. | Active — read in full 2026-10-29 (NOTE-1318), in place of LIT-1769, which could not be reached; worth reading as the founder of the person-affecting slogan restating it late: creating happy people is good but owed to no one, and only harm to actual people can bind; read in place of the 1973 paper (LIT-1769), which it summarizes in one sentence. Its second half is a polemic on resources and climate, not argument. |
| LIT-1765 | Reconceptualizing Individuals, Categories, and the Social Group: Self-Categorization Theory 2.0 | Skorich (2025, v2 2026), preprint. Five critiques of self-categorization theory as stated in Turner et al. 1987: categorization into equivalence classes is neither sufficient nor necessary for perceiving a group as an entity; “self-categorization” is underspecified and should mean categorization of intentional agents; the person level is underexamined; meta-contrast is computationally intractable as a basis for entity formation and rests on prototype semantics; and comparative relations are overemphasized. Proposes SCT2.0 (self-conceptualization theory): groups are perceived from cues to collective intentionality, and represented as atomic concepts with object files in a language of thought. | Active — read in full 2026-10-28 (NOTE-1295) from the PsyArXiv preprint, v2; worth reading as a sympathetic insider’s critique of self-categorization theory that quotes the 1987 book’s chapter 3 assumptions and hypotheses verbatim with page numbers, so it stands in for the unread book’s core statement. It argues that categorization yields interchangeability, not a group entity; that meta-contrast is computationally intractable as a basis for entity formation; and that groups are perceived from cues to collective intentionality. Unreviewed; its key experiments are under review. Source of THEORY-1112. |
| LIT-1766 | Recategorization and Prosocial Behavior: Common In-Group Identity and a Dual Identity | A review of the common in-group identity model applied to helping. Recategorizing two groups as one removes in-group bias in helping: in a laboratory study, help to an original out-group member rose to the in-group level; at a football stadium, White fans complied with a Black interviewer’s request more often when he wore their university’s hat (59% vs 36%). Commons-dilemma studies show the same for cooperation. But the form of the shared identity matters. White students helped a Black student least when he called himself a Black person or a Black Colgate student (a dual identity), and most when he called himself a Colgate student. In the second study, empathic concern partly mediated that effect on helping; attitudes did not. The authors trace the dual identity’s cost to majority members projecting their group’s standards onto the superordinate category, and to identity threat. | Active — read in full 2026-10-29 (NOTE-1286), in place of LIT-1710 and LIT-1709, which could not be reached; worth reading as the model’s authors’ own account of how an enlarged “we” extends helping across group lines, with the qualification that the “we” which helps is the helper’s version of it. |
| LIT-1768 | Future People, the Non-Identity Problem, and Person-Affecting Principles | Parfit (2017), his last paper, submitted unfinished the day before his death. Most of our choices of policy change who will exist, so a policy that makes later lives much worse may be worse for no one who ever lives: the non-identity problem. Narrow person-affecting principles, on which nothing can be worse, or wrong, if it is worse for no one, then imply that such policies, and even ending human history by all choosing childlessness, are not wrong. Parfit rejects them, and rejects solutions that appeal to rights, wronging or Boonin’s acceptance of the implausible conclusions. He also retracts his own earlier appeal to an impersonal principle. Instead, being caused to exist with a life worth living is an intrinsic, existential benefit, and on a Wide Person-Affecting Principle one outcome is worse if it benefits people less. That solves the non-identity problem in person-affecting terms and keeps “better than” transitive, where the Weak Narrow Principle and the Two-Tier View do not. For different numbers he proposes a Wide Dual Principle, counting both the benefits to each and the benefits to all. It does not imply the Repugnant Conclusion, though Parfit grants that this alone does not let us avoid it. He allows that we may be permitted, or required, to favour present people over greater benefits to future people, but warns that done by every generation this could “wreck the Earth”. | Active — read in full 2026-10-29 (NOTE-1263) from the publisher’s PDF as reprinted in The Philosophers’ Annual vol. 37 (philosophersannual.org); worth reading as Parfit’s final answer to his own non-identity problem, which puts obligations to future people on a person-affecting footing without making them owed to anyone in particular. |
| LIT-1771 | Social Influence and Group Identity | A review, by one of the SIDE model’s authors, of the self-categorization account of social influence. Group influence is not only compliance for approval (normative influence). Because a group can be a level of the self, influence from in-group members can be true private acceptance (“referent informational influence”). Classic findings are reread this way: Asch and Sherif conformity, Milgram obedience, minority influence, emergency crowds, bystander helping, emotional contagion and riots. Influence is moderated by identification, prototypicality, intergroup threat and context. Isolation and visual anonymity strengthen group influence rather than weakening it, as the SIDE model predicts. Crowd members do not lose the self; they switch to a group identity. | Active — read in full 2026-10-29 (NOTE-1268), in place of LIT-1726 and LIT-1731, which could not be reached; worth reading as the most recent overview, by an author of the SIDE model, of how self-categorization theory treats influence, norms and deindividuation, and as the record’s second-hand access to Postmes & Spears 1998. |
| LIT-1772 | Social identity theory | A textbook chapter. Social identity is “that part of an individual’s self-concept which derives from knowledge of membership in a social group (or groups) together with the value or emotional significance attached to that membership” (Tajfel 1978). The theory has two parts. In the first, categorization is always self-relevant, and the motive for a positive social identity drives comparison with out-groups. That identity serves needs for certainty, self-esteem and meaning. In the second, members of low-status groups choose individual mobility, collective action or social creativity, depending on the permeability of group boundaries and the legitimacy and stability of status differences. Identification has cognitive, affective and behavioural components. Applications: identification improves health behaviour and buffers stress; at work it matters more than instrumental interdependence and motivates volunteers. An imagined common in-group raised Italian children’s willingness to help an immigrant classmate. | Active — read in full 2026-10-29 (NOTE-1315), in place of LIT-1695, which could not be reached; worth reading as a current statement of social identity theory by two of its principal researchers, read in place of Tajfel & Turner 1979 (LIT-1695, Unavailable). It is the record’s clearest source that the theory builds caring into the definition of social identity while measuring it as a separate component. Uncritical, with no effect sizes. |
| LIT-1773 | Existential Risk Prevention as Global Priority | Bostrom (2013). Defines existential risk as a threat of premature extinction of Earth-originating intelligent life or of the permanent and drastic destruction of its potential for desirable development: risks of at least crushing severity and pan-generational scope. Gives four classes (human extinction, permanent stagnation, flawed realisation, subsequent ruination), the last two defined normatively. On an aggregative, time-neutral view even Earth alone could hold 10^16 future lives, so cutting the risk by a millionth of a percentage point is worth a hundred million lives. Hence the maxipok rule of thumb for impersonal moral action: maximise the probability of an outcome that avoids existential catastrophe. Other ethical views (Adams’ shared project of humanity, preference satisfaction, custodial duties to ancestors and descendants) concur to differing degrees. Under moral uncertainty, keeping options open recasts sustainability as a trajectory. The risk is neglected: in Scopus, papers on “human extinction” number fewer than those on dung beetles. It is also undersupplied, as a pan-generational public good that even a world state could only partly capture. | Active — read in full 2026-10-29 (NOTE-1321) from the published version posted on Bostrom’s existential-risk site; worth reading as the standard definition and typology of existential risk, and for the record’s purposes as the one longtermist source that discusses motivation: it diagnoses a “deficit of motivation” and gives, through Adams, a ground in humanity’s shared project. |
| LIT-1774 | Inter- and transgenerational inheritance of behavioral phenotypes | Jawaid & Mansuy (2019). A short review from Mansuy’s laboratory, the proponents’ side. Rodent studies show that parental trauma, stress, drugs and in-utero insults pass behavioural phenotypes to offspring, in some models to the third or fourth generation, and that parental environmental enrichment passes benefits, and can prevent the transmission of trauma’s effects. Germline dependence is shown by IVF and by injecting sperm RNA, which reproduces the phenotypes; non-coding RNAs are the best candidate carriers. Human studies of genocide survivors’ descendants are offered as similar, and the review itself tables them as intergenerational. How a stimulus reaches the germline, and how effects pass beyond the first generation, are unknown. Germline reprogramming and the sceptics’ objections are not discussed. | Active — read in full 2026-10-29 (NOTE-1296), in place of LIT-1738, which could not be reached; worth reading as the proponents’ short statement of the rodent case for germline transmission of behaviour, read in place of Bohacek and Mansuy 2015 (LIT-1738), and for what it does not answer. |
| LIT-1775 | Social Identity and Close Relationships: What is the Connection? | Brewer argues that close relationships and group memberships are two distinct forms of social identity, each a way the individual self is extended to include others: the relational self is personalized (particular, non-interchangeable others), the collective self depersonalized (a symbolic group). They are not two routes to one need for belonging. Measures of group and interpersonal attachment (r = .46 and .33) and of loneliness separate them, and men and women weight them differently. She models each level as a regulatory system balancing opposed needs (uniqueness and similarity; autonomy and intimacy; separation and inclusion), with transfer between them. The model predicts two collectivisms: relational collectivists draw tight in-group boundaries, while individualists identify more readily with large inclusive groups. | Active — read in full 2026-10-29 (NOTE-1290), in place of LIT-1757, which could not be reached; worth reading as the tripartite self’s author restating it in her own words, with the claim that both relationships and groups extend the self, in two different ways. |
| LIT-1776 | Remembrance of Brains Past | A blog post by the authors of Shomrat and Levin 2013 announcing its result. Planarians trained to a chamber with a rough, laser-etched floor later recognised it, measured by their readiness to eat a piece of liver there rather than explore as naive worms do, and did so again after their heads were cut off and regrown, provided they had “a brief refresher” first. The training used an automated device that gives individual reward and punishment to 12 worms at a time, around the clock, scored by computer, built to answer the doubts about McConnell’s hand-run 1960s experiments. The authors conclude that memories “can be stored somewhere outside of the brain” and “imprinted on a naïve regenerated brain”, and suggest non-neural cells linked by gap junctions as the store. No numbers, methods or controls are given. | Active — skimmed 2026-10-29 (NOTE-1283), in place of LIT-1732, which could not be reached; worth reading as the authors’ own plain statement of the planarian result and of how they read it, including the reminder it needed; too thin to stand for the paper’s data. |
| LIT-1778 | The Significance, Persistence, Contingency Framework | MacAskill, Thomas & Vallinder (2022). A short technical note that formalises the heuristic of What We Owe the Future, chapter 2. The value an originating event E contributes through a feature F of the world factors exactly as significance (ΔV/ΔT, value per unit of the extra time), persistence (T, how long F lasts) and contingency (ΔT/T, the share of F’s duration due to E), with marginal and expected-value forms in which the factors are ex ante quantities, not expectations of the factors. An alternative makes significance independent of the counterfactual (V/T) and contingency the sum of the semi-elasticities of significance, persistence and the probability that F is present. The SPC estimate feeds the “importance” factor of the importance–tractability–neglectedness framework, and the note proposes reading tractability as overall easiness times “leverage”. It assumes expected-value maximisation and makes no ethical argument. status_note: worth reading as the formal statement of how What We Owe the Future values an act’s effect on the long-run future, read in place of the book; it gives the book’s accounting, not its argument that future people count. | Active — read in full 2026-10-29 (NOTE-1300), in place of LIT-1747, which could not be reached; worth reading as the formal statement of how What We Owe the Future values an act’s effect on the long-run future, read in place of the book; it gives the book’s accounting, not its argument that future people count. |
| LIT-1779 | The Afterlife (Tanner Lectures I and II) | Scheffler’s 2012 Tanner Lectures, the source of the first two chapters of Death and the Afterlife. By “the afterlife” he means that other people will live on after one’s own death. Imagined reactions to a doomsday scenario (the earth destroyed thirty days after one’s death) and to P. D. James’s infertility scenario (no one dies early, but no one more is born) show that this matters to us in its own right and as a condition of other things mattering. Without it many projects, and perhaps even reading and eating well, would lose their point (the “afterlife conjecture”). So, in one respect, humanity’s survival matters more to us than our own or our loved ones’. Scheffler reads this as dependence on future people, not as unsuspected altruism toward them, and as showing that individual valuing presupposes humanity as an ongoing historical project. | Active — read in full 2026-10-29 (NOTE-1298), in place of LIT-1754, which could not be reached; worth reading as the exact statement of the afterlife conjecture and of what Scheffler does and does not infer from it: our dependence on future people, not altruism toward them. The third essay, the commentaries and the replies are in the book only. |
| LIT-1780 | Social Identity Theory’s Self-Esteem Hypothesis: A Review and Some Suggestions for Clarification | Rubin & Hewstone (1998) review over 40 studies of social identity theory’s self-esteem hypothesis, in Hogg and Abrams’s two corollaries: successful intergroup discrimination raises self-esteem (1), and low or threatened self-esteem motivates discrimination (2). They sort the measures by three distinctions, global or specific, personal or social, trait or state, and argue the theory implies specific social state self-esteem, while most studies used global personal trait measures such as Rosenberg’s scale. Counting experiments, 18 support and 13 do not support corollary 1, but only 7 support and 28 do not support corollary 2; only one of eight full tests supports both. Nine studies find people with high personal self-esteem the most discriminatory, the reverse of corollary 2. So discrimination seems to raise self-esteem without being motivated by a need for it, which leaves the theory’s motivational explanation without support. The authors attribute this to imprecision and propose a version in specific social state self-esteem, which the two studies that measured it support. | Active — read in full 2026-10-29 (NOTE-1278) from the authors’ final version self-archived in the University of Newcastle (Australia) repository (figshare 28979180); worth reading as the review that both sides of the record’s self-esteem disagreement cite, and as the evidence on whether group-serving bias is motivated by the esteem of a social self. |
| LIT-1783 | Empathy, Altruism, and Group Identification | A conceptual paper. It takes Cialdini et al.’s claim that empathy-induced helping is due to self-other merging and asks what “merging” could coherently mean. May argued that every reading either attributes absurd beliefs or fails to explain helping. The authors answer that merging is group identification: in empathizing with Y, X comes to conceive of Y as part of X’s social self, so Y’s welfare becomes constitutive of “our” welfare. They argue that this reading is behaviourally adequate, because it explains Batson’s results in the same way as minimal-group favouritism, and psychologically plausible, because it posits a non-doxastic self-representation rather than a belief in being two bodies. Helping so motivated is then altruistic at the individual level and egoistic at the group level. The empirical dispute with Batson et al. (1997) is set aside. | Active — read in full 2026-10-29 (NOTE-1277), in place of LIT-1728 and LIT-1700, which could not be reached; worth reading as the only work in the record that states the owner’s thesis for empathic helping in a precise form: concern for another’s welfare is non-instrumental, and that welfare is constitutive of the helper’s first-person plural welfare. It offers no measure of group identification apart from empathy. |
| LIT-1784 | Review of Samuel Scheffler, Death and the Afterlife | A short NDPR review of Scheffler’s Death and the Afterlife. It summarizes the afterlife conjecture and the conclusion that “our own survival is less important to us than the survival of the human race” in one specific sense. It reports the third lecture: life must be temporally bounded, so personal immortality is no remedy, yet confidence in our values depends on others living on. It reports Frankfurt’s Darwinian doubt that the concern is altruistic, and Wolf’s argument that people facing extinction could and should “snap out of it”. It faults all parties for ignoring religious thought on finitude. | Active — read in full 2026-10-29 (NOTE-1306), in place of LIT-1754, which could not be reached; worth reading as the only account the record holds of the book’s third lecture and of Wolf’s and Frankfurt’s commentaries; read its “more altruistic construal” against Scheffler’s own denial of altruism. |
| LIT-1785 | Activating the legacy motive mitigates intergenerational discounting in the climate game | A laboratory climate game: 180 people in 30 groups of six, each with 0, 4 into a climate account. If the group reaches 45 endowment is saved; if not, it is lost with 90% probability. When the saved endowments were paid to the players the next day, 9 of 10 groups reached the target. When they went instead to planting trees for future generations, 2 of 10 did. When players in the tree-planting game also read three short messages meant to activate the legacy motive (death awareness, the powerlessness of future generations, and paying forward a past generation’s sacrifice), 7 of 10 did, and group investment rose from 105.20. All three messages raised investment over the matched rounds of the plain tree-planting game. Legacy induction made fair shares, not extra giving, the norm. There were no manipulation checks and no control message. The authors say people invest in legacies “for largely—although not entirely—selfish reasons”. | Active — read in full 2026-10-29 (NOTE-1279), in place of LIT-1760, which could not be reached; worth reading as a conceptual extension of the 2012 mortality-and-legacy result to group cooperation, and as the record’s nearest substitute for Wade-Benzoni et al. 2012 (LIT-1760). Read it knowing that its legacy induction bundles three mechanisms, one of them identification with past and future generations, so it cannot say which did the work. |
| LIT-1786 | Group-level self-definition and self-investment: A hierarchical (multicomponent) model of in-group identification | In-group identification has five components on two correlated dimensions. Group-level self-definition is individual self-stereotyping (seeing oneself as like the average member) and in-group homogeneity; group-level self-investment is solidarity, satisfaction and centrality. In confirmatory factor analyses of Dutch, European and university identification in two cohorts (N = 464, 363), this model fit better than one-factor, two-factor and cognitive-versus-affective alternatives; the two dimensions correlated .61 to .77. Prospectively, the components predicted different things: centrality predicted perceived threat, homogeneity perceived intergroup difference, and, facing evidence of their group’s misdeeds, self-stereotyping predicted group-based guilt while satisfaction and centrality predicted legitimizing the misdeeds. | Active — read in full 2026-10-29 (NOTE-1262), in place of LIT-1795, which could not be reached; worth reading as the direct test of whether identification splits into a self-definition and a caring dimension: it does, and they can work against each other. |
| LIT-1787 | Witnessing and cultural trauma: the role of flashbulb memories in the trauma process | Hirst, Cyr and Merck (2020). An essay joining Alexander’s trauma process to the psychology of flashbulb memory. People who learned of an event at a distance keep vivid, confident memories of where they were, and these let them claim to have been “there” and to testify, like eyewitnesses, to what it was like. Such memories are community-specific and can be community-defining, so where nearly everyone holds one, carrier group and audience coincide and the trauma process can start among equals. The memories are inaccurate in detail but held with high confidence, which is what makes them count. They pass to children: in a study of children young at the time of 9/11, 89% could report a parent’s flashbulb memory, and those who identified more strongly as American knew it better. | Active — read in full 2026-10-29 (NOTE-1305), in place of LIT-1679, which could not be reached; worth reading as the one work in the record that ties knowing a parent’s memory of a public trauma to the child’s identification with the group. |
| LIT-1788 | Surviving Death, Again | Johnston (2023). Records “a change in view” from Surviving Death (2010). There he argued that the Christian hope of resurrection fails and offered a this-worldly surrogate, “living on in the onward rush of humankind”, built on the idea that we are higher-order things whose deepest future-directed attitudes fix which future embodiments are ours. Now, because reductionist accounts of personal identity breed “fellow travelers” (personites and the like) with moral status and conflicting interests, he holds that we are essentially embodied wills whose present bodies are not essential, so re-embodiment after death is possible. Defines subserving, implementing and interdependence as non-reductive relations between mental and neural events. | Active — read in full 2026-10-29 (NOTE-1257) from the published version, open under CC BY-NC-ND at TheoLogica; worth reading as Johnston’s own retraction of the account of survival in Surviving Death (LIT-1759, Unavailable), read in its place. It now holds that we are essentially embodied wills, which drops the self-making view on which the earlier “onward rush of humankind” rested. The paper’s own subject is the metaphysics of survival, not altruism. |
| LIT-1789 | Cultural Trauma: Slavery and the Formation of African American Identity | Eyerman (2001), chapter 1 read. Cultural trauma is not a wound to individuals but “a dramatic loss of identity and meaning, a tear in the social fabric” of a group, which need not be felt or experienced by all its members. Slavery became the trauma of African Americans “in retrospect”: after the failure of Reconstruction, a generation that had not been enslaved made its memory the “primal scene” of a new collective identity, against a white memory of slavery as benign. Membership was set by a shared fate, not shared experience or descent. Carrier groups, chiefly intellectuals and social movements, articulate the trauma; each social generation reworks the memory; it moved from group memory to national memory only with the civil rights movement. | Active — read in full 2026-10-29 (NOTE-1246), in place of LIT-1679, which could not be reached; worth reading as the chapter that states the cultural trauma framework for slavery, and says plainly that the injured collective self is fixed by shared fate, not by descent or experience. |
| LIT-1790 | Self-categorization and social identification: Making sense of us and them | Reimer, Schmid, Hewstone and Al Ramiah (2020), preprint of a textbook chapter. Self-categorization is social categorization applied to oneself, hierarchical in level and situational in salience (accessibility × fit); social identification is multidimensional (Ashmore et al.’s seven components); social identity theory explains in-group bias by positive distinctiveness, moderated by status, permeability, stability and legitimacy; and multiple categorization (crossed, common in-group, dual identity, in-group projection, complexity) predicts when bias falls. It concludes that identity processes alone do not explain negative intergroup attitudes. | Active — read in full 2026-10-28 (NOTE-1251) from the authors’ PsyArXiv preprint of a textbook chapter; worth reading as a plain, current exposition of the social identity perspective: self-categorization (accessibility, comparative and normative fit, depersonalization), Ashmore et al.’s seven dimensions of social identification, social identity theory’s minimal-group and status findings, and the multiple categorization models (crossed categorization, common in-group, dual identity, in-group projection, social identity complexity). A secondary source; its account of self-categorization theory is two pages. |
| LIT-1792 | Death | The SEP survey of the philosophy of death, revised in 2026. Luper gives a compositional account of life (an object is alive when its parts control what composes it, under information they carry) and defines death as the loss of the capacity for vital activities. He reconstructs Epicurus’s argument that death is nothing to us. He shows that it fails if welfare is not only pleasure or if things can harm by precluding goods: the deprivationist defense. He surveys answers to when death harms (concurrentism, priorism, subsequentism, indefinitism, atemporalism), Lucretius’s symmetry argument, and posthumous harm, where Pitcher’s desire-based account locates the harm in the living person. He sides with Williams’s critics: immortality need not be tedious. | Active — read in full 2026-10-29 (NOTE-1294), in place of LIT-1740, which could not be reached; worth reading as a map of the death-harm debate with its premises made explicit. It gives Pitcher’s account of posthumous harm in a paragraph, without his ante-mortem person. |
| LIT-1794 | Self and Collective: Cognition and Social Context | Turner, Oakes, Haslam and McGarty (1994). Self-categorization theory’s account of self and collective: personal and social identity are different levels of self-categorization, the emergent properties of group processes come from a shift in self-perception from the one to the other, and self-categories are inherently variable and context dependent because they are social comparative and relative to a frame of reference. | Active — read in full 2026-10-28 (NOTE-1284) from a scan of the published article supplied by the owner; worth reading as the shortest statement, by its authors, of self-categorization theory’s view of the self: personal and social identity are equally authentic levels of self-categorization, salience is readiness times fit (metacontrast and normative fit), and the level, kind, content and prototype of self-categories vary with the comparative frame. It goes on to speculate that the self is generated in context rather than stored. A theoretical paper whose evidence is the group’s own studies, reported without data. Source of THEORY-1114. |
| LIT-1796 | Many Labs 4: Failure to Replicate Mortality Salience Effect With and Without Original Author Involvement | A preregistered multisite replication of Study 1 of Greenberg et al. (1994), the standard mortality-salience test: writing about one’s own death, against writing about watching television, was to raise preference for a pro-US over an anti-US essay author. Seventeen US university labs contributed 1,550 usable participants. Seven ran a protocol designed with the original authors; ten built their own. The pooled effect was Hedges’ g = 0.07 (95% CI −0.03 to 0.17), against the original d = 1.34, and no exclusion rule, protocol type or subset of TMT-knowledgeable labs produced a significant effect. Effects did not vary across labs more than chance allows, so the test of whether expert involvement helps replication was left without an effect to act on. | Active — read in full 2026-10-29 (NOTE-1322), in place of LIT-1687, which could not be reached; worth reading as the best-powered direct test of terror management theory’s worldview-defense prediction, and as the fullest record of how its original authors think the effect must be produced. |
| LIT-1797 v2 | Gromov-Wasserstein Averaging of Kernel and Distance Matrices | Peyré, Cuturi & Solomon (2016). An entropic Gromov–Wasserstein discrepancy between similarity matrices of any size and loss, computed by an iteration in which each step is a Sinkhorn problem, and a barycenter of such matrices as a Fréchet mean of user-chosen size, histogram and weights. Block coordinate relaxation alternates coupling updates with a closed-form matrix update: for square loss the weighted average of the inputs realigned by their couplings, for KL a weighted geometric average, so PSD and infinitely divisible kernels stay in their classes. Convergence at the step size used is observed, not proved, and only stationary points are sought. Applications: shape barycenters, point-cloud k-means and molecular energy regression. | Active — read in full 2026-10-29 (NOTE-1343), from the PMLR PDF; worth reading for the explicit form of a Gromov–Wasserstein barycenter, a weighted average of realigned inputs whose size, weights and regularization are chosen in advance, and for the authors’ statement of what its algorithm does not guarantee. |
| LIT-1798 v2 | PETra: A Multilingual Corpus of Pragmatic Explicitation in Translation | Osmelak et al. (2026). A released corpus of about 3,000 English-source sentence pairs from TED-Multi and Europarl in twelve target languages, in which the translation adds or replaces material to make culture-bound knowledge explicit: unit conversions, entity descriptions and specifications, translator glosses, typed under a 19-subtype schema and marked as added or replacing. Candidates come from null alignments next to a named entity; a multilingual BERT classifier trained by active learning on German and Spanish found three quarters of the pairs, its accuracy rising 7–8 points over the cycles. Measurement conversion is the largest category. No inter-annotator agreement is reported. | Active — read in full 2026-10-29 (NOTE-1344) from the LREC 2026 PDF; worth reading as the only multilingual corpus of the additions human translators make for a new audience, with each addition marked in the target, and for what it lacks: no reported annotator agreement. |
| LIT-1799 v2 | TyDiP: A Dataset for Politeness Classification in Nine Typologically Diverse Languages | Srinivasan & Choi (2022). Graded politeness ratings (−3 to +3), three Prolific annotators per item, for 500 Wikipedia talk-page requests in each of Hindi, Korean, Spanish, Tamil, French, Vietnamese, Russian, Afrikaans and Hungarian. Mean pairwise Spearman agreement is 0.46 on own-language items and 0.36 on English items rated by the same bilinguals. On the balanced top-and-bottom-quartile sets, an XLM-R trained on English requests reaches 0.81 zero-shot accuracy, about 10 points below leave-one-out human accuracy (around 90%) in six languages. Annotators were screened for agreement with that classifier. Politeness and formality are shown not to be interchangeable. | Active — read in full 2026-10-29 (NOTE-1339) from the Findings of EMNLP 2022 PDF; worth reading as a nine-language politeness dataset with human-agreement figures (pairwise Spearman 0.46 own-language, 0.36 English), a reference for a reliability target, with the caveat that its annotators were screened against a classifier. |
| LIT-1800 v2 | CycleGAN, a Master of Steganography | Chu, Zhmoginov & Sandler (2017). A CycleGAN trained between aerial photographs and maps reconstructs details of a photograph that its generated map does not show, because it hides them in a low-amplitude, high-frequency signal: noise of three 8-bit levels or JPEG compression destroys the reconstruction, low-frequency change does not. The same sensitivity lets an imperceptible perturbation of almost any map make the reverse generator produce any chosen photograph. The authors trace it to the cycle-consistency loss between domains of unequal complexity, by argument; the evidence is one model, mostly shown by example. | Active — read in full 2026-10-29 (NOTE-1346) from arXiv v2; worth reading as the plainest demonstration that a perfect round trip can rest on a channel the intermediate’s reader never sees, so that round-trip agreement certifies invertibility, not content. One model, mostly shown by example. |
| LIT-1801 v2 | Word Embeddings as Metric Recovery in Semantic Spaces | Hashimoto, Alvarez-Melis & Jaakkola (2016). If text were a random walk whose steps depend on distance in a latent space, negative log co-occurrence over a long window, less per-word terms, would converge to squared latent (geodesic) distance whatever the one-step link. Under that toy model, which the authors say is not a model of language, GloVe, softmax word2vec and PMI-SVD have the true embedding among their optima, up to isometry; a negative-binomial “metric regression” matches them on analogy, series and classification tasks, and word embedding of graph random walks does manifold learning on MNIST. Evidence that real co-occurrences form a Euclidean space is a correlation of 0.75 with human similarity and two nearest-neighbour statistics. | Active — read in full 2026-10-29 (NOTE-1329) from the ACL Anthology PDF; worth reading for the proof that, under a metric random walk, log co-occurrence over long windows converges to squared latent distance whatever the one-step link, so embeddings identify a metric and coordinates only up to isometry; its evidence that real corpora have a Euclidean semantic space is weaker than its theorem. |
| LIT-1802 v3 | The Causal Information Bottleneck and Optimal Causal Variable Abstractions | Simoes, Dastani & van Ommen (2024; UAI 2025). The causal information bottleneck learns a stochastic abstraction T of discrete variables X by trading the information T keeps about X against Ic(Y | do(T)), the entropy reduction in a target Y when T is set by intervention under a uniform protocol over X. Intervening on T is defined as a mixture of interventions on X through Bayes inversion of the encoder, and is identifiable by a backdoor formula. At full weight on control the optimum is the partition of X by p(y | do(x)), Chalupka et al.’s causal macrovariables, which the ordinary bottleneck misses under confounding. Three toy SCMs confirm it. | Active — read in full 2026-10-29 (NOTE-1347) from arXiv v5; worth reading as an exact, small-scale statement of the difference between compressing for prediction and compressing for control: at full control the optimum is the partition of X by p(y | do(x)), which the ordinary bottleneck misses under confounding. Toy problems only. |
| LIT-1803 | Relational Composition as Parallel Transport: What Per-Entity Frames Force in Attention | Sarkar, Mukherjee & Sato (2026), ARXIV-2610.34945. Under per-entity O(d) frames, an invariant attention score depends on two entities only through norms and ⟨xᵢ, Tᵢⱼxⱼ⟩, and a transport computed from one vector per endpoint has rank at most one, so relations must be supplied. On parsed CLUTRR unconstrained transports score 0.848 out of distribution, a transformer 0.436, and orthogonal ones 0.202; on StepGame’s commutative algebra rotations help. The paper calls the premise “a chosen inductive bias, not a consequence of fresh names”. | Active — skimmed 2026-10-29 (NOTE-1326) as the companion LIT-1820 cites for its premise. Worth keeping for its own statement that per-entity frame freedom is an inductive bias, and for the parsed-CLUTRR control in which forcing orthogonal transports costs 64.6 points out of distribution. |
| LIT-1804 v2 | CO-Optimal Transport | Redko, Vayer, Flamary & Courty (2020). Co-optimal transport matches two data matrices of different shapes by fitting a coupling of rows (samples) and a coupling of columns (features) together, under an entry-wise bilinear cost. With equal sizes and uniform weights it is zero exactly when the matrices agree up to separate row and column permutations, and it satisfies the triangle inequality; it proves no uniqueness of the plans, which are fixed only up to joint row–column symmetries. For symmetric matrices it lower-bounds Gromov–Wasserstein, with equality and shared optimal couplings for squared Euclidean distances. Exact solution is NP-hard in general; block coordinate descent reaches block-wise optima. It reports the best accuracy among the baselines on heterogeneous domain adaptation and co-clustering. | Active — read in full 2026-10-29 (NOTE-1335), from arXiv v3; worth reading for the exact relation between co-optimal transport and Gromov–Wasserstein (a lower bound, equal for squared Euclidean distances) and for what its zero theorem implies: joint sample and feature plans are fixed only up to the matrix’s joint row–column symmetries. |
| LIT-1805 v2 | Towards Optimal Transport with Global Invariances | Alvarez-Melis, Jegelka & Jaakkola (2019). Optimal transport between two point sets whose spaces differ by one unknown global linear map, drawn from a Schatten ℓp ball, posed as a joint optimisation over the coupling and the map. When the maps preserve angles or the target is whitened, the map can be eliminated in closed form: orthogonal maps leave the nuclear norm of the transported cross-covariance XΓYᵀ to maximise, and Frobenius-sphere maps its Frobenius norm, which is exactly Gromov–Wasserstein with cosine similarity. Alternating SVD and annealed Sinkhorn steps solve it without adversarial initialisation; on word translation it is level with GW and behind self-learning. | Active — read in full 2026-10-29 (NOTE-1333); worth reading for the exact statement of what a global-invariance alignment treats as arbitrary, one transformation from a stated class acting on the whole space, and for Lemma 4.3, which shows that for one class this is the same problem as Gromov–Wasserstein (THEORY-1135). |
| LIT-1806 v2 | Causal Optimal Transport of Abstractions | Felekis et al. (2023; CLeaR 2024). COTA learns a stochastic map from a low-level causal model’s states to a high-level one’s, given both DAGs, the map between their interventions and samples of each paired interventional distribution, without the structural equations. It solves one entropic optimal-transport problem per intervention, with a cost that rewards states compatible with the same paired interventions and a term meant to impose do-calculus relations between the plans. As written that term depends only on the plans’ marginals, which the transport constraints fix, so it is constant on the feasible set. The reported gains over non-causal transport come from the compatibility cost, and reverse when the intervention set is small. | Active — read in full 2026-10-29 (NOTE-1342) from arXiv v1; worth reading as the first method to learn a causal abstraction map from paired interventional samples without the structural equations, and for what it shows unintentionally: its do-calculus term is constant on the feasible set as written, so its gains come from an intervention-compatibility cost. |
| LIT-1807 v2 | AvAtar: Learning to Align via Active Optimal Transport | Yu et al. (2026). Active learning for alignment by entropic optimal transport. The oracle answers one fixed question, which target matches a given source object, and an answer sets that pair’s cost to zero. AvAtar ranks source objects by the derivative of a proxy utility of the transport plan (its squared norm, entropy, or graph consistency) with respect to supervising each candidate match, averaged over matches by the current plan. The derivative is exact, from one singular positive semidefinite (n + m) linear system solved by conjugate gradients. With 20% of true pairs given and 20% more chosen in ten rounds, it beats uncertainty, centrality and matching-sampling rules on network alignment and image–text tasks by up to 2.8 MRR points, without reported variances; weighting by the current plan is essential. | Active — read in full 2026-10-29 (NOTE-1327), from the arXiv v2; worth reading as a precise case of budgeted question choice within a fixed vocabulary: which object’s correspondence to ask about, scored by an exact derivative through entropic transport of a coherence proxy, and evaluated on accuracy. |
| LIT-1808 v2 | Unsupervised Hierarchy Matching with Optimal Transport over Hyperbolic Spaces | Alvarez-Melis, Mroueh & Jaakkola (2020). Matches two hierarchies, such as WordNets in two languages or two ontologies, from their Poincaré embeddings alone. Embeddings of one hierarchy from different seeds place branches differently and change pairwise distances, so Euclidean aligners and hyperbolic OT with an orthogonal map fail (P@10 at most 11%). Registering one space with a hyperbolic neural network trained through a Sinkhorn divergence reaches P@10 of 38–60% across languages, but P@1 of only 22% when a hierarchy is matched to a second embedding of itself, and fails without a pretraining step. GW is dismissed, not tested. | Active — read in full 2026-10-29 (NOTE-1323); worth reading as a case where the arbitrariness between two learned representations is not a group action at all: embeddings of one hierarchy from different seeds differ non-isometrically, and only a non-linear registration recovers part of the correspondence (THEORY-1136). Its matching uses a symmetric distance and does not preserve the hierarchy’s direction. |
| LIT-1809 v2 | POT: Python Optimal Transport | Flamary et al. (2021). A software paper for POT, an MIT-licensed Python library of optimal transport solvers as of 2021: exact transport by a C++ solver, entropic transport by Sinkhorn and stabilized variants, Wasserstein barycenters, partial and unbalanced transport, regularized transport with generic solvers, Gromov–Wasserstein, sliced Wasserstein and domain adaptation, tested to 92% line coverage. It compares features with OTT, OTJulia and GeomLoss and reports no benchmarks. Fused and partial Gromov–Wasserstein and co-optimal transport are not in it. | Active — read in full 2026-10-29 (NOTE-1325); the citable description of the POT library as of 2021. Worth citing for the library, with the version used, but not for fused or partial Gromov–Wasserstein or co-optimal transport, which this paper does not describe. |
| LIT-1810 v2 | Structure-Mapping: A Theoretical Framework for Analogy | Gentner (1983). An analogy maps the relations of a base domain onto a target and drops the attributes of its objects; of the relations, those bound into a system by higher-order relations are more likely to be carried over than isolated ones (systematicity), so in “the atom is like the solar system” MORE MASSIVE THAN maps and HOTTER THAN does not. The rules look only at the form of the representation, the arity and order of predicates, which sorts comparisons into literal similarity, analogy, abstraction and mere appearance. The predicate structure is taken as given, and the author concedes it is a modelling choice; the evidence is one study summarized without statistics. | Active — read in full 2026-10-29 (NOTE-1349) from a scan of the published article on the author’s Northwestern lab pages; worth reading as the founding statement that analogy maps relations rather than attributes and that higher-order relations select which relations go across, which is what a single-relation alignment such as Gromov–Wasserstein leaves out. |
| LIT-1811 v2 | Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs | Bodnar et al. (2022). In the time limit, diffusion with a sheaf Laplacian projects node features onto its harmonic space, and the class of restriction maps decides which labellings that space can linearly separate. Weighted graph Laplacians cannot separate the sides of a balanced bipartite graph; signed one-dimensional maps separate any two classes and no one-dimensional sheaf separates three; diagonal maps with d ≥ C stalks and orthogonal bundles with C ≤ 2d separate any number. Sheaf convolutions with non-symmetric maps can raise the Dirichlet energy that graph convolutions must lower. A model that learns the maps from node features at each layer is competitive on small heterophilic benchmarks. The separating sheaves are built from the labels, and the learned ones are inspected only on synthetic data. | Active — read in full 2026-10-29 (NOTE-1332) from arXiv v4; worth reading for the cleanest statement of what a sheaf’s restriction maps decide about diffusion: which labellings its harmonic space can separate, class by class of maps, with proofs. The separating sheaves are all built from the labels, and the orthogonal construction works at d = 8, which the paper denies. |
| LIT-1812 v2 | A Collection of Pragmatic-Similarity Judgments over Spoken Dialog Utterances | Ward & Marco (2024). The first collection of human pragmatic-similarity ratings: 693 pairs of a spoken dialog utterance and a re-enactment of it, made under six conditions so that similarity varies, rated on a 1–5 slider for “overall feeling, tone, and intent” by 6–9 judges in three sessions, two English and one Spanish, 5,532 ratings in all. Mean pairwise Pearson agreement between judges was 0.45, 0.72 and 0.66 by session, rising with experience and falling for lexically different pairs (0.80 in Session 2 without them). Judges discussed ratings during the sessions, and all pairs are within one language. | Active — read in full 2026-10-29 (NOTE-1338) from the LREC-COLING 2024 PDF; worth reading as the first collection of human pragmatic-similarity ratings and for its account of what lowers agreement. The 0.45 the record cites is one session’s single-judge figure; the others are 0.72 and 0.66. |
| LIT-1813 v2 | Optimal Transport for structured data with application on graphs | Vayer, Chapel, Flamary, Tavenard & Courty (2019). Fused Gromov–Wasserstein compares two attributed graphs with one coupling whose cost mixes, with weight α, a Wasserstein term on node features and a Gromov–Wasserstein term on structure. It tends to W as α → 0 and to GW as α → 1, and for q = 1, interior α and distance-matrix structures it is a metric that vanishes exactly when a bijection preserves weights, features and structure (a 2^{q−1}-relaxed semi-metric for q > 1). A conditional-gradient solver reaches stationary points, and a block coordinate barycenter supports graph k-means. On graph classification it is competitive with kernels and graph CNNs, though the supplement’s Wasserstein-only scores match or beat it on several datasets. | Active — read in full 2026-10-29 (NOTE-1328), from arXiv v3; worth reading for the metric and interpolation theorems of fused Gromov–Wasserstein, from which it follows that anchors as features break exactly the structural symmetries that move them. |
| LIT-1814 v2 | Hierarchical Multi-Marginal Optimal Transport for Network Alignment | Zeng et al. (2024). HOT aligns several networks with one multi-marginal fused Gromov–Wasserstein coupling tensor. A fused GW barycenter first co-clusters the networks, and nodes are then aligned jointly within aligned clusters, with a cost from random-walk-with-restart scores relative to anchor node sets and a KL proximal point solver. Under square loss the joint objective at a tensor is the sum of the pairwise objectives at its marginals, so it is never below the sum of pairwise optima. On three-network benchmarks with 10% anchors, HOT beats 13 baselines in pairwise and whole-tuple hits and scales far better than a dense tensor; the ground truth is consistent by construction, and no ablation isolates joint fitting from the new cost and the clustering. | Active — read in full 2026-10-29 (NOTE-1334), from the arXiv v2; worth reading for the identity behind joint alignment, that a multi-marginal objective is the sum of pairwise objectives at its marginals, so joint fitting buys consistency at a measurable price; its experiments do not test whether that consistency costs true local distinctions. |
| LIT-1815 v2 | Structured Optimal Transport | Alvarez-Melis, Jaakkola & Jegelka (2017). Optimal transport whose cost is the Lovász extension of a submodular set function on source–target assignments, so that assignments made together, such as one labelled group sent to one region, can cost less than the sum of their parts. The problem stays convex and is a zero-sum game against cost matrices in the base polytope; it is ordinary OT when the set function is modular, and is solved by saddle-point mirror prox with Sinkhorn and base-polytope projections. The groups are supplied in advance. Single-run experiments on point matching, colour transfer, 100-sample digit adaptation and sentence similarity favour the structured couplings. | Active — read in full 2026-10-29 (NOTE-1324), from arXiv v1; worth reading as a convex way to make a transport cost depend on sets of assignments rather than single ones, and for its limits: the structure is supplied, only submodular interactions are tractable, and its own threshold cost is not submodular. |
| LIT-1816 v2 | xCOMET: Transparent Machine Translation Evaluation through Fine-grained Error Detection | Guerreiro et al. (2023; TACL 2024). xCOMET, an open learned metric for machine translation, predicts from one XLM-R encoder a sentence-level score and a severity tag for each token, with or without a reference or source, and folds an MQM score computed from its own error spans into its final score. On WMT22 expert MQM it reaches segment-level Kendall τ of 0.42–0.43 and span F1 of 0.27–0.28, at or above the open metrics and GPT-4 prompting of its time, and it would have won the WMT23 metrics task. Its spans and its score agree at Pearson 0.73–0.92, far above either’s agreement with experts. Trained with synthetic hallucinations, it flags most injected critical errors and ranks fully detached hallucinations low. | Active — read in full 2026-10-29 (NOTE-1341) from the TACL version of record, with the arXiv v1 preprint compared; worth reading as the reference description of a strong open MT metric and its limits: segment-level Kendall τ near 0.43 against expert MQM, span F1 near 0.28, and score and spans that agree with each other far better than with the experts. |
| LIT-1817 v2 | VakyArth: Evaluating Pragmatic Competence in LLMs across Indic Languages | Singh et al. (2026). 578 items written by four native speakers, one per language, in Hindi, Punjabi, Tamil and Malayalam, over deixis, speech acts, implicature, social pragmatics and coherence, as disjoint MCQ, NLI and translation sets. Five LLMs score higher on MCQ than NLI in every model–language pair, and when wrong they pick the literal reading 59.1% of the time against 33.3% by chance. On 416 model translations, COMET correlates with one native rater per language at r = 0.81, better than XCOMET or MetricX, though hand-picked inverted translations score highly. The finding that translation “does not track” pragmatic understanding compares different items, and no inter-rater agreement is given. | Active — read in full 2026-10-29 (NOTE-1345) from the Findings of EMNLP 2026 PDF, with the released items counted; worth reading for its native-authored, culturally specific pragmatic items in four Indic languages and its evidence that LLM errors lean literal. Its translation and inference tasks use different items, and no agreement between people is reported. |
| LIT-1818 v2 | Gromov-Wasserstein Alignment of Word Embedding Spaces | Alvarez-Melis & Jaakkola (2018). Casts unsupervised word translation as a Gromov–Wasserstein problem between the two languages’ within-language cosine-similarity matrices, solved by entropic projected gradient with no anchors, and reads the optimal coupling as the translation. It matches adversarial-plus-refinement methods on related languages trained on comparable Wikipedia corpora (P@1 72–82) at about 4% of their CPU time, and does markedly worse on English–Russian (45) and English–Finnish (18). The objective sees only within-space relations, so it is unchanged by a rotation of either space and cannot distinguish couplings that differ by a symmetry of the data. | Active — read in full 2026-10-29 (NOTE-1336); worth reading as the cleanest statement of correspondence recovered from within-space relations alone, and for what that costs: the objective cannot tell a correspondence from one composed with a symmetry of either space (THEORY-1133), which the paper does not say. |
| LIT-1819 v2 | On the Limitations of Unsupervised Bilingual Dictionary Induction | Søgaard, Ruder & Vulić (2018). Tests the adversarial unsupervised dictionary induction of Conneau et al. (2018) outside its reported conditions. It fails (P@1 ≈ 0) for English paired with Estonian or Finnish, also with a 1.7B-word Finnish corpus; across corpus domains, even for English–Spanish; and between a skip-gram and a CBOW space. A seed of identically spelled words does as well or better. A Laplacian-spectrum dissimilarity of 10-node nearest-neighbour graphs tracks success across eight pairs (|ρ| = 0.89; negative, since it is a dissimilarity), but is computed with the gold translations. About one seed in ten succeeds for Estonian, Finnish and Greek, so part of the failure is the optimiser. | Active — read in full 2026-10-29 (NOTE-1337); worth reading as the first systematic test of when unsupervised dictionary induction fails, and for its finding that whether two embedding spaces align depends on the corpus domain and the embedding algorithm as much as on the languages (THEORY-1145). The method tested is adversarial (Conneau et al. 2018), not GW. |
| LIT-1820 | Attention as Lattice Gauge Theory: Relations Interact Only Through Wilson Loops | Sarkar, Mukherjee & Sato (2026), ARXIV-2610.37656. If every entity’s coordinate frame may be rotated independently, so that relation transports Tᵢⱼ ∈ O(d) change as gᵢTᵢⱼgⱼ⁻¹, then relations with no cycle between them cannot interact (in the pure-gauge sector), a triangle’s only invariants are class functions of its holonomy, and an equivariant edge update has the form Ψ(H)Tᵢⱼ with Ψ conjugation-equivariant. An untrained instance on S4 synchronization with outliers gains 26–45 points over a single path by composition, and 0.6–7.8 more by Wilson-loop routing; it does not beat spectral synchronization. | Active — read in full 2026-10-29 (NOTE-1331), after the owner brought it to the exchange “Paper assessment” asking whether it is “on to something or if this is AI slop nonsense”. Worth keeping for its conditional theorem, which is sound and is QUESTION-130’s construction carried further, and for its measured caution about its own experiments. Its framing outruns both. |
| 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-1822 v2 | The Gromov–Wasserstein distance between networks and stable network invariants | Chowdhury & Mémoli (2019). Extends the Gromov–Wasserstein distance to measure networks: a Polish node set with a probability measure and any bounded, possibly asymmetric, edge-weight function. Proves it is a pseudometric whose zero set is weak isomorphism, so nodes with identical in- and out-weights can be merged or split freely. Gives in- and out-going versions of the first, second and third lower bounds and proves each equals a transport problem on the real line, so the third is computed in closed form. Adds sublevel size functions, stable in an interleaving sense, which raise the known lower bound between the circle and the 2-sphere to 0.17. Illustrates the third lower bound on simulated block-model networks and World Bank migration networks. | Active — read in full 2026-10-29 (NOTE-1330), from the arXiv v2; worth reading as the clean statement of what a Gromov–Wasserstein comparison of directed weighted networks can and cannot see: it is a pseudometric on any bounded weights, zero exactly at weak isomorphism, and its cheap invariants are lower bounds that can all vanish for networks apart. |
| LIT-1824 v2 | Tractable models of ecological assembly | Serván & Allesina (2021), Ecology Letters 24: 1029–1037. Represents assembly by rare, low-density, well-separated invasions as a directed graph on feasible sub-communities, and proves that sequential (bottom-up) and all-at-once (top-down) assembly reach the same end-points when the graph is acyclic and attractors are exactly the uninvadable sub-communities. For competitive Lotka–Volterra with A = D(v)BD(w), B symmetric with positive entries, MacArthur’s Lyapunov function orders the sub-communities, so both hold: with B positive definite there is one end-point, the sub-community of greatest total biomass when r = v, reachable by invasions without extinctions; with B indefinite there are several, and order of arrival matters. A consumer–resource model whose consumers can exclude resources can have cycles. | Active — read 2026-10-29 (NOTE-1422) in full, from its first author’s dissertation in the University of Chicago’s repository (chapter 3, appendix included); worth reading as the result that, for symmetric competitive Lotka–Volterra communities, MacArthur’s Lyapunov function orders every sub-community, so the assembly graph is acyclic, every feasible sub-community can be built by invasions without extinctions, and sequential and all-at-once assembly reach the same end-points. Read it knowing that the copy read is the dissertation chapter of August 2020, not the Ecology Letters version, which was not compared; that order-independence (a single end-point) needs the interaction matrix positive definite, and an indefinite one still has priority effects; and that the step from the Lyapunov function to acyclicity is asserted, not written out. |
| LIT-1831 v2 | Can Social Contact Reduce Prejudice and Discrimination? Evidence from a Field Experiment in Nigeria | Scacco & Warren (2018), APSR 112(3). 849 randomly sampled Christian and Muslim young men in Kaduna, Nigeria, were randomized to a sixteen-week computer course or a survey-only control, then to a mixed or single-religion class and to a same- or other-religion partner. Four to six weeks after it, no arm changed stated prejudice, but the course raised giving to everyone, and mixed classes discriminated less than single-religion classes in a dictator game (about 70% less) and a destruction game. Against the control, the single-religion classes discriminated more and the mixed classes about the same. | Active — read 2026-10-29 (NOTE-1418) in full, from the published version deposited by the WZB on EconStor (https://www.econstor.eu/bitstream/10419/194860/1/f-21548-full-text-Scacco-et_al-Contact-v3.pdf); worth reading as a randomized field test of intergroup contact in a conflict city that measured attitudes and behaviour separately and found that sixteen weeks of cooperative contact left stated prejudice unchanged while reducing discrimination in two incentivized games. Read it knowing that its behavioural measures are games played at home four to six weeks after the course, that the contact effect is mostly a rise in discrimination in the single-religion classes rather than a fall in the mixed ones, that the effect on unfamiliar out-group members holds only for Christians, and that its “pre-analysis plan” was registered in August 2015, after the endline survey, though before the authors had the outcome data. |
| 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-1836 v2 | Can we really reduce ethnic prejudice outside the lab? A meta-analysis of direct and indirect contact interventions | Lemmer & Wagner (2015), EJSP 45(2). 129 comparisons from 73 evaluations of contact programmes run in schools, universities and other field settings. In controlled designs, attitudes improve by g = 0.28 immediately (k = 79) and 0.23 one to twelve months later (k = 8). Direct and indirect programmes do not differ (0.29 against 0.23); among subtypes, extended contact through stories of cross-group friendship gives 0.42 (k = 8) and virtual contact 0.08, not significant. Effects are larger for majorities and reach the whole outgroup. No study measured behaviour. | Active — read 2026-10-29 (NOTE-1419) in full, from the authors’ accepted manuscript (“In press: European Journal of Social Psychology”) posted on bildung-diversity.ch (https://bildung-diversity.ch/fileadmin/dokumente/Can_We_Really_Reduce_Ethnic_Prejudice_Outside_the_Lab.pdf); worth reading as the meta-analysis of contact interventions run outside the laboratory, which separates direct (face-to-face) from indirect (extended and virtual) programmes and finds them about equally effective on ethnic attitudes. Read it knowing that the comparison of types is between studies, not within them; that “indirect” pools extended contact, which is reading or watching stories of cross-group friendship, with virtual contact, which is online interaction and showed no effect in the stronger designs; that every outcome is a self-reported attitude, since the authors found no behavioural studies to include; and that the copy is the manuscript, not the typeset article, whose tables were not compared with it. |
| LIT-1838 v2 | Radically open dialectical behaviour therapy for refractory depression: the RefraMED RCT | Lynch et al. (2018), Efficacy and Mechanism Evaluation 5(7). The full report of the RefraMED trial (250 adults, RO DBT plus usual care against usual care): 5.40 HRSD points better at 7 months, not significantly better at the 12-month primary end-point (2.15) or at 18 months, and not cost-effective (£220,000 per QALY). Its mechanism analysis, using randomised non-therapeutic features as instruments for sessions, alliance and skills, failed: the instruments were weak and the decomposition implausible. All eight serious adverse reactions were in the RO DBT arm, which the authors put down to unequal reporting. | Active — read 2026-10-29 (NOTE-1421) in full, from the NIHR Journals Library’s own PDF (open access); worth reading as the full report of the RefraMED trial and the only place its mechanism analysis is given: a trial that randomised RO DBT participants to three non-therapeutic features (therapy room, written feedback, mode of reimbursement) and to therapists, to serve as instruments for exposure, alliance and skills. The instruments were weak (Cragg–Donald statistics at most 1) and, by the authors’ own account, the instrumented estimates mean nothing. Read it knowing that the analysed mediators are sessions attended, alliance and DBT skills, not the flexibility and emotional-coping measures, that the mediators and the outcome are both at 7 months, that the unadjusted decompositions put the indirect effect several times the total with a direct effect of the opposite sign, that the planned analyses of temporal order were not reported, that its process-measure intervals are about half as wide as the BJP paper’s for the same differences, and that its adverse-event test (one-tailed Fisher, p < 0.01) does not reproduce from its own counts. |
| 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-1841 v2 | Abrego Garcia v. Noem, Order Granting Expedited Discovery (D. Md., ECF No. 79) | D. Md. (Xinis, J.), 15 April 2025. On remand from LIT-1606, the court had directed the government to “take all available steps to facilitate” Abrego Garcia’s return and to declare, from personal knowledge, where he was, what it had done and what it would do. Finding that it had disclosed nothing and “appear[s] to have done nothing”, the court reads “facilitate” by the dictionaries and by the government’s own record of facilitated returns, rejects its narrower reading (removing “domestic obstacles”), and grants fifteen interrogatories, fifteen document requests and four depositions, including into who authorizes the detention in CECOT. | Active — read 2026-10-29 (NOTE-1417) in full, from CourtListener’s RECAP copy of the filed order (https://storage.courtlistener.com/recap/gov.uscourts.mdd.578815/gov.uscourts.mdd.578815.79.0.pdf); worth reading as the district court’s first reasoned answer, on remand from the Supreme Court’s order of 10 April 2025, to the government’s account of what it could do: it fixes “facilitate” as taking the steps available toward release from El Salvador’s custody, measures it against the government’s own past practice of facilitated returns, finds that the government has shown no step at all, and opens discovery into what was done, what will be done and who authorizes the detention. Read it knowing that it is an eight-page discovery order, not a ruling on contempt or on whether return was possible; that its facts are the record of four days; and that what the discovery produced, and everything after it on the docket, is not read here. |
| 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-1844 | Identifying the Underlying Mechanisms of Change During Acceptance and Commitment Therapy (ACT): A Systematic Review of Contemporary Mediation Studies | Stockton, Kellett, Berrios, Sirois, Wilkinson & Miles (2019). A systematic review of twelve mediation studies, 2006–2015, of ACT against an active treatment. Psychological flexibility mediated mental-health outcomes in four of five studies, and acceptance was the one process that mediated across kinds of outcome and more for ACT than for the comparison. Defusion and committed action mediated without being specific to ACT. Present-moment contact and values were tested once each, and the self as context never. All studies were of moderate quality, almost all underpowered or silent on power, mostly self-report, and only three showed the mediator changing first. | Active — read 2026-10-30 (NOTE-1456) from the accepted manuscript on White Rose Research Online (https://eprints.whiterose.ac.uk/id/eprint/137915/, CC BY-NC-ND), whose deposit lacks the tables, figures and quality appendix; worth reading as the systematic review of ACT mediation studies from 2006 to 2015 that updates Hayes et al. 2006 (LIT-555), and as a record that no study in that period tested the self as context. Read it knowing that it is narrative, with no pooled estimate, that all twelve studies were rated of moderate quality, and that only three established that the mediator changed before the outcome. |
| LIT-1845 | Translation and Relevance | Gutt (1989), PhD thesis, University College London. Translation needs no theory of its own: it is interlingual interpretive use under Sperber and Wilson’s relevance theory. Two utterances interpretively resemble each other to the degree that the explicatures and implicatures each conveys in its own cognitive environment overlap, and a translation is faithful when it resembles the original closely enough in the respects that make it adequately relevant to its audience, at no gratuitous processing cost. Direct translation, which preserves the original’s communicative clues, is the limiting case: complete interpretive resemblance in the cognitive environment the original envisaged. The precursor of the 1991 book (LIT-784). | Active — skimmed 2026-10-30 (NOTE-1435) from the UCL Discovery eprint (discovery.ucl.ac.uk/1317504/1/241978.pdf, 309 pp., OCR text layer): the abstract, preface and contents, the critique of functional equivalence (pp. 22–27), the relevance-theoretic chapter’s account of interpretive resemblance (pp. 50–76), the critique of dynamic equivalence (pp. 118–130), all of chapter 5 on faithfulness as optimal resemblance (pp. 160–193), all of chapter 6 on communicative clues (pp. 194–248) and the opening of chapter 7 with its definition of direct translation (pp. 249–257). The rest is unread. Worth reading as the thesis that became Translation and Relevance (LIT-784), and as the only reading of Gutt’s account the record holds. On it, two utterances interpretively resemble each other to the degree that the assumptions each communicates in its own cognitive environment overlap, so resemblance is judged by what is communicated, not by wording or propositional form. A translation is faithful when it resembles the original closely enough in the respects that make it relevant to its audience. Direct translation is the limiting case, complete interpretive resemblance in the context the original envisaged. Read it as the 1989 thesis, not the book: what the book changed is unread. |
| LIT-1846 | Experimental reductions of delay discounting and impulsive choice: A systematic review and meta-analysis | Rung & Madden (2018). A systematic review and category-wise meta-analysis of 92 papers that tried to reduce delay discounting or impulsive choice by non-pharmacological means, in humans and animals. Most kinds of manipulation reduced discounting (Q(9) = 224.68, I² = 64%). Learning-based procedures such as bundling and delay fading gave the largest and longest-lasting effects. Framing and priming moved one-off choices. Clinical interventions moved discounting little: mindfulness and ACT (two studies) only at trend level, g = 0.32, p = .06. Formal mediation analyses were rare, so how any of these manipulations works is largely unknown. | Active — read in part 2026-10-30 (NOTE-1440, Skimmed) from the NIH author manuscript in PubMed Central (PMC6112163, NIHMS963171), fetched as PMC XML through NCBI’s E-utilities after the PMC web page put up a reCAPTCHA; worth reading as the systematic review and meta-analysis of 92 papers on reducing delay discounting by non-drug manipulations, and for its finding that mindfulness and ACT moved discounting only at trend level. Read it knowing that effect sizes are pooled only within categories, that publication bias was not assessed, and that its search ended on 1 March 2016. |
| LIT-1847 | Lecture 4: Statistical decision theory: model distance and equivalence | Han (2021), Stanford EE378C lecture notes, Lecture 4. Defines Le Cam’s deficiency through decision problems: M is ε-deficient relative to N if for every finite parameter subset, finite action set, loss with values in [0, 1] and rule for N, some rule for M has risk at most ε more at every parameter. States that this holds exactly when a stochastic kernel K has sup_θ ‖Q_θ − K P_θ‖_TV ≤ ε, proves the easy direction, and sketches the converse for finite Θ by a minimax swap. Defines Le Cam’s distance as the larger of the two deficiencies, and illustrates it with sufficiency (distance zero exactly for a sufficient statistic), Poissonization and the equivalence of nonparametric regression, white noise and density estimation. | Active — read 2026-10-30 (NOTE-1426) in full, all 26 slides with their handwritten annotations, from the course’s own copy at web.stanford.edu/class/ee378c/lecture4_annotated.pdf. Worth reading as a compact statement of Le Cam’s deficiency for decision problems with [0, 1]-valued losses and of the randomization criterion: a model is ε-deficient relative to another exactly when some stochastic kernel brings it within ε of the other in total variation, uniformly in θ. Read it knowing that only the easy direction (a kernel within ε bounds every risk gap by ε) is proved line by line; the converse is sketched for a finite parameter set by one inf–sup swap, with the minimax theorem’s conditions and the finiteness of the observation spaces left unstated, and the passage to an infinite parameter set is not given. |
| LIT-1848 | Sparse Distributed Memory: Principles and Operation | Flynn, Kanerva & Bhadkamkar (1989), RIACS TR 89.53 / Stanford CSL-TR-89-400. A non-mathematical account of sparse distributed memory and the design of a Stanford prototype (256-bit words, 8,192 hard locations, up to 16 folds, 50 reads or writes a second). A word is written to every hard location within a Hamming radius of its address and read by summing and thresholding the counters of the locations near a cue. Used autoassociatively, a cue within a critical distance of a stored pattern converges on it in about ten iterated reads; beyond it the reads wander and may settle on another pattern. The critical distance falls as the memory fills and, in a sparsely filled memory, is below the sum of the write and read radii. The mathematics is referred to Kanerva’s book. | Active — read 2026-10-30 (NOTE-1454), Skimmed: chapter 1 in full (pp. 1–28) and chapters 2–3 looked over, from NASA’s public-domain NTRS copy (ntrs.nasa.gov/api/citations/19920001076/downloads/19920001076.pdf, 60 scanned pages with an OCR text layer). Worth reading as a short, first-hand statement by Kanerva and two co-authors of what SDM’s critical distance is: a cue closer than it is pulled toward the stored pattern by iterated reads; one farther away “will not converge” and wanders, possibly into another pattern’s attracting zone; the distance shrinks as the memory fills; and in an autoassociative memory the two outcomes are “easy to distinguish in practice”. Read it knowing that the critical distance is asserted, not derived (the derivation is referred to Kanerva’s book, LIT-928, still unread), that no simulation data are given for the convergence figures, and that most of the report describes the Stanford hardware prototype. |
| LIT-1850 | Commitments and Speech Acts | Harnish (2005), Philosophica 75:11–41. Speech-act theories add either rules and conventions (Austinian) or expressed attitudes (Gricean) to the utterance. On the Gricean theory of Bach and Harnish, a communicative illocutionary act is individuated by the attitude the speaker expresses, where expressing is reflexively intending the hearer to take the utterance as reason to think the speaker has it. Institutional acts are set apart. Against the normative theories of Searle and Alston, Harnish finds no account of how commitment is created and rejects Alston’s rule-subjection analysis. He argues that expressing the belief that P and taking responsibility for P may coincide, so normative theorists must find other grounds to prefer their theories. | Active — read in full 2026-10-30 (NOTE-1453) from the journal’s own open-access PDF (philosophica.ugent.be/article/82209/galley/202023/download/, 31 pp.). Worth reading as Harnish’s own account of the expressed-attitude theory of Bach and Harnish (1979, LIT-1040, unread), the record’s nearest first-hand text of it. On that theory communicative illocutionary acts are individuated by the attitude the speaker expresses: the speaker reflexively intends the hearer to take the utterance as reason to think the speaker has that attitude. Communication succeeds when the hearer recognizes it. Conventional, institutional acts are a separate category. Harnish weighs it against the normative theories of Searle and Alston, on which an act is individuated by the commitment or responsibility the speaker takes on. He finds Searle’s account of how commitment is created unexplained and Alston’s rule-subjection analysis false. He argues that expressing a belief that P and taking responsibility for P may be equivalent, so the normative theory may describe the same facts. Teasing, reproach and the audience’s standing are not discussed. |
| 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-1852 | The Nature of Epistemic Injustice | Maitra (2010), Philosophical Books 51(4), a critical study of Fricker’s Epistemic Injustice. It reports the book’s definitions with its pages: testimonial injustice is a credibility deficit owed to the hearer’s identity prejudice (pp. 19, 28, 35), and hermeneutical injustice is having a significant area of one’s social experience obscured from collective understanding by hermeneutical marginalization, systematic or incidental (pp. 153, 155, 158). It argues the testimonial account is too broad, since a hearer owes a speaker a matched credibility judgement only in some relationships, and too narrow, since epistemic bad luck and stereotypes held through careless evidence-gathering can also wrong a speaker; and that both kinds of injustice mix individual and structural prejudice. | Active — read 2026-10-30 (NOTE-1428) in full, from the author’s draft of 14 July 2010 on her University of Michigan page (https://public.websites.umich.edu/~imaitra/Research/NEI0710.pdf), which the owner ruled a lawful copy on 2026-10-30. The draft is marked “Draft – Please do not cite without author’s permission”, so the record cites the published version (Philosophical Books 51(4), 195–211) and treats the draft only as the copy read. Worth reading as a secondary report of Fricker’s Epistemic Injustice (LIT-1004, unread), with page references to the book for its definitions and central cases, and as an argument that testimonial injustice needs a hearer’s obligation to the speaker and can occur without individual identity prejudice. |
| LIT-1853 | Investigating the “Flow” Experience: Key Conceptual and Operational Issues | Abuhamdeh (2020), Frontiers in Psychology 11:158. Across 42 recent studies flow was operationalized in 24 ways: mostly as a continuous score, 17 times without enjoyment, and often mixed with its proposed conditions. He argues flow should be measured as Csikszentmihalyi defined it, a discrete, highly enjoyable optimal state distinct from its conditions, and that lesser absorption is task involvement, which is not inherently enjoyable. He rejects the view that flow is emotionless. | Active — read in full 2026-10-30 (NOTE-1429), from the open-access published article (CC BY) in PubMed Central, PMC7033418, fetched as XML through the Europe PMC REST API. A conceptual review: 42 studies from 2014–2019 operationalized flow in 24 ways, 17 of them without enjoyment. Abuhamdeh argues that flow, as Csikszentmihalyi defined it, is a discrete and highly enjoyable state, distinct from its conditions, and that ordinary absorption is task involvement, “not inherently enjoyable”. It reports the dispute the record needs: Seligman’s “absence of emotion” in flow, and Csikszentmihalyi’s own remark that flow experiences may not be “particularly pleasurable at the time”. It answers them by definition and by appraisal theory, not with data on how flow feels during the episode. |
| LIT-1854 | Positive affect as informational feedback in goal pursuit | Orehek, Bessarabova, Chen & Kruglanski (2011), Motivation and Emotion 35(1):44–51. After promising to do something for someone close, students shown positive rather than neutral pictures had a less active goal (slower lexical decision on its word; weaker stated intentions) when competing goals had been made salient, and a more active one when they had not (n = 76 and 78). Positive affect is read as information that can signal either progress or commitment, and competing goals decide which. | Active — read in full 2026-10-30 (NOTE-1450), from the open-access published article (CC BY-NC) in PubMed Central, PMC3045658, fetched as XML through the Europe PMC REST API. Two laboratory experiments (n = 76, 78) in which students promised to do something for someone close to them, then saw positive or neutral pictures. With competing goals made salient, positive affect slowed recognition of the goal word and weakened stated intentions; with none, it sped recognition and strengthened intentions. The affect was incidental, induced by pictures and not by progress, and goal activation in Experiment 1 rests on one reaction time per person. For the record, positive affect lowers a goal’s priority only when another goal competes for it, and raises it otherwise. |
| LIT-1856 | 24.120 Moral Psychology, XIX: Identification | Holton (2009), MIT OCW 24.120 lecture handout XIX. On Frankfurt’s “Identification and Wholeheartedness”: identification is acceptance, not endorsement; it is now a decision, not a higher-order desire. Two cases are run together: deciding that no further checking is warranted, whose “resonance” Frankfurt seems to require (pp. 168–169), and deciding between conflicting desires, which makes the loser an “outlaw” (p. 170). Frankfurt gives no analysis of the decision, which “looks more like Bratman’s” model, and nothing guarantees that deciding makes one wholehearted, since pairwise decisions can be intransitive. Then “The Faintest Passion” and Scanlon, briefly. | Active — read 2026-10-30 (NOTE-1455) in full, from MIT OpenCourseWare’s copy of the handout (https://ocw.mit.edu/courses/24-120-moral-psychology-spring-2009/7084f5f927420e445327e4c1fdecfc30_MIT24_120s09_lec19.pdf), a course page under ADR-064. Worth reading as a two-page secondary report of Frankfurt’s “Identification and Wholeheartedness” (LIT-575, unread), with page references that fall within the 1988 reprint (pp. 159–176; the handout does not name the edition) for decisive identification, its “resonance” and the “outlaw” desire, and as a teacher’s objections: Frankfurt gives no analysis of the decision, and a decision need not make one wholehearted. Read it knowing that it is lecture notes, questions as much as claims. |
| LIT-1857 | Exposing Pluralistic Ignorance to Reduce Alcohol Use Among College Students | Schroeder & Prentice (1998). Princeton first-year students took part in either a peer-oriented discussion that exposed pluralistic ignorance about drinking or an individual-oriented discussion of responsible decisions. Four to six months later the peer-oriented group reported fewer drinks a week (3.10 against 5.05; p = .05). Their estimates of the average student’s comfort with drinking did not differ by condition. What differed was that, in the control condition, students high in fear of negative evaluation drank above average whatever they thought of peers. The authors infer that exposure weakened the norm’s prescriptive force without changing what it prescribed. Men closed the gap between their own and the average student’s comfort, but by revising their estimate of others, not their own attitude, the reverse of Prentice and Miller’s 1993 finding. | Active — read in full 2026-10-30 (NOTE-1439) from the published article as downloaded from Wiley and posted on Stanford SPARQ’s site (https://sparq.stanford.edu/sites/g/files/sbiybj19021/files/media/file/schroeder_prentice_1998_-_exposing_pluralistic_ignorance.pdf); worth reading as the field test of exposing pluralistic ignorance, and as the nearest read source for Prentice and Miller 1993 (LIT-1370), which it restates and in part fails to replicate. Read it knowing that drinking is self-reported, that the comparison is between two discussion formats with no untreated control, that 143 of 452 students were followed up, and that the main effect is p = .05. |
| LIT-1859 | On Experiments | van Rooyen (arXiv 2025). Experiments are Markov transitions from a finite set of unknowns to a finite observation set. A general data processing theorem: any risk minimised over the strategies an experiment allows is monotone under garbling. Blackwell–Sherman–Stein follows. With a prior π fixed, the directed deficiency ξ^π(e, e′) is the least, over garblings f, of the π-average total variation between f∘e and e′; Theorem 26 (Le Cam’s randomization theorem) says ξ^π ≤ ε exactly when e’s minimum Bayes risk is within ε‖L‖∞ of e′‘s for every action set and loss. The symmetrised deficiency is a metric for a prior of full support, and ξ^π is a linear programme. | Active — read 2026-10-30 (NOTE-1430), Skimmed: §§1–3 and 5–8 in full, with Theorem 26 and its proof checked line by line, from arXiv’s v2 (13 October 2025, 23 pages); §4, on representing loss functions, was not read. Worth reading as a short, self-contained proof of Le Cam’s randomization theorem for finite experiments against a fixed prior, after Torgersen: the least prior-averaged total variation between a garbling of e and e′ is at most ε exactly when e’s minimum Bayes risk exceeds e′‘s by at most ε‖L‖∞ for every action set and loss. Read it knowing that the result is for one prior, not uniform in the unknown; that its reverse implication, and so the theorem as stated for every loss, loses a factor of 2 for losses that take both signs (it holds for losses in [0, 1]); that the saddle point it invokes is more than Sion’s theorem gives, though the proof needs only the minimising rule; and that Lemma 30’s linear programme computes twice the directed deficiency. |
| LIT-1860 | Pushing and Coasting in Dynamic Goal Pursuit: Coasting Is Attenuated in Bipolar Disorder | Fulford, Johnson, Llabre & Carver (2010), Psychological Science 21(7):1021–1027. In 21 days of experience sampling on three self-chosen goals (n = 24), progress beyond what was expected was followed by less effort on that goal and progress short of it by more. People with bipolar I disorder in remission coasted less than controls. The paper states Carver’s (2003) view that positive affect lets a goal take lower priority, but measured no affect and no shift to other goals. | Active — read in full 2026-10-30 (NOTE-1442), from a JSTOR download of the published article posted on a Boston University research group’s page (https://sites.bu.edu/amplab/files/2024/06/Goal-pursuit.pdf), a copy that counts under ADR-064. An experience-sampling study of 24 people, 12 with bipolar I disorder in remission, rating effort, progress and expected progress on three of their own goals three times a day for 21 days. Progress beyond expectation was followed by less effort on that goal (coasting) and progress short of it by more (pushing); the BD group coasted significantly less. Affect was not measured: the paper restates Carver 2003 (LIT-1445) that positive affect lets a goal take lower priority, and tests only the progress-to-effort link it predicts. |
| LIT-1861 | Can populations be healthy? Perspectives from Georges Canguilhem and Geoffrey Rose | Giroux (2021), HPLS 43:111. Canguilhem held that health and disease apply only to individuals taken as organic totalities, because normativity, the capacity to institute new norms, is anchored in the organism; at the population level he preferred “hygiene” or “salubrity”. Giroux argues that debates over units of selection and biological individuality loosen his link between individuality and organism, and that social epidemiology (Rose’s causes of incidence, integral variables such as herd immunity and social capital, multilevel models) gives reasons for a concept of population health not reducible to individual health, while denying populations the ontological unity of an organism. | Active — read in full 2026-10-30 (NOTE-1452), from the published article in PubMed Central (PMC8527978; made available in the PMC Open Access Subset under Springer Nature’s COVID-19 terms), fetched as XML through the Europe PMC REST API. Worth reading for two things. It argues, from social epidemiology (Rose’s population causes, herd immunity, integral variables), that some health properties belong to populations and not to their members, against Canguilhem’s restriction of health to the individual organism. And it quotes Canguilhem’s definition of health as normativity in his own (translated) words: “the possibility of tolerating infractions of the habitual norm and instituting new norms in new situations” (The Normal and the Pathological, 1991, pp. 196–197). The Canguilhem it reports is at second hand. |
| LIT-1863 | Translating as a purposeful activity: a prospective approach | Nord (2005), TradTerm 11:15–28. A short statement of functionalist translation. Since a text is an offer of information that different receivers take differently, the translator works prospectively, toward the purpose the translation is to serve for a target audience under the brief. Communicative purposes are phatic, referential, expressive and appellative. Where target-culture conditions differ, each function is either adapted so it works (instrumental translation) or turned into a meta-function that explains how it worked (documentary translation), and the brief, not a general preference, decides which. | Active — read in full 2026-10-30 (NOTE-1448) from the publisher’s open-access PDF on the TradTerm site (periodicos.usp.br/tradterm/article/download/49673/53784/61052, 14 pp.). Worth reading as Nord’s own short statement of functionalist translation, the record’s only reading of the functional account while her book (LIT-829) is unread. A text is an offer of information, which different receivers take differently, so the translator works prospectively, toward the purpose the translation is to serve for a particular target audience as the brief specifies. Nord sorts communicative purposes into phatic, referential, expressive and appellative functions. Where target-culture conditions differ, the translator either adapts the text so that the function works (instrumental translation) or turns it into a meta-function that tells the audience how the original worked (documentary translation). Neither is better in general: the brief decides. Equivalence is often “not required or not even desired”. |
| LIT-1864 | Principles of Correspondence | Nida (1964), “Principles of Correspondence”, abridged in Venuti (ed.), The Translation Studies Reader, 2nd ed. (2004), pp. 126–140. There is no exact translation, only closest equivalents, and there are two orientations. Formal equivalence reproduces the message’s form and content, as in a gloss translation with notes. Dynamic equivalence, “the closest natural equivalent to the source-language message”, aims at a receptor–message relationship “substantially the same” as the original receptors had, and so at a similar response. It must still reflect the source’s meaning and intent, and meaning comes before style. Its example is Phillips’s handshake for the “holy kiss” of Romans 16:16. | Active — read in full 2026-10-30 (NOTE-1451) from a course-reading PDF of the reprint (newuniversityinexileconsortium.org, “Week-6-Dynamic-equivalence-and-formal-equivalence-Nida-1964-in-Venuti-2004-1.pdf”, 15 pp., Reader pp. 126–140). Worth reading as the record’s only first-hand text of Nida’s two orientations, while Toward a Science of Translating (LIT-791), whose chapter this abridges, is unread. Formal equivalence matches the message in form and content. Dynamic equivalence aims at “the principle of equivalent effect”: “the relationship between receptor and message should be substantially the same as that which existed between the original receptors and the message”. Nida’s example is Phillips’s “hearty handshake all around” for Romans 16:16’s “holy kiss”. A dynamic-equivalence translation is “the closest natural equivalent to the source-language message”. It must still “clearly reflect the meaning and intent of the source”, and meaning takes priority over style. Read it as an abridgement whose cuts are not marked. |
| 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-1866 | Potential Games | Apt (2013), lecture slides, CWI. Best-response dynamics; exact, ordinal and generalized ordinal potentials after Monderer and Shapley (1996); the finite improvement property (every improvement path is finite); the theorem, credited to Monderer and Shapley, that a finite game has a generalized ordinal potential if and only if it has the FIP, proved one way and sketched the other by counting the improvement sequences that end at each profile; a game with the FIP and no ordinal potential; Rosenthal’s theorem that congestion games are potential games; the Braess paradox; and price-of-stability bounds. | Active — read 2026-10-30 (NOTE-1427) in full, all 47 slides, from the author’s course page at CWI (homepages.cwi.nl/~apt/stra13/potential13-sli.pdf). Worth reading as a clear secondary statement of the potential-game definitions and of Monderer and Shapley’s theorem that a finite game has a generalized ordinal potential exactly when it has the finite improvement property, with a two-by-two game that has the property but no ordinal potential. Read it knowing that it is lecture slides: the theorem is attributed to “Monderer and Shapley ‘96” with no lemma number or page, and the converse is a sketch. |
| LIT-1867 | Source Incompatibilism and Its Alternatives | Timpe (2007), American Philosophical Quarterly 44(2), 143–155. The received taxonomy splits incompatibilists into leeway (alternative possibilities matter most) and source (ultimacy matters most). No leeway incompatibilist can rest on mere alternatives, which raise the luck objection, so every acceptable incompatibilism appeals to ultimacy. And ultimacy requires that the agent not be causally determined by anything outside her, which entails more than one open future and so some alternative possibility, however weak. So the best source incompatibilism is “wide”, holding a weak alternative-possibilities condition entailed by ultimacy, and the taxonomy should be rejected. | Active — read 2026-10-30 (NOTE-1459) in full, from the author’s upload of the published pages (https://kevin-timpe.publicplatform.net/wp-content/uploads/sites/26/2018/12/source.pdf), an author’s upload under ADR-064. Worth reading as the argument that the best source incompatibilism is “wide”: ultimacy requires indeterminism, indeterminism leaves some alternative, so an alternative-possibilities condition is entailed by the ultimacy condition, and the dichotomy between leeway and source incompatibilism should be dropped. Read it knowing that the entailed alternatives may be non-robust and do no explanatory work, and that it quotes Pereboom’s book (LIT-1006, unread) at three places only. |
| LIT-1868 | The Frankfurt Cases: The Moral of the Stories | Fischer (2010), Philosophical Review 119(3). The moral of the Frankfurt cases is that if causal determinism rules out moral responsibility, it is not in virtue of eliminating alternative possibilities. Against the Dilemma Defense: on the indeterministic horn, buffer cases (Hunt, Pereboom) remove every robust alternative; on the deterministic horn, assume determinism without assuming it removes alternatives, and determinism plus Black’s counterfactual device together remove them, so Black does not “drop out”, and the argument runs unchanged even granting that determinism removes alternatives. Widerker’s requirement that the case satisfy IRR is rejected. Fischer allows that determinism may still undermine responsibility by another route, such as sourcehood. | Active — read 2026-10-30 (NOTE-1457) in full, from the published PDF on andrewmbailey.com (https://andrewmbailey.com/jmf/Frankfurt_Cases_Moral_of_the_Stories.pdf), which the owner ruled a lawful copy on 2026-10-30. Worth reading as Fischer’s reply to the Dilemma Defense: a deterministic Frankfurt case in which determinism and Black’s device together, and neither alone, rule out alternatives, giving the conclusion that if determinism rules out responsibility it is not by eliminating alternative possibilities. Read it knowing that Fischer concedes causal determination may still matter, for instance by removing “sourcehood”, and that Pereboom’s buffer cases and Widerker’s dilemma are reported, not argued in full. |
| LIT-1869 | Nature’s Queer Performativity | Barad (2012), Kvinder, Køn & Forskning 1–2:25–53, the authorized version of an essay first printed in Qui Parle (2011). It argues that identity, causality, space and time are performed, not given, in nature as well as culture. Lightning, stingray receptor cells, the dinoflagellate Pfiesteria and atoms are offered as “queer critters” whose behaviour a classical ontology of separate, determinate things cannot account for. Her agential realism replaces things with phenomena: an intra-action enacts an agential cut, “a ‘local’ resolution within the phenomenon of the inherent ontological indeterminacy”, which yields agential separability, not absolute separation. The ethical upshot: there are no acts “against nature”, only acts of nature, and accountability is for the cuts that are made. | Active — read in full 2026-10-30 (NOTE-1458), from the journal’s own PDF of the article (CC BY-NC) on tidsskrift.dk (tidsskrift.dk/KKF/article/download/28067/24695/65067), text extracted with pdftotext. This is the version Barad calls authorized; an earlier Qui Parle printing (2011) is, by her note 15, not the version she submitted. Worth reading as the record’s first text of Barad’s own: it states the agential cut in her words, as a local resolution, enacted by an intra-action within a phenomenon, of an inherent ontological indeterminacy, against the Cartesian cut as an inherent distinction. It is an essay, not an argument from data: its physics is the Bohr model and the which-path and quantum-eraser experiments as she reads them, and its other cases come from Kirby and Schrader. |
| LIT-1870 | Altering Impulsive Decision Making With an Acceptance-Based Procedure | Morrison, Madden, Odum, Friedel & Twohig (2014). Thirty undergraduates selected for steep discounting were randomized to one 60–90 minute acceptance-and-values session or a one-week waitlist. Discounting of hypothetical money fell more in the trained group (AUC 0.26 to 0.44, against 0.22 to 0.25; interaction p = .04). The AAQ-II and distress tolerance did not change relative to control. Pooling both groups’ pre- and post-training scores, discounting (d = .57) and distress tolerance improved and the AAQ-II only approached significance. The waitlist group’s own change in discounting after training was not significant. | Active — read in full 2026-10-30 (NOTE-1425) from the NIH author manuscript in PubMed Central (PMC5661961, NIHMS906394), fetched as PMC XML through NCBI’s E-utilities after the PMC web page put up a reCAPTCHA; worth reading as the first test of an acceptance-based intervention on delay discounting, in which discounting moved while the AAQ-II, the ACT process measure, did not. Read it knowing that it is a pilot of 30 students against a waitlist, that the waitlist group’s own pre–post change in discounting was not significant, and that a Hawthorne effect is the authors’ first limitation. |
| LIT-1871 | Why are dreams interesting for philosophers? The example of minimal phenomenal selfhood, plus an agenda for future research | Metzinger (2013), Frontiers in Psychology 4:746. Minimal phenomenal selfhood (MPS), defined by Blanke and Metzinger (2009) as global identification with the body, self-location and a weak first-person perspective, may reduce to transparent spatiotemporal self-location: reports of bodiless dreams and asomatic out-of-body experiences describe a stable self located at an extensionless point, with no body. The paper proposes a phenomenal “unit of identification”, an “epistemic agent model” for the knowing self, and a research agenda for dream science, including the test case of phenomenally opaque self-location. No new data. | Active — read in full 2026-10-30 (NOTE-1434), from the publisher’s open-access PDF (frontiersin.org/articles/10.3389/fpsyg.2013.00746/pdf; also PMC3813926), text extracted with pdftotext. Worth reading as Metzinger’s own later statement of minimal phenomenal selfhood: he proposes reducing it to “transparent self-location in a spatiotemporal frame of reference”, on the evidence of bodiless dreams and asomatic out-of-body reports, and names, as an open research question, whether any case of phenomenally opaque self-location exists. It is a metatheoretical agenda: it reports survey figures from others and offers no new data, and the decisive case it asks for is not reported. |
| LIT-1872 | The Appraisal Basis of Anger: Specificity, Necessity, and Sufficiency of Components | Kuppens, Van Mechelen, Smits & De Boeck (2003), Emotion 3:254–269. In two studies people recalled unpleasant situations in which goal obstacle, other accountability, unfairness, control or an antagonistic action tendency was present or absent, and rated or named their emotions. Anger was associated with other accountability (specific to anger) and unfairness, but none of the components was singly necessary or sufficient for it: people were angry without each, and had each without anger. The authors propose a contingent association, with anger needing at least one of the components; no causal claim is made. | Active — read in full 2026-10-30 (NOTE-1423), from the published PDF deposited in KU Leuven’s repository Lirias (lirias.kuleuven.be/retrieve/96184). Two recall studies (110 school students, 100 university students) in which people described unpleasant situations where an appraisal or action tendency was present, or absent, and rated their emotions. Anger went with other accountability and unfairness, but no appraisal, nor the antagonistic action tendency, was singly necessary or sufficient for it; every anger report in study 2 had at least one of the components. The authors conclude for a “contingent association”. The design manipulates which memories are recalled and measures by self-report, and the authors make no causal claim. |
| 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-1875 | Collective Intentions and Collective Intentionality | Zaibert (2003), American Journal of Economics and Sociology 62(1). Searle’s social ontology needs we-intentions, but “Collective Intentions and Actions” (1990) gives none: of its four analyses of the hollandaise case, the two that are collective Searle rejects, the individualist one he rejects only because it allows no collective intentionality, and the one he favours is a complex individual by-means-of intention, which is “complex”, not “collective”. Searle there concedes he has “not demonstrated” that a reduction to individual intentions must fail. Since intentions, unlike desires, have only actions as their conditions of satisfaction, Zaibert holds that groups cannot have irreducible we-intentions, and suggests collective desires instead. | Active — read 2026-10-30 (NOTE-1431) in full, from the published PDF on the author’s faculty page at Union College (https://minerva.union.edu/zaibertl/zaibert%20on%20searle%20and%20collective%20intentions.pdf); worth reading as a secondary report of Searle’s unread “Collective Intentions and Actions” (LIT-490), which it quotes page by page (CIA 401–412), and as the argument that the paper gives no analysis of we-intentions: its favoured form is a complex individual by-means-of intention, and Searle concedes he has not shown that reduction to individual intentions fails. Read it knowing that it is a critic’s report, not the paper, and that its own positive suggestion, collective desires in place of collective intentions, is one paragraph. |
| LIT-1876 | Reasoning in Life: Values and Normativity in Georges Canguilhem | Vissio (2020), Int J Semiot Law 33:1019–1031. Canguilhem’s vitalism is neither metaphysical nor structural–functional but “attitudinal”: life is a normative activity of evaluating a milieu. To be sick is not to lack norms but to be reduced in the capacity to change them; “normativity” is that capacity. Social norms differ in kind from vital ones (they are “to be invented and not observed”), so there is no social pathology, yet human reason and science are answers to a vital exigency. Proposed as a ground for a semiotics of values. | Active — read in full 2026-10-30 (NOTE-1447), from the open-access published article (CC BY 4.0) in PubMed Central, PMC7678399, fetched as XML through the Europe PMC REST API. A short exposition of Canguilhem’s philosophy of norms as an “attitudinal” vitalism. Worth reading for its account of normativity in his words: the sick organism is “confined and reduced in its capacity to change” its norms, and “normativity” is the name for “this ability or capacity to redefine vital norms”, with quotations from The Normal and the Pathological. It also reports his argument that social norms differ in kind from vital ones, so that there is no social pathology. Canguilhem at second hand; no argument of Vissio’s own beyond the reading. |
| LIT-1877 | Rationality as the Normative Dimension of Speech Acts | Berdini (2012), Phenomenology and Mind 2. Against Searle’s view that the deontology of speech acts flows from constitutive rules, it argues with Bach and Harnish that rules and meaning cannot fix which illocutionary act is performed, and adopts their inferential model, in which the hearer infers the speaker’s expressed attitude from what is said, mutual contextual beliefs and shared presumptions. It proposes that the presumption of the interlocutor’s rationality is the basic normativity of communication. It quotes Bach and Harnish (1979, p. 124) that illocutionary acts at best create mutual beliefs about rights and obligations. A short proposal, not an argued theory. | Active — read in full 2026-10-30 (NOTE-1445) from the publisher’s open-access PDF on Firenze University Press’s journal site (oaj.fupress.net/index.php/pam/article/download/7083/7063/7008, 8 pp.), reached through the DOI. Worth reading for one sentence the record wanted: its quotation of Bach and Harnish (1979, p. 124, LIT-1040, unread) that whether illocutionary acts create a deontology is “a moral question”, and that “at best they create mutual beliefs between speaker and hearer about rights and obligations”. The paper itself is a short programmatic piece. Against Searle’s rule-based account of the deontology of speech acts, it adopts Bach and Harnish’s inferential model, and proposes that the presumption of the interlocutor’s rationality is the basic, “ultra-minimalist” normativity from which commitments and obligations might be built. It calls itself a “quessertion” and argues no further. |
| LIT-1878 | On the mechanics of goal striving: Experimental evidence of coasting and shifting | Thürmer, Scheier & Carver (2019 online; Motivation Science 6(3):266–274, 2020). In a lexical decision task with a speed goal and an accuracy goal, false feedback that one goal was ahead of target lowered later performance on it (coasting) and raised it on the other (shifting), in 151 online workers and 222 students. Overshoot feedback left mood higher than undershoot feedback, and an if-then plan to ignore one’s feelings removed both effects. Small effects, one-tailed planned contrasts, and no manipulation check on the plan. | Active — read in full 2026-10-30 (NOTE-1438), from the NIH author manuscript in PubMed Central (PMC8022896), fetched as XML through NCBI’s E-utilities. Two online experiments with a lexical decision task and two goals, speed and accuracy. False feedback that one goal was ahead of target was followed by worse performance on that goal (coasting) and better on the other (shifting). In Experiment 1 (n = 151) the feedback moved self-rated mood; in Experiment 2 (n = 222) an if-then plan to “ignore my feelings” removed both effects. The record’s first experimental evidence that affect after running ahead lowers a goal’s hold on performance and moves it to a rival goal. Effects are small, tests one-tailed, and Experiment 2 has no check that the plan changed affect. |
| LIT-1879 v2 | Almost Bayesian: The Fractal Dynamics of Stochastic Gradient Descent | Hennick & De Baerdemacker (2025; ICLR 2026). Models late-training SGD as sub-diffusion on a porous landscape: a time-fractional Fokker–Planck equation, the local learning coefficient as the medium’s mass dimension, and a spectral dimension d_s fitted from weight displacement, R(t) ∝ t^(d_s/2λ) with d_s ≤ λ. Where an effective scalar diffusion D_ξ is constant on a region, the steady state is exp(−L/D_ξ), the posterior tempered to effective sample size 1/D_ξ. How mass is shared between regions is not derived; in one toy test the cluster masses of SGD solutions match an SGLD posterior after a fitted tempering scale. Displacement fits cover MNIST MLPs, TinyStories models and fine-tuned ImageNet convnets. | Active — read in full 2026-10-31 (NOTE-1467); its “tempered posterior” is a temperature, the posterior at effective sample size 1/D_ξ within a region of constant diffusion, and the “accessibility” that would make SGD differ from Bayes across regions is not derived but fitted (THEORY-1258); its sub-diffusion fits are filed as Proposed (THEORY-1272). |
| LIT-1880 v2 | When Can Safe Controllers Adapt? Information before Commitment | Saligrama (2026). A safe adaptive controller must stay safe under every model not yet ruled out. Its first action that leaves no safe continuation under an alternative is a commitment, and the observation that action produces comes too late to justify it. With the information before commitment measured as a KL divergence between stopped records, every uniformly safe policy forfeits at least about ½e^{−I} of the value reachable only by committing. Acting on an exclusion at risk α needs about log(1/(2α)) nats beforehand. Bounded information and a linear gap give linear regret, shown for a headroom-limited device and for constrained linear regulation. Finite information can still certify a smaller candidate list. Safe recovery at O(√(T log T)) holds when a safe experiment is repeatable, informative and returns to a common state. | Active — read in full 2026-10-31 (NOTE-1466), with the main proofs; worth reading for the precise sense in which evidence must precede commitment: the observation a committing action produces cannot justify it, and bounded information before commitment leaves a fixed fraction of the oracle gap to every uniformly safe controller (THEORY-1254). It also proves the positive case, safe recovery from a repeatable informative experiment, and shows certainty equivalence failing at an active constraint (THEORY-1256). |
| LIT-1881 v2 | Bridging Freidlin-Wentzell large deviations theory and stochastic thermodynamics | Santolin, Freitas, Esposito & Falasco (2025). For overdamped diffusions with weak noise and a nonconservative force, the Freidlin–Wentzell quasi-potential is expanded in powers of the force about the detailed-balance free energy, each order computed along detailed-balanced relaxation; the first order saturates the emergent second law. Splitting the drift into a quasi-potential gradient and an orthogonal circulation, the escape rate from an attractor is bracketed between minus the entropy produced in relaxing into it and the entropy produced along the most likely escape path. The bracket closes at detailed balance; a sheared double well illustrates it. | Active — read in full 2026-10-31 (NOTE-1465); worth reading as the short, self-contained proof, for overdamped diffusions, that a nonequilibrium escape rate e^{−ΩΔI} is bracketed by the entropy produced in relaxing into the attractor and in escaping it (THEORY-1264), with a recursive expansion of the quasi-potential about the free energy. The bracket closes only at detailed balance. |
| LIT-1882 v2 | Correspondence between thermodynamics and inference | LaMont & Wiggins (2019). Treats the Bayesian evidence as a partition function with sample size N as inverse temperature and derives the thermodynamic quantities. The internal energy is the leave-one-out predictive loss, whose excess K/2N is equipartition. The heat capacity becomes a learning capacity, K/2 in a regular model and the learning coefficient in a singular one, lower where the prior or discreteness fixes parameters (“freeze-out”), proposed as the definition of sloppiness. A prior chosen to make the Gibbs entropy zero is Jeffreys-like, depends on N, reproduces AIC and avoids the Lindley–Bartlett paradox in one simulation. | Active — read 2026-10-31 (NOTE-1481; appendices B, C1, C3, C4 skimmed); worth reading as the fullest working of the evidence-as-partition-function dictionary with sample size as inverse temperature: generalization error as equipartition, a “learning capacity” equal to K/2 in regular and to the RLCT in singular models (THEORY-1253), and a sample-size-dependent prior that reproduces AIC. The dictionary is formal; it has no physical currents or dissipation. |
| LIT-1883 v2 | Overcoming Scaling Limits in On-Policy Self-Distillation for LLM Reasoning | Hossain, Kousar & Tourni (2026). In on-policy self-distillation the frozen initial model, given a reference solution, teaches the student along the student’s own rollouts. Under forward KL the best student is that teacher averaged over the contexts the student cannot see, with the conditional mutual information as irreducible loss and higher entropy (Proposition 1). The teacher’s advantage lies mostly on failed trajectories, where standard OPSD puts about 70% of its supervision, and is smaller at 4B than at 1.7B. OASIS supervises only verified rollouts and gives the teacher the student’s own failed attempt in place of the reference. It keeps a 3.2–3.8-point gain over the base model on AIME and HMMT from Qwen3-1.7B to 8B, where OPSD’s gain falls to 0.14, in single runs. | Active — read in full 2026-10-31 (NOTE-1479); worth reading as the published statement of the forward-KL limit on distilling from a better-informed teacher, with its entropy consequence (THEORY-1259), and for the finding that such supervision helps only where it is imitable (THEORY-1263). The trained objective clips each entry and is not a forward KL. |
| LIT-1884 v2 | Why Self-Training Helps and Hurts: Denoising vs. Signal Forgetting | Wu, Yang & Sun (2026). In overparameterized linear regression, iterated self-training with fresh covariates, noiseless pseudo-labels and minimum-norm students projects the estimate each round onto the row space of a new design. Noise from the first fit decays at (1 + τ)⁻¹ per round, and signal along a direction of variance s at s/(s + τ). Risk is U-shaped under anisotropy, monotone under isotropy, and tends to that of predicting zero. Deterministic equivalents concentrate uniformly over ridge parameters, and an iterated GCV picks the stopping round. One CIFAR-10 experiment shows the U-shape. | Active — read 2026-10-31 (NOTE-1471), body and appendices, with the proofs skimmed; worth reading for an exact account of iterated reconstruction through fresh low-rank views, in which forgetting the ancestor first improves and then destroys fidelity to the world, and every student fits its teacher exactly on its own sample (THEORY-1269). |
| LIT-1885 v2 | Thermodynamic Uncertainty Relation for Biomolecular Processes | Barato & Seifert (2015). In a nonequilibrium steady state of a Markov jump network obeying local detailed balance, the entropy produced while a current is counted times the current’s squared relative uncertainty is at least 2k_BT, independent of time. Proved within linear response for any network and for unicyclic networks at any affinity, where the sharper bound is (A/N) coth(A/2N), which also tightens the Fano-factor bound on the number of states in an enzyme cycle. For multicyclic networks far from equilibrium it is a conjecture supported by numerics on seven networks. | Active — read in full 2026-10-31 (NOTE-1480); worth reading as the letter that named the thermodynamic uncertainty relation: a current counted in a steady state with relative uncertainty ε costs at least 2k_BT/ε² of dissipation, proved within linear response and for single-cycle networks, conjectured with numerical support for many-cycle ones (THEORY-1268). It bounds the precision of currents, not of occupations. |
| LIT-1886 v2 | Thermodynamic Space of Chemical Reaction Networks | Liang, De Los Rios & Busiello (2024; PRX 2026). For any open mass-action reaction network at stationarity, each reaction’s affinity is bounded by the extremal cycle affinities, per use, over the elementary flux modes containing it, and each product of concentrations by the effective equilibrium constants of the extremal pathways; a virtual, infinitely slow probe reaction extends the bounds to species no reaction connects. This thermodynamic space has zero width at equilibrium. Bistability, chiral symmetry breaking, self-assembly yield and pattern contrast lie inside it; a measured state outside it falsifies a proposed topology. Fixed chemostats and stationary states only. | Active — read 2026-10-31 (NOTE-1463; appendices skimmed); worth reading for the bounds a fixed driving places on every stationary state of any reaction network (THEORY-1261). The exchange’s A13 also cited it for organizations that end when their driving is exhausted; the paper’s chemostats are fixed, and that point is LIT-1887’s. |
| LIT-1887 v2 | Emergence of Open Chemical Reaction Network Thermodynamics within Closed Systems | Remlein, Esposito & Avanzini (2026). A closed reaction network behaves, to leading order, as an open chemostatted one when exchange reactions are much faster than the rest and the reservoir species much more abundant, a diverging chemical capacity; time-scale separation alone is not enough, and the two limits do not commute. In that regime the open network’s master equation, local detailed balance, entropy production and Gibbs balance emerge. The regime lasts from the equilibration of the exchange reactions to a time of order the abundance ratio Ω, after which a driven network relaxes to the closed system’s equilibrium. Shown on a closed Brusselator and a two-reservoir network; buffers are the laboratory case. | Active — read 2026-10-31 (NOTE-1468; appendices skimmed); worth reading as the derivation of chemostats inside closed systems, with a lifetime: open behaviour needs both time-scale and abundance separation and lasts a time of order the abundance ratio (THEORY-1250). It, not LIT-1886, supports A13’s point that maintained organizations end when their driving is exhausted. |
| 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-1890 v2 | Stochastic dynamics and non-equilibrium thermodynamics of a bistable chemical system: the Schlögl model revisited | Vellela & Qian (2009). The Schlögl model A + 2X ⇌ 3X, B ⇌ X by rate equation, chemical master equation and open-system thermodynamics. Bistability requires the two chemostats out of equilibrium. The master equation has one two-peaked stationary distribution, so the long-run occupancy of the two states is set by parameters and volume, not by the initial condition, and which state dominates can change with volume alone. The slow eigenvalue, exponentially small in volume, is the sum of the two escape rates. The more stable state can carry the higher or the lower entropy production, and the Fokker–Planck approximation can pick the wrong dominant state. | Active — read in full 2026-10-31 (NOTE-1474) from the PMC copy; worth reading as the clearest worked case of a maintained chemical state that is metastable at finite size: bistability needs the chemostats out of equilibrium, long-run occupancy does not depend on the starting state, the slow eigenvalue is the sum of the escape rates (THEORY-1273), and entropy production does not pick the stable state (THEORY-1270). Its large-volume rate formula carries a spurious 1/V, so its reported breakdown of asymptotics is mostly that factor. |
| LIT-1891 v2 | General agents contain world models | Richens, Abel, Bellot & Everitt (2025), ICML. In a fully observed, finite, communicating, stationary controlled Markov process, a deterministic goal-conditioned policy whose success probability is within a factor 1 − δ of optimal on every composite goal of depth up to n determines each transition probability to within √(2P(1−P)/((n−1)(1−δ))). An algorithm reads the estimate off the policy alone, from its first action on either-or goals. A policy competent only at one-step goals determines nothing. “Contains a world model” means this recoverability from the input-output map, “not its specific use”, so it holds of any implementation of the same map. The experiments use a model-based agent in one 20-state environment. | Active — read in full 2026-10-31 (NOTE-1469); worth reading for the cleanest theorem that competence across a family of goals fixes the environment’s dynamics, and for exactly what “contains a world model” means in it: the transition function is computable from the goal-conditioned input-output map (THEORY-1249), which holds of a lookup table as much as of a planner (THEORY-1260). It is the objection to the functional reading of CLAIM-519, and it does not meet that claim’s defeated_if. |
| LIT-1892 v2 | Macroscopic stochastic thermodynamics | Falasco & Esposito (2025). Takes stochastic thermodynamics of jump processes with local detailed balance to a large-size limit. Extensive rates and potentials give a deterministic dynamics whose Lyapunov function is the quasi-potential, and a large-deviation theory of fluctuations that keeps the fluctuation theorem. Equilibrium, linear irreversible and Onsager–Machlup theories are recovered as limits. Transition rates between attractors go as e^{−VΔI} and are bracketed by the entropy produced along relaxation and escape paths, tightly only near detailed balance. Each attractor has a housekeeping dissipation, and Langevin approximations miss it and misjudge barriers. Minimum and maximum entropy production principles hold only in special regimes. | Active — read in part 2026-10-31 (NOTE-1472, Skimmed: §§I–III, IV.A–D, IV.G–H, VI, VII.A.1, VIII and appendix A read in full; field theory and two of three applications not read); worth reading as the systematic statement of how maintained nonequilibrium states behave at large size: a quasi-potential, not a free energy, sets their lifetimes, which dissipation along relaxation and escape paths brackets (THEORY-1264); each carries its own housekeeping dissipation; and Gaussian-noise Langevin models get both barriers and entropy production wrong (THEORY-1265). |
| 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-1894 v2 | Dynamical versus Bayesian Phase Transitions in a Toy Model of Superposition | Chen, Lau, Mendel, Wei & Murfet (2023). In Elhage et al.’s toy model of superposition with two hidden dimensions, in the high-sparsity limit, the population loss has a closed form and regular k-gons are critical points with derived local learning coefficients. The free energy formula predicts a Bayesian phase transition from the 5-gon to the 6-gon near n = 600, which MCMC confirms. SGD trajectories plateau at the same critical points and move to lower loss and higher estimated complexity, but the 5 → 6 transition was not observed in training. The paper states that there is no necessary relation between the two kinds of transition, and conjectures only that training’s transitions have Bayesian antecedents. | Active — read 2026-10-31, the derivation appendices skimmed (NOTE-1462); it does not argue that SGD and the posterior trace one journey: it states “no necessary relation” between their transitions, proposes only that training’s transitions have Bayesian antecedents, and its main Bayesian transition, 5-gon to 6-gon, was not seen in training (THEORY-1275). |
| LIT-1895 v2 | Self-Distillation Amplifies Regularization in Hilbert Space | Mobahi, Farajtabar & Bartlett (2020). In ℓ2-regularized regression in a Hilbert space held to a fixed training-error tolerance, refitting to one’s own predictions on the same inputs shrinks each eigencomponent of the labels by d_k/(c_t + d_k). The multiplier c_t must rise as the labels shrink. Rounds therefore amplify regularization, use progressively fewer basis functions (Theorem 5) and collapse to the zero function after finitely many. A few rounds can reduce overfitting and more underfit, in a spline example and, by fractions of a point, in ResNet and VGG runs on CIFAR. | Active — read 2026-10-31 (NOTE-1478), body and appendices, with the proofs of Appendix C skimmed; worth reading as the clean case of iterated self-distillation losing everything through the regularizer alone, on the same inputs with nothing withheld (THEORY-1252). |
| LIT-1896 v2 | Multi-Token Prediction Done Right | Teoh (2026). With a shared linear output head, the cross-entropy gradient at each multi-token-prediction hidden state is exactly the gradient of a forward KL toward the model’s own position-aligned next-token prediction, held fixed, plus the next-token cross-entropy gradient at the aligned state. A one-line straight-through routing sends only the KL part to the MTP heads and trunk, keeping cross-entropy at the head. The residual carries about 80% of the MTP gradient reaching the trunk at about a quarter of the KL part’s signal-to-noise ratio. Removing it (“Soft-MTP”) improves next-token loss, speculative decoding and zero-shot accuracy at 167M–1.2B by small margins in single runs. | Active — read in full 2026-10-31 (NOTE-1470); worth reading for its exact split of the multi-token-prediction gradient into self-distillation toward the model’s own next-token head and a data-target residual (THEORY-1274), and for what the split does not carry: in the DeepSeek-style heads of its main results the student sees the same tokens as its teacher, so it is not the information projection the exchange read into it. |
| LIT-1897 v2 | Geometry of Nonequilibrium Reaction Networks | Dal Cengio, Lecomte & Polettini (2023). Extends Hill–Schnakenberg cycle analysis from linear reaction networks to interacting ones, which are hypergraphs, by row-reducing the stoichiometric matrix: cycles span its kernel and carry steady currents and the non-conservative part of the affinity, cocycles span the orthogonal complement and carry transient currents and conservative forces, and an integrator recovers chemical potentials. One chemostat cannot drive a network; suppressing a cocycle creates a new conservation law. Near equilibrium the relaxation and response Onsager matrices share their spectrum, and the decomposition gives a linear-regime reconstruction of metabolic fluxes that satisfies Kirchhoff’s laws. | Active — read 2026-10-31 (NOTE-1476; appendices skimmed); worth reading for the cycle–cocycle geometry of reaction hypergraphs and as the exact form of the exchange’s “a productive cycle need not be a stoichiometric cycle”: catalysts cancel from the stoichiometric matrix, so mutual catalytic production is not a cycle of it (THEORY-1248). |
| LIT-1898 v2 | Stochastic Gradient Descent as Approximate Bayesian Inference | Mandt, Hoffman & Blei (2017). Constant-rate SGD near a minimum with positive-definite Hessian A and constant gradient-noise covariance BBᵀ is modelled as an Ornstein–Uhlenbeck process whose Gaussian stationary covariance solves AΣ + ΣA = (ε/S)BBᵀ. Minimising KL to the Gaussian posterior gives the optimal constant rate 2SD/(N tr BBᵀ) and the preconditioner (2S/εN)(BBᵀ)⁻¹, which matches the posterior exactly; momentum only rescales the covariance; constant-rate SGLD overestimates the posterior covariance; and averaging T iterates gives covariance A⁻¹BBᵀA⁻¹/(TS), the posterior’s for TS observations in a well-specified model. Tested on linear, logistic and softmax regression. The search phase, singular minima and multiple basins are outside the analysis. | Active — read in full 2026-10-31 (NOTE-1475); the paper the owner recalled at U4, and the right one, but what it shows is narrower than “the same process”: near one non-degenerate minimum, the optimiser’s noise scale ε/S plays the part of 1/N, and training time enters only as the wait for stationarity (THEORY-1255, THEORY-1257). |
| LIT-1899 v2 | A Variational Analysis of Stochastic Gradient Algorithms | Mandt, Hoffman & Blei (2016). The first version of the 2017 JMLR paper. Constant-rate SGD near a quadratic optimum is modelled as an Ornstein–Uhlenbeck process; its Gaussian stationary law is fitted to the Gaussian posterior by minimising KL over the learning rate, batch size and preconditioner, giving the optimal rate 2DS/(N tr BBᵀ) and the exact preconditioner (2S/εN)(BBᵀ)⁻¹. It shows SGFS’s preconditioner is KL-optimal, quantifies its diagonal truncation, and uses constant SGD for variational EM over hyperparameters. The later paper adds momentum, constant-rate SGLD and iterate averaging. | Active — read in full 2026-10-31 (NOTE-1473); every result reappears in the 2017 JMLR paper (LIT-1898), which is the one to cite. Worth keeping as the first statement and as the version Hennick and De Baerdemacker cite. |
| LIT-1901 | A pre-individual perspective to organizational action | Bencherki (2017), ephemera 17(4). After Simondon, action is pre-individual: logically prior to the people and organizations that appear to be its authors, it contributes to the individuation of both at once. Affect (“affectivo-emotivity”) is how a person discovers a pre-individual load that can only be resolved by continuing into a collective individuation; when that is refused, the result is felt as disindividuation. An action’s signification is its participation in an individuation, so one action can have several. Illustrated by a documentary on Canadian military spouses, read as co-individuation, channeling and usurpation of their action by the army. | Active — read in full 2026-10-31 (NOTE-1482), from the journal’s open-access PDF (ephemera, CC BY-NC-ND). Worth reading as the direct ancestor of Bencherki, Brummans & Vézy’s “agency without agents” (LIT-1902): pre-individual action, affect, disindividuation, the continuation of personal into collective individuation, and coexisting significations are all here, seven years earlier. It is a conceptual proposal illustrated by excerpts from one documentary, not a test. |
| LIT-1902 | Agency Without Agents: Affective Forces, Communicative Events, and Organizational Becomings | Bencherki, Brummans & Vézy (2024). A strong process theory of agency for organization studies. Agency is not an agent’s capacity to act but “the affective force, expressed as a communicative event, that governs the transition from one process of individuation to another”. It arises when one individuation process takes up another’s “excess action”, which may augment the ability to act of both and start a collective transindividuation. Failure is disindividuation. Communication is transduction, the continuity of action through processes, and meaning is retrospective. The illustration is a reanalysis of a meeting from Cooren’s ethnography of Médecins Sans Frontières. | Active — read in full 2026-10-31 (NOTE-1484), from the version of record the owner supplied. The publisher’s copy is open access (CC BY-NC 4.0) and a copy is deposited in R-libre (TÉLUQ). This client could not fetch either: SAGE and CORE served a bot check, and the repository reset every connection. Worth reading as the clearest statement in organization studies of agency without agents, built on Simondon’s individuation and Massumi’s affect. It is a conceptual proposal whose empirical illustration is a reanalysis, not a test. |
| LIT-1905 | Of Microperception and Micropolitics: An Interview with Brian Massumi, 15 August 2008 | Massumi, interviewed by Joel McKim, Inflexions 3 (2009); reprinted as ch. 2 of Politics of Affect (2015). Affect, after Spinoza and Deleuze, is an ability to affect and be affected that “governs a transition, where a body passes from one state of capacitation to a diminished or augmented state of capacitation”, and the transition is felt. Massumi offers this as “a proposition”, not “a general definition that you can apply”. Microperceptual shocks prime bodies differentially (“affective attunement”); affect “is not a content that can be transported from one event to another”; micropolitics modulates a situation’s unacted-out potential. | Active — read in full 2026-10-31 (NOTE-1488), from the journal’s own open copy at inflexions.org, HTML and PDF (20 pp.). This is the interview that Massumi’s Politics of Affect (LIT-1907) reprints as its second chapter, and it carries, word for word, the definition of affect that Bencherki, Brummans & Vézy (LIT-1902) quote from that book. Worth reading as the shortest statement of Massumi’s account of affect, microperception and micropolitics. |
| LIT-1910 | The Principle of Unrest: Activist Philosophy in the Expanded Field | Massumi (2017), Open Humanities Press, open access. Three pieces: an interview with Krystian Woznicki on movement and capitalism (ch. 1), a filmed interview with Adrian Heathfield (ch. 2), and an essay on collective expression (ch. 3). Movement is qualitative transformation in relation; capitalism is an ontopower that captures “bare activity”; there is always “an excess of activity over action”. Micropolitics aims at “a maximally inclusive co-patterning of contrasting tendencies, co-habiting the field in a way that facilitates each fully realizing itself” (p. 64), which Massumi calls aesthetic. | Active — skimmed 2026-10-31 (NOTE-1486), from the publisher’s open-access PDF (Open Humanities Press, CC BY-SA 4.0). The passages Bencherki, Brummans & Vézy (LIT-1902) lean on were read in context and their quotation checked; most of the book was not read. A book of three long interviews and essays on movement, capitalism, micropolitics and SenseLab practice. |
| LIT-1911 | Informational Ontology: The Meaning of Gilbert Simondon’s Concept of Individuation | Iliadis (2013), communication +1. Reads Simondon as “the first true philosopher of information” and places him as an extension of cybernetics rather than its opponent. Information, for Simondon, is not a signal passed along a channel but the resolution of a disparity between two domains in a metastable system; transduction is the operation that produces “a new informational structure, one that resolves a disparity between fields”. An exegesis built on quotations from L’individuation psychique et collective, with no argument that could fail. | Active — read in full 2026-10-31 (NOTE-1485), from the journal’s open-access PDF at openpublishing.library.umass.edu (CC BY-SA 4.0). A short exegesis, not an argument with tests: worth keeping as the source of the “informational ontology” reading of Simondon that Bencherki and Iliadis (LIT-1922) and Bencherki, Brummans & Vézy (LIT-1902) build on. |
| LIT-1913 | On Organizational Becoming: Rethinking Organizational Change | Tsoukas & Chia (2002). Change should be treated as the normal condition of organizations, not an exception to stability. After Bergson and James, change is ontologically prior to organization. It is “the reweaving of actors’ webs of beliefs and habits of action to accommodate new experiences obtained through interactions”, driven by the radial structure of categories and by human reflexivity. Organization is a secondary accomplishment in two senses: an attempt to order the flux of action, and a pattern that emerges from it. The paper is agent-centred: its becoming is carried by human actors. | Active — read in full 2026-10-31 (NOTE-1489), from the version of record (a scan with OCR) posted on the first author’s own site, htsoukas.com/wp-content/uploads/2014/03/tsoukas-chia-2002.pdf. Worth reading as the standard statement of “organizational becoming” in organization studies: change is ontologically prior to organization, and organization is a secondary accomplishment of it. A conceptual paper; its evidence is other people’s ethnographies, reread. |
| LIT-1922 | The Constitution of Organization as Informational Individuation | Bencherki & Iliadis (2019; print 2021), Communication Theory. Proposes Simondon’s informational individuation as the theory of communication that the communicative-constitution-of-organization (CCO) tradition lacks. Information is a differential in action potential between differently ordered domains; communication is its propagation “from kin to kin” (transduction), which organizes each domain it passes through; an action’s signification is the reordering it brings about; entities at different levels coexist rather than scale up. Four propositions, illustrated by one meeting excerpt. Agency is not theorized. | Active — read in full 2026-10-31 (NOTE-1483) from the authors’ manuscript in R-libre, TÉLUQ’s repository: 43 pp., Word-generated, headed “A more recent version of this paper is published in Communication Theory”. The version of record (Oxford, subscription) was not read, so its pagination (pp. 442–462) could not be checked against the text. Worth reading as the bridge between Iliadis’s exegesis of Simondon (LIT-1911) and the communicative constitution of organization; it is a theoretical proposal with one illustrative excerpt. |
| LIT-1923 | Ventriloquism’s methodological scope | Wilhoit (2016), Language Under Discussion 2:45–49. A response to Cooren (2014): Montréal School CCO is ontologically committed to interaction, so it takes conversation analysis as its method of choice, and a ventriloquism carrying those commitments cannot be the open metamodel Craig (1999) asked for. Dialogue is emerging instead from CCO work that uses other methods. It does not say Cooren’s analyses “entify agents”. | Active — read in full 2026-10-31 (NOTE-1487), from the journal’s open-access PDF (CC BY 4.0). A five-page response to Cooren’s “Pragmatism as ventriloquism” (Language Under Discussion 2014). Its point is about method: Montréal School CCO’s commitment to interaction makes conversation analysis its method of choice, so ventriloquism cannot be the open metamodel for Craig’s seven traditions that Cooren proposes. Worth knowing chiefly because Bencherki, Brummans & Vézy (LIT-1902) cite it for a claim it does not make, that Cooren’s analyses “entify agents”. |
| LIT-1924 | Horizontal Surgicality and Mechanistic Constitution | Baumgartner, Casini & Krickel (2020). Since phenomena can be manipulated only via common causes of them and their parts, constitution must be analysed with non-ideal interventions; counting every supervenience-respecting common cause as an intervention begs the question, and admitting every common cause is a non-starter. An intervention that directly changes at most one behaviour on each lower level, and changes its target and the phenomenon simultaneously, is “horizontally surgical”; under Universal Constitution, Simultaneity and transitivity of co-occurrence, one such intervention suffices for constitution. The proof presupposes settled parthood and levels. | Active — read in full 2026-11-01 (NOTE-1494) from the authors’ penultimate draft; worth keeping as the one positive interventionist result in the debate: given that every change in a phenomenon is simultaneously realized on every lower level, that simultaneous changes are not causally related, and that parthood and levels are settled, a single intervention that changes one part per level and the phenomenon simultaneously suffices for constitution (THEORY-1293). |
| LIT-1928 | Top-down causation without top-down causes | Craver & Bechtel (2007; online 2006). Talk of top-down or bottom-up causation within levels of mechanisms can be translated “without remainder” into mechanistically mediated effects: intralevel causal chains combined with the constitutive relation between a mechanism and its components. Interlevel relations are constitutive only. The case rests on stated assumptions (higher-level causes exist and are all mechanistically explained), not on an argument for them. It concedes that the interlevel experiments used to find components are symmetrical and give only prima facie evidence of componency. | Active — read in full 2026-11-01 (NOTE-1491); worth keeping as the mechanist’s statement that the relation between levels is constitution, not causation, and for an admission the record needs. Interlevel experiments are symmetrical, and a lesion shows only “prima facie” that something is a component, since a part not “interactively integrated” may be a background condition (p. 553, n. 10). So the experiments do not by themselves draw the mechanism’s boundary (THEORY-1287, CLAIM-530). |
| LIT-1934 | Constitutive Relevance, Mutual Manipulability, and Fat-Handedness | Baumgartner & Gebharter (2016). Embedded in Woodward’s 2003 interventionism, Craver’s mutual manipulability entails that no part is constitutively relevant to any whole, since every cause of a supervening behaviour is a common cause of it and of its base and so not an intervention; embedded in Woodward’s relaxed version it makes constitution causal; with a temporal clause added (causes precede effects for some intervention) it is consistent, but then mutual manipulation is fat-handed and its correlations are equally explained by a model with no constitution. Constitution gets only second-order, abductive evidence: no surgical cause of the whole is ever found. | Active — read in full 2026-11-01 (NOTE-1493) from the authors’ penultimate draft; worth keeping as the proof that, if constitution is non-causal and wholes supervene on their parts, every cause of a whole’s behaviour is a common cause of it and of some part’s, so mutual manipulability by ideal interventions is unsatisfiable and, once relaxed, gives no evidence of constitution (THEORY-1288). |
| LIT-1936 | Dynamic mechanistic explanation: computational modeling of circadian rhythms as an exemplar for cognitive science | Bechtel & Abrahamsen (2010). Dynamic mechanistic explanation adds to a mechanistic account a computational model, usually differential equations in time, whose variables are properties of the mechanism’s parts and operations. In circadian research the parts were found first by experiment, and the models explore their dynamics. In cognitive science the models posit the mechanism de novo, and fit to behaviour is their only check. The paper names six contributions models make, from showing that an identified mechanism can produce the phenomenon (C1) to exploring how coupled mechanisms lose and regain synchrony (C6). Its limit, in its own words: for de novo models, “Empirical evidence can rule out specific models, but usually cannot decide between competing architectures.” | Active — read in full 2026-11-01 (NOTE-1492); worth keeping for the line it draws between a dynamical model whose variables are anchored to parts and operations already found by experiment, and one posited de novo that is checked only by fit to behaviour (THEORY-1290). Kept also for two uses of modelling that bear on the record’s maintenance constructions. One is clamping a variable to test whether an identified part belongs to the responsible mechanism (THEORY-1289). The other is the open question whether peripheral circadian clocks sustain their own rhythm or are damped oscillators driven from outside (THEORY-1292). |
| LIT-1939 | An Abductive Theory of Constitution | Baumgartner & Casini (2017). Craver’s mutual manipulability ties constitution to ideal interventions that cannot exist, and relaxing them leaves only fat-handed ones, whose data a pure common-cause model fits as well as a constitutive one even in ideal settings, so constitution, unlike causation, has no crucial experiment. Their No De-Coupling account: a set of parts constitutes a phenomenon when every cause of the phenomenon is a common cause of it and some member, no proper subset does as much, and no expansion of the variable set breaks the coupling. The inference is abductive and only inductively corroborated. | Active — read in full 2026-11-01 (NOTE-1490) from the authors’ penultimate draft; worth keeping for the claim that, unlike causation, constitution has no experimentum crucis, and for its alternative: constitution is inferred abductively from a redundancy-free common-cause coupling of whole and parts that no expansion of the variable set breaks (THEORY-1288, THEORY-1294). |
| LIT-1941 | M-Autonomy | Metzinger (2015). M-autonomy is the capacity for second-order mental action, whose central element is veto: rules imposed on one’s own mental behaviour, goal selection and permanence, rational guidance, and the intentional inhibition, suspension or ending of an ongoing process. It comes in three degrees: represented knowledge that one has the ability, executed attentional control, and cognitive control. During mind-wandering the ability is kept and its representation in the self-model, the “epistemic agent model”, is lost, and an ability is exercised only when so represented. The return of control is represented as self-caused even when an unconscious event caused it, a “functionally adequate form of self-deception”. The quantitative argument and the two-thirds figure repeat the 2013 paper’s. | Active — read in full 2026-11-01 (NOTE-1497), from the author’s copy on his Mainz university pages (blogs.uni-mainz.de/fb05philosophie/files/2013/04/Metzinger_M-Autonomy_JCS_2015.pdf, linked from thomasmetzinger.com), typeset with the journal’s running heads and pagination, text extracted with pdftotext. Worth reading for the sharpest statement of the will-organization question in Metzinger: what mind-wandering loses is “not the ability itself” but the conscious knowledge of it, and “one can only deliberately and autonomously exert an ability if that ability is explicitly represented in one’s phenomenal self-model” (THEORY-1300). It also argues that the return of control is represented as self-caused even when an unconscious event caused it (THEORY-1298). A development of LIT-1942 with the empirical detail cut; no new data. |
| LIT-1942 | The myth of cognitive agency: subpersonal thinking as a cyclically recurring loss of mental autonomy | Metzinger (2013). Mind-wandering is a recurring, unnoticed loss of M-autonomy, the ability to control one’s own mental processes, whose defining component is veto: that every ongoing process could be suspended or ended, and that the person knows it. Conscious thought is for the most part subpersonal mental behaviour; it becomes personal-level only when integrated into an “epistemic agent model” (EAM), a transparent self-model of oneself as a knowing, attention-controlling self, which collapses at the onset of each episode. Proposes the “self-representational blink” and a shift in the “unit of identification” to individuate episodes. Its claim that we lack M-autonomy for “roughly two thirds” of conscious life is not borne out by its own minutes, which give about half. | Active — read in full 2026-11-01 (NOTE-1495), from the publisher’s open-access PDF (frontiersin.org/articles/10.3389/fpsyg.2013.00931/pdf; also PMC3868016), text extracted with pdftotext. Worth reading as the origin of M-autonomy: the ability to control one’s own mental processes, defined by its veto component, and lost without notice in every episode of mind-wandering. It argues that most conscious thought is subpersonal and that a thought becomes the person’s only by integration into an “epistemic agent model”. The “two thirds of conscious lifetime” without M-autonomy is not what its own figures give: they give about half (THEORY-1297). Conceptual work on others’ data; no new data. |
| LIT-1943 | The Elephant and the Blind: The Experience of Pure Consciousness: Philosophy, Science, and 500+ Experiential Reports | Metzinger (2024), MIT Press, open access. More than 500 anonymised reports of “pure awareness” from an online survey of meditators (1,403 usable respondents from 57 countries, 92 questionnaire items, twelve factors), grouped by theme in 34 chapters with commentary. The book’s thesis is that consciousness can occur without time, self-location, an egoic self-model or a first-person perspective. It models pure awareness as a highest-level but “nonegoic self-model” of the organism’s own epistemic openness, its tonic alertness, and so treats a first-person perspective as content, not a condition, of consciousness. The evidence is retrospective report from a self-selected sample. The methods chapter concedes that such reports cannot show the state was selfless when it occurred, while the summary calls nonegoic consciousness “empirically established”. | Active — skimmed 2026-11-01 (NOTE-1499), from the publisher’s open-access PDF: the introduction, the theoretical commentary of chapters 2, 4, 8, 25, 28 and 31, all of chapter 34 and the epilogue’s ethics sections were read; the report chapters were sampled, not read through. Worth reading as the fullest statement of Metzinger’s later account of consciousness without a self. It offers “pure awareness” as minimal phenomenal experience and models it as a highest-level but nonegoic model of the organism’s own epistemic openness. Its evidence is retrospective, self-selected reports from meditators. The methods chapter concedes the limits of that evidence and the summary overstates what it shows. |
| LIT-1945 | The Problem of Mental Action: Predictive Control without Sensory Sheets | Metzinger (2017), in Philosophy and Predictive Processing. Mental action cannot be active inference through the body, since no sensory sheet is in the loop; it is offered instead as predictive control of effective connectivity aimed at the epistemic value of states in the self-model. Attentional agency controls precision expectations of an internal model. Cognitive agency selects among candidate thoughts that mind-wandering continually generates (“mental sleep-walking”), and M-autonomy lets the system “actively sculpt its own internal affordance landscape”. Whether the conscious epistemic agent model constitutes this control, represents and enables it, or is a phenomenal artefact, current data “do not help to decide”. Agency’s sense of origination may be an enculturated post-hoc confabulation. | Active — read in full 2026-11-01 (NOTE-1496), from the open-access PDF on the collection’s own site (predictive-mind.net/papers/the-problem-of-mental-action/at_download/paperPDF), text extracted with pdftotext. Worth reading for two things the 2013 and 2015 papers lack: a model of mental action as selection from a competition among candidate thoughts that mind-wandering supplies (the “cognitive affordance hypothesis”), and a plain statement that the data cannot yet decide whether the epistemic agent model constitutes mental control, represents and enables it, or is a phenomenal by-product (THEORY-1296). That withholds what M-autonomy (LIT-1941) asserted as a principle. Four testable hypotheses, none tested; no data. |
| LIT-1946 | Minimal phenomenal experience: Meditation, tonic alertness, and the phenomenology of “pure” consciousness | Metzinger (2020), Philosophy and the Mind Sciences 1(I):7. Proposes minimal phenomenal experience (MPE) as a candidate for the simplest consciousness and the entry point to a “minimal model” explanation. MPE is to lack minimal phenomenal selfhood, time and a spatial frame. Six constraints are drawn from contemplative and Western texts: Wakefulness, Low Complexity, Self-Luminosity, Introspective Availability, Epistemicity and Transparency/Opacity. Sixteen case studies flesh them out. The hypothesis: pure awareness is a temporally thin Bayesian representation of the organism’s tonic alertness, a model of an “unpartitioned epistemic space”. It “definitely has representational content” and is “non-egoic self-modelling”. Tonic alertness without that model, as in unresponsive wakefulness, is not conscious. A conceptual paper. Its evidence is quoted report. | Active — read in full 2026-11-01 (NOTE-1498) from the journal’s open-access PDF. Worth reading as the founding statement of minimal phenomenal experience, the concept the record’s reading of Chandia-Jorquera et al. (LIT-1354) takes as given. It holds that pure awareness has representational content: a temporally thin, nonegoic model of the organism’s tonic alertness, its “epistemic space”. On that account, consciousness without a self-model in the egoic sense still involves self-modelling, and it lacks even a phenomenal quality of oneness. Its evidence is sixteen quoted reports and texts. Its methodological problems, performative self-contradiction among them, are deferred to other papers. |
| LIT-1948 v2 | Latent Dirichlet Allocation | Blei, Ng and Jordan (2003), JMLR 3. A generative model of a corpus in three levels: each document draws a topic mixture θ ~ Dir(α), and each word draws a topic from θ and then a word from that topic’s distribution. Justified by de Finetti’s theorem for exchangeable words, it is set against the unigram model, the mixture of unigrams (one topic per document) and pLSI (a mixture per training document with no model for it). Inference and estimation are variational EM. On two corpora it has the lowest held-out perplexity of the four, and its document features serve classification and collaborative filtering. | Active — read in full 2026-11-03 (NOTE-1519), from the JMLR PDF; worth reading as the source of the per-document Dirichlet mixture that CLAIM-536 makes the difference between the owner’s H1 and H2, and for the authors’ own contrast with the one-topic-per-document mixture of unigrams. The structure is definitional and checked; the empirical superiority rests on perplexity on two corpora. |
| 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-1951 v2 | Keep Your Options Open: An Information-Based Driving Principle for Sensorimotor Systems | Klyubin, Polani and Nehaniv (2008), PLoS ONE 3(12): e4018. Empowerment, the n-step channel capacity from an agent’s actions to its later sensor state, set in an interventional causal-network framework, with contextual empowerment, the capacity given side information, never below the context-free value and bounded by what the agent’s history can tell it. In a cart-pole, a controller greedily maximizing 10-step empowerment balances the pole with no task given, although the most empowered states are unreachable; empowerment as fitness switches a sensor’s layout between niches; and on a Sony AIBO an evolved context automaton comes to track whether a book is present. | Active — read in full 2026-11-03 (NOTE-1514), from the PLoS ONE version of record; worth reading for contextual empowerment, ordered by what the agent can read, and for the cart-pole, where greedy empowerment maximization balances the pole though the most empowered states are unreachable, a case of CLAIM-354’s distinction between reach and what can be sustained. |
| LIT-1952 v2 | The Persona Selection Model: Why AI Assistants might Behave like Humans | Marks, Lindsey and Olah (2026), Anthropic Alignment Science blog. The persona selection model, named and not claimed as original: pre-training teaches a language model a distribution over personas, post-training updates it into a posterior over Assistant personas, runtime context conditions it further, and the Assistant’s traits are a key determiner of behaviour. Surveyed evidence from generalization, behaviour and interpretability, and one new coin-flip experiment. The open question is exhaustiveness, set out as a spectrum from a shoggoth through a router that swaps personas to an operating system. “PSM” in the record already abbreviates Metzinger’s phenomenal self-model (NOTE-460), so this work is named in full. | Active — read in full 2026-11-03 (NOTE-1512), from the page at alignment.anthropic.com; worth reading as the plainest statement of the persona-distribution picture the record’s U6 to U12 build on, and for its spectrum of views on exhaustiveness, whose router is the record’s question of whether persona components condition one another. It is a named mental model with surveyed evidence, which its authors say they are unsure is complete. |
| LIT-1953 v3 | Ephaptic coupling of cortical neurons | Anastassiou, Perin, Markram & Koch (2011), Nature Neuroscience 14: 217–223. In rat cortical slices with synaptic transmission blocked, a 12-pipette setup applied and measured LFP-like extracellular fields at layer 5 pyramidal somata. Fields of 0.7–6 mV/mm induced membrane oscillations under 0.5 mV, undiminished to 100 Hz. With spiking driven by current injection, the fields left spike counts unchanged but shifted spike timing: phase locking was significant at 1 Hz from 0.74 mV/mm, at 8 Hz, and at 30 Hz only for the largest field. Up to four nearby neurons were synchronized by a common field. The authors explain the effect by Kirchhoff’s circuit laws and a threshold model. | Active — read 2026-11-03 (NOTE-1516), main text, online methods and references, from the scan of the published article on gwern.net, at the owner’s direction; the supplementary material was not read. Worth reading as the measurement of how large, and how small, ephaptic effects are at physiological field strengths: fields like the LFP’s shift spike timing and synchronize nearby neurons without changing spike counts. It explains them by Kirchhoff’s laws, so it is not evidence against micro-level description. |
| LIT-1955 v2 | The general causality orientations scale: Self-determination in personality | Deci and Ryan (1985), Journal of Research in Personality 19. The General Causality Orientations Scale: twelve vignettes, each with an autonomy, a control and an impersonal response rated 1–7. In 636 students the subscales have α .69–.74 and are nearly independent (autonomy–control r = .03, autonomy–impersonal −.25, control–impersonal .27); two-month retest .71–.78 (n = 51). Autonomy tracks supporting children’s autonomy, ego development and self-esteem; impersonal tracks external locus of control, social anxiety, depression and low self-esteem; control tracks Type-A and public self-consciousness, in samples of 42 to 87. Behavioural results are weak (p < .07 and p = .06 for two of three). | Active — read in full 2026-11-03 (NOTE-1531), from the scan on the SDT site. Worth reading as the founding instrument of causality orientations theory: three separately scored, nearly independent orientations with good reliability, whose validity in 1985 was a set of small-sample correlations, behaviour the weakest. |
| 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-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-1959 v2 | Attention Is All You Need | Vaswani et al. (2017), arXiv:1706.03762; NeurIPS 2017. The Transformer, an encoder–decoder built only from multi-head scaled dot-product attention, position-wise feed-forward layers and sinusoidal position encodings. Attention maps a query and key–value pairs to a weighted sum of the values, the weights set by query–key compatibility, softmax(QKᵀ/√d_k)V; several heads attend to different subspaces. It reached 28.4 BLEU on WMT 2014 English–German and 41.8 on English–French at a fraction of earlier training cost, and transferred to constituency parsing. | Active — read in full 2026-11-03 (NOTE-1501), from arXiv v7; worth reading as the source of query–key–value attention, whose factorization into compatibility weights and transported values is the structure TERM-064’s note of 2026-11-02 compares to legibility. The QK/OV vocabulary is Elhage et al.’s, not this paper’s. |
| LIT-1960 v2 | The path taken: Consequences of attaining intrinsic and extrinsic aspirations in post-college life | Niemiec, Ryan and Deci (2009), J. Res. Pers. 43. 147 graduates surveyed one and two years after college. Valuing intrinsic or extrinsic aspirations predicted attaining them (β = .51, .67). With both attainments in the model, intrinsic attainment predicted well-being (β = .77) and ill-being (β = −.66), extrinsic attainment well-being β = .00 and ill-being β = .38; over the year, change in need satisfaction mediated intrinsic attainment’s link to change in well-being. All self-report and correlational; alone, extrinsic attainment correlates positively with well-being (mean r = .19). | Active — read in full 2026-11-03 (NOTE-1520), from the PubMed Central author manuscript PMC2736104; worth reading as the direct longitudinal test of goal contents theory’s claim about attainment, and for what it shows that its citations drop: extrinsic attainment’s null is a unique-variance result, and alone it correlates positively with well-being. |
| LIT-1961 v2 | Chaos | Bishop, ‘Chaos’, Stanford Encyclopedia of Philosophy (2008; substantive revision 2024-10-11). Chaos is a property of deterministic, nonlinear models with sensitive dependence and aperiodicity; unpredictability is not indeterminism. The argument that chaos amplifies quantum events is conditional on the interpretation of QM, damping and the sign of local Lyapunov exponents, and in the brain parallel redundancy may block it. For Kane, sensitivity is not sufficient for incompatibilist freedom under determinism, and under indeterminism agents must still be shown to harness it. §§6.2–6.3 state contextual emergence: larger-scale stability conditions constrain and enable smaller-scale possibility and actualization. | Active — skimmed 2026-11-03 (NOTE-1535), from the live SEP page, §§4 and 6 and the stock-taking sections read closely; worth reading for its case that chaos is not indeterminism, that amplification of small perturbations is physically conditional, and that Kane’s use of chaos leaves the harnessing of indeterminism to be shown. The 2024 revision also states Bishop’s contextual emergence as an ontological account of constraint. |
| LIT-1962 v2 | A meta-analysis of self-determination theory-informed intervention studies in the health domain: effects on motivation, health behavior, physical, and psychological health | Ntoumanis et al. (2020; Health Psychol. Rev. 15, 2021). A meta-analysis of 73 SDT-informed health interventions (58 RCTs, 30,088 participants). At the end of the intervention they raised perceived need support (g = 0.64), autonomy and competence satisfaction (0.37, 0.31), autonomous motivation (0.30), health behaviour (0.45) and psychological health (0.29); not relatedness, controlled motivation or amotivation. At follow-up behaviour (0.28) and physical health (0.28) held, psychological health did not (0.14, ns). Mediation was not tested and need frustration was not an outcome. | Active — read in full 2026-11-03 (NOTE-1526), from the open-access PDF in White Rose eprints; worth reading as the experimental evidence that manipulating need support moves need satisfaction, autonomous motivation and health behaviour. It does not give what THEORY-052’s promote_when asks: no need-frustration outcome, no mediation test, and a psychological-health effect that is gone at follow-up. |
| LIT-1963 | Attention as the Source of a Free Will | Jennings (2026), forthcoming in Synthese. Attention is prioritization of mental processing by a subject, and the subject is a collection of fixed, formed and fluid interests with the power to constrain those interests. That power is contextually emergent: the collection’s parts are necessary but not sufficient, and a boundary from its context, the skull, meninges and brain stem, is what lets macro-level patterns constrain micro-level ones. Phase-amplitude coupling is offered as its signature and ephaptic coupling as evidence against weak emergence. Attention breaks stalemates between equally weighted interests and so forms new interests, which the paper offers in place of Kane’s indeterminism as the source of a free will, placing itself “in between libertarianism and compatibilism”. | Active — read in full 2026-11-03 (NOTE-1508), from the manuscript of 2026-10-29 the owner supplied; worth reading as a worked attempt to make attention the mechanism of a will without a homunculus, and for its one original move, a boundary between an emergent phenomenon and its context as what keeps contextual emergence from collapsing into supervenience. Read it knowing that its neural evidence (phase-amplitude coupling, ephaptic coupling) is consistent with the weakly emergent models it rejects, and that its step from a non-reducible subject to free will is asserted. |
| LIT-1964 v2 | Psychological need frustration as a transdiagnostic process in associations of self-critical perfectionism with depressive symptoms and eating pathology | Campbell, Boone, Vansteenkiste and Soenens (2018), Journal of Clinical Psychology 74(10). Belgian adolescents, a cross-sectional study (N = 284) and a two-wave study six months apart (N = 608). Need frustration, the twelve BPNSFS frustration items, mediates self-critical perfectionism’s link to depressive (CDI) and eating disorder (EDI-II) symptoms, and absorbs their association: cross-sectionally their latent correlation falls from .50 to .42 with perfectionism and to a non-significant .18 with frustration; in latent change models their correlated change falls from .43 to .39 and then .24. The authors call the findings correlational and ask for experiments, clinical samples and externalizing outcomes. | Active — read in full 2026-11-03 (NOTE-1533), from the publisher’s early-view PDF posted on selfdeterminationtheory.org; worth reading as the study THEORY-052 cites, through LIT-561 p. 12, for need frustration as transdiagnostic, and as the strongest form of that claim in the record: frustration statistically absorbs the association between depressive and eating symptoms. Its longitudinal study is two waves of correlated change, so it shows no temporal order, and its measure is the BPNSFS frustration scale (THEORY-1322). |
| LIT-1965 v2 | Empowerment: A Universal Agent-Centric Measure of Control | Klyubin, Polani and Nehaniv (2005), IEEE CEC 2005, pp. 128–135. Empowerment is defined as the Shannon capacity of an agent’s actuation channel, max over action distributions of I(Aⁿ; S_{t+n}), counted only as far as the agent’s own sensors register it. Knowing the channel’s state can raise it. As a fitness function in a grid world with a signal source it evolves sensors that switch from displacement blobs near the source to bearing arcs far from it, and a wider variety of actuators, with empowerment capped by the sensor’s capacity. | Active — read in full 2026-11-03 (NOTE-1511), from the University of Hertfordshire archive copy; worth reading as the first definition of empowerment, the capacity of the channel from an agent’s actions to its own later sensor, which counts only the control the agent can perceive, a legibility-limited measure of reach for CLAIM-354. |
| LIT-1966 v2 | What is satisfying about satisfying events? Testing 10 candidate psychological needs. | Sheldon, Elliot, Kim and Kasser (2001), JPSP 80. Three studies (USA; USA and South Korea; USA) rated ten candidate needs within participants’ most satisfying event of the last month, week or semester. Autonomy, competence, relatedness and self-esteem were the most salient and the strongest correlates of event affect; among all ten, self-esteem was the largest unique predictor in Studies 1 and 3 (β = .28, .38). The authors concluded there may be four needs. Security mattered in unsatisfying events; money–luxury came last. | Active — read in full 2026-11-03 (NOTE-1502), from the scan on selfdeterminationtheory.org, read as page images; worth reading because its own SDT authors concluded there may be four needs, self-esteem the fourth, and named the need-or-outcome ambiguity that QUESTION-369 asks about. |
| LIT-1967 v2 | We know this much is (meta-analytically) true: A meta-review of meta-analytic findings evaluating self-determination theory. | Ryan, Duineveld, Di Domenico, Ryan, Steward and Bradshaw (2022), Psychological Bulletin 148. A narrative synthesis of 60 meta-analyses of self-determination theory found to July 2021, not preregistered. Support is strongest for cognitive evaluation, organismic integration and basic needs theory, thin for causality orientations and goal contents, and absent for relationships motivation theory; no meta-analysis of need frustration exists, and integrated regulation is not separated from identified regulation (Howard et al. 2017; Van den Broeck et al. 2021). Most pooled effects are cross-sectional correlations with high, largely unexplained heterogeneity. No meta-analysis is re-pooled or graded. | Active — read in full 2026-11-03 (NOTE-1500), from the authors’ accepted manuscript on OSF; the online supplement was not read. Worth reading as the one map of SDT’s meta-analytic evidence: where it is strong (CET, OIT, BPNT), thin (COT, GCT) or absent (RMT, need frustration, integrated regulation). It is a narrative synthesis by the theory’s co-founder, not an independent audit. |
| LIT-1969 v2 | Interpersonal supports for basic psychological needs and their relations with motivation, well-being, and performance: A meta-analysis. | Slemp et al. (2024), JPSP 127. A psychometric meta-analysis of 881 samples (N = 443,556), over 70% cross-sectional and mostly recipient-reported. Perceived autonomy, competence and relatedness support each correlate with satisfaction of all three needs at ρ = .44–.62, with their frustration at −.20 to −.55, with autonomous motivation at about .4 and with performance at .14–.25. The supports intercorrelate .67–.71; in joint models competence and relatedness support add to autonomy support, and relatedness support carries relatedness satisfaction. Individualism moderated 2 of 18 relations. | Active — read in full 2026-11-03 (NOTE-1507), from the CC BY Online First PDF as posted on selfdeterminationtheory.org; supplementary tables not read. Worth reading as the largest synthesis of SDT’s contextual claim, 881 samples; its “effects” are correlations, mostly cross-sectional, and its three supports intercorrelate about .7. |
| LIT-1970 v2 | Relation of reward contingency and interpersonal context to intrinsic motivation: A review and test using cognitive evaluation theory. | Ryan, Mims and Koestner (1983), JPSP 45. A review sorting the reward experiments into task-non-contingent, task-contingent, performance-contingent and competitively contingent rewards, and an experiment (N = 96, n = 16 per cell): a $3 reward for doing well, given with controlling (“should”) feedback, left 117 s of free-choice play out of 360, against 229 s with informational feedback, F(1, 89) = 4.25; and rewarded groups played less than unrewarded groups given the same feedback (283 and 196 s), F(1, 89) = 4.34, with initial interest as covariate (about p = .07 without it). Felt pressure was higher under controlling conditions; the self-report interest measure did not reach significance; mediation was not tested. | Active — read in full 2026-11-03 (NOTE-1522), from the scan on the SDT site. Worth reading as the source of the reward-contingency taxonomy and the one experiment that gives the same performance-contingent reward in an informational and a controlling style, each against a no-reward group with the same feedback: the framing changed the effect, and the reward undermined in both styles. One study, n = 16 per cell, no mediation test. |
| LIT-1971 v2 | The role of need fulfillment in relationship functioning and well-being: A self-determination theory perspective. | Patrick, Knee, Canevello and Lonsbary (2007), JPSP 92. Three correlational studies of romantic relationships, mostly women students: eight pooled samples (N = 1,918), 66 couples, and a 10-day diary of 908 disagreements by 120 people. Perceived need fulfilment by the partner correlates with satisfaction (r = .72 corrected), commitment, secure attachment and less defensiveness; relatedness is the strongest unique predictor of relationship outcomes; the partner’s fulfilment predicts one’s own satisfaction beyond one’s own; and the relative autonomy of one’s reasons for being in the relationship carries fulfilment’s association with post-disagreement satisfaction. Autonomy and competence subscales correlate .96 after correction. | Active — read in full 2026-11-03 (NOTE-1515), from the article on the SDT site. Worth reading as the relationship-level test of all three needs: fulfilment by a partner goes with relationship quality, relatedness most, and the partner’s fulfilment adds to one’s own; but its measure does not separate autonomy from competence (r = .96 corrected), and all three studies are correlational self-report. |
| LIT-1974 v2 | Unhappy or unsatisfied: distinguishing the role of negative affect and need frustration in depressive symptoms over the academic year and during the COVID-19 pandemic | Levine, Brabander, Moore, Holding and Koestner (2021), Motivation and Emotion 46(1). Two cross-lagged panel studies of students at a Canadian university: three waves over 2018–19 (N = 379) and two waves six weeks apart at the start of the COVID-19 pandemic (N = 235). Need frustration (nine BMPN items), negative affect (five adjectives) and depressive symptoms (CESD-R 10). Need frustration predicted later depression (β = .13, .17; .18) and later negative affect (.18, .16; .17); negative affect never predicted later depression; depression predicted later frustration at Study 1’s first lag (.20). Self-reported frustration predicted others’ reports of depression marginally (β = .14, p = .074). The authors call frustration an antecedent and a transdiagnostic risk factor; the design shows the first only in a traditional cross-lagged model and does not reach the second. | Active — read in full 2026-11-03 (NOTE-1510), from the version of record in PMC’s Open Access Subset via Europe PMC; worth reading as prospective evidence, in two student samples, that a need-frustration self-report predicts later depressive symptoms where negative affect does not (β .13–.18). It does not establish order (no random intercepts; the reverse path was as large at one lag) or a transdiagnostic role (THEORY-1349). |
| LIT-1975 v2 | Adjustable robust solutions of uncertain linear programs | Ben-Tal, Goryashko, Guslitzer and Nemirovski (2004), Math. Program. 99: 351–376. For uncertain LPs with here-and-now and wait-and-see variables, the Adjustable Robust Counterpart (∀ data ∃ adjustment) is never more conservative than the usual Robust Counterpart (∃ one solution ∀ data), coincides with it under constraint-wise uncertainty, and is usually NP-hard. Restricting adjustments to affine functions of the data gives a tractable counterpart for fixed recourse and tight semidefinite approximations otherwise. Each decision may have an information basis, the part of the data it may depend on; in an inventory model, poorer bases raise cost and the non-adjustable counterpart is infeasible. | Active — read 2026-11-03 (NOTE-1503), from the published text on A. Nemirovski’s faculty page; worth reading as the standard distinction between robust (∃ solution ∀ data) and adjustable robust (∀ data ∃ adjustment) decisions, with information bases between them, which CLAIM-537’s conditions I and II instantiate; its own intermediate case is a restriction on the rule’s form (affine), not on what is read. |
| LIT-1976 v2 | Where do our preferences come from? How hard decisions shape our preferences | Voigt (2022), Front. Behav. Neurosci. 16: 956307, an Opinion article. When two items are liked equally, the value differential computed in vmPFC is too small to choose and dACC registers conflict. A tentative model holds that the tie is broken during the choice by fixation: precuneus allocates spatial attention bottom-up to the salient item, dlPFC holds it in working memory, and the fixated item gains value, so the choice becomes easy. The change lasts only for remembered choices, with hippocampus. The support is mainly the author’s 2019 study, in which fixation duration and dlPFC and precuneus activity predicted later preference change; it is correlational. | Active — read in full 2026-11-03 (NOTE-1517), from the publisher’s open-access PDF; worth reading as a short statement of the view that preferences form during hard choices, through fixation, rather than only after them through dissonance reduction. It is an Opinion article with a tentative model resting mainly on the author’s 2019 study, and its attentional step is bottom-up capture by salience. |
| LIT-1977 v2 | Further Examining the American Dream: Differential Correlates of Intrinsic and Extrinsic Goals | Kasser and Ryan (1996), PSPB 22. Two cross-sectional self-report studies, 100 community adults and 192 students. Seven aspirations form two factors, extrinsic (financial success, social recognition, appealing appearance) and intrinsic (self-acceptance, affiliation, community feeling, physical fitness). With overall importance controlled, extrinsic importance goes with less self-actualization (β = −.52, −.67) and vitality (−.60, −.34) and more physical symptoms (.46, .43), and intrinsic importance with the reverse; likelihood ratings parallel this, and the pattern survived social desirability with two effects becoming marginal. Reasons for pursuing the goals are not measured. | Active — read in full 2026-11-03 (NOTE-1525), from the scan on the SDT site. Worth reading as a primary source of goal contents theory: with overall striving held fixed, extrinsic aspirations go with lower and intrinsic with higher self-reported well-being, in an adult and a student sample. It does not test the “beyond the reasons” half of NOTE-439’s C4, which it names as an open question. |
| LIT-1978 v2 | The Basic Psychological Need Satisfaction and Frustration Scales probably do not validly measure need frustration. | Murphy, Watts, Baker, Don, Jolink and Algoe (2023), Psychological Assessment 35(2). The BPNSFS’s twelve “frustration” items carry almost no active-thwarting content, the defining part of need frustration since Vansteenkiste and Ryan (2013), and are the negatively keyed half of what Chen (2013) built as a satisfaction measure. In eight pooled samples (N = 3,692), factors sharing a keying direction correlate .64–.75 and satisfaction and frustration of the same need .17–.38; a higher-order model grouping the scales by keying fits better (RMSEA .052, CFI .950) than one grouping them by need (.064, .924; need correlations .94–1.11); and the frustration items’ excess correlation with ill-being follows the keying of the ill-being items. The authors conclude the split is “likely primarily” a keying artefact, while saying the confound cannot be resolved with existing data. | Active — read in full 2026-11-03 (NOTE-1530), from the PMC author manuscript; worth reading as the case that the dominant need-frustration measure separates frustration from satisfaction mostly by item keying, which undercuts the BPNSFS evidence THEORY-052 leans on. Shown: the items lack thwarting content and keying organizes the covariance more than need does (THEORY-1316). Argued, not settled: that the frustration scales are therefore keyed low satisfaction (THEORY-1311). |
| LIT-1979 v3 | Within-person variation in security of attachment: A self-determination theory perspective on attachment, need fulfillment, and well-being. | La Guardia, Ryan, Couchman and Deci (2000), JPSP 79: 367–384. In three studies of undergraduates (N = 136, 152, 160), between 19% and 44% of the variance in attachment security was between persons, the rest within persons across partners (mother, father, romantic partner, best friend, and in Study 2 roommate and another adult). Relationship-specific satisfaction of the three needs predicted relationship-specific security, also without the relatedness items; relatedness was the strongest unique predictor, then autonomy, then competence. Mean security predicted well-being and variability across partners mostly did not. Need satisfaction and security each partly mediated the other’s relation to well-being. All cross-sectional. | Active — read in full 2026-11-03 (NOTE-1523), from the typeset.io copy of the published article, at the owner’s direction. Worth reading as the source of the claim that need satisfaction varies by relationship and predicts attachment security relationship by relationship: most of the variance in attachment is within persons, across partners. Cross-sectional, and the authors say so: the direction is undetermined and probably runs both ways. |
| 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-1982 v2 | Dynamic Changes in Phase-Amplitude Coupling Facilitate Spatial Attention Control in Fronto-Parietal Cortex | Szczepanski et al. (2014), PLoS Biology 12(8): e1001936. Electrocorticography in eight epilepsy patients holding covert spatial attention. Broadband high-gamma (80–250 Hz) amplitude was coupled to the phase of an endogenous 2–5 Hz rhythm in 123 of 273 responsive electrodes, more strongly for the contralateral field in 55, robust to removing the evoked-potential window. In 28 electrodes, stronger coupling on a trial went with faster detection (e.g. r(41) = −0.51), for contralateral attention only, while neither band’s amplitude predicted RT. Correlational; ‘facilitate’ is the authors’ interpretation. | Active — read in full 2026-11-03 (NOTE-1528), from the publisher’s open-access PDF; worth reading as, by its own account, the first human intracranial test of whether phase-amplitude coupling tracks the allocation of spatial attention in fronto-parietal cortex, with careful controls for evoked potentials and power. Its evidence is correlational: coupling strength predicts reaction time in 28 of 123 coupled electrodes, and nothing was manipulated, so it shows association, not that coupling improves attention. |
| LIT-1984 v3 | Libertarianism | Kane (2009), Philosophical Studies 144: 35–44. Free will is “the power to be the ultimate creator and sustainer of one’s own ends or purposes”, and requires ultimate responsibility (UR): an agent must be responsible for anything that is a sufficient cause or motive of the act. UR requires that some acts in a life, self-forming actions, were undetermined, and Frankfurt cases do not touch them. SFAs occur under conflict, when a “stirring up of chaos” in the brain makes it sensitive to micro-indeterminacy; the indeterminacy is a hindrance within each of two competing efforts, both willed, so either outcome is the agent’s success. Indeterminism lessens control without lessening responsibility, and what responsibility needs is macro-control, not control of neurons. | Active — read in full 2026-11-03 (NOTE-1518), from the JSTOR download reposted on cooperative-individualism.org, at the owner’s direction. Worth reading as Kane’s own compact statement of ultimate responsibility, self-forming actions and his reply to the luck objection: the “stirring up of chaos” that makes the brain sensitive to micro-indeterminacy is his, and his answer to the control objection concedes that indeterminism diminishes control and denies that it diminishes responsibility. |
| LIT-1988 v2 | Assessing basic/fundamental psychological need fulfillment: systematic mapping and review of existing scales to foster cumulative science | Kermavnar, Avsec, Huang and Desmet (2024), Frontiers in Psychology 15. A PRISMA review, searched 21 August 2023, of original self-report scales of need fulfillment in healthy general populations: 31 scales from 32 primary studies, 23 based on self-determination theory, with 89 adaptations. 21 measure satisfaction only; four satisfaction and frustration, three support, one frustration only (2020), one thwarting (Bartholomew et al. 2011), one support and thwarting. Autonomy appears in 27 scales, relatedness 24, competence 23, over 30 other needs in a few each. The review documents the four states’ terms used interchangeably, double-barrelled frustration-thwarting items, satisfaction items that ask about thwarting, and the BPNSFS’s frustration scales “repurposed” from negatively coded satisfaction items (after Murphy et al. 2023). It finds no consensus on what makes a need basic, takes no side on the two-dimensional model, and names the IBQ and GNSF as good practice. | Active — read in full 2026-11-03 (NOTE-1509), from the version of record (CC BY) via Europe PMC; worth reading as a finding aid to the 31 original need-fulfillment scales and as a plain list of the field’s measurement faults: satisfaction, frustration, support and thwarting confused, frustration scales built from negatively worded satisfaction items, double-barrelled items. It offers no criterion for need-hood (THEORY-1318). |
| LIT-1989 v2 | Differentiating autonomy from individualism and independence: A self-determination theory perspective on internalization of cultural orientations and well-being. | Chirkov, Ryan, Kim and Kaplan (2003), JPSP 84. 559 students in South Korea, Russia, Turkey and the USA rated their reasons for practices of horizontal and vertical individualism and collectivism. For every type of practice, the relative autonomy of their reasons predicted a well-being composite (β = .24–.29), positive in all sixteen country-by-practice tests and with no country or gender interaction. Vertical practices were much less internalized than horizontal ones. Autonomy as volition is argued to be orthogonal to independence. | Active — read in full 2026-11-03 (NOTE-1513), from the published PDF on selfdeterminationtheory.org; worth reading as the primary study for SDT’s claim that autonomy is not individualism: autonomous enactment of collectivist and vertical practices predicts well-being in four countries. Cross-sectional, 94–195 students per country; “no moderation” is non-significant interactions. |
| LIT-1991 v2 | The Assistant Axis: Situating and Stabilizing the Default Persona of Language Models | Lu, Gallagher, Michala, Fish and Lindsey (2026), arXiv:2601.10387. Activation vectors for 275 prompted roles in Gemma 2 27B, Qwen 3 32B and Llama 3.3 70B span a low-dimensional persona space whose first component, shared across models, runs from fantastical roles to Assistant-like ones, with the default Assistant at its extreme; the Assistant Axis, the default minus the role mean, aligns with it and is largely present in base models. Steering along it modulates role-taking and persona-based jailbreaks. In synthetic multi-turn conversations the persona’s position follows the latest user message, drifting away in therapy-like and AI-philosophy talk; clamping the projection (activation capping) cuts harmful responses to persona jailbreaks by about 60% without measured capability loss. | Active — read 2026-11-03 (NOTE-1505, Skimmed: main text in full, appendices not read), from arXiv v1; worth reading for the geometry of persona space in three open-weight models, the Assistant at one end of a pre-existing first axis, and for the finding that within a conversation the persona’s position follows the latest user message, which bears on any episode-level model of personas (CLAIM-536, QUESTION-370). |
| 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-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-1998 v2 | Persona Vectors: Monitoring and Controlling Character Traits in Language Models | Chen, Arditi, Sleight, Evans and Lindsey (2025), arXiv:2507.21509. An automated pipeline turns a trait name and description into a persona vector, a difference of mean residual activations between trait-exhibiting and non-exhibiting responses, in Qwen2.5-7B and Llama-3.1-8B. The vectors steer evil, sycophancy and hallucination; last-prompt-token projections predict prompt-induced shifts, mainly between prompt types; finetuning shifts along them correlate with post-finetuning trait expression (r = 0.76–0.97); steering against them after finetuning, or towards them during it, limits the shift; and projecting training data onto them flags data that will induce the trait, including in real chat data. | Active — read 2026-11-03 (NOTE-1524, Skimmed: main text in full, appendices C.2, G.2 and M only), from arXiv v3; worth reading as the method behind PSM’s interpretability evidence: one difference-of-means trait direction tracks prompt-induced and finetuning-induced persona shifts, with r = 0.76–0.97 for the latter in two 7–8B models. It is a handle on movement along named traits, not a fitted persona distribution. |
| LIT-1999 v2 | Methodological considerations for studying neural oscillations | Donoghue, Schaworonkow and Voytek (2021), Eur. J. Neurosci. 55: 3502–3527. Seven methodological considerations for analysing neural oscillations, each demonstrated on simulated data with public code: verify that an oscillation is present; individualize frequency bands; account for dynamic aperiodic 1/f activity, which puts power in every band; examine bursts in single trials; measure waveform shape, since non-sinusoidal rhythms create harmonics and significant phase-amplitude coupling with no interacting rhythms; separate overlapping sources; and check signal-to-noise. Read from the preprint. | Active — read 2026-11-03 (NOTE-1529), from the authors’ PsyArXiv preprint; worth reading as a compact, simulation-backed guide to how spectral measures of field potentials are misread: absent oscillations, shifted peaks, aperiodic 1/f activity, bursts, non-sinusoidal shape, overlapping sources and low SNR. Its waveform-shape section is the reason non-sinusoidal rhythms make phase-amplitude coupling ambiguous. |
| LIT-2000 v2 | Basic psychological need satisfaction, need frustration, and need strength across four cultures | Chen et al. (2015), Motiv. Emot. 39, online 12 November 2014. Two cross-sectional studies, Belgium and China (N = 683) and Belgium, China, the USA and Peru (N = 1,051). They build the 24-item Basic Psychological Need Satisfaction and Frustration Scale: six factors fit better than three and are metric-invariant across the four countries. Satisfaction relates mainly to life satisfaction and vitality, frustration mainly to depressive symptoms, with no detectable country differences and no moderation by need valuation or need desire. All frustration items are negatively worded and all satisfaction items positively. | Active — read in full 2026-11-03 (NOTE-1527), from the publisher’s typeset copy in the ULB repository DI-fusion; worth reading as the source of the BPNSFS, the standard need-frustration scale, and for its test that need satisfaction helps regardless of how much a person values or desires the need. Its satisfaction/frustration split coincides with item direction by construction. |
| LIT-2002 v2 | Human cooperation is strong among individuals but fragile between groups | Van Lange & Bergmann (2026), doi:10.1038/s44159-026-00580-z. A Perspective. Cooperation is strong in dyads and fragile between groups. Categorization alone yields mistrust and in-group favouritism by bounded reciprocity. Only conflicting interests, real or perceived, turn that into costly competition and hate, and the processes that build in-group cooperation can fuel intergroup conflict. Source of THEORY-1352, read in NOTE-1537. | Active |
| LIT-2003 v2 | Major evolutionary transitions in individuality | West, Fisher, Gardner & Kiers (2015), doi:10.1073/pnas.1421402112. A transition in individuality is defined by mutual dependence and negligible within-group conflict, which Table 1 shows occur apart. It proceeds by forming a cooperative group and then transforming it, with no clear border between the steps. An ecological benefit together with how groups form explains the transitions; kin discrimination and repression of competition played minor roles. Source of THEORY-1351, read in NOTE-1538. | Active |