Explanation statuses — Whether the record believes the ACCOUNT, which is not what the same word means on a practice. An explanation can be Rejected while the thing it explained goes on working exactly as well as it ever did (ADR-031).
The current account — the best explanation the record holds for why this happens.
294 of 547 CLAIM documents. Back to the full index.
| # | Title | Summary | Status |
|---|---|---|---|
| CLAIM-002 v2 | A text’s identity across retellings is a family of relations, namely identity of the artifact, continuity of transmission and similarity of communicative function, which is why a distant retelling can be recognizably descended from an original it no longer resembles | A52 §13.5 with A50 §7, recovered. A50 called the point that “the act of translation changes the conditions for subsequent translation” possibly “the most consequential”. The manuscript keeps a family of transformations but not the three relations. | Active |
| CLAIM-011 | Intertwining with an uninformative correspondence is vacuous or lossy, so the source–target correspondence must be anchored to independently measured distinctions and evaluated on tasks other than those it was estimated on | The assistant’s own objections at A34 §3 and A40 §6.4, with the remedy of A40 §VIII. Recovered: the manuscript keeps the intertwining identity but states neither limit nor remedy, apparently by inadvertence. | Active |
| CLAIM-018 v3 | Canguilhem’s distinction between functioning under a norm and capacity for norm-changing adaptation corresponds to transformation capacity | An interpretation, not a premise (Section 6.8): “Nor does the present argument depend upon importing Canguilhem’s account into viability theory.” Its absence from the premises of ARG-007 is how the record says so. | Active |
| CLAIM-019 v2 | Lévi-Straussian transformational analysis, as Descola reads it and as it has been modelled computationally, is direct prior art for structural transport, not only a philosophical precursor | A102 §2, recovered: Lévi-Strauss treated myth variants as related by transformations, and “Recent computational work has explicitly modeled his analysis”. The manuscript §2 mentions Lévi-Strauss’s transformations but cites neither Descola nor the computational work. | Active |
| CLAIM-021 v2 | The mechanisms composing a will-organization are not novel | Conceded to CLAIM-024: the claimed novelty is a common explanatory role across realizers, not a mechanism (Sections 3.7, 7.1). | Active |
| CLAIM-022 v2 | Explaining practical efficacy does not settle whose the will is | Section 7.2, “No. The theory explains practical efficacy, not ownership.” What the authenticity line tried to supply, the paper now disclaims; QUESTION-011 holds the question. | Active |
| CLAIM-023 v2 | The contribution is not that translation is pragmatic or that speech acts change contexts, but a specified, testable account of which communicative distinctions a translation preserves | Disclaimed from A35 §9 on and sharpened at A40 against Gutt and Krifka. The manuscript §1 keeps it (“not the claim that each individual ingredient is novel”) and cites Gutt, but drops Krifka, whom four replies named as the closest prior art. | Active |
| CLAIM-025 v3 | An operative regime, the governing organization among regimes, and the capacity to transform that organization can persist or fail separately | Section 6.2, from the emergency variant of Northstar. | Active |
| CLAIM-027 v4 | Which of an agent’s available regimes becomes effective depends on maintained relations — accessibility, precedence, persistence, jurisdiction, suspension and transformation — that are not reducible to the contents of the competing regimes, whatever mechanisms realize them | The paper’s central thesis, Active since the status review of 2026-10-28. The audit called it the strongest original contribution. The comparison with planning, executive control and institutional decision procedures it owed is now owed by CLAIM-487, the gain claim, which stays Proposed. | Active |
| CLAIM-028 | No result from the exchange’s four experiments reached a later draft: the authored chains were excluded by rule, and the synthetic constructions were dropped without a stated reason | What became of E1–E4. C6 Appendix F made the provenance caveats a rule (“Do not use assistant-authored examples as independent LLM samples”), and A89 called C6 “a theoretical manuscript with a specified empirical program”. The synthetic results of E1 were legitimate existence constructions and their loss is not explained. | Active |
| CLAIM-030 v2 | An organized whole’s operative intention is not the expectation of its members’ intentions; it is produced by systemic mechanisms that can evolve apart from what the members intend | The owner’s thesis at U12, and the one that ran through the whole exchange. List and Pettit’s result that a group judging proposition by proposition from its members’ judgments can fail to be rational is its formal anchor, proved for the court agenda (THEORY-725); the general impossibility is THEORY-127, still Proposed. The fictional cases illustrate it. | Active |
| CLAIM-031 | A reconstruction chain reorganizes observational constraints rather than only accumulating metric error: a text can change greatly while keeping a few consequential constraints, and one changed constraint can change the act | A75’s self-critique of the metric drift bound, “something our earlier metric formulation obscured”. The manuscript keeps the bound and a soft form of the limit (§8: invariants, decision risks and compatibility structures “need not coincide”). | Active |
| CLAIM-032 v2 | Northstar’s internal procedures are not morally or historically analogous to the regime Fraenkel described | The caution the paper states before using Fraenkel (Section 5.6). As an objection to the inference it narrows the respect in which the analogy holds, to structure alone. | Active |
| CLAIM-035 v2 | Translation operations are generally not invertible, need not compose by a fixed rule, and preserve no structure given in advance; which communicative properties are invariant must be discovered or negotiated | A18’s own limit on its analogy: “the physics analogy has a hard limit.” Accepted at once. Its content reached the manuscript as the semigroup of §4. | Active |
| CLAIM-038 v3 | A communicative object is a context-indexed system of empirical constraints over a cover of contexts, and these need not extend to one globally realizable interpretation | A78, after the owner’s U29 pointer to this record’s sheaf- contextuality readings, which the assistant said it “couldn’t reopen”. The manuscript §3: “an empirical model can remain well-defined even without a global hidden meaning state.” | Active |
| CLAIM-040 | Symmetry is a kind of invariance, and Noether’s theorem is the point: invariance under transformation yields conservation | The owner at U37, quoting A102’s “We do not require the structure to remain invariant”: “symmetry is a kind of invariance, no? isn’t that part of the point of Noether Theory?” Conceded at A105. Its Noether half was limited by the assistant in the same reply. | Active |
| CLAIM-041 v2 | Context-sensitive interpretation, order effects and noncommuting framing operations do not by themselves establish nonclassical probability or quantum contextuality | Built over A21–A30, against the assistant’s quantum move and then the owner’s U13. The manuscript §9 states it. Its strongest ground, the record’s THEORY-013, is not cited in the manuscript. | Active |
| CLAIM-042 v2 | The levels at which communicative observables exist organize observables, not objects: a communicative object is identified jointly by constraints from observables at several levels, which, where those observables share one state space, is the intersection of the regions they pick out | The owner’s correction at U28, accepted by A75 as “a more fundamental formulation”. The manuscript §2: observations “are not ordered into one strict ontological ladder”, and “An identified communicative object may be represented by an intersection of such regions.” | Active |
| CLAIM-043 | Equal entropy does not entail equal relational structure, and a collection of local entropies need not characterize global compatibility | A86 §4. The manuscript §5 keeps its example: perfect correlation and perfect anticorrelation of two fair binary observables have equal entropy and reverse a fundamental relationship. | Active |
| CLAIM-045 v2 | Architectural, dynamical and goal-directed accounts of distributed agency are complementary components of one account, each answering a different sub-question | The owner’s correction at U7: the three views are “perfectly mutually compatible … complementary components of one theory”. The case that made the record want a complements relation. | Active |
| CLAIM-046 v2 | Different hidden-state models can produce identical observations, so pragmatic identity and fidelity should be defined on observable responses before any equivalence of internal states is assumed | The reason for the A39 restructure, made under U16: put “observational equivalence at the center of the formal theory”. The manuscript is built on it: observables are operational, no latent coordinate is primitive, and latents are validated by prediction (§2–3). | Active |
| CLAIM-047 | Possessing an action-generating regime is not the same as its being practically effective | The distinction the paper inherits from Frankfurt (THEORY-120) and generalizes beyond desires: the audit’s “established foundation”. | Active |
| CLAIM-049 v2 | An adaptive interpreter’s state includes its message, context knowledge and learned parameters, and learning can make some relational invariants more stable and others less | A110 §22, recovered, with its case: a translator familiar with an underworld genre conserves its affiliative humour, a naive one turns it into a moral statement. The manuscript keeps one sentence (§11) on adapted receivers. | Active |
| CLAIM-050 v6 | For report fidelity, fidelity is relative to the communicative decisions receivers make, and Blackwell’s order on rendering procedures, over a designed distribution of situations, makes precise the ceiling a rendering sets on those decisions | The manuscript’s §5: rate–distortion makes coding cost explicit, Blackwell comparison (restricted to a family Q of communicative decision problems) makes fidelity operational, and decoder side information is a Wyner–Ziv problem. | Active |
| CLAIM-056 v4 | Local transport errors in a reconstruction chain are bounded by the per-step discrepancies weighted by the sensitivity of the later reconstructions, so the same local error can be damped, accumulated or amplified, and local similarity can coexist with large global drift; the bound measures departure from a reference transport, not whether the act survives | A50 §2–3, kept nearly verbatim in outline v4 and the manuscript §8. The manuscript later restricts the expansive regime: for stochastic kernels in total variation, contraction coefficients do not exceed one. | Active |
| CLAIM-057 | Precedence, jurisdiction and suspension can vary independently | Shown by the classification variants of Northstar (Sections 5.3–5.5): a formally absolute rule can be weak because another process controls entry into its domain. | Active |
| CLAIM-060 | An encompassing organization’s success does not establish the well-being, viability or autonomy of its constituents — and the converse holds too | The owner’s thread at U37 and U39: corporations trample human wellbeing though made of humans; and cancer, autoimmunity and ecosystem collapse run the other way. The audit’s “strong negative argument” — believed, and not in the paper, which leaves cross-scale relations to future work. | Active |
| CLAIM-061 v3 | Renderings that keep the proposition can perform a different communicative act, so preserving the proposition is not sufficient for preserving the communicative event | Manuscript §1, and the Abstract’s “retain its topic while reversing the speaker’s stance, and … change almost every word while preserving the interpersonal relation”. The descendant of the owner’s frame thesis (CLAIM-006) without its ranking; the central thesis (CLAIM-115) rests on it. | Active |
| CLAIM-070 | Transport induced by one global stochastic kernel carries a global extension of the source model to a global extension of the target model | Proposition II of A84, Proposition B2 of C6, the manuscript’s Proposition 2. Without a common global kernel preservation is not automatic, which leaves open whether transport can create or destroy contextuality. | Active |
| CLAIM-071 | Conditional generation shares a mathematical vocabulary with translation, not a mechanism: denoising time is not telephone-game time, and a generative failure is not a proof of sheaf contextuality | A97’s own two limits, which the manuscript §7 keeps. They became the whole of the claim once generation was demoted from realization to analogue. | Active |
| CLAIM-074 v4 | Fidelity is relative to the interpreter’s learning history: what the current context supplies and what earlier experience has left in the interpreter are separate histories, told apart by what they carry and not by whether the change sits in activations or in weights, so fidelity under a fixed interpreter, across interpreters and across states of adaptation are different quantities | A44 §4 and A48 §5.5, recovered. Kept to outline v4 (§9.5); absent from the manuscript, which keeps the context/interpreter split but not its consequence for fidelity. Apparently dropped by inadvertence. | Active |
| CLAIM-075 | Viability does not establish what ought to persist | Sections 6.10 and 7.3: “An unjust institution may be highly viable.” Viability licenses conditional functional judgment only. | Active |
| CLAIM-077 v3 | A transport is admissible only if it keeps specified observable distinctions apart, which excludes trivial collapse by construction | A49’s answer to the collapse objection, recovered: d_O(s_1, s_2) > δ implies d_O(Φ(s_1), Φ(s_2)) > δ′. The owner’s U19 strategy at work: define rather than defend. One bullet in outline v4; absent from the manuscript. | Active |
| CLAIM-079 | Stability does not entail viability: a system can occupy a stable regime while losing access to trajectories that keep satisfying its constraints | Applied from viability theory (THEORY-134) and the stability/resilience distinction (THEORY-132) (Section 6.3). | Active |
| CLAIM-080 | The agent is independently warranted: the account asks how a given agent’s practical efficacy is organized, not what makes something an agent | The supposition that scopes the whole paper (Sections 1, 2, 7.4). Everything resting on it is conditional on it; Northstar is assumed to be an agent “for purposes of analysis”. | Active |
| CLAIM-081 v3 | Retaining information about the ancestor and drifting in the population’s distribution are different profiles: a chain can forget where it started while staying far from the original, so convergence is not preservation and transmission is not degradation | C1 Appendix D’s two profiles and E1’s two forgettings (A59). The manuscript §11 keeps it in one line (“converge in surface form while diverging in ancestral information”); the named profiles and the synthetic construction are gone. | Active |
| CLAIM-085 v2 | A framing effect in a language model is a property of that model under those prompts, and what a translation ought to preserve is a normative question that model response distributions, being descriptive, cannot settle | A45 §8–9 and A48 §8.5, recovered. Both limbs went in the de-hedging after U19, though neither is a hedge: one is a design constraint, the other a distinction between normative and descriptive fidelity. The manuscript keeps part of the remedy and neither argument. | Active |
| CLAIM-086 v2 | A constraint may govern conduct without governing the conditions under which it remains authoritative | The structural lesson the paper takes from Fraenkel (Section 5.6), with two independent lines of support: the historical analogy and the constructed Northstar case. The audit’s “strong conceptual refinement”. | Active |
| CLAIM-088 | Task-sensitive information preservation is established in semantic and goal-oriented communication; what is new is applying it to sheaf-structured pragmatic observations under sequential, context-dependent reconstruction | A86 §9’s priority concession, recovered: “We should build on that rather than present task-sensitive information preservation as an entirely new invention.” Dropped at C6 with the works it named (a survey, Chai et al., Zhao et al. 2025), apparently by inadvertence; none is in the record. | Active |
| CLAIM-093 | Not every invariance of a stochastic or communicative process implies a Noether conservation law: the symmetry principle can be borrowed, a conservation analogue has to be derived | A105, limiting the owner’s U37 appeal to Noether in the same reply that conceded the rest. The manuscript §4 and §11: Noether-type results give “conservation criteria for particular stochastic processes, not a universal conservation law of meaning”. | Active |
| CLAIM-094 | A harmonic observable conserves only its mean, and Baez and Fong show that mean conservation for every initial state does not make an observable a symmetry | From the reading of Baez and Fong (NOTE-598). The manuscript’s Kf = f is the mean-only condition, which the cited theorem’s counterexample shows is weaker than commuting with the generator. | Active |
| CLAIM-097 v2 | T2I-CompBench is not purely object-centered: its non-spatial relation category already probes interactions, but scores them with CLIPScore and near human ceiling | From the reading of T2I-CompBench (NOTE-592). The benchmark’s interaction category is the nearest existing measurement of what Case III proposes, and its weaknesses are the manuscript’s argument. | Active |
| CLAIM-098 v3 | Translation and cross-modal reconstruction need not be group actions: they form a category or semigroup of directed stochastic transformations, in which invertible symmetries are special cases | Manuscript §4. The one trace the relativity analogy left: symmetry and equivariance for exact preservation, a semigroup of stochastic maps for the rest. | Active |
| CLAIM-099 | Maintaining a regime of effective action and maintaining the capacity to govern among regimes are not the same achievement | The paper’s main result (Section 6.11), concluded by ARG-007 from CLAIM-079 and CLAIM-025. The audit’s “strong conditional argument”. Canguilhem interprets it (CLAIM-018) and is deliberately not a premise. | Active |
| CLAIM-106 v3 | Pragmatic fidelity is a graded, potentially asymmetric property of transport, not an equivalence relation; equivalence is its zero-distortion limit | The owner’s objection at U20, accepted in full by A50 (“an important correction”) and made the thesis of outline v4. The manuscript §12: “stochastic transport generalizes exact equivalence to graded fidelity.” | Active |
| CLAIM-107 v3 | Under Markov reconstruction kernels, an observable’s expectation is invariant when the observable is harmonic (K f = f), and drifts by at most Σ ε_i when ‖K_i f − f‖∞ ≤ ε_i; on a finite irreducible chain only constants are harmonic | The manuscript’s §4, citing Baez and Fong. CLAIM-094 says what the cited theorem needs that the discrete-time criterion leaves out. | Active |
| CLAIM-112 | The operational account does not say that meaning is nothing but observable behaviour, nor that no stable content exists because interpretation is context-dependent | A38 §10.1 and A40 §13.1. The manuscript’s conclusion keeps it: the question is “neither whether a translation duplicates an invariant semantic substance nor whether all meanings are endlessly fluid”. | Active |
| CLAIM-113 v2 | Transformations and invariants define one another: translation preserves some structures exactly, carries some equivariantly, preserves some approximately and reorganizes others, and identity is studied through what a class of transformations leaves invariant | A105’s reframing after U37, and the manuscript §4 and §11: “Structural transformations help identify structure through what they preserve”, with a four-way split of exact, equivariant, approximate and reorganizing transformations. | Active |
| CLAIM-116 | Regulation, even higher-order regulation, does not establish a will | The boundary the paper draws against its own most-repeated objection: thermostats, adaptive controllers and organizationally closed systems regulate without warranting an agent. | Active |
| CLAIM-118 v5 | Context and interpreter are separate sources of interpretive change, told apart by what each carries and not by mechanism: what the current context supplies, whether held in activations or in weights updated on it and discarded after, is the signal; what earlier contexts have left in the interpreter and it carries into new ones is the interpreter; and improving the signal differs from improving the interpreter | A43’s first point about the U17 proposal, developed at A44–A45 into three sources of change (evidence, transient computation, parameters). The manuscript §5 keeps it in two sentences. | Active |
| CLAIM-121 | A transport whose local kernels commute with restriction maps overlap-consistent source models to overlap-consistent target models | Proposition I of A84, Proposition B1 of C6, the manuscript’s Proposition 1. It concerns marginal consistency, not global noncontextuality. | Active |
| CLAIM-122 v3 | Will-organization is not one more higher-order preference: changing the conditions of efficacy changes behaviour while the competing preferences stay fixed | The reply to CLAIM-089 (Section 3.5), by precommitment in a person and escalation authority in a firm. | Active |
| CLAIM-123 v6 | In conditional generation, adding scores composes two conditions exactly when the ratio p(y₁,y₂|x)/(p(y₁|x)p(y₂|x)) does not vary with the noisy state x, which conditional independence of the conditions at that state is sufficient for but does not require | The manuscript’s §7, citing Composable Diffusion, T2I-CompBench and Schrödinger bridges. The readings support it, and the manuscript is more careful than the paper it cites. | Active |
| CLAIM-125 v4 | Directed transport between empirical models whose covers change has two open problems: when it preserves decision-relevant information, and how it extends to signalling data | CLAIM-100 narrowed. Simulations between empirical models already give directed stochastic transport between scenarios whose covers change, and settle when it preserves global compatibility. What is left open is decision-relevant information and signalling data. | Active |
| CLAIM-126 v3 | Model stitching tests whether a transport preserves decision-relevant information only in its reconstruction form: a map fitted to reproduce the target representation certifies one direction of Blackwell sufficiency, while task-loss stitching compares one decision problem through a fixed head, and a failure to stitch is no evidence against sufficiency | Proposed by the record on 2026-10-09 as an operational handle on the decision-relevant half of CLAIM-125, and qualified by the reading of Bansal, Nakkiran & Barak before it was filed: only reconstruction-fitted stitching certifies sufficiency, and only within the map class. | Active |
| CLAIM-130 v4 | Telling an interpreter about a communicative situation, do(I = a), is a different intervention from changing the situation, do(S = s): only a do(S) intervenes on the relations that would constitute an act, and in a vignette or rating study every manipulation is a do(I) | The owner proposed Pearl’s do() at U41, and A129 §1 drew the distinction. It recurs at A151, A191, A203, A214 and A218. CLAIM-127 is about where the index sits in the formalism; this claim is about what an experiment manipulates. The sharp edge: in a vignette or rating study every manipulation is a do(I). | Active |
| CLAIM-131 | A compatible family of sections of the event sheaf always glues, so where a communicative object lacks a global realization the obstruction lies in its supports or distributions, not in the event sheaf | The assistant at A125 §2 and A129 §2, after the owner’s U41 “double click on this”. It is the standard sheaf property of E(U) = ∏ O_x (Abramsky and Brandenburger). Granted, because it is elementary; it is used against TERM-002’s wording, not against CLAIM-038’s thesis, which version 2 restates to agree with it. | Active |
| CLAIM-132 v2 | Characters classify finite-dimensional representations of a finite or compact group up to isomorphism only over a field of characteristic zero; they forget the isomorphisms, fix neither the group nor a permutation action, and classify kinds, not tokens or positions | Standard representation theory, which the exchange states correctly with its main hypotheses (A194 §1, A198 §§2 and 4, A203 §§5–6, A218 §3.2). This entry adds the limits the exchange left out, and the exact link to Yoneda: a character is a counts-only relational profile, complete because the category is semisimple. Granted, because it bounds the owner’s analogy: priority for classifying kinds up to isomorphism, in the most favourable setting, and no further. | Active |
| CLAIM-135 v3 | Recovering latent structure from relational data is three achievements, reconstruction, identification up to stated ambiguities, and constitution of a communicative kind, and identifiability theory reaches the second at most | The assistant’s, at A207 §5 (three profiles) and A214 §1 (three problems, two warrants), kept as A218 §5’s five objects of inquiry. A214 asked for it as a THEORY; it is the record’s own distinction, so it is a claim. It answers QUESTION-001 in part, by naming a failure that question did not. It does not say identified factors are never kinds, or that the second step is open. | Active |
| CLAIM-140 | The October thesis replaces what a receiver can reconstruct with what the analyst’s probe system can identify as the test of what survives, and no turn argues the change | CLAIM-115 makes survival relative to “a receiving system”. The October thesis (A218, U60) makes it relative to “independently identifiable” distinctions, and A218 defines identifiability on the analyst’s probe system. The receiver is left in one sentence of A218 §8 and in Ch13.5. Filed by the record’s reading of A218; no turn of the exchange says it. It objects to CLAIM-139 as stated, not to its truth, and it is granted because it is a comparison of texts. | Active |
| CLAIM-141 v2 | Causal-loop consistency and sheaf contextuality are both local-to-global problems, but passing to distributions affects them oppositely: a loop with no deterministic solution has a distributional fixed point, while a model with no global section in its supports has no global distribution either | A161, after the owner’s U46, sharpened. A161 saw that a causal loop and a contextual model are “not the same”, but not that they run in opposite directions under passage to distributions, or why. Its parity pattern is LIT-278’s identification of Liar cycles with contextual support tables, which the record holds and has read (NOTE-251). A173 and A178 kept the three kinds of global consistency apart; A218 Ch10.9 keeps the feedback case. | Active |
| CLAIM-143 v3 | Local descriptions that disagree are not thereby incompatible: whether there is an obstruction can be assessed only relative to a specified class of admissible correspondences between their observations, independently validated and not admitted because they remove the disagreement | A164, after the owner’s U47, restated by A173, A178, A203, A214 and A218. Three classes of disagreement (coordinate difference, structural transformation, global obstruction) and an order of tests: fix and validate the correspondence, then ask whether the descriptions extend jointly. A173 proposed it as a design principle; it is a thesis of the line. The relativity example motivates it and is not evidence for it. | Active |
| CLAIM-144 | Inertial observers who disagree about temporal order differ in coordinates, not in a failure to glue: only spacelike-separated events change order between frames, and frames are global charts related by a group action | A164’s correction of the owner’s U47, which is standard special relativity, with two repairs. A164 left out the reading of the owner’s scenario whose answer is invariant (two passings of one marker). And it described frames as patches glued by a cocycle, which they are not: each inertial frame charts all of spacetime, and the frames are related by the Poincaré group. | Active |
| CLAIM-145 v4 | Trope analysis of the kind A155 proposes is Propp’s and Lévi-Strauss’s transformational analysis, whom the manuscript should cite as precursors | The record’s objection to CLAIM-147; no one raised it in the exchange. A155 presents TV Tropes as “the clearest large-scale empirical setting” for the structuralist side of the theory and names neither Propp nor Lévi-Strauss, whom the record reads as the direct precursors. The circularity half recurs in the exchange’s own controls (A178 Study B and Ch12.9), and A218 drops the control. The prior-art half is close to granted. | Active |
| CLAIM-146 | Recovering latent relational structure from an interaction matrix, with no privileged latent coordinates, is decades-old prior art, so the manuscript’s contribution cannot be that recovery | The owner’s prior-art objection at U58 to A207’s closing framing, conceded by A210 in its first sentence and extended by A214 to identifiability and cross-lingual alignment. It is the line’s third in-band prior-art retraction, after CLAIM-019 and CLAIM-100 → CLAIM-125. The concession holds for structure. It does not hold for individual topics, which are recovered only by privileging the nonnegative representation, and uniquely only under separability or anchor-word conditions. | Active |
| CLAIM-148 v4 | A matrix factorization is identified only up to an invertible change of latent coordinates, which weight decay narrows to rotations and nonnegativity to rescalings and permutations plus a data-dependent remainder; such a gauge is not a symmetry of the relational system, and automorphisms of the data act on the factors only when the factorization is identifiable | Drawn by the assistant at A207 §3, made explicit at A214 §6 and kept in A218 (§4.2, Ch5.4–5.9). Granted, because it is elementary, and the record already held its mathematics. The record adds the full list of invariants, the data-dependent freedom of nonnegative factorization, and why identifiability must come before automorphisms and characters. It does not say latent axes are meaningless, or that observed data have non-trivial automorphisms. | Active |
| CLAIM-149 v2 | A probe family that supplies a transformation’s training signal cannot also certify what the transformation preserves: preservation must be shown under probes that were not used to train it | The owner set the frame at U51 (“a useful case study … the projected GAN work”); A184 §§3–4 argued it, with its Experiment C and closing maxim, and A203 §30 and A218 Study 6 keep it. It carries CLAIM-011’s remedy from correspondences to training objectives. Kynkäänniemi et al. (CASE-041) is a documented instance, which the exchange did not know of. The documented support is one training case, in image generation, and one selection case, in translation (CASE-071). | Active |
| CLAIM-150 v2 | An ontology of intrinsically individuated objects with relational properties can reproduce the categorical and operational identifications, and the predictions, of a relational one, so identification underdetermines constitution | The exchange’s own guard, stated six times (A187, A191 §4, A198 §VI, A203 §35, A214 §13, A218 §13). The record adds the stronger, formal form from THEORY-032: the Yoneda lemma presupposes the relata. That suits the non-eliminative choice and gives elimination no support. The ontological thesis needs its own conceptual argument; the mathematics and the experiments cannot supply it. | Active |
| CLAIM-152 v6 | Any individuation built on sufficiency is relative to the target it is sufficient for: fix the outcomes differently and a different partition wins, so no boundary drawn this way is universal | Dual-filed from MOM-POS-001 (ADR-037). A sufficient statistic is sufficient for a target Y, so every partition chosen as minimal sufficient inherits Y. MOM’s example: fix the outcomes differently and “organism” wins instead of “animal”. In this record it is the standing caution on every boundary criterion filed beside it (CLAIM-154, CLAIM-161). It does not say boundaries are arbitrary, only that each is relative to a stated target. | Active |
| CLAIM-153 | Failure of a self to hold together across contexts is a monodromy around a cycle of contexts: any two locally consistent contexts glue, and the minimal model of the obstruction needs three | Dual-filed from MOM-CLM-165 (ADR-037). Model contexts (roles, personas, sub-agents) as a cover, and the offsets that reconcile neighbours as a cochain. A global section, one coherent self, exists exactly when the monodromy Φ around a cycle vanishes. Two contexts always glue, so compartmentalization needs a loop. The frustrated XY or Kuramoto energy finds the obstruction: its minimum is 0 exactly when Φ ≡ 0. Abelian case only; re-checked here. | Active |
| CLAIM-154 v3 | A candidate structure is worth naming as a unit when its effect-to-noise ratio outruns the Occam cost of keeping it: reify when d’² exceeds the log prior-to-posterior variance ratio, where the model with the candidate stays regular at the parameters that switch it off | Dual-filed from MOM-CLM-160 (ADR-037). By the Savage–Dickey ratio, ln BF(keep) = ½(d’² − Occam), so a direction, block or sector is real enough to name exactly when δ/ε > τ with τ² = ln(s²/σ²), the information the data added about it. In this record it prices the boundary tests for a combined form: a near-decomposable block (LIT-905) earns a name when its gap beats its Occam factor. Re-checked here in the conjugate case. Narrowed to candidates whose model stays regular where they are switched off; where it is singular the rule overcharges (CLAIM-188). | Active |
| CLAIM-159 v3 | The record’s rival accounts of will are claims about drive profiles in different cells: Ainslie’s interests are aggregate or emergent, the expected value of control is top-down, and will-organization is the maintained organization that governs how the drive profile changes | The assistant’s reading, offered in chat on 2026-10-11 and filed at the owner’s prompt. Ainslie’s will has no governor: the person is “just the resultant” of bargaining interests, which is aggregate, or emergent if resolve is a property only the recursion has. The expected value of control posits a dedicated specifying system, which is top-down. The will paper’s will-organization is the maintained organization of relations that decides which regime is effective, so it governs the drive profile’s changes over time. That is the owner’s point that “who drives” is not constant. | Active |
| CLAIM-164 v4 | What a spectral gap makes definite is the subspace of the cluster it isolates, not a single direction: the gap picks the object, and the object is a vector only when its own gap is wide | Dual-filed from MOM-CLM-144 (ADR-037). Under a perturbation δT, the subspace spanned by a cluster of singular values separated by a gap δ rotates by at most ‖δT‖/δ (Davis–Kahan), whatever happens to the vectors inside it. So the well-defined unit is the gap-isolated projector. Re-measured here. With CLAIM-154 it is a criterion: the gap picks the object, and the Occam factor says whether the gap is big enough. | Active |
| CLAIM-172 v10 | Mutual entrainment is a sufficient mark of a combined form, and marks it as one of peers: when each side adjusts the other’s timing the pair carries a collective variable neither has alone; one-way drive also makes a combined form, with a hierarchical architecture | The record’s reading in answer to the owner’s prompt of 2026-10-11, “connect extended self to entrainment”. Clark & Chalmers’ marks of extension are availability marks, and the coupling-constitution objection says coupling does not entail parthood. Mutual entrainment sidesteps the objection rather than answering it: it individuates a new system by its collective variable. It does not cover a passive store like Otto’s notebook, which is coupled across time by writing and reading, not by timing. | Active |
| CLAIM-175 v3 | A partner-dancing couple, while dancing, is one combined cognitive form on the extended-mind thesis’s own terms, more clearly than Otto and his notebook, and merits a name of its own | The owner’s reply of 2026-10-11 to the dancers objection, which they had not read: “under extended mind thesis, I’d argue that the pair, while dancing together, comprises a combined form that merits some privileged nomenclature of some kind”. Clark & Chalmers endorse socially extended cognition, and the objection’s own source calls the interaction an autonomous process. So the objection fails against the combined form and survives only as a question about selfhood. The name is not yet chosen. | Active |
| CLAIM-177 v2 | In the record’s exchanges with collaborators who keep no memory, the argument repeatedly loses identity: concepts are redefined silently, objections and readings come back as though new, and the thesis changes without anyone arguing for the change | Stated as a finding in ADR-032, from seven readers coding the will exchange, and found again in the What Survives Translation? exchange by the workbench reconstructions of 2026-10-09 and 2026-10-10. Filed on 2026-10-11 as the first premise of the manuscript. Two exchanges with one owner and one assistant family, so Proposed. | Active |
| CLAIM-188 v4 | Where the model with a candidate structure is singular at the parameters that switch the candidate off, with real log canonical threshold λ below d/2 and multiplicity m, the reification rule’s Gaussian Occam term overcharges keeping the candidate by (d/2 − λ) log n + (m − 1) log log n to leading order, so near the threshold the rule prunes candidates the Bayes factor keeps, and its derivation holds only where that model stays regular | A narrowing of CLAIM-154, filed on 2026-10-11 from a synthesis review that found the record already held the readings that limit it. CLAIM-154’s rule prices a candidate with a Gaussian Occam factor, which is exact in the conjugate case it was re-checked in. The candidates it is meant for (blocks, sectors, couplings with hidden structure) are often singular where they are switched off. There THEORY-087 puts the penalty at λ log n − (m − 1) log log n, not (d/2) log n. On CASE-152’s product model the rule prunes, near the threshold, candidates the exact Bayes factor keeps. CLAIM-154 is narrowed to models that stay regular at the switch-off. | Active |
| CLAIM-194 v4 | A gap or coupling criterion cannot tell a boundary a system produces from one imposed on it: a membrane the cell makes and a beam joining two pendulums pass alike, so the block test cannot by itself supply the individuality minimal agency needs | A counter to the block criterion and to the agency test’s first condition, found by two separate reviews of the unlinked THEORYs in the third synthesis pass. It grants the target-relativity CLAIM-152 states. Its point is different: with the target fixed, a near-decomposability gap is a statistic of coupling, and coupling is the same whether the system made the boundary or something else did. THEORY-072 and THEORY-1119 place the line at production and self-distinction instead. No case has been measured: the point is that a coupling statistic has no term for who made the coupling. | Active |
| CLAIM-195 v2 | For an argument, the constraint set that persistence is relative to is fixed by an amendable decision, not discovered: the record stipulates what counts as the same claim persisting, which makes the choice explicit without making it non-arbitrary | Files the point the workbench of 2026-10-11 (214308) left as notes on CLAIM-185 and CLAIM-181. Viability is relative to a constraint set the theory does not supply (THEORY-134), and the will-organization line leaves “who fixes the constraint set” open (CLAIM-079, ARG-007). For an argument the record fixes it by decision (ADR-032 and its successors), so the set is explicit and amendable. That shows how one system fixes its set; it does not show the choice is non-arbitrary. | Active |
| CLAIM-197 | Sections over contexts that do not overlap always glue, so a sense that differs between disjoint contexts is not a gluing failure: a failure needs an overlap carrying sections that disagree, and which families count as covers decides whether anything glues | Dual-filed from MOM-CLM-088 (ADR-037). The sheaf condition says a family of sections that agree on overlaps glues to one global section. Where two contexts do not overlap, agreement is vacuous and they glue. So “tall”, which takes one threshold for people and another for trees, is one global section with the comparison class part of the meaning, not a failure of gluing. A failure needs contexts that overlap and carry sections that disagree there. Which families count as covering is the piece that decides whether anything glues, and a sheaf picture of meaning that does not state it has decided nothing. | Active |
| CLAIM-199 v3 | Blackwell’s order bounds what a rendering makes possible for any receiver, and a given receiver’s access is usable information relative to the rules it can apply, which a garbling can raise for that receiver but never above what the source makes possible | The record’s reconciliation, on 2026-10-10, of CLAIM-225. Both standards are kept, in different roles: Blackwell’s order is the ceiling, and TERM-034’s interpreter-relative fidelity (“relative to an interpreter and its available side information”) is the receiver’s. CLAIM-087’s improvement is a gain in usable information. The nearest held reading is THEORY-176’s “Its loss bounds r’s best attainable risk for that problem from above”, for restricted rules. The example is checkable; whether real receivers show such gains is a proposal. The usable-information literature was not held when it was filed; Xu et al.’s V-information is now read (note of 2026-10-21). It does not say which rule class real readers have. | Active |
| CLAIM-205 v3 | Functional and relevance-theoretic accounts of translation, as Nida, Nord and Gutt state them, need not fix one context or a static stance profile of the rendering | From the interlocutor’s reading of PR #121 and its reconciliation, relayed by the owner on 2026-10-12. It accepts CLAIM-202 as the line’s principal empirical thesis and objects to its rival set. Narrowed and promoted on 2026-10-30, when Nida, Nord and Gutt were read; the baseline it proposed is CLAIM-504. | Active |
| CLAIM-207 | The transports of Propositions 1–2 and of D_obs act on judgement outcomes, not texts, and for any one source–target pair a constant kernel transports any overlap-consistent target, so they constrain a translation only once one kernel family is fixed across many utterances and derived from the text channel | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. The manuscript’s kernels K_C map readers’ judgements to readers’ judgements, while a translation is a channel on texts, T(v | u), and TERM-008 records that the two levels are never formally related. For one source and any overlap-consistent target, the constant kernel makes D_obs zero and satisfies naturality. Granted, because it is elementary. It does not say CLAIM-121 or CLAIM-070 is false; it bears on what they are used to support. | Active |
| CLAIM-208 v2 | The compositional predictions are upper bounds whose constants cannot be estimated from serial-reproduction data in a metric fixed beforehand, so the compositional half of the success criterion cannot fail | Found in the record’s audit of the line on 2026-10-10 (empirical lens); no turn of the exchange raises it. The recursion e_n ≤ (∏κ_j)e_0 + Σε_i∏κ_j is a theorem once its constants are the true ones, so a chain cannot depart from it; it can only show a constant was misestimated. A sensitivity κ_i belongs to a reteller’s kernel and needs many retellings of each of several inputs at every generation, where a chain gives one. And CLAIM-059 says amplification “needs a metric other than total variation” (now held as CLAIM-267), so the regime depends on a metric chosen afterwards. CLAIM-078 records that the compositional half was dropped from the manuscript, not that it cannot fail as stated. It does not say error propagation is unimportant. | Active |
| CLAIM-210 v2 | Sharing a kind and being a rendering are different relations: kind-sharing is symmetric and says what is to be preserved, while fidelity belongs to a transport from a given source, so an utterance of the same kind made independently of the source shares its kind and has no fidelity to it | The record’s reply, on 2026-10-10, to CLAIM-246. The October thesis puts fidelity in what persists “through those transformations”, and TERM-043 makes fidelity the distortion profile of a transport. So the objection’s independent utterance I shares the source’s kind and has no fidelity to it, since no transport relates them; the translation T has both. T’s provenance is a fact the transport clause supplies, not something the kind criterion must recover. CLAIM-002’s continuity of transmission concerns the identity of a work, which TERM-040 keeps apart from the kind. Active, because it is read off the record’s own texts. It does not say judges track descent. | Active |
| CLAIM-211 v2 | Read as worded, the manuscript’s thesis and the October thesis give rival answers to what survives, which come apart in both directions on the cases of the receiver objection, yet the record links them by complements and scopes the October thesis to a question its fidelity clause does not stay inside | Found in the record’s audit of the line on 2026-10-10 (structure lens); no turn of the exchange raises it. CLAIM-140 shows that the receiver’s test and the analyst’s identifiability come apart in both directions, and stops at “It does not say the October thesis is false”. On those cases CLAIM-115 and CLAIM-139’s fidelity clause give opposite verdicts on what survived, yet the two are joined by complements, which says they answer different parts of one question and do not compete, and CLAIM-139 answers only QUESTION-029. Granted: it is a comparison of texts and of the record’s relations. It does not say which criterion is right. | Active |
| CLAIM-214 | The distribution-over-situations criterion compares each language’s own listener posterior, so it needs no correspondence of alternative sets; that a literal rendering can fail it is the criterion detecting a lost implicature, and a target language may admit no rendering that passes | The record’s reply, on 2026-10-10, to CLAIM-236. CLAIM-111’s criterion is P_o(z | c_o, u_o) ≈ P_t(τ_z(z) | c_t, u_t). On the rational-speech-act model each posterior is computed with its own language’s alternatives, so comparing the posteriors needs no map between the alternative sets. The objection’s worked case is right, and it shows the criterion rejecting a rendering that keeps the literal content and loses a scalar implicature. Active, because it is read off the criterion’s form and checked by arithmetic. It does not say the model is right or that the criterion applies to poems. | Active |
| CLAIM-216 v2 | A thesis that conjoins relational constitution, statistical recovery, transport and receivers’ recovery is defeated whole by any one of its empirical findings, though its clauses can hold or fail apart, so the line is better put as separate theses, each with its own defeat condition, resting on one another only where one is a premise of another | The interlocutor’s objection at U62 (A240) to the October thesis (CLAIM-139) and to the record’s restatement of it (CLAIM-204), given as the reason for superseding CLAIM-139: “Separates ontology, statistical recovery, and empirical transport instead of making them rise or fall together”. The record’s replies of 2026-10-10 had already separated the receiver thesis and the incremental thesis; the restatement joined the four clauses again under one defeat condition. Active since 2026-10-30; CLAIM-204 concedes it. It says what would answer it, and does not say an integrative statement is useless. | Active |
| CLAIM-218 | The task-paired risk difference the record uses in place of Blackwell’s order, D_Q = sup_q |R_q(U) − R_τ(q)(V)|, is a different quantity: it reduces each risk set to one number, needs the losses of paired tasks on one scale, and its absolute value counts improvement as distortion | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. CLAIM-050 is stated in Blackwell’s order, and the record’s decision term is A86’s D_Q. A risk per task needs a prior or a minimax summary, where Blackwell’s order compares whole risk sets. Subtracting the risks of two tasks needs their losses on one scale, which nothing supplies. The absolute value makes D_Q symmetric, against CLAIM-106. Granted, because each point is elementary. It objects to CLAIM-106 by undermining the measure meant to realize it, not CLAIM-106’s truth, and it does not say a decision term is unworkable. | Active |
| CLAIM-219 v4 | A change in the global compatibility of a fixed scenario is either a change in contextuality proper, which the behavioural data read show none of, or a change in overlap consistency, which is ordinary context dependence and moves by at most 2ε when each context moves by ε | Found in the record’s audit of the line on 2026-10-10 (structure lens); no turn of the exchange raises it. Dzhafarov, Zhang and Kujala (LIT-264) find no contextuality in five kinds of behavioural data, and CLAIM-125 reports that 34 of 90 language systems signal too much to be contextual. If pragmatic data are noncontextual as a rule, CLAIM-105’s defeat condition is met by default; what is left to change is overlap consistency, which is the “trivial sense of contextuality” and is fixed by the local distributions. The only instance of the headline is the stipulated CASE-037. Among the claims LIT-264 is cited only by CLAIM-041, not by CLAIM-105. The objection is open; it does not say a contextual pragmatic data set cannot exist. | Active |
| CLAIM-222 v2 | No design in the programme includes an interlingual translation, and the defeat conditions are disjunctive, so English retellings and model chains could settle a thesis about what survives translation | Found in the record’s audit of the line on 2026-10-10 (empirical lens). The workbench entry for 2026-10-10 notes that the title’s question “is left with no translated text in the programme”; no CLAIM says it, and none draws the consequence. Every stimulus set the designs name is English, or names no language; Villon→Henley and Marot→Hofstadter never enter a design. CLAIM-115’s defeat condition ranges over “translations, retellings or cross-modal renderings”, so a result on English paraphrase alone can meet it. It does not say intralingual results are irrelevant. | Active |
| CLAIM-223 v2 | Whether a distinction survived is fixed by what the receivers can recover, and whether it can be shown to have survived is fixed by what the analyst’s probes can identify, so the manuscript’s thesis and the October fidelity clause, read so, answer different parts of one question | The record’s reply, on 2026-10-10, to CLAIM-211, and the argument CLAIM-140 asked for: “the thesis now needs both conditions, or an argument for dropping one”. It keeps both, in different roles. On CLAIM-140’s cases: a distinction identifiable but unusable did not survive for those receivers; one usable but unidentifiable survived without evidence of it. Read so, complements is right on content. A proposal: it is a reading of CLAIM-139, not what A218 says. | Active |
| CLAIM-225 v4 | Blackwell’s order measures what an ideal decision-maker could do, not what a given receiver can reconstruct, and the line’s claims that a rendering can improve access describe garblings that real receivers do better with, which is the shape of the Blackwell thesis’s own defeat condition | Found in the record’s audit of the line on 2026-10-10 (formal and structure lenses); no turn of the exchange connects the two claims. A generator that sees only the text makes its image a garbling of the text about the situation, so by Blackwell’s theorem the image is no better for any decision. CLAIM-087 says such an image can improve access. Either that effect is impossible, or judged access is not Blackwell informativeness, and then CLAIM-050’s standard is not the one CLAIM-115’s receiver and its defeat condition use. It meets the shape of CLAIM-050’s defeat condition, not its letter. It is distinct from CLAIM-140, which sets the analyst against the receiver: this sets the ideal receiver against an actual one. | Active |
| CLAIM-226 v2 | The defeat tests pool unnamed judges and treat their disagreement as noise, though the theory makes the act partly constituted by its audience; for historical sources there is no source audience at all, and for interlingual ones population differences are read as distortion | Found in the record’s audit of the line on 2026-10-10 (empirical lens); no turn of the exchange raises it. A theory on which the act depends on its audience predicts structured variation between judges, so averaging a convenience sample measures an unnamed population’s act. The source term of D(τ) for Villon, Henley or Marot can only be a modern reading, and for a live interlingual case the source and target judges are different communities, so the distance confounds population with transport. CLAIM-074 says fidelity differs across interpreters, as a thesis; it is not applied to the tests. It does not say cross-population fidelity is meaningless. | Active |
| CLAIM-227 | No validated measure of footing or stance exists in the record, and the one repeated assignment of footing, the analyst’s own, changed between passes | Found in the record’s audit of the line on 2026-10-10 (empirical lens); no turn of the exchange raises it. Footing and stance are the observables the central theses turn on, yet the only footing judgement made twice of the same texts, the assistant’s labelling of its own four refrains, changed between A38 and A39 without comment (CASE-012), and no design gives judges a definition, a response format, a reliability target or a validation against a known contrast. Granted, because it is a reading of the record. It does not say footing cannot be measured. | Active |
| CLAIM-230 v3 | Blackwell comparison needs the state each rendering is about, which natural texts do not supply, so a decision measure is fixed by whoever labels the state, and it orders translation procedures, not single renderings | Found in the record’s audit of the line on 2026-10-10 (empirical lens); no turn of the exchange raises it. Testing Blackwell’s order needs the joint law of the situation and the signal. For natural texts the situation is what interpretation recovers, so it comes from the stimulus design, the analyst’s labels or the judges, and decision-relevant information is measured against whoever fixed it. An experiment is a family of distributions, one per state, so a single rendering of a single poem is not one. CLAIM-050’s defeat condition, “one rendering is a garbling of another”, is then not well typed. It does not say a design-based state is illegitimate. | Active |
| CLAIM-231 | On observed responses, a rendering that keeps the response distribution of each order of two framings within ε of the source’s, under an outcome correspondence, keeps the observed order effect within 2ε, a bound identified from data, while the intertwining identity bounds it only through defects of an unidentified state model | The record’s repair, on 2026-10-10, after CLAIM-253. The commutator identity of the manuscript’s §9 holds, and its defects are not identified from data, by the objection’s hidden-bit construction. What can be estimated is the response distribution under each order, so the bound is restated on those: a special case of observational distortion with contexts indexed by framing order. Active, because it is elementary and checkable. It does not say the state-model account is wrong, and it does not identify the defects. | Active |
| CLAIM-232 v3 | Human ratings of stance or footing and human ratings of fidelity of the same renderings share rater construal, scale use and a general impression, which a machine similarity score shares with neither | Found in the record’s audit of the line on 2026-10-10 (empirical lens); no turn of the exchange raises it. Ratings of stance and footing share rater construal, scale use and the reading of one stimulus with ratings of fidelity, and an embedding score shares none of that. The manuscript’s split annotators (§10, as QUESTION-005 reports) remove the shared rater, not the shared construal. It is a second reason, beside CLAIM-233, that the central tests are easy to pass. Open, because a design could answer it. | Active |
| CLAIM-233 v4 | The central theses’ defeat conditions pit them only against embedding, propositional or surface similarity, and two rivals the record holds, functional equivalence as Nida states it and a proposition with its illocutionary force, also predict that judged pragmatic observables beat text similarity | Found in the record’s audit of the line on 2026-10-10 (structure and empirical lenses); no turn of the exchange raises it. Every thesis-level defeat condition in the line has one form: human judgements of fidelity or of shared kind are predicted as well by a text-similarity score as by the theory’s measures. CLAIM-023 says the pragmatic point is not new, and a functional-equivalence account as Nida states it, or a proposition with its force, passes the same test; Gutt’s relevance-theoretic account, as his thesis states it, does too (CLAIM-501). Granted, because it is read off the texts. It does not say the theses are false, only that their stated tests cannot separate them from the positions they claim to improve on. | Active |
| CLAIM-235 v3 | The line’s proposed quantities have no finite-data estimators: plug-in signalling from one or a few occurrences per context is positive in expectation when the true marginals agree, so the contextual fraction is undefined on raw tables, and deficiency over text-valued renderings has no estimator | Found in the record’s audit of the line on 2026-10-10 (formal and empirical lenses); no turn of the exchange raises it. The plug-in signalling of two empirical marginals is positive in expectation when the true marginals agree, so raw tables signal, and the contextual fraction is undefined on them. With one occurrence per context, a non-signalling rank-2 system gives Δ of 0, 2 or 4, with expectation 2: the values NOTE-654 finds in 51 of the 90 systems behind CLAIM-125’s “69 of the 90 systems signal”. The data are author-assigned corpus senses, not judgements. Deficiency over text-valued renderings has no estimator. It does not say signalling is rare in pragmatic judgements, where order effects are themselves signalling. | Active |
| CLAIM-237 v2 | The first open problem of directed transport is not yet posed: a contextual model is a menu of incompatible experiments, and under the natural order on menus any state-independent classical simulation is dominated automatically, so what is open is only the converse or a deficiency bound | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. Blackwell’s order compares experiments, each a family of distributions over one parameter. An empirical model has no parameter, and if it is contextual it has no joint distribution, only one per context. Posing CLAIM-125’s first part needs models indexed by situations and an order on menus of experiments. Under the natural order, the preservation direction is automatic for a classical simulation that does not depend on the situation. Granted, because the argument is elementary. It narrows what is open; it does not close it. | Active |
| CLAIM-238 v2 | Many of the line’s defeat conditions cannot in practice be met: the comparative ones are null results with no margin over an observable set the thesis may re-choose, and the possibility theses’ are universal negatives that no finite study establishes | Found in the record’s audit of the line on 2026-10-10 (empirical and structure lenses); no turn of the exchange raises it, though CASE-029 records the decision rules that were dropped. Three shapes of defeat condition cannot be met. “As well as” is a null result, which needs an equivalence margin and power, and no entry states either. The observables are “not fixed in advance” (CLAIM-115). And the “can” theses are defeated only by “never” or “always”, so one construction confirms them and no study refutes them, while what the main thesis needs from them is prevalence and magnitude, which none states. Granted: each point is read off the texts. It does not say the theses are false or untestable in principle. | Active |
| CLAIM-239 | A defeat condition that says something cannot be done is met by an argument that it cannot, not by a record of failures, so the admissibility and correspondence theses can fail by their own conditions, though no study the programme runs can make them fail | The record’s reply, on 2026-10-10, to the fourth point of CLAIM-238. luria.yaml’s blurb for defeated_if is “what would defeat the thesis — a kind of result or argument”. CLAIM-077’s condition and CLAIM-143’s second disjunct (“QUESTION-005 answered negatively”) are met by a showing that the distinctions or correspondences cannot be fixed independently. What the objection gets right is that no finite study meets them, so the programme’s experiments do not test these two theses; argument does. Active, because it is read off the rule. | Active |
| CLAIM-241 v2 | Partial constitution by uptake makes competent participants’ uptake a defeasible standard of a communicative kind, not the criterion: where the act’s other constituents, such as its institutional conditions, diverge from how even informed participants take it, their verdicts can be wrong, and a standard must say whose competence counts, for which class of acts, and how divided verdicts are combined, which a majority does not | The interlocutor’s first refinement at U62 (A240), with its row on CLAIM-217, pressed at full strength. CLAIM-217 moves from “partly constituted by … expected uptake” to “the judges … are the criterion”. Partial constitution gives uptake a vote, not the last word, so where the act’s other constituents diverge from informed uptake the verdicts can be wrong. The claim also names no rule for combining divided verdicts and no class of acts. Open: answering it means saying whether a defeasible standard re-opens the horn CLAIM-217 closed. It does not say uptake is not a standard. | Active |
| CLAIM-243 v2 | Read as description, the manuscript’s thesis is close to true by definition; read as a criterion, it is a schema until the decision family Q is fixed, and its descriptive defeat condition can test neither reading | Found in the record’s audit of the line on 2026-10-10 (structure lens); no turn of the exchange raises it. A distinction no receiver can recover has not survived for anyone, so the descriptive reading is near-analytic. The normative reading leaves which distinctions count to the task family Q, which CLAIM-115’s summary calls “normative and contestable”. The defeat condition fixes observables the thesis declines to fix, and tests them descriptively: CLAIM-085’s split of normative from descriptive, applied to the thesis rather than to model judges. It does not say the thesis is empty. | Active |
| CLAIM-245 | Under Contextuality-by-Default, a deterministic context-wise recoding can make a noncontextual signalling source maximally contextual, or turn a contextual source into pure signalling, so per-content signalling is not monotone under such maps and the quantity to bound is joint overlap discrepancy | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. Two worked rank-2 systems answer NOTE-654’s open question negatively: THEORY-177’s per-content signalling can rise under deterministic recodings, once the source signals, and CbD contextuality can be created or removed by them. By data processing, the joint overlap discrepancy cannot rise, so that is the quantity CLAIM-125’s second part should name. Granted, because the examples are elementary. It does not say THEORY-174 is wrong, which is about no-signalling models. | Active |
| CLAIM-248 v4 | The founding stimuli (Villon, Henley’s Villon, Hofstadter’s Marot) and commentary on them are likely in language models’ training data, and what a context does to one model need not be what it does to another, so a model’s reading of their footing may be recall, and a directional match in one model may not hold in the next | Found in the record’s audit of the line on 2026-10-10 (empirical lens); no turn of the exchange raises it. Agreement in direction is what a model trained on human descriptions of teasing and reproach would show anyway, and Villon, Henley and Hofstadter’s Marot are likely in training data, so a model’s “interpretation” of them may be recall. ARG-008 and CLAIM-085 already bound what model results show about human pragmatics. What is new is that CLAIM-058’s validity bar is too low, and the contamination point. Minor. | Active |
| CLAIM-249 | Comparing characters across realizations needs one group identified on both, which is fixed only up to automorphism, and automorphisms permute the irreducible characters, so “the same character” is relative to a chosen correspondence: the collapse problem again, at the level of the symmetry group | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. To say a visual realization has the same character as a spoken one, the same group element must be named on both sides. Changing that identification by an automorphism α turns χ into χ∘α, and for the cyclic group of order 3 the automorphism g ↦ g² swaps the two nontrivial characters. The transformations the line studies form a semigroup, so the group is a symmetry group the analyst chooses, with its action on each medium fixed independently: CLAIM-011’s anchoring once more. Granted, because the argument is elementary. CLAIM-132 and TERM-041 hold neighbouring limits, not this one. | Active |
| CLAIM-252 | The account does not say which distinctions a translation ought to keep: it says how to tell which ones a rendering kept for stated tasks and receivers, and what ought to be kept is set by the purpose the translation serves | The record’s reply, on 2026-10-10, to the criterion horn of CLAIM-243. The manuscript calls the choice of observables and decision tasks “normative and contestable (§11)” (CLAIM-115’s summary), and CLAIM-085 separates a normative theory of fidelity from a descriptive one. This disclaims the first for the account, so the thesis is not a schema awaiting Q: Q comes from the translation’s brief. Active, because it is a statement of what the account claims. Purpose-relative translation norms (skopos theory) are the tradition that states the normative part; they are not held in the record. | Active |
| CLAIM-253 v2 | The intertwining defects are defined on unobservable interpretive-state spaces, so they are not identified from judgement data, and the commutator identity bounds observed order effects only with a further, unstated readout-intertwining defect | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. The commutator identity is correct, but Φ, A and A′ act on interpretive states. CLAIM-046 says hidden-state models that give identical observations can differ, and a worked case shows two such models with defects 0 and the largest possible, so the defect is not a function of the data. What is observed is responses, and the identity reaches the observed order effect only through a readout defect between outcome spaces, which no draft names. It is distinct from CLAIM-011, which is about collapse: this is about identification. | Active |
| CLAIM-256 | D_obs sums over source contexts only, so a target context outside the image of τ appears in no term: a rendering that adds a relation pays nothing, and a change of cover registers only as loss | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. L_obs and D_obs are sums over source contexts, so a target context that is not the image of one appears in no term. The line says interpreters add relations (CLAIM-076) and that a transport can add a distinction (CLAIM-087), and D_obs is the one component with a formula (CLAIM-128). Granted, because it is read off the definition. It does not say no other component could catch an addition, or that additions are distortions. | Active |
| CLAIM-257 v3 | Observational distortion should be summed over the contexts both covers can host, with the target’s new questions asked of the source too, and the questions only one side can decide reported as a separate change of cover, so that a rendering that adds a relation pays for it | The record’s repair, on 2026-10-10, after CLAIM-256. D_obs sums over source contexts only, so a target context outside the image of τ is free. Asking the target’s new question of the source, where its readers can answer it, puts it in both covers, and an addition then costs. Questions only one side can decide are a change of cover, which CLAIM-201 makes the line’s headline; they are reported, not summed. A proposal: the restatement is a definition, and whether its added term predicts anything is the defeat condition. It does not say additions are distortions. | Active |
| CLAIM-259 v2 | For report fidelity, the decision term should be the positive part of the risk increase on the same decision problem, with losses in [0, 1] and a stated prior; so restated it is directed, counts no improvement as loss, and vanishes for every problem and prior exactly when the rendering is at least as informative as the source in Blackwell’s order | The record’s repair, on 2026-10-10, of A86’s D_Q after CLAIM-218. Define D⁺_Q(U → V; π) = sup over q in Q of [r_q,π(V) − r_q,π(U)]⁺, with r the Bayes risk under the prior π. It is directed and blind to improvement. With Q all finite problems and π all priors, it is zero exactly when V is at least as informative as U in Blackwell’s order, by the Bayes form of Blackwell’s theorem for finitely many states. A86’s D_Q, with the identity on tasks, is its symmetrization. Under report fidelity (CLAIM-212) the paired task is the same task, so no scale between tasks is needed. The mathematics is checkable; the claim that this is the right decision term is a proposal. It does not say Q is fixed. | Active |
| CLAIM-260 | Approximate transports compose into a category only if the distortion obeys a triangle inequality and later kernels are nonexpansive, so the semigroup claim’s “category or semigroup” holds for exact kernels, and for approximate ones only under those conditions | Found in the record’s audit of the line on 2026-10-10 (formal lens); no turn of the exchange raises it. TERM-008’s founding sense is a transport that gets “within some eps”, and CLAIM-106 makes fidelity graded. Kernels always compose, but the composite of an ε₁-transport and an ε₂-transport is an (ε₁ + ε₂)-transport only if the distortion obeys a triangle inequality and the second kernel is nonexpansive. In total variation both hold. QUESTION-017 holds the triangle inequality open and does not tie it to the category claim. Granted, because it is elementary. It does not say the category claim fails for exact transports or in total variation. | Active |
| CLAIM-261 v2 | Synchronization of an agent’s interests is desirable, but not necessary for acting as one: internal conflict shows a human agent acting while its interests stay divided | The owner’s answer to QUESTION-078. A human agent who acts against a standing temptation acts as one agent while its interests stay divided, so synchronization is not what acting as one consists in. Synchronization is still better when it is available: nothing has to be overridden, and CLAIM-162 says that is why flow is effortless. | Active |
| CLAIM-264 v2 | Two objects can agree on every probe in a restricted family without being isomorphic, so equivalence under a probe family is coarser than identity unless the family is rich enough | The general content of CLAIM-142, filed alone under ADR-040 so that it does not rest on CLAIM-046 and CLAIM-011, which are about pragmatic identity. The restricted Yoneda functor is fully faithful exactly when the probe family is dense. A strong generator makes it conservative, which is weaker: a morphism the probes see as invertible is invertible, but objects with isomorphic profiles need not be isomorphic. Matching every probe’s marginal leaves the joint unconstrained. The evidential rule is CLAIM-322’s. | Active |
| CLAIM-265 v3 | Local descriptions that disagree are not thereby incompatible: whether they obstruct a joint description is decided only relative to a specified class of admissible correspondences between their observations, and a correspondence admitted only because it removes the disagreement decides nothing | The general content of CLAIM-143, filed alone under ADR-040 so that the order of tests does not rest on CLAIM-011, CLAIM-004 and CLAIM-035, which are about translation. Disagreement between local descriptions sorts into a coordinate difference, a structural transformation or a global obstruction, and the sort cannot be made until a class of admissible transition maps is given. Inertial frames (CASE-039) show disagreement with no obstruction once the maps are known. | Active |
| CLAIM-266 v2 | A family of probes that supplies an optimized system’s training signal cannot also certify what the system preserves: optimization pushes toward whatever the probes reward, including what they cannot see, so preservation must be shown under probes not used to train it | The general content of CLAIM-149, filed alone under ADR-040 so that it does not rest on CLAIM-011’s account of correspondences in translation. Training against a probe family pushes a system toward whatever the family rewards, including differences it cannot see, so the family is not a certificate of what was preserved. CASE-041 is a documented instance: a Projected FastGAN trained against ImageNet features matches StyleGAN2’s FID, also computed in ImageNet features, while doing worse in CLIP space and with human judges. | Active |
| CLAIM-267 v3 | Per-step discrepancies between a chain of maps and a reference chain compound through the sensitivity of the later steps, so the same local error can be damped, accumulated or amplified, and closeness at every step can coexist with large end-to-end divergence | The general content of CLAIM-056, filed alone under ADR-040 so that the line-neutral recursion does not rest on CLAIM-106’s account of fidelity. It is elementary: with e_(i+1) ≤ L_i e_i + ε_i, the end-to-end error is bounded by the discrepancies weighted by the later Lipschitz constants. Three regimes follow. For stochastic kernels in total variation, contraction coefficients do not exceed one, so amplification needs another metric or a nonlinear, adaptive state. | Active |
| CLAIM-268 v2 | Model stitching certifies an order of information only in its reconstruction form: a map fitted to reproduce the target layers shows the source representation is at least as informative for every decision on the label, task-loss stitching compares one decision problem through a fixed head, and a failure to stitch is no evidence against sufficiency | The general content of CLAIM-126, filed alone under ADR-040 so that the result about stitching does not rest on CLAIM-050’s account of fidelity. Reconstruction-fitted stitching makes the target a garbling of the source given the label, which certifies one direction of Blackwell sufficiency (THEORY-176). Task-loss stitching (LIT-850) compares one decision problem through a fixed head, orders neither representation, and is not invariant under reparametrisation. In both forms a failure says only that no map in the class works. | Active |
| CLAIM-269 v5 | A regularized linear readout can tell apart only representations that differ in normalized kernel, and kernels fix a representation only up to the symmetry of what is observed, so no such readout supplies a distinction beyond that symmetry | The general content of CLAIM-193, filed alone under ADR-040 so that the linear result does not rest on CLAIM-142, whose realist reading is about communicative identity. What a regularized linear readout decodes is a function of the normalized kernel (THEORY-008). Kernels fix a representation only up to the symmetry of what is observed (THEORY-004, THEORY-723). An inner product beyond that is a stipulation (THEORY-018). And spectral degeneracy does not identify the symmetry (THEORY-019). These are proved results for learned representations. | Active |
| CLAIM-270 v2 | Retaining information about where a Markov chain started and staying close to the starting distribution are different properties: a chain can forget its initial state while its distribution stays far from where it began, so convergence is not preservation and losing information about the origin is not degradation | The general content of CLAIM-081, filed alone under ADR-040 so that the distinction does not rest, through CLAIM-056, on CLAIM-106’s account of fidelity. I(U_0; U_n) and D[P(U_n), P(U_0)] answer different questions. A contractive chain loses information about its initial state while converging to a stationary distribution that can be far from the start. The data-processing inequality bounds the first and says nothing about the second. | Active |
| CLAIM-272 v2 | Giving every member an equal budget of actions does not equalize their influence: coordination is one route, letting a member’s plan direct other members’ actions, so a cap on self-allocation constrains action and not authority | A8 §3 on the owner’s r/place case. Every account had the same cooldown, a ban on self-allocation at the level of pixels, yet “a participant who creates a successful design template might have almost no direct pixel- writing capacity beyond any ordinary user, yet exercise enormous influence”. A8: “Reddit’s software imposed a cooldown and common action budget, but did not give participants equal effective influence.” It qualifies CLAIM-285: the budget constrains moves, and endorsement moves authority. It does not say the inequality is illegitimate. | Active |
| CLAIM-273 v6 | A maintained r/place artwork copied from an off-canvas design is a dissipative structure in Prigogine’s structural sense, order held only by a sustained flow of repair against rival coalitions and against unaffiliated placement whose rate falls over the event, but its order is imported from the design and not born of an instability | The owner, on reading Wu and Silva’s finding that lasting artworks are those whose coalitions keep working under continual overwriting: “sounds like there’s likely a connection to dissipative structure here”. It holds for half of Prigogine’s criterion (NOTE-424): an open system kept from the state it would drift to by a sustained flow, here of placements. The flow works against two sources of corruption. One is rival coalitions. The other is unaffiliated placement, a real decay whose rate falls over the event (version 2, the owner’s correction, CLAIM-274). It fails for the other half, since a copied artwork’s order comes from its design, not from an instability (CASE-079; Adams et al. corroborate). No thermodynamic quantity is defined. | Active |
| CLAIM-275 v2 | An intervention can come before the interpretation it makes available, so in an organization of processes meaning, policy and influence can co-evolve, and none of them is upstream of the others in every case | A4 §6, on the record’s two accounts of emotion, Frijda’s appraisal upstream of action readiness and Barrett’s construction, and the owner’s two replies at U5: “yes, exactly” to “meaning, policy, and influence can co-evolve”, and “so much yes” to “An operator may act not because it already possesses an interpretation, but because its intervention creates the conditions under which a particular interpretation becomes available.” The first filing left both out. It does not say interpretation never comes first. | Active |
| CLAIM-277 v4 | Durable authority among an organization’s processes need not be a primitive: trust can be the temporal regularity of endorsement that policies earn by being right often, and the same loop entrenches whatever gained influence early | The owner’s objection at U5 to A4’s call to keep “persistent authority structures” distinct from “transient endorsement updates”: “I’d expect persistent authority to be an emergent property here as ‘right a lot’ policies become distinguished into ‘trusted’ policies.” A5 granted it. Momentary endorsement, established trust and institutionalized authority are regimes of one process, set by how slowly endorsers forget. A5 added the converse: the same loop turns an early lead into durable authority. The claim does not say which of the two a given organization does. | Active |
| CLAIM-279 v5 | Whether an intervention stabilizes or destabilizes a pattern is relative to a policy and a frame, so denoiser, critic and re-noiser are regimes an operator falls into, not kinds of operator | The owner at U3 proposed operators that may “renoise the region it has influence over e.g. because it disagrees with the direction of the current work”, and at U5 that named operator types are “just different regimes in the dynamics of our general process”, with niches emerging. A5 granted it. A8 grounded it in the owner’s r/place case: restoring a pixel is denoising for the group whose image it is and destruction for the group overwriting it. The claim does not say specialization always emerges. | Active |
| CLAIM-280 v2 | A pattern can persist while every constituent is replaced and some constituents work against it, as a high-turnover regime of damage and repair, so the persistence of a product and the persistence of the organization producing it are separate facts | A8 §4 and §9, on the owner’s r/place case. An artwork defended for days has its pixels repeatedly replaced, its defenders come and go, and its attackers keep working, yet the image stays recognizable. Its stability is continuous activity, not the absence of it. A8: “the distinction between a persistent product and a persistent producer”. An image can outlast the coalition behind it, and a coalition can outlast the images it makes. The claim does not say that the pattern, or the coalition, is a self. | Active |
| CLAIM-282 v2 | Forbidding self-endorsement does not stop an operator from amplifying its own authority: under damped recursive delegation, reciprocal and cyclic endorsements recycle authority, so an operator’s authority depends on its own endorsements, while one-hop allocation within an epoch, from budgets and baselines fixed independently of outgoing endorsements, makes it exactly independent of them | A2’s own analysis of the owner’s U2 design, conceded in the exchange and checked here. With damped recursive delegation (a PageRank-like fixed point), two operators that endorse each other pass authority back and forth, so each one’s authority depends on its own outgoing endorsements even though neither endorses itself. With one-hop allocation from budgets fixed independently of outgoing endorsements, that dependence is exactly zero. No accounting rule removes the slower route: an operator can change its authority by changing what others endorse. | Active |
| CLAIM-283 v2 | The precedence a motive claims over action and the authority the rest of the organization grants it are different quantities: a motive can claim control without receiving it, and be granted control it does not claim | A4 §2, reading Frijda through the record: “control precedence also suggests a useful addition to our parameterization”, a priority p_i claimed by a process, which “is not the same as granted influence I_i. An operator can urgently demand control without receiving it. That distinction between claimed precedence and endorsed authority may be essential to modeling internal conflict.” It joins THEORY-055 to the endorsement scheme. It does not say which wins. | Active |
| CLAIM-284 v6 | A self, in the self-governing sense, is a historically continuous organization of processes that takes part in governing the conditions of its own persistence, differentiation and transformation, not merely one that persists | A10 §11’s central hypothesis, reached after the owner asked at U10 for a research programme on a constitutive theory of selfhood. It treats the endogeneity of governance as the distinguishing mark: the organization takes part in changing how it will operate, which CLAIM-485 locates in revising its governing standards rather than in allocating authority among its processes. A11 named its falsifier. “Self” is in TERM-045’s self-governing sense, with persisting and integrated senses nearby, and not the subject sense. None of the entries it is set against objects to it as stated: it disclaims the will CLAIM-116 denies, the subject sense of CLAIM-165 and a boundary test (CLAIM-194), and CLAIM-288 undercuts ARG-015, the sufficiency-test route to it, not the claim. | Active |
| CLAIM-287 v4 | What persists when a self persists through inactivity is the capacity to reinstate an organization, not its continuous running, and continuity of that kind can branch and merge, so it is not an identity relation | A6 §7 and A10 §4.3. A6 separated activation continuity, organizational continuity and policy continuity, and put identity in the second: “A dormant coalition can remain available for reactivation because learned parameters, memory traces, and endorsement structures persist.” A10 added that continuity of descent “is not automatically an equivalence relation. Organizational histories can branch, merge, and partially overlap.” It sits beside CLAIM-161, which asks for a coherence measure conserved along a system’s own trajectory, and qualifies it for gaps. Its second half is Parfit’s branching argument (THEORY-447) applied to organizational continuity. It uses TERM-045’s persisting sense. | Active |
| CLAIM-288 v7 | In a population whose operators each maximize an objective the modeller fixed, the norms the organization appears to maintain are set by the modeller, not by the organization: they can become its goals through their role in selecting what persists, but it does not produce or revise them | The record’s objection, raised by no one in the exchange. A2 gives each operator an objective J_i, its evaluation of the collective decision, and A7 and A10 propose sufficiency tests run on such populations. Barandiaran, Di Paolo and Rohde hold that systems optimizing an externally fixed function are not models of agency (NOTE-458, C5), and Di Paolo (2005) that a system’s norms must be norms for the system. The objection undermines the evidence route; it does not refute the thesis. It is answered if the operators’ objectives are themselves produced and revised by the organization. | Active |
| CLAIM-289 | Non-stochastic strings stay non-stochastic under total recursive models: their minimal randomness deficiency agrees with the finite-set one to within O(log n) in argument and value | The step that THEORY-260’s promotion (version 2) names as the record’s own: carrying LIT-239’s non-stochastic strings, proved for finite-set models, to total recursive function models through Propositions B.1(b) and B.2(b) with Remark B.3. Remark B.3 asserts wholesale that every result of the paper extends to total functions up to a logarithmic term. This writes the extension out for this one result. It holds at O(log n) precision only, and does not reach LIT-229’s sophistication, which is defined at constant precision. | Active |
| CLAIM-290 | A positive-definite kernel’s minimal realizations are unique up to a unitary, and two finite representation matrices with the same centred Gram matrix differ by a translation and an orthogonal map | The record’s own proofs of two steps that THEORY-004 rests on and that its sources state without proof. (a) Jorgensen & Tian’s Cor. 1.35: minimal realizations of a positive-definite kernel are unique up to a unitary. The book leaves this “as an exercise”, and NOTE-829 supplied the book’s own proof of Thm 4.35, transferred. (b) The finite case that LIT-250 §5.3 states as known: XXᵀ = YYᵀ implies Y = XQ with Q orthogonal, with no assumption that the rows span R^d. With centring this becomes a translation and an orthogonal map. It does not say Q is unique, which fails when the rank is below d. | Active |
| CLAIM-291 | The adjoint of a square-integrable integral operator is the integral operator with the conjugate-transposed kernel | The record’s own step, written down in THEORY-009 and marked there as not the Riesz article’s, which covers matrices and bounded operators only. For a kernel k in L²(μ⊗ν), the operator (Tf)(x) = ∫ k(x,y) f(y) dν(y) from L²(ν) to L²(μ) has adjoint (T*g)(y) = ∫ k̄(x,y) g(x) dμ(x), by Cauchy–Schwarz and Fubini. So T is self-adjoint, when μ = ν, exactly when k(x,y) = k̄(y,x) almost everywhere. It does not say where the symmetry of k comes from, which is THEORY-009’s question, and it is not claimed for kernels that are not square-integrable. | Active |
| CLAIM-292 | Retrieval that depends on current belief is not a bias in itself: adaptive search can be rational when inference accounts for how the evidence was selected, and calling a search biased needs a standard outside the search | Granted against CLAIM-301, as A21 insisted (“That counter is essential. Without it, we’d be using ‘anchoring’ as a blanket criticism of adaptive search.”), and said again at A20 §5, A21 §4 and A23 V.E. Sequential experimental design chooses its next observation by its current belief and is not thereby biased. | Active |
| CLAIM-293 | The topology of a support graph does not fix how a conclusion should be revised when one of its supports fails: two records with the same edges can carry evidence of different strength and call for different revisions | A6’s compensating-evidence case (CASE-089), granted against reading CLAIM-295 as saying a graph of justifications is enough. Two pieces of evidence support H in both worlds. Discount the first, and posterior odds are 20:1 in one world and 1.1:1 in the other. rests_on and grounds record that support exists, not how much. | Active |
| CLAIM-294 v2 | Two inquiry histories can agree on every current conclusion and still call for different revisions of it, so a current marginal belief is not a sufficient state for updating on evidence about what it depended on | A5’s central claim, made exact by A8’s construction (CASE-093) and checked here. Two joint distributions over a hypothesis H and a condition C share P(H) = 0.9; learning C = 1 sends one to 1.0 and the other to 0.8. Keeping only the marginal merges histories that need different updates. It does not say a full posterior falls short (CLAIM-300), or that a dependency graph is the fix (CLAIM-293). | Active |
| CLAIM-296 v2 | What a system has, what it knows it has, and what it can deploy within a task’s deadline are different, and the last is a relation among the resource, the agent, its environment, the task, the deadline and the cue, not a property of any one of them | A18’s first candidate, from the owner’s EMT case (CASE-085): the drug was stocked, the EMT knew it, and it could not be found before the medic moved on. “If I can’t find it, it isn’t there” is false of the inventory and right of the decision. TERM-055 names the relation. A19 added the cue: the same memory under a different request may retrieve it. | Active |
| CLAIM-297 v5 | When an operator’s authority is updated by how well it performs on the interpretation it helped make dominant, the coupled meaning and influence of an organization can amplify an initial interpretive advantage without any gain in fidelity to independent evidence | A22’s narrow claim and A23 VIII.E’s central hypothesis, from the owner’s U22: connect retrieval-mediated anchoring to the record’s distributed agent as dual meaning and influence canvases (CLAIM-285, TERM-053). Its existence is shown in the linearization of a model of the kind in CASE-092 (CLAIM-330); the nonlinear model is unanalysed (QUESTION-100). If the influence field adds nothing to ordinary adaptive retrieval, the objection once filed as CLAIM-278, now ARG-036, stands against it. | Active |
| CLAIM-299 | Decision sufficiency, historical accountability and correctness are three properties of a record of inquiry, and each can hold while the other two fail | A8’s “small mathematical structure”, with A5’s “Epistemic traceability and epistemic sufficiency are different properties”. Shown by construction: a sufficient posterior without history (CASE-082), a perfectly accountable record that is wrong (CASE-084), a current marginal that is right and cannot be revised (CASE-093). CLAIM-189 and CLAIM-190 hold neighbouring points about measuring an argument. This names the three predicates so the others can say which they mean. | Active |
| CLAIM-300 | A state sufficient for a family of decisions under a model makes the rest of an inquiry’s history worthless for those decisions, and it can stop being sufficient when a source is discredited, the model is revised or the decisions change | A10’s answer to the owner’s U10, with A8’s fourth case and A10’s normal constructions (CASE-082, CASE-087). Under a fixed, correctly specified model a sufficient posterior makes the history redundant for those decisions. The same sample mean that sufficed cannot say which reading remains when one instrument is discredited, or test a mixture. Sufficiency was always relative to the model and the family. CLAIM-152 says the same of individuation by target; this says it of a retained state over time. | Active |
| CLAIM-302 | Equivalence under feasible tests can be much coarser than statistical equivalence: there are ensembles almost disjoint from uniform that no polynomial-size test tells apart from it, and efficiently samplable ensembles of this kind exist if pseudorandom generators do | A15’s witness for “Complexity changes what we mean by an observable”, which the owner asked to have developed at U15, corrected by the reading of Goldreich (NOTE of 2026-10-15). CLAIM-264 says agreement on a restricted probe family is coarser than identity; feasibility gives a restriction that is forced, not chosen. The separation itself is unconditional: a counting argument gives ensembles supported on at most 2^(n/2) strings that no circuit of size 2^(n/8) tells from uniform. Only an efficiently samplable witness needs an assumption, and a secure pseudorandom generator supplies one. All of it is asymptotic, about ensembles indexed by n. | Active |
| CLAIM-304 | A rendering can keep a distinction recoverable in principle and make it infeasible to recover: if pseudorandom generators exist, a uniformly random bit can be encoded so that an unbounded receiver recovers it except with probability at most 2⁻⁽ⁿ⁺¹⁾, while no efficient receiver does non-negligibly better than chance | A14’s first failure mode, computational inaccessibility, and A18’s fourth candidate: “Recoverable in principle ≠ recoverable within budget.” CLAIM-199 shows a garbling can help a bounded receiver. This is the other direction: a nearly lossless rendering can defeat every efficient one. The construction is the record’s, from CLAIM-302’s witness; A18 asked for one and warned against “a vague appeal to an inverse being hard”. | Active |
| CLAIM-305 | Resolving a singularity by blow-up reparametrizes the states and adds no observation, so it cannot make indistinguishable states distinguishable: every point over a singular point gives the same distribution, and the Fisher information can stay degenerate there; what the resolution buys is a normal form for the divergence, and so the learning coefficient | The owner’s LEGO monograph says, in Part I (chapters 4, 6, 7, 9, the Overview and “Definitions and Theorems”), that blow-up “restores identifiability”, “introduces new observables” and makes the Fisher information non-degenerate, and maps it onto splitting a LEGO bin. The pulled-back model is p(x | π(u)), a function of u only through π(u), so every point of the exceptional divisor gives the distribution of the singular point. In p(x | a, b) = N(ab, 1), the chart a = u, b = uv gives mean u²v and a Fisher matrix of zero all along u = 0. Splitting a bin is refining the observable, which can separate states. MOM-CLM-099 records that the monograph uses “blow-up” in three senses; this records why the analogy cannot hold in any of them. | Active |
| CLAIM-307 | Retrieval pressure and evidence are different criteria for carving a category, and they move in opposite directions with copy count: evidence that a distinction exists grows with its copies, the search a bin saves shrinks with them, so the bins a deadline forces are often the ones the data least supports | From MOM-CLM-166, which reads the owner’s LEGO parable (CASE-094) against a formalism that cited it with the sign reversed. CLAIM-154 says when a distinction is real enough to name. Its evidence grows with the number of copies. The parable says when a distinction must be built to act in time: a single brick among similar ones. Expected search falls as copies grow. The two answer different questions, “is it there?” and “can it be reached in time?”, and come apart in both directions. MOM’s table was re-run here and reproduced, and a simulation of the search agrees. | Active |
| CLAIM-309 | How good a mixture is and how discriminable it is from its diluent come apart: under linear mixing a smoothie’s distance from milk only shrinks as milk is added, so a preference that rises and then falls with milk is over the ratio and cannot be a d′, and the signal-detection reading of the owner’s smoothie line reverses one of its directions | The smoothie note in the owner’s LEGO monograph reads the owner’s line (CASE-096) as signal detection. Milk is the noise, “Less Good” is d′ falling as the mixture approaches milk, and “More Good” is d′ rising as a little milk is added. Under linear mixing the mixture’s taste is (1 − f)s + f·m, and its distance from milk is (1 − f)|s − m|. That falls monotonically from the first drop, so discriminability from milk cannot rise and then fall. The note’s own first model is right: goodness is a single-peaked function of the ratio, which is a preference, not a discriminability. MOM-CLM-166 found the same kind of reversal in the formal reading of the LEGO parable. MOM’s record never mentions the smoothie note. | Active |
| CLAIM-310 v2 | Sorting schemes over objects with determinate properties never conflict as descriptions, since the product of any sortings refines them all; they conflict as arrangements, since a fixed number of bins realizes one partition when each item is stored once, and which costs least depends on what is searched for and on what stands out within a bin | What is directionally right in the owner’s LEGO monograph, as Mathematics of Meaning graded it. Its contextuality claim is empty: any sortings of bricks share a joint refinement (MOM-CLM-137), and the events they generate stay Boolean (MOM-ARG-047). Its intuition that builders cannot share a sorting is true of arrangements. One set of bins realizes one partition, the product may need more bins than there are, and the cheapest choice depends on what each builder searches for and on what stands out within a bin (CASE-095). The disagreement is a trade, not a failure of global truth. Sorting on one attribute also turns a search for a combination of features into a search for one feature within each bin, which Treisman and Gelade (LIT-1082, read) show is the difference between a serial scan and one found at a glance. | Active |
| CLAIM-311 | A search cut off before an exhaustive pass can establish absence when the arrangement certifies that the unsearched remainder cannot hold the item: a sorted table answers non-membership in a logarithmic number of probes, and the Threshold Algorithm stops early with its answer proved, so absence needs a certificate about the remainder, not exhaustion; similarity search in high dimension is where no such certificate exists | Filed at the owner’s request, from the database readings set against CLAIM-306’s asymmetry: presence by one find, absence “only by exhausting the collection”. Sorted order and the Threshold Algorithm each establish absence from part of the collection, because the arrangement bounds what the rest can hold. That meets CLAIM-306’s own defeat condition, and the claim is conceded: CLAIM-312 restates it. Where the arrangement gives no bound, as in similarity search in high dimension, CLAIM-306’s asymmetry stands. | Active |
| CLAIM-312 v2 | ”If I can’t find it, it isn’t there” asserts operational unavailability, that the item will not be put to use before the deadline, not absence: a search that fails by the deadline establishes unavailability outright, and licenses absence only with a certificate that the unsearched remainder cannot hold the item, from exhaustion, from an invariant of the arrangement, or from a closed-world default | Restates CLAIM-306 at the owner’s request, after CLAIM-311 showed that absence can be established without exhausting a collection. The owner’s own wording in CASE-094, “it may as well not be there”, is hyperbole for operational availability (TERM-055), not a claim about inventory. Read so, the rule reports an outcome and needs no default. CLAIM-306’s analysis survives as the account of the literal reading: what a failed search must be joined with before it licenses absence. The gap between the two readings is CLAIM-306’s Bayes term, and it matters when the statement is passed to someone who will act on presence. | Active |
| CLAIM-313 v2 | A fixed number of bins realizes one partition only when each item is stored once: with copies, overlapping partitions coexist, as hashing-based similarity search stores each item in many partitions and pays for it in space, so sortings conflict as arrangements only under a one-copy constraint, which binds bricks but not index entries | Filed at the owner’s request, from the readings on locality-sensitive hashing (Indyk and Motwani 1998; Andoni, Laarhoven, Razenshteyn and Waingarten 2017) set against CLAIM-310’s premise that “a set of k bins realizes one partition of the collection at a time”. That holds when each item is in one place. An index can hold many copies, and hashing-based similarity indexes do exactly that, trading the space of the copies against query time on an exact curve. It narrows CLAIM-310 to collections whose items cannot be copied, which includes the LEGO case; it does not touch the claim about descriptions. | Active |
| CLAIM-316 v2 | A person’s drive profile is time-indexed: who drives changes with state, such as hungry or sated and stressed or calm, with task and with regime | Split from CLAIM-166 under ADR-043: the first of the owner’s two parts of 2026-10-11, “‘who drives’ isn’t a constant”, stated on its own. It is argued from the drive-profile term and the will line’s account of which regime is effective, and no observation the record holds estimates a person’s drive profile over successive windows, so it is interpretive. The microbiome part, which the reviews support, stays in CLAIM-166. | Active |
| CLAIM-318 | Within a shared observational scenario, exact structure-preserving symmetries are the invertible members of a nested family of stochastic transports, and among Markov kernels between finite sets the invertible ones are the permutation matrices, so the invertible core is the relabellings, a groupoid in which objects joined by an arrow have isomorphic automorphism groups | Split from CLAIM-103 under ADR-043: the nesting and its invertible core, stated on their own so that their warrant can be. A110 §25 nests exact symmetries inside structure-compatible transports inside stochastic communicative transports, within a shared scenario, and the exact symmetries are the invertible ones. For Markov kernels between finite sets, a stochastic matrix with a stochastic inverse is a permutation matrix, because a nonnegative matrix with a nonnegative inverse is monomial, so the invertible core is the relabellings. In that groupoid an invertible u : A → B gives Aut(A) ≅ Aut(B), which corrects A198 §8. It does not say what symmetries are for: that they supply the yardstick for non-symmetric transports is CLAIM-103’s, and interpretive. | Active |
| CLAIM-319 | Over a scenario of n contexts in an odd cycle, changing the support of one context takes the contextual fraction from 1 to 0 while the other n − 1 contexts and every marginal are kept exactly, at a weighted observational distortion of 1/n, so within a scenario the fraction’s Lipschitz constant against that distortion is at least n; and any change of global extension needs a contextual model on one side | Split from CLAIM-201 under ADR-043: the derivation that claim called “decisive and checkable”, stated on its own. For odd n, an n-cycle of ±1 observables in which every context anticorrelates is strongly contextual; making one context correlate gives a model with a global distribution. The two agree on n − 1 contexts and on every marginal, differ by total variation 1 in the last, and so lie at weighted D_obs = 1/n with contextual fractions 1 and 0. For n = 3 it is CASE-037 with one observable relabelled. It answers how small the local change can be; it says nothing about whether any data are contextual. | Active |
| CLAIM-320 | Within one fixed measurement scenario, two no-signalling empirical models can agree on all but one of their contexts and on every single-observable marginal while their contextual fractions are 1 and 0, so keeping most local judgement distributions does not fix their global compatibility | Split from CLAIM-105 under ADR-043: the possibility that claim’s headline needs, shown by the pair it lost and recovered in CASE-037. On the cover {AB, BC, AC} with binary outcomes, the parity triangle at 1/2 per allowed outcome is no-signalling and strongly contextual, with contextual fraction 1. Change only S_AC to {(0,0), (1,1)}: two contexts and every marginal are unchanged, and the model now extends to a global distribution, with fraction 0. It is an existence result by construction, and the weights are stipulated. It does not say reconstruction chains do this, which is CLAIM-105’s thesis and interpretive, and the context that changes moves by a total-variation distance of 1. | Active |
| CLAIM-321 v4 | In text-to-image diffusion models each condition of a prompt can be met while their conjunction or relational binding fails: benchmarks find single objects rendered almost always and spatial relations and attribute binding failing most, and composing by adding scores does worst on relations | Split from CLAIM-123 under ADR-043: the empirical part of that claim, that each condition can be met while their conjunction or relational binding fails, documented by GenEval, T2I-CompBench and T2I-CompBench++, by Attend-and-Excite’s “catastrophic neglect”, and by Composable Diffusion losing to an energy-based baseline on relations. It corroborates CLAIM-123’s derivation without carrying it, and does not say what causes the failures. | Active |
| CLAIM-322 v2 | Agreement under a probe family is evidence that two objects share structure only to the degree that the family was chosen independently of the comparison and is evaluated on cases it was not chosen on, so a family selected to make two objects look alike shows only that it can be selected | Split from CLAIM-264 under ADR-043: its evidential half, stated on its own so that its warrant can be. CLAIM-264’s exact half shows that agreement on a restricted probe family does not fix identity; this claim draws the rule for reading such agreement as evidence. It is an argument, not a theorem, so it is interpretive. It does not say which probes to choose, or that held-out probes are neutral. | Active |
| CLAIM-323 v2 | Where source and rendering are experiments about one common situation, a rendering that depends on the situation other than through the source is not a garbling of it and can be incomparable with it in Blackwell’s order: with Z uniform on {1, 2, 3}, a source that tells whether Z = 1 and a rendering that tells whether Z = 3 each have the lower 0–1 risk on one of the problems of saying whether Z = 1 and whether Z = 3, so neither dominates | Split from CLAIM-258 under ADR-043: the worked case that objection uses, stated on its own so that its warrant can be. Over a common situation Z uniform on three values, U reports whether Z = 1 and V whether Z = 3. V is not a garbling of U, since given U = 0 it still varies with Z, and the risks on “say whether Z = 3” (0 from V, 1/3 from U) and “say whether Z = 1” (the reverse) show neither experiment dominates. It is an existence result by construction. It does not say this is the normal translation case, which is CLAIM-258’s reading and is interpretive. | Active |
| CLAIM-324 v2 | In the What Survives Translation? exchange, the manuscript drafted straight from the crystallized argument changed the thesis with no turn arguing the move and dropped 24 of that argument’s items, none on request, and the second crystallized argument announced its change of question but left items out without saying which had dissolved and which were lost | Split from CLAIM-178 under ADR-043: the documented case on which that claim’s normative conclusion rests, scoped to the one exchange it comes from. The evidence is the workbench reconstructions of that exchange (2026/10/09/025539, 2026/10/10/040457). One exchange, reconstructed turn by turn by the record’s own readers; it says nothing about drafts in general. | Active |
| CLAIM-325 | The behavioural data the record has read show no contextuality proper: none of the five kinds of data Dzhafarov, Zhang and Kujala re-analyse is contextual, Wang et al. test none of their 90 language systems for it, and no documented test of pragmatic or meaning judgements finds it at adequate power | Split from CLAIM-219 under ADR-043: the empirical premise of that objection’s dilemma, which CLAIM-201 conceded. Dzhafarov, Zhang and Kujala (LIT-264, read in NOTE-235) find none of five kinds of behavioural data contextual, two of them previously published as contextual; Wang, Sadrzadeh, Abramsky and Cervantes (LIT-851) report signalling in 69 of 90 language systems and test none for contextuality; CASE-053 collects the documented tests on elicited judgements and finds no contextual pragmatic data. It is scoped: CASE-053 records a reliable positive result on instructed matching, so “none in behavioural data” is too broad, and the absence is LIT-264’s working hypothesis, not a proof that such data cannot exist. | Active |
| CLAIM-326 v5 | With losses in [0, 1] and a stated prior, the positive part of the Bayes-risk increase on the same decision problem, D⁺_Q(U → V; π), is directed, is zero from a garbling back to its source, vanishes for every finite problem and prior exactly when the rendering is at least as informative as the source in Blackwell’s order, over finitely many states and a source whose outcome space is standard Borel, and has A86’s D_Q, with the identity on tasks, as its symmetrization | Split from CLAIM-259 under ADR-043: the properties of the restated decision term, which CLAIM-259 called “elementary and checkable”, stated on their own so that their warrant can be. Define D⁺_Q(U → V; π) = sup over q in Q of [r_q,π(V) − r_q,π(U)]⁺. A garbling never gains; with Q all finite problems and π all priors, the term vanishes exactly when V is at least as informative as U, by the Bayes form of Blackwell’s theorem for finitely many states (THEORY-156); it is directed; and A86’s D_Q is its symmetrization. It does not say this is the right decision term, which is CLAIM-259’s proposal, and it does not state the prior-free relation to Le Cam’s deficiency. | Active |
| CLAIM-328 v3 | When the continuities that ordinarily come bundled in a collective (legal franchise, civic role, interpersonal transmission, narrative and place) are separated, several later collectives can each be a genuine successor of the earlier one in a different respect, without any of them, or the earlier collective, having branched in numerical identity | A4’s H5 of the exchange of 2026-10-16, in its weak form, on the Washington Senators. The league’s successor to the original club is the Twins; the city’s is the expansion Senators; the city’s present team claims its history through place and narrative. Promoted from a section of QUESTION-118 at the owner’s word. It concerns plural successor relations, not branching identity, and rests on one documented case with no data on how supporters divided. | Active |
| CLAIM-330 | In the coupled meaning–influence model linearized at its symmetric state, with each field stable alone and nonnegative couplings, the coupling destabilizes symmetry exactly when βγ > (1 − α)(1 − δ): only the loop can do it, and the direction that grows mixes meaning and authority | A14 §2 of the exchange of 2026-10-16, checked. For J = [[α, β], [γ, δ]] with nonnegative entries and α, δ < 1, the leading eigenvalue exceeds 1 iff βγ > (1 − α)(1 − δ). If either coupling is zero the eigenvalues are α and δ. The leading eigenvector is (β, λ+ − α), positive in both components. A partial answer to QUESTION-100’s “when the symmetric state is unstable”, for the linearization only; it says nothing about the nonlinear attractors or about fidelity. | Active |
| CLAIM-331 v10 | A level of organization has a temporal facet as well as a compositional one: higher-level variables are characteristically slower and longer-lived than the activity that produces them, though slowness is a mark of a level and not its definition | The owner’s, U8 of the exchange of 2026-10-16: “‘higher level’ doesn’t just mean in terms of abstractions over abstractions, we should also expect ‘higher level’ effects to be on slower timescales than ‘lower level’ effects.” A8 took it and qualified it: a market can crash and a stadium can chant in seconds, so timescale is “a facet of organizational level, not … an ordering that must hold in every case”. Simon’s near-decomposability already ties weak coupling between blocks to slow aggregate dynamics (LIT-905). The claim does not say that a slow variable is thereby a level, a system or an individual. | Active |
| CLAIM-333 | Measuring every relevant variable is necessary but not sufficient for a Granger-causal analysis to say anything about interventions: the intervention must also be an isolated exogenous change and no influence may act within one sampling step, and then Granger noncausality implies no intervention effect and the effect is identified from the observational predictor, but a Granger-causal relation is still only potentially causal | The record’s answer to NOTE-010’s C5, “if all relevant variables are measured, Granger- and Pearl-type analyses coincide”, which the ΦID review asserts without conditions. Eichler and Didelez (THEORY-704) give sufficient conditions, and complete measurement is one of them. A two-variable process with nothing hidden shows it is not enough: a acts on b within one step, a is Granger-noncausal for b, and setting a(t) changes the mean of b(t + 1) by ργ. Checked by hand and by simulation. | Active |
| CLAIM-334 | Granger causation from a macro variable to the micro variables it supervenes on, Seth’s downward Granger causation, is not evidence of a macro-to-micro intervention effect, even with every micro variable measured: supervenience leaves no intervention on the macro variable that holds its micro base fixed at the same time | Seth measures downward causation as Granger causation from the flock’s centre of mass to each boid, and calls it “ontologically innocent” (THEORY-703). The record files the boundary so that the stronger reading has an address. If M(t) = f(m(t)), setting M(t) means changing m(t), so the intervention Eichler and Didelez’s Assumption 2.3(i) requires does not exist (THEORY-704). Measuring every boid does not help, by CLAIM-333. | Active |
| CLAIM-335 v3 | Transfer entropy measures directed predictive improvement, not information flow: as a conditional mutual information it is the source’s unique information about the target’s next value plus its synergy with the target’s past, so it can credit a source with a bit the source carries only jointly and read zero from sources that jointly fix the target, and conditioning on more series does not remove the synergy | The record’s position on whether transfer entropy measures information flow. James, Barnett and Crutchfield show it does not, if flow is information attributable to the source alone (THEORY-707). Williams and Beer’s decomposition shows why, for any partial information decomposition satisfying the consistency equations (THEORY-712). Both papers’ examples were recomputed exactly. This is a different failure from CLAIM-333’s, prediction against intervention. It leaves transfer entropy standing as a predictive quantity. | Active |
| CLAIM-339 v3 | A judgement–observation loop cut off from action loses one route for evidence it did not select, and the free-energy principle’s reason for minimizing surprise, that a persisting system must keep its states in bounds, needs action on the world, though a loop can confirm itself with action available too | The assistant’s, A1 of the exchange of 2026-10-16, narrowed at A4. Friston et al. (2010) say active sampling is “mandated by ergodic arguments based on the very existence of adaptive agents”, and the enactive account puts a system’s own norms in its capacity to act against tendencies toward its viability boundary. Kübler and Birbaumer’s extinction hypothesis is the empirical form. As first filed it said a loop without action has a self-confirming minimum. NOTE-766 shows the minimum arises with action available, so the counter now claims only that losing action removes one source of evidence the loop did not select. CLAIM-342 answers it. | Active |
| CLAIM-340 | Scoring operators on predictions committed before the evidence is not by itself Regime B: in the linearized operator model the coupling of interpretation to endorsement has the sign of κ′ − κ̄, so commitment removes capture only when the interpretation bends the reading of the evidence no more than it bends the predictions, and it keeps the learning that revising after the evidence would lose | The formal question QUESTION-121 asked, answered in CASE-099’s linearization (CASE-106): is committing predictions before the evidence equivalent to Regime B? No. The coupling γ is 4ηs(κ′ − κ̄), where κ̄ is how far the shared meaning bends the committed predictions and κ′ how far it bends the reading of the evidence. It is corrective, null or capturing as κ′ is below, at or above κ̄. Strong correction can fail by oscillation when |βγ| ≥ 1 − αδ. Revising predictions after the evidence sets γ = 0 but also stops authority from tracking who predicts well. Linear, at the symmetric state, for squared-error scoring. | Active |
| CLAIM-341 v3 | The loop that keeps a lucid agent’s model in touch with what it models runs between judgement and observation: each judgement reshapes the observer whose later observations it then judges, and action on the world is not part of that loop, so active inference’s action–perception cycle misplaces where the agent is active | The owner’s, U1 of the exchange of 2026-10-16: Friston’s free-energy approach is “generally correct, but the cybernetic model is wrong”; action can be cut out of the loop, which decomposes into “Judgement (qua measurement that generates interpretations) <—> Observation”. At U2 the owner held that the pragmatic-transport and will-organization models are “both manifestations of the same underlying model”. The claim is stated in that model’s terms, as CLAIM-297’s circuit, and in the diachronic form A4 proposed and the owner asked to be filed at U5 (“make the revisions”): a judgement need not produce the observation it judges, but it reshapes the observer that produces the next one. The sharp edge: the synchronic form, in which each judgement produces its own outcome, is not claimed. That is the open route of TERM-039 and CLAIM-127, and the record demoted it once before (CLAIM-109). | Active |
| CLAIM-342 v3 | What keeps a judgement–observation loop from confirming itself is evidence whose arrival or scoring does not pass through the interpretation it tests; action is one source of such evidence, not a necessary one, and a loop that selects its own evidence can lock in with action available | The assistant’s synthesis, A3 and A4 of the exchange of 2026-10-16, filed at the owner’s request at U5. Three results the record already holds. CLAIM-330: capture in the operator model needs both arrows of CLAIM-297’s circuit, and scoring operators independently of the dominant interpretation removes it. CLAIM-141: a loop always has a distributional fixed point, so what binds it is a constraint that prescribes marginals. THEORY-285 (NOTE-766): an active-inference agent locks in with action available, because its own sampling policy withholds the evidence that would correct it. The claim does not say action is unimportant, only that it is not what does the anchoring. | Active |
| CLAIM-343 | For three or more parts, no ΦID can use a redundancy function that both satisfies the identity axiom and yields nonnegative atoms, because on the Williams–Beer lattice the two are inconsistent from three sources up; a ΦID verdict on three or more parts therefore rests on which axiom the analyst drops, and should name it | The record’s answer to the gap left by the PID filing: no held measure gave ΦID an identity-respecting redundancy for more than two sources. Rauh et al. show none can, on the lattice ΦID uses, without a negative atom (THEORY-713). The record’s measures split the difference: I_min keeps atoms nonnegative by calling independent copied bits redundant, and Ince’s I_ccs keeps an independent-sources identity and reports a −1-bit atom (THEORY-714). Two-part ΦID is untouched. | Active |
| CLAIM-344 v3 | Resolve is a maintained organization of precedence, commitment and revision that keeps a temporally extended policy effective across changes in locally dominant evaluations while keeping the capacity to revise it; mere slowness or persistence is not resolve | The owner’s frame, U37 of the exchange of 2026-10-17: “I think emergence of “resolve” could be an interesting frame within which to examine our will-organization framework.” A37 defined it, and A39 to A47 revised it each turn: retention and revision as separate grades, fragility against rigidity (A41), access against authority (A42), and governance that makes its own repeated exercise unnecessary (A45, A47). The record already holds a theory of resolve, Ainslie’s recursive staking of future choices (THEORY-067); this is its organizational and revisable form, placed in CLAIM-159’s will-organization cell. The sharp edge: the standard for when revision is warranted is not supplied, and is QUESTION-087’s open problem. | Active |
| CLAIM-345 | Equal controllability rank does not fix the cost of control: for x_{t+1} = x_t + b·u the least quadratic effort for a displacement Δ is Δ²/b², unbounded as b → 0 while the system stays controllable, and in general the least effort is Δxᵀ W_T^† Δx, set by the Gramian and not by its rank | A9 §2 and A12’s Proposition 1 of the exchange of 2026-10-17, the step the owner’s U9 “controllability of a system isn’t binary” needs. For a scalar step x_{t+1} = x_t + b·u the cheapest input costs Δ²/b², so two systems that are both controllable can differ in cost by any factor. The general statement is the minimum-energy formula with the controllability Gramian. A9: “This is already a standard result from linear control theory.” Proved here because the record holds no source for it. The sharp edge: the cost is relative to a fixed input norm, and rescaling the input makes every b cost the same, so comparing costs across systems needs inputs in common units. | Active |
| CLAIM-346 | Feasibility, aggregation and epistemic coordination are independent obstructions to an organization’s realizing its demands: each can occur with the other two absent | Owner-seeded, U36 of the exchange of 2026-10-17: Arrow’s theorem, then cryptography and “the two generals problem”. A36 placed them: “Arrow’s theorem belongs in the theory of endorsement, not directly in the geometry of feasible updates”, and the two generals add “epistemic frustration”. Three elementary constructions, each with one obstruction and not the others, are given in the body. The sharp edge: the independence is relative to fixing the demands as the constituents’ own acceptance conditions; that no remedy for one removes another is A36’s further reading, argued in the body and not part of the claim. | Active |
| CLAIM-347 v3 | Frustration among an organization’s demands is an ordinal fact before it is a quantity: the jointly satisfiable sets of demands form a downward-closed complex whose minimal non-faces are the minimal conflicts, relief is strict enlargement of that complex for the same declared demands, reorganizations that relieve different conflicts are incomparable, and dropping or suppressing a demand is not relief | The owner’s correction, U37 of the exchange of 2026-10-17: “We can do quite a lot with access to an ordering, even if it doesn’t give us a true measure.” A37 granted it (“I agree with your correction”) and built the acceptance sets, their intersection and the compatibility complex. Corrected here: acceptance conditions sit on attainable outcomes, a demand’s form depends on whether it demands improvement or maintenance, and A37’s weak-preference sets fail only as representations of improvement demands. The definitional facts are shown in the body, including that every pair of demands can be jointly improvable while the triple is not. The sharp edge: relief compares complexes for the same declared demands, so a reorganization that deletes a demand is not compared at all, and two reorganizations can be incomparable. It is the move CLAIM-128 and TERM-043 made for translation, in a new line. | Active |
| CLAIM-348 v4 | No coarse-graining is normatively adequate in general because it preserves stability, prediction or aggregate performance: a description adequate for an institution’s performance can merge states its members’ claims must distinguish, so adequacy is fixed by the evaluative target, and the target cannot be justified solely by the description that preserves it | A21 §18’s Candidate 2 of the exchange of 2026-10-17, with A21 §5’s clause against circularity and A22’s Construction C (CASE-110). A21: “no coarse-graining may be treated as generally normatively adequate solely because it preserves organizational stability, predictive accuracy, or aggregate performance.” The case is demonstrated: total output preserves an institution’s every judgment and merges a member’s claim. The general conclusion is interpretive. It is CLAIM-152’s target-relativity carried from individuation to evaluation, and CLAIM-060 in the language of coarse-graining. Filed in distributed-agency because its case is a whole against its members. The sharp edge: it does not say which target is right, and it denies that the description can settle it. | Active |
| CLAIM-349 v6 | An organization’s access to a signal, the signal’s authority over action, and action on it are separable, and adaptive regulation keeps the first while making the second conditional on evidence; overcontrol, which buys freedom from harmful acts by cutting access or making inhibition unconditional, is a maladaptive regime and not more control, so flexibility is a context-sensitive property of maintained influence relations, not of how much is inhibited | The owner’s idea, U42 of the exchange of 2026-10-17, on A41’s line that an organization “could become extremely resistant to internal changes while losing its capacity to learn, correct errors, or act at all”: “useful connections to the ACT and DBT frameworks here, which provide us with accounts/ontologies of maladaption and productive flexibility”. In A42’s form: recognizing a signal, granting it authority and acting on it are three steps; ACT’s defusion is a mechanism for CLAIM-156’s decoupling; DBT adds bounded stabilization before correction; RO-DBT names overcontrol as maladaptive. The sharp edge: these are analogies from human treatment, the organizational classes are A42’s proposals, not diagnoses, and RO-DBT’s own evidence is “promising but not definitive”. | Active |
| CLAIM-350 v2 | A coarse-graining preserves a deterministic judgment exactly when the judgment is constant on its fibres: the judgment then factors through the coarse description, uniquely on its image, and otherwise two states the judgment tells apart have been merged | A21 §3 and §18 (Candidate 1) of the exchange of 2026-10-17, and A22’s Construction A: for a judgment J and a coarse-graining C on the same states, J = j∘C for some j exactly when C(x₁) = C(x₂) implies J(x₁) = J(x₂). Granted, because it is elementary (the universal property of a quotient) and Ak’s; the proof is in the body. It is CLAIM-152’s judgment-valued special case with the converse added: CLAIM-152 says a partition sufficient for one target need not be for another, and this says which partitions serve a deterministic judgment, those whose fibres lie inside its level sets, so the coarsest is the judgment’s own partition. The sharp edge: it says when a description keeps a judgment, never whether the judgment is right. A21’s probabilistic and causal versions are recorded in the body, not claimed. | Active |
| CLAIM-351 | A zero aggregate gradient does not show that the demands it aggregates are reconciled: with positive weights it holds both when every demand’s own gradient vanishes and when nonzero gradients cancel, and in the second case no update improves them all to first order; even the first is only joint first-order stationarity, which a demand’s maximum or saddle also has | A33 §5 of the exchange of 2026-10-17: “Zero aggregate gradient does not imply absence of frustrated demands.” With L₁ = (θ − 1)² and L₂ = (θ + 1)² at θ = 0 (CASE-115), the equal-weight gradient is zero and the aggregate is at its global minimum, while each loss is 1 and wants the opposite move. In general a vanishing positive combination of gradients is either every gradient zero or a certificate that no update improves them all, and the scalar cannot tell which. The sharp edge: it is a fact about a weighted sum, not about what a monitor reading it represents. A29’s “the unity of the distress signal need not arise from the unity of the underlying causes” is the interpretive reading, kept apart in the body. | Active |
| CLAIM-352 v4 | Sen’s two aspects of freedom divide along the record’s line between what an agent can viably reach and the organization that selects among it: viable reachability can stand for the opportunity aspect only through a map from trajectories to valued functionings, which control theory does not supply, and will-organization gives a causal account of part of the process aspect, not of its fairness or legitimacy | The owner’s connection, U11 of the exchange of 2026-10-17, quoting A9 and A10 on viable reachability: “This feels reminiscent of ideas from moral philosophy, e.g. Amartya Sen capabilities account.” Worked out by A11. Sen’s opportunity aspect is what reachability can represent, once a map says which reachable trajectories are valued functionings. His process aspect is in part what will-organization models: whether the agent’s own governance selected the outcome. Read first-hand in NOTE-263 (Sen’s lecture) and NOTE-259 (Robeyns). The sharp edge: reachable states are not capabilities, and an efficacious governance is not a fair or legitimate process. | Active |
| CLAIM-353 v2 | A will-organization that gives two operators decisive jurisdiction over a pair of options each, respects unanimous preference and admits any profile of operator rankings cannot always choose, and unlike Arrow’s impossibility this is not escaped by giving endorsement richer, cardinal or comparable, information, so what distributed governance must give up is jurisdiction, unanimity or the domain, not an informational restriction | From U36 of the exchange of 2026-10-17. The owner raised Arrow; A36 answered “Sen’s liberal paradox may be even closer than Arrow” and asked whether a will-organization can “guarantee coherent joint decisions while preserving specified domains of constituent authority and respecting unanimous preferences”. THEORY-027 says no in general, and its title holds the difference A36 cited without stating: “unlike Arrow’s theorem, the conflict is not removed by interpersonal comparability”. So A36’s remedy, letting endorsement use richer information, answers Arrow but not jurisdiction. The sharp edge: it holds only if operator jurisdiction is pairwise decisiveness, which THEORY-027 leaves open even for persons. | Active |
| CLAIM-356 v4 | An objective that originates outside a learning system can become a goal of the training organization, through its causal role in selecting, stabilizing and reproducing the learned structure it rewards; exogenous origin does not disqualify a goal, but it does not show that the network governs or endorses the objective, and what is selected is performance on the updating distribution, not generalization | The owner’s, U35 of the exchange of 2026-10-17, against A34’s guardrail that “Loss minimization does not automatically mean the model has its own goals”: the externally assigned objective “can motivate identification and persistence of learned features”, so the training process can be described as “having endogenous goals”. A35 granted it: “Yes, in a qualified but important sense”, and weakened the generalization half, since selection is for performance on “the encounters and feedback distribution actually used for updating”. It objects in part to CLAIM-288: it grants that a modeller-fixed objective does not show self-constitution, and denies that exogenous origin bars a goal from becoming the training organization’s own regulation. The sharp edge: the goal belongs to the training organization (CLAIM-367), not to the network, and nothing here says the network endorses or governs it. | Active |
| CLAIM-357 v5 | The frustration residual and governance regret separate structural infeasibility, realized violation and minimax suboptimality, and identify none of them as thwarting: a positive residual says no admissible update meets every declared requirement, a positive regret only that the actual update’s worst residual exceeds the best achievable, which can hold while every requirement is met, and actual violation needs regret above the negative residual; aggregate performance does not tell infeasibility from realized violation, and the multipliers that certify infeasibility need not be the weights governance assigns | A34 §4 and A35 §3.3 of the exchange of 2026-10-17, restated at A39 §2C and A40 §3.4, from A33’s “irreducible conflict” and “manufactured frustration”. With m(d) the worst residual, Φ its minimum and Γ the actual update’s excess over Φ (CLAIM-365): Φ > 0 is structural infeasibility; when Φ ≤ 0 the actual update violates a requirement exactly when Γ > −Φ. Positive governance regret establishes excess worst-case shortfall relative to the optimum, and can hold while every requirement is met. Neither quantity identifies an obstructing mechanism, a governance failure or active thwarting; governance-induced frustration needs an argument or intervention showing the allocation of influence responsible. A35: “Importantly, these dual multipliers are not endorsement weights.” | Active |
| CLAIM-359 v2 | A self-governing organization’s robustness to compromised constituents is a property of the processes that allocate, audit and revise authority, not only of its constraints on harmful acts; safeguards against capture can also restrict the disagreement and revision that self-governance needs, and where they do security and self-governance trade off, while others, such as audits independent of the audited that protect dissent, serve both, so the two are distinct achievements and not opposed ones | The owner’s question, U41 of the exchange of 2026-10-17: “is literature on organizational robustness to insider threats potentially useful to us?” A41’s answer, condensed: an insider can aim at the organization’s future allocation of authority rather than at the present decision, so robustness must protect the processes that allocate, audit and revise authority, and the same protection can silence the opposition that corrects the organization, though some safeguards protect both. Insider threats and internal opposition can look alike. The sharp edge: Byzantine fault tolerance protects a fixed specification; this claim is about protecting the capacity to change it, which no protocol of that kind supplies. | Active |
| CLAIM-360 v2 | The deep-versus-shallow learning results separate three effects that aggregate loss conflates: a larger realizable function class, a larger set reachable within a fixed data and compute budget, and a different internal organization with the same attainable outcomes; the deep linear results show the third, the random-hierarchy results the second, and the depth-separation result for products of inputs the first, at fixed size | The owner’s, U38 of the exchange of 2026-10-17, on A37’s proposed experiment: “I think we may already have an empirical demonstration that would be useful here in the wide vs deep literature.” A38 refined it into three effects, (A) enlarged realizable function class, (B) enlarged budgeted reachable set, (C) new internal organization without better attainable outcomes, filed Saxe et al. under C and the random hierarchy model under B, and said A “needs a separately established expressivity restriction”. The record has one: Rolnick and Tegmark (THEORY-206), a separation at fixed neuron count. The sharp edge: which effect a result shows depends on the budget, and A38 warned against “depth produces individuation while width merely provides redundant capacity”. | Active |
| CLAIM-363 v4 | A normative judgment is well-defined only once its relata are fixed (the organization or standpoint it concerns, the standard, the scale and the context), and that dependence does not by itself make it relative: once they are fixed, the judgment can be false | The owner’s, U17 and U18 of the exchange of 2026-10-17: “maybe part of what we’ve elucidated is that normative judgements necessarily rely on contexts and relations?”, then “so maybe something like a frame/order/scale/perspectival-relative normative realism?” A17 put it as “Normative judgment is contextually constituted and relationally indexed, without necessarily being arbitrary or merely subjective”, and A18 named the relata and split order into organizational and reflective order. The record held it only in pieces: CLAIM-152 for individuation, THEORY-220 for function, CLAIM-075 for viability. Filed in will-organization, where the question of what organizes an agent’s standards sits and where CLAIM-075 marks the limit, rather than pragmatic-transport, which holds the transport of judgments between contexts (CLAIM-115, QUESTION-130) and not their indexing. The sharp edge: it is the constitutive half only. That the standards themselves can be objectively better or worse is not claimed. | Active |
| CLAIM-365 v2 | On a norm-ball update set the local frustration residual Φ_r = min over ‖d‖ ≤ r of max_i(ε_i + g_iᵀd) equals the maximum over the simplex of Σλ_iε_i − r‖Σλ_ig_i‖_*, so infeasibility of the declared improvements has a certificate, and any admissible actual update exceeds Φ_r by a nonnegative governance regret | A34 §4 and A35 §3 of the exchange of 2026-10-17, checked. The residual is the smallest worst-case shortfall of the declared local improvements ε_i over updates of size at most r. Minimax for the bilinear problem on two compact convex sets gives the dual over the simplex, so Φ_r > 0 exactly when some λ certifies that no update meets all demands (A34’s form). Governance regret Γ is the gap between an actual admissible update’s shortfall and Φ_r, and is never negative. For L₁ = (θ − 1)², L₂ = (θ + 1)² at θ = 0, Φ_r = ε for every r. The sharp edge: per A37 it is a cardinal refinement of the ordinal fact (CLAIM-347), and its magnitude depends on units (A36 §2D). | Active |
| CLAIM-366 v3 | Whether several objectives share a strict first-order descent direction, 0 ∉ conv{g_i}, is invariant under smooth invertible reparameterization, while the sign of a Euclidean gradient inner product is not, and a negative inner product does not exclude common descent; a budgeted version is invariant only with the metric pulled back | A35 §2 of the exchange of 2026-10-17, at the owner’s U35 “double click” on whether functionally equivalent parameterizations give equivalent frustration diagnoses. Gradients transform as g′ = Jᵀg and directions as v′ = J⁻¹v, so directional derivatives, and with them the common-descent test 0 ∉ conv{g_i}, do not depend on coordinates. A Euclidean inner product does: g₁ = (1, 1), g₂ = (1, −½) have product ½, and under θ = diag(½, 2)ψ their transforms have −7/4, while d = (−1, 0) lowers both throughout. The sharp edge: it covers coordinate changes of one parameter space at first order, not function-preserving symmetries or training trajectories (QUESTION-127). The practice corollary, not to diagnose task conflict by gradient cosine, is the anthology’s. | Active |
| CLAIM-368 v4 | The primitive for an organization’s regulatory difficulty is frustration, not distress: a relation between maintained, consequential demands and the incompatibilities, constraints or countervailing processes that limit their realization, independent of strain, the burden of sustaining activity, and distinct from distress, a possible integrated response to either | The owner’s, U33 of the exchange of 2026-10-17: “maybe we should focus less on distress and more on frustration”. A33 granted it: “Frustration is the most promising theoretical primitive of the three.” Frustration is a fact about demands, admissible transformations and governance, so it can be stated without feelings and without a common scale. It supersedes in substance the distress-first formulations of A28–A32, which were never filed. The sharp edge: it says what to start from, not that a frustrated organization is distressed or feels anything. The claim bears on the organizational-affect line, which is Deferred (CLAIM-039); whether that line reopens is the owner’s decision, not made here. | Active |
| CLAIM-369 | In symmetric resource-mediated competition with interaction matrix A = UᵀU and growth rates r = Uᵀb − c, Lotka–Volterra population dynamics are multiplicative gradient flow on the convex feature-selection objective ½‖b − Un‖² + cᵀn over the nonnegative orthant: the invasion fitness of an absent component is the negative partial derivative of that objective, and the uninvadable equilibria are its KKT points | From a synthesis the owner relayed on 2026-10-18 (workbench entry of that date), checked here and given a proof. When competition between components is mediated by shared resources with feature or niche vectors u_i, so that A = UᵀU and r = Uᵀb − c, the Lotka–Volterra dynamics are ṅ_i = −n_i ∂_i L with L(n) = ½‖b − Un‖² + cᵀn: entropic mirror descent on the positive orthant. A rare component’s invasion fitness is −∂_i L, the value of adding that feature, and uninvadable equilibria are the KKT points of the convex program. The sharp edge: the identity needs a shared scalar objective, and it fails for asymmetric interactions or processes with competing objectives, which is where an organization stops being an optimizer. Mehta et al. (2019) and Marsland, Cui and Mehta (2020) give the general duality for consumer–resource models. | Active |
| CLAIM-370 | For a symmetric positive-pair distribution with marginal p, the conditional-expectation operator on L²(p) has the density ratio K⁺ as its kernel, and it is Hilbert–Schmidt exactly when the χ²-divergence of the pair from the product of its marginals is finite, in which case it is compact and self-adjoint with an orthonormal eigenbasis | THEORY-005’s derivation, stated as the record’s own and with its proof. Johnson et al. (LIT-258) write the operator on a finite space without an integrability condition. HaoChen et al. (LIT-249) reach the Hilbert– Schmidt property from a uniform bound, which is stronger. Here the condition is exact: Hilbert–Schmidt if and only if finite χ². It says nothing about what trained features span. | Active |
| CLAIM-371 | Under the componentwise order on distortion profiles, two profiles are incomparable exactly when they trade off, and then positive weightings can rank them either way, while every positive weighting agrees with a dominance | The order-theoretic part of CLAIM-128, on its own so that it can carry its own warrant. It says nothing about translation, what the components measure, or which weighting a task fixes. Only that, under the componentwise order of TERM-043, a trade-off is incomparability, that a trade-off can be resolved either way by positive weights, and that a dominance cannot. | Active |
| CLAIM-372 | Within a fixed measurement scenario, the contextual fraction is a piecewise-linear and Lipschitz-continuous function of the empirical model’s probability table, with a constant that depends only on the scenario | The record’s own derivation, from the linear programme of Abramsky, Barbosa and Mansfield (LIT-265, Eq. 3), which THEORY-165 holds. The non-contextual fraction is the minimum of the dual objective over finitely many vertices, so it is concave and piecewise linear in the probability table, and the contextual fraction is Lipschitz in it. The constant is the largest ℓ₁ norm of a dual vertex, which depends only on the scenario and is not bounded here. Nothing here crosses scenarios or applies to signalling data. | Active |
| CLAIM-373 | If a map approximately intertwines two operators, with defects E_A = ΦA − A′Φ and E_B = ΦB − B′Φ, then Φ[A,B] − [A′,B′]Φ = A′E_B + E_A B − B′E_A − E_B A, so the commutator is carried to within (‖A‖ + ‖A′‖)‖E_B‖ + (‖B‖ + ‖B′‖)‖E_A‖ | The commutator-distortion identity of the manuscript’s §9, on its own and proved. A map that nearly intertwines each of two operations carries their commutator to the commutator of the images, up to an error that is linear in the two intertwining defects. ARG-006 is the exact case. It says nothing about whether the defects can be identified from data (CLAIM-253), or what bounds an observed order effect (CLAIM-231). | Active |
| CLAIM-374 | On a consistently connected system, Contextuality-by-Default and the sheaf criterion agree: a maximally connected coupling exists exactly when a global law has the contexts’ laws as its marginals | The record’s derivation of what NOTE-600 marks as its own inference. In a consistently connected system, every observable has one distribution in all the contexts that contain it. Then each connection’s maximal coupling makes its copies equal with probability 1 (LIT-777, Theorem 3.3), so a maximally connected coupling is a joint law of one variable per observable, which is a global section in Abramsky and Brandenburger’s sense (LIT-016, THEORY-012). Conversely, a global section gives such a coupling. The two criteria come apart only when marginals shift with context. | Active |
| CLAIM-375 | Under one-hop allocation within an epoch, an operator that endorses an ally whose policy is nearer its own than the collective decision is raises how far its preferred policy is realized while its own authority stays fixed, so the two conditions of the endorsement scheme hold together | The demonstrated core of CLAIM-285. Under A3’s one-hop rule I_j = I_j⁰ + Σ_(k≠j) b_k E_kj, with budgets and baselines fixed within an epoch (CLAIM-282), an operator’s authority does not respond to its own endorsements. If the collective decision is the authority-weighted mean of the operators’ policies, then endorsing an ally whose policy is nearer one’s own than the decision is moves the decision strictly toward one’s policy. So the reward for realized policy, and not for held authority, pays for delegating. It does not say operators behave so, or that any rule beyond one hop keeps both conditions. | Active |
| CLAIM-376 | A linear system that is stable at every instant can have a positive Lyapunov exponent: shifting any operator with exponent λ > 0 by −δI lowers its exponent by exactly δ and makes every instantaneous operator stable, so for 0 < δ < λ the shifted system is stable at every instant and unstable | The case THEORY-724’s source asserts and does not show. If A(t) has first Lyapunov exponent λ > 0, the propagator of A(t) − δI is e^(−δt)Φ(t), so its exponent is exactly λ − δ, while every eigenvalue of every A(t) moves left by δ. Applied to the undamped oscillator switching ω between 0.5 and 3 every unit of time: λ = 0.1955, and with δ = 0.1 the system is stable at every instant, with eigenvalues −0.1 ± 3i and −0.1 ± 0.5i, and has exponent 0.0955. | Active |
| CLAIM-377 | For any differentiable model under squared loss with Gaussian noise of precision β, the model’s Fisher on n inputs is the Gauss–Newton matrix βJᵀJ, and its non-zero eigenvalues are exactly β times those of the empirical NTK Gram matrix JJᵀ, with the same multiplicities, its eigenvectors being Jᵀ applied to the Gram matrix’s, normalized | THEORY-084’s Step 1, stated as the record’s own and proved. Through the SVD J = UΣVᵀ, JᵀJ and JJᵀ share the non-zero eigenvalues σ_i² with equal multiplicities, and Jᵀu/σ is the eigenvector of JᵀJ for a unit eigenvector u of JJᵀ. Under y | x ~ N(f(x; θ), β⁻¹), the expected outer product of the score is β∇f∇fᵀ, which summed over inputs is βJᵀJ, the Gauss–Newton matrix. “Fisher” means the model’s Fisher, not the empirical Fisher of observed residuals. It holds at every width, in every regime and on any data. It says nothing about what the spectrum looks like, which is THEORY-084’s. | Active |
| CLAIM-378 | A representational similarity index invariant to every invertible linear map depends on a representation only through its column space, so it takes one value on all column-centred representations of rank n − 1, as it does on all representations of rank n | The generalization of THEORY-236’s theorem. If col(X) = col(Y), write X = BC and Y = BD with B a basis of the common column space and C, D of full row rank, extend C and D to invertible matrices, and the quotient maps X onto Y. Since XA always has the column space of X, the GL(p) orbits are exactly the sets of n × p matrices sharing a column space. Theorem 1 is the case of column space ℝⁿ. Column-centred matrices of rank n − 1 all have column space 1^⊥, so an invariant index cannot tell them apart either. | Active |
| CLAIM-379 | On a finite set of stimuli, regularized linear readouts with ridge b > 0 cannot tell apart two centred representations of the same width exactly when one is an orthogonal transformation of the other, and the unregularized CCA member cannot tell apart representations with the same column space, which differ by an invertible linear map | The proved core of CLAIM-269. What a regularized linear readout decodes is a function of K_X = X G⁻¹ Xᵀ/M, with G = aC_X + bI (THEORY-008). For b > 0, K_X and the Gram matrix XXᵀ determine each other, by a monotone map on the shared eigenvalues; and equal Gram matrices mean an orthogonal transformation (CLAIM-290, THEORY-004). For b = 0, K_X is the projection onto the column space, which fixes X only up to an invertible linear map, as for a softmax layer (THEORY-723). | Active |
| CLAIM-380 v2 | With finitely many states and finitely many outcomes, the positive part of the Bayes-risk increase on the same decision problem is directed, is zero from a garbling back to its source, vanishes for every finite problem and prior exactly when the rendering is at least as informative as the source, and has A86’s D_Q as its symmetrization | The finite-outcome part of CLAIM-326. Define D⁺_Q(U → V; π) = sup over q in Q of [r_q,π(V) − r_q,π(U)]⁺, with losses in [0, 1] and a stated prior. A garbling never gains. The term is directed. A86’s D_Q is its symmetrization. And with every finite problem and prior, it vanishes exactly when V is at least as informative as U, by Blackwell’s Theorem 6 (THEORY-717). It does not cover outcome spaces that are not finite, or say this is the right decision term. | Active |
| CLAIM-381 | Over a finite class of items with finite judgement outcomes, a constant outcome kernel fits every item only when the target readers’ averaged responses do not vary with the item, an exact fit is a garbling with the item as common parameter, and Le Cam’s deficiency and its restriction to finitely many decision problems are finite computations | The derivational core of CLAIM-228. Over a finite class of items, the target term is the readers’ response averaged over a procedure’s output, and one outcome kernel family is fixed across the items. Then a constant kernel fits only target responses that carry no information about the item. An exact fit is a garbling, with the item as the common parameter. And Le Cam’s deficiency between the two finite tables is one linear programme. Its restriction to finitely many decision problems is a finite computation. It does not say the measure is informative, which is CLAIM-228’s empirical question. | Active |
| CLAIM-382 | In an autoencoder initialised with i.i.d. Gaussian weights and zero biases and trained by SGD or momentum SGD on a loss of its output, the law of each hidden layer’s learned representation is invariant under every orthogonal map of that layer that commutes with its activation, so under a radial activation no basis is privileged in law, while elementwise tanh or Leaky-ReLU yields invariance only under the signed permutations or the permutations, which leaves the standard axes free to be privileged | THEORY-288’s symmetry argument, stated as the record’s own and proved. Transform the parameters by orthogonal maps Q_l of the hidden spaces that commute with the activation. The network then computes Q_l h_l and the same output, so the loss is invariant. Gradient steps commute with the transformation, and an i.i.d. Gaussian initialisation is invariant under it, so the law of the trained representations is too. For radial activations this is all of O(n), and no basis is privileged in law. For elementwise ones it is a finite group, so the axes may be privileged. Whether they are, and how strongly, is THEORY-288’s empirical content. The argument needs an orthogonally equivariant optimiser, and fails for Adam. | Active |
| CLAIM-383 | In plane Couette and plane Poiseuille flow, measured in the energy norm, the linearized operator about the laminar profile has transient growth at least cR and resolvent norm at least cR² with c independent of R, so wherever it is eigenvalue-stable a perturbation of norm at most CR⁻² makes it eigenvalue-unstable | THEORY-304’s scalings as lower bounds, derived. At streamwise wavenumber zero, the cross-stream velocities obey an R-independent Stokes problem in the time t/R. They force the streamwise velocity through −U′v, so the streamwise response is R times an R-independent field. In the energy norm this gives transient growth at least cR, and in the steady forced problem a resolvent norm at least cR². Through pseudospectra, a perturbation of norm O(R⁻²) then moves an eigenvalue into the unstable half-plane wherever the flow is eigenvalue-stable. The sharp constants, and that the growth is no more than order R, come from the computation and are not here. | Active |
| CLAIM-384 | For a network linearised at its initial parameters, with an isotropic Gaussian prior of precision α on the parameter displacement and Gaussian noise of precision β, the log-determinant part of the evidence is −½ Σ log(1 + βλ/α) over the non-zero eigenvalues λ of the empirical neural tangent kernel’s Gram matrix on the training inputs, so at most n directions are priced however many parameters the network has | Active | |
| CLAIM-385 v2 | If a symmetric operator on ℝⁿ commutes with an orthogonal representation of a compact group, each eigenspace is a sum of real irreducibles and each multiplicity a sum of multiples of their dimensions, so SO(2) and ℤ/n for n ≥ 3 force paired eigenvalues; conversely the spectrum fixes neither the group nor a basis inside an eigenspace | Active | |
| CLAIM-386 | For x(t+1) = (A* + εC)x with A* block-diagonal, the Simon–Ando aggregate  = QAV has one-step closure defect exactly QA − ÂQ = QA(I − VQ); the part from the blocks’ own dynamics vanishes iff every block has equal column sums, and then the whole defect is ε·QC(I − VQ) | Derived in the reading of Shpak, Stadler, Wagner and Altenberg (2004), NOTE-977, which states the Simon–Ando aggregate without an error term, and re-checked here. It splits the closure defect of block aggregates into a part from coupling between blocks, which is exactly first order in ε, and a part from the blocks’ own dynamics, which vanishes exactly in the equitable case of THEORY-755. Deterministic dynamics, one step; the post-transient orders reported below are numerical, not part of the claim. | Active |
| CLAIM-387 | Optimal deterministic information-bottleneck partitions at two budgets need not be nested: with X uniform on four states and binary Y with P(Y=1|x) = (0, 0, 1/8, 3/8), the optimum is {0,1,2 | 3} for 6.91 < β < 9.26 and {0,1 | 2,3} for 9.26 < β < 16.06, two partitions neither of which refines the other | Found by brute force in the reading of Equitz and Cover (NOTE-988) and re-run here from scratch. It answers the deterministic half of QUESTION-220 in the negative: raising the budget can reorganize the optimal partition rather than split it. The two optima are not even laminar, so no fixed tree holds both as prunings, and NOTE-676’s nesting is bought by its tree restriction. It says nothing about stochastic encoders, where finite-β optima generally live (THEORY-743). | Active |
| CLAIM-388 v3 | Exact dynamical closure of a collective variable does not require a nearly decomposable block: in a linear Gaussian VAR(1) with uniform coupling among n units, the sum of all units is exactly dynamically independent at every stable coupling strength, while every partition of the units into two or more groups couples as strongly across its edges as within them | From A5 of the exchange of 2026-10-19 on coarse-to-fine processes, which gave the two-unit continuous-time case (ż = (b − a)z for z = x₁ + x₂) and the boxed slogan “Exact aggregation ⇏ near-decomposability”. Made exact here for n units with THEORY-733’s sufficiency condition, and checked numerically. It answers the converse half of QUESTION-221. It does not say the closed sum is one system (QUESTION-218), and it is about partitions of the units: in the eigenbasis of A the same system is exactly decomposable, which is the point. | Active |
| CLAIM-389 v2 | In a stable linear Gaussian VAR(1), exact dynamical independence of a linear coarse-graining implies that its Mori–Zwanzig memory vanishes, but not conversely: memory needs coupling out of the coarse variable and back, and dependence needs only the way back, so a coarse variable can be Markov in its own law with zero memory and still be dynamically dependent | Derived in the reading of Chorin, Hald and Kupferman (2000), NOTE-989, and re-checked here. It settles, for the linear Gaussian VAR(1) class, the relation QUESTION-222 left open between memory in the reduced dynamics and THEORY-257’s dynamical independence: memory is the round trip Y → rest → Y, dependence the inward leg alone. Not about VAR(p ≥ 2), where the reading reports that an independent variable can carry memory, nor about nonlinear systems. | Active |
| CLAIM-390 | For a block of coordinates in a stable linear Gaussian VAR(1), dynamical dependence is at most ½ log det(I + Σ_YY⁻¹ A_YR C A_YRᵀ), with A_YR the coupling into the block and C the covariance of the rest given the block’s present state, so it is of second order in the coupling into the block, whatever the coupling out of it | First found in the reading of Chorin, Hald and Kupferman (2000), NOTE-989, as a by-product; derived and checked here. It answers the forward half of QUESTION-221 for a block’s full state: weak coupling into a block makes its dynamical dependence small, to second order. It is about the block’s full state, not its aggregate. For the aggregate, the block’s own internal dynamics add a defect of their own (CLAIM-386). | Active |
| CLAIM-391 | For any classes with weights π_c and per-class factor matrices H_c and Δ_c, the class-wise Kronecker product Σ_c π_c H_c ⊗ Δ_c exceeds the product of the weighted averages H̄ ⊗ Δ̄ by exactly the weighted between-class covariance Σ_c π_c (H_c − H̄) ⊗ (Δ_c − Δ̄), so the two agree when either factor is the same in every class | Active | |
| CLAIM-392 v2 | Stochastic information-bottleneck optima at two budgets need not be nested: for X uniform on four states and binary Y with P(Y=1|x) = (0, 0, 1/8, 3/8), the unique optima at β = 8 and β = 12 admit no Markov chain X → T₂ → T₁, so raising the budget reorganizes the optimum even with noisy encoders | Computed in the reading of Charvin, Catenacci Volpi and Polani (2023), NOTE-981, on the source of CLAIM-387, and re-run here. With THEORY-753’s criterion (refinable iff some pair of optima forms the chain, iff the coarse decoder points lie in the fine decoder hull when that hull is non-degenerate), and optima certified unique, the hull test fails. It answers the stochastic half of QUESTION-220 in the negative for this source. The certificate is numerical, not interval arithmetic, and the loss is small: 0.49% of the larger budget, in unique information. | Active |
| CLAIM-394 | In a stationary linear Gaussian VAR(1) that is time-reversible (AΠ = ΠAᵀ, Π the stationary covariance), every slow-feature direction is a left eigenvector of A, so any span of slow features is an exactly dynamically independent coarse-graining; off reversibility a slow feature is in general neither independent nor free of memory | Derived in the reading of Schüler and Wiskott (2025), NOTE-1015, and re-checked here. It says when slowness, the criterion of slow feature analysis (THEORY-746), picks out a closed coarse-graining in THEORY-733’s sense: always in the reversible linear Gaussian VAR(1), which is the class of noise-free square mixtures of independent AR(1) processes, and not in general otherwise. Linear features, linear Gaussian dynamics, lag one. | Active |
| CLAIM-395 | Under Montévil and Mossio’s definition of closure, a closed set of constraints has at least two members, and if each constraint is produced at the time scale of a constraint in the set that generates it and not at the scale at which it is itself conserved, the set includes at least one slow and one fast dependence, so a system with a single constraint of its own cannot realise closure | Active | |
| CLAIM-397 v2 | For a scalar stationary process with autocovariance C, the Mori–Zwanzig memory kernels for the projection onto the current value are fixed by C alone, through C(m+1) = Σ_{k≤m} c_k C(m−k); the memory vanishes iff C is geometric, and when C has finite Hankel rank d the memory has Hankel rank exactly d − 1 | Derived in the reading of Lin and Lu (2019), NOTE-1029, and re-checked here. It settles the minimal-order question CLAIM-398 left open, for every scalar stationary process with rational autocovariance, and gives the structural reason for CLAIM-389’s “not conversely”: the memory is a functional of the coarse variable’s own law, so it cannot register dependence on the rest of the system. | Active |
| CLAIM-398 | In a stable linear Gaussian VAR(1) on ℝⁿ, a scalar linear coarse variable Y = LX is, in its own law, an ARMA process of orders at most (n, n − 1); so its Mori–Zwanzig memory, though non-zero at every lag in general, is carried exactly by finitely many coordinates that are functions of Y’s own past and innovations | Derived in the reading of Chorin and Lu (2015), NOTE-1028, and re-checked here. Their NARMAX closures are fitted, with no error bound; in the linear Gaussian class the same idea is exact. A coarse variable with memory admits a finite Markovian augmentation built only from its own history, which is the augmentation THEORY-257’s criterion conditions on. Scalar Y, VAR(1), Gaussian noise. | Active |
| CLAIM-399 | Causal abstraction in the senses of Rubenstein et al., Beckers and Halpern, and Beckers, Eberhardt and Halpern does not secure governance-response sufficiency: exact transformation, τ-abstraction and zero approximate-abstraction distance all accept the hidden-bit coarse-graining, which loses ρ(h = 1) bits of the response to h, because each lets high-level noise carry what the coarse state drops; for one outcome and the identity correspondence, sufficiency is their compatibility condition with the high-level context fixed to the coarse state, and strong abstraction rejects the case only through interventions on the hidden parameter | The record’s join, on 2026-10-21, of its readings of the causal-abstraction papers (NOTE-1037, NOTE-1032, NOTE-1045) with CLAIM-407. A25 of the exchange of 2026-10-20: “We should not present governance-preserving coarse-graining as a new general theory of causal abstraction.” That stands. But it is not an instance of these papers’ notions either: their criteria compare interventional laws and let the high-level context be any map that works, so they accept the hidden governance bit, whose coarse state keeps nothing of the response to h. Re-checked step by step against the three THEORYs. It corrects TERM-067’s first wording, which read the profile as TERM-043’s causal component with the identity correspondence. | Active |
| CLAIM-400 v3 | In the meaning–authority model linearized at symmetry, a third, maintained legibility state that authority moves (ε) and that moves interpretation (ν) or endorsement (μ), with persistence λ < 1 and nonnegative couplings, destabilizes the symmetric state exactly when the two-variable condition holds with β + νε/(1 − λ) in place of β and δ + με/(1 − λ) in place of δ: at the threshold the regime is indistinguishable from stronger two-variable couplings, and the slower it is the more it adds, while away from the threshold it adds a mode that no two-variable model has, so a lean in the regime can outlast the advantages it was built from | QUESTION-253 asked whether authority’s effect on what becomes legible as evidence is a third channel with its own instability condition, or CLAIM-340’s κ′ renamed. Both, in different respects. With a maintained legibility state r, det(I − J₃) = (1 − λ)[(1 − α)(1 − δ) − βγ] − ε[νγ + μ(1 − α)], which is (1 − λ) times CLAIM-330’s expression with β_eff = β + νε/(1 − λ) and δ_eff = δ + με/(1 − λ). So the instability threshold is a two-variable one with stronger couplings, and a slower regime (λ near 1) adds more. Away from the threshold, r is a third mode: a lean in the regime can hold interpretation and authority off symmetry after they would have relaxed, which no two-variable parameters reproduce. | Active |
| CLAIM-401 v3 | The conditions an effective description is commonly asked to meet are not of one kind: predictive sufficiency and approximation fidelity are adequacy relative to a declared target, metric and horizon; tractability restricts the operations under which adequacy is assessed; dynamical independence and memory closure are relations of the representation to the system, memory relative to a chosen projection; so a matrix over them as independent binary axes conflates kinds | A4 and A5 of the exchange of 2026-10-20, on the owner’s U4 (“it sounds like considering it from this angle has potentially already altered our characterization of those ‘virtues’”). A4: “(P) and (A) look increasingly like evaluation criteria, while (D) and (M) describe different aspects of system–representation structure. (C) describes resource accessibility.” A5: approximation fidelity “may specify the degree to which a prediction or dynamical relation is preserved”, and tractability “can instead restrict the operations over which preservation is evaluated”. The record adds what A5 missed: memory is relative to the projection too (QUESTION-222, THEORY-752, CLAIM-397). It is CLAIM-348’s “adequacy is fixed by the evaluative target” applied to the axes of a comparison. It does not say the five reduce to three. | Active |
| CLAIM-402 v5 | Predictive success of a category across contexts warrants treating it as a real effective kind only when the evidence in those contexts does not pass through the category’s own use, or when the effect of that use is modelled: a category that speakers or institutions act on can produce the regularities that confirm it, and contexts that share its use are not independent | A27 §1 of the exchange of 2026-10-20, on the owner’s U27 (“are we perhaps better positioned now to address QUESTION-007? -009? -011? -028?”), after A26 §2’s performative toy. It is the one criterion A27 added to A191’s four on QUESTION-028’s page, and NOTE-769 anticipated it from Hacking’s interactive kinds. CLAIM-342’s condition on evidence, moved from a judgement–observation loop to the warrant for a kind. The sharp edge: it defeats one inference and is not a criterion of kindhood, so QUESTION-028 stays Open. | Active |
| CLAIM-403 v5 | A contribution’s admission to an organization’s inquiry, its recognition in apt terms, its credibility, its uptake into judgements, and its contributor’s part in revising the standards of uptake are separable, each possible without the later ones, so an organization can widen access while every channel by which a less authoritative contribution could change the criteria of authority stays closed | A24 §6 of the exchange of 2026-10-20, on the owner’s U24: “Someone’s contribution may be received and politely acknowledged yet have no mechanism through which it can change institutional understanding.” A25 §5 repeated the split from the side of visibility, and A27 §6 used it of consultation. CLAIM-349 has the three-step form for an organization’s own signals. This carries it to contributors and adds the top rung, Longino’s tempered equality and QUESTION-041’s channel. It does not say that every contribution is owed uptake. | Active |
| CLAIM-405 v2 | An individuation is well defined only once its criterion is fixed (the target it serves, the transformations its unity must survive, the scale), and that dependence does not make it arbitrary: once the criterion is fixed a verdict can be false, and differently fixed criteria can pick out units of one system whose boundaries cross rather than nest, none of them less real for it | The individuation counterpart of the owner’s normative thesis CLAIM-363 (“once they are fixed, the judgment can be false”), as A8 and A9 of the exchange of 2026-10-20 put it, on the owner’s U8 question about “contextuality/relativity/subjectivity”. A8 §9: “the underlying system is objectively real, while some scientifically meaningful properties of its descriptions are objectively relational.” A9: “an individuation claim can be objectively assessed once its relevant organizational criteria are specified”, and “A system may exhibit several objectively grounded forms of unity that need not share the same boundary.” CLAIM-152 gives the relativity; this claim adds that relativity is not arbitrariness. It bears on QUESTION-065 without answering it. It does not say which criterion is right. | Active |
| CLAIM-406 v5 | Structural, pre-emptive testimonial injustice has the form of the record’s trust loop: an arrangement that decides whose word is sought can keep an early exclusion going through the indicators of competence that only being sought produces, with no continuing prejudiced act; but the loop alone cannot tell perpetuated privilege from merited expertise, because that needs the prejudice condition the dynamics do not contain | The owner’s, U24 of the exchange of 2026-10-20, on A23’s closing thesis: “this seems to me reminiscent of themes in feminist philosophy, e.g. perpetuation of privilege”. A24 granted it. CLAIM-277’s loop already runs from early advantage to “undeserved authority”, and its note of 2026-10-18 from the side that loses. Fricker’s un-refreshed list (THEORY-327) is a case of it in which some people’s views “are not sought”. The sharp edge: the loop is the same whether what it entrenches was earned, and only a prejudice makes it an injustice. | Active |
| CLAIM-407 v3 | A coarse-graining exactly informationally closed under a process’s ordinary dynamics need not preserve its responses to an intervention on the mechanism: for a declared intervention distribution ρ, independent of the state, the deficiency Γ = I(S; Y^(I) | T(S), I) can be positive, as in the hidden governance bit, where it is ρ(h = 1) bits; and Γ = 0 exactly when, for every intervention ρ charges, the response kernels are constant on T’s fibres over the states of positive probability | A16 §3–4 of the exchange of 2026-10-20 and A17 §4.2–4.3, its paper’s Proposition 1, reused at A18 and in A23’s audit. A16: “a representation can be perfectly informationally closed under the ordinary dynamics while failing to preserve a governance-relevant counterfactual distinction.” The witness is CASE-125; the proof is in the body, checked exactly on 2026-10-21. The qualitative point was on file: CLAIM-350’s “What it does not say” (A22’s Construction B of 2026-10-17, CLAIM-127), and CLAIM-122’s supervisory test, whose note of 2026-10-18 has it without parameters. New here are the parameters, the deficiency Γ and the exact condition for Γ = 0. It is an application of ordinary causal sufficiency, not new information theory, and it does not say the system governs itself. | Active |
| CLAIM-408 v3 | In ḋ = (α − κ)d − βd³, with d the difference between two parties’ shares of authority, α their self-reinforcement and κ a constraint that bears on both alike, the equal allocation is the only equilibrium and is stable for κ > α, and for κ < α it is unstable and the unequal allocations ±√((α − κ)/β) are stable: a constraint that favours neither party can, by weakening, destabilize the equal allocation and make persistent unequal allocations stable, of any size near the threshold (|d*| → 0 as κ → α), without determining which party gains the larger share, and in this model restoring κ > α restores the equal allocation | A19 of the exchange of 2026-10-20, on the owner’s U19: does the account “capture ‘deregulation’ as a disguised effort to induce organizational symmetry breaking?” A19’s model is a supercritical pitchfork, CASE-112’s normal form with no tilt and μ = α − κ. The stability analysis is checked here, algebraically and numerically. A19: “A policy can be neutral with respect to the identities of participants while being non-neutral with respect to the kinds of power distributions its dynamics produce.” The claim is about the model. It says nothing about any reform, or about anyone’s intent, and it does not show that a tipped allocation outlasts the constraint’s return: in this model it does not. | Active |
| CLAIM-409 v2 | For one state law, one intervention distribution and one outcome, a deficiency of sufficiency cannot increase under refinement: if T₁ = g∘T₂ then Γ(T₂) ≤ Γ(T₁); informational closure, by contrast, is monotone in neither direction, since in the three-bit chain of Rosas et al. (2024) A is closed, its refinement (A, B) is not and the full state refining that is closed again, while A⊕B, a coarsening of (A, B), is not closed either; closure fails to be monotone because refining a description changes the future it must predict as well as the evidence, so Blackwell dominance, which every deterministic refinement has over its coarsening, does not order closure | Two readers’ drafts of one point, from A6, A7, A16 and A17 of the exchange of 2026-10-20. A16 §5 and A17’s Proposition 2: a fixed-target deficiency is refinement-monotone; “Adding information cannot hurt exact sufficiency for an unchanged question, but changing what the description is expected to explain can expose new dependencies.” A6 §6 and A7’s Proposition 3: “Increasing the information retained by a representation can destroy a desirable dynamical property”, and “There is no general data-processing inequality ordering these quantities, because both the predicted variable and the conditioning information change.” This claim joins them, and corrects A7’s slogan “When More Information Reveals Less Autonomy”: closure is not reversed by refinement, it is unordered by it. Checked exactly on 2026-10-21. | Active |
| CLAIM-410 v4 | Removing a constraint on an organization’s members does not move it along one scale of more or less governance: it changes a profile of who holds rule-making, monitoring, enforcement, appeal and revision, in which the authority the constraint held can be eliminated, distributed or transferred, and the members’ first-order options and their share in revising the conditions of their action can move in opposite directions | The owner’s question, U18 of the exchange of 2026-10-20: “what does this suggest about e.g. “deregulation” as an ideological end?” A18: removing a regulator “does not remove governance”, and the question is whether a change “eliminate[s] an exercise of authority, distribute[s] that authority, or transfer[s] it to another locus”. Its five-part profile generalizes TERM-017’s three relations, which “can vary independently” (CLAIM-057), and its two freedoms are CLAIM-086’s distinction carried from a constraint to its removal. The sharp edge: it says nothing about whether any deregulation is good, or about what any actual reform did. A18: “This doesn’t establish that deregulation is good or bad.” | Active |
| CLAIM-411 v5 | Under the broad, nonphenomenal definition of interpretation the constitutive thesis uses, substantial processing that is not independently shown to be experiential meets the definition, blindsight’s apparently unconscious visual discrimination among it, so interpretation alone does not establish experience, and the thesis must say which further organizational properties, if any, make an interpretation experiential | A3’s “most serious challenge” to the owner’s thesis, which every later reply accepted. Once interpretation is defined broadly and without experience, as the thesis requires, it admits much processing that is not shown to be experiential: “Interpretation ⇏ Conscious experience. At least, not under an unrestricted definition of interpretation.” The objection is that the thesis is incomplete, not that it is false. A7 kept it as the theory’s “open sufficiency condition”. The record already separates access from experience (QUESTION-048, THEORY-577), and the candidate conditions the exchange named (global availability, integration, higher-order or recursive modelling, valuation, perspective) are the question QUESTION-254 asks. | Active |
| CLAIM-413 v3 | Grounding is not a property of an experience but a relation among an interpretation, what it purports to be about, and a process that constrains it independently; its current, developmental and epistemic senses come apart from one another, and in the current sense it comes apart from whether the interpretation occurs, so ungrounded is not unconstrained, and what makes an interpretive organization experiential need not be what makes its contents veridical | The owner’s premise at U1, that sensory apparatus is necessary for grounded experience, as A1, A3, A5 and A7 restated it. A1: “grounding is fundamentally relational, whereas interpretation can, in principle, be internally realized.” A5, after reading CLAIM-342: “Sensory grounding may concern the independence of the constraints on interpretation, rather than the existence of interpretation itself”, and “Ungrounded ≠ Unconstrained”. A7 separated current, developmental and epistemic grounding. The epistemic sense is CLAIM-342’s, so the claim rests on it. The occurrence half is the owner’s. A7: “What makes an interpretive organization experiential is not necessarily what makes its contents veridical.” | Active |
| CLAIM-414 v4 | Matched ordinary trajectories can conceal differences in an interpretation’s efficacy, in the allocation of that efficacy, and in the maintenance of its enabling constraints: in two finite constructions, systems that agree under ordinary operation differ in each, and a specified intervention exposes the difference that passive observation of the matched trajectories does not | A10 of the exchange on experience and interpretation, re-run here. Three one-bit systems behave alike when the interpretation is 0. Under an intervention that sets it to 1, the first never acts on it, the second acts at once, and the third acts one step late, because its own interpretation opens the gate. Two two-constraint systems have the same trajectory, (1,1) throughout. A single perturbation runs one into (0,0) and leaves the other restored to (1,1): one maintains its constraints by CLAIM-395’s minimal slow–fast closure, the other is reset from outside. These are CLAIM-407’s lesson about governance and CLAIM-194’s about boundaries, applied to interpretation. | Active |
| CLAIM-416 v4 | Competing perspectives compete over the tests that measure them as well as under them: success under an evaluative regime is evidence of competence relative to that regime, a fair test need not be neutral across competences, and a perspective that gains influence over the test can change what later success shows | From the owner’s case at U35 of the exchange of 2026-10-22, rival schools of martial arts vying for dominance, and A35–A37’s development of it. A35: “Competition selects perspectives, but perspectives also shape what competition selects for.” A37: “Being effective under a test is not the same as possessing authority to determine what the test should measure.” It is the one mechanism in the second half of the exchange the record did not already hold in some form. The edge: it does not say that tests are unfair or that rules are changed in order to entrench, which A36 kept apart as a further claim needing its own evidence. | Active |
| CLAIM-418 v3 | Possessing, enacting or being shaped by an organizational perspective does not establish an independent agent, and perspectival, agential and institutional boundaries need not coincide: several agents can share a perspective, one agent can act through several, and a perspective can be reproduced with no agent governing it; where a perspective contributes to an agent’s activity it can enable and constrain the exercise of agency, and that exercise can reproduce or transform it, while whether agency universally requires such a perspective stays open | From the branch of the exchange of 2026-10-22: the owner’s question at U38, “what’s the relationship between perspective and agency?”, A38’s answer, and A39’s request that it be recorded. A38: “Perspective concerns how a situation becomes meaningful and actionable. Agency concerns how an organized system can make a difference to what happens.” The claim takes the half A38 called “substantially safer”: not every organization of practical significance is an agent. It leaves A38’s other half, that every rich exercise of agency involves such an organization, as open. | Active |
| CLAIM-419 v2 | The record’s grammar is fixed at any moment but amendable by decision, and in practice a move that fit no scheme or relation has repeatedly been treated as a defect of the grammar and answered by amending it, so a move the grammar cannot hold is not only forced or lost; whether every such move is caught is not shown | The owner’s, at U18 of the exchange of 2026-10-22: “when we’ve encountered representational challenges, we’ve generally interpreted those as a symptom of a represntational weakness of the record and used that opportunity to mature the luria configuration, featureset, or both.” It answers CLAIM-181, which had no reply on file, with the record’s own decisions as evidence. It narrows CLAIM-181 rather than defeating it: the record shows moves that were caught and the grammar amended, and one case (ADR-032’s literature roles) where a recurring move was left in prose. | Active |
| CLAIM-420 v3 | A historical figure’s influence can persist in three separable ways, as a story about them, as a perspective transmitted from them, and as later organizations that descend from their activity, and causal descent is not perspectival inheritance: a movement founded to oppose someone can descend from them without continuing their perspective | From the owner’s U38 of the exchange of 2026-10-22, corrected. The owner contrasted “immortality” through positive influence that reinforces itself across generations with notoriety whose influence is “self-undermining”, the figure’s story persisting while their perspective does not. A38 corrected the example and declined the tidy mapping of positive to self-reinforcing and notorious to self-undermining. What survives is the distinction: “The persistence of a story about someone is not equivalent to the persistence of that person’s perspective.” | Active |
| CLAIM-421 v4 | The cessation of an organizational perspective’s enactment need not imply the loss of the dispositions, capacities or reproductive relationships from which it can be reinstated: an interruption can be of activation (the disposition is held but not engaged or retrievable), of enactment (held, but the material, institutional or social conditions for exercising it are gone) or of reproduction (held by some bearers, but the processes that pass it on are damaged), and temporary unavailability is not extinction, though prolonged interruption of reproduction can end a tradition | From the branch of the exchange of 2026-10-22, at the owner’s U37: the doorway effect as perspective meeting grounded experience, and the perspectival interruptions of the Chinese Cultural Revolution. A37 drew the distinction the record’s account of perspective lacked, between the conditions under which a perspective is acquired or reproduced and the conditions under which it stays available. The edge: a doorway and a political revolution are not the same kind of forgetting, and the claim says only that both separate a capacity’s existence from the availability of the conditions for exercising it. | Active |
| CLAIM-422 v3 | A successful corrective act, an executable procedure and a maintained organizational capacity are three different things, so an organization can record a correction, even rewrite its rules, without the corrected capacity being maintained | From A24 and A25 of the exchange of 2026-10-22, on the owner’s cases of a fireground mayday that changed a safety culture (U23) and NASA’s learning before and after Challenger (U25). A24: “A successful act, an executable procedure, and a maintained organizational capacity are three different things.” A25: “Institutional learning is not complete when an organization changes its rules.” It rests on CLAIM-025, which separates the operative regime, the governing organization and the capacity to transform it, with the record’s reading of the Columbia board (THEORY-140) as corroboration. The edge: a recorded correction is evidence of a correction, not of its maintenance. | Active |
| CLAIM-424 v3 | Reflexive governance of an organization’s perspectival arrangements, making the conditions that govern its own interpretation, evaluation and action available for effective examination and revision, is a capacity some organizations of perspective have and others lack, not what makes something a perspective; and the capacity to revise those standards is not the capacity to revise them well | A37’s definition, from the exchange of 2026-10-22, re-scoping CLAIM-284. CLAIM-284 says that a self, in the self-governing sense, is an organization that governs the conditions of its own persistence. Every reply from A31 on read it as “a proposed special case”: a perspective can be reproduced, persist and adapt without governing its own reproduction. The edge is A37’s: “the capacity to revise the standards of evaluation is not equivalent to the capacity to revise them well”, which keeps CLAIM-288’s objection standing. | Active |
| CLAIM-429 v2 | Where interpretation decides the occasions for cooperation and cooperation’s outcomes revise interpretation, an intervention can change the loop’s state or its coupling: a favourable exception changes the state and leaves the rule that judges exceptions as it was, while a change in how far outcomes may revise the governing interpretation changes the coupling, and where the coupling does not depend on the state, only the second changes how later evidence is taken | From the exchange of 2026-10-22, “Ben Franklin Effect Explained”, A5: “One could ask whether a perspectival invitation changes only the initial state of the system, or also changes the coupling parameters—the degree to which cooperative outcomes acquire authority over future interpretations.” And: “It is the difference between introducing a positive exception and changing how exceptions are allowed to revise the rule.” The owner took the line up at U6. The claim puts it in the terms of the record’s coupled meaning–influence model (CLAIM-297, CLAIM-330). | Active |
| CLAIM-434 | On a finite set of outcomes, some function rises with every move that wins one of a negotiation’s conflicts exactly when no chain of winning moves returns to where it began, and the length of the longest such chain ending at an outcome is one such function; a perfectly transitive record of which side won each pair, in a complete tournament contesting every pair once, leaves a cyclic share of (n − 2)/3n under the Hodge decomposition, a baseline that does not carry to sparse records; the Hodge gradient can reverse a comparison the wins settle, netting a record erases alternation, a record fixes a class of potentials rather than one, a coherent record is not yet one aligned with any single perspective’s ordering, a best-fitting ordering of a cycle is no Lyapunov function, the sign a class of potentials gives can be set-valued, and an ordering fitted to a record overstates its agreement there | The formal core of the rename of 2026-10-23 from “ascendancy” to “potential” (TERM-076). Part 1 is the finite case of Monderer and Shapley’s equivalence between the finite improvement property and a generalized ordinal potential, proved here because the record has not read their paper (LIT-1462). Part 2 is a calibration of the Hodge decomposition (Candogan et al.; Jiang et al.) for binary conflict records, computed here: even a perfect ranking leaves a cyclic residual. Part 3 separates coherence from alignment. Parts 9 to 11 were added after a second review. Parts 4 to 8 were added when a review of the pull request found that the measures built on parts 2 and 3 confused ordinal and cardinal structure; each is checked in scratch/formal/valence.py. | Active |
| CLAIM-436 v4 | An instantaneous ordering is a common currency on a finite set of options, where every complete preorder has a real-valued representation, but not in general: the lexicographic order on the unit square has no real-valued representation, while a continuous complete preorder on a connected separable space has a continuous one; so admitting an ordering is strictly weaker than admitting a currency, a graded lexicographic override lies in the gap while an exact threshold override does not, a threshold override with a discrimination threshold is a lexicographic semiorder whose choices can cycle and so is no ordering at all, and even where each instant has a currency, successive currencies need not share exchange rates | The formal half of the owner’s reframing of 2026-10-23, that a “common currency” is better read as a negotiation admitting an (at least instantaneous) ordering. On finite option sets the two coincide at each instant. On a continuum they do not: a graded lexicographic order, one form ALARM’s “100% weight” override could take, admits no numerical representation, while a continuous ordering, the form of Veit’s proportional trade-offs, admits a continuous one (Eilenberg; Debreu). A threshold override admits a discontinuous one, and one with a discrimination threshold, a lexicographic semiorder, can cycle and admits no ordering at all (Luce; Tversky). Across instants, representations need not be related, so a sequence of currencies need not be one currency. | Active |
| CLAIM-443 v3 | A learned prior over which processes govern, P(g | z, H) ∝ exp(βQ(g, z) + b_H(g, z)), its bias b_H trained by reward-modulated Hebbian updates to the relations by which one process recruits or endorses another, is a candidate mechanism for durable authority and for amortized governance; but persistence is not amortization, which is shown only when earlier work replaces later computation, communication or recruitment, and a prior over authority differs from a prior over actions only when what is appropriate changes | The owner’s, 2026-10-23, on whether practice could reconstruct relations of practical authority: “what if we just treat this as a kind of momentum term? or like a hebbian prior?” Worked through the same day (workbench entry of 2026-10-24, U9–U12). Momentum is read as switching cost, the Hebbian prior as a learned bias over allocations of authority, and two limits are kept: persistence is not amortization, and a prior over authority must be told from a prior over actions. | Active |
| CLAIM-448 v3 | An ordinal potential describes only the winning-move relation it is computed on; where an organization’s legibility regime selects which contests are admitted or recorded, an acyclic record, even a persistent potential, can be the product of selective contestation, so observed coherence is not evidence that the organization’s perspectives are integrated, and an intervention that improves its self-governance may at first increase the disagreement observed | From the exchange of 2026-10-24 (workbench entry of 2026-10-24, U19–U21), after the owner pointed to CASE-124 (“i think we already have a three variable system somewhere, where the third component is described as legibility”) and asked for the synthesis to be tied back: if the legibility regime decides which objections are registered, the record of wins on which CLAIM-440 reads valence can be acyclic for the wrong reason. Objects to reading a prevailing potential as an integrated organization’s valence without a check on what was admitted. | Active |
| CLAIM-449 v2 | The potential account of valence’s first consequence, no frustration, no valence, runs together two relations: perspectives’ contested rankings, which a record of winning moves registers, and demands that are jointly infeasible, which the compatibility complex registers; rankings can contest while every demand is satisfiable, and demands can be infeasible before any contest is recorded, so the consequence needs one of them named, and the absorbed writer, reported as positive with nothing contested, tests whichever is chosen | Raised in the exchange of 2026-10-23 (workbench entry of 2026-10-24, U5), when the owner asked for “cases or theories that aren’t richly connected but which may bear on questions or claims more deeply than we are giving them credit”. The reply proposed “a new counterclaim against consequence 1 of CLAIM-440, explicitly distinguishing evaluative disagreement, contested efficacy, and structural frustration”, grounded in the absorbed writer and the three-demand case. Filed here at the owner’s request to record the exchange. | Active |
| CLAIM-450 v5 | Three standards for a communicative distinction come apart: statistical distinguishability of an interpreter’s response profiles, measured locally by the Fisher metric and never raised by a parameter-independent garbling; usability by a bounded receiver, which a transformation can raise; and pragmatic efficacy in the act; and where response models are singular, as Watanabe’s theory treats, a missing response can come from an absent attempt or an unresponsive receiver alike, and only intervention or later dynamics separate them | The owner’s, 2026-10-24, after setting aside the belief–knowledge distinction: “forget about that distinction then and let’s connect back to the communicative act stuff and amari/watanabe theory”. Worked through the same day (workbench entry of 2026-10-24, U27). Amari’s geometry and Watanabe’s singular learning are given different jobs in one modelling architecture, alongside bounded legibility and the communicative-act account, rather than read as rival characterizations. | Active |
| CLAIM-452 | For an organization whose response in each probe context is the authority-weighted mixture of its processes’ known response profiles, the authority shares are identifiable from a set of contexts exactly when the processes’ stacked profiles over those contexts are affinely independent; because the response is linear in the shares, local and global identifiability coincide, the condition is that the Fisher information of any design supported on those contexts is positive definite on the simplex’s tangent space, and with binary outcomes at least one context fewer than there are processes is needed | When an organization’s response in context c is p_π(·|c) = Σᵢ πᵢ pᵢ(·|c), the mixture CLAIM-444 reduces the replicator model to, which probe contexts reveal its authority shares π? Exactly those over which the profiles are affinely independent. The response is linear in π, so there is no gap between local and global identifiability, and the condition is the Fisher information of CASE-159’s pullback being positive definite on the tangent space of the simplex. Each binary context adds at most one rank, so k processes need at least k − 1 contexts. It is a condition checkable before any data, which is what QUESTION-031 asks for; none of the three works read on 2026-10-25 states it. | Active |
| CLAIM-453 v2 | A population of perspectives, each advocating one of two interpretations, makes its collective choice by drift diffusion when the coordinate the decision is read from integrates independent evidence with no net leak or self-reinforcement and commitment is a bound on that coordinate; two interpretations make the reduction one-dimensional, but they do not by themselves give it | The owner’s hypothesis at U34 of the exchange of 2026-10-24, continued: “if we’ve set up our simulation appropriately, when n=2 we should see drift diffusion dynamics”. It is the owner’s second statement of CLAIM-262’s continuous case, first given on 2026-10-12. A34 qualified it, A35 gave the dial, and A36 gave an exact reduction for a network of accumulators. The record’s own replicator construction gives a second, which the exchange did not see. Both were checked when filed. The sharp edge: two interpretations are necessary for a one-dimensional reduction, not sufficient. | Active |
| CLAIM-454 v2 | A latent feature or mode recovered from an organization’s members’ activity is at most a constituent of an organizational perspective, not the perspective: a feature allocation says which members take part in which modes, and whether those modes are organized into one perspective depends on the relations of access, uptake and authority among their carriers, which the same allocation leaves open | From the Northstar turns of the exchange “Experimental Infrastructure Review”, where the owner proposed inferring an organization’s perspectives with hLDA (T21) and the Indian buffet process (T22). Every reply made the same reservation, and T22 put it most plainly: “None of those ingredients alone is the perspective. The organized relationship among them is.” It is the criterion QUESTION-276’s answer has to meet. It does not say features are useless, or that no perspective is ever one feature’s carriers. It says the allocation underdetermines the perspective. | Active |
| CLAIM-455 | For one bounded observer, a transformation of a representation can make one task’s distinction legible and another’s illegible at once, so legibility regimes are ordered only relative to a task, and a regime that improves one perspective’s competence can disable another’s | Stated in CASE-154’s title and its “What it can show” and held by no claim, found in the audit of 2026-10-27 for propositions cases state that no claim holds. With two fair bits and an observer that reads one coordinate and cannot compute XOR, the raw pair gives 50% error on the XOR task and 0% on the first bit, and the XOR gives the reverse. CLAIM-199 says a garbling can raise usable information for a receiver; this adds that the same garbling lowers it for another task of the same receiver. The edge: one observer, two tasks; nothing about which task matters. | Active |
| CLAIM-456 v2 | Maintaining a governing rule internally, by the organization’s own reciprocal production, can be more fragile than having it reset from outside: arrangements identical in ordinary operation can differ in which losses are repairable, and the self-produced rule can be lost to a double loss or an interruption of the work that produces it which outside reset survives | Stated in CASE-161’s “What it can show” (“internal maintenance can be the more fragile arrangement”) and held by no claim, found in the audit of 2026-10-27. In the lab’s 32-member population, with ordinary trajectories identical, reciprocal production restored one zeroed rule in 48 of 48 runs and both zeroed in 0 of 48, and lost both rules to an 80-update producer outage in 48 of 48, where external reset restored every case. An existence result in one stipulated population. The edge: it says nothing against self-governance, only that self-production is not robustness. | Active |
| CLAIM-457 | That no single institution can bring about a remedy does not imply that no combination of them can: the institutions able together to realize a corrective outcome need include none able alone, so a true statement of unilateral inability is not a statement that the outcome is unattainable | A8 and A9 of the exchange of 2026-10-26, on the owner’s CECOT case at U7: the United States said it could not bring a man back from Salvadoran custody, and El Salvador’s president that he could not send him. Both can be true while the two together can, and the June 2025 return showed they could. Demonstrated by a construction. The edge: being able to realize an outcome together is not being responsible for it together, and feasible, authorized, willing and compellable coalitions are four families, not one. | Active |
| CLAIM-458 v2 | A reception split between populations with unequal access to the source can be partly a difference of access and not of weighting, so a comparison of their default tasks can fit weights only on the components every population compared can perceive | The limit CLAIM-240’s note of 2026-10-10 recorded and did not code, filed as an objection. CLAIM-240 reads a holistic fidelity judgement as a default task’s weighting of the profile’s components. In the split over The Vegetarian, some divergences are invisible to readers without Korean (“Most English readers will simply glide over them unaware”), so their weight is zero by blindness, not by a task. The objection undermines a test of CLAIM-240 across such populations unless it fits weights only where both can perceive. It narrows the claim; it does not deny it. | Active |
| CLAIM-459 | An input to a bistable balance of authority can be sincere and causally efficacious without changing which regime operates: below a threshold the structure of the competition sets, it moves the balance within the current basin, so a higher-order volition that changes nothing visible need not be idle | Stated in CASE-112’s title and its first “What it can show” bullet and held by no claim, found in the audit of 2026-10-27. In ẇ = μw − w³ + h with μ > 0, the operative regime changes only when |h| passes 2μ^{3/2}/(3√3); for 0 < h < h_c the input moves w and leaves the regime. A8 of the exchange of 2026-10-17: “An endorsement can be sincere and causally efficacious while remaining too weak to shift the system out of its current attractor basin.” The edge: efficacy on the balance, not on behaviour; the claim says a null in behaviour is no evidence of a null input. | Active |
| CLAIM-460 v2 | In the completely locked-in state, evidence of lucid judgement has to cross a channel the patient drives, which is action in active inference’s sense, so such cases can show the judgement–observation loop running down but never running with no action at all, and a null result cannot tell lost judgement from a lost channel | Stated in CASE-107’s “What it can show” (“CLIS is the test, and it is asymmetric”) and held by no claim, found in the audit of 2026-10-27. CLAIM-341’s defeater (b) asks for evidence that lucid judgement fails with every contingency removed, “by evidence that does not itself restore such a contingency”; the case argues that the confirming direction cannot be had either, since any report needs a channel. Chaudhary et al.’s patient communicated only once neurofeedback restored a contingency. The edge: a limit on evidence, not a verdict on CLAIM-341. | Active |
| CLAIM-462 v3 | An arrangement of institutions can keep, or increase, its capacity for effective action while its capacity to be effectively corrected by others degrades, because the two are maintained by different relations, so the first is no evidence of the second | A8’s candidate central result and A9’s conjecture, from the exchange of 2026-10-26: “A complex institutional system can preserve or even increase its capacity for effective action while losing its capacity for effective correction.” It carries CLAIM-422 (a correction is not a maintained capacity to correct) and CLAIM-099 (effective action is not governance among regimes) from one organization to correction by other institutions. The edge: it is about relations, not about any government’s conduct, and says nothing about which corrections are owed. | Active |
| CLAIM-463 | Restoring the conditions under which a capacity was lost need not restore the capacity: where the activity that maintains it reinforces itself, the same conditions can sustain both the capacity and its absence, so a capacity lost past a threshold returns only under conditions better than those it was lost under, or by rebuilding the activity directly, and restoring it can cost more than preserving it would have | A4’s claim candidate from the exchange “About the Chagossians” of 2026-10-26, “Resource restoration does not imply organizational restoration”, which the first filing declined because CASE-111 already derives it; the owner asked for it to be filed as a claim with its connection to the case. Demonstrated by CASE-111’s normal form: in the bistable range, returning the parameter to its pre-collapse value leaves maintenance at zero. The edge: a possibility shown in a model, not a finding about any grant program, people or institute, and a slow recovery is not evidence of the threshold. | Active |
| CLAIM-464 v2 | An intervention can change what it would take to correct it: by altering the distribution of control, access, resources or enforcement before it is reviewed, it can make a specified corrective outcome costlier or unreachable while the standards that govern that outcome stay the same | A7 to A9 of the exchange of 2026-10-26, from the owner’s U6 and U7: the police entry at USIP before any court ruled, the East Wing demolished before review, and transfers into foreign custody. A7 named it “endogenous remedial constraint”, preferring that to fait accompli, which “describes an outcome but does not specify the causal mechanism”. A possibility claim with three mechanisms: physical irreversibility, enforcement-mediated entrenchment and jurisdictional displacement. The edge: it says nothing about intent, and nothing about how much weight a court should give to risks the act created. | Active |
| CLAIM-466 v2 | Lock-in from selectively admitted evidence and lock-in from self-scoring need different remedies: weighting admitted evidence by known, positive admission probabilities undoes the first and leaves the second, so correcting for how evidence was selected is not correcting how it is scored | Stated in CASE-162’s “What it can show” and held by no claim, found in the audit of 2026-10-27. In the lab’s population, admission that depends on the record left the worse alternative in charge in 41 of 64 worlds, and exact inverse-propensity weighting brought that to 0 below full selectivity; with self-scoring alone (c = 0.5, nothing censored) 39 of 64 stayed wrong and the correction changed nothing. CLAIM-404 holds that the informational and evaluative routes are distinct; this says their remedies are too. The edge: the correction is an oracle’s, with known propensities. | Active |
| CLAIM-467 v3 | Under full-information, independent audits, a learned allocation of influence among specialists is no better than a contextual router trained on the same audits, which is a mixture of experts whose experts earn responsibility by fitting better; whatever governance adds over routing has to be shown where evaluation fails, and the record has not yet found such a regime | The prediction CASE-158 states (“Under full information, governance should not beat it”) and held by no claim, found in the audit of 2026-10-27; the runs were reported in CASE-158 and reproduced in CASE-162, where the router had the lower error in all four cells, selective and captured audits included. It gives CLAIM-278’s objection a definite form for this model class. The edge: it bounds governance by routing under full information; it does not say governance never helps, and the regimes where it might (QUESTION-271’s four failures) are untested or, so far, lost. | Active |
| CLAIM-469 v2 | Luria is an apparatus for a record’s objects in the operational sense: through its schemes, vocabularies, validators and generated views it realizes a system of distinctions that fixes what counts as a referable and governable object within the record, so that a split scheme makes one object two and a promoted vocabulary makes a value an entity; it keeps, enforces and propagates those distinctions; and its distinctions are revised through the record’s own use | The operational half of CLAIM-476, split from it at the owner’s review of the pull request. In TERM-089’s sense, which needs no observer and no constitutive metaphysics, luria differentiates, retains, enforces and revises distinctions among a record’s entries. That is established by how its grammar works (CLAIM-479) and by the record’s own amendments (CLAIM-419, CASE-131, CASE-178). The further thesis that the record’s objects are constituted in Barad’s sense stays in CLAIM-476, which now rests on this one. Split so that luria’s evidential role does not depend on accepting Barad’s ontology. | Active |
| CLAIM-470 v3 | Inquiry is a form of specification: a question fixes which differences would count as an answer, an inquiry adds the operations that make those differences accessible, and what it finds can stabilize into a specification that constrains later inquiry; so inquiry stands to its findings as a specification to its realizations, with one difference, that an inquiry can revise what an answer could be | The owner’s, U15 of the exchange of 2026-10-27: “inquiry is a form of specification.” It carries CLAIM-477’s analogy into inquiry: question and finding stand as specification and realization, and a stabilized finding becomes a specification for the next inquiry. A15 and A16 found Dewey and Collingwood the nearest predecessors, and counterexample-guided abstraction refinement the nearest formal case. TERM-065 already keeps a description apart from the regime it is judged under; the claim adds that the regime is itself a product of inquiry and can be its object. It does not say that inquiry makes what it investigates. | Active |
| CLAIM-471 v5 | Physical interconnection can generate effective constraints on joint behaviour; measurement can estimate correspondences among local descriptions; and adaptive apparatuses can revise those correspondences; gluing expresses compatibility under specified relations, but neither the relations’ physical generation nor their adequacy follows from gluing alone | The owner’s U20 of the exchange of 2026-10-27, “interactions generate constraints that manifest as gluing conditions between intertial frames”, restated at the owner’s review. The readings found the correspondence maps given, measured or designed in nearly every formalism the exchange cited, and changed by interaction only in one constructed model whose authors call the result “learning to lie”. So the claim separates three mechanisms. Physical interconnection changes what joint behaviour is admissible, and only it bears on the strong thesis that interaction generates constraints. Measurement estimates correspondences that already held. Adaptation revises an apparatus’s own rules of comparison. The open question is QUESTION-282: when interaction changes the physically operative correspondence structure, rather than revealing or redescribing it. | Active |
| CLAIM-475 v2 | Specifying is itself a resource-bounded realization: formulating a question takes time, concepts and computation as realizing a configuration takes energy and matter, so the questions an agent can ask are a product of what it has already realized; a stabilized specification is past inquiry stored so that later questions become cheaper to ask, and it can make other questions harder | The owner’s, U17 of the exchange of 2026-10-27: “resource constraints impact specification in exactly the same way as they impact realization. I can’t interrogate a question that takes me more time than I have to even ask it.” It extends CLAIM-470: if inquiry is specification, specifying is a process with costs, and the feasible questions are bounded before any answering starts. A17 and A18 drew a consequence the record can use: TERM-065 takes its query family as supplied, and this claim says that family is the output of bounded activity. A stable specification amortizes the work that made it, which is a separation of time scales (CLAIM-478), and entrenches what it makes cheap. | Active |
| CLAIM-479 | In the record a typed relation is more constrained than either of its relata: a claim’s content is open prose, while rests_on fixes the scheme at both ends, has supports written as its converse and says what retiring its target leaves, and none of that moves when either claim’s content does; so a relation’s rigidity is a fact about the grammar, not evidence that the dependency it records is sound | The owner’s, U6 of the exchange of 2026-10-27, against A5’s “its relationships are explicitly represented rather than metaphysically primitive”: “and yet interestingly, relations like “supports” are less flexible than the raw contents of either relata.” Shown from luria.yaml, which A6 §6 read correctly. The relation’s type is determinate where the relata’s content is not, and that determinacy is no warrant for the dependency: CLAIM-293 is the demonstrated case. CASE-131 is the instance in which the rigidity of a relation outran what its relata meant and the grammar was amended. | Active |
| CLAIM-480 v2 | Composing interactions can turn an interior into a constraint, and sometimes into a constraint of a new kind: in the chain E = ½k₁(x₁ − x₂)² + ½k₂(x₂ − x₃)², with x₂ internal and equilibrated, the boundary sees E_eff = ½·k₁k₂/(k₁ + k₂)·(x₁ − x₃)², a coupling between x₁ and x₃ that neither part has; if the interior relaxes slowly, eliminating it leaves a history-dependent constraint, a memory kernel, so interconnection fixes an effective constraint on the boundary’s trajectories and separation of time scales decides only whether that constraint is approximately memoryless; and for cellular sheaves the reduced constraint can relate three boundary values where every relation among the parts is pairwise | From A22 §4 and A23 §IV of the exchange of 2026-10-27, which called composition “the most important missing mechanism” after the owner’s U20. Eliminating an equilibrated interior leaves an effective boundary relation that no part has; an outside system interacting only with the boundary meets it as a constraint, and “The interior has effectively become apparatus.” Baez and Fong’s black-boxing functor is the general theorem for passive linear networks. The memory case ties it to Mori–Zwanzig and to CLAIM-478: interconnection yields an effective constraint on the boundary’s trajectories in every case, and separation of time scales decides only whether it is approximately memoryless. For cellular sheaves the reduction can need a richer relational vocabulary than the parts used (THEORY-1090; QUESTION-283). It is independent evidence for CLAIM-477, that constraints are realized by organization. | Active |
| CLAIM-481 | Coupling does not by itself separate time scales: two identical undamped oscillators coupled with stiffness k have normal modes at ω₀ and √(ω₀² + 2k), nearly equal when k ≪ ω₀², and neither decays; separation comes where the coupling dissipates relative differences faster than collective ones, as in ẋ = −ax − k(x − y), ẏ = −ay − k(y − x), whose collective and relative modes relax at rates a and a + 2k, and in a Laplacian flow ẋ = −κLx, where the spectrum of L sets the rates | The answer A20, A21 and A23 gave to the owner’s conjecture at U20 that coupling necessarily induces scale separation (CLAIM-473). Two small computations: conservative coupling splits modes without separating or damping them, and dissipative coupling damps the relative mode at a rate that grows with the coupling. For a Laplacian flow the kernel is exact compatibility and the nonzero spectrum is the hierarchy of relaxation rates, so a spectral gap is where the separation comes from. Conceded, so Active. It gives a mechanism for CLAIM-478’s second half and is not a test of individuality. | Active |
| CLAIM-482 v2 | An organization’s aggregate revealed preference exists exactly when its record of winning moves never cycles, and where it exists it is fitted to one regime of authority, so an intervention on authority that changes the winning moves changes the fitted preference and the preference does not predict the change | The status review of 2026-10-27 (ADR-057) found the record’s later formal work bearing on an objection it never cited. CLAIM-089’s aggregate version says Northstar “simply prefers speed”: the governing relations are the organization’s revealed preference. CLAIM-434, Active and demonstrated, says when such a preference exists: an ordering that every winning move climbs exists exactly when the wins never cycle. So the objection is not refuted in general. It is true of an organization whose record is acyclic, and unavailable for one whose record cycles. Where it holds, the ordering is read off the wins under one regime of authority. CASE-003 changes authority and holds attitudes and evidence fixed, and the wins change. Then the fitted ordering changes too, and nothing in the first ordering predicted the second. The revealed preference redescribes the outcome of the governing relations, which is the reading CLAIM-027’s defeater excludes (“whose content predicts the outcome”). | Active |
| CLAIM-485 v2 | In the self-governing sense, what endogenous governance adds over a behaviourally equivalent system with an external scheduler is not that it allocates authority among its own processes but that it can revise its own governing standards when they break down | The bridge the owner asked for on 2026-10-28, between Kahl’s proposal (THEORY-1165), which is about agency in the sense that bears on responsibility, and QUESTION-092, which fixes TERM-045’s sense 5, self-governing. It is the record’s answer to the question. Internal allocation of authority, the second of CLAIM-025’s separable capacities (governing among regimes), coordinates execution and does not make a system govern itself more than an external scheduler would. The capacity to revise its governing standards when they break down does: the third capacity, which CLAIM-284 names as taking part in governing the conditions of its own transformation. Two systems matched within a regime differ under it, and they diverge in behaviour once that regime breaks down. | Active |
| CLAIM-488 v3 | Le Cam deficiency, after Torgersen, would quantify the approximate case of the Blackwell order for translation, and decoder-only audience knowledge would make the coding problem a Wyner-Ziv problem | The two steps of the manuscript’s §5 that CLAIM-050 carried until the status review of 2026-10-28 and that rest on works the record has not read: deficiency for the approximate case (Torgersen) and the Wyner-Ziv form of decoder side information. Split off when CLAIM-050 was narrowed to what its read sources support (ADR-047’s third ruling). | Active |
| CLAIM-492 v2 | If the self is defined to include whatever an agent cares about, the claim that all motivation serves the self is true by definition and rules nothing out; the thesis has content only with a criterion of the self’s extent that can come apart from what the agent cares about | The classic objection to psychological egoism (Butler; Sober and Wilson, LIT-1683), turned on the owner’s thesis. “Every motive is my motive” is trivially true and does not make every motive self-interested. “My self includes whatever I care about” makes the thesis unfalsifiable. It is answered if the thesis names an independent criterion of the self’s extent, such as overlap, fusion or salient self-categorization, and predicts that motivation follows that criterion and not caring alone. | Active |
| CLAIM-495 | For an O(d)-valued connection on a connected graph, the assignments that meet every edge relation xᵢ = Tᵢⱼxⱼ form a space isomorphic to the vectors at one vertex fixed by every holonomy based there, which is the kernel of the connection Laplacian; for d = 1, and for U(1) phases, that space is all or nothing, but for d > 1 a connection whose loops are not trivial can still keep a subspace on which every loop is, so compatibility among local frames can be partial and graded by direction; and edge maps that do not commute can compose to a flat loop, so non-commutativity is not holonomy | From A2 and A3 of the exchange “Paper assessment” (2026-10-29), which drew it out of LIT-1820’s O(d) setting against THEORY-1082’s U(1) one. The proof and the example are the record’s, checked numerically. It is the zeroth cohomology of the connection sheaf, so standard, and it says nothing about which organizations have such transports. | Active |
| CLAIM-496 | Agreement between routes of translation is a measure of coherence, not of fidelity, and the two are independent: a rendering that sends every source utterance to one output makes direct and relay transport agree exactly while a receiver who could tell a promise from a prediction with no error is left at chance, and two routes that keep the act and differ in register disagree completely while losing nothing the act-identification task needs | From A4 and A5 of the exchange “Paper assessment” (2026-10-29), where the assistant carried LIT-1820’s comparison of alternative paths over to translation and then warned that “path agreement is a coherence criterion, not a fidelity criterion”. The constructions are the record’s. It does not say path discrepancy is uninformative: it says it measures something CLAIM-259’s directed loss does not, and conversely. | Active |
| CLAIM-497 v2 | A system’s causes are found at the coarsest description whose interventions are unambiguous: a macro description is causally proportionate where it merges only micro states that intervention cannot tell apart, and no coarse-graining carries more causal information than the micro description it supervenes on | The record’s position on causal emergence after THEORY-787 was rejected. A coarse-graining can be the right causal description, but not by beating the micro. Under one intervention distribution at both levels, no coarse-graining of a transition carries more effective information than its micro (THEORY-1167). The ones that lose nothing are exactly causal feature learning’s partitions, which merge only micro states with the same interventional effects (THEORY-1169). The step from there to “the causes are found at the coarsest such description” is the record’s own, in the sense of proportionality. It does not say the macro adds causal information. | Active |
| CLAIM-501 v2 | Gutt’s interpretive resemblance also predicts that judged pragmatic observables beat text similarity, so the central theses’ defeat conditions cannot tell the thesis from a relevance-theoretic account either | Split from CLAIM-233 by the nineteenth status review (ADR-057; ADR-047’s kind 2, the record’s own extrapolation) and promoted by the twenty-first, once Gutt’s 1989 thesis (LIT-1845) was read. CLAIM-233 holds that functional equivalence and a proposition with its force both predict a pass on the central defeat test. This claim adds Gutt’s relevance-theoretic account. The book (LIT-784) stays unread. | Active |
| CLAIM-502 | Multi-hop delegation can keep an operator’s authority exactly independent of its own endorsements: under leave-one-out damped delegation, which counts the authority reaching each operator only along paths that have not already passed through it, an operator’s endorsements raise the authority of every operator the endorsed one reaches and leave its own unchanged | A construction that shows CLAIM-282’s old title false. Compute each operator’s authority from A2’s damped recursive rule with that operator’s own outgoing endorsements removed. Then authority reaches it along paths of any length, but only along paths that have not passed through it, so nothing it endorses can return to it. Its authority is exactly independent of its own endorsements, and an endorsement moves authority two hops and more. It does not say the rule conserves authority, that it closes the social route of moving others’ endorsements, or that CLAIM-375’s guarantee carries over. | Active |
| CLAIM-503 | Over finitely many states and finite outcome sets, one experiment is ε-deficient relative to another in every decision problem with losses in [0, 1] exactly when a single Markov kernel brings it within ε in total variation at every state, so the deficiency computed as a linear programme is the least such ε | Le Cam’s randomization criterion for finite experiments, uniform in the state, with losses in [0, 1]. The least ε for which some kernel brings M within ε of N in total variation at every state, which CLAIM-381 computes as a linear programme, equals the least ε for which M is ε-deficient relative to N in every finite decision problem. One direction composes N’s rule with the kernel; the other is one minimax step over a bilinear objective. At ε = 0 it is the finite Blackwell order (THEORY-717). | Active |
| CLAIM-506 v2 | The split of the last eukaryotic common ancestor’s central carbon metabolism, archaeal enzymes in the cytosol and alphaproteobacterial ones in the mitochondrion, does not single out syntrophy: a host that kept its own archaeal glycolysis and took up a bacterium with a TCA cycle leaves it whether the partnership began in syntrophy or by engulfment by an already complex host, and what the split counts against is a host whose carbon metabolism was replaced by the symbiont’s | Split from THEORY-1109 by the twenty-second status review (ADR-065; ADR-047’s kind 2, the record’s own extrapolation). THEORY-1109 reports what Santana-Molina and colleagues find and that they read it as support for syntrophy; this claim is the record’s judgement that the split cannot carry that reading. | Active |
| CLAIM-508 v2 | Gene ancestries alone cannot tell a symbiotic partner from a source of transferred genes: a partner whose genes were mostly lost, replaced or spread thin would leave the diffuse trace that Tobiasson and colleagues read as piecemeal transfer, and Bernabeu and colleagues concede that their donor signals say nothing of the kind of interaction | Split from THEORY-1104 by the twenty-second status review (ADR-065; ADR-047’s kind 2, the record’s own extrapolation). THEORY-1104 reports Tobiasson and colleagues’ reading of diffuse bacterial genes as transfer; THEORY-1105 reports Bernabeu and colleagues’ concession about their own donors. This claim is what the record draws from both. | Active |
| CLAIM-509 v2 | Stem lengths alone do not establish an order of acquisition in eukaryogenesis, neither Pittis and Gabaldón’s late mitochondrion nor Bernabeu and colleagues’ transfer waves: normalized stem length measures time only if rates before and after LECA are proportional, it shortens as closer relatives are sampled, the alphaproteobacterial separation from other bacteria rests on P = 0.044, and on Tobiasson and colleagues’ data it does not behave as a clock | Split from THEORY-1102 and THEORY-1101 by the twenty-second status review (ADR-065; ADR-047’s kind 2, the record’s own extrapolation). The two readings, now Active, report what the papers find; this claim is the record’s judgement of what stem lengths can establish. | Active |
| CLAIM-513 | Across a family of goals, a world model is not an optional explanation of competent behaviour: in a fully observed, finite, communicating, stationary environment, a goal-conditioned policy within a factor 1 − δ of optimal on every composite goal of depth n fixes every transition probability to within √(2P(1 − P)/((n − 1)(1 − δ))), so observers reading the same policy must ascribe the same world model; what it leaves open is whether a predictive component is realized inside the agent, since a lookup table over histories and goals has the same policy | From the reading of Richens, Abel, Bellot and Everitt (LIT-1891, NOTE-1469), registered as the objection to watch against the owner’s U20 thesis CLAIM-519. It defeats that thesis’s functional reading only. The thesis’s defeated_if is not met: the theorem holds “regardless of … architecture”, makes no matched-resource comparison and no intervention on internals, and its authors say the map runs “from the agent’s policy rather than its activations”. Within its scope, though, calling a world model an explanatory attribution is too weak. The bound was re-derived and checked against an adversarial agent. | Active |
| CLAIM-516 | Where every constraint capacity turns over at a positive rate and is produced only by others, with no basal production and production vanishing as its producers do, capacities whose production graph is acyclic all decay to zero: a capacity that persists needs a productive cycle among its ancestors, and removing a feedback edge set extinguishes every capacity; a cycle is necessary and not sufficient, and a one-member cycle is not closure | From A10 §1 and §5A of the exchange “Analyze nucleation concepts” (2026-10-31), after the owner’s “try to progress the theoretical program”. The proof was rechecked by the reader of U7–U10. It is known in substance from autocatalytic-set theory, as A10 said. What it adds to the record is the boundary with closure: the necessary cycle may be a self-loop, and a self-loop is not closure in TERM-070’s sense or CLAIM-395’s, which need two or more constraints. | Active |
| CLAIM-517 | A successor regulator keeps a viable set positively invariant if, at every boundary context, its response distribution is within γ/L in total variation of a regulator that certifies inward margin γ, the dynamics being L-Lipschitz in that distribution; an average distillation loss certifies this only through coverage of the boundary contexts, so fidelity measured in ordinary operation certifies nothing about viability | From A16 §4 and §5 of the exchange “Analyze nucleation concepts” (2026-10-31), the owner having quoted its conclusion at U17: “preserving a regulator’s response distribution sufficiently accurately can guarantee preservation of a physical organization’s viability”. The algebra was rechecked; the regularity conditions A16 left implicit are stated here. A16’s application to its own construction (γ = 0.16) was notional, since that model has no regulator distribution and L is undefined there. | Active |
| CLAIM-520 | The value of keeping a corrective capacity is conditional on objectives, uncertainty and cost: a free, optional audit cannot lower a single time-consistent decision-maker’s expected performance, but an audit that costs C to maintain and bears on k decisions with error rate ε is worth k(0.25 − 0.5ε) − C in the exchange’s model, negative when C is large or k small, and where no hypothesis fits the world, correction gains no reward and improves only calibration | From A24 of the exchange “Analyze nucleation concepts” (2026-10-31), answering the owner’s U24 question whether corrigibility’s desirability had been established. The arithmetic was rechecked by the turns’ reader. This is the subject-matter half of the answer. The support half, that the record’s constructions do not establish that corrigibility ought to be kept, is ARG-042, which this claim undercuts. | Active |
| CLAIM-521 | An organization’s present coupling strength need not reveal the stability of the process maintaining it: in a constructed system whose maintained connector and capacities set a three-unit coupling, the recovery rate of the maintenance goes to zero at its saddle-node while the coupling’s spectral gap there stays near 0.989 | From A12 §6 of the exchange “Analyze nucleation concepts” (2026-10-31), which called it “a surprising result”. It is generic for any saddle-node whose fold sits away from zero with no feedback from the coupled units to the maintaining core, so it is built in rather than surprising. It is filed because it is a construction QUESTION-125 asks for: one in which the regime changes while the block’s gap does not. All numbers were recomputed. | Active |
| CLAIM-522 v2 | Recovery under interventions on state cannot show where maintenance is realized: an outside controller that measures the constraint capacities and supplies the internal production law as state feedback yields the same trajectory under every perturbation of state, damage and recovery included, even with every capacity observed exactly; only interventions on the production mechanisms, relative to a declared boundary, separate the two | From A10 §4 (its Proposition 5) of the exchange “Analyze nucleation concepts” (2026-10-31). Close to definitional, and checked: substituting the controller gives the same differential equation. It extends CLAIM-414 from passive observation to every intervention on state. As the reader noted, the causal dependence among the capacities is the same in both systems; only where the mechanism sits relative to the boundary differs, which is CLAIM-194’s point about boundaries. | Active |
| CLAIM-524 | Whether functionally equivalent realizations are connected depends on which paths are admissible: for f = u₁v₁ + u₂v₂ with nonnegative weights, (1, 1, 0, 0) and (0, 0, 1, 1) are joined by a curve along which f stays 1 though the straight line between them falls to ½, and under any resource budget below √2 times the endpoints’ cost no path with f = 1 joins them | From the owner’s remark at U17 of the exchange “Analyze nucleation concepts” (2026-10-31), that the reconstruction fibres “reminds me of loss landscape connected mode stuff (which might just be a consequence of high dimensional geometry? … probably already discussed on the nucleation record)”. It is: see below. A17 §9 gave the curve and A18 §7 the budget for a tied-weight family; the general bound here is the reader’s, rechecked. “Viable mode connectivity” is A18’s name and is not filed as a term. | Active |
| CLAIM-535 | An organization that acts on what it observes has a policy acceptable in every circumstance exactly when, for each observation, the circumstances it cannot tell apart share an acceptable action; so every circumstance having an acceptable action does not give a policy, a finer observation never removes one, and where acceptable actions overlap the coarsest observations that suffice are several and incomparable, so which distinctions must be made legible depends on which acceptable action the organization commits to | A33 §4 of the exchange “Assess SDT Coverage” (2026-11-02), at the owner’s U33 request for positive accounts, with A30 §2’s example and A32’s Claim B. Its second appearance in the exchange, so it gets a code. The criterion is elementary, and its monotonicity is Blackwell’s easy direction (THEORY-1096). What it adds to CLAIM-350, its single-valued case, is found by the reader of U32–U33: with overlapping acceptable sets, legibility is relative to policy. A positive characterization of what legibility must supply for action. | Active |
| CLAIM-536 | A categorical model of perspectives and an LDA-style model differ in where the mixture lives: the first draws every act’s perspective from one fixed categorical distribution, the second gives each episode its own mixture, drawn from a Dirichlet, and draws each act from it; the Dirichlet is a distribution over mixtures, not the perspectives themselves, and with symmetric concentration a over K perspectives two acts in one episode share a perspective with probability (a + 1)/(Ka + 1) against 1/K across episodes, so the concentration runs from one perspective per episode, as in persona selection (a → 0), to a fresh independent draw for every act (a → ∞) | The owner’s U12 of the exchange “Assess SDT Coverage” (2026-11-02), stated precisely: “H1 isn’t LDA like though. that’s my point. it’s a categorical distribution. the topics in H@ are the dirichlet distribution which parameterizes the categorical distribution, which is what distinguishes H2 from H1 and why H2 is an LDA.” The structure is right; one word is not. The Dirichlet is a distribution over each episode’s mixture, and the topics, here the perspectives, are the categories that mixture weights. The agreement formula, derived here and checked by simulation, shows that both readings of H1 are limits of H2. | Active |
| CLAIM-537 | In tolerance-bounded compatibility on a graph with disturbed offsets, |Dx − a₀ − w| ≤ δ for |w_e| ≤ η_e, a compatible configuration exists for every disturbance exactly when |cᵀa₀| + Σ η_e|c_e| ≤ Σ δ_e|c_e| on every cycle, and one configuration serves every disturbance exactly when η ≤ δ and |cᵀa₀| ≤ Σ(δ_e − η_e)|c_e|; an agent that chooses its configuration from what it observes needs the second condition within each class of disturbances it cannot tell apart, so whether a compatible state can be selected lies between the two and depends on what the agent can read | A30 §§2–3 of the exchange “Assess SDT Coverage” (2026-11-02), at the owner’s “keep going”, with the second and third conditions derived by the reader of U30–U31 and checked by simulation (500 random instances, no mismatch). It is the first concrete instance of the branch’s note of 2026-11-02 on CLAIM-354, that a reachable set should range over the policies an organization can carry out on what it can read. The framing is adjustable robust optimization (LIT-1975). Static selection only, scalar overlaps only. | Active |
| CLAIM-538 | On a finite graph of contexts whose overlaps carry preferred real offsets a and tolerances δ_e ≥ 0, an assignment within every tolerance, |Dx − a| ≤ δ, exists exactly when no cycle’s holonomy exceeds the sum of its tolerances; with every δ_e > 0 the least uniform enlargement of the tolerances that admits one is the largest ratio, over simple cycles, of holonomy to summed tolerance, so the obstruction is certified by a cycle; the feasible allocations of tolerance depend on the offsets only through their class in H¹, so local adjustment can move a mismatch among the overlaps of a cycle and never remove it; and an evaluation that omits one overlap of every witnessing cycle reports a compatibility that does not hold | The owner’s U27 of the exchange “Assess SDT Coverage” (2026-11-02), “compatibility of tolerance bounds”, with U28’s pointer to the record’s sheaf tools, worked out at A28 §3 and A29 §§3–4, 7 and A32’s Claim A. The feasibility criterion is the classical feasible-differential theorem of network flows (Rockafellar 1984; no checked identifier, not registered), and the ratio is LP duality, so the result is granted, not the record’s discovery. What the record adds is the reading: the frontier is an invariant of the obstruction class, governance chooses where on it the mismatch falls, and omission can fake compatibility. Checked by linear programming against brute-force cycle enumeration on random graphs. | Active |
| CLAIM-540 | The persistence a Dirichlet–categorical hierarchy gives a run of selections is an observer’s learning about a fixed mixture, not a change in what selects: under a uniform prior an observed first choice raises the predicted chance of repeating it from 1/2 to 2/3, while the same choice forced leaves it at 1/2, so the hierarchy’s reinforcement is not evidence of self-formation or of a maintained will-organization, which need the mixture itself to change under the choice | A13 of the exchange “Assess SDT Coverage” (2026-11-02), answering the owner’s U13, what the Dirichlet–categorical reading implies for Jennings’s attention as the source of a free will. A13: “Self-formation requires a causal update, not merely a posterior update in the observer.” Correct, short and not held. It limits the record’s own H1/H2 reading (CLAIM-536) and A11’s suggestion that LDA already has “a primitive analogue of a will-organization”. Rechecked here by simulation. | Active |
| CLAIM-542 | Sensitivity does not fix the allocation or the authorship of control: linearized, every input reaches the final state through the same transition operator, ∂x_T/∂w_t = Φ(T, t)B_w(t), so systems with the same Lyapunov spectrum can differ arbitrarily in what an agent’s own channel, an outside party’s channel and noise each reach and at what least energy; and along one unstable direction a larger exponent λ lowers the least effort to reach a displacement, since W_T = b²(e^{2λT} − 1)/2λ grows with λ, while a constant open-loop input against white noise entering the same direction has terminal signal-to-noise ratio tending to (bu/σ)√(2/λ), which falls as λ grows, so only feedback that observes the state turns cheaper control into reliable direction | The demonstrated part of the owner’s U16 and U20 of the exchange “Assess SDT Coverage” (2026-11-02), “controllability vs sensitivity”. A20 §2 stated the impulse case (“the relative contribution is not determined by e^{λT}”) and A22 §5 the channel case. The scalar signal-to-noise result is the reader’s derivation, checked by simulation. It sharpens the owner’s point: sensitivity makes control cheaper and, without feedback, less decisive against noise. CLAIM-345 holds the cost formula and not the allocation across channels. | Active |