Part C — Kernel Extension Specifications
Preface node
heading:part-c-kernel-extension-specifications:34510
What this page is
This is generated FPF reference text from the specification preface or supporting sections. It helps interpret FPF; it is not FPF Reference product documentation.
Methodology
Use it to understand how the specification wants to be read, then return to a route, pattern, or work packet for active work. Cite generated IDs only when the wording changes the task decision.
Content
Epistemic holon composition (KD-CAL)
Scope & exports. A substrate‑neutral calculus for composing epistemic holons (U.Episteme) and reasoning about their motion and equivalence. Exports: (i) three point‑characteristics—Formality F, ClaimScope G, Reliability R—that locate a single episteme; (ii) a pairwise ladder of Congruence Levels (CL 0…3); (iii) four Δ‑moves (Formalise, Generalise/Specialise, Calibrate/Validate, Congrue); (iv) composition rules (Γ_epist) for aggregates; (v) propagation laws for CL through mappings and notation bridges. KD‑CAL is typed by U.EpistemeSlotRelation and never confuses ClaimGraph, EntityOfConcernSlot, GroundingHolonSlot, Viewpoint, View, ReferenceScheme, notation, publication form, or carrier. All F–G–R computations are context‑local; Cross‑context traversals require an explicit Bridge with CL and apply the B.3 congruence penalty Φ(CL) to R. // Contexts ≡ U.BoundedContext; substitution is plane‑preserving only.
Formality F is the rigor characteristic defined normatively in C.2.3. All KD‑CAL computations and guards SHALL use U.Formality (F0…F9) as specified there; no parallel “mode” ladders are allowed.
Problem Frame
FPF fixes two archetypal sub‑holons: U.System (physical/operational) and U.Episteme (knowledge holon). KD‑CAL is the primary composition pattern for U.Episteme, giving engineers a compact, testable way to say (a) how strictly an episteme is written (F), (b) how much structure it manages (G), (c) how well it is warranted by evidence or severe tests (R), and (d) how closely two epistemes coincide (CL). KD‑CAL is built atop C.2.1 U.Episteme — Epistemes and their slot relation, which reifies every episteme through U.EpistemeSlotRelation: ClaimGraph, EntityOfConcernSlot, GroundingHolonSlot, Viewpoint, View, and ReferenceScheme. Notation, publication forms, carriers, and work occurrences remain outside episteme content and are linked by their own FPF relations.
Problem
Teams routinely entangle programs, specifications, proofs, and datasets; a “proof” is treated as a tested routine, a “program” is cited as if it entailed a theorem. Trust decays because justification and evidence freshness are not explicit. Epistemes are anthropomorphised as actors (“the standard enforces…”), producing category errors at execution. Without a shared composition and equivalence calculus, aggregates hide weakest links and analogies harden into overclaims. KD‑CAL must stop these failure modes with a single constitution and scale‑set.
Forces
- Universality vs domain idioms. One calculus must cover physics theories, legal codes, safety specs, algorithms, and formal proofs without flattening their differences.
- Meaning vs materiality. Meaning must be independent of carrier, yet accountable to it historically.
- Deductive vs empirical. Axiomatic certainty and empirical trust have different evidence-continuity profiles; both must compose.
- Abstraction vs enactment. Epistemes constrain action; systems act. The calculus must keep the roles distinct.
Solution
Coordinates and the episteme slot relation
KD‑CAL characteristics (single‑episteme, point‑values).
- Formality F. From free prose to machine‑checkable proof/specification. Litmus: would a machine reject it if wrong?
- Claim scope (G), a set‑valued applicability over
U.ContextSlice, with ∩/SpanUnion/translate algebra; CL penalties apply to R, not to F/G. Litmus: how wide is the declared scope, and under what minimal assumptions does the claim hold? - Reliability R. From untested idea to continuously validated claim. Litmus: where is the last successful severe test? R‑claims MUST bind to evidence and declare relevance windows; stale bindings degrade R or require waiver per ESG policy.
Congruence Level (CL), pairwise ladder.
CL‑0 Opposed/Disjoint (contrastive; no substitution); CL‑1 Comparable / Naming‑only (label similarity; no substitution); CL‑2 Translatable / RoleAssignment‑eligible (structure‑preserving mapping in a declared fragment with stated loss; theorems may transport); CL‑3 Near‑identity / Type‑structure‑safe (invariants match; type‑structure substitution allowed). CL is a characteristic of a relation between two epistemes; it is not a fourth member of the F–G–R assurance tuple and it is not a characteristic space of its own. Norm: substitution is permitted only if plane‑preserving and CL ≥ 2; substituting type‑structure requires CL = 3.
Slot-relation link. The assurance components are stated over U.EpistemeSlotRelation: F by the internal ClaimGraph and formal substrate, G by the ClaimScope attached to the EntityOfConcern and assumptions, and R by evaluation templates and evidence bindings. Notation belongs to representation and reference-scheme structure; carriers remain outside the episteme and link through SCR/RSCR or other exact carrier relations. Multiple notations are allowed only when their relation is explicit; authors SHOULD register NotationBridge(n₁,n₂) with an associated CL to make conversion loss explicit.
Four Δ‑moves (epistemic motion)
- ΔF — Formalise. Rewrite for stricter calculi/grammars; raise proof obligations.
- ΔG — Generalise / Specialise. Widen or narrow the claim scope (assumptions & scope). Changes to decomposition granularity are an orthogonal view and do not change G unless they alter the envelope.
- ΔR — Calibrate / Validate. Strengthen severe tests or add live monitoring; update evidence bindings.
- ΔCL — Congrue. Establish and record the sameness relation between two epistemes (ladder 0→3). Moves compose into paths; CL along a path is the minimum of its links.
Composition (Γ_epist) and propagation
Let Γ_epist combine epistemes {Eᵢ} into a composite episteme Γ that makes a joint claim (AND‑style) or exposes an interface (series composition). KD‑CAL imposes safe defaults:
-
R (Reliability). Along any justification path
P, computeR_eff(P) = max(0, min_i R_i − Φ(CL_min(P)))(weakest‑link with congruence penalty). For series composition (claims needed conjunctively), the path‑wise weakest‑link applies; for parallel support (independent lines to the same claim), useR(Γ) = max_P R_eff(P)(annotate independence); never exceed the best attested line. Cross‑context steps and NotationBridge traversals contribute toCL_min(P). -
F (Formality).
F(Γ) = minᵢ F(Eᵢ)(monotone non‑increasing along used paths). To raise F, apply ΔF to the weakest parts. -
G (ClaimScope). On any dependency path, take the intersection of claim scopes (the narrowest overlapping scope). Across independent support paths to the same claim, set
G(Γ) = SpanUnion({G_path})constrained by support (drop unsupported regions). Widening/narrowing the scope is an explicit ΔG± operation. -
CL (Congruence). For a chain of mappings
E₀ ~ E₁ ~ … ~ Eₖ, the path congruence ismin CL(Eⱼ,Eⱼ₊₁). Passing through a NotationBridge sets CL to the bridge’s declared level; the Φ(CL) penalty is applied in the R fold for any path that traverses it.
These rules keep Γ aligned with the holonic kernel: Γ is only defined on holons and respects identity/boundary discipline from the core.
What must not be conflated (normative guards)
- Representation structure ≠ carrier. Files, PDFs, or repositories are carriers outside the episteme; they never count as parts of
U.Episteme(see C.2.1 EP‑1; CC‑EPI‑2/3). - Epistemes do not act. Only systems perform work; epistemes carry constraints and evaluation criteria through their
ClaimGraph, EntityOfConcern, grounding holon, scope, and evidence bindings (per Core A.15 / CC‑EPI‑3). - CL is not a score. It is a qualitative ladder of preservation classes; do not average it.
✱ Archetypal Grounding (Tell–Show–Show)
Universal rule (tell). Compose knowledge by Γ_epist with weakest‑link R, monotone F, and explicit CL on every bridge; keep ClaimGraph, EntityOfConcern, grounding holon, viewpoint, view, reference scheme, notation, publication form, and carrier in their FPF relation named by values.
System (show, Sys‑CAL lens). Consider a battery‑pack thermal subsystem integrating a physics model of heat flow and an operating envelope for fast‑charge. As a system, it composes pumps, sensors, and controllers by physical Γ with conservation constraints (Sys‑CAL). The assurance story depends on epistemes about the model and envelope; the system acts, epistemes constrain. (Archetypes and boundary discipline per core.)
Episteme (show, KD‑CAL lens). Consider a CMIP‑class climate projection episteme (post‑2015 generation): its ClaimGraph covers PDEs and parameterisations; its EntityOfConcern and grounding holon identify what projection claim is about and how it is grounded; its ClaimScope names historical forcings, resolution, and assumptions; its representation may include domain equations and a tabular schema linked by a NotationBridge with an explicit CL. Compose sub‑epistemes for radiation, clouds, and ocean mixing: R = min across the critical path; an independent hindcast line can raise R only up to its own level; F is bounded by the least‑formal sub‑claim unless the composition adds formal invariants.
Bias‑Annotation
- Metric worship. Treating
[F,G,R]as ends rather than means; mitigation: require evidence bindings and narrative of limits in the claim scope and grounding envelope. - Category slip. Equating a notation or carrier with
ClaimGraph, EntityOfConcern, or grounding holon; mitigation: slot-relation and carrier separation under C.2.1. - Analogy inflation. Presenting CL‑0/1 as identity; mitigation: always name the CL rung for cross‑mappings.
Conformance Checklist
- C2‑1 (Slot relation). Every
U.EpistemeMUST satisfy C.2.1 slot discipline forClaimGraph,EntityOfConcernSlot,GroundingHolonSlot,Viewpoint,View, andReferenceScheme; carriers link through SCR/RSCR or other exact carrier relations and are never parts of the episteme. - C2‑2 (Coordinates). Each episteme SHALL declare
[F,G,R]with a brief rationale; F isU.Formality ∈ {F0…F9}per C.2.3, exactly one episteme‑level F computed as the min over essential parts. CL is declared for pairs only. Sub‑anchors: ** Contexts MAY mint named sub‑anchors (e.g.,F4[OCL],F7[HOL]), which MUST preserve the global order and map to their parent anchor from C.2.3. - C2‑3 (Composition). Authors SHALL choose Γ_mode (series vs parallel). For any justification path use
R_eff(P) = max(0, min_i R_i − Φ(CL_min(P))); for parallel independent lines to the same claim, takeR(Γ) = max_P R_eff(P)(never exceeding the highest-R support line). ComputeF(Γ) = minalong the used paths. For G, use path‑wise intersections and then SpanUnion({G_path}) constrained by support. Cross‑context traversals MUST use a Bridge with CL and apply Φ(CL) toR. - C2‑4 (NotationBridge). Multi‑notation representation components SHOULD register
NotationBridgeedges with CL and loss note; any cross‑notation reasoning MUST cite the bridge’s CL. - C2‑5 (No action). Epistemes MUST NOT be assigned actions; work is executed by systems in role.
Consequences
Benefits. A single, compact map for all knowledge epistemes or publications; fast detection of weakest‑link R in aggregates; disciplined reuse across domains with explicit CL; consistent separation of meaning from material carriers. Trade‑offs. Authors must learn to declare Γ‑mode and CL explicitly; multi‑notation work requires bridge bookkeeping; mitigation: the episteme slot relation and CL scale keep the discipline brief and repeatable.
Rationale
KD‑CAL turns the coarse legacy semiotic picture into holonic composition over U.EpistemeSlotRelation, where formal structure and claim scope (F,G), evidence (R), and cross‑mapping congruence (CL) are visible and composable. The explicit C.2.1 slot relation prevents carrier confusion; the characteristics provide a manager‑readable yet formalisation‑ready scale (with G grounded in scope/envelope, not part‑count); the CL scale replaces overloaded “alignment” with a typed sameness relation.
Relations
- Depends on:
U.Episteme — Epistemes and their slot relation(C.2.1): identity invariants, slot definitions, carrier separation, and evidence bindings. - Peers: Sys‑CAL (C.1), which composes systems; KD‑CAL composes epistemes and feeds assurance lenses in Part B.
- Constrained by authoring: Architectural patterns must include Tell–Show–Show with Archetypal Grounding (this section).
Worked mini‑examples (post‑2015 flavours)
- Formal lift (ΔF). Recasting a 2019 variational free‑energy narrative into a typed calculus raises F, clarifies scope, and enables CL‑2 bridges between biological and ML formulations—without claiming empirical gain (R unchanged).
- Parallel evidence (R, max). Two independent hindcast lines (circa CMIP6, 2019) supporting the same forecast allow
R(Γ)=max(R₁,R₂); if one line drifts, the composite is bounded by the higher-R support line until series constraints apply. - Notation bridge (CL drop). A 2021 type‑theoretic specification rendered in a semi‑formal DSL requires a
NotationBridgewith a CL<3 note; any theorem transported across must respect the bridge’s declared preservation.
(No tooling is implied; these are conceptual moves within the calculus.)
C.2:End
U.Episteme - Epistemes and their slot relation
One-line summary.
U.Epistemeis the holon type for epistemes; its internal ontology is given byU.EpistemeSlotRelation, a typed n-ary relation withSlotSpecdiscipline overEntityOfConcern,GroundingHolon,ClaimGraph,Viewpoint,View, andReferenceScheme. UnderC.29, a filled episteme may be represented as a tuple view over that relation;ClaimGraphandJustificationGraphremain graph-valued fillers or attached graph-valued structures, not tuples. A coarse Symbol-Concept-Object triangle may be used only as a didactic projection of this slot relation, not as the normative ontology.
Status: Stable Normativity: Normative except where a section is explicitly marked informative
Use this pattern when a theory, model, specification, standard, proof, algorithm, diagram, dashboard, view, or publication is being treated as a knowledge holon and the project must know what it is about, what claim graph it carries, how it is grounded, which viewpoint or view is current, and which reference scheme makes the claims readable.
Primary EntityOfConcern. The EntityOfConcern is U.Episteme: a knowledge holon whose identity and admissible use are governed by U.EpistemeSlotRelation, not by its carrier, notation, publication face, or one didactic semantic-triangle projection.
First useful move. Fill the small episteme slot relation: EntityOfConcernSlot, GroundingHolonSlot, ClaimGraphSlot, ReferenceSchemeSlot, ViewpointSlot, and ViewSlot when current. Then decide which claim, view, publication, specification-use, morphism, evidence, or grounding relation is actually being used, and keep that relation with its governing pattern.
What goes wrong if missed. A PDF, diagram, proof script, algorithm text, model output, or dashboard becomes "the theory"; the described EntityOfConcern drifts; a publication is used as evidence or authority by appearance; and several local description triangles grow into incompatible episteme ontologies.
What this buys. The practitioner can keep the episteme, its described object, grounding holon, claim graph, viewpoint, view, reference scheme, carrier, publication, and evidence relation separate while still using one compact slot relation across C.2, A.6.2-A.6.4, E.17, and related description/specification-use patterns.
Not this pattern when. Use the direct governing pattern when the current question is the described system or holon (A.7 and system/holon patterns), a publication face or carrier (E.17), evidence or assurance (A.10, G.6, B.3), mathematical-lens use (C.29), a method or method description (A.3.1, A.3.2), or a wording-use repair (E.10, C.2.P, C.2.P.DR, F.18, F.19). C.2.1 governs the episteme slot relation itself.
Context
FPF’s kernel recognises two archetypal sub‑holons: System and Episteme. Systems are operational wholes; epistemes are knowledge holons—theories, models, specifications, standards, algorithms, proofs—whose reason for being is to say something defeasible or deductive about something and to be held to account by justification.
Readers. Engineering managers and lead designers who need a uniform way to reason about theories, specifications, algorithms, proofs—from charter memos up to formal axiomatics—without collapsing into tooling or discipline‑specific notations.
KD‑CAL (C.2) needs a precise notion of what an episteme is and how it mediates between:
- the thing(s) it is about,
- the contexts and systems that ground and test it, and
- the representational machinery (notations, carriers, operations) we use to work with it.
Contemporary work on formal languages as cognitive tools (Dutilh Novaes), operational iconicity of notations (Krӓmer), material engagement (Malafouris), distributed representations and latent-space communication in ML, and tool-augmented reasoning (ReAct-style agent loops) shows that:
- the relation between an episteme and its EntityOfConcernSlot is not a single undifferentiated “Object” vertex: it involves explicit slots and morphisms (EntityOfConcern-reference mapping, grounding, evaluation) typed by SlotKinds and contexts;
- representations come in heterogeneous forms (symbolic, diagrammatic, latent, interactive), with very different admissible operations;
- inference is often mixed‑mode: symbolic reasoning plus calls to tools, solvers, and learned models.
FPF therefore needs a more modular, slot-relation ontology for epistemes which:
- keeps KD-CAL and
EntityOfConcern/ Description-episteme boundary plus specification use/refinement discipline intact, - is compatible with A.6.0/A.6.5 signatures (
SlotKind/ValueKind/RefKind), - can be used uniformly by A.6.2-A.6.4 (epistemic morphisms) and E.17.* (views & publication),
- preserves real graph-valued structures such as
ClaimGraphandJustificationGraphas values inside or beside the episteme relation, and - keeps the coarse semantic triangle only as a didactic projection, not the normative ontology.
In this pattern:
U.Epistemeis the holon genus for epistemes (C.2), with components and identity governed by A.1/A.6.0/A.7.U.EpistemeSlotRelationnames the internal slot relation ofU.Episteme: the small, typed n-ary relation over episteme positions (EntityOfConcernSlot,GroundingHolonSlot,ClaimGraphSlot,ViewpointSlot,ViewSlot,ReferenceSchemeSlot) on which KD-CAL, A.6.2-A.6.4 and E.17.* rely.- Species such as
U.EpistemeCard,U.EpistemeView,U.EpistemePublicationare holonic realisations ofU.Epistemewhose component structure is constrained to be compatible withU.EpistemeSlotRelation.
Adopted EntityOfConcern family. C.2.1 uses EntityOfConcernSlot, entityOfConcernRef, EntityOfConcernRef, EntityOfConcernChangeMode, and EntityOfConcernClass as the adopted slot/ref/class family. These names are the current C.2.1 vocabulary and must not be shadowed by a second episteme ontology.
Problem
Without a shared episteme constitution, teams fall into recurring failure modes:
- EntityOfConcern-Description episteme-publication carrier soup. Diagrams and files are treated as the theory itself. Changes to a PDF are confused with theoretical change.
- EntityOfConcern blur. A spec seems to describe “everything in general”. The EntityOfConcernSlot - what exactly this knowledge describes - is implicit and drifts, while the GroundingHolonSlot that would say where the claim is grounded is also missing.
- Proof vs program confusion. Algorithms, specifications, and proofs are mixed: a “proof” is used as if it were a tested routine; a “program” is cited as if it entailed a theorem (Curry–Howard misunderstood).
- Trust without evidence path. Claims accumulate with no explicit justification graph or evidence freshness, so assurance degrades invisibly.
- Category errors at execution. Epistemes appear as actors (“the standard enforces…”) instead of systems acting with or on epistemes such as data sets or algorithms.
The coarse Symbol-Concept-Object semantic triangle is useful only as a didactic projection over the richer slot relation: Concept approximates ClaimGraph, Object approximates EntityOfConcern plus ReferenceScheme, and Symbol approximates notation or representation tokens.
This projection can still help with:
- separating meaning (Concept) from carriers, and
- integrating KD‑CAL’s F–G–R characteristics (Formality, ClaimScope, Reliability).
But the projection has structural blind spots when used as ontology:
-
No explicit EntityOfConcern slot. The “Object vertex” bundles together what the episteme is about with how we interpret and test it. There is no explicit slot for the entity of concern (
U.Entity) and no clear separation between:- the EntityOfConcern value, and
- the ReferenceScheme used to read claims as statements about that thing.
-
Grounding collapses into Object. Material and organisational contexts (labs, infrastructures, organisations) that ground an episteme (in Malafouris’ sense) are hidden in the Object/Reference Map. KD‑CAL and Bridges need explicit GroundingHolon positions.
-
Viewpoints are not first‑class. ISO‑style viewpoints (families of stakeholders, concerns, conformance rules) and their induced views appear only indirectly, via KD‑CAL or MVPK. There is no explicit
U.Viewpoint/U.Viewpair at the episteme core, which makes it hard to:- connect to DescriptionContext for Description epistemes, including Description epistemes admitted for specification use,
- organize multi‑view descriptions (E.17.0), or
- align publication viewpoints with engineering viewpoints.
-
Representations and operations are compressed into “Symbol”. Very different representational regimes are flattened into one Symbol vertex:
- label-only notations (no internal inference calculus),
- fully operational calculi (e.g., proof assistants),
- interactive visualisations,
- latent vectors and prompt‑programs for LLMs. There is no place to say “this representation admits syntactic inference of such‑and‑such kind” vs “this is just a passive label”.
-
No explicit signature discipline. The triangle speaks of “Object/Concept/Symbol” but not of slots and references in the sense of A.6.5
U.RelationSlotDiscipline. In episteme this leads to:- names where slot, value and ref are conflated (
EntityOfConcernRefused as if it were a slot), - ambiguity between the EntityOfConcern value (what the episteme describes) and the episteme (the description),
- fragile interoperability with signatures for roles, methods, services.
- names where slot, value and ref are conflated (
Thus we have problems of:
- EntityOfConcern drift.
Specifications and models accumulate without a stable notion of which EntityOfConcernSlot value they carry; fields like
SubjectRefcarry too many distinct meaning-kinds and resist safe refactoring. - Viewpoint confusion. Engineering, publication and governance views are mixed, making it hard to maintain consistency across publication faces and publication forms or to reason about conformity of descriptions under different viewpoints.
- Representation mismatches. Trade‑offs between neural vs symbolic, diagrammatic vs textual, or interactive vs batch representations cannot be expressed at the episteme level; they leak into ad‑hoc tool descriptions.
- Broken modularity.
As soon as we add KD-CAL, LOG-CAL, MVPK, and E.18, multiple implicit triangles appear, each with slightly different semantics, instead of a single shared
U.EpistemeSlotRelation.
We need a replacement for the triangle that keeps its didactic clarity but matches the slot-relation, graph-valued-claim, and morphism-centric reality of contemporary epistemic work.
Forces
Solution - U.EpistemeSlotRelation as the normative episteme ontology
Overview
For U.Episteme, U.EpistemeSlotRelation is the normative small, typed n-ary relation with SlotSpecs over the core episteme positions. It is not a graph object and not a tuple object. Under C.29, the same slot relation may be viewed as a tuple for filled-value reasoning or as a graph/hypergraph diagram for dependency reasoning, but those are mathematical-lens views. Graph-valued fillers such as U.ClaimGraph remain real graph-kinds inside the relation.
Positions / slots. Minimal kernel SlotKinds (with their ValueKinds) that every episteme can refer to, following A.6.5:
-
EntityOfConcernSlot(ValueKindU.Entityor a declared subkind) -> "what this episteme is about"; -
GroundingHolonSlot(ValueKindU.Holon) -> "where/how this is grounded"; -
ClaimGraphSlot(ValueKindU.ClaimGraph) -> "what is being said (claim content)"; -
ReferenceSchemeSlot(ValueKindU.ReferenceScheme) -> "how we read claims as statements about entities"; -
ViewpointSlot(ValueKindU.Viewpoint) -> "under which viewpoint we read/validate this episteme"; -
ViewSlot(ValueKindU.View) -> "a view-episteme produced under a viewpoint". -
Slots and signatures. These positions are realised as SlotKinds with associated ValueKinds and RefKinds under
U.RelationSlotDiscipline(A.6.5). An episteme kind (U.EpistemeKind) is a signature over these slots. -
Episteme as n-ary relation and as holon. Each concrete episteme instance can be seen both as:
- a filled value assignment over this slot relation; when C.29 tuple reasoning is current, the assignment may be viewed as a tuple view without becoming a second episteme kind, and
- a holon with components (
U.EpistemeCard,U.EpistemeView,U.EpistemePublication) whose fields correspond to those slots.
U.Episteme is thus the holon type whose components are disciplined by the U.EpistemeSlotRelation; C.2.1 fixes that discipline.
-
Morphisms. Simple epistemic morphisms (EntityOfConcern-reference mapping, grounding, encoding, evaluation) are expressed as ordinary relations/functions between these positions and their graph-valued or non-graph-valued fillers. A.6.2-A.6.4 then specify general laws for effect-free morphisms over
U.Episteme. -
Symbol-Concept-Object triangle as didactic projection. The classic Symbol-Concept-Object triangle becomes a didactic view of this slot relation, not the normative ontology; it is simply the projection to:
Symbol~= a subset ofU.RepresentationScheme/U.RepresentationToken,Concept~=U.ClaimGraph,Object~={EntityOfConcern, ReferenceScheme}.
The rest of this pattern fixes the minimal core needed by KD-CAL, A.6.2-A.6.4 and E.17.*. The representational nodes (U.RepresentationScheme, U.RepresentationToken, U.PresentationCarrier, U.RepresentationOperation) are introduced as an extension C.2.1+, preserving the slot-relation boundary and profile defined here.
Minimal epistemic positions (nodes & slots)
This section defines the minimal position set for U.EpistemeSlotRelation and the associated SlotKinds. These are the positions that A.6.2-A.6.4 and E.17.* can rely on.
EntityOfConcernSlot — “what this episteme is about”
Tech: EntityOfConcernSlot (SlotKind), entityOfConcernRef : U.EntityRef (Ref slot in tuples/cards).
Plain: EntityOfConcern value, entity of concern. The plain phrase helps readers name the slot value; it is not a current Tech head.
Intent. Provide a single, explicit slot for the entity (or entities) that an episteme is about, preventing conflation of Object/Reference/Context.
Normative definition.
-
EntityOfConcernSlotis a SlotKind in the sense of A.6.5U.RelationSlotDiscipline.- Its ValueKind is
U.Entity. - Its RefKind is
U.EntityRef(or a species thereof) and MUST be realised in data as a field namedentityOfConcernRef : U.EntityRef(E.10 discipline).
- Its ValueKind is
-
Species of
U.EpistemeKindMAY constrain the ValueKind to a subtypeEntityOfConcernClass ⊑ U.Entity(for example, “the entity of concern is always aU.Holonand, more specifically, aU.SystemorU.Episteme”). The subtype MUST NOT be namedU.EntityOfConcern; “EntityOfConcern value” is a local slot-use phrase, not a kernel type. -
When source wording or a draft uses
U.EpistemicObjectas a separate type, repair it as “U.EntityfillingEntityOfConcernSlot” and keep the source wording only as source wording governed by E.10/F.18.
Didactic cue. “Ask: What, exactly, is this description about? That is the EntityOfConcern.”
GroundingHolonSlot — “where / in what holon this is grounded”
Tech: GroundingHolonSlot (SlotKind), groundingHolonRef : U.HolonRef?.
Plain: grounding holon, holon‑of‑grounding, engagement context.
Intent. Capture the material–social holon (system, lab, infrastructure, organisation, runtime environment) with respect to which an episteme’s claims are tested, calibrated or validated.
Normative definition.
-
GroundingHolonSlotis a SlotKind with:- ValueKind
U.Holon, - RefKind
U.HolonRef(or a species thereof), - and recommended field name
groundingHolonRef? : U.HolonRefin episteme cards/views.
- ValueKind
-
GroundingHolonSlotis optional at the minimal core: an episteme may be un‑grounded at M‑mode (e.g., purely mathematical), but any episteme used for empirical evaluation or assurance under KD‑CAL SHALL either:- populate
groundingHolonRef, or - declare explicitly that no such grounding is possible (e.g., counterfactuals, abstract logics), with consequences reflected in KD‑CAL
R.
- populate
-
The phrase “grounding holon” is plain‑register; there is no kernel type
U.GroundingHolon. It always means “the holon currently fillingGroundingHolonSlotfor this episteme.”
Didactic cue. “Ask: In which lab/organisation/world‑slice do we test or observe this? That is the GroundingHolon.”
U.ClaimGraph and ClaimGraphSlot — claim content
Tech: U.ClaimGraph (kernel type), ClaimGraphSlot (SlotKind).
Plain: claim graph, claim content.
Intent. Reuse the existing KD‑CAL notion of ClaimGraph as the episteme’s claim body, but make its slot value use explicit.
Normative definition.
-
U.ClaimGraphis the ValueKind forClaimGraphSlot:- nodes: typed claims (definitions, axioms, theorems, requirements, properties, assumptions);
- edges: logical/derivational/refinement relations, as already defined in C.2.
-
ClaimGraphSlotis a SlotKind whose instances are always stored by value in core patterns:content : U.ClaimGraphis the normative field inU.EpistemeCard/U.EpistemeView;- C.2.1 MUST NOT introduce
U.ClaimGraphRefas a ValueKind. Any reference type for ClaimGraphs, if needed, is a RefKind defined by discipline packs on top ofU.ClaimGraph.
-
ClaimGraphSlotis mandatory: everyU.EpistemeKindthat uses C.2.1 SHALL have exactly oneClaimGraphSlot.
Didactic cue. “Ask: What is actually being claimed, defined, required, proved? That is the ClaimGraph.”
U.Viewpoint and ViewpointSlot — perspective of concerns and validators
Tech: U.Viewpoint (kernel type), ViewpointSlot (SlotKind), viewpointRef : U.ViewpointRef?.
Plain: viewpoint, perspective, stakeholder perspective.
Intent. Provide a first-class reusable catalogue for ISO-style viewpoints and their generalisations, as used by E.17.0 U.MultiViewDescribing, MVPK, and TEVB.
Normative definition.
-
U.Viewpointis the type of viewpoint specifications:- system or acting-holon families with current role assignments and stakeholder groups the viewpoint speaks for,
- their concerns,
- allowed kinds of Description epistemes and Description epistemes admitted for specification use,
- and conformance rules for views under this viewpoint.
(The internal structure of
U.Viewpointis fixed in E.17.0, not here.)
-
ViewpointSlotis a SlotKind with:- ValueKind
U.Viewpoint, - RefKind
U.ViewpointRef, - normative field name
viewpointRef? : U.ViewpointRefon episteme cards/views.
- ValueKind
-
For Description epistemes, including Description epistemes admitted for specification use, under E.10.D2,
viewpointRefis a mandatory part ofDescriptionContext; C.2.1 treats that as a species-level constraint, not as a universal requirement for all epistemes. -
ViewpointSlotmay be unset in purely internal, pre‑viewpoint epistemes (e.g., raw formal developments), but any episteme that participates in MultiViewDescribing (E.17.0) MUST set it or be deterministically associated to it via aViewpointBundle.
Didactic cue. “Ask: Who is this for, and what do they need to see to accept it? That is the Viewpoint.”
U.EpistemeView / U.View and ViewSlot — episteme‑level views
Tech: U.EpistemeView (kernel species of U.Episteme), selected short form U.View; ViewSlot (SlotKind); viewRef : U.ViewRef.
Plain: view, epistemic view.
Intent. Distinguish view‑epistemes (views of Description epistemes or Description epistemes admitted for specification use) from both:
- the underlying Description epistemes or Description epistemes admitted for specification use themselves, and
- the MVPK literal
publication face/formandinterop publication formvalues ofpublication-face kind, plus the publication-side carriers and renderings on which views are made available (E.17, publication-face-kind discipline, and A.10 carrier/source-currentness relations when evidence or reliance use is current).
Normative definition.
-
U.EpistemeViewis a species ofU.Epistemewhose episteme kind includes, at minimum:- one
ClaimGraphSlot(typically a sliced or projected ClaimGraph), - one
EntityOfConcernSlot, - one
ViewpointSlot, - and appropriate
ReferenceSchemeSlot.
- one
-
U.Viewis the selected short form forU.EpistemeViewin E-cluster patterns (especially E.17.*), used where the word “view” is conventional. -
ViewSlotis a SlotKind whose:- ValueKind is
U.View, - RefKind is
U.ViewRef(orU.EpistemeViewRefspecies), - intended usage is in meta‑structures such as
U.MultiViewDescribingfamilies and MVPK.
- ValueKind is
-
ViewSlotMUST NOT be confused with publication-face labels,publication-face kinddeclarations, or carrier slots: a concrete MVPK face that is a view is represented asU.VieworU.EpistemeView, while the face label, publication-form profile, literalpublication face/formorinterop publication formpublication-face kindvalue, and carrier or rendering remain separate relation positions.
Didactic cue. “Ask: Which particular slice of the description under this viewpoint are we talking about? That is the View.”
U.ReferenceScheme and ReferenceSchemeSlot — interpreting ClaimGraph as claims about entities
Tech: U.ReferenceScheme (kernel type), ReferenceSchemeSlot (SlotKind); referenceScheme? : U.ReferenceScheme.
Plain: reference scheme, interpretation scheme, description scheme.
Intent. Separate what is being said (ClaimGraph) from how claims are read as statements about entities and contexts (designation, measurement, evaluation envelopes), without reifying the referents themselves as a vertex.
Normative definition.
-
U.ReferenceSchemeis a component type of epistemes, not an external entity:- it determines how nodes of
U.ClaimGraphare mapped to properties/relations over values ofEntityOfConcernSlot, - it specifies measurement/evaluation templates (how to test claims on
GroundingHolon), - it fixes claim-scope predicates / admissible regions over declared
U.ContextSliceselectors (and, where needed, references to domain spaces used inside those selectors).
- it determines how nodes of
-
ReferenceSchemeSlotis a SlotKind with:- ValueKind
U.ReferenceScheme, - no RefKind in the minimal core (ReferenceSchemes are stored by value as
referenceScheme? : U.ReferenceSchemefields on episteme cards/views). Discipline packs may introduceU.ReferenceSchemeRefas a RefKind, but must not repurpose it as a new ValueKind.
- ValueKind
-
ReferenceSchemeis the place where Object-vertex concerns are split into explicit claim-to-EntityOfConcern and claim-to-grounding rules:- it does not “contain” the EntityOfConcern value or grounding referent,
- it carries the rules that tie claims to entities and groundings.
Didactic cue. “Ask: Given this ClaimGraph, how exactly do we treat it as talking about these entities in these contexts, and how do we test it? That is the ReferenceScheme.”
Minimal slot relation and extension C.2.1+
The minimal U.EpistemeSlotRelation core for C.2.1 consists of positions (the episteme core SlotKinds of A.6.5 CC-A.6.5-5):
EntityOfConcernSlot(ValueKindU.Entity),GroundingHolonSlot(ValueKindU.Holon),ClaimGraphSlot(ValueKindU.ClaimGraph),ViewpointSlot(ValueKindU.Viewpoint),ViewSlot(ValueKindU.View),ReferenceSchemeSlot(ValueKindU.ReferenceScheme).
This pattern only fixes these positions and their SlotSpec discipline. It does not turn every graph-valued value into a tuple and does not turn the tuple into a graph. The extension C.2.1+ (second step of the refactor) adds:
U.RepresentationSchemeandRepresentationSchemeSlot,U.RepresentationTokenandRepresentationTokenSlot,U.PresentationCarrierandPresentationCarrierSlot,U.RepresentationOperationandRepresentationOperationSlot(with inference regime annotations),
without changing:
- the definition of
U.EpistemeKind, - the minimal
U.EpistemeCardinterface, - or the assumptions A.6.2-A.6.4 / E.17.* make about episteme components.
In C.2.1+ U.PresentationCarrier, publication-face-kind values, MVPK face, carrier, and rendering relations remain publication-side carriers, faces, forms, units, or rendering relations, not semantic parts of the episteme:
U.PresentationCarrier values are linked to U.Episteme and U.View via MVPK and publication-face-kind discipline relations, such as isCarriedBy and MVPK face relations, and MUST NOT be counted as components when reasoning about episteme identity, EntityOfConcernSlot filling, GroundingHolonSlot filling, or KD-CAL morphisms. Changing carriers, publication faces, publication forms, units, or renderings alone never changes the U.Episteme instance determined by C.2.1; it only produces U.Work occurrences that publish or republish the same U.Episteme.
Attached epistemic structures (non-slot components)
U.EpistemeSlotRelation deliberately does not reify every episteme-adjacent structure as a slot. Several key structures remain attached, non-slot components of U.Episteme:
JustificationGraph- the argument/evidence graph for nodes ofU.ClaimGraph(A.10/B.3).EvidenceBindings- per-claim evidence-use bindings, A.10 evidence-provenance refs, or B.3 assurance-evidence refs that connect claims to evidence-producing or evidence-interpretingU.Workoccurrences, role assignments when current, carrier/source-currentness records, and publication or carrier relations.EditionSeries- thePhaseOfchain of episteme editions (A.14) with change-class annotations (symbol-only vs ClaimGraph vs ReferenceScheme changes).ScopeCardandU.ClaimScope- USM scope values (A.2.6) describing where the episteme's claims hold.
These attached structures are not extra positions of U.EpistemeSlotRelation; they hang off the U.ClaimGraph and U.ReferenceScheme pair and are governed by KD-CAL (C.2), A.10, and B.3. C.2.1 only requires that an episteme which participates in KD-CAL exposes them in a way that keeps ClaimGraph, ReferenceScheme, Evidence, EditionSeries, and ClaimScope clearly distinguishable.
Episteme as n‑ary relation and as holon
To prevent confusion between EntityOfConcern values, their descriptions, and the slots they fill in an episteme, C.2.1 explicitly treats epistemes both as:
- n‑ary relations with a signature (slots & values), and
- holons with components (fields & parts).
U.EpistemeKind — episteme as a typed n‑ary relation
Tech: U.EpistemeKind (kernel type).
Intent. Provide a signature‑level description of an episteme as an n‑ary relation whose arguments are governed by SlotKind/ValueKind/RefKind triples per A.6.5.
Normative definition.
-
Every episteme that participates in KD‑CAL belongs to some
U.EpistemeKind. The kind determines:- which SlotKinds appear (
EntityOfConcernSlot,GroundingHolonSlot,ClaimGraphSlot,ViewpointSlot,ViewSlot,ReferenceSchemeSlot, …), - the ValueKind for each slot (always a subtype of
U.Type), - the RefKind used to store it in episteme (when applicable).
- which SlotKinds appear (
-
U.EpistemeKindis a special case ofU.Signature(A.6.0), with its slots governed byU.RelationSlotDiscipline(A.6.5). C.2.1 MUST NOT define an alternative slot discipline. -
For the minimal core, every
U.EpistemeKindMUST include:- exactly one
ClaimGraphSlot, - at least one
EntityOfConcernSlot, - and at least one
ReferenceSchemeSlot. Inclusion ofGroundingHolonSlot,ViewpointSlot,ViewSlotMAY be species-level constraints (mandatory for Description epistemes, including Description epistemes admitted for specification use, optional for others).
- exactly one
Didactic cue.
“An EpistemeKind is the type of episteme: which positions it has and what can go into them.”
Filled episteme value assignment and C.29 tuple view
Tech: filled episteme value assignment over U.EpistemeSlotRelation; C.29 tuple view when tuple reasoning is current.
Intent. Model a filled use of an episteme's slot relation without making tuple, graph, or publication form into the ontology head.
Normative definition.
- A filled episteme value assignment supplies one governed value or reference for each asserted SlotKind in the associated
U.EpistemeKind:- for each SlotKind in the associated
U.EpistemeKind, a value of the slot's ValueKind or a reference value of RefKind, if the kind is configured as such.
- for each SlotKind in the associated
- The filled assignment is notation-agnostic and carrier-agnostic: it does not know about files, formats, publication faces, publication forms, or carriers. It exists to give A.6.2-A.6.4 a minimal notion of "episteme as a filled point over the episteme SlotRelation".
- Under
C.29, the same filled assignment may be viewed as a tuple when tuple reasoning is the selected mathematical lens. That tuple view is a mathematical-lens representation of the filled SlotRelation, not a second episteme kind and not a replacement for graph-valued fillers such asU.ClaimGraph. - In ordinary episteme work, the filled assignment rarely appears directly; it is typically induced by
U.EpistemeCardandU.EpistemeView(which add component structure and meta-information).
Didactic cue. "A filled episteme assignment says what fills which slots; if C.29 asks for tuple reasoning, read that assignment as a tuple view."
U.EpistemeCard, U.EpistemePublication, U.EpistemeView — holonic realisations
Tech: U.EpistemeCard, U.EpistemePublication, U.EpistemeView (species of U.Episteme).
Intent. Provide holon-level structures that engineers can work with (components, mereology, provenance), while keeping them aligned with U.EpistemeKind and U.EpistemeSlotRelation.
Normative definition.
-
U.EpistemeCard. A species ofU.Epistemewhose components correspond one‑to‑one to slots of someU.EpistemeKind:content : U.ClaimGraph(forClaimGraphSlot),entityOfConcernRef : U.EntityRef(forEntityOfConcernSlot),groundingHolonRef? : U.HolonRef(forGroundingHolonSlot),viewpointRef? : U.ViewpointRef(forViewpointSlot),referenceScheme? : U.ReferenceScheme(forReferenceSchemeSlot),- optionally
representationSchemeRef? : U.RepresentationSchemeRef(C.2.1+), meta : Edition/Provenance/Status…. Minimal episteme identity is the pair⟨content, entityOfConcernRef⟩within aU.BoundedContext; all other fields are optional at the genus level but may be mandatory in species. Changes that altercontentor the effectivereferenceScheme(or that intentionally re-identifyentityOfConcernRef) SHALL be realised as new phases in anU.EditionSeries(PhaseOf chain) under A.14 and A.7. Changes confined toU.PresentationCarrier, publication-side values, MVPK face, carrier, or rendering relations do not create a new episteme; they are captured as publication work over the sameU.Episteme.
-
U.EpistemePublication. A species representing epistemes that have been published through publication faces, publication forms, or MVPK relations. It:-
has at least the components of
U.EpistemeCard, -
plus references to MVPK
U.View, face identity, literalpublication face/formorinterop publication formpublication-face kindvalues, publication-scope fields, profile fields, and external carrier or rendering refs as required by E.17 and publication-face-kind discipline, -
but does not re-interpret face labels,
publication-face kindvalues, or carriers/renderings as parts of the episteme; carriers remain external.
-
-
U.EpistemeView. As defined in §4.1.5, a species ofU.Epistemerepresenting a view under a specificU.Viewpoint. Its components are a specialisation ofU.EpistemeCard:- ClaimGraph often restricted/projection of a base description and specification-useification,
- Viewpoint fixed,
- ReferenceScheme tailored to that viewpoint.
Alignment requirement. For any of these species, the pattern MUST state explicitly:
- which
U.EpistemeKindit realises, and - how each component maps to a SlotKind/RefKind under
U.RelationSlotDiscipline.
This ensures that A.6.2–A.6.4 can treat any U.Episteme* uniformly as both:
- a category-theory object in the category Ep, and
- a structured holon with components.
Episteme, publication, view, carrier, cue, and authority-reference relation positions (normative)
C.2.1 is the default FPF pattern for claim-bearing units. Do not mint a generic U.SemioObject, U.SemioticObject, U.SignObject, U.WorkingObject, or U.SourceMaterial when the claim-bearing unit in question should be modeled as an episteme. Use U.Episteme or a declared species of U.Episteme.
When the same claim-bearing unit is available to readers, tools, or downstream work as a published episteme, name that relation position as U.EpistemePublication or as a governed U.Episteme publication. Then keep the adjacent relation positions separate:
- publication form - the concrete form in which the episteme is made available for some use, such as a cue pack, transfer-prepared claim set, prompt form, partial normal form, record, card, table, or local C.29 output;
- view, including MVPK face -
U.VieworU.EpistemeViewunder a declaredU.Viewpoint, including MVPK faces such asPlainView,TechCard,InteropCard, orAssuranceLane; - carrier or rendering - the document, dashboard, generated screen, trace file, transport envelope, display, or A.10 carrier/source-currentness record that bears or renders a publication;
- source-finding cue - a badge, tile, heading, signature-looking mark, credential display, generated explanation, or other cue that helps find a source but does not by itself create an authority-reference relation;
- governing pattern reference and authority-reference field -
governingPatternRefwhen one FPF pattern governs admissible interpretation or use;authoritySourceRefwhen a non-pattern authority-source referent such as an external standard, editioned register, decision record, gate decision, policy source, or role-assignment or status register carries the relevant authority. The publication records this reference; it does not become the referenced authority.
For latent, distributed, reconstructed, or model-state material, do not call the encountered material a U.Episteme merely because it can be decoded into prose, embedded in a vector space, or shown as a dashboard cue. It becomes an episteme only when the needed C.2.1 positions are recoverable for the current use: at least the EntityOfConcernSlot, ClaimGraphSlot, ReferenceSchemeSlot or equivalent interpretation rule, and any current grounding, viewpoint, view, publication, carrier, source-use, evidence, or authority-reference relation named by the direct governing pattern.
No publication form, view, face, carrier, rendering, source-finding cue, dashboard signal, credential display, generated explanation, FPF pattern file, or FPF pattern section is itself a substitute for a governed U.Episteme, an evidence relation, an assurance claim, a gate decision, a permission, a role claim, a status claim, or a U.Work occurrence. If the next move concerns work, keep candidate reliance, U.WorkPlanning, planned work, actual U.Work, work result, and work-result measurement in their own work-side patterns rather than storing them inside the episteme or its carrier.
SlotKind / ValueKind / RefKind discipline for EntityOfConcern & GroundingHolon
C.2.1 adopts A.6.5 U.RelationSlotDiscipline wholesale. For the two key positions:
- EntityOfConcernSlot.
SlotKind = EntityOfConcernSlot;ValueKind = U.Entity(species may constrain toEntityOfConcernClass ⊑ U.Entity);RefKind = U.EntityRef(or a species thereof);- normative field name in episteme cards:
entityOfConcernRef : U.EntityRef. No kernel type namedU.EntityOfConcernis introduced; the phrase “EntityOfConcern value” always means “an instance ofU.EntityfillingEntityOfConcernSlot”.
- GroundingHolonSlot.
SlotKind = GroundingHolonSlot;ValueKind = U.Holon;RefKind = U.HolonRef;- normative field name:
groundingHolonRef? : U.HolonRef. There is no kernel typeU.GroundingHolon; “grounding holon” is a slot-filler phrase. Any episteme text that mixes slot/value/ref concepts (e.g., usingEntityOfConcernRefas if it were a type) MUST be repaired to this discipline when the claim is current; C.2.1 provides the normative reference, and F.18 or the relevant discipline pattern governs any naming decision.
Minimal epistemic morphisms (informal schema)
Note. The full mathematical treatment (categories Ep and Ref, entityOfConcern functor
α : Ep → Ref, and effect‑free morphisms) lives in A.6.2–A.6.4. Here we fix only the episteme-slot relations that C.2.1 expects to exist between its positions.
At the level of U.EpistemeCard components and SlotKinds, we assume the following primitive relations (not all are functions):
-
entityOfConcernSet : U.Episteme → P(U.Entity)derivable fromEntityOfConcernSlotandReferenceScheme- For an episteme
E,entityOfConcernSet(E)is (at least) the singleton containing the entity referenced byentityOfConcernRef(E); in more complex cases, it may be a finite set or bundle of entities, determined byReferenceScheme. - The functorial EntityOfConcern mapping
δ_E : Ep → Refused in A.6.2–A.6.4 is the categorical lift of this relation: it forgets episteme internals and keeps only the EntityOfConcern value in the ReferencePlane determined by the pair<EntityOfConcernSlot, GroundingHolonSlot>.
- For an episteme
-
grounds : (U.Entity, U.Holon) ⇝ GroundingRelationrelates EntityOfConcern values to grounding holons- Captures how values of
EntityOfConcernSlotare situated in holons that make evaluation possible (labs, infrastructures, organisations). - Need not be total or functional; an entity may admit multiple grounding holons, or none.
- Captures how values of
-
designates : (U.ReferenceScheme, U.ClaimGraph, U.Entity, U.Holon) ⇝ DesignationProfilehow claims are read as statements about entities in contexts- Specifies, for each claim in
contentand each<entityOfConcernRef, groundingHolonRef>, what property/relation it purports to state, and under what conditions.
- Specifies, for each claim in
-
satisfies / evaluatesTo : (U.ClaimGraph, U.ReferenceScheme, U.Holon) → TruthProfile/SuccessProfileevaluation of claims under a reference scheme and grounding -
View-related morphisms (to be connected with A.6.3):
viewProject : (U.Episteme, U.Viewpoint) → U.View— effect-free, EntityOfConcern-preserving projection that slicesClaimGraphand specialisesReferenceSchemeunder a given viewpoint.viewEmbed : U.View → U.Episteme— embedding of a view back into the wider episteme, typically as a reference with correspondence proofs.
-
Reflexive entityOfConcern guard. When
EntityOfConcernSlotorReferenceSchemepicks out an episteme or claim that includes the referring claim itself (ReferencePlane = episteme), publishers SHALL ensure that the induced justification/evaluation structure is acyclic per evaluation chain: reflexive describe/citation handles may exist as literature handles, but they MUST NOT form a minimal justification cycle for acceptance or KD-CAL assurance. Self‑reference is allowed as a citation pattern, not as a way to close justification loops.
These are not yet laws; they are the hooks that A.6.2–A.6.4 will formalise into:
U.EffectFreeEpistemicMorphing(Ep→Ep morphisms over this structure),U.EpistemicViewing(entityOfConcern‑preserving Ep→Ep),U.EpistemicRetargeting(entityOfConcern‑retargeting Ep→Ep).
Older semantic triangle as didactic view (informative)
Position. The classical semiotic or semantic triangle ("Symbol-Concept-Object", Ogden-Richards/Frege-Carnap style) is not the normative ontology for epistemes in FPF. For U.Episteme, it is treated as a didactic projection of U.EpistemeSlotRelation. The projection compresses several SlotSpecs and graph-valued fillers into three teaching corners:
- "Symbol" corner ~= {
U.RepresentationToken,U.RepresentationScheme,U.PresentationCarrier} when C.2.1+ is in use; in the minimal core this is collapsed into whichever external carrier bears theU.ClaimGraphpublication. - "Concept" corner ~=
U.ClaimGraph+U.ReferenceSchemeunder a chosenU.Viewpoint. This is the claim content plus its interpretation recipe. - "Object" corner ~= the slot filler of
EntityOfConcernSlot(ValueKindU.Entity) plus the slot filler ofGroundingHolonSlot(ValueKindU.Holon) and the grounding relation between them.
Under this didactic projection the triangle is a three-corner quotient of the episteme slot relation:
All viewpoints, operations, carriers and reference planes are suppressed in the classical diagram. The cost of this suppression is precisely the confusion that motivates C.2.1:
- describing becomes a single unlabeled arrow,
- inference regimes disappear,
- measurement and grounding are invisible.
Didactic use. C.2.1 allows the triangle only in the following cases:
- As an introductory picture in guidance material ("this is the coarse triangle; the actual pattern is the episteme slot relation").
- As a quotient diagram: an explicit note that "this figure ignores viewpoint, grounding, carrier, and operationality; see C.2.1 for the full structure".
- As an external-triangle alignment aid when mapping to standards or literature that speak only in triangle terms.
Guard. Any pattern or documentation page that uses a "semantic triangle" diagram MUST either:
- explicitly state "this is a didactic projection of C.2.1
U.EpistemeSlotRelation", or - treat it as an external-triangle reference when aligning with external standards.
The triangle MUST NOT be used as a kernel-level ontology or as a source for morphism laws. All normative reasoning about epistemes proceeds via the slots, graph-valued fillers, non-graph-valued fillers, and components governed by U.EpistemeSlotRelation.
Interaction with EntityOfConcern and Description-episteme boundary, specification use/refinement, and DescriptionContext (normative)
C.2.1 is the episteme-side slot schema that EntityOfConcern / Description-episteme discipline (A.7, E.10.D2) relies on. The link is made via DescriptionContext, not by treating EntityOfConcern value, Description epistemes, and specification use/refinement as layers, carriers, or peer ontology classes.
DescriptionContext over C.2.1 components
For any episteme that is a Description in the sense of E.10.D2, including a Description episteme admitted for specification use, the field subjectRef : U.SubjectRef is interpreted as a DescriptionContext triple:
where:
EntityOfConcernRef : U.EntityRef— fillsEntityOfConcernSlot(ValueKindU.Entity, species often constrained via EntityOfConcernClass ⊑U.Entity).BoundedContextRef : U.BoundedContextRef— points to the context that fixes vocabulary, units, and admissible inferences for this description (E.10.D1).ViewpointRef : U.ViewpointRef— fillsViewpointSlot(ValueKindU.Viewpoint) and determines which concerns, system or acting-holon families with current role assignments, stakeholder groups, and conformance rules apply.
Normative requirement (DESCCTX-13).
For every …Description episteme, and every …Spec use admitted by neighbouring specification use/refinement gates:
subjectRefSHALL be decodable to a well‑formed DescriptionContext triple.EntityOfConcernReffrom that triple SHALL be identical to the fieldentityOfConcernRefthat fillsEntityOfConcernSlotin the correspondingU.EpistemeCard/U.EpistemeView.ViewpointRefin DescriptionContext SHALL agree withviewpointRefin the episteme card or be uniquely derivable from aU.ViewpointBundlein E.17.1 (with the derivation rule documented).
EntityOfConcern values such as U.System, U.Method, U.Role, or U.Episteme appear in C.2.1 as values of EntityOfConcernSlot when an episteme describes, views, or retargets them. They are not the Description episteme produced by that use. The EntityOfConcern / Description-episteme boundary separates the EntityOfConcern value from the Description episteme; specification use/refinement is a separate gated use or refinement of that Description episteme, not a third peer ontology class. This boundary does not ban epistemes from being EntityOfConcern values.
Example. A formal postulate theorem in physics can be a Description episteme about the behaviour of a physical grounding holon. Its EntityOfConcernSlot points to the physical grounding holon, or to the exact behavior, method, or work entity only when a governing pattern has selected that entity under concern; its claim graph carries the theorem, postulates, and derivation; its formal language belongs to formality and publication-expression discipline. It becomes a specification only if a bounded use assigns specification force, such as acceptance criteria, harness checks, normative invariants, C.16 measurement criteria, or verification use. Formal notation alone does not change the slot relation into a third Specification ontology class.
EntityOfConcern-to-Description morphism and specification-use boundary over C.2.1
-
Describing (
Describe_EoC_DescEp : EntityOfConcern -> DescriptionEpisteme). Produces an episteme whose:content : U.ClaimGraphencodes the descriptive claims about theEntityOfConcernvalue,entityOfConcernRefpoints to the EntityOfConcern value,groundingHolonRef(if present) fixes where the description is evaluated or tested,viewpointRefselects the describing viewpoint.
Describe_EoC_DescEpis conformant to A.6.2 but not an Ep→Ep morphism (domain is theEntityOfConcernvalue, codomain is a Description-sideU.Episteme). C.2.1 provides the codomain schema and ensures that the resulting Description has a valid DescriptionContext.
C.2.1 does not decide that a Description episteme has become a Specification. If a bounded use formalises, constrains, test-harnesses, accepts, or publishes a Description episteme as a specification, the governing pattern must name the exact specification-use gate: A.6.2 for effect-free episteme refinement, C.2.3 for formality and checkability, A.21 or the relevant gate/acceptance pattern for harness and acceptance force, C.16 for measurement criteria, E.17 for publication expression, and E.10 for suffix discipline. The C.2.1 requirement is only that the Description episteme keeps the same entityOfConcernRef, BoundedContextRef, and ViewpointRef unless an retargeting or viewing pattern named by value declares otherwise.
C.2.1 does not define the full EntityOfConcern / Description-episteme boundary or the specification-use gates; it only insists that any ...Description episteme, and any ...Spec use admitted by neighbouring gates, must:
- implement
U.EpistemeCardorU.EpistemeViewwithcontent,entityOfConcernRef,groundingHolonRef?,viewpointRef?, andreferenceScheme?fields, and - wire these fields into
subjectRefas DescriptionContext.
Alignment with A.6.2–A.6.4 (episteme morphisms) (normative)
U.EpistemeSlotRelation is the slot-relation substrate for the episteme morphism patterns:
Effect‑free episteme morphisms (A.6.2) over C.2.1
For any f : X → Y that is an instance of U.EffectFreeEpistemicMorphing:
-
Typed episteme values. X and Y are
U.Epistemeinstances realised asU.EpistemeCard/U.EpistemeViewwith at least the minimal core components:Any additional C.2.1+ components (RepresentationScheme, Tokens, Carriers, Operations) are visible to A.6.2 only through their declared SlotKinds (A.6.5).
-
EntityOfConcernChangeMode characteristic.
fMUST declare aentityOfConcernChangeMode ∈ {preserve, retarget}:preserve—entityOfConcernRef(Y) = entityOfConcernRef(X)and any change togroundingHolonRef/viewpointRefmust be justified by Bridges/CorrespondenceModel, without changing the EntityOfConcernSlot value;retarget— permitted only for A.6.4 species; see below; in this case the characteristic records an intentional change in the pair<entityOfConcernRef, groundingHolonRef>under a declaredKindBridgein the appropriate ReferencePlane.
This EntityOfConcernChangeMode is a CHR-style characteristic (A.17) on episteme morphisms, which points directly to
EntityOfConcernSlot. Avoid introducing a separate “entityOfConcern” term alongsideEntityOfConcern. -
Component discipline. P0–P5 from A.6.2 are read directly in terms of C.2.1 components:
- purity ⇒ only C.2.1 components of Y may change; no Work/Mechanism side‑effects;
- conservativity ⇒ claims in
content_Yread viareferenceScheme_Yabout the new<EntityOfConcern, GroundingHolon>do not go beyond what already follows fromcontent_XviareferenceScheme_Xunder the declared EntityOfConcernChangeMode and Bridges; - functoriality ⇒ composition of such transformations respects the slot structure and ReferenceSchemes.
Any Ep→Ep pattern that operates on U.Episteme MUST state which C.2.1 slots it reads and which it may write, in terms of SlotKinds/ValueKinds/RefKinds (A.6.5), and then declare itself a species of A.6.2/3/4 as appropriate.
EpistemicViewing (A.6.3) as entityOfConcern‑preserving projections
U.EpistemicViewing is the EntityOfConcern-preserving species of A.6.2. Over C.2.1 this means:
entityOfConcernRef(Y) = entityOfConcernRef(X)— the same value inEntityOfConcernSlot.groundingHolonRefis preserved, or changed only within a fixed grounding context (e.g. normalising identifiers for the same lab or runtime).viewpointRefis either:- preserved (internal normalisation under the same viewpoint), or
- replaced by another
U.ViewpointRefwithin aU.MultiViewDescribingfamily (E.17.0), with invariants enforced by a CorrespondenceModel.
contentandreferenceSchemeare transformed conservatively: no new claim content about the sameEntityOfConcernis introduced.
Typical examples:
- filtering or aggregating
U.ClaimGraphto a view relevant for a stakeholder group; - rendering a behavioural specification into a tabular or diagrammatic episteme under a publication viewpoint;
- normalising a logic‑heavy episteme into a more operational one, while keeping the same system EntityOfConcern and context.
In terms of SoTA, EpistemicViewing behaves like a lens or optic over C.2.1: a focus (SlotKinds for content/representation) is manipulated while the EntityOfConcern is fixed.
EpistemicRetargeting (A.6.4) as EntityOfConcern-bundle retargeting on episteme morphisms
U.EpistemicRetargeting is the species of A.6.2 where entityOfConcernChangeMode = retarget.
It is always a morphism between epistemes (f : X → Y in U.Episteme), but the adjective “retargeting” refers not to the fact that an episteme is mapped to another episteme (this is true for all A.6.2 species), and not to a separate entityOfConcern, but specifically to the change in the EntityOfConcern-bundle classified by C.2.1:
entityOfConcernRef(Y) ≠ entityOfConcernRef(X)— the value stored forEntityOfConcernSlotchanges;- a
KindBridgemust relateKind(entityOfConcernRef(X))andKind(entityOfConcernRef(Y)); groundingHolonRefmay remain the same (e.g. same plant, different subsystem) or be transformed along a Bridge in the same ReferencePlane.
In practice, many retargetings operate on the EntityOfConcernSlot/GroundingHolonSlot pair (for example, when an episteme about a physical module is re-interpreted as an episteme about a function-holon realised in a different environment). The characteristic entityOfConcernChangeMode still classifies such morphisms by whether this pair is preserved or intentionally re-identified under a KindBridge and reference-plane policy; the episteme on the codomain side is just the usual A.6.2 codomain episteme.
Over C.2.1 this is used for:
- functional vs structural reinterpretation (e.g. an episteme about a physical module retargeted to an episteme about the function it realises; StructuralReinterpretation in E.18 becomes a species of A.6.4);
- signal vs spectrum transitions (Fourier-style moves where the
EntityOfConcernSlotvalue changes from time-domain signal to frequency-domain representation but an invariant, such as energy, is preserved); - data vs model transitions (e.g. retargeting an episteme about raw observations to an episteme about a learnt model, with an invariant such as likelihood or sufficient statistics).
C.2.1 ensures that these retargetings have a clear domain EntityOfConcernSlot value and codomain EntityOfConcernSlot value and that any such move is expressed as a morphism over well-typed slots, not as an unstructured rewrite of “subject” or “object” labels.
Alignment with E.17. (Multi‑View Describing & Publication) (normative)*
U.EpistemeSlotRelation underpins the E.17 cluster:
- E.17.0
U.MultiViewDescribing - E.17.1
U.ViewpointBundleLibrary - E.17.2
TEVB — Typical Engineering Viewpoints Bundle - E.17
MVPK — Multi‑View Publication Kit
Multi‑View Describing (E.17.0)
U.MultiViewDescribing organises families of Description epistemes and Description epistemes admitted for specification use over a shared entity of concern:
- The EntityOfConcernClass parameter of E.17.0 is a species constraint on the ValueKind of
EntityOfConcernSlot(EntityOfConcernClass ⊑ U.Entity). - Each member of a multi‑view family is a
…Description/…Specepisteme with:entityOfConcernRefinto that EntityOfConcernClass,viewpointRefdrawn from aU.ViewpointBundle,subjectRefdecoding to DescriptionContext.
Within this pattern:
U.Viewpointis exactly the ValueKind ofViewpointSlotin C.2.1.U.ViewisU.EpistemeView, a species ofU.Epistemewhosecontentis already restricted to a particularU.Viewpointand often also to a particularU.RepresentationScheme.
C.2.1 thus supplies the per‑episteme structure that E.17.0 rearranges into multi‑view families.
Viewpoint bundles (E.17.1/E.17.2)
U.ViewpointBundleLibrary and TEVB specialise the U.Viewpoint node:
- A ViewpointBundle is a set of
U.Viewpointinstances tailored to a class of entities of concern (e.g., holons in engineering contexts). - TEVB fixes
EntityOfConcernClass = U.Holon(typicallyU.SystemorU.Episteme) and provides canonical engineering viewpoints: functional, structural, role‑enactor, interface‑oriented, etc.
From the C.2.1 perspective:
- these bundles populate the ValueKind of
ViewpointSlot; - engineering episteme species that want to be “TEVB‑aligned” must restrict
viewpointRefto TEVB’sEngineeringVPIdset, while keeping the same EntityOfConcernSlot discipline.
MVPK (E.17) as publication over C.2.1 views
MVPK treats U.View (i.e. U.EpistemeView) as its primary input:
- it uses
U.EpistemicViewingspecies (A.6.3) to generate publication‑oriented views from engineering or logical views; - it then publishes these
U.Viewepistemes through declared publication-face-kind values with declared publication viewpoints and faces.
C.2.1’s distinction between:
U.Viewpoint(epistemic perspective specification) andU.PresentationCarrier(carrier in C.2.1+ and publication-face-kind discipline)
keeps epistemic perspective and physical medium separate:
- MVPK operates on
U.Viewepistemes and then on carriers; - the same View can be realised on multiple carriers without changing its entityOfConcern or ClaimGraph.
Any MVPK species that claims to be C.2.1‑conformant MUST:
- treat
U.Viewas aU.EpistemeViewwith a valid C.2.1 core, - document which C.2.1 slots it reads/writes (typically only representation/carrier‑related ones, leaving
EntityOfConcernSlotandGroundingHolonSlotuntouched), - refrain from introducing new claims about the EntityOfConcern value beyond what is in the source
U.View’s ClaimGraph.
Bias‑annotation (informative)
Episteme‑first and pragmatics‑first.
The pattern assumes that a claim-bearing episteme is meaningful only when it is about something for someone under some perspective. This follows the pragmatic turn in semantics: EntityOfConcern and concerns are not afterthoughts but part of the core structure. The slot relation is organized around EntityOfConcern, GroundingHolon, Viewpoint, and ClaimGraph positions, while graph-valued fillers such as ClaimGraph and JustificationGraph remain distinct values inside those positions.
Operational/representational bias. C.2.1+ anticipates that certain RepresentationSchemes are operational in Novaes’ sense (admitting direct syntactic inference, like pen-and-paper arithmetic or proof states) while others are purely notational. The pattern remains neutral on which schemes are used but bakes in a place for operations and carriers so that:
- symbol‑manipulating tools (SAT/SMT, proof assistants, classical programming languages),
- distributed/latent representations (LLM embeddings, latent protocols like “DroidSpeak”, “Coconut”‑style communication),
- hybrid ReAct‑style agent loops
can all be treated as different species operating over the same U.EpistemeSlotRelation. There is a bias towards making these operational differences explicit instead of hiding them behind "the model".
Viewpoint and stakeholder bias.
The pattern leans on the ISO‑style idea that viewpoints encode stakeholder concerns and role‑families, but it generalises this beyond architecture. U.Viewpoint is intentionally context-local and not bound to any single discipline; still, the examples are skewed toward engineering and epistemic use‑cases.
Didactic bias. The pattern is written to be teachable: semantic triangles are kept as didactic projections; examples like stools on lab rigs, services and SLAs, and model‑evaluation epistemes are deliberately simple. This may under‑represent more exotic epistemes (e.g. artistic, legal, or socio‑technical ones), but the intention is that these use the same slots with different species‑level constraints.
Conformance checklist (normative)
CC‑C.2.1‑1 - Minimal core components for episteme species.
Any species of U.Episteme that participates in EntityOfConcern / Description-episteme boundary discipline, specification use/refinement, or E.17 multi-view/publishing MUST be representable as U.EpistemeCard/U.EpistemeView with at least:
and corresponding SlotSpecs consistent with A.6.5 (EntityOfConcernSlot, GroundingHolonSlot, ClaimGraphSlot, ViewpointSlot, ReferenceSchemeSlot).
CC‑C.2.1‑2 - No kernel type for “EntityOfConcern” or “GroundingHolon”.
Patterns MUST NOT introduce kernel types U.EntityOfConcern or U.GroundingHolon:
- EntityOfConcernSlot has ValueKind
U.Entity( species‑constrained via EntityOfConcernClass if needed), - GroundingHolonSlot has ValueKind
U.Holon.
Plain terms “EntityOfConcern value” and “grounding holon” are allowed only as slot-filler descriptions under the declared SlotKind/ValueKind/RefKind discipline.
CC‑C.2.1‑3 - SlotKind/ValueKind/RefKind discipline.
All episteme‑related slots, including EntityOfConcernSlot, GroundingHolonSlot, ClaimGraphSlot, ViewpointSlot, ViewSlot, ReferenceSchemeSlot (and any extensions in C.2.1+), MUST:
- follow the naming discipline of A.6.5 (
*Slotfor SlotKinds,*Refonly for RefKinds/fields), - declare a ValueKind and refMode (
ByValueor a RefKind), - be used consistently across patterns that refer to the same conceptual position.
CC‑C.2.1‑4 - DescriptionContext wiring.
Any episteme species whose name or pattern claims to be a …Description or …Spec in the sense of E.10.D2 MUST:
- expose
subjectRef : U.SubjectRef, - provide a decoding to
DescriptionContext = ⟨EntityOfConcernRef, BoundedContextRef, ViewpointRef⟩, - ensure that
EntityOfConcernRefmatchesentityOfConcernRef(EntityOfConcernSlot), and - ensure that
ViewpointRefmatchesviewpointRefor is derivable from aU.ViewpointBundleunder documented rules.
CC‑C.2.1‑5 - Morphism declarations over slots. Any pattern in A.6.2–A.6.4, E.17, E.18, or discipline packs that defines morphisms between epistemes SHALL:
- state whether it is a species of
U.EffectFreeEpistemicMorphing,U.EpistemicViewing, orU.EpistemicRetargeting, - declare its
entityOfConcernChangeMode(preserve/retarget), - name which SlotKinds it reads and writes,
- state its behaviour on
entityOfConcernRef,groundingHolonRef,viewpointRef, andreferenceScheme.
CC-C.2.1-5a - Episteme/publication relation-position split for semio-facing terms.
Any pattern, publication-form profile, evidence-use note, or FPF-facing term that uses pre-FPF sign vocabulary, explanation, publication, source cues, authority-looking cases, or reader reliance MUST name the claim-bearing value as U.Episteme, U.EpistemePublication, or a declared species of U.Episteme. When publication is current, it MUST separately name the publication form, U.View or MVPK face, carrier or rendering, source-finding cue, and either governingPatternRef or authoritySourceRef when interpretation or use depends on a named authority reference. It MUST NOT use generic semio wording, generic source wording, generic project-work wording, or container-placement wording as solution terms.
CC-C.2.1-6 - Semantic-triangle usage guard.
If a semantic triangle or parallelogram diagram appears in a pattern or tutorial, there must be an explicit note that:
- it is a didactic projection of
U.EpistemeSlotRelation, and - normative laws are stated in terms of C.2.1 slots, graph-valued fillers such as
ClaimGraph, and morphisms, not in terms of triangle corners.
CC-C.2.1-7 - KD-CAL / ReferencePlane alignment. Any pattern that evaluates or compares epistemes (KD‑CAL/LOG‑CAL, CHR, CG‑Spec, etc.) MUST point out:
- how
U.ClaimGraphis interpreted in a ReferencePlane, - how
GroundingHolonSlotfigures into measurement or validation,
CC‑C.2.1‑8 - Context locality and Bridges.
Any U.Episteme species that is consumed by KD‑CAL / LOG‑CAL / CHR‑based patterns SHALL declare a U.BoundedContextRef; all F–G–R computations and C.2.1 slot interpretations are context-local. Cross-context use MUST proceed via an explicit Bridge with CL / Φ-policy (F.9/B.3), with penalties applied to the R component only; F and the slot structure from C.2.1 remain unchanged.
CC‑C.2.1‑9 - Carriers and Work outside episteme content.
C.2.1 inherits the current A.7 strict distinction plus C.2.1 slot-relation, E.17 publication/carrier, A.10 evidence-use and provenance, B.3 assurance, A.2/A.2.1 role-assignment, A.15 work, and A.3.4 transformation discipline: U.PresentationCarrier values, publication-side values, U.Work occurrences, and role assignments MUST NOT be treated as parts of U.Episteme or as values of any SlotKind in U.EpistemeSlotRelation. Episteme content stays in U.ClaimGraph and U.ReferenceScheme; evidence enters only through an A.10 evidence-provenance graph relation or B.3 assurance-evidence input that points to evidence-producing or evidence-interpreting U.Work occurrences, carrier/source-currentness records, and role assignments when those are current. Changing carriers or re-publishing work alone does not change the episteme determined by the filled content, entityOfConcernRef, and effective referenceScheme positions in its U.BoundedContext.
CC‑C.2.1‑10 - Reflexive entityOfConcern guard.
When an episteme uses C.2.1 to speak about another episteme (ReferencePlane = episteme), or about itself (self-describing or meta-specification cases), patterns SHALL ensure that the resulting JustificationGraph / evaluation chains are acyclic along justification paths. Reflexive describe / citation edges may exist as literature references, but they MUST NOT form minimal justification cycles for acceptance or KD-CAL assurance decisions; the trust calculus MUST always bottom out in separated evidence relation material, such as evidence-producing or evidence-interpreting U.Work plus an A.10 evidence-provenance graph relation or B.3 assurance-evidence input, rather than in purely self-referential claims.
Consequences (informative)
Benefits
- Single, extensible episteme core.
C.2.1 gives a small, stable set of positions (EntityOfConcern, GroundingHolon, ClaimGraph, Viewpoint, View, ReferenceScheme) and components (
U.EpistemeCard,U.EpistemeView,U.EpistemePublication) on which all higher‑level patterns depend. This avoids the proliferation of “epistemic objects” and “facets” with overlapping semantics. Transparent EntityOfConcern & grounding discipline. The pair (EntityOfConcernSlot,GroundingHolonSlot) is no longer hidden inside ad-hoc “SubjectRef” fields or semantic triangles: both are explicit, typed slots. This makes retargeting, viewing and correspondence laws (A.6.2–A.6.4, E.17.0) easier to state and check. - Better fit for contemporary representation practice.
By distinguishing ClaimGraph, RepresentationScheme, Tokens, Carriers and Operations (in C.2.1+), the pattern matches contemporary SoTA views of notation and formalism:
- formal languages as cognitive tools and de-semanticisation techniques (Novaes),
- operational iconicity and medium‑sensitive reasoning (Krämer, Malafouris),
- hybrid symbolic-neural reasoning methods (e.g. ReAct, tool-augmented LLMs, latent protocols). FPF can model both symbol-heavy and latent-heavy reasoning methods without privileging either.
- Uniform substrate for multi‑view description and publication. MultiViewDescribing, viewpoint bundles (TEVB), and MVPK all land on the same episteme core. This avoids the current “views vs viewpoints vs faces” confusion and leaves “architecture” as a domain‑specific specialisation rather than a competing meta‑ontology.
- Tooling alignment. Slot discipline plus explicit episteme components map cleanly to implementation types (records, row‑typed schemas, effectful handlers). Tools can generate code, schemas or telemetry from episteme species without guessing what “subject”, “context” or “object” mean.
Trade‑offs / costs
- More explicit structure. Pattern users and authors must declare slots, ValueKinds and references explicitly, and keep DescriptionContext consistent. This is more upfront work than writing ad‑hoc “Subject/Object” fields, but it pays off in substitution safety and cross‑pattern reuse.
- Repair effort.
Uses of “EpistemicObject”, “Facet”, “Subject”/“Object”, and raw
...Reffields need repair into C.2.1 slots + A.6.5 SlotSpecs when the claim is current. Current prose uses the selected C.2.1 slots and A.6.5 SlotSpecs directly; such wording is source material for repair, not a current alternate vocabulary. - Exposure of representation biases. Being explicit about RepresentationSchemes and Operations may make disagreements visible about which representations are "primary" in a team or discipline. C.2.1 does not resolve these disagreements; it only makes them visible and therefore debatable.
Relations (overview)
Builds on
-
A.1
U.Holon— for treating episteme as a holon with components. -
A.6.0
U.Signature— for interpreting episteme kinds as n‑ary relations over slots. -
A.6.5
U.RelationSlotDiscipline— for SlotKind/ValueKind/RefKind discipline over episteme slots. -
A.7, E.10.D2 — for
EntityOfConcern/ Description-episteme boundary discipline, specification use/refinement gates, and the interpretation ofsubjectRefas DescriptionContext. -
C.2 (KD‑CAL, LOG‑CAL) — for ClaimGraph semantics, ReferencePlanes, and Bridges.
-
E.8, E.10 — for pattern authoring discipline and lexical guards.
-
Constrains
-
A.6.2–A.6.4 — by fixing the minimal episteme component set those morphisms operate on and by requiring an explicit EntityOfConcernChangeMode characteristic (
entityOfConcernChangeMode ∈ {preserve, retarget}) overEntityOfConcernSlot/GroundingHolonSlot. -
E.17.0–E.17.2 — by specifying how
EntityOfConcern,Viewpoint,Viewand ReferenceSchemes are represented at episteme level. -
E.17 (MVPK) — by separating
U.View(episteme) fromU.PresentationCarrier(publication carrier), and by requiring that publication morphisms beU.EpistemicViewingspecies over C.2.1‑conformant views. -
F.18 (LEX‑BUNDLE) — by providing the episteme‑specific name cards and guards for EntityOfConcern/GroundingHolon/Viewpoint/View/ReferenceScheme and their SlotKinds.
Used by
- A.6.2
U.EffectFreeEpistemicMorphing— as the default episteme slot/value structure for episteme-to-episteme transforms. - A.6.3
U.EpistemicViewing— as the substrate for entityOfConcern‑preserving projections (views). - A.6.4
U.EpistemicRetargeting— as the substrate for EntityOfConcern-bundle retargeting transforms between epistemes (Ep→Ep withentityOfConcernChangeMode = retarget). - E.17.0
U.MultiViewDescribing, E.17.1, E.17.2 — to organise families of Description epistemes, including Description epistemes admitted for specification use, under Viewpoints andEntityOfConcernClassconstraints. - E.17 (MVPK) — to publish episteme views through publication faces, publication forms, and carriers.
- E.18 - to interpret StructuralReinterpretation and other engineering projections as episteme morphisms over a well-typed
U.EpistemeSlotRelation.
Together, these relations make U.EpistemeSlotRelation the single normative core for thinking about epistemes, their EntityOfConcern mapping, their representations, and their transformations across FPF.
C.2.1:End
Epistemic Precision Restoration
Type: C.2 precision-restoration pattern for episteme, publication, and source-use wording Status: Stable Normativity: Normative unless a section is explicitly informative
Use this when
First useful move. Decide whether the wording is source-expression clarification or FPF-governed use. Then write the smallest sufficient output: repaired sentence, candidate-set note, compact epistemic precision-restoration row, full epistemic precision-restoration check, or explicit non-use disposition.
Source-expression clarification. Use this mode when ordinary non-FPF prose needs precise interpretation. The aim is source-local clarification: recover what the sentence may mean, identify candidate kinds and relations, preserve important wording when needed, and produce one clarified phrase, candidate-set note, epistemic precision-restoration note, or use disposition. This mode may apply E.10, A.6.P, A.6.6, F.18, A.7, E.17, or another governing FPF pattern as a repair lens, but it does not require the source expression itself to use FPF vocabulary.
FPF-governed use. Use this mode when wording has FPF-governed use and relies on loose wording around epistemes, publications, views, publication forms, generic publication faces, MVPK faces under E.17 constraints, bounded publication units, carriers, records, relations, declared use boundaries, or pattern application. The wording states the recovered FPF kind named by value, relation record, relation phrase, tuple-like record, project-side FPF kind and reference named by value, or explicit non-use disposition.
Use C.2.P as epistemic precision restoration for wording whose current entity or construction is an episteme, publication, or source-use construction: source wording, source-local meaning, claim-bearing episteme, publication, view, face, carrier, publication unit, EntityOfConcern, grounding relation, pattern-application wording, project-side reliance wording, or the disposition by which source expression has or lacks FPF-governed use.
E.10 governs lexical and wording-use precision. C.2.P governs epistemic precision restoration across episteme, publication, carrier, and view distinctions: expression, source-local meaning, recovered FPF kind and relation set, publication construction, carrier construction, view construction, EntityOfConcern or grounding relation, reader move, and use or non-use disposition.
The practical partition is episteme-slot or publication-construction use, but it is not limited to named C.2.1 slots. It also includes publication constructions, carrier and face constructions, source expression selected for FPF-governed use, and pattern-application wording when those are used as claim-bearing or use-boundary-bearing signs. Apply this pattern from E.10 only when the governing pattern cannot yet be selected directly because source wording, claim-bearing episteme, publication or carrier construction, project-side reliance, pattern-application wording, or use or non-use disposition is still unresolved. The pattern-local decision selects source-expression clarification or FPF-governed use, recovers the current episteme-publication relation set, chooses recovered-by-value, reduced-use-cue, extension-candidate, blocked-use, rewrite-incomplete, or not-triggered disposition, and preserves the remaining reader move before any neighboring pattern governs its own invariant.
Precision-restoration pattern note. A precision-restoration pattern is an architectural pattern for a recurring complex precision problem whose wording routinely hides several current distinctions. A.6.P is relation precision restoration; C.2.P is epistemic precision restoration. C.30.P is the selected architecture and structure precision-restoration pattern when architecture or structure wording hides the architecture claim being made, structure kind, structure relation, view, or publication relation or source-use relation. C.16.P is the selected characteristic and scale precision-restoration pattern when characteristic, scale, metric, score, indicator, coordinate, threshold, or comparison construction is hidden. C.16.Q is the selected quality-term precision-restoration pattern when quality-term or evaluative characterization is current and the found problem is not relation construction. E.10 detects the wording problem and selects the applicable recovery pattern; E.10.ARCH carries the shared recovery algorithm and applicability-row architecture; neither replaces this pattern's episteme, publication, and source-use ontology.
Ordinary-language survival. Ordinary words can stay ordinary until the sentence gives them FPF-kind, relation, authority, evidence, use-boundary, work, gate, decision, bridge, or reliance claim. Source may stay ordinary when it only means where a quote came from; view may stay ordinary when it means what the reader sees and not U.View; route may stay ordinary navigation prose; support may stay ordinary help. Repair by FPF-governed sentence function, not by trigger word alone.
Not this pattern when. C.2.P is not the governing pattern for every recovered construct. General FPF lexical conformance stays under E.10; stable reusable naming under F.18; relation precision under A.6.P; A.6.B law-, use-boundary-, deontic-, and effect-claim boundary splitting under A.6.B; EntityOfConcern, Description episteme, and carrier separation under A.7; view and publication discipline under E.17 and E.17.0; architecture and structural description adequacy under C.30, C.30.ASV, A.22, C.31, or the architecture and structure pattern governing the claim; project work, evidence, gate, decision, method, action-invitation, assurance, and engineering-justification claims under their governing FPF patterns. When one of those claims is current, this pattern supplies source-expression unpacking and rewrite disposition; the FPF pattern named by value supplies its invariant.
Do not punish clarity. Prefer the clearest ordinary head that preserves kind, relation, and declared use boundary. Do not replace a clear plain phrase with a technical phrase unless the technical phrase blocks a currently plausible false interpretation or is needed for accepted stable FPF naming. In an ordinary case, reader help, source-pointer-only, or comparison only may be better than a more technical phrase.
What goes wrong if missed
Episteme-publication-heavy text starts to build a parallel ontology. A generic publication face becomes a U.View, a file becomes an episteme, a dashboard tile becomes evidence, a pattern name becomes a procedure, a slash list becomes a group kind, or a broad word such as source hides whether the text means a pattern, a DRR, a publication, a document named for source, evidence, architecture, or review use, reviewed publication, review packet, review record, or review state, a project-side FPF kind and reference named by value, or a relation.
The immediate cost is not only ugly terminology. Engineers and FPF authors start making action, evidence, gate, decision, or engineering-justification claims from the wrong entity, publication, record, relation, or carrier.
What this buys
C.2.P gives one small epistemic precision-restoration move: recover the FPF kind and relation set first, then write wording that preserves the needed distinction without adding another claim. It prevents string-replacement cleanup, keeps FPF-side and project-side episteme and publication work separate, and blocks unclear wording from having FPF-governed use by guesswork.
Successful repair condition. Epistemic precision restoration is not closed by type-correct wording alone. It is governed by E.2 Pillars, especially P-2 Didactic Primacy, together with E.12 and the register rule in E.10:6.2. It closes only when the repaired text preserves or restores one remaining reader move: a usable action, a recognition reason that tells the working reader why the distinction matters, or a named FPF pattern application that carries the claim being made. When both Tech and Plain registers are current, the Tech interpretation must remain recoverable and any Plain or didactic line must map back to that Tech interpretation. A Plain, more expressive line, or intentional didactic metaphor may stay ordinary when it carries no FPF-governed use; when it carries ontological, evidence, causal, assurance, bridge, gate, work, decision, or use-boundary claim, that claim being made must be recoverable through the Tech fields, FPF kind named by value, recovered relation, project-side source reference, or disposition named by the repair. If a repair in a FPF-governed Problem frame, Problem section, recognition text, example, or worked slice makes the text more precise but less able to show the working situation, why it matters, or what action remains, the repair is incomplete unless the governing FPF pattern is named for that claim being made. Overread removal is only half of epistemic precision restoration; the other half is remaining action guidance under the Pillars.
Recovery focus in plain terms. The use being made is one episteme-publication-heavy wording use inside conformant text: the word or phrase, the sentence function it carries, the FPF kind or relation it must recover, and the remaining declared use boundary after recovery.
Primary working user. The first user is a practitioner maintaining conformant FPF-style or project text: an author, review role, or engineer-manager who must repair wording without losing ontology. The downstream user is the practitioner who will rely on the repaired pattern or project text in a working situation.
Anti-overread payoff question. A repair is useful only if the pattern text can answer three things in ordinary prose: what false downstream interpretation is blocked; what useful action remains under the named FPF pattern; and when the reader must apply the FPF governing pattern named by value because evidence, gate, decision, work, assurance, bridge, release, or reliance is current. If the repair blocks an overclaim but leaves no useful action, the text is probably becoming ceremony rather than guidance.
Problem frame
FPF already has episteme, publication, view, carrier, presentation, relation, naming, and pattern-application concepts. FPF-governed project, review, draft, pattern, and architecture prose, plus source prose being unpacked for possible FPF use, can still introduce convenient intermediate words that survive into final guidance without their kind and relation set recovered.
The recurring situation is simple: a sentence is understandable enough to feel worth keeping, but its head kind is not recovered. If it is repaired by replacing one broad word with another broad word, the ontology gets worse while the text looks cleaner.
Purpose and Scope
This pattern gives the current glossary and rewrite rules for terms around epistemes, publications, views, publication forms, generic publication faces, MVPK faces under E.17 constraints, carriers, records, and bounded publication units.
It exists because episteme-publication-heavy texts can use locally convenient heads that collapse EntityOfConcern, publication unit, publication face, carrier, record, source relation, and project-side value. Those words may be useful recognition handles, but they are not safe FPF heads when they carry ontology, authority, or authority-changing meaning.
The rewrite discipline here is ontological and use-facing, not lexical; in this pattern the repair is bounded to episteme, publication, and source-use precision:
- do not replace one broad token with one new broad token by string substitution;
- first recover the FPF kind and relation set, whether the wording carries a claim, the publication, view, carrier, or relation construction, and any work, action, or authority crossing;
- then choose the smallest wording that preserves the FPF-governed distinction without creating a second ontology.
This pattern uses the E.10 trigger result as its entry condition, then works in the C.2.1 and E.17 epistemic-publication ontology rather than in a lexical registry.
Problem
Without an epistemic precision-restoration discipline for episteme-publication-heavy wording:
- broad publication words hide whether the claim is about
U.Episteme,U.View, publication form, generic publication face, MVPK face under E.17 constraints,PublicationUnit, carrier, document named for source, evidence, architecture, or review use, reviewed publication, review packet, review record, or review state, or project-side FPF kind and reference named by value; - FPF pattern-application claims and project-side work-occurrence, work-plan, decision, action-invitation, method, record, carrier, or front-end claims get mixed in one sentence;
- slash lists and heterogeneous rows become false group kinds;
- unclear source meaning is guessed into FPF-governed wording rather than blocked or assigned to an accepted FPF extension;
- authors copy the same loose wording into
DRRs, patterns, source-use notes, or project texts.
Forces
Solution
Repair episteme-publication-heavy wording by epistemic precision restoration, not by dictionary replacement.
A successful rewrite satisfies these field-validity constraints:
- the head kind and sentence function are recoverable under
E.10; - a stable reusable name has an
F.18naming result; - a relation, comparison, dependency, support, sameness, grounding, mapping, or endpoint claim has
A.6.Prelation precision, with use-boundary and project-side reliance questions split into their own fields; - a claim-bearing episteme, episteme species named by value, episteme-lane view, or project-side FPF kind and reference named by value has the needed
C.2.1typing or named FPF claim or declared-use boundary named by value; - publication, view, face, and carrier distinctions satisfy
E.17.0,E.17, and MVPK; - the repaired text satisfies
E.2Pillars, especiallyP-2 Didactic Primacy, by preserving or restoring one remaining reader move: a usable action, a recognition reason that tells the working reader why the distinction matters, or a named FPF pattern application that carries the claim being made; when both Tech and Plain registers are current, the Plain or didactic line maps back to the recovered Tech kind, relation, or FPF pattern application underE.10:6.2; ordinary Plain wording and intentional didactic metaphor stay light when they carry no FPF-governed use, but ontological, evidence, causal, assurance, bridge, gate, work, decision, or use-boundary claim in a more expressive Plain line must be recoverable through the repaired Tech fields; FPF-governed Problem frames, Problem sections, recognition texts, examples, and worked slices must still show the broad working situation and first useful move, or the rewrite is incomplete; - the final phrase preserves the distinction without adding another claim;
- unrecoverable meaning, kind, register mapping, or remaining reader move fails closed.
The detailed solution below carries the glossary and rewrite rules as ordinary pattern subsections. It is not an external container: these subsections are the pattern's detailed epistemic precision-restoration guidance.
EpistemicPrecisionRestorationRecord
For FPF-governed cases, the recovery product is a compact pattern-local EpistemicPrecisionRestorationRecord or an equivalent local rewrite note. Ordinary local phrase repair may end as the repaired sentence itself when kind, relation, and declared use boundary are now clear and no downstream reliance, cross-context reuse, grouped-kind risk, hidden authority claim, project-side overclaim, conflict among publication, EntityOfConcern, and project-side action claims, or contested source meaning remains current. Prefer the plain names epistemic precision-restoration note, compact epistemic precision-restoration row, or local rewrite note when durable inspection does not require the code-like field name. The recovery note is a lightweight pattern-local authoring or review product, not a new ontology, not a dispatch table, not a durable FPF record kind, and not a mandatory heavyweight project record. It becomes a durable FPF record only if another accepted pattern or accepted DRR explicitly admits it as one. It records only the trigger, the recovered FPF kind and relation set, the requirement from the governing FPF pattern, and the final rewrite disposition that must remain inspectable after the repair.
Minimum fields when FPF-governed:
Recover by sentence function and claim being made, not word form. For words such as source, support, status, valid, ready, approved, and used, first ask what the sentence would let the reader do or rely on: source-finding only, source availability, source use, evidence relation, gate passage, decision status, readiness threshold, work permission, assurance, engineering justification, or ordinary orientation. Then fill only the field whose FPF kind named by value, relation, or project-side reference is current.
Use the short form when only one field is current. Use the full record when several fields are current or when the phrase might otherwise create a grouped kind, hidden authority claim, project-side overclaim, conflict among publication, EntityOfConcern, and project-side action claims, contested source-use meaning, or procedure-like ordering of pattern applications.
General Recovery Check
Use this recovery check whenever text proposes a new term, repairs an episteme-publication-heavy term, asks for language precision, or relies on wording around PublicationUnit, EntityOfConcern, publication, view, face, carrier, source-side relation, source-use target relation, publication face, EntityOfConcern, or bounded publication-unit claim.
-
Mode selection. Decide whether the current use is source-expression clarification over non-FPF prose or FPF-governed use. In source-expression clarification, preserve source-local nuance and do not force the whole source into FPF vocabulary. In FPF-governed use, the wording must satisfy
E.10and the governing patterns named by the recovery. -
E.10 trigger scan and head-kind recovery. Use
E.10:0.2as the shared trigger scan. Decide what the head noun names before accepting the phrase: EntityOfConcern, Description episteme, or Description episteme selected for specification use,U.Episteme,U.View, publication form, generic publication face, MVPK face under E.17 constraints, carrier or rendering, project-side FPF kind and reference named by value,A.15.1datedU.Workoccurrence,A.6.Aaction invitation,A.2.9SpeechActRef,A.2.8U.Commitment,U.Method,U.MethodDescription, document named for source, evidence, architecture, or review use, reviewed publication, review packet, review record, or review state, or source-local ordinary sense. Apply EntityOfConcern and Description-episteme boundary and specification use, Context, Tech, Plain, and carrier humility rules before treating a word as meaning-bearing. -
F.18 naming pass when a stable term is being chosen. If the phrase is becoming a reusable head, fill at least the lightweight Name Card facts: Context, Kind, purpose and use-domain, local sense, candidate head families, NQD-front reasoning, sense-seed read-through, and the lexical Q tuple
{SemanticFidelity, CognitiveErgonomics, MorphologicalActionFit, AliasRisk}. Do not pick a label only because it is intuitive. Do not accept a replacement label until it passes theE.10:0.2replacement-candidate anti-umbrella rule. -
A.6.P relation-precision pass when a phrase carries relation, comparison, or action-invitation claim. Restore generic head kind first, then endpoint facets and kinds, then relation kind, slots, qualifiers, scope, time, viewpoint, and hooks for use-boundary, evidence, and work. For
supportwording, do not stop at a substitute label: select the current support-like claim or relation underA.6.Pfirst, including source-description relation, EntityOfConcern or grounding-holon grounding, base relation throughA.6.6, evidence, assurance, causal-use, mathematical-lens, characteristic or measurement, declared-use-boundary, work or enablement, or publication-companion use. If ambiguity remains, write a local Candidate-Set Note rather than debating synonyms. -
C.2.1 episteme-slot pass when the recovered value is claim-bearing. Name
EntityOfConcern, grounding, ClaimGraph, viewpoint and view, reference scheme, representation scheme, and bounded context as far as the claim needs. Do not usePublicationUnitor a carrier word as a substitute episteme. -
E.17.0, E.17, MVPK publication pass when the recovered value is published or reader-facing. Separate the underlying episteme or view,
U.EpistemePublication, publication form, generic publication face, MVPK face under E.17 constraints,PublicationUnit, carrier or rendering, and the project-side FPF kind and reference named by value when a project-side claim is current. A face, card, screen, or explanation can guide interpretation or source-finding without becoming evidence, work, gate passage, authority, or release permission. If those claims are current, filldeclaredUseBoundaryandprojectSideFPFRefinstead of treating the generic publication face or MVPK face under E.17 constraints as the source value.
5a. Neighboring-pattern selection after source wording and current FPF wording recovery.
If source wording and current FPF wording, publication, carrier, face, or PublicationUnit recovery exposes architecture or structure wording, characteristic or scale wording, quality-term or evaluative characterization, function-like carrier wording, relation construction, controlled coarsening, naming, evidence, assurance, gate, work, decision, causal-use, release, mathematical-lens, or another neighboring claim, fill recoveredClaimGoverningPattern with the pattern governing the recovered claim. Do not keep the neighboring claim inside C.2.P after this pattern has recovered the source wording, current FPF wording, and publication relation set.
-
Remaining reader move. After the kind, relation, publication, and project-side splits are recovered, state the remaining reader move in one short line: what the working reader can now do, why the distinction still matters, or which named FPF pattern governs the claim being made. If both Tech and Plain registers are current, keep the Tech interpretation recoverable and make the Plain or didactic line map back to the recovered Tech kind, relation, or named FPF pattern application under
E.10:6.2. Do not make this a heavy form for ordinary prose: a Plain line that carries no FPF-governed use may stay ordinary; a Plain line that carries ontological, evidence, causal, assurance, bridge, gate, work, decision, or use-boundary claim must be recoverable through the repaired Tech fields. If the repaired wording only proves that an overclaim was removed, but leaves no usable action, recognition reason, or FPF pattern application for the claim being made, do not classify the repair as recovered by value. -
Authority-changing rewrite boundary. If the result would rename an accepted FPF pattern, change an accepted FPF term, or mint a reusable FPF kind, this pattern only classifies the phrase as recovered by value or as an understandable FPF extension candidate. It does not make the authority change by itself. Use the accepted source that already carries the decision by value; do not add a second decision source merely to restate the same content.
Fail closed:
- if the kind and relation set cannot be recovered, keep the term as plain or informative prose;
- if the relation kind cannot be recovered, keep the statement as a cue or split alternatives;
- if the publication construction cannot be recovered, do not use that publication, generic publication face, MVPK face under E.17 constraints, form, carrier, or rendered unit for work, evidence, gate, or authority claims;
- fill
relationClaimSliceonly when a relation claim is current, and filldeclaredUseBoundaryplusprojectSideFPFRefwhen an use-boundary or project-side reliance claim is current; - if the recovered wording is type-correct but leaves no remaining reader move, recognition reason, Tech-to-Plain mapping when both registers are current, or FPF pattern application, or if a Plain or didactic line supplies practical guidance through unrecovered ontological, evidence, causal, assurance, bridge, gate, work, decision, or use-boundary claim, mark the rewrite incomplete or demote the phrase to reduced-use cue or blocked use before using it as claim-bearing FPF or project text.
Slash Discipline
In conventional abbreviations, source titles, mathematical notations, standards, URLs, file paths, and ordinary notations, a slash can be part of an accepted designation rather than a hidden FPF kind. In FPF-facing episteme and publication ontology, a slash is still a recovery trigger before it is a synonym marker unless the mark is part of such accepted notation, carrier syntax, or conventional designation.
Before leaving a slash expression in current prose, classify the expression as one of these cases:
- accepted notation or conventional designation: a standard name, source name, discipline abbreviation, established compound name, formula, ratio, fraction, unit, path-like quoted source token, title, product name, file path, URL, or quoted source wording where the slash is part of the accepted designation or carrier syntax; keep
ISO/IEC,ISO/IEC/IEEE,1/2, URLs, conventional abbreviations, and similar forms when the sentence uses them as notation; - a plain-language synonym pair with no ontology, authority, evidence, or use-boundary claim;
- a lazy
and/or-style join that must be split or recovered before FPF-governed use; - a composite-kind candidate that needs
F.18andA.6.Precovery; - a relation claim that needs a
RelationKind, aQualifiedRelationRecord, or a multi-term relation phrase with typed endpoints, slots, qualifiers, scope, time, and viewpoint; - a tuple-like record that needs a named record kind and named slot semantics;
- a failed ontology signal where the sentence lists unlike values because the FPF kind under repair, relation record, relation phrase, tuple-like record, alternative-case disposition, or not-triggered disposition has not yet been recovered.
If the expression is not one of the safe notation, conventional-designation, carrier-syntax, quoted-source, or plain-language cases, do not keep the slash as final wording. Do not repair it by replacing the slash with one equally vague grouped word. Write the recovered FPF kind, relation record, relation phrase, tuple-like record, alternative-case disposition, or not-triggered disposition by value.
Unclear Source Meaning and FPF Extension Candidates
Sometimes the problem is not a bad word but one of two different cases:
- the intended claim cannot be determined from the surrounding source, current
FPFkinds, or current FPF episteme and publication ontology; - the claim is understandable, but current
FPFdoes not yet contain the kind, pattern, relation record, or method guidance needed to carry it.
Do not merge those cases.
An unclear claim is not current architecture truth merely because deleting it feels risky, and it must not be rewritten by guessing a likely author intention.
An understandable uncovered claim may be retained as a candidate FPF extension only when the problem situation, tempting overread, rejected current uses, current FPF gap, and the first user action that would improve are stated by value.
Classify the case explicitly:
- recovered by value: the text now names the current
U.Episteme, selectedEntityOfConcern,U.View, publication form, generic publication face, MVPK face under E.17 constraints,PublicationUnit, carrier relation, relation record, relation phrase, tuple-like record, FPF pattern, document named for source, evidence, architecture, or review use, reviewed publication, review packet, review record, or review state, project-side FPF kind and reference named by value whenprojectSideFPFRefis current. The selected value is one current value, not the list:C.11ChoiceResult;C.11decision record;A.6.Aaction invitation;A.15U.WorkPlan;A.15.1datedU.Workoccurrence;U.Method;U.MethodDescription;A.20constraint or adjudication decision record;A.21GateDecision;A.21DecisionLogRef;A.10evidence path; typed evidence record;B.3assurance or engineering-justification record; typed status record whose FPF status pattern is named; carrier relation; front-end relation; or not-triggered alternative; - understandable FPF extension candidate: the thought is clear enough to state as a candidate new or amended FPF kind, pattern, relation record, method guidance, accepted
DRRcontent decision, or campaign-scoped content question, but it does not carry current authority, evidence, or use-boundary claim until an accepted architecture decision, acceptedDRR, or accepted FPF pattern supplies that authority; - source wording without FPF-governed use: the phrase has no current authority, evidence, or use-boundary claim;
- reduced-use cue: the phrase is kept only as a recognition cue or anti-case, not as a claim-bearing architecture decision;
- blocked use: the phrase is blocked for claim-bearing architecture, pattern, or project text while the needed meaning, kind, or relation is missing.
- rewrite incomplete: the repaired wording may be kind-correct, but it does not yet state a remaining reader move, recognition reason, Tech-to-Plain mapping when both registers are current, or FPF pattern application, or a Plain or didactic line carries ontological, evidence, causal, assurance, bridge, gate, work, decision, or use-boundary claim that cannot be recovered from the Tech interpretation; continue repair or demote to a non-use disposition before the text has FPF-governed use.
These dispositions are recovery results, not a meta-governance authority over all of FPF.
When recovery names another FPF kind named by value, that FPF pattern governs that kind, its declared use boundary, and its conformance checks.
C.2.P may identify that A.10, A.15, A.15.4, A.20, A.21, B.3, C.11, F.9, E.17.EFP, E.17.ID.CR, or another governing FPF pattern is current.
It does not govern the recovered kind after that identification.
C.2.P only makes the kind under repair, relation, and use boundary explicit enough that the right governing pattern can be applied.
No other disposition is closed. In particular, "seems to mean", "probably about", a cleaner paraphrase, or a broad umbrella replacement is not a successful recovery.
Core Glossary
Cross-Side Fields That Must Stay Split
These fields are current episteme-publication precision vocabulary for DRR, architecture, and pattern-drafting work.
They exist to prevent one sentence from mixing FPF-side use-boundary, project-side records, actual work or action, method selection, carrier access, and authority records.
They are local recovery aids, not FPF kinds, not record kinds, and not a universal record ontology.
Each field closes only by naming the FPF kind named by value, relation record, relation phrase, project-side FPF kind and reference named by value, or explicit non-use disposition that is current in the sentence.
The same local-aid rule applies to neighboring field names such as sourceRelationClass, explanationSourceRelationClass, comparativeRelationClass, representationValidityUseBoundaryValue, allowedUse, misuseRisk, and worldContactPolicy: they help record a local recovery or reader-use boundary, but they do not become kinds. These local fields do not instantiate evidence, gate, assurance, work, commitment, speech act, decision, release, authority, representation kind, world-contact kind, or policy kind. Read allowedUse as a local reader-fit field under declaredUseBoundary, not as permission, evidence relation, or authority.
Episteme, Publication, and Carrier Distinctions
Trigger Boundary
Lexical trigger scanning and direct known governing-pattern selection are governed by E.10:0.2, E.10:0.2a, E.10:0.2b, E.10:0.2c, and E.10:0.2d.
This pattern is applicable after that scan only when the governing pattern cannot yet be selected directly because the sentence still confuses source wording, claim-bearing episteme, publication or carrier construction, project-side reliance, pattern-application wording, or use or non-use disposition.
When this pattern is applicable, do not restart from word taste. Keep the E.10 trigger result as input and recover source-expression clarification, FPF-governed use, current episteme-publication relation set, use disposition, and remaining reader move.
Current Preferred Vocabulary
Use PublicationUnit when the intended entity is a bounded, human-inspected unit inside a publication.
Do not use it for UI behavior, carrier behavior, front-end behavior, file identity, dashboard behavior, or export behavior; use A.7, carrier wording, front-end wording, or the FPF governing pattern named by value instead.
Use the current cluster names directly: PublicationUnit Stability Discipline, Local Head Restoration, and PublicationUnit Primary EntityOfConcern Discipline.
When the current entity is a bounded unit inside a publication, use PublicationUnit; when the current entity is authoring or editing work, name that work directly.
Use EntityOfConcern, EntityOfConcernRef, and publicationUnitPrimaryEntityOfConcern when local wording means the EntityOfConcern named by a claim-bearing episteme or episteme-lane view, or the primary entity of concern stabilized by one bounded publication unit over that carried value.
For describedEntity, DescribedEntityRef, primary described entity, EntityOfInterest, or EoIClass, use EntityOfConcernSlot, entityOfConcernRef, EntityOfConcernRef, EntityOfConcernChangeMode, EntityOfConcernClass, publicationUnitPrimaryEntityOfConcern, or the local FPF kind named by value. If no claim-bearing episteme or episteme-lane view is current, use a non-claim-bearing kind named by value or plain topic or subject instead of inventing an EntityOfConcernRef.
Use ordinary topic, subject, or local referent only in non-normative explanatory prose where no episteme slot, publication construction, or authority relation is being asserted.
Do not mint any other new reusable FPF name from this pattern alone. PublicationUnit is governed by the E.17.AUD cluster named PublicationUnit Stability Discipline; this pattern recovers bounded-publication-unit wording into that head when the entity is current and points to that cluster for governance. FPF-governed uses keep the nearby definition or explicit publication relation set.
F.18 And A.6.P Naming And Relation Interpretation For PublicationUnit
This is the F.18 and A.6.P name interpretation that this pattern reflects from the selected E.17.AUD cluster correction.
It records why PublicationUnit is the selected bounded publication-unit head for the E.17.AUD cluster, while C.2.P remains the epistemic precision-restoration pattern.
Epistemic Precision Restoration After E.10
Lexical trigger rewrite rules are governed by E.10:0.2b, E.10:0.2c, and E.10:0.2d.
Use this pattern after those rules only when one of these remains unresolved:
- source-expression clarification versus FPF-governed use;
- source-local meaning versus current FPF wording;
- claim-bearing episteme versus publication, view, face, carrier, or publication unit;
- EntityOfConcern, grounding relation, or source cue versus project-side evidence, work, gate, decision, assurance, method, action, release, or engineering justification;
- declarative FPF pattern application versus project work or control flow;
- use disposition: recovered by value, reduced-use cue, understandable FPF extension candidate, blocked use, rewrite incomplete, or not triggered;
- remaining reader move or Tech-to-Plain mapping after epistemic precision repair.
When none of these remains unresolved, apply the governing pattern selected by E.10 directly.
Rewrite Execution Modes
Use the smallest sufficient mode that preserves the distinction. The template is an epistemic precision device, not a form to fill for every ordinary wording cleanup.
Local prose cleanup
Use this mode when the phrase under repair is non-normative local prose and does not carry ontology, authority, review scope, release state, use-boundary, or a reusable name.
Action: rewrite directly or leave it unchanged. No table row is required.
Compact epistemic precision-restoration row
Use a compact row for ordinary architecture and source-use or review-use document cleanup where a sufficient FPF kind, relation record, relation phrase, or tuple-like record can be recovered without minting a new FPF head.
Full epistemic precision-restoration check
Use the full check when the wording may change ontology, introduce or retire a reusable head, change a claim-bearing pattern or document named for source, evidence, architecture, or review use, reviewed publication, review packet, review record, or review state, or resolve a contested source-meaning problem.
Epistemic Precision-Restoration Note
Use an epistemic precision-restoration note only when wording carries ontology, authority, evidence, or use-boundary claim. The note records the original phrase, recovered FPF kind or relation, reference named by value when current, project-side FPF kind and reference when current, remaining reader move, and disposition: recovered by value, extension candidate, reduced-use cue, blocked use, rewrite incomplete, or not triggered.
Ordinary Completion and Reopen Boundary
A C.2.P application is complete for ordinary pattern-authoring use when the smallest sufficient product is present:
E.10trigger result is kept as input and the text does not restart from word taste;- the wording is either left ordinary, repaired locally, expressed as a compact epistemic precision-restoration row, or escalated to the full check because the claim being made requires it;
- the recovered episteme, publication, view, face, carrier, publication unit, EntityOfConcern, grounding relation, project-side reference, or use disposition is named by value;
- every relation-like slice that remains current is assigned to
A.6.Por its retained specialization, rather than being hidden inside this pattern; - the remaining reader move survives in ordinary prose or the wording is explicitly demoted to reduced-use cue, blocked use, rewrite incomplete, or not triggered.
Use the lowest sufficient product. A clean sentence is enough when one sentence recovers the claim being made. Use a compact row when the reader must inspect one recovered kind, relation, or disposition later. Use the full check only when several fields are current, when source wording's FPF use is contested, when a durable name may be minted, or when a publication, carrier, or project-side overread would otherwise survive.
This pattern can be applied to its own wording at the same lowest sufficient mode. If C.2.P text itself blurs a source expression, publication construction, pattern application, relation slice, or project-side reliance claim, repair that local wording here; do not create a recursive pattern-quality apparatus.
Reopen or lower a prior C.2.P repair when one of these content discoveries appears:
- the replacement head is another umbrella word such as
support,surface,route,kind,object,record,map, ormappingwithout FPF kind named by value and boundary; - the repaired wording is type-correct but no longer tells the working reader what action, non-use, or neighboring-pattern application remains;
- a neighboring pattern is now the true governing pattern for the current evidence, assurance, gate, work, decision, publication, architecture, structure, relation, or naming claim;
- an entry cue, ToC row, summary, dashboard, retrieval snippet, or source-use note preserves the pre-repair broad interpretation after the pattern body was repaired;
- repeated use shows that authors are filling the full check where a local sentence or compact row would suffice.
The ordinary stop condition is local: once the current sentence or bounded publication unit preserves kind, relation, use disposition, and remaining reader move, stop. Do not keep improving wording merely because a more elaborate record could be filled.
Archetypal Grounding
Boundary and Anti-Cases
Transfer Coverage
C.2.P is intentionally narrow but must transfer across three recurrent publication situations:
- FPF-side drafting: pattern text, DRR text, source-use notes, review-use notes, and pattern draft prose;
- project-side publication: dashboards, explanations, cards, documents, front-ends, rendered files, and generated summaries used around evidence, work, gates, decisions, assurance, or methods;
- external source-use clarification: seminar fragments, papers, reviews, standards, and tool outputs being clarified before possible FPF use.
In all three situations the same invariant holds: recover the distinction between source wording and current FPF wording, claim-bearing episteme, publication or carrier construction, relation-like slice, neighboring pattern governing that claim, and remaining reader move before accepting the wording as current FPF text.
Bias-Annotation
Conformance Checklist
Current Scan Boundary
Lexical trigger scanning is governed by E.10:0.2, E.10:0.2a, E.10:0.2b, E.10:0.2c, and E.10:0.2d.
C.2.P conformance begins only when the E.10 result is epistemic precision restoration required or combined precision restoration required, or when non-FPF source text is being unpacked before possible FPF transfer.
Do not copy the E.10 trigger list into this pattern as a second registry. Use the E.10 result as input and recover source-expression unpacking mode, FPF-governed use mode, current episteme-publication relation set, use disposition, and remaining reader move. When the relation-bearing slice is current, A.6.P remains a separate required precision-restoration pattern.
Common Anti-Patterns and How to Avoid Them
Consequences
Operating Consequence
For new episteme-publication precision prose:
- start from FPF kinds and relations, not from familiar publication nouns and document nouns;
- use
PublicationUnitfor bounded publication units; - use
EntityOfConcernandEntityOfConcernRefwhen the episteme slot is current, and translatedescribedEntitysource wording to the adopted EntityOfConcern family before FPF-governed use closure; - keep publication form, generic publication face, MVPK face under E.17 constraints, view, carrier, document named for source, evidence, architecture, or review use, reviewed publication, review packet, review record, or review state, and project-side FPF kind and reference named by value separate;
- name
relationClaimSlice,declaredUseBoundary, andprojectSideFPFRefseparately when more than one is current; - classify heterogeneous kind lists before writing a sentence that depends on them;
- say that FPF patterns are applied in problem situations, not called or routed as procedures;
- leave accepted FPF names untouched unless a separate accepted naming decision authorizes a rename.
Operationally, each rewrite should:
- separate FPF-side episteme and publication context from project-side episteme and publication context whenever both are present;
- name
relationClaimSlice,declaredUseBoundary, andprojectSideFPFRefseparately when a publication, display, cue, or explanation is treated as evidence, gate, constraint, adjudication, decision-making reliance, work permission, assurance, or engineering justification; - classify heterogeneous lists before naming them: one kind under repair, relation set, tuple-like record, alternative cases, not-triggered alternatives, or failed ontology;
- say that FPF patterns are applied in problem situations, while project records, publications, views, carriers, and actions are worked with in project practice;
- avoid strength metaphors unless the characteristic, scale, threshold, evidence class, or use-boundary relation is named.
For cleanup of existing conformant texts:
- do not do a global string replacement;
- classify each unclear term occurrence by the smallest sufficient rewrite mode;
- use the full epistemic precision-restoration check only when ontology, reusable naming, FPF pattern text, or source-bearing project text is current;
- do not rename accepted FPF patterns from this pattern alone.
Rationale
FPF already contains the relevant ontology. The recurring defect was not lack of concepts but ad hoc wording that bypassed them: source, target, surface, object, host, route, supported use, and similar trigger terms packed several FPF kinds and relations into one convenient phrase; they are examples of wording to unpack, not current replacement vocabulary.
The correct repair is therefore not a new umbrella. It is a disciplined recovery action: use E.2, E.10, F.18, A.6.P, A.7, C.2.1, E.17.0, E.17, and MVPK together until the sentence says which EntityOfConcern, relation, publication, view, carrier, record, work, action, or pattern application it means.
Because E.2 governs all normative FPF patterns, epistemic precision is not a value apart from P-2 Didactic Primacy. An epistemic precision restoration may be stricter than the original wording, but if it turns FPF-governed reader-facing problem text into a kind inventory with no working situation or first useful move, it has not landed the FPF repair. The remedy is not expressive license and not metaphor removal; the remedy is recognition wording with declared-use boundary whose claim being made remains recoverable through the Tech interpretation or a named FPF pattern application.
The detailed rules remain in ordinary pattern sections, so the pattern is usable as FPF guidance rather than as an external glossary container.
SoTA-Echoing
C.2.P does not claim to replace semiotics, terminology science, document engineering, or ontology engineering. Its claim being made is narrower: episteme-publication-heavy conformant text must recover accepted FPF kinds and relations before it is rewritten, so that episteme, publication, view, carrier, naming, relation, and project-side records are not replaced by ad hoc words.
Full external SoTA comparison is therefore not the governing evidence mode for this architectural precision-restoration pattern. A reduced external practice set is still required because the pattern governs terminology drift and epistemic precision restoration. The reduced set is selected only for the recovery discipline; it does not create a new ontology and does not outrank the FPF patterns named below.
In this section, SoTA-Echoing means compatibility with current FPF ontology and selected external practice anchors, not a claim that those external anchors are sufficient SoTA for every field they come from. ISO terminology entries are current standards anchors for designation practice; SHACL-style validation is only a fail-closed constraint analogy; word-sense and ambiguity-resolution practice is used only for context-sensitive sense recovery. If one of those domains becomes the governed object of a future claim, its own current SoTA pattern or source review must govern that claim.
External-practice boundary. External traditions enter only through the local FPF invariant named by value they sharpen. Object-oriented modeling and OWL-style ontology modeling do not become the default repair for vague FPF wording. Architecture-description standards help keep views, viewpoints, concerns, and descriptions explicit. Explainability and NLP faithfulness work helps prevent explanation laundering. RAG evaluation helps separate retrieval evidence, source availability, and answer trust. Quality-diversity and multi-objective search help avoid premature scalarization in candidate selection. None of these traditions becomes FPF ontology, FPF authority, or a universal pattern-quality benchmark.
Internal FPF Governing Patterns
The current FPF corpus already has explicit governing patterns for this discipline:
E.10supplies the head-kind, term, morphology, register, and forbidden-umbrella discipline.E.10.D2gives the "thing vs words vs rules" discipline and the carrier humility rule.F.18gives the local-first naming protocol: Context, Kind, purpose and use-domain, local sense, candidate head families, NQD-front, semantic read-through, and lexical Q components before one label becomes a reusable head.A.6.Pgives the relation-precision restoration method: restore generic head kind, build candidate sets for endpoint kinds and relation kinds, select kind-explicit slots and qualifiers, then allow guardrailed wording.C.2.1gives the episteme slot relation and selectedEntityOfConcerndiscipline.A.7keeps EntityOfConcern, Description episteme, and publication carrier distinct.E.17.0,E.17distinguish views, viewpoints, MVPK faces, publication forms, and publication projections.A.15.4is a good current pattern example of keeping encountered publication, display, or cue items distinct from the project-side FPF kind and reference named by value that governs work or reliance use.A.16,A.16.0,A.19,B.2.5,C.27, andA.3.3provide the movement, control, and temporal machinery used when episteme-publication prose talks about route, trajectory, movement, cadence, or dynamics.E.19already treats terminology and sentence-level precision restoration as required review checks, not editorial polish.A.6.Acarries action-invitation discipline when a publication, representation, or cue invites an action without itself becoming authority, evidence, gate passage, or work completion.C.11carries decision-making and decision-record discipline when the question under repair is a decision rather than generic action.A.15andA.15.4split role, method, work-plan, and actual-work alignment from work-relevant source restoration, so episteme-publication prose must not letA.15become a universal episteme-publication governing pattern.E.9is the campaignDRRpattern for campaign-level content decisions;E.11is only for entry-discoverability situations and must not organize an episteme and publication repair by default.
The internal FPF governing patterns remain primary:
This reduced external-practice set changes the Solution in one practical way: an epistemic precision restoration cannot close merely because the replacement wording sounds cleaner. It closes only when the FPF kind, relation, declared use boundary, and any governing-pattern application is recoverable by value; otherwise the wording is blocked or becomes a candidate for a separate FPF-kind decision.
E.19 Review Profile Carry-Through
Run PCP-TERM when the repair changes episteme-publication-heavy naming, umbrella words, slash compounds, trigger-word replacements, or relation wording.
Run PCP-BRIDGE when the repair imports terms, claims, norms, or authority expectations across contexts, disciplines, reference schemes, publication forms, or project record kinds.
Run PCP-ENTRY only when the repair changes which FPF pattern a working reader should apply in a problem situation. Do not use PCP-ENTRY as a substitute for the epistemic precision restoration itself.
Run PCP-PRAG when the repair changes reader action, practical payoff, or what the working reader can safely do next. A type-correct but inert repair fails this line even when every recovered kind is technically right.
When the repair changes evidence, proof, witness, grounding, explanation, gate, release, or engineering-justification claims, apply the governing FPF pattern for that claim (A.10, E.17.EFP, A.20, A.21, B.3, or another governing pattern when current) and select the current E.19 profile by the changed pattern claim. Do not mint a local evidence-review profile inside C.2.P.
Relations
- Builds on:
E.2Pillars, especiallyP-2 Didactic Primacy;E.10,E.10.ARCH,A.7,F.18,A.6.P,C.2.1,E.17.0,E.17, MVPK, andA.6.A. - Coordinates with:
E.6,E.7,E.8,E.9,E.12,E.19,A.10,A.15,A.15.4,B.3,A.20,A.21,A.6.F,A.6.3.CSC,A.6.3.CR,A.6.3.RT,C.30.P,C.16.P,C.16.Q,E.17.EFP, andE.17.ID.CR. - Does not replace:
E.10general lexical rules,F.18naming protocol,A.6.Prelation precision, or local episteme and publication patterns. It says when those patterns must be applied to episteme-publication-heavy wording.
C.2.P:End
Reliability R in the F–G–R triad
Reliability (R) is a conservative, evidence-bound warrant signal for a typed claim under an explicit claim scope (G). Cross-context reuse is Bridge-only: scope may be re-expressed via
translate(Bridge,·)(often narrowing), while congruence penalties route to R only.
Type: Architectural (A) Status: Stable
Problem frame
KD‑CAL asks a simple operational question: “Where can I safely use this claim?” FPF answers with a minimal “epistemic location” built from three coordinates and one bridge qualifier:
- F (Formality) describes how the claim is expressed and how strongly it supports verification workflows (C.2.3).
- G (Claim scope) describes where the claim is asserted to apply as a set-like object (A.2.6).
- R (Reliability) describes how strongly the claim is warranted by linked evidence under that scope.
- CL / CL^k / CL^plane (Congruence Levels) describe lossy transport when claims are reused across contexts, kinds, or planes (B.3, C.3). CL values live on edges/bridges (not on the claim as a “4th coordinate”).
In practice, the triad is frequently used before it is made explicit:
- Authors implicitly “average” disparate evidence and report a single confidence.
- Teams treat higher formality (F) as if it automatically implies higher warrant (R).
- Scope growth is smuggled in through phrasing instead of explicit scope operators (A.2.6).
- Cross-context reuse occurs without explicit bridges and without routing congruence loss into R.
This pattern makes R explicit in KD‑CAL and fixes the triad discipline required by Kind‑CAL (C.3) and the Trust & Assurance calculus (B.3).
Problem
FPF needs a reliability coordinate that is:
- Auditable. A reader can trace R to concrete evidence and see how reuse penalties were applied.
- Composable. R can be propagated through claim graphs conservatively, without illegal scale arithmetic.
- Orthogonal. R is not conflated with F (expression) or G (scope).
- Bridge-safe. Any loss from transport across contexts/kinds/planes is explicit and affects R only.
- Minimal. The solution does not introduce new core types or new face-kinds.
Forces
Solution
Canonical triad relation
Definition DEF‑C2.2‑1 (Epistemic location).
An epistemic location for a claim c is the tuple:
Loc(c | K, S) = ⟨F(c), G(c), R_eff(c)⟩
where:
F(c)is Formality (C.2.3), treated as an ordinal.G(c)is Claim scope (A.2.6), treated as a set-like scope object.R_eff(c)is Effective reliability forc, treated as a ratio-scale scalar in[0,1](or an ordinal proxy at [M‑0/M‑1]; see §4.5.A).R_effis computed pathwise (DEF‑C2.2‑3): when more than one admissible justification path exists, publish multiple path records (PathId rows) and cite which PathId(s) a guard/decision consumed (see §4.8.A / G.6). Any collapse to a single scalar is an explicitly declared Γ‑policy (no implicit averaging).
A location is always understood relative to a bounded context and the assurance carriers used elsewhere in FPF:
Kis the declaredU.BoundedContext.S ∈ {design, run}is the claim’s stance carrier (no DesignRunTag chimeras).ReferencePlaneis declared where applicable; plane crossings applyCL^planeand penalize R only.- When the claim is published on the Working‑Model surface, the author also declares
validationMode ∈ {postulate, inferential, axiomatic}(E.14 / B.3).
Mode-to-lane hint (informative). validationMode sets the default expectation for which assurance lane carries the initial support load (B.3.3 or B.3.5).
It does not add a new characteristic and does not change the meaning of R:
axiomatic→ VA-dominant (constructive grounding or proof carriers); ifReferencePlane=world, LA may still be required.inferential→ VA+TA-dominant (reasoned chain + typing/alignment assurance); LA is optional and scope-bound.postulate→ LA-dominant (empirical validation with freshness/decay); VA is optional. In all modes, R remains warrant, not ontological truth; “proof ⇒ R=1 in the world” is a category error.
Profile note (informative; fold compatibility). Some profiles treat empirical R as N/A for strictly axiomatic lines and use a tagged proxy R_proxy := F (line=formal) for folding, as an explicit proxy rather than an implicit “F⇒R” rule (B.1.3).
⟨F,G,R⟩ is an assurance tuple, not a U.CharacteristicSpace; do not draw “trajectories” in ⟨F,G,R⟩.
What Reliability R means in KD‑CAL
Definition DEF‑C2.2‑2 (Reliability as warrant).
R is a conservative, evidence-bound indicator of how strongly the claim “holds as stated” under its declared scope and context. It is interpreted as a warrant strength, not as truth.
Prophylactic clarification.
- A higher
Rmeans “the evidence and its relevance supports relying on this claim under this scope.” - A higher
Fmeans “the claim’s form is amenable to higher-formality checking and wider reuse,” but does not itself imply the claim is warranted. - A larger
Gmeans “the claim applies to more cases,” but does not itself imply the claim is warranted in those cases.
Pathwise weakest-link propagation (series vs parallel)
KD‑CAL’s default Γ‑fold is weakest‑link on the entailment spine (the premises/lemmas actually needed), computed per justification path. It is conservative, monotone, and auditable.
Definition DEF‑C2.2‑3 (Pathwise weakest-link fold).
Let P be a justification path for claim c. Let SpineClaims(P) be the required supports on the entailment spine, and let SpineBridges(P) be the bridges actually traversed on that spine (scope bridges, kind bridges, plane/notation transports where applicable).
Define the raw warrant of the path as:
R_raw(P) = min_{i ∈ SpineClaims(P)} R_eff(i)
and compute the effective warrant of the path by applying congruence penalties (see §4.5 for policy shape):
R_eff(P) = Π(R_raw(P); Φ(CL_min(P)), Ψ(CL^k_min(P)), Φ_plane(CL^plane_min(P)))
Spine discipline. The min is taken over the entailment spine only (no satellites, no “nice-to-have” citations).
This matches the KD‑CAL propagation rule (C.2:4.3) and the Trust & Assurance skeleton (B.3): weakest-link on the spine, penalize only by the worst (lowest) congruence encountered on the path (no averaging).
Parallel support (optional, declared).
If the same claim c has multiple independent justification paths {P_j} (OR‑style support), the default is:
R_eff(c) = max_j R_eff(P_j)
Independence is recorded as an explicit note (e.g., separate rigs/datasets/proof lines), per CC‑C.2.2‑10 and the KD‑CAL composition rule (C.2:4.3).
If the “multiple paths” actually cover different scope slices, do not use max to hide weaker slices; instead publish distinct G_path (SpanUnion‑style coverage) and keep per‑path R_eff traceable (A.2.6 / C.2:4.3).
Conflict detection (no averaging).
If the evidence graph supports both p and ¬p with overlapping scope, do not average. Separate by context/scope, or mark the claim provisional with explicit conflict edges until resolved.
Congruence penalties route to R only (no silent widening)
Cross-context reuse and cross-kind reuse are treated as transport with loss, and loss is expressed as a penalty that reduces R.
Invariant INV‑C2.2‑1 (R-only penalty routing).
For any transport step that uses a bridge with a declared congruence level, the transported claim preserves its F value, re-expresses its scope via an explicit scope translation (translate) when needed, and only its R value is decreased by congruence penalties:
F_out = F_in
G_out = translate(Bridge, G_in) (identity only for within-context identity use; cross-context use is undefined without a Bridge)
R_out ≤ R_in
Claim scope may be re-expressed by an explicit translation, but must not be silently widened:
G_out = translate(Bridge, G_in) (may narrow / drop unmappable slices; never widen without an explicit ΔG)
No implicit translation. Translation between contexts never occurs implicitly: if the target context differs, an explicit Bridge (with declared CL and loss note) is mandatory; otherwise the reuse is non-conformant.
No implicit translation. Cross‑Context reuse is conformant only via an explicit Bridge (declared CL + loss note) and an explicit translate(Bridge,·); see CC‑C.2.2‑4.
This invariant is why KD‑CAL guard macros and crossing bundles can be simple: transport never silently widens a claim; it either (i) translates/narrows scope explicitly, and/or (ii) reduces warrant.
translate is the USM operator (A.2.6). It may drop unmappable slices and may include refit-like normalization; this is not a penalty. Any further narrowing is an explicit Δ‑move (ΔG−) under A.2.6. Congruence loss (CL/CL^k/CL^plane) still routes to R only.
Notation/plane transports. NotationBridge and plane transports contribute to the relevant CL*_min(P) bottlenecks for the path; they do not “lower F” by penalty. If an author actually rewrites a claim into a different formality level, that is a new episteme (ΔF), not “transport”.
Worked micro-example: translate(G) + penalty (A.2.6:12.2)
Source context: MaterialsLab@2026. Claim:
c:“Adhesive X retains ≥85% tensile strength on Al6061 for 2 h at 120–150 °C.”
G_src := {substrate=Al6061, temp∈[120,150]°C, dwell≤2h, Γ_time=window(1y), rig=Calib‑v3}Loc_src(c) = ⟨F_src, G_src, R_raw⟩
Target context: AssemblyFloor@EU‑PLANT‑B. Reuse requires a declared Bridge b:
- Bridge
Bridge#MatLab_to_PlantBmaps lab rig → plant rig and introduces a measurement correction;CL(Bridge#MatLab_to_PlantB)=2with loss note “±2 °C bias.” - Scope translation:
G_tgt := translate(b, G_src)which (in this case) narrows the temperature span to[122,148]°Cdue to the correction. - Penalty routing: using policy
Φ=Φ_v1, computeR_eff := max(0, R_src − Φ_v1(CL(Bridge#MatLab_to_PlantB))).
Key point: G changed only because translate(b,·) explicitly re-expressed the same entitlement in the target Context’s slice vocabulary; the congruence loss still affects R only. If authors decide that only [125,145]°C is safe to claim on the floor, that is an explicit ΔG− decision (scope edit), not a congruence penalty.
Effective reliability under transport (policy-defined, monotone, bounded)
When a claim is reused via bridges, R_eff is computed by applying penalties determined by congruence levels.
Definition DEF‑C2.2‑4 (Effective reliability under transport). Let:
CLbe the congruence level of a scope bridge (B.3).CL^kbe the congruence level of a kind bridge (C.3).CL^planebe the congruence level of a plane transport bridge (B.3 / plane patterns).
Let Φ, Ψ, and Φ_plane be policy-defined, monotone, bounded, table-backed penalty policies applied on the relevant edges:
Φ(CL)— scope/context Bridge penalty (CL).Ψ(CL^k)— KindBridge penalty (CL^k) when kinds are mapped.Φ_plane(CL^plane)— plane-crossing penalty whenReferencePlanediffers.
Important (direction of monotonicity). Congruence ladders are “polarity up” (higher CL = better fit). Per CC‑G0‑Φ and the Trust & Assurance skeleton, penalty tables are monotone decreasing in their CL ladders (if CL1 < CL2 then Φ(CL1) ≥ Φ(CL2), analogously for Ψ and Φ_plane) and bounded so that R_eff remains within [0,1] after clipping. Penalty magnitudes are not required to lie in [0,1] (tables may exceed 1 to force R_eff → 0 under the subtractive default); what matters is monotonicity, boundedness, and published policy identifiers.
Define:
R_eff(P) = clip_0^1( Π(R_raw(P); Φ(CL_min(P)), Ψ(CL^k_min(P)), Φ_plane(CL^plane_min(P))) )
where each *_min(P) is the lowest congruence level encountered on the entailment spine of P for that dimension (a bottleneck; no averages), and clip_0^1(x) truncates to [0,1].
Default (safe) instantiation (subtractive). When policies are expressed as subtractive penalties, a safe default is:
R_eff(P) = max(0, R_raw(P) − Φ(CL_min(P)) − Ψ(CL^k_min(P)) − Φ_plane(CL^plane_min(P)) )
This generalises the B.3 skeleton to multiple congruence ladders (scope vs kind vs plane) without introducing new penalty characteristics. If a dimension is not present on the path, its penalty term is treated as neutral (0 in the subtractive default).
Provisional marking.
Default admissibility thresholds for reuse are set by Bridge calibration profiles (e.g., G.7). Typically, CL=1 requires an explicit waiver to proceed and CL=0 is inadmissible; this pattern only specifies that such thresholds gate transport before any numeric penalty is meaningful.
Math-by-level gating (B.1.3:4.3)
- [M‑0/M‑1] allow ordinal comparisons only (no arithmetic on
R_eff); Φ/Ψ/Φ_plane may be qualitative (“low/med/high”). Publish evidence links + lane tags. - [M‑2/L1] numeric
R_effrequires referencing numeric, table-backed policy identifiers for Φ/Ψ/Φ_plane (and Π if not default), plus reproducibility tags for empirical legs; otherwise treat the claim as [M‑1] semantics.
Evidence lanes are not new characteristics
KD‑CAL does not add new global coordinates beyond F–G–R. Instead, it requires that reliability be explainable via assurance lanes (B.3.3):
- TA (Typing assurance): semantic/type alignment sufficient for transport and composition.
- VA (Verification assurance): logical/algorithmic checking, proof, model checking, static guarantees.
- LA (Validation assurance): empirical adequacy under declared conditions, tests, benchmarks, telemetry.
Lane reporting is how KD-CAL supports the common research distinction between logical soundness and empirical adequacy without introducing new global characteristics. Lanes remain separable in SCR/Notes; they are not averaged into a “single tradition score”.
Scope operations are kind-safe (and use the ClaimScope algebra)
Reliability is meaningless if scope operations are applied to ill-typed entities.
Well-formedness constraint WFC‑C2.2‑1 (Type before scope).
Let G1 and G2 be claim scopes associated to described entities of kinds K1 and K2. A scope operation that combines them (e.g., G1 ∩ G2 for serial intersection, SpanUnion({G_i}) for parallel coverage, or translate(Bridge, G) for cross‑context reuse) is defined only if:
K1 = K2, or- (same
U.BoundedContext)K1 ⊑ K2orK2 ⊑ K1(an explicit kind relation/cast is named), or - (cross‑Context) there exists a declared KindBridge relating
K1andK2with an explicitCL^k(C.3).
This constraint prevents “type-by-scope” anti-patterns where scope manipulation is used to hide type mismatch.
Minimal authoring recipe
A minimal, conforming KD‑CAL authoring flow for reliability is:
-
Fix the typed claim. State the claim as a typed proposition about a EntityOfConcern (Kind‑CAL, C.3).
-
Declare claim scope. Write
Gexplicitly using A.2.6 operators; avoid scope-by-wording. -
Declare stance carriers. Declare
K=U.BoundedContext,S ∈ {design, run}, and (where relevant on Working‑Model surfaces)validationMode ∈ {postulate, inferential, axiomatic}; declareReferencePlaneif crossings are in play. -
Bind evidence. Attach evidence stubs and lane tags (TA/VA/LA) and validity windows / decay policy where applicable (B.3.3, B.3.4).
-
Choose Γ-mode. Declare whether the support is series (required) or parallel (independent lines to the same claim).
-
Compute R_raw. Use the weakest-link fold on the entailment spine; for parallel support, use
maxonly with an explicit independence note. -
Declare bridges on reuse. If you reuse across contexts/kinds/planes/notations, declare the bridge(s) (including NotationBridge where applicable) and their CLs. Cross‑Context reuse is conformant only when an explicit Bridge is declared; CL admissibility rules apply (waiver or forbid) before any numeric penalty is meaningful (see CC‑C.2.2‑4). Reuse note (FPF discipline). When this section refers to “reuse/portability across contexts or planes”, interpret it as Bridge-only reuse per §4.4: e.g., Bridge
Bridge#MatLab_to_PlantBwithCL=2and an explicit loss note, applying policy idsΦ=Φ_v1(and, where applicable,Ψ=Ψ_v2,Φ_plane=Φ_plane_v1) to reduceR_effonly. -
Compute R_eff. Apply the declared penalty policies into
R(never intoForG), and publish⟨F,G,R_eff⟩with traceable references and policy identifiers.
A reliable claim is not a loud claim; it is a claim that can be carried.
Authoring template: Path summary row (copy/paste)
When publishing R_eff for a claim, authors SHOULD include a compact, claim-local path summary. This is intentionally shaped so it can be turned into tooling later (EvidenceGraph/PathId in G.6) without introducing new Core types or face-kinds.
Notes:
CL_*_minvalues are bottlenecks on the relevant path/dimension (no averaging).valid_untilis the earliest expiry across empirical legs (or—/ “fenced to TheoryVersion” for non-decaying proof legs).- If you publish multiple admissible paths, include multiple rows and cite which PathId(s) your decision/guard consumed.
Archetypal Grounding
Informative; non-binding.
System illustration
System. A brake controller S has a claim:
c1:“For road friction μ ∈ [0.2, 0.9] and vehicle mass m ∈ [900, 2200] kg, wheel slip stays in [0.05, 0.25] under ABS control.”
-
F(c1)=F5because the controller and constraints are expressed as a machine-checkable model plus executable test harness (C.2.3). -
G(c1)is the declared operating envelope (A.2.6) as a product set in(μ, m, speed, tire)space. -
Evidence:
- VA: model-checking of a simplified plant/controller model (strong, but only for the simplified plant).
- LA: HIL simulation + track tests under sampled conditions with recorded telemetry windows (freshness required).
- TA: typed alignment between “μ” in simulations, “μ” in the estimation pipeline, and “μ” inferred from real-world sensors.
If telemetry is reused from the track context to the road context, a scope bridge is declared with CL=2. Using the default monotone penalty table (B.3), the LA contribution is reduced, and the derived R_eff(c1) drops accordingly. The claim’s envelope G(c1) does not change; only the warrant for transporting the evidence does.
Episteme illustration
Episteme. A paper asserts two claims about an algorithm A:
c2:“A terminates for all inputs in domain D.” (axiomatic / proof-carrying)c3:“A achieves ≥ 0.92 F1 on dataset family F under deployment preprocessing P.” (empirical)
c2 can achieve high VA with a proof carrier; its LA lane may be N/A, but its TA lane remains relevant because the intended meaning of “domain D” must align with the implementation’s input model.
c3 requires LA evidence and a freshness/shift policy because dataset and preprocessing drift change the scope and the warrant. If c3 is reused from a lab dataset context to a production context, a bridge with explicit CL is required, and R_eff is reduced until new in-context evidence is attached.
Bias-Annotation
Informative; non-binding.
Lenses tested: Gov, Arch, Onto/Epist, Prag, Did. Scope: Universal.
- Onto/Epist bias: High formality is often mistaken for high warrant (“proof therefore true in the world”). This pattern mitigates by forcing LA/TA visibility and by routing transport loss into R rather than mutating the claim.
- Prag bias: Teams may Goodhart R by narrowing scope or selecting easy tests. This pattern mitigates by requiring explicit scope declaration and by making scope changes first-class (A.2.6).
- Gov bias: Overconfident reuse across contexts is a recurring failure mode in governance settings. This pattern mitigates by forcing explicit bridges and penalties for reuse.
- Did bias: A single scalar is seductive; it hides what kind of warrant exists. Lane reporting keeps the scalar honest.
Conformance Checklist
Normative.
Common Anti-Patterns and How to Avoid Them
Informative; non-binding.
Consequences
Informative; non-binding.
Rationale
A triad only works if each coordinate has a single job.
- G carries entitlement. It states where the claim is asserted to apply. If G is implicit, teams argue about “what was meant” instead of updating scope.
- F carries checkability. It states how much the claim’s form supports mechanised scrutiny and reuse. If F is conflated with R, formalisation becomes a rhetorical weapon.
- R carries warrant. It states how much evidence supports relying on the claim under G. If R is not conservative, evidence with a low
Rcoordinate can be laundered into high confidence.
Routing congruence loss into R only prevents a subtle but pervasive failure mode: transport across contexts/kinds/planes does not silently rewrite the claim; it only reduces how confidently we should carry it.
Weakest-link propagation is chosen because it is the simplest rule that is monotone, conservative, and auditable. When better combination rules exist, they can be introduced as explicit Γ‑policies, but the default must be safe.
SoTA-Echoing
Normative.
SoTA pack binding note. If a SoTA Synthesis Pack exists for KD‑CAL reliability / cross‑context warrant transport in your Context (G.2), cite its ClaimSheet IDs / CorpusLedger entries / BridgeMatrix rows here. Otherwise, record SoTA-Pack: TBD/none and treat this section as the seed (do not fork it silently elsewhere).
Relations
Builds on: C.2 (KD‑CAL overview), A.2.6 (Claim scope and operators), C.2.3 (Formality F), B.3 (Trust & Assurance calculus), B.1.3 (Γ‑fold patterns), B.3.3 (assurance lanes), B.3.4 (refresh/decay), C.3 (Kind‑CAL and kind bridges), F.9 (Bridges & CL), G.6 (EvidenceGraph PathId discipline), G.7 (Bridge calibration / admissibility thresholds).
Coordinates with: C.16 (MM‑CHR evidence discipline), E.14 (working-model assertions), E.18/F.9/F.17/E.17/A.21 where crossing bundles and gate checks are live, C.25 (Q‑Bundle, for avoiding confusion between epistemic reliability and system reliability).
Used by: C.3.3 (cross-kind reuse discipline), guard macro bundles in C.3.A and C.21, and any acceptance/gating logic that consumes R_eff while preserving F and G.
Clarifies: The KD‑CAL meaning of reliability implicit in C.2:4.1 and the transport clauses referenced across B.3 and C.3.
C.2.2:End
U.LanguageStateSpace - Language-state chart over U.CharacteristicSpace
Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative
Plain-name. Language-state space.
Builds on.
A.19, E.10, F.18.
Used by.
C.2.LS, C.2.3, C.2.4, C.2.5, C.2.6, C.2.7, A.16.0, A.16, A.16.1, A.16.2, B.4.1, B.5.2.0, F.9.1, A.6.P, C.16.Q, A.6.A.
Problem frame
In engineering, inquiry, operator, and management practice, teams often need to say where a governed U.Episteme publication currently stands before it has reached a late endpoint governing pattern. That governed publication may later appear through several cue-bearing, route-bearing, or endpoint-bound publication forms, but the chart claim remains about the governed U.Episteme publication rather than about a local alias or a carrier lane.
Cue packs, routed cue sets, abductive prompts, typed route-bounded projection publications, partial normal forms, and endpoint-bound records are not rival occupants of the space. They are publication forms through which a current position claim is made visible. MVPK faces may render those forms, but faces are not themselves the forms. By contrast, a service disturbance, a model-vs-observation discrepancy, a bodily tension, a telemetry trace, a model output, or a carrier document may trigger, witness, or carry that episteme, but none of those is itself a coordinate in the space.
Practitioners, including engineers, operators, researchers, managers, and engineer-managers, still have to decide where such an episteme currently stands, which thresholds matter next, which publication form is admissible, and what must not yet be claimed. If this domain is described only with folk labels such as raw, early, settled, or ready, the real geometry disappears.
Problem
Without an explicit language-state chart:
- teams collapse several facets into one maturity story;
Fis silently misused as a surrogate for articulation, closure, anchoring, and representation factors;- thresholds are published as vague readiness statements instead of explicit facet conditions;
- source phenomena, governed epistemes, publication forms, publication faces, and carriers are conflated;
- bridge and endpoint work inherit under-described upstream states.
Forces
Solution
U.LanguageStateSpace is the cluster-local name for the declared language-state chart over U.CharacteristicSpace as disciplined by A.19.
It is not a second kernel state-space apparatus beside A.19. It is the particular declared U.CharacteristicSpace whose basis slots are the language-state facets used in this cluster.
Core role
U.LanguageStateSpace gives FPF one explicit declared chart for answering five questions:
- which basis slots define where the governed episteme stands;
- what a position claim in that chart means;
- which thresholds are locally declared over those slots;
- what comparisons are admissible without cross-facet collapse;
- and how the same position claim stays distinct from the publication form currently expressing it.
Position reading under A.19
A language-state position is a partial, slot-explicit coordinate claim in the declared language-state U.CharacteristicSpace.
Each basis slot publishes a ValueSet(slot), interval, or other admissible set-valued claim. Early seam publications may leave some slots unknown or wide, but that uncertainty must be declared rather than hidden inside one stage word.
position language is therefore admissible here only as shorthand for such slot-explicit A.19 coordinate claims. It does not authorize a rival process-sequence or feature-vector story.
Facet basis
The language-state chart is coordinated by explicit facet governing patterns rather than by an informal master progression. In the current cluster the basis is formed by:
C.2.3forF;C.2.4for articulation explicitness;C.2.5for language-state closure degree;C.2.6for language-state anchoring mode;C.2.7for the language-state representation-factor bundle.
C.2.2a states that these basis slots together define the chart. It does not govern the internal scale semantics of the individual facets.
Ontological role lanes
Within this cluster, keep five roles distinct:
- occupant - the governed
U.Epistemepublication whose current position is being claimed; - grounds / witnesses - disturbances, discrepancies, traces, model outputs, bodily tensions, exemplars, or contrasts that justify the current reading;
- publication forms - cue packs, routed cue sets, prompt forms, typed route-bounded projection publications, partial normal forms, and endpoint-bound records through which the episteme is published;
- publication faces - the existing MVPK faces on which those publication forms are rendered when face typing matters;
- carriers - documents, console notes, cards, trace files, or model carriers that hold or render a publication.
U.LanguageStateSpace governs only the coordinate reading of the position claim. It does not collapse that claim into the grounds, publication form, publication face, or carrier.
Position publication rule
A published position claim in U.LanguageStateSpace should normally make at least the following explicit:
- the occupant whose position is being described;
- the relevant slot values,
ValueSetclaims, or intervals; - the current publication form and, when it matters, the MVPK face carrying it;
- the load-bearing grounds, witnesses, or carriers that explain those values;
- any local threshold declarations if the position is being used for a routing or gate decision;
- any note that distinguishes source anchoring from current publication-face anchoring.
A position claim may be partial when some slots are intentionally unknown, but the unknowns should be declared rather than hidden under a broad readiness label.
Local position-reading witness
For this pattern, a position claim is reviewable when:
- the occupant is named or inherited by an already pinned upstream publication;
- the slot values, intervals, or
ValueSetclaims are explicit enough to show where the publication stands; - the grounds, witnesses, or inherited pins that support those values remain visible;
- any threshold-bearing use states the local threshold note or the pinned threshold source it inherits;
- and the text keeps the occupant, publication form, publication face, and carrier in distinct role lanes.
A polished note, a carrier with more preservation or distribution support, or a more formal face does not by itself prove a new position. The chart claim remains admissible only when those role lanes and slot claims stay visible.
Non-substitution of F
F remains one basis slot in the chart, not the whole chart.
A conforming account shall not infer:
- closure from formality alone;
- anchoring from publication-face format alone;
- representation factors from articulation alone;
- or routing legality from a lone
Fstatement.
Where operationally meaningful thresholds exist, they must publish on the relevant slots rather than being disguised as informal F sublevels.
Position versus publication form
A position claim in U.LanguageStateSpace is distinct from:
- the underlying governed
U.Episteme, - the source disturbance, discrepancy, or witness,
- the current publication form,
- the MVPK face that renders that publication,
- the carrier that stores or displays it,
- or the endpoint-pattern-governed publication that may later result from it.
Those roles are coupled but distinct. U.LanguageStateSpace keeps the position claim readable without collapsing it into any one bearer lane.
Threshold publication discipline
If a threshold is used to justify a move, a handoff, or an endpoint entry, that threshold shall be stated on explicit basis slots in the chart. Statements such as this is now ready, this has matured, or this is still too early are non-conformant when they substitute for undeclared slot conditions.
Comparison and bridge note
Comparisons inside one context may use the shared chart and local thresholds. Comparisons across contexts require explicit bridge discipline. Label similarity or stage-language similarity does not establish sameness of charts, positions, or thresholds.
C.2.2a therefore supports bridge work, but does not grant cross-context identity by itself.
Corridor reading note
The current Language-State & Semantic Routing Corridor in this cluster is a distributed overlay over:
C.2.2aC.2.LSC.2.4–C.2.7A.16A.16.0–A.16.2B.4.1B.5.2.0
A.16.1 / U.PreArticulationCuePack remains the earliest durable seam publication form in that corridor. B.4.1 is the explicit route-bearing seam after cue preservation, not the first publication in the corridor. B.5.2.0 is typed prompt entry, not generic route governance.
C.16.Q, A.6.A, A.6.P, B.5.2, A.15, and C.25 are seam-coupled downstream governing patterns rather than members of this language-state governing-pattern set.
This note gives readers one corridor map only. It does not relocate articulation, closure, route, prompt, bridge, or endpoint semantics out of their current governing patterns.
Archetypal Grounding
Tell. One note can have high operator-loop anchoring yet still low closure. Another can be document-mediated and symbol-heavy while still open on route choice. Both are positions in one language-state chart, but not on one maturity progression.
Show (System). A service disturbance is a system-side phenomenon. The governed occupant is the alerting U.Episteme published from that disturbance; its position claim may be moderately formal, low-closure, high in operator-loop anchoring, and mixed in representation because terse codes and natural-language hints coexist.
Show (Episteme). A model-vs-observation discrepancy is a witness-level tension, not the occupant itself. Once preserved as a cue pack, the resulting governed U.Episteme may be low in articulation, low in closure, trace-anchored, and only partly symbolic even when later written into prose.
Bias-Annotation
The pattern deliberately biases authors toward decomposable coordinate claims and away from folk stage vocabularies. That costs some brevity, but it prevents collapse of genuinely different state facets into one adjective.
Conformance Checklist
CC-C.2.2a-1U.LanguageStateSpaceSHALL be treated as the declared language-state chart overU.CharacteristicSpace, not as a rival kernel space and not as a disguisedFprogression.CC-C.2.2a-2Published positions SHALL cite explicit facet governing patterns when those positions matter for movement, routing, or endpoint entry.CC-C.2.2a-3Position claims SHALL use slot-explicit values,ValueSetclaims, or intervals; uncertainty SHALL NOT be hidden inside stage words such asready,early, ormature.CC-C.2.2a-4A position claim in the chart MUST NOT be conflated with the current ground, witness, publication form, publication face, or carrier.CC-C.2.2a-5Cross-context comparison of positions or threshold talk SHALL go through bridge discipline rather than label similarity.CC-C.2.2a-6Corridor and navigation notes MUST NOT be read as relocation of facet, seam, bridge, or downstream governing-pattern semantics into the chart governing-pattern set.CC-C.2.2a-7If a position claim is used for routing, endpoint entry, or gate-adjacent reasoning, the threshold note and the role-lane distinction between occupant, publication form, face, and carrier SHALL remain explicit or explicitly inherited from a pinned upstream publication.
Common Anti-Patterns and How to Avoid Them
- Maturity monism. Replace five facets with one stage word. Repair by publishing explicit slot placement.
- Formality capture. Use
Fto stand in for articulation, closure, or anchoring. Repair by naming the actual facet governing pattern. - Carrier collapse. Treat a document, cue pack, or routed note as if it were the position itself. Repair by separating carrier lane, publication form, publication face, and position claim.
- Threshold folklore. Speak of readiness without any explicit threshold declaration. Repair by publishing relevant local threshold notes on explicit slots.
- Bridge by vibe. Treat similar stage language in two schools as equivalence. Repair by explicit
F.9bridge with loss notes. - Corridor inflation. Treat the navigation cluster or corridor map as if it were the governing-pattern set for all downstream semantics. Repair by naming whether the current statement belongs to the chart governing-pattern set, a seam publication form, or a downstream governing pattern.
Consequences
The benefit is that practitioners, including engineers, operators, researchers, managers, and engineer-managers, can speak about where a governed U.Episteme stands without hiding the reasons inside vague maturity language. The trade-off is that publication must carry explicit slot and threshold information when decisions depend on it.
Rationale
Language-state work needs one explicit statement of what this chart is before individual facet, move, and endpoint patterns start using it. Without that statement, readers have to reconstruct the same geometry from scattered local rules and examples.
SoTA-Echoing
SoTA note. This section does not mint a second rule source. It is a load-bearing alignment statement: the Solution, Conformance Checklist, and role-lane discipline of this pattern must match the stance stated here or explicitly justify divergence.
Traditions covered. This pattern binds itself to architecture-description governance, model-based systems engineering, and risk/governance profiling practice.
Architecture-description governance. C.2.2a adopts the discipline that positions, publication forms, faces, and carriers stay explicitly distinct, even when one local rendering makes them look aligned.
MBSE and profile discipline. C.2.2a adapts multi-property state publication into a chart over U.CharacteristicSpace whose basis facets remain decomposable and locally thresholded.
Local stance. The load-bearing SoTA claim for this pattern is narrow: best-known current practice treats governed language-state as a multi-facet chart with explicit thresholds and role-lane distinctions, not as one maturity progression or one polished publication face.
Relations
- Builds on:
A.19,E.10,F.18. - Coordinates with:
C.2.LS,C.2.3,C.2.4,C.2.5,C.2.6,C.2.7,A.16.0,A.16,F.9,F.9.1,E.17.1. - Constrains: threshold publication, positional claims, and anti-collapse discipline across the language-state cluster.
Worked Examples
Inquiry cue before endpoint capture
A research cue note may occupy a position claim with:
- moderate
F, - low articulation explicitness,
- low closure,
- strong embodied or trace-based anchoring,
- and mixed representation factors.
That position explains why the note should remain upstream of A.6.P or C.25 even if its prose happens to look polished.
Routed operator alert note
A routed operational alert may have:
- moderate formality,
- medium articulation,
- low closure because several responses remain live,
- high operator-loop anchoring,
- and mixed symbolic and natural-language representation.
That position explains why the alert belongs in a route-bearing seam publication before it hardens into an endpoint-pattern-governed work record or reliance record.
Viewpoint-bound adequacy note
A document-mediated adequacy note about an architecture description may be relatively high in formality and articulation, mid-level in closure, document-mediated in anchoring, and symbolic in representation. That position remains within the same language-state chart even though its carrier lane differs from an embodied inquiry cue.
Polished prose is not closure
A prose rewrite may look cleaner, more compact, or more manager-readable than the source cue and still remain low in closure or articulation explicitness. If the underlying slot values, uncertainty, and route plurality remain unchanged, then publication polish changes the rendering or carrier lane, not the chart position by itself.
Position Publication Package Discipline
A publishable position claim should normally identify:
- the occupant whose position is being described;
- the relevant slot values,
ValueSetclaims, or intervals; - the current publication form and, if relevant, the MVPK face and carrier;
- any source-versus-face anchoring distinction that matters;
- the thresholds, if any, being invoked;
- and the next governing pattern or move family that depends on the claim.
This keeps the claim operationally useful without pretending that the position is itself a full trajectory or endpoint form.
Review Guidance
A reviewer should ask:
- Is the author naming a position claim in the chart, or only a folk stage label?
- Is
Fbeing used as a surrogate for another slot? - Are source phenomena, publication forms, publication faces, and carriers being confused with the occupant?
- Are threshold claims explicit enough for the next move or endpoint decision?
- If the text compares two contexts, is there a real bridge or only a lexical resemblance?
Boundary Notes
C.2.2a does not govern move kinds, seam publication forms, endpoint repair semantics, or bridge substitution licence. Those belong respectively to A.16 / A.16.0, A.16.1 / B.4.1 / B.5.2.0, A.6.* / C.25, and F.9 / F.9.1.
Its job is narrower and more foundational: to make the declared language-state U.CharacteristicSpace chart readable so that downstream patterns can refer to one visible common geometry instead of rebuilding it piecemeal.
C.2.2a:End
Unified Formality Characteristic F
Type: Definitional (D) Status: Stable Normativity: Normative unless marked informative
Plain-name. Formality characteristic.
One-line summary. C.2.3 defines Formality (F) as one ordinal U.Characteristic with polarity up, anchored by the default ladder F0...F9, and declared as the F coordinate of the typed F-G-R assurance tuple.
Problem frame
Transdisciplinary work needs one shared way to speak about rigor of expression. A research hypothesis in constrained natural language, a software interface specification with explicit invariants, a controller model checked against hybrid obligations, and a proof-bearing formal development are not comparable by domain lore alone. They are comparable by how strictly the content is expressed.
Historically, that distinction drifts. Teams mix editorial maturity, organizational status, notation choice, proof support, and scope narrowness into one vague story about something being more formal. C.2.3 removes that drift by giving FPF one explicit U.Characteristic for rigor of expression.
Problem
Without one unified F characteristic:
- Rigor is narrated inconsistently. Different contexts invent local mode/tier language with no shared comparability.
- Status and rigor collapse. Something accepted, published, or approved is mistaken for something precisely expressed.
- Expression changes are hidden. A move from sketch to predicates or from executable model to proof is not recorded as a distinct content change.
- Composition becomes unsound. A composite episteme is treated as highly formal because one segment is highly formal, even when essential support still depends on less formal parts.
- Other characteristics are misused as surrogates. Authors quietly use scope, evidence, or language-state facets as if they were part of one master formality characteristic.
Forces
Solution - U.Formality as one ordinal characteristic
C.2.3 defines U.Formality as the single governing characteristic for rigor of expression in FPF.
Identity and typing
- Name:
U.Formality(abbreviatedFin the assurance tuple) - Type:
U.Characteristic - Scale kind: ordinal
- Polarity:
up - Carrier: any
U.Episteme - Default value family:
F0...F9
F states how strictly the content is expressed. It does not state whether the content is true, well evidenced, widely applicable, or organizationally accepted.
Role in the typed F-G-R tuple
F is the formality coordinate in the assurance tuple. Its interaction rules are strict:
Fis notG; scope remains governed byU.ClaimScopeand other USM structures.Fis notR; evidence, warrant strength, and decay remain assurance concerns.CLand bridge losses affectR, notF.- Changes in notation, carrier, or rendering form do not change
Fif the formal content is preserved.
Extensibility and local anchors
FPF provides the default anchor ladder F0...F9. A context may define sub-anchors or intermediate anchors such as F4[OCL] or F6.5, but only if:
- global order is preserved,
- the local anchor is explicitly docked to a parent anchor,
- the context does not invent a rival ladder or proxy scale.
Usage obligations
- Every normative episteme shall declare one
Fvalue. - Thresholds that depend on rigor should be written explicitly as
F >= Fkconditions. - Any raise or lowering of
Fis a content change, not a status-only change. Fremains declaration and reasoning infrastructure; it is not itself a governance process.
Archetypal Grounding
Tell. F does not ask whether a claim is correct. It asks how strictly the claim is expressed.
Show (System). A system requirement written as controlled natural language with unambiguous acceptance conditions may be F3; the same requirement rewritten as explicit typed invariants may become F4; a machine-checked proof of a critical invariant may raise the relevant claim core to F7 or above.
Show (Episteme). A research conjecture can begin at F1-F3, then gain explicit predicates at F4, executable semantics at F5, and proof-bearing core content at F7-F8, while remaining recognizably the same evolving claim family.
Bias-Annotation
The pattern biases FPF toward one explicit rigor characteristic and against stories that mix formality with status, publication quality, scope width, or evidence support. That bias is intentional. The price of explicit declaration is smaller than the cost of comparing rigor through folklore.
Conformance Checklist
CC-F-1Every normativeU.EpistemeSHALL declare exactly oneU.Formalityvalue, either a default anchor or a local sub-anchor explicitly docked to one.CC-F-2FSHALL be treated as an ordinal characteristic; arithmetic overFvalues is invalid.CC-F-3HigherFSHALL mean greater or equal strictness of expression, not greater truth, trust, or scope.CC-F-4Contexts MUST NOT publish alternative "formality modes" or "tiers" as surrogates forF.CC-F-5Local sub-anchors SHALL preserve the global ordering and the parent anchor meaning.CC-F-6The episteme-levelFof a composite episteme SHALL be bounded by the least-formal essential support on the relevant support path.CC-F-7Implementations MUST NOT averageFvalues numerically.CC-F-8Changes inG,R, orCLSHALL NOT changeFunless the expression form itself changes.CC-F-9Cross-context transport SHALL preserve the attributedF; if the receiving context rewrites the claim materially, it becomes a new episteme with its ownF.CC-F-10Translation loss, bridge loss, and plane crossings SHALL affectRrather than being hidden asFchanges.CC-F-11AssignedFvalues SHALL be justifiable by observable content such as explicit predicates, executable semantics, or machine-checked proofs.CC-F-12Declaring a tool or notation SHALL NOT by itself justify a higherFunless the content satisfies the target anchor semantics.CC-F-13Status labels such asDraft,Approved, orPublishedMUST NOT substitute forF.CC-F-14A context that usesFin gates or policies SHALL write those thresholds explicitly.CC-F-15Language-state facets such as articulation or closure MUST NOT be hidden as pseudo-levels ofF.
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
FPF needs a rigor characteristic that is portable across mathematics, software, systems, policy, and research. The smallest stable answer is one ordinal characteristic with clear anchors and explicit composition rules. Anything more fragmented breaks comparability; anything more compressed hides the substantive differences between sketch, predicate, executable model, and machine-checked proof.
SoTA-Echoing
Post-2015 practice across formal methods, software architecture, safety engineering, verification, computational science, and typed proof environments converges on one broad lesson: rigor is not binary. It rises through explicit structuring, predicate expression, executable semantics, and machine-checked obligations. C.2.3 adopts that gradient while keeping the characteristic notation-agnostic and transdisciplinary.
Relations
- Defines: the
Fcoordinate of the typedF-G-Rassurance tuple. - Builds on: characteristic machinery from
A.18/A.19and episteme-level characteristic assignment from Part C. - Coordinates with:
C.2.2,B.3,F.9,C.2.LS,A.16,C.2.4,C.2.5,C.2.6, andC.2.7. - Constrains: any pattern, gate, or editorial rule that speaks about rigor of expression.
Canonical Anchors F0...F9
Reading rule. Anchors are ordinal. They say what is minimally true of the expression form, not what is true of the world.
F0 - Unstructured prose
Free natural language with unstable vocabulary, implicit assumptions, and no stable internal structure.
F1 - Scoped notes
Still informal, but with stable topic focus and more consistent terminology. Scope is named even though criteria are not yet operationalized.
F2 - Structured outline
A recognizable template or full section shape exists. The expression is coherent end-to-end, but acceptance criteria are still largely placeholders or informal.
F3 - Controlled narrative
Claims are expressed in constrained prose with stable interpretation. Acceptance or refusal conditions are visible in language, even if not yet fully predicate-like.
F4 - First-order constraints
Critical claims can be rendered as explicit predicates or invariants over typed entities. Consistency and conflict are at least checkable in principle.
F5 - Executable math / algorithmics
The expression has declared executable semantics. Running the model, algorithm, or simulation is part of its meaning.
F6 - Hybrid formalism
Several formal layers are coordinated explicitly, typically discrete plus continuous or several tightly coupled formal subsystems, with declared obligations between them.
F7 - Higher-order verified
Core claims are encoded in a proof-capable higher-order setting and machine-checked against that logic kernel.
F8 - Dependent / constructive proofs
Programs-as-proofs or dependent-type expressions carry the relevant property in their types or proof terms.
F9 - Univalent / higher foundations
Higher-equality foundations are load-bearing. The expression relies on a frontier-grade setting where equivalence is handled as structure-level identity.
Cross-anchor cautions
- Execution is not proof.
- Surface structure is not yet semantics.
- Publishing or approval is not an anchor.
- A local sub-anchor does not erase its parent anchor's meaning.
Assigning F in Practice
First-pass questions
- Can a competent reader misread the claim materially?
If yes, the expression is likely at
F0-F2; if not, it may beF3or above. - Are the critical claims visible as explicit predicates or invariants?
If yes, the expression is at least
F4. - Does the expression have declared executable semantics?
If yes, it is likely in the
F5-F6region. - Would a logic kernel or type checker reject an incorrect change to a core claim?
If yes, the expression is likely
F7-F8, orF9if higher-equality machinery is essential.
Quick rubric
- No full structure ->
F0-F1 - Full structure but mostly placeholder criteria ->
F2 - Controlled prose with one stable reading ->
F3 - Explicit predicates / invariants ->
F4 - Declared executable semantics ->
F5 - Hybrid / layered formal obligations ->
F6 - Machine-checked proof core ->
F7 - Dependent proof-carrying core ->
F8 - Higher-equality foundations are essential ->
F9
Typical delta-F moves
F2 -> F3: replace loose prose with controlled phrasing and explicit acceptance statements.F3 -> F4: recast acceptance into typed predicates or invariants.F4 -> F5: give the expression declared executable semantics.F5 -> F6: make multi-layer obligations explicit.F6 -> F7/F8: move critical claims into machine-checked proof or dependent-type form.
Composition and Interaction
Weakest-essential-support rule
For a composite episteme, the effective F is bounded by the least-formal essential support on the relevant support path. A highly formal annex does not lift an informal essential claim core.
Relation to G
F concerns expression form; G concerns applicability or claim scope. Tightening scope may accompany a raise in F, but it is a separate change and must remain visible as such.
Relation to R
Higher F often makes evidence easier to formulate, test, or prove, but it does not create warrant strength by itself. Empirical freshness, corroboration, and bridge penalties remain R concerns.
Relation to CL and Bridges
A bridge may expose loss or mismatch across contexts. Those losses affect R; they do not silently lower or raise the attributed F. If the receiving context must materially rewrite the claim, it should publish a new episteme with its own F.
Worked Examples
Research hypothesis
A short note proposing a new scaling law with one stable reading and explicit acceptance conditions in prose is typically F3. Rewriting the acceptance conditions as typed predicates would move it toward F4.
Interface specification
An interface specification with explicit preconditions, postconditions, and invariants is typically F4. Adding declared executable semantics in a faithful reference model may move it toward F5.
Safety controller
A controller coupled to a plant model with explicit hybrid obligations is typically F6. If key invariants are then machine-checked in a higher-order proof environment, those claims move toward F7.
Decision policy
A decision policy with controlled prose may remain F3. If thresholds and conditions are published as typed predicates, it becomes F4.
Proof-bearing algorithm
A dependent-typed algorithm whose central property is carried by the type itself is typically F8.
Executable ML recipe
A fully explicit training-and-evaluation recipe with declared execution semantics is typically F5. It does not become F7 merely because the surrounding execution machinery is sophisticated.
Authoring and Review Guidance
For authors
Declare F honestly and early. A low F declaration is not a defect; it is often the correct statement about an early expression. Raise F by changing the expression form itself, not by applying prestige language or by pointing to surrounding machinery.
For reviewers
Review the actual claim core. Ask whether the target anchor semantics are visibly satisfied, whether essential support contains segments with lower R, lower F, or missing witness coverage, and whether status or other characteristics have leaked into the F declaration.
For integrators and assurance leads
Use F explicitly in gates and composition analysis, but do not let it absorb work that belongs to G, R, CL, or C.2.LS. Large F gaps across collaborating epistemes are signals for explicit formalization work, not excuses for wishful leveling.
Glossary and Notation
U.Formality/F. The rigor-of-expression characteristic governed by this pattern.- Anchor. A named ordinal milestone on the
Fladder. - Sub-anchor. A context-local refinement docked to one parent anchor.
- Delta-
F. A content change that alters expression rigor. - Essential support. The support without which the central claim does not stand.
- Example notation.
F = F4,F = F7[HOL],requires F >= F6.
Change Log and Patch Notes
Supersession of legacy ladder language
This pattern supersedes deprecated wording that speaks about alternate formality modes, tiers, or editorial ladders. Forward-looking use should speak in F directly.
Migration guidance
When refreshing legacy material, assign an initial F from observable content, rewrite local maturity labels into explicit F declarations, and keep provenance notes only as historical annotations rather than live rigor surrogates.
Boundary to language-state facets
For the language-space extension, F does not govern U.ArticulationExplicitness, U.LanguageStateClosureDegree, U.LanguageStateAnchoringMode, or U.LanguageStateRepresentationFactorBundle. Contexts MUST NOT hide thresholds for those facets as pseudo-levels or submodes of F; those facets remain explicitly governed by C.2.LS and its subordinate patterns.
C.2.3:End
U.LanguageStateFacetProfile - Thin profile bundle for language-state facets
Type: Definitional (D) Status: Stable Normativity: Normative unless marked informative
Plain-name. Language-state facet profile.
Problem frame
Once position claims in the declared language-state chart over U.CharacteristicSpace must be published and compared, teams need one thin profile bundle that keeps the relevant facets visible as one explicit facet profile without turning that profile into a second characteristic calculus or a surrogate maturity progression.
Problem
Without a dedicated profile bundle, authors blur articulation, closure, anchoring, and representation into one vague maturity story, or they silently reuse F as a surrogate. That blocks admissible threshold publication, undercuts A.16 move guards, and makes school-to-school bridge work harder than it needs to be.
Forces
Solution
U.LanguageStateFacetProfile is a typed profile bundle that names the facets by which position claims in the declared language-state chart over U.CharacteristicSpace are published and interpreted:
formalityRef->U.FormalityfromC.2.3articulationExplicitnessRef->U.ArticulationExplicitnessfromC.2.4languageStateClosureDegreeRef->U.LanguageStateClosureDegreefromC.2.5languageStateAnchoringModeRef->U.LanguageStateAnchoringModefromC.2.6languageStateRepresentationFactorBundleRef->U.LanguageStateRepresentationFactorBundlefromC.2.7thresholdRefs?-> context-local threshold declarations over the governed facetsrouteNotes?-> informative notes that help interpret routing or reopening decisions
C.2.LS is therefore a profile-bundle governing pattern, not a characteristic governing pattern and not a trajectory governing pattern. Characteristic semantics remain with A.18/A.19; admissible moves remain with A.16; explicit path publication remains with E.18.
Governing boundary
C.2.LS governs only the profile composition and the rule that the language-state facets must remain explicit and non-collapsed. It does not:
- redefine
F; - invent a second formality progression;
- govern the scale semantics of
AE,CD,LanguageStateAnchoringMode, orU.LanguageStateRepresentationFactorBundle; - govern reopen/backoff moves;
- govern endpoint classification or bridge kinds.
Threshold publication discipline
Any threshold used for routing, admissible move guards, or entry into A.6.P shall be published on explicit named facets within the profile. Contexts shall not speak of hidden sub-levels of F when what matters is really articulation, closure, anchoring, or the representation-factor bundle.
Local profile-reading witness
For this pattern, a published facet profile is reviewable when:
- the facet refs are explicit or explicitly inherited from an already pinned upstream publication;
- any threshold-bearing use names the facet whose threshold is being invoked;
- route notes or local overlays remain informative and visibly docked to the explicit facet bundle;
- and the profile does not smuggle move rules, bridge rules, gate state, or downstream governing-pattern semantics into the bundle record.
A polished label, one strong facet, or one memorable route note does not by itself yield an admissible profile reading. The profile remains conformant only when the named facets stay explicit and decomposable.
Composite readings
A language-state judgement may be composite, but the composite shall be decomposable. For example, a cue may be:
- low
AE, - medium
CD, AM.TraceAnchored,- and representation-wise mixed rather than purely symbolic.
A conforming profile makes this decomposition visible rather than hiding it under one poetic label such as "early" or "raw".
Corridor map note
C.2.LS participates in the current Language-State & Semantic Routing Corridor, but only as the thin governing pattern of the facet-profile bundle. Readers who need one map of the full language-state governing-pattern set should read the corridor note in C.2.2a.
That map does not change the governing boundary here: C.2.LS still does not govern cue preservation, route-bearing publication, prompt entry, or downstream endpoint handoff.
Archetypal Grounding
Tell. A team may say a draft is "still forming" for different reasons. U.LanguageStateFacetProfile forces the team to say whether the issue is low articulation, low candidate-space closure, an anchoring mismatch, or an unresolved representation-factor bundle.
Show (System). An operator alert note can be AM.OperatorLoop anchored and low-closure without being low-formality in every respect.
Show (Episteme). An inquiry note can be low articulation yet already tightly anchored to exemplars and traces.
Bias-Annotation
The pattern biases authors toward explicit facet governance and away from master-scale stories. That cost is intentional: the goal is to prevent surrogate progressions from entering the Core.
Conformance Checklist
CC-C.2.LS-1A language-state facet profile SHALL reference explicit facet governing patterns rather than invent local unnamed factors.CC-C.2.LS-2C.2.LSMUST NOT redefineFor create a second formality progression.CC-C.2.LS-3Thresholds that matter for routing, reopening, or lexical repair SHALL be published on explicit facets.CC-C.2.LS-4Trajectory accounts that rely on facet profiles SHOULD reuseA.16move kinds andE.18path publication rules.CC-C.2.LS-5Composite labels such asearly,settled, orreadySHALL NOT stand in for the explicit facet bundle when those states matter operationally.CC-C.2.LS-6Composite readings, overlays, and route notes SHALL remain decomposable into named facets and MUST NOT behave as hidden master factors.CC-C.2.LS-7A profile bundle MUST NOT smuggle move rules, bridge rules, gate state, or downstream governing-pattern semantics into what should remain a thin facet-profile record.
Common Anti-Patterns and How to Avoid Them
- Shadow progression. Treating
early/lateas a master scale. Split the judgement into the named facets. - Formality capture. Letting
Fstand in for closure or articulation. Publish those facets explicitly. - Bundle inflation. Turning
U.LanguageStateFacetProfileinto a secondA.19. Keep it thin and referential. - Opaque readiness. Using words such as
readyormaturewithout naming which facet justifies the claim. - Route-note capture. Letting an informative route note behave like move rule, gate state, or endpoint governance. Keep route notes informative and push operative authority back to
A.16, downstream governing patterns, or gate/work governing FPF patterns orauthoritySourceReftargets.
Consequences
The benefit is authority-reference clarity: early cue work, bridge annotations, and reopen moves can all talk about one explicit facet profile. The trade-off is more explicit profile authoring and threshold publication.
Rationale
The pattern gives the declared language-state chart over U.CharacteristicSpace one stable facet-profile record through which its facet bundle can be published together, while respecting the rest of FPF's governing boundaries.
SoTA-Echoing
SoTA note. This section does not mint a second rule source. It is a load-bearing alignment statement: the Solution, Conformance Checklist, and boundary discipline of this pattern must match the stance stated here or explicitly justify divergence.
Traditions covered. This pattern binds itself to architecture-description governance, model-based systems engineering, and governance/profile discipline.
Architecture-description governance. C.2.LS adopts the discipline that useful state publication should keep the relevant profile elements explicit rather than hiding them inside one summary label.
MBSE and profile discipline. C.2.LS adapts typed multi-property state publication into a thin, decomposable language-state facet bundle rather than one master scale.
Local stance. The load-bearing SoTA claim for this pattern is narrow: best-known current practice treats language-state publication as a small explicit facet profile with local thresholds and decomposable readings, not as one maturity adjective or one route-coloured bundle label.
Relations
- Builds on:
A.18,A.19,C.2.2a,C.2.3. - Coordinates with:
C.2.4,C.2.5,C.2.6,C.2.7,A.16.0,A.16,A.16.1,A.16.2,B.4.1,B.5.2.0,E.18,F.9.1. - Constrains: language-state threshold publication and profile composition.
Worked Examples and Composition Notes
Operator-facing early alert
A console alert note may be published with a language-state facet profile such as:
F = F2/F3because the note is structurally controlled but still lightweight;AE = AE2because candidate anchors are visible but not yet fully relation-shaped;CD = CD1because several routes remain live;LanguageStateAnchoringMode = AM.OperatorLoopbecause the note is directly anchored to operator intervention/work;RepresentationFactorBundle = {local, sparse, mixed-symbolic}because alert text and compact codes coexist.
This example shows why no one facet can replace the others. The note is not simply early; it is early in a specific, decomposable way.
Research cue before lexical repair
A felt or trace-anchored mismatch cue in an inquiry note may be:
- low
AE, - very low
CD, AM.EmbodiedFelt,- and representation-wise mixed because the cue is partly verbal, partly kinesthetic, partly exemplar-based.
That profile explains why the cue should remain in A.16.1 rather than being forced into A.6.P or B.5.2 immediately.
Architecture-description case
A viewpoint-bound note about the adequacy of an architecture description may be moderately high in F, moderately high in AE, still mid-level in CD, document-mediated in AM, and symbolic in its representation-factor bundle. The profile keeps description-side adequacy distinct from system-side engineering quality.
Same F, different profile
Two notes may share the same rough F band and still differ sharply in articulation, closure, anchoring, and representation factors. One may be operator-loop anchored and low-closure; another may be document-mediated and comparatively closed. The profile bundle keeps that difference visible instead of letting F behave like a master factor.
Authoring and Review Guidance
For authors
When publishing a language-state facet profile:
- start from the local authoring problem rather than from a memorized progression;
- name the facet refs explicitly;
- add threshold refs only when a threshold changes routing, repair, or governance;
- avoid global labels such as "mature", "raw", or "ready" unless the profile decomposition is already visible.
For reviewers
A reviewer should ask:
- is any facet silently replaced by
F? - is a threshold published on an explicit facet rather than on a poetic surrogate?
- do route or reopen claims actually match the published facet bundle?
- are profile notes genuinely informative, or are they smuggling governing semantics that belong elsewhere?
For integrators
Integrators should preserve profile references rather than rephrasing them into local slang. A local alias is acceptable only if the underlying facet docking remains explicit and stable.
Extension and Migration Notes
Local extension rule
Contexts may extend the profile with local threshold refs, route notes, or additional descriptive aids, but they shall not add a new master facet that collapses the governed set into one summary factor.
Migration from surrogate prose
Older prose often says:
- "the episteme is still early",
- "the issue is not mature enough",
- "the note is ready",
- "the cue is still raw".
A conforming migration rewrites such statements into explicit facet talk: which facet is low, which is high, which threshold is or is not met, and which move that fact justifies.
Boundary reminder
U.LanguageStateFacetProfile is a coordination record. If authors find themselves putting move rules, bridge rules, scale rules, or bundle semantics into the profile itself, they are writing in the wrong governing pattern.
Profile Publication Package Discipline
Minimal publishable profile package
A publishable U.LanguageStateFacetProfile should normally carry:
- the declared facet refs for
AE,CD,LanguageStateAnchoringMode, andLanguageStateRepresentationFactorBundle; - any threshold refs that substantively affect routing, repair, bridge interpretation, or review load;
- the local relation to
Fwhen readers might otherwise treatFas a surrogate; - any omission note when a facet is intentionally unpublished, unknown, or locally irrelevant.
One-line publication is admissible only if facet governance remains legible.
Partial-profile rule
A partial profile is admissible only when omission is explicit. Publishing AE and CD while deferring LanguageStateAnchoringMode is acceptable; silently omitting it and then speaking in scalar prose such as "early" or "ready" is not.
If only one facet is published, either explain why the others are not governed in the current note or point to the note where they are already published.
Overlay discipline
Local overlays such as "explicit-but-open", "trace-heavy", or "operator-tight" are admissible only when they dock to explicit facet refs. Overlays remain secondary to the governed profile and must not replace the facet bundle.
Cross-Facet Reading Rule
No master-facet reading
Do not infer the whole language-state profile from one facet. High AE does not entail high CD; strong AM.OperatorLoop does not fix AE or CD; symbolic representation does not entail high F; low CD does not imply low operational consequence.
Threshold interaction rule
When a threshold is expressed over one facet, say whether the other facets are merely informative or also constraining. A Context may allow entry into B.5.2.0 once AE suffices for an explicit open question while still capping CD so rival answers remain live; it may allow entry into A.6.P at AE3+ while still capping CD so the move remains exploratory rather than endpoint-binding.
Transition reading rule
Read profile transitions facetwise. A note may become more explicit without becoming more closed, more document-mediated without changing closure, or more symbolic without becoming more formal. A.16, A.16.1, A.16.2, B.4.1, and B.5.2.0 should therefore cite the facet transition that actually justifies the move.
Review Matrix and Migration Tests
Review matrix
A reviewer should ask:
- is each published facet governed by its proper pattern rather than by surrogate prose;
- does any overlay smuggle a hidden scalar or gate decision;
- are threshold claims tied to the facet that really bears them;
- do cited moves in
A.16,A.16.1,A.16.2,B.4.1, orB.5.2.0actually match the facet bundle; - if the profile crosses a bridge or viewpoint boundary, are stance and loss notes kept in
F.9orF.9.1rather than imported as fake facets.
Migration test for old prose
Legacy phrases such as "still immature", "not ready yet", or "already stable enough" should be unpacked into: which facet is claimed, which anchor or bundle member justifies it, which threshold or route consequence follows, and which governingPatternRef or authoritySourceRef carries that consequence.
Comparative profile use
Compare profiles facetwise unless a Context has published an explicit local aggregation for reporting. Such an aggregation remains secondary and must not replace the profile in norms, thresholds, or bridge claims.
C.2.LS:End
U.ArticulationExplicitness
Type: Definitional (D) Status: Draft Normativity: Normative unless marked informative
Plain-name. Articulation explicitness.
Problem frame
A governed U.Episteme can already matter while its semantic shape is not yet fully explicit. The declared language-state chart over U.CharacteristicSpace therefore needs one basis-slot governing pattern for how explicit that shape already is, without confusing articulation with rigor, truth, or closure.
Problem
When articulation explicitness stays implicit, authors either overstate readiness for later repair or endpoint classification, or hide early cue structure entirely. Reusing F for this judgement creates a category error: formality is about rigor of expression, not about whether the semantic shape is already explicit enough for repair or endpoint classification.
Forces
Solution
U.ArticulationExplicitness is an ordinal characteristic over how explicit the semantic shape is in a published position claim in the declared language-state chart over U.CharacteristicSpace, for publication, routing, and repair.
Characteristic specification
- Kind: CHR characteristic.
- Scale discipline: ordinal.
- What rises: semantic shape becomes more explicit.
- What does not follow automatically: truth, trust, closure, admissibility, or formality.
AE is therefore independent from F, from LanguageStateClosureDegree, and from endpoint authority.
Starter anchor set
The anchors are a starter set; a Context may refine them locally, but it shall keep the ordinal direction and the distinction from F intact.
Use discipline
AEmay be used to state entry conditions forA.6.P.AEmay be used to justify why an episteme remains inA.16.1orB.4.1.AEshall not be used as a surrogate for closure, confidence, or truth.- High
Fshall not be taken to imply highAE, and highAEshall not be taken to imply highF.
Change discipline
Raising AE requires additional explicit anchors, slots, or normal-form structure. Lowering AE is admissible under A.16.2 when a prior articulation proves over-committed or misleading.
Archetypal Grounding
Tell. "Something is off" may be a real cue even before role bearer, intended work move, reliance move, or evaluator are explicit.
Show (System). An operator alert cue grounded in a disturbance trace may be stabilized as a candidate intervention cue before a full work relation or reliance relation specification exists.
Show (Episteme). A research note may name a contrast and exemplars before it has a clean proposition.
Bias-Annotation
The pattern legitimizes early cues. The counter-bias is explicit: low AE never licenses hidden semantics or unreviewable leaps.
Conformance Checklist
CC-C.2.4-1AESHALL NOT be treated as a synonym forF.CC-C.2.4-2Entry intoA.6.PSHOULD require at least the Context's declared articulation threshold.CC-C.2.4-3AEjudgements that drive routing or repair SHALL cite the anchors, contrasts, or slots that justify the chosen level.CC-C.2.4-4RaisingAESHALL NOT be described as if it automatically settled closure or authority.
Common Anti-Patterns and How to Avoid Them
- Formal-looking but semantically thin. High
F, lowAE. Declare both. - Mystical cue immunity. Low
AEpresented as exempt from authoring discipline. It is not. - Ready-by-tone. A sentence sounds precise, so authors assume
AE3+. Publish the actual anchors.
Consequences
The benefit is admissible publication of early cues and clearer threshold setting for repair. The trade-off is that authors must distinguish "not yet explicit" from "already formal".
Rationale
AE is one basis slot in the declared language-state chart over U.CharacteristicSpace. Without it, A.16.0, A.16.1, and B.4.1 cannot state crisp entry, seam, and exit conditions.
SoTA-Echoing
The distinction echoes work on sketching, focusing/TAE, embodied cue capture, and representation probing: a cue can be real and operationally relevant before it becomes fully explicit.
Relations
- Builds on:
A.18,C.2.2a,C.2.LS. - Coordinates with:
C.2.5,A.16.0,A.16,A.16.1,A.16.2,A.6.P,B.4.1,B.5.2.0. - Constrains: articulation thresholds for routing and repair.
Worked Examples and Edge Cases
High formality, low articulation
A template may be syntactically precise and therefore high in F, yet still low in AE because the actual role-bearer, relation, or intended-work-or-reliance-move slots remain unclear. This is the classic case where formal-looking language overstates semantic readiness.
Low formality, high articulation
A short, plain note may be low in F yet already high in AE because the relation skeleton is explicit enough for A.6.P. This case matters because it shows that AE is not a stylistic measure.
Threshold edge case
A cue with stable trigger span and candidate anchors may still sit between AE2 and AE3. A Context should then publish its local threshold rule explicitly rather than pretending that entry into A.6.P is obvious by tone.
Authoring and Review Guidance
Author prompt
To assign AE, ask:
- is the trigger span stable?
- are candidate anchors visible?
- is there already a minimally relation-like skeleton?
- is a normal form actually publishable, or only hinted?
Review prompt
A reviewer should reject AE claims that rely only on rhetorical confidence. The claimed level should be supported by anchors, slots, contrasts, exemplars, or explicit normal-form structure.
Threshold publication reminder
If AE determines whether an episteme stays in A.16.1, passes through B.4.1, or enters A.6.P, that threshold should be published explicitly and locally.
Extension and Migration Notes
Local anchor refinement
Contexts may refine the starter anchor set with subanchors, but the refinement must preserve the ordinal direction and the distinction from F and CD.
Migration from vague articulation prose
Statements such as "still vague", "more explicit now", or "ready for formalization" should be migrated into explicit AE claims plus the corresponding move or routing claim.
Boundary reminder
AE does not govern closure, confidence, or warrant. If authors want those meanings, they must publish them through their own governing patterns.
Articulation Publication Package Discipline
Minimal articulation package
An AE claim that matters for routing or repair should normally publish more than a level token. The supporting package should indicate which of the following are present:
- stable trigger span;
- candidate anchors or contrasts;
- role-bearer / intended-work-or-reliance-move / evaluator slots where relevant;
- a minimally relation-like skeleton;
- a candidate normal form, or an explicit note that no such form is yet admissible.
A bare AE3 label is a publication with insufficient articulation support when the supporting articulation evidence is absent.
Threshold package for route change
If entry from A.16.1 or B.4.1 into A.6.P depends on AE, publish the threshold together with the minimum articulation package required at crossing time.
Evidence-limited rise rule
AE may rise only as far as the published anchors, slots, and contrasts warrant. Stylistic polish, templates, or rhetorical confidence do not raise AE on their own.
Threshold Crossing and Split Handling
Admissible entry into relational repair
Entry into A.6.P is admissible when the local articulation threshold is met and the note already exposes enough relation structure for precision restoration to operate on a real relation-like episteme. Entry into B.5.2.0 is admissible when the open question is explicit enough for prompt-species publication even if relation structure is still too thin for A.6.P. If the threshold is borderline, keep the episteme in B.4.1 or A.16.1 and state what anchor or slot is still missing.
High-articulation, low-closure cases
A note may reach AE4+ while remaining low or mid in CD. In such cases state that articulation is sufficient for precise handling while closure still leaves rival routes or frames live.
Split-publication rule
If one note contains a high-AE fragment and a low-AE remainder, split the publication rather than assigning one averaged level that hides the actual route structure.
Review Matrix and Endpoint Boundary Tests
Review matrix
A reviewer should ask:
- are the named anchors genuinely present rather than merely presupposed;
- does the claimed articulation level rest on structure rather than tone;
- are role-bearer, intended-work-or-reliance-move, evaluator, or comparison slots still ghosted;
- if
AEis used to justify route transfer, is the destination governing pattern actually ready to receive the publication.
Endpoint-boundary test
High AE does not by itself authorize endpoint claims, gate pressure, or quality ascriptions. If such consequences appear, show which downstream governing pattern takes over.
Migration note for false precision
Rigid templates, capitalized labels, or tidy sentence rhythm can simulate articulation. Migration should therefore test whether anchors and slots are really present; if not, the articulation level should drop.
C.2.4:End
U.LanguageStateClosureDegree
Type: Definitional (D) Status: Draft Normativity: Normative unless marked informative
Plain-name. Language-state closure degree.
Problem frame
A governed U.Episteme may already be explicit enough for publication while its declared position claim remains intentionally open to rival routes or frames. The declared language-state chart over U.CharacteristicSpace therefore needs a separate basis-slot governing pattern for how fixed or closed the current candidate space has become.
Problem
Closure is often hidden inside vague words such as "ready", "settled", or "open". When closure is not explicit, teams cannot reason cleanly about reopen, sketch-backoff, or the admissibility of endpoint docking.
Forces
Solution
U.LanguageStateClosureDegree is an ordinal characteristic over how fixed the current candidate set, framing, and admissible next moves are in a published position claim in the declared language-state chart over U.CharacteristicSpace.
Characteristic specification
- Kind: CHR characteristic.
- Scale discipline: ordinal.
- What rises: the local state becomes more fixed or more binding.
- What does not follow automatically: truth, trust, formality, or quality.
Starter anchor set
Non-collapse rules
LanguageStateClosureDegree is not:
F;- articulation explicitness;
- gate decision;
- evaluator confidence;
- warrant strength.
A text may be highly explicit but low-closure, or low-explicitness but already high-closure by policy. Those states shall not be collapsed.
Change discipline
Increasing CD requires narrowing candidate space, route space, or frame space explicitly. Lowering CD is admissible only through a named move such as reopen, sketchBackoff, or respecify, with a retained-witness and discarded-assumption note.
Archetypal Grounding
Tell. Two notes may look equally explicit, but one is still intentionally open while the other is already committed to a single route.
Show (System). An incident cue can be routed to rollback while remaining reopenable if new evidence arrives.
Show (Episteme). A hypothesis sketch can be highly articulated but still low closure because rival explanations remain live.
Bias-Annotation
The pattern makes closure explicit, which resists hidden overconfidence but may feel heavy to authors who prefer implicit consensus.
Conformance Checklist
CC-C.2.5-1Closure SHALL be declared independently fromFandAEwhen it matters for routing, docking, or reopening.CC-C.2.5-2Reopen/backoff moves SHALL cite the prior closure state they are relaxing.CC-C.2.5-3Strong-closure states SHOULD name the guard,governingPatternRef, orauthoritySourceRefthat makes the closure binding.CC-C.2.5-4Endpoint authority SHALL NOT survive a closure drop silently when the supporting route or publication form no longer holds.
Common Anti-Patterns and How to Avoid Them
- Closure by mood. A sentence sounds decisive, so teams assume high closure. Publish
CDexplicitly. - Irreversible drift. Closure rises informally but no reopen path exists. Use
A.16.2. - Authority smuggling. High closure is treated as if it were automatically a gate or obligation. Route those consequences through the proper governing patterns.
Consequences
The benefit is admissible handling of stabilization, commitment, and reopening. The trade-off is more explicit state declaration and more explicit retreat records.
Rationale
Closure is the route-governance basis slot that complements articulation within the declared language-state chart over U.CharacteristicSpace. A.16.0 and its seam species need both.
SoTA-Echoing
The facet aligns with iterative design, open-world reasoning, and exploratory search practices where closure is a governance choice rather than a hidden by-product.
Relations
- Builds on:
A.18,C.2.2a,C.2.LS. - Coordinates with:
C.2.4,A.16.0,A.16,A.16.1,A.16.2,B.4.1,B.5.2.0. - Constrains: reopen, backoff, and endpoint docking guards.
Worked Examples and Retreat Cases
Explicit but still open
A note may sit at AE4 yet only CD1 because rival explanatory frames are still live. The important lesson is that explicit publication does not imply settled closure.
Strong closure under policy guard
An operator rule may be only moderate in AE but high in CD because policy already fixes the next step under the current horizon. This shows why closure is governance-facing, not merely stylistic.
Reopen case
A route may move from CD4 back to CD2 when counter-evidence appears. A conforming publication does not hide this as embarrassment; it records the retreat as an admissible A.16.2 move.
Authoring and Review Guidance
Author prompt
To assign CD, ask:
- how many rivals remain live?
- is one route merely preferred, or actually fixed?
- what guard,
governingPatternRef, orauthoritySourceRefmakes the closure binding? - what would count as an admissible reopen trigger?
Review prompt
A reviewer should ask whether closure is being inferred from tone, from hierarchy, or from social pressure rather than from an explicit narrowing of route or frame space.
Governance note
Whenever CD substantively affects gates, commitments, or late endpoint authority, the supporting guard, governingPatternRef, or authoritySourceRef should be visible.
Extension and Migration Notes
Local anchor refinement
Contexts may refine the starter closure anchors, but shall keep the ordinal progression and the explicit link to reopen/backoff discipline.
Migration from readiness language
Words such as "settled", "closed", "final", or "open" should be treated as migration prompts into explicit CD claims and, where needed, into named A.16.2 moves.
Boundary reminder
CD is not warrant strength and not a gate decision. It speaks only about the local fixity of the current episteme/publication path and its candidate space.
Closure Publication Package Discipline
Minimal closure package
A publishable CD claim should name what has narrowed:
- the rival routes or frames that remain live;
- the route, frame, or interpretation that is currently privileged or fixed;
- the guard,
governingPatternRef,authoritySourceRef, or policy that makes the narrowing binding; - the condition under which an admissible reopen or backoff would occur.
A bare claim such as "now settled" is insufficient when closure affects routing or authority.
Narrowing-source rule
Closure may rise because evidence eliminates rivals, governance temporarily binds a route, or protocol requires fixation under time pressure. State the source of narrowing because different sources imply different reopen expectations.
Partial-closure rule
Closure may be local rather than global. A note can be closed enough for one route while remaining open about broader explanation or classification; a prompt may be fixed enough to hold one question steady while still open enough that rival answers remain live. Publish that locality explicitly.
Retained and Withdrawn Authority Handling
Authority retention rule
If higher CD carried endpoint expectations, guard pressure, or route commitments, a later closure drop must say which consequences remain and which are withdrawn.
Admissible retreat record
An admissible retreat through reopen, sketchBackoff, or respecify should retain:
- the prior closure state;
- the reason the prior fixation no longer holds;
- the assumption or route being relaxed;
- the still-binding remainder, if any.
This prevents false continuity after retreat.
Closure versus obligation boundary
High CD may coexist with obligations, but CD is not itself an obligation-bearing governing FPF pattern or authoritySourceRef target. When prose treats "closed" as "must now be done", name the actual governingPatternRef or authoritySourceRef for that claim.
Review Matrix and Reopen Tests
Review matrix
A reviewer should ask:
- what was narrowed;
- by what
governingPatternRef,authoritySourceRef, or guard it was narrowed; - what would reopen it;
- whether any gate, release, work, evidence, assurance, policy, or adjudication authority survives the claimed closure level;
- whether the publication distinguishes local closure from whole-context finality.
False-finality test
Words such as "final", "settled", or "decided" should be challenged unless the route/guard package is explicit. Final-sounding rhetoric often overstates actual closure.
Cross-facet reminder
Low CD does not imply low articulation, low anchoring, or poor representation. Reviewers should not treat openness as low seriousness.
Split-closure review case
A publication may be closed enough for immediate local work use or reliance use while remaining open about broader explanation, long-horizon consequences, or alternative classification. Allow the split when locality is explicit; reject prose that advertises whole-case finality when only one language-state segment is fixed.
C.2.5:End
U.LanguageStateAnchoringMode
Type: Definitional (D) Status: Draft Normativity: Normative unless marked informative
Plain-name. Language-state anchoring mode.
Problem frame
Published position claims in the declared language-state chart over U.CharacteristicSpace differ not only by articulation and closure, but by how the governed U.Episteme in that claim is anchored to bodies, traces, model states, documents, or operator loops.
Problem
Without an explicit anchoring-mode declaration, embodiment and source anchoring are smuggled into informal prose or folded into representation terms. That undercuts cue comparison, undercuts bridge loss notes, and turns operator-facing language-state work into a special case with no explicit governing-pattern relation.
Forces
Solution
U.LanguageStateAnchoringMode is a nominal characteristic that states the primary anchoring regime of the governed U.Episteme named by the current position claim: bodily enactment, trace, model state, document, operator loop, or an explicit mixed regime. If source anchoring and current publication-face anchoring differ, both shall be distinguished rather than collapsed.
Starter family
Governing boundary
U.LanguageStateAnchoringMode is an anchoring-mode characteristic for one governed U.Episteme claim. It is not a representation factor bundle, closure state, truth status, evidence relation, source-currentness relation, work claim, gate claim, or reliance permission by itself. Model-latent, operator-loop, embodied, trace, and document-mediated cases name where the episteme is anchored for the current claim; any publication face, carrier, source-currentness, bridge-loss, work, evidence, or gate claim stays with the direct governing pattern.
If embodiment matters, it shall be declared here or immediately beside this characteristic rather than being hidden inside representation talk.
Mixed-mode rule
AM.Mixed is admissible only when the component modes are named explicitly. "Mixed" shall not be a lazy escape from deciding whether the key anchor is bodily, trace-based, model-latent, document-mediated, or operator-loop based.
Bridge implications
Bridge work over governed U.Episteme publications in the declared language-state chart should pay attention to anchoring shifts. A translation from AM.EmbodiedFelt to AM.DocumentMediated, or from AM.ModelLatent to prose, often requires explicit loss notes in F.9 and may require a bridge-use note in F.9.1.
Archetypal Grounding
Tell. A felt cue, a controller-side probe score, and a textual design note may all be early cues, but they are anchored differently.
Show (System). An alert tied to an operator console is AM.OperatorLoop, not just "text".
Show (Episteme). A model-probe cue grounded in latent state is AM.ModelLatent even if it is later paraphrased into prose.
Bias-Annotation
The pattern pushes authors to declare anchoring rather than hide it in metaphors such as "the system wants" or "the note suggests".
Conformance Checklist
CC-C.2.6-1Anchoring mode SHALL NOT be inferred from publication phrasing alone when it matters for source use, reliance, or bridge interpretation.CC-C.2.6-2Embodiment-sensitive or operator-loop cases SHOULD declare the embodiment or operator anchor explicitly.CC-C.2.6-3U.LanguageStateAnchoringModeMUST NOT be collapsed intoU.LanguageStateRepresentationFactorBundle.CC-C.2.6-4Mixed-mode declarations SHALL list their component modes explicitly.
Common Anti-Patterns and How to Avoid Them
- Text-only illusion. Treating every cue as document-mediated because it was written down later.
- Representation capture. Using symbolic/distributed labels to hide world-anchoring distinctions.
- Embodiment mystification. Treating bodily or operator-loop cues as beyond explicit publication.
Consequences
The benefit is cleaner reasoning about embodied, operator-facing, trace-based, and model-latent cues. The trade-off is more explicit declaration work and more explicit bridge loss notes when modes shift.
Rationale
The declared language-state chart over U.CharacteristicSpace needs one explicit anchoring basis slot so that A.16.0, A.16.1, B.4.1, and F.9.1 can refer to anchoring regime without redefining it.
SoTA-Echoing
The facet is motivated by embodied cognition, operator-facing interaction practice, active inference, and modern model-probing practice, all of which distinguish cue content from anchoring regime.
Relations
- Builds on:
A.18,C.2.2a,C.2.LS. - Coordinates with:
A.7,A.16.0,A.16,A.16.1,B.4.1,B.5.2.0,C.2.7,F.9.1. - Constrains: cue publication and bridge loss notes.
Worked Examples and Bridge-Loss Cases
Embodied-to-document shift
A bodily felt cue later published as prose usually changes from AM.EmbodiedFelt toward AM.DocumentMediated. That shift is not harmless; it often introduces bridge loss and should be treated as such when cross-context equivalence is claimed.
Model-latent to operator-loop case
A latent probe score may first be AM.ModelLatent, then later feed an operator-facing alert face where the working publication becomes AM.OperatorLoop. A conforming account should keep both anchoring modes visible rather than pretending the later publication wording fully captures the model-side cue.
Mixed-mode publication
An alert note may admissibly be AM.Mixed when it combines operator-loop anchoring, trace anchoring, and document mediation. But the mix must be named explicitly rather than used as a catch-all escape.
Authoring and Review Guidance
Author prompt
When declaring anchoring mode, ask:
- what is the primary anchor kind?
- does bodily or operator participation matter directly?
- is the key anchor trace-based, model-internal, or document-based?
- if multiple modes matter, which ones and why?
Review prompt
A reviewer should watch for the common mistake where later prose formatting tricks authors into forgetting the original anchoring mode.
Bridge note
If anchoring changes across publication or translation, F.9 and F.9.1 should often carry explicit loss or stance notes rather than silent equivalence language.
Extension and Migration Notes
Local extension rule
Contexts may add local anchoring modes, but they should do so by extension of the starter family rather than by collapsing the family into a text-vs-world binary.
Migration from metaphorical prose
Statements like "the system wants", "the note suggests", or "the operator-facing publication says" should be repaired by naming the actual anchoring mode and the actual detector/enactor or witness structure.
Boundary reminder
U.LanguageStateAnchoringMode does not decide representation, articulation, closure, or trust by itself. It only names how the episteme is anchored.
Anchoring Publication Package Discipline
Minimal anchoring package
A publishable U.LanguageStateAnchoringMode claim should normally identify:
- the primary anchor kind;
- any directly relevant embodiment, operator, trace, model, or document witness;
- the transformation chain if the current note is not at the original anchoring site;
- any secondary modes that remain load-bearing.
This is especially important when the final wording is prose, because prose often hides the anchoring regime.
Source-versus-face rule
Distinguish the anchoring mode of the source cue from the anchoring mode of the current publication face. A bodily cue later written into a document may still require AM.EmbodiedFelt as source mode and AM.DocumentMediated as publication face.
Mixed-mode decomposition rule
AM.Mixed is admissible only when its component modes are named and the reason for the mixture is operationally real. It must not become a convenience label for an episteme that has not yet been analyzed.
Anchoring Shift and Transport Discipline
Shift declaration rule
When an episteme crosses from one anchoring mode to another, state whether the shift is merely publication-level or whether it changes what can be preserved, compared, or trusted. A move from operator-loop enactment to report prose, for example, often drops timing, bodily load, and enactment friction.
Bridge-loss governing relation
If an anchoring shift matters across contexts, F.9 or F.9.1 should govern the loss or stance note. C.2.6 only requires the shift to be noticed and not misrepresented as lossless.
Same-content illusion test
Two cues may be paraphrased into the same sentence while remaining differently anchored. If the anchoring regime differs, the cues are not automatically substitutable.
Review Matrix and Extension Tests
Review matrix
A reviewer should ask:
- what the original anchoring regime was;
- what the current publication regime is;
- whether the transformation chain is explicit;
- whether any bridge loss or stance note is missing;
- whether a declared mixed mode is genuinely decomposed.
Local extension test
A new local anchoring mode is justified only when it answers a distinct anchoring question that the starter family cannot express without distortion.
Cross-facet reminder
Anchoring mode often correlates with representation and articulation changes, but it does not govern them. Reject prose that uses AM.ModelLatent, AM.EmbodiedFelt, or AM.OperatorLoop as shorthand for being vague, early, trustworthy, or closed.
C.2.6:End
U.LanguageStateRepresentationFactorBundle
Type: Definitional (D) Status: Draft Normativity: Normative unless marked informative
Plain-name. Language-state representation-factor bundle.
Problem frame
Published position claims in the declared language-state chart over U.CharacteristicSpace must distinguish representation factors such as locality, sparsity, and symbolicity without pretending they form one master factor.
Problem
Terms such as EncodingBasis collapse several independent choices. That makes comparison brittle and encourages one-factor stories such as distributed = informal or local = precise.
Forces
Solution
U.LanguageStateRepresentationFactorBundle is a factor bundle, not one scalar characteristic. The minimal core starter set is:
U.LocalityDistributionU.SparsityU.Symbolicity
A Context may publish a local alias such as EncodingBasis, but it shall dock back to the underlying factor bundle instead of replacing it.
Minimal factor readings
Non-collapse rules
LanguageStateRepresentationFactorBundle is not:
LanguageStateAnchoringMode;ArticulationExplicitness;LanguageStateClosureDegree;- evidence, source-currentness, publication authority, work permission, or gate readiness.
A representation may be distributed yet have high trace anchoring; symbolic yet low-articulation; sparse yet low-closure. Those combinations shall remain visible. A model-state, embedding, vector-store relation, or operator-facing publication face may fill one or more representation factors, but the factor bundle does not decide the episteme, carrier, evidence, bridge, work, or gate relation by itself.
Extension rule
Contexts may add extra representation factors only if the extension is published as a factor addition rather than as a new master factor that erases the core factor bundle.
Archetypal Grounding
Tell. A model-state cue can be highly distributed but still trace-anchored; a symbolic note can be low articulation if its semantics are still vague.
Show (System). An operator decision aid may mix sparse alert codes and symbolic method-description text.
Show (Episteme). A research probe can move from distributed activation patterns to sparse symbolic hypotheses without any one-step formality story.
Bias-Annotation
The pattern resists folk theories that try to line up one representation factor with one stage or progression story.
Conformance Checklist
CC-C.2.7-1LanguageStateRepresentationFactorBundleSHALL be published as a factor bundle, not as a hidden scalar.CC-C.2.7-2Local aliases such asEncodingBasisMAY exist only with an explicit docking to the governed factors.CC-C.2.7-3Representation factors MUST NOT silently replaceLanguageStateAnchoringModeorLanguageStateClosureDegree.CC-C.2.7-4New local factors SHALL preserve the factor-bundle discipline.
Common Anti-Patterns and How to Avoid Them
- One-factor myth. Treating distributed/local or symbolic/subsymbolic as the whole story.
- Progression collapse. Equating representation shifts with formalization or closure.
- Alias capture. Letting
EncodingBasisor a similar local alias erase the factor bundle.
Consequences
The benefit is cleaner comparison across schools, substrates, and publication forms. The trade-off is that representation talk becomes more explicit and less slogan-friendly.
Rationale
The factor-bundle design keeps the representation basis-slot family in the declared language-state chart over U.CharacteristicSpace orthogonal to articulation, closure, and anchoring.
SoTA-Echoing
This factorization fits current work on sparse distributed representations, hybrid symbolic/neuro-symbolic representation practices, and interpretability practice.
Relations
- Builds on:
A.18,C.2.2a,C.2.LS. - Coordinates with:
C.2.6,A.16.0,A.16,A.16.1,B.4.1,B.5.2.0,F.9.1. - Constrains: language-state position publication and bridge loss notes around representation shifts.
Worked Examples and Factor Interaction Notes
Distributed but explicit
A model-side summary may be representation-wise distributed and still highly explicit once published into a stable symbolic wrapper. This case matters because it blocks the folk myth that distributed implies vague.
Symbolic but still low-articulation
A glossary-like note may be fully symbolic while still low in AE because the semantic anchors are not yet stabilized. This blocks the opposite myth: symbolic therefore explicit.
Mixed representation publication
An operator-facing publication face may combine sparse alert codes, symbolic method-description text, and distributed back-end model summaries. The representation-factor bundle should make that mixture visible instead of compressing it into one label.
Authoring and Review Guidance
Author prompt
To publish a representation-factor bundle, ask separately:
- how local or distributed is the representation?
- how sparse or dense is it?
- how symbolic or subsymbolic is it?
- which additional factor, if any, genuinely matters enough to publish?
Review prompt
A reviewer should reject any attempt to use one factor as if it summarized the rest. The factor bundle exists precisely to block that reduction.
Cross-facet reminder
Reviewers should also watch for silent replacement of LanguageStateAnchoringMode, AE, or CD by representation talk.
Extension and Migration Notes
Local extension rule
Contexts may add extra factors, but each added factor should answer a distinct question rather than duplicating locality, sparsity, or symbolicity under another label.
Migration from alias-heavy prose
Aliases such as EncodingBasis or similar should be unfolded into explicit factor dockings before they are relied upon for comparison, bridge claims, or downstream use.
Boundary reminder
U.LanguageStateRepresentationFactorBundle describes representational organization only. It does not determine admissible use, closure, or anchoring by itself.
Factor-Bundle Publication Discipline
Minimal representation package
A publishable U.LanguageStateRepresentationFactorBundle should normally show the current factor settings for locality/distribution, sparsity/density, and symbolicity/subsymbolicity, together with any declared extra factor. If a factor is intentionally omitted, say so rather than hiding the omission under a compact alias.
No hidden scalar rule
Compact overlays such as "sparse-symbolic" are admissible only when they dock to the underlying factor bundle. No compact label may behave as a hidden master score for comparison, bridge comparison, or stage/progression talk.
Alias docking rule
Local aliases such as EncodingBasis are admissible only when their docking to the governed factors is explicit and stable. If an alias compresses several factors, the compression should remain visible.
Factor Interaction and Cross-Facet Reading Rule
Interaction rule
Representation factors may correlate, but they do not determine one another. Highly distributed cues can still be sparse; symbolic publications can still be locally dense; mixed symbolicity can coexist with either strong or weak articulation. Publish the actual factor bundle rather than narrating one factor as if it predicted the rest.
Cross-facet non-substitution
Representation talk must not silently replace AE, CD, or LanguageStateAnchoringMode. A shift from distributed to symbolic publication may change readability while leaving articulation low, closure open, or anchoring heavily operator-bound.
Bridge reminder
If a representation shift matters in transport across contexts, note that the shift may alter what is preserved or salient. The bridge itself remains governed by F.9 and F.9.1.
Review Matrix and Extension Tests
Review matrix
A reviewer should ask:
- are all claimed factors visible in the publication or cited source;
- does any alias hide the factor bundle;
- is one factor being used as if it summarized the whole representation state;
- has representation talk started to replace articulation, closure, or anchoring claims.
Local extension test
An additional factor is justified only if it captures a distinct representational question that cannot be reduced to locality, sparsity, or symbolicity. The extra factor should extend the bundle, not become a rival master factor.
Migration test for legacy terminology
Legacy vocabularies often use "symbolic", "distributed", or "encoding basis" as if one term solved the whole classification problem. A conforming migration unpacks the term into explicit factor dockings and then checks whether any cross-facet claims were smuggled into the old label.
Bundle-comparison reminder
Representation bundles may be compared across contexts only after the compared factors are explicit. If one context uses a compact local alias and another publishes the full factor bundle, require explicit docking before treating the two descriptions as commensurable.
C.2.7:End
Declarative Representation Precision Restoration
Type: C.2.P precision-restoration child pattern for declarative-representation overread Status: Stable Normativity: Normative unless a section is explicitly informative
Use this when
Use this pattern when a declarative representation is about to guide action, reliance, gate, release, evidence, method, mechanism, work, or pattern-application claims by its shape alone.
First useful move. Fill one compact DeclarativeRepresentationRepair note: encountered representation; representation kind; represented EntityOfConcern or claim; current source or publication relation; tempting imperative overread; recovered governing pattern; retained use; blocked overread; and stop or reopen condition.
Quick example. A heat-flow graph in a reactor-cooling review can show preserved and lost flow relations. It does not authorize a valve change by graph shape. The repair keeps the graph path as graph structure, returns release or gate reliance to the gate, source, and evidence patterns, and blocks the hidden work-permission claim.
Use this pattern especially when:
- a graph path,
PathSlice, flow valuation, transformation-flow structure line, or graph expression over such a structure is overread as a prescribed work route or workflow; - an
A.10evidence path is overread as approval, permission, release, gate passage, or assurance; - a query, access path, query plan, table, dashboard, schema, checklist predicate, or API description is overread as method, work plan, performed work, gate, permission, or proof;
- a publication face, source-chain relation, carrier file path, mathematical representation, method-description representation, or FPF pattern relation is overread as call, dispatch, invocation, send, receive, route, or pattern application;
- method-like wording hides whether the current claim concerns
U.Method,U.MethodDescription, formal substrate, mathematical-lens use,U.Mechanism,U.WorkPlan, datedU.Work, evidence relation, source relation, or quote-only source wording.
What goes wrong if missed. The representation appears to do work it cannot do. A path "routes" a decision, a query "calls" a pattern, a dashboard "authorizes" release, a checklist predicate "runs" a process, an evidence path "permits" action, or a program-looking text becomes "the method" without recovering method semantics, method description, formal substrate, mechanism, work plan, work, evidence, or source-use relation.
What this buys. The working reader keeps the representation useful without making it magical. Graph paths remain graph paths, evidence paths remain evidence paths or provenance paths, queries remain representations, pattern relations remain declarative relations, and method-like wording is assigned to the current ontic slot, relation position, use relation, claim kind, or governing pattern named by value before it guides work, evidence, gate, release, assurance, or method claims.
Not this pattern when.
- If the graph path,
PathSlice, or flow valuation is already current as graph structure, useE.18directly. - If the evidence relation or provenance relation for a claim is already current, use
A.10directly. - If the publication face or source-use relation is already current, use
E.17,E.17.EFP,C.2.P, or the direct publication pattern. - If the current claim concerns a semantic way of doing, use
A.3.1; if it concerns the description of that way, useA.3.2. - If the current claim concerns operation algebra, laws, admissibility predicates, transport, audit, or governing-definition assignment, use
A.6.1orE.20. - If the current claim concerns planned work or dated work, use
A.15.2orA.15.1. - If the word is only quoted source wording or ordinary navigation prose with no FPF-governed claim, keep it quote-only or ordinary.
Problem frame
FPF uses many declarative representations: graphs, paths, characteristic spaces, predicates, tables, dashboards, publication faces, evidence paths, formal substrates, method descriptions, source-chain relations, and pattern relations. They are valuable because they expose structure without requiring the reader to imagine an action sequence.
The recurring failure is a category shift. Because some representations look like paths, pipelines, calls, dispatches, states, gates, or control programs, the prose starts granting them operational effects. A representation then seems to authorize work, pass a gate, enact a method, prove a result, release a system, or select a pattern by its shape alone.
This pattern repairs that shift. It does not build a general theory of representation. It only restores the FPF kind and governing pattern for declarative representations that are overread as imperative or operational claims.
Problem
Without this repair:
- Graph path becomes work route. A path or path slice in
E.18is treated as an ordered work narrative, even when no work occurrence, work plan, or method description is current. - Evidence path becomes permission. An evidence relation or provenance relation is treated as approval, gate passage, release, safety, or authority rather than as evidence for a named claim or effect.
- Query becomes method. A query, access path, query plan, or dashboard is treated as the semantic way of doing, rather than as a representation, method description, evidence relation, source relation, or ordinary source wording.
- Pattern relation overread as dispatch. Pattern application prose starts saying that one pattern exits to, routes to, calls, invokes, receives, owns, or dispatches another, hiding declarative pattern relations and direct governing-pattern selection.
- Programming-paradigm label becomes ontology. Imperative, functional, logical, constraint, object-centric event, effect-handler, pipeline, orchestration, or workflow wording is treated as the FPF kind rather than as one representation style or source label.
- Mechanism, method, and work collapse. A method-like expression is repaired to
methodormechanismby vocabulary rather than by the current claim: way of doing, description, formal substrate, law-governed mechanism, plan, occurrence, evidence, or quote-only wording.
Forces
Solution
Repair declarative-representation overread by recovering representation use, then naming the direct governing pattern for the current claim.
The repair order is:
- Name the encountered representation. Quote or identify the graph, path, query, predicate, dashboard, table, publication face, evidence path, source-chain relation, carrier path, mathematical representation, method-description representation, or pattern relation.
- Name the representation kind. State whether it is graph structure, flow valuation, evidence relation, provenance relation, state predicate, query, table, publication face, formal substrate, method description, source relation, carrier syntax, or another representation kind named by value.
- Name the represented EntityOfConcern or claim. State what the representation is about: claim, effect, method, work occurrence, work plan, graph object, state, EntityOfConcern, publication, evidence relation, gate, source relation, or pattern relation.
- Recover source or publication relation when current. If the representation is a face, source chain, generated explanation, copied text, dashboard, file path, or publication unit, use the publication pattern or source-use pattern governing that relation.
- Name the tempting imperative overread. Say what the representation is being asked to do by resemblance: route, call, dispatch, invoke, run, flow, send, receive, authorize, release, prove, prescribe, execute, select, pass a gate, or record work.
- Select the governing pattern. Use the direct pattern when the kind is already recovered; otherwise use this pattern only long enough to recover the representation use and blocked overread.
- State retained use. Keep the weaker useful use: graph structure, evidence relation, source-finding, state predicate, publication face, method-description representation, formal-substrate input, method slot candidate, or pattern relation.
- State blocked overread. Block only the stronger claim that is not recoverable.
- Stop or reopen. Stop when the governing pattern can carry the next claim. Before stopping, ask what claim, evidence relation, gate relation, safety relation, method relation, work relation, or source relation would become less reviewable if the visible representation were accepted as the stronger claim. Reopen if a later source changes representation kind, represented EntityOfConcern, source currentness, governing pattern, or the intended use.
DeclarativeRepresentationRepair note
Use this compact note when the wording has FPF-governed use:
The note records the local repair long enough to make the next governing pattern selectable. If the direct governing pattern already supplies a better record, use that record and keep only the repaired wording, retained use, blocked overread, and stop or reopen condition here.
Direct governing-pattern selection
Legitimate path and route settlement
path is not banned.
A.10 evidence path for <claim, effect, or use> is legitimate when the evidence relation or provenance relation for the named claim, effect, or reliance use is current. E.18 graph path and PathSlice are legitimate when the graph object, path, slice, crossing, or flow valuation is current. Carrier file paths, URLs, mathematical paths, and quoted source paths are legitimate when their notation, source-use function, or use relation is current.
The defect is not the word. The defect is hidden ontology: the sentence treats a representation as if something literally ran, flowed, executed, authorized, released, proved, selected, or prescribed action without the governing kind named by value.
Method, algorithm, mechanism, and work-slot settlement
Do not repair algorithm, program, solver, proof, recipe, method, workflow, process, procedure, access path, query plan, or control strategy by choosing one fashionable replacement.
Recover the current ontic slot, relation position, use relation, or claim kind:
When the source label hides method, mechanism, formal-substrate, work, evidence, gate, result, or temporal assignments, use E.10.ARCH:3.1 to recover the project concern and the current relation position. For this host, recover only the representation overread and the direct governing pattern for the current claim; linked typed values remain under their own governing patterns rather than becoming one representation-repair claim.
Programming-paradigm and process-model settlement
Imperative, functional, logical, constraint, object-centric event, effect-handler, pipeline, orchestration, Declare-style, SQL-like, e-graph, hypergraph, or process-mining wording is a cue to recover representation kind and FPF slot. It is not a decision procedure by itself.
Current practice makes the old contrast between imperative and declarative labels too weak as a final ontology:
- constructor and process-theory lines keep computation, information, dynamics, and procedure close to possible or impossible transformations and compositional realization;
- scoped effects and handlers separate operation syntax, semantic handling, scopes, resources, equations, type information, and effect information;
- Declare-style process models and object-centric event logs distinguish constraints, events, objects, relations, ingestion, transformation, storage, and analysis;
- e-graph and monoidal-rewriting work shows that computation or process representation may be equivalence or composition structure rather than instruction order.
Use those lines as guardrails: recover the FPF kind and slot instead of replacing one programming-paradigm label with another.
Worked slices
Graph path in a transformation-flow structure
Wording: "The P2W path routes the team from principle to work."
Repair:
Evidence path near release
Wording: "The evidence path authorizes release."
Repair: A.10 can state an evidence path for the claim or effect. Release, permission, or gate passage requires the authority, gate, or release pattern that governs that claim. This pattern is used only if path wording itself is causing the representation to be overread as a permission route.
Query plan and access path
Wording: "The query plan calls the production work sequence."
Repair: recover whether the query plan is an optimizer representation, method description, formal substrate, source cue, evidence relation, work plan, or actual work trace. If it only represents query evaluation choices, do not treat it as U.WorkPlan or U.Work. If the current claim concerns method semantics, use A.3.1; if it concerns a method description, use A.3.2; if it concerns a performed query run, use A.15.1 and the evidence pattern or source-use pattern.
Dashboard predicate
Wording: "The dashboard green path lets the release move."
Repair: recover dashboard face, source relation, status or state bearer, value frame, source currentness, and gate or release claim. The dashboard may be a publication face and source cue; it is not release permission unless the gate or authority pattern consumes the source and states that effect.
Pattern relation
Wording: "This pattern exits to A.10."
Repair: if the current relation is "use A.10 when an evidence relation or provenance relation is current", write that declarative boundary. Do not use exit, receiver, route, owner, home, dispatch, or call language unless the pattern is actually about an action occurrence, work plan, control mechanism, or communication relation that has those semantics.
Solver algorithm
Wording: "The solver algorithm is the mechanism."
Repair: recover the current ontic slot, relation position, use relation, or claim kind. The solver configuration may be U.MethodDescription; the accepted semantic way of solving may be U.Method; the MILP formulation may expose formal substrate and mathematical-lens use; a reusable operation algebra with laws and admissibility predicates may be U.Mechanism; a solver run may be U.Work; a run result may be evidence for another claim. Select A.6.1 and E.20 only when mechanism fields are present in the current claim.
Reactor-cooling flow graph
Wording: "The preserved heat-flow path authorizes the valve change."
Repair:
CRISPR guide-selection table
Wording: "The guide-selection table approves the edit."
Repair:
Conformance checklist
Common anti-patterns
Relations
- Builds on:
E.10,E.10.ARCH,C.2.P,A.7,E.17,E.8, andF.19. - Coordinates with:
E.18,E.18.1,A.10,A.19.SPR,A.3.1,A.3.2,A.6.0,C.29,A.6.1,E.20,A.15.2,A.15.1,A.15.4,A.20,A.21,B.3, and direct publication, gate, authority, release, evidence, method, work, and assurance patterns when those claims are being made. - Specializes:
C.2.Pfor one recurring case: declarative representation and imperative-metaphor overread. - Used by:
E.10.ARCHapplicability-row distribution and full-pattern text precision restoration when route, path, workflow, call, or dispatch wording hides representation use.
Consequences
- FPF can keep useful graph, path, query, table, dashboard, publication, and pattern-relation vocabulary without banning ordinary words.
- The repair blocks hidden authority, release, gate, evidence, method, mechanism, work, and pattern-dispatch claims by requiring the governing pattern named by value.
- Method and mechanism claims become easier to compose because
E.10.ARCH:3.1can link separately recovered typed values through relation-position discipline without treating slot-position labels as alternate ontology. - The cost is a small recovery note when representation wording is actually carrying FPF-governed use. Ordinary navigation, source quotation, and already-governed graph or evidence paths do not need the note.
SoTA-Echoing
This pattern uses external sources only for the representation-overread repair question. They do not replace FPF ontology, and older famous sources are lineage or contrast unless a current source below supplies the contemporary payload.
C.2.P.DR:End
Kinds, Intent/Extent, and Typed Reasoning (Kind‑CAL)
One‑line summary. Establishes
U.Kindas the minimal, context‑local intensional carrier of “what a statement is about,” separates intent (KindSignature + its own F) from extent (which instances belong to the kind in a given Context slice), and situates typed reasoning alongside USM Scope (G) and F–G–R without conflation. Details of the core objects and operations live in C.3.1–C.3.5; guard shapes are standardized in C.3.A.
Status. Normative in Part C. Identifier C.3. This pattern lays the architectural invariant and manager‑level guidance. The mechanics are defined by its child patterns.
Readers. Engineering managers, architects, and assurance leads who must reason about typed claims across Contexts without mixing up entityOfConcern (Kinds), applicability (G), and assurance (R).
Depends on.
— A.2.6 USM (Context slices & Scopes): U.ClaimScope = G, U.WorkScope, ∈/∩/SpanUnion/translate, Γ_time policy, Bridges + CL (scope).
— C.2.2 F–G–R: weakest‑link composition; penalties to R for Cross‑context congruence (CL).
— C.2.3 Unified Formality F: F0…F9 as an ordinal Characteristic (expression rigor).
Sub‑patterns (normative unless noted).
— C.3.1 - U.Kind & U.SubkindOf (partial order).
— C.3.2 - KindSignature (intent, with F) & Extension/MemberOf (extent in a slice).
— C.3.3 - KindBridge & CL^k (type‑congruence; penalties route to R).
— C.3.4 - RoleMask (context‑local adaptation without cloning kinds).
— C.3.5 - KindAT (K0…K3, informative facet, not a Characteristic).
— C.3.A - Typed Guard Macros (annex): admit/compose, masks, Cross‑context reuse; AT is forbidden in guards.
Deprecations.
— “Generality ladder” for G; G is Scope only (set‑valued over U.ContextSlice).
— Any “Kind scope” characteristic (Kinds carry intent/extent, not Scope).
— Mark as legacy any uses of ‘validity’ as a Characteristic or ‘operation’ as a Scope‑like Characteristic; redirect to U.ClaimScope / U.WorkScope (A.2.6) for applicability. Editors SHOULD add glossary redirects in Part E.
Editorial note (cut‑over). Content formerly in C.3 that defined guard shapes, decision trees, and macro anti‑patterns now resides in C.3.A. Membership evaluation obligations live in C.3.2 with MemberOf.
Purpose & Rationale
What you get.
- A neutral typed layer: name what a claim quantifies over (Kinds) without binding to any particular “type technology” (OWL, PL types, shapes…).
- A clean split of characteristics: – Scope (G) = where a claim holds (USM, set‑valued over Context slices). – Kind extent = which instances belong to a kind inside a given slice. – F = how strictly content is expressed (C.2.3). – R = how well supported (evidence & congruence penalties).
- Typed reuse across Contexts: a dedicated KindBridge with
CL^k(type‑congruence), so you can predict risk without touching F or G. - Manager‑oriented maps: when to invest in formalization (F), when to expand/narrow Scope (ΔG), when to test across subkinds (R), and what kind of bridge you should expect.
Why it helps. Teams routinely overspend on proofs for instance‑level questions and underspecify scope for class‑level claims. By naming the Kind, you plan ΔF/ΔR correctly and keep G honest. Typed checks also block unsafe compositions (“we were talking about different things”).
Context
Cross‑disciplinary work mixes artifacts that look like “types” but behave differently: ontology classes, schema “shapes,” programming types, BORO super/sub categories, ad‑hoc labels. At the same time, USM made “scope” precise. What was missing was a small, neutral notion of entityOfConcern that (a) does not re‑invent a global “type system,” (b) composes with USM and F–G–R, and (c) lets Contexts keep their idioms—with bridges when crossing boundaries.
Problem
- Scope–type conflation. Authors try to widen G by “abstracting the wording,” yielding claims that sound general but are only supported on a thin slice.
- Silent drift across Contexts. A “vehicle” here is not the same as a “transport unit” there; reuse proceeds without a declared mapping or risk accounting.
- Wasteful planning. Without a signal about the kind‑level, teams either over‑formalize single‑slice decisions or under‑test class‑level claims (no variant coverage along subkinds).
- Unsafe composition. Claims about incompatible “things” get composed because the entityOfConcern was implicit in prose.
Forces
Solution — Architectural Decisions (overview)
C.3‑D1 — U.Kind is intensional and context‑local.
Kinds name what a claim quantifies over. They form a partial order ⊑ (SubkindOf). (See C.3.1.)
C.3‑D2 — Separate intent and extent.
— KindSignature(k): the intensional content (predicates/invariants/Standards). It carries its own F (C.2.3).
— Extension(k, slice)/MemberOf: which instances belong to k in a given U.ContextSlice. (See C.3.2.)
C.3‑D3 — Kinds do not carry Scope. Scope lives with claims/capabilities (USM): a set of Context slices where the statement holds. Kinds carry intent/extent only. (USM A.2.6 + C.3.2.)
C.3‑D4 — Typed reuse across Contexts is explicit.
Use a KindBridge with CL^k (type‑congruence) and loss notes. Its effect is only via R penalties; F/G remain unchanged. (See C.3.3.)
C.3‑D5 — Local adaptation without cloning. Use a RoleMask to bind a kind to Context‑specific constraints/aliases; promote to a subkind if the mask becomes stable and widely reused. (See C.3.4.)
C.3‑D6 — An informative “abstraction tier” exists for Kinds (AT: K0…K3). A facet (not a Characteristic) that helps plan ΔF/ΔR and forecast bridge style; AT never appears in guards. (See C.3.5.)
C.3‑D7 — Guard shapes are standardized and fail‑closed.
Typed compatibility first (same‑Context ⊑ or KindBridge), then Scope coverage (USM), then R penalties and freshness. (See C.3.A.)
Manager’s picture — one claim-scope object and one kind-extent relation (keep them separate). – Claim scope (USM, G): Where the claim holds → set of Context slices; composed by membership / intersection / SpanUnion across independent lines / translate. – Kind extent relation: Which instances in a given slice belong to the kind →
MemberOf(e, k, slice). Never “widen G” by abstract wording; widen only by ΔG with support.
Core Concepts (informative summary; authoritative norms live in C.3.1–C.3.5)
This section fixes the Standard of terms used in C.3 and points to the sub‑patterns for complete mechanics. All “SHALL/MUST” statements here are normative.
Editorial note. This section is informative. It restates manager-level takeaways and points to the canonical, normative rules in C.3.1-C.3.5. Where this section summarizes a rule, treat the cited sub-pattern and rule ID as the governing source.
U.Kind & U.SubkindOf (⊑)
Definition. U.Kind is a context-local kind record naming a “kind of thing” that claims may quantify over.
Order. U.SubkindOf (⊑) is a partial order (reflexive, transitive, antisymmetric). We write k₁ ⊑ k₂.
Summary of norms (authoritative text: C.3.1 K‑01–K‑02).
— Contexts treat ⊑ as a partial order and document any computed meets/joins if they provide them.
— Kinds do not carry Scope; Scope remains on claims/capabilities (USM).
Full treatment: C.3.1 (definitions, invariants, examples).
KindSignature (intent) & F
Definition. KindSignature(k) is the intent: predicates/invariants/Standards that define the kind in the Context. Its expression rigor has an explicit U.Formality (C.2.3).
Summary of norms (authoritative text: C.3.2 K‑03–K‑04).
— KindSignature(k) declares its F (C.2.3). Claim‑level F does not auto‑inherit; weakest‑link applies on the claim’s own support paths.
— If a signature change alters membership, treat it as a content change (Contexts may version kinds).
Full treatment: C.3.2 (signature/intent with F; relation to claims).
Extension & MemberOf (extent in a slice)
Definition. Extension(k, slice) ⊆ EntitySet(slice) = set of instances that belong to k in the given U.ContextSlice. MemberOf(e, k, slice) is the membership predicate: e ∈ Extension(k, slice).
Summary of norms (authoritative text: C.3.2 K‑05–K‑08).
— Membership is deterministic for a fixed (k, slice) (no hidden “latest”).
— If k₁ ⊑ k₂, then Extension(k₁,slice) ⊆ Extension(k₂,slice) for all slices.
— Definedness may be bounded; outside it, guards fail closed.
— Keep Scope (G) and MemberOf as distinct guard predicates.
Full treatment: C.3.2 (extent semantics, examples, authoring hints).
KindBridge & CL^k (type‑congruence)
Summary of norms (authoritative text: C.3.3 KB‑01–KB‑12).
— A KindBridge states Contexts/versions, kind mapping/rules, preserved order links, CL^k anchors, loss notes, and definedness.
— No inversions of preserved subkind links; collapses must be declared.
— When classification depends on a KindBridge, apply a monotone penalty Ψ(CL^k) to R (scope‑bridge Φ(CL) applies separately). F and G remain unchanged.
— Chaining uses weakest‑link on CL^k.
Full treatment: C.3.3 (bridge shape, anchors, examples).
RoleMask (adaptation without cloning)
Definition. U.RoleMask(kind, Context) is a named binding that carries constraints (optional narrowing of membership), vocabulary/notation aliases, and intended use for local procedures—without creating a new Kind.
Summary of norms (authoritative text: C.3.4 RM‑01–RM‑08).
— Masks are registered/versioned; constraints are observable/deterministic at guard time.
— Do not treat masks as kind synonyms; promote frequently reused constraint masks to explicit subkinds (⊑).
Full treatment: C.3.4 (mask taxonomy, guard discipline, promotion rule).
KindAT (K0…K3) — informative facet
Status. A facet attached to U.Kind, not a Characteristic: no algebra, never used in guards or composition.
Anchors (intentional view). K0 Instance; K1 Behavioral pattern; K2 Formal kind/class; K3 Up‑to‑Iso.
Use. Helps plan ΔF/ΔR and forecast bridge style (e.g., K3↔K3 suggests up‑to‑iso mapping). Do not conflate AT with G or R.
Full treatment: C.3.5 (manager heuristics, anti‑misuse).
Quick examples (two‑characteristic awareness)
E‑Sketch 1 — Policy over Vehicle.
Claim: “For all x ∈ Vehicle: brakeDistance(x) ≤ 50 m (dry), ≤ 40 m (wet).”
– entityOfConcern: Vehicle (Kind, typically K2) — what we quantify over.
– Scope (G): {surface∈{dry,wet}, speed≤50, rig=v3, Γ_time=rolling 180d} — where the claim holds.
– Extent in slice: which instances the lab currently classifies as Vehicle (via MemberOf).
Typed checks happen before Scope intersection; G is not widened by “abstract wording.”
E‑Sketch 2 — API rule over AuthenticatedRequest.
Producer A emits Request; consumer B expects AuthenticatedRequest.
– If Request ⊑ AuthenticatedRequest does not hold, add an adapter or adopt a subkind; do not force fit by widening G.
– Scope remains independent (API version, Γ_time policy); evidence/freshness sits in R.
How to use typed reasoning
C.3:7.1 How typed reasoning plugs into F–G–R & USM
The basic shape of a typed claim (manager view)
A typed claim has two independent parts:
-
entityOfConcern (Kind). Which things the statement talks about. “For every item of kind k in the target context (the selected TargetSlice) …”. — The definition of kind k lives in KindSignature(k) (with its F, C.3.2). — Which items count as “k” is evaluated in the TargetSlice (C.3.2) by a deterministic membership check.
-
Applicability (Scope, G). Where the statement holds.
U.ClaimScope(Claim)is the collection of contexts where the claim is valid (USM A.2.6). Guards test: “Scope covers the TargetSlice”.
Discipline. The guard first checks typed compatibility (in the same Context: “is‑a / subkind‑of”; across Contexts: a KindBridge, C.3.3), then Scope coverage (USM), then R freshness and any bridge congruence penalties. See C.3.A Guard_TypedClaim.
Composition of typed claims
Rule C‑T‑1 (typed pre‑check). To compose a producer claim with a consumer claim, where the producer quantifies over kind k (source) and the consumer expects kind k (expected):
-
same Context: require “is‑a / subkind‑of” to hold (the source kind is a subkind of the expected kind) (C.3.1).
-
Cross‑context: require a KindBridge that maps the source kind to a local kind that is a subkind of the expected kind in the target Context (C.3.3). If neither holds, the composition is unsafe; introduce a subkind, add an adapter (or a RoleMask), or decline.
-
Role‑aware option (same Context): if the consumer expects a RoleMask over the expected kind, you may satisfy the mask’s explicit constraints (C.3.4) instead of changing kinds, provided those constraints are observable at gate time.
Rule C‑T‑2 (scope after type). After typed compatibility is satisfied, compute Scope as in USM:
- Serial path: take the intersection of the contributors’ claim scopes.
- Parallel independent lines: use SpanUnion of the serial scopes (only if independence is justified).
Rule C‑T‑3 (no type‑by‑scope). A kind mismatch MUST NOT be “fixed” by widening G. Changes in entityOfConcern require subkind introduction, signature edits, or a KindBridge—not a scope change.
Manager hint. First confirm the port shape matches (kinds line up), then check the operating area (scope), and finally look at confidence (evidence freshness plus any bridge congruence penalties).
F–G–R with typed claims (what changes, what doesn’t)
-
F (Formality). – Claim‑level F follows C.2.3 (weakest‑link along the claim’s support paths). – KindSignature F is declared on the kind (C.3.2) and influences claims only if the claim essentially depends on those predicates (weakest‑link again). – Raising F can reveal hidden assumptions (which may trigger ΔG in the claim), but does not change G by itself.
-
G (Scope). – Always set‑valued over Context slices (USM A.2.6). – Typed reasoning does not alter G’s algebra (∈/∩/SpanUnion/translate). – Never infer Scope from “how general the wording sounds.”
-
R (Reliability). – Evidence freshness/decay (validation windows) remains separate from Scope coverage. – Cross‑context penalties split cleanly: a scope‑bridge penalty (USM) and a kind‑bridge penalty (C.3.3). Both reduce R only; neither changes F or G.
Manager rule of thumb. Start with the reliability from your support; then apply the scope‑bridge penalty; then apply the kind‑bridge penalty. Each step can only reduce reliability. You never add or average F/G: you compose scope per USM rules and apply weakest‑link for F/R along support paths.
ESG gating with typed claims
- Gate on F, if your Context requires rigor before use (e.g.,
U.Formality(Claim) ≥ F4). - Gate on Scope coverage (USM) and an explicit time selector (Γ_time) policy.
- Gate on R freshness and minimum congruence for bridges (e.g.,
CL ≥ 2,CL^k ≥ 2). - Do not gate on AT (C.3.5); it is an informative facet only.
- Use C.3.A guard macros to keep guards short and auditable.
How typed reasoning plugs into the CAL chain (Lang‑CHR → Role‑CAL)
Intent. Show a clear, end‑to‑end path a manager can follow to take a typed claim from words to safe reuse across Contexts—without any tool or data‑governance assumptions. Each stage says what it supplies, what it needs, and what it hands off to the next stage.
Lang‑CHR — stable words first
What it supplies. A disciplined vocabulary and controlled phrasing so that terms like Vehicle, AuthenticatedRequest, AdultPatient have one meaning in the Context.
What it requires. Authors use controlled narrative (C.2.3 F3) at minimum: single‑meaning terms, explicit “shall / if / then”, and no drifting synonyms.
Hand‑off. A small, curated lexicon entry for each candidate Kind‑word; these become U.Kind names in the next step.
Manager hint. If two teams cannot agree on the noun, you are not ready to type the claim. Resolve the noun in Lang‑CHR before introducing a Kind.
Kind‑CAL (this Part) — name the entityOfConcern
What it supplies.
• U.Kind objects for those nouns; a partial order ⊑ (subkind‑of).
• KindSignature(k) (intent), with declared F.
• Extension(k, slice) and MemberOf(e,k,slice) (extent).
• (Optional) AT (K0…K3) as an informative facet.
What it requires. • Deterministic membership (no “latest” defaults) and a clear rule for where membership is defined in each context. • No “Kind scope”: Scope remains with claims/capabilities (USM).
Manager hint. Use the kind’s AT tag only as a planning signal (where to invest rigor and tests). AT never gates decisions and never widens scope.
Hand‑off. Typed quantifier sites for claims: “∀ x ∈ Extension(k, slice) …”, plus a visible ⊑ lattice for compatibility checks down the line. Typed claim sites written in Plain language: “for every item of kind k in the target context …”, plus a visible subkind‑of lattice for compatibility checks down the line.
Manager hint. Decide early whether your Kind is K0 (instance‑ish) or K2 (formal class). It sets your ΔF/ΔR budget expectations.
Structure‑CAL — give Kinds usable shape
What it supplies. Structural building blocks on Kinds: • combinations (“and”), • alternatives (“either/or”), • records (named fields), • functions (inputs to outputs), plus relations like has‑attribute and part‑kind, and the minimal invariants those structures must respect.
What it requires. • Do not hide Scope inside structure. • Put structural rules into the KindSignature as checkable statements (ideally F4+).
Hand‑off. Typed ports and shapes of claims/specifications (“this policy expects PassengerCar × ControllerConfig”), making compatibility checks crisp before any Scope math.
Manager hint. If two claims expect different shapes (for example, one needs “Vehicle with ABS”, the other just “Vehicle”), plan a subkind or an adapter. Do not “solve” it by rewording the claim.
Note (informative). If a Context declares structural constructors on kinds (e.g., product/sum/record/function), editors SHOULD document the corresponding Extension inclusion laws for those constructors. Keep Scope in USM; do not hide it in structure.
Compose‑CAL — compose with typed pre‑checks
What it supplies. The order of checks you must follow for safe composition:
- Typed compatibility: in the same Context, the producer’s kind is a subkind of the consumer’s kind; across Contexts, a KindBridge maps the producer’s kind to a local kind that fits, with an acceptable kind‑bridge congruence level (C.3.3).
- Scope checks (USM): along dependency paths, take the intersection of scopes; use SpanUnion only when support lines are truly independent.
- Assurance wiring: apply the scope‑bridge penalty and the kind‑bridge penalty to R; check evidence freshness separately.
What it requires. Independence justification for SpanUnion; no “type‑by‑scope” fixes.
Hand‑off. A typed, scope‑checked composition that survives audit because each risk is accounted for in R.
Manager hint. Run the typed pre‑check first. It is the cheapest failure to catch and prevents “scope gymnastics” that mask a type mismatch.
CT2R‑LOG — speak the logic, keep the math honest
What it supplies. • A clear logical reading of your typed claim: “for every item of kind K, condition φ holds” (or “there exists an item …”). • Rules for refinement and substitution that respect the subkind‑of relation. • When appropriate (K3), reasoning that treats structures as equivalent up to isomorphism (useful where exact identity is the wrong notion).
What it requires. • Pick a logic that matches the Formality you declare (e.g., machine‑checked logic for higher F). • When the logic travels across Contexts, use a KindBridge to keep meaning aligned; any mismatch is reflected as a kind‑bridge penalty in R.
Hand‑off. Proof obligations or reasoning templates that are consistent with your Kind/Structure setup and do not alter G. Shall‑note CT2R‑1. Transferring typed formulas that depend on MemberOf across Contexts uses a KindBridge; any mismatch is accounted as Ψ(CL^k) in R. F and G remain unchanged. For up‑to‑iso situations, see C.3.5 (AT) for when K3 is appropriate.
Manager hint. If your proof keeps failing when you move between Contexts, add a bridge at the Kind level; do not try to “fix” it by changing scope.
Role‑CAL — adapt without cloning
What it supplies. RoleMask(kind, Context): a named, registered adaptation (extra constraints or local aliases, with optional narrowing) that reuses the same kind instead of creating a new one.
What it requires. • Constraints must be testable at gate time and give deterministic answers. • If a constraint mask is reused often, promote it to a subkind.
Hand‑off. Context‑specific views that keep identity intact and make typed guards practical (“use PaymentAccount@PCI mask in these steps”).
Manager hint. If the same mask appears in several guards, promote it to a subkind. This reduces future bridge and audit effort.
Mini end‑to‑end example (manager‑oriented)
Scenario. A risk gate for API requests must be reused by another program across Contexts.
Lang‑CHR. Settle on Request, AuthenticatedRequest, RiskScore, BudgetSlack; write them in controlled phrases (F3).
Kind‑CAL.
• Define Kind Request (K2) and a subkind AuthenticatedRequest ⊑ Request; publish a KindBridge for the PCI taxonomy with kind‑bridge congruence level 2 (loss note: token class is collapsed).
• Membership MemberOf(e, AuthenticatedRequest, slice) is deterministic under API v2.3 and Γ_time policy.
Structure‑CAL.
• AuthenticatedRequest is a record kind with fields (headers, tokenProof, body); invariants relate tokenProof to headers.
Compose‑CAL.
• Policy P says in Plain terms: “for every AuthenticatedRequest in the target context, deny the call when riskScore is at or above the set risk threshold and budgetSlack is at or below the set budget limit.”
• Another service S expects PCIRequest. Typed pre‑check: does AuthenticatedRequest ⊑ PCIRequest? No.
• Remedy: adapter A proves AuthenticatedRequest → PCIRequest in this Context; if reusing across Contexts, publish a KindBridge for the PCI taxonomy with CL^k=2 (loss: token class collapsed).
CT2R‑LOG. • State P in a state P in a proof‑checked logic (where appropriate for F7+), so that changes to token rules break proofs. Proofs rely on the AuthenticatedRequest definition, not on the consumer’s scope.
Role‑CAL.
• Register a RoleMask over PCIRequest for the consuming team; guards must be able to test the mask’s constraints at gate time.
Outcome. • Typed guard approves only when: (i) the type pre‑check passes (same‑Context subkind‑of or a KindBridge with an acceptable congruence level), (ii) Scope covers the target context (API v2.3, explicit time selector), and (iii) R reflects the scope‑bridge and kind‑bridge penalties and evidence is fresh. • No one widened Scope to hide a type mismatch; the adapter + bridge made the semantics explicit and auditable.
Takeaway. If you keep these six hand‑offs in view—words → kinds → structure → composition → logic → roles—you get predictable reviews, clean risk accounting, and reusable claims that travel across Contexts without silent meaning drift.
Compliance & Regulatory Alignment — profile
Treat regulatory categories as Kinds, carry their intent in KindSignature with declared F, move them across Contexts with a KindBridge (type‑congruence CL^k + loss notes), and express applicability as Claim scope over U.ContextSlice (with explicit Γ_time). Any Cross‑context uncertainty is routed to R via Ψ(CL^k) (kind) and Φ(CL) (scope); F and G remain unchanged.
Authoritative obligations and guard macros (C‑REG‑1…8, Guard_RegAdopt / Guard_RegChange / Guard_RegXContextUse) and worked scenarios live in C.3.A, Annex A (Regulatory adoption profile).
How typed reasoning plugs into Assurance Lanes (VA/LA/TA) & Evidence design
Intent (manager’s view). Typed reasoning turns “prove/test/qualify” into a repeatable plan by making what the rule talks about explicit (named Kinds, their subkinds, optional RoleMasks) and keeping Scope (G) over U.ContextSlice separate from membership inside the slice. Cross‑context uncertainty (Scope Bridge CL, KindBridge CL^k) always routes to R as penalties Φ/Ψ; it never changes F or G.
Evidence matrix (sketch).
Tip. For formal kinds and “up‑to‑iso” kinds (AT K2/K3), expect more rows (variants). For instance‑like kinds (AT K0), expect fewer rows and tighter columns (narrow slices, stricter freshness).
Authoritative evidence obligations and guard macros (planning/attachment, VA/LA/TA duties, anti‑patterns) are in C.3.A, Annex B.
How typed reasoning plugs into ESG and Method–Work gating
Intent. Make state changes and work admissions deterministic, auditable, and safe by separating (1) typed compatibility (what the statement or capability is about) from (2) scope coverage (where it holds or can run). Any Cross‑context uncertainty is routed to R (reliability) only—never to F (form) or G (scope).
Scope & fit
This subsection defines normative guard obligations for:
- ESG (Episteme State Graph) transitions whose assertions quantify over kinds, and
- Method–Work admissions where a capability expects inputs and outputs of specified kinds.
It reuses:
- USM (A.2.6):
U.ClaimScope(G) andU.WorkScopecoverage +Γ_time, - Kind‑CAL core (C.3.1–C.3.2):
U.Kind,MemberOf(e,k,slice),⊑, - KindBridge (C.3.3) with
CL^kand loss notes, - Scope Bridge (Part B) with CL and loss notes,
- RoleMask (C.3.4) when local adaptations of a kind are used,
- Formality F (C.2.3) when transitions gate on rigor,
- Assurance R (C.2.2) for evidence freshness and penalties Φ/Ψ.
Guard macros. The normative guard shapes for ESG and Method–Work (Guard_TypedClaim, Guard_TypedJoin, Guard_MaskedUse, Guard_XContext_Typed) are specified in Annex C.3.A. Use those shapes; the present section is a manager‑level overview only.
Inputs & roles (at guard time)
-
TargetSlice — the specific context you are deciding for: Context, versioned Standards, environment parameters, and an explicit time selector (Γ_time).
-
Typed carriers
- ESG: the Claim quantifies over one or more Kinds (e.g., “for all vehicles in the target context …”).
- Method–Work: the Capability declares expected input and output kinds (and possibly RoleMasks).
-
Thresholds (context‑local policy):
- Minimum F level for the Claim (if the Context gates on rigor),
- Minimum congruence for scope bridges,
- Minimum type‑congruence for KindBridges,
- Evidence freshness windows (R‑lane).
-
Evidence bundle (if the transition implies trust): references, dates, windows.
Manager’s 7‑step checklist (operational)
- Name the slice. Write the full
TargetSlice/JobSlicetuple includingΓ_time. - Check coverage. Claim/Work scope covers the slice (USM).
- Check typed definedness. A deterministic membership check is available in this context for every kind you use (and any masks are registered).
- Check typed compatibility. same Context:
⊑(or mask constraints met). Cross‑context: KindBridge withCL^k ≥ c. - Bridge scope if needed. Scope Bridge with CL ≥ c for Cross‑context scope.
- Apply penalties to R. Apply the scope‑bridge penalty and the kind‑bridge penalty; then check evidence freshness windows.
- (If gated) Check F. Enforce
Formality ≥ F_kfor the transition.
Remember: F and G never change because of bridges; only R is penalized. AT (K0…K3) is informative and not used in guards.
Cross‑references
- USM / A.2.6: Scope coverage,
Γ_time, serial ∩, SpanUnion, Bridge+CL. - Kind‑CAL / C.3.1–C.3.4:
U.Kind,⊑,MemberOf, RoleMask, KindBridge +CL^k. - Formality / C.2.3:
U.Formalitythresholds (when ESG gates on rigor). - Assurance / C.2.2: Freshness windows; Φ(CL) and Ψ(
CL^k) penalties to R (weakest‑link on paths).
This subsection is normative for guards in ESG and Method–Work that use kinds.
Cross‑context typed reuse & assurance accounting
The two‑bridge rule (mandatory)
When any part of the use crosses Contexts:
- Scope Bridge (USM/Part B) with CL → penalty Φ(CL) to R.
- KindBridge (C.3.3) with
CL^k→ penalty Ψ(CL^k) to R.
Both bridges carry loss notes; neither changes F or G. See C.3.A Guard_XContext_Typed.
Narrowing after mapping (best practice)
If a bridge’s loss notes indicate material mismatch (dropped invariants, collapsed subkinds):
- Narrow the mapped Scope to areas where those losses are benign.
- Or introduce an adapter (plus evidence) that restores the needed properties in the target Context.
- Document the decision; the penalties still land in R.
Typical Cross‑context patterns (manager’s catalog)
-
Name‑level overlap only (low
CL^k). Expect significant Ψ penalty. Limit quantification, add local checks, or refuse reuse until the kind mapping is improved. -
Up‑to‑iso mapping (high
CL^k). Often seen for K3 kinds. Ψ penalty is small; treat as “shape‑preserving” transfer. Still apply the appropriate Φ(CL) for Scope. -
Mask‑to‑subkind evolution. If receivers repeatedly use the same RoleMask to make a transfer safe, promote it to an explicit subkind and update the bridge to preserve that link.
Decision pattern (fast path)
- Typed pre‑check:
k_A ⊑ k_B(same Context) orKindBridge(k_A → k′_B)with acceptableCL^k. - Scope coverage:
translate(Scope_A)coversTargetSlice_B. - Apply penalties: Φ(CL_scope) and Ψ(
CL^k) to R. - Freshness: windows/decay for all bound evidence.
- Publish: a short “Bridge and Loss Notes” box; include any narrowing or adapters used.
Authoring guidance (engineers‑managers)
When to mint a U.Kind
Create a Kind when:
- multiple claims refer to the same “entityOfConcern” using unstable labels;
- you need subkinds (refinement) or repeated RoleMasks;
- different Contexts must map this “entityOfConcern” via bridges;
- you need to quantify over a population (and plan variant coverage) instead of over a single exemplar.
Avoid creating a Kind for one‑off instance references—prefer a clear K0 facet or just a literal exemplar in the claim.
Writing a KindSignature (and picking F)
- Start with a concise intent: the invariants/constraints that make membership meaningful.
- Aim for F4 (predicate‑like) if the kind is intended for reuse; rise to F7+ only where proof‑grade is justified.
- Use observable terms (no “latest”); if a Standard matters, name its version.
- If defining a Kind reveals systematic narrowings in use, introduce explicit subkinds (
⊑) rather than accumulating opaque masks.
Example (sketch).
Kind Vehicle— intent: “has VIN; has brake system; has propulsion {ICE, EV, Hybrid}; …” (F4 predicates). Subkind:PassengerCar ⊑ Vehicle. RoleMask:Vehicle@ABSRequiredfor processes that demand ABS (deterministic constraints; candidates for promotion to subkind if widely reused).
Setting the AT facet (K0…K3)
Use AT to aim effort, not to gate:
- K0: instance/cohort — focus R on the TargetSlice; don’t over‑formalize.
- K1: behavioral pattern — clarify Standards; plan ΔF (F3→F4).
- K2: formal class — invest in F4–F7; plan variant coverage across subkinds in R.
- K3: up‑to‑iso — expect high‑quality bridges; consider F7–F9 for critical invariants.
Never treat AT as “wider/narrower” G.
Writing a typed claim (with USM blocks)
Skeleton.
- Kinds used:
Vehicle(K2), subkindsPassengerCar. - Claim scope (G):
surface∈{dry,wet}; speed≤50; rig=v3; Γ_time=rolling 180d. - Statement:
∀ x ∈ Extension(Vehicle, TargetSlice) … - Guards: use C.3.A Guard_TypedClaim; if Cross‑context, add Guard_XContext_Typed (two‑bridge rule).
Tip. Keep Scope, MemberOf definedness, F thresholds, and freshness as separate guard predicates—the auditor should be able to tick each box independently.
Minimal “Kind card” contents (Context catalog)
- Name and intent summary (KindSignature snippet + F).
⊑links (parents/children).- Examples of
MemberOf@slice(what membership looks like in practice). - Known RoleMasks (type, constraints, determinism).
- Known KindBridges (source Contexts, target Contexts,
CL^k, loss notes, definedness). - (Optional) AT facet with one‑line rationale.
10 - Review & integration guidance
Reviewer’s 8‑point checklist
- Named entityOfConcern. Does the claim state what it quantifies over (
U.Kind)? - Scope explicit. Is G declared (no “domain” placeholders, no implicit “latest”)?
- Typed compatibility. For compositions, do we have
⊑(same Context) or a KindBridge? - RoleMasks. If used, are they registered, deterministic, and not masquerading as kinds?
- Two‑bridge rule. For Cross‑context use, do we have both Scope Bridge (CL) and KindBridge (
CL^k)? - Penalties. Are Φ(CL) and Ψ(
CL^k) applied to R, not smuggled into F/G? - Freshness. Are validation/monitoring windows separate from Scope coverage?
- Evidence fit. For class‑level claims, does the test plan cover subkinds/variants?
Integrator’s composition playbook (typed first, then scope)
- Step 1: Check
k_A ⊑ k_B(or KindBridge). - Step 2: Compute Scope_serial =
Scope(A) ∩ Scope(B)(USM). - Step 3: If parallel supports exist, SpanUnion them (only where independent).
- Step 4: Apply Φ/Ψ penalties to R; enforce freshness.
- Step 5: If a mask is repeatedly required, consider promoting it to a subkind.
Assurance lead: wiring penalties and windows
- Identify channels used: Scope bridge? KindBridge?
- Apply Φ(CL) and Ψ(
CL^k) to R (monotone; higher congruence ⇒ smaller penalty). - Verify freshness windows for all bound evidence (independent of bridges).
- Publish a one‑box summary: bridges, levels, loss notes, any narrowing/adapters, net impact on R.
Red flags (stop‑the‑line)
- “We widened G because we reworded the type.” → Reject; redo as subkind/bridge or revise Scope honestly.
- “Mask equals kind.” → Refactor; register mask properly or promote to subkind.
- “Cross‑context without KindBridge.” → Block; demand mapping and
CL^k. - “No Γ_time.” → Block; add explicit time policy (point/window/rolling).
Worked examples (end‑to‑end)
Each example shows the typed pre‑check, Scope composition, penalties to R, and the managerial decision. Full guard clauses for these scenarios are in Annex C.3.A.
Cyber‑physical braking policy across labs and plants
Claim (Lab Context).
“∀ x ∈ Vehicle: brakingDistance(x) ≤ 50 m (dry), ≤ 40 m (wet).”
Kinds. Vehicle (K2, KindSignature F4); subkind PassengerCar ⊑ Vehicle.
Scope (Lab). {surface∈{dry,wet}, speed≤50, rig=v3, Γ_time=rolling 180d}.
Reuse at Plant B.
– KindBridge: Vehicle ↦ TransportUnit with CL^k=2 (loss: EV subkind collapsed).
– Scope Bridge: Lab → PlantB with CL=2 (rig bias ±2 %).
– Narrowing: loss notes indicate wet‑surface bias; Plant B narrows mapped Scope to temp/adhesion ranges with acceptable bias.
Decision. Typed pre‑check: OK via KindBridge. Scope coverage after translate/narrow: OK. Penalties: apply Φ(2) and Ψ(2) to R; freshness windows checked. Outcome: Adopt with reduced R; action item: qualify rig v4 to raise CL in the future.
API decision rule with adapter and subkind promotion
Consumer claim.
“∀ x ∈ AuthenticatedRequest: deny if riskScore(x) ≥ θ ∧ budgetSlack ≤ β.”
Producer reality.
Service A emits Request (no auth guarantee).
Option A: A proves it emits AuthenticatedRequest (introduce subkind or strengthen Standard).
Option B: Insert adapter that filters/annotates Request → AuthenticatedRequest.
Typed check.
Before: no Request ⊑ AuthenticatedRequest. After Option B: adapter supplies the guarantee; repeated use leads to promoting mask to subkind.
Scope. API v2.3; Γ_time = rolling 30 d. R. No Cross‑context reuse; no Φ/Ψ. Evidence: adapter correctness on the TargetSlice.
Outcome. Adopt via Option B; open task: generalize producer to subkind and remove adapter later.
Clinical dosage rule across jurisdictions (bridge + mask)
Claim (Hospital X).
“∀ x ∈ AdultPatient: dosage ≤ D per kg for drug M.”
Kind. AdultPatient (K2, F4).
Mask. AdultPatient@ClinicMask narrows to the clinic’s cohort (deterministic DOB policy).
Reuse in Jurisdiction Y.
– KindBridge: AdultPatient ↦ AdultPerson_Y, CL^k=1 (18 vs 21 years boundary).
– Scope Bridge: coding systems differ (CL depends on mapping quality).
– Narrowing: restrict Scope to datasets where DOB granularity supports boundary reconciliation.
Decision.
Typed pre‑check via KindBridge: OK. Scope coverage after translate/narrow: OK.
Penalties: Φ(CL_scope) and Ψ(1) applied to R.
Outcome: Adopt with strong R penalty; plan: negotiate a harmonized boundary to raise CL^k.
ML fairness constraint with typed quantification
Claim (Product Context).
“∀ x ∈ EligiblePerson: TPR difference ≤ δ across groups G.”
Kind. EligiblePerson transitions from K1→K2 as attributes and cohorts are formalized (KindSignature F4).
Scope. {pipeline=P, features=F, Γ_time=rolling 180 d}.
Cross‑context use.
Model team Context has Resident with different feature basis.
– KindBridge: EligiblePerson ↦ Resident with CL^k=1 (feature loss).
– Scope Bridge: pipeline P → P′, CL=2.
Decision. Typed pre‑check OK via bridges; mapped Scope covers the subset where features align. Apply Φ(2) and Ψ(1) to R; restrict groups to mapped subset; require monitoring freshness. Outcome: Adopt with reduced R and a mitigation note; action items: improve feature mapping and raise KindSignature F.
Anti‑patterns & how to fix them
Use this section as a “red flags” sheet in reviews. Each item links to a concrete remedy that preserves F–G–R & USM discipline (F/G/R separation, USM algebra, typed pre‑checks).
Governance & conformance pull‑ups
Contexts adopt Kind‑CAL by meeting the Context‑level obligations below. They summarize, not duplicate, the formal requirements in C.3.1–C.3.5 and C.3.A. Use this as an adoption checklist.
Context‑level obligations (must‑haves)
-
Kinds & order. Maintain a Context catalog of
U.Kindwith an explicit partial order⊑. – Conformance: C.3.1 (K‑01/K‑02). -
Kind signatures (intent). For each Kind, publish a KindSignature with declared F (C.2.3). – Conformance: C.3.2 (K‑03/K‑04).
-
Deterministic membership. Ensure
MemberOf(e,k,slice)is deterministic; declare any definedness domain. – Conformance: C.3.2 (K‑05/K‑07). -
Typed guards. When a claim quantifies over kinds, guards SHALL use the typed guard macros (or equivalents) from C.3.A; Scope coverage and typed checks are separate predicates.
-
Role masks. If a local projection is needed, register a RoleMask (type: constraint/vocabulary/composite); avoid cloning kinds. – Conformance: C.3.4 (RM‑01…RM‑06).
-
Two‑bridge rule for Cross‑context use. – Scope Bridge (Part B) with CL → Φ(CL) to R. – KindBridge (C.3.3) with
CL^k→ Ψ(CL^k) to R. – Conformance: C.3.3 (KB‑01…KB‑10). -
Decision records. For each typed state change, record: TargetSlice tuple, typed compatibility outcome (
⊑or KindBridge), Scope coverage, applied Φ/Ψ penalties to R, and freshness checks.
ESG / Method‑Work template inserts (normative snippets)
- Kinds used: list
U.Kindand any expected subkinds or RoleMasks. - Claim scope (G): explicit predicates over
U.ContextSliceinc. Γ_time. - Typed guard lines:
– same Context:
k_A ⊑ k_Bchecked. – Cross Context:KindBridge(k_A → k′_B),CL^k ≥ c_kchecked. - Scope bridge lines:
Bridge(Context_A → Context_B),CL ≥ c_schecked. - Assurance lines:
Φ(CL),Ψ(CL^k)applied to R; freshness windows hold.
Audits & levels of adoption (informative)
- USM‑Typed‑Ready. Catalog exists;
⊑declared; guard macros installed. - USM‑Typed‑Guarded. All typed claims use C.3.A guard shapes; Γ_time explicit; two‑bridge rule enforced.
- USM‑Typed‑Auditable. Decision records capture TargetSlice, typed checks, bridges, penalties, freshness.
- USM‑Typed‑Composed. Compositions use typed pre‑check before Scope algebra; independence justified for SpanUnion.
Migration & editorial impact
Apply these edits incrementally; you do not need to stop other work. The aim is to eliminate synonym drift, restore F/G/R separation, and make typed reasoning routine.
Inventory & refactor (steps)
- Inventory claims that implicitly talk about “things” (vehicles, requests, accounts, cohorts…).
- Name kinds for recurring “entityOfConcern”; start at K1; promote to K2 as invariants stabilize.
- Extract KindSignature (aim F4); declare F.
- Refactor claims to typed quantification:
∀ x ∈ Extension(k, slice) …plus Scope (G) predicates. - Publish bridges where reuse is Cross‑context: Scope Bridge (CL) and KindBridge (
CL^k) with loss notes; wire penalties Φ/Ψ to R. - Normalize masks: register RoleMasks; if reused, promote to subkinds (
⊑).
Edits to other parts (normative redirects, no new math)
-
A.2.6 (USM). – Add “no Scope on kinds” note. – In typed examples, show
MemberOfdefinedness + Scope coverage. – Two‑bridge rule for Cross‑context typed reuse. -
C.2.2 (F–G–R). – Replace any “generality/abstraction” wording with Claim scope (G). – Before scope composition, require typed pre‑check (
⊑or KindBridge). – Distinguish penalties: Φ(CL) vs Ψ(CL^k) → both to R. -
C.2.3 (F). – Add note: KindSignature has its own F; claim‑level F remains by weakest‑link.
-
Part B (Bridges). – Introduce KindBridge with
CL^k, monotone order preservation, loss notes; determinism. – Chaining uses min of levels (weakest‑link) for both CL (Scope bridges) andCL^k(KindBridges). -
Role‑CAL. – Add RoleMask for kinds; determinism; promotion rule to subkind when reused.
-
Compose‑CAL. – Add typed pre‑check before Scope algebra; forbid “type‑by‑scope”.
-
Part E (Lexicon). – Add:
U.Kind,U.SubkindOf (⊑),KindSignature(+F),Extension,MemberOf,U.RoleMask, KindBridge,CL^k, AT (kinds, facet). – Mark as deprecated aliases (not characteristic names): generality (as ladder), kind scope, validity (as characteristic), capability envelope; redirect to Claim/Work scope or Kind entries.
Alias and record continuity
- Archived prose and cited older records may keep deprecated aliases as labels. Guards, conformance text, and state assertions MUST use the Kind‑CAL/USM vocabulary and guard shapes.
- When annotating older records, add a small “typed note” box: Kinds, Scope, Bridges (CL/
CL^k), loss notes, penalties to R.
Extended rationale & design notes [I]
This section explains the design choices that keep Kind‑CAL compact and interoperable with F–G–R & USM without drifting into tooling or technology stacks.
Why no Scope on kinds
Scope answers “where the claim holds” (set of Context slices, USM); kinds answer “what the claim is about”. Putting Scope on kinds would either (a) duplicate claim Scope, or (b) smuggle applicability into a classifier. We prevent both by: intent/extent on kinds (C.3.2), Scope on claims/capabilities (USM).
Why two bridges (Scope vs Kind)
Contexts diverge along context (Standards, parameters, time) and classification (what counts as a member). A single bridge hides which characteristic is mismatched. Two explicit bridges keep fixes targeted: ΔG / narrowing for context misfit; subkind/adapter for classification misfit. Both risks land in R as separate penalties (Φ/Ψ).
Why AT is a facet
AT (K0…K3) improves planning (ΔF/ΔR, bridge style) and navigation without introducing new algebra. Making AT a Characteristic would recreate a “G‑ladder,” blur applicability with abstraction, and invite gating on AT. As a facet, AT remains helpful but toothless in math, which is precisely what we want.
Why RoleMask and not “clone a kind”
Operational tweaks (extra constraints, local aliases) are real but temporary. Cloning kinds creates drift and duplicate bridges. RoleMask documents the tweak without breaking identity; promotion to subkind occurs when practice stabilizes. This keeps catalogs small and bridges honest.
Fit with Compose‑CAL and LOG‑CAL
Typed pre‑checks (same‑Context ⊑ or KindBridge) act like port compatibility before any Scope arithmetic. LOG‑CAL benefits from explicit quantification ∀ x : Kind with substitution rules aligned to ⊑. Neither alters F/G/R algebra; they prevent category mistakes before we do trust math.
CT2R lens (intuition)
A KindBridge behaves like a functor that (approximately) preserves structure between Contexts; CL^k is a practical knob for “how functorial” it is. At K3 (up‑to‑iso), this is literal: we expect bridges to preserve equivalences, hence higher CL^k and smaller Ψ penalties.
Rationale (Part E form)
Problem. (recap) — Authors conflate entityOfConcern with applicability, widening G by abstract wording. — Cross‑context reuse drifts semantically without declared mappings or risk accounting. — Planning misfires: over‑formalization for instance claims; under‑testing for class claims. — Unsafe compositions when entityOfConcern is implicit.
Forces. (recap) — Local freedom vs global sense; minimality vs utility; intent vs extent; typed discipline vs F–G–R; abstraction vs applicability.
Decision (C.3‑D1…D7).
— D1: U.Kind is intensional and context‑local (⊑ partial order).
— D2: Separate intent (KindSignature + F) and extent (Extension/MemberOf@slice).
— D3: No Scope on kinds (Scope lives with claims/capabilities via USM).
— D4: Typed reuse is explicit: KindBridge + CL^k, penalties route to R only.
— D5: Local adaptation via RoleMask; promote stable masks to subkinds.
— D6: AT (K0…K3) as facet, not a Characteristic; never used in guards.
— D7: Guard shapes: typed pre‑check → scope coverage → penalties/freshness.
Consequences. (+) Predictable Cross‑context reuse: two‑bridge rule, separate penalties (Φ/Ψ) to R. (+) Manager‑friendly planning: AT guides ΔF/ΔR; typed pre‑check blocks category mistakes. (+) Clean F–G–R discipline: no “G‑ladder,” no hidden scope inside classifiers. (−) Editorial discipline required: no “Kind scope”; masks must be cataloged; promote when stable. (−) Initial bridge authoring cost; mitigated by loss‑notes and reuse.
Alternatives considered. — Global U.Type: rejected as either too thin or too prescriptive across Contexts. — “Kind scope” in USM: rejected; duplicates/obscures Scope vs Extension split.
Known uses. — §11.1 (cyber‑physical braking); §11.2 (API with adapter); §11.3 (clinical dosage); §11.4 (ML fairness). — ESG guard shapes in C.3.A; typed pre‑check in Compose‑CAL (§7.2.4).
Related patterns. A.2.6 (USM), C.2.2 (F–G–R), C.2.3 (F), Part B (Bridges), Role‑CAL, Compose‑CAL, C.3.1–C.3.5, C.3.A.
Quick reference for managers
10‑minute start
- Name the Kind your claim talks about.
- Write Scope (G) as slice predicates (with Γ_time).
- If composing, check
⊑or KindBridge first. - Use the typed guard macro (C.3.A).
- Route bridge levels to R (Φ/Ψ); check freshness.
30‑day rollout plan
Week 1: Inventory & name Kinds (K1); adopt guard macros.
Week 2: Draft KindSignature for the top 5 Kinds (aim F4); register masks.
Week 3: Wire two‑bridge rule into ESG; add CL/CL^k lines to decision templates.
Week 4: Promote repeated masks to subkinds; publish first KindBridge records with loss notes.
Local glossary (reading aid)
Canonical definitions live in sub‑patterns; this list is for quick recall while reading C.3.
U.Kind— Minimal intensional “type/kind” object; carries KindSignature and⊑(C.3.1/C.3.2).U.SubkindOf (⊑)— Partial order on kinds (C.3.1).- KindSignature(k) — Predicate‑like intent that defines the kind; has its own F (C.3.2).
- Extension(k, slice) — Set of instances of
kinside aU.ContextSlice(C.3.2). - MemberOf(e, k, slice) — Boolean membership predicate (C.3.2).
- RoleMask(k, Context) — Registered adaptation (constraints/aliases; optional narrowing), no new kind (C.3.4).
- KindBridge — Cross‑context mapping for kinds (intent/order) with
CL^kand loss notes (C.3.3). CL^k— Kind‑congruence level; penalty Ψ(CL^k) goes to R (C.3.3).- AT (K0…K3) — Informative facet of a Kind; aids planning/navigation; never used in guards (C.3.5).
- Guard macros — Typed guard shapes for ESG/composition (C.3.A).
End of C.3. See C.3.1–C.3.5 and C.3.A for the referenced mechanics and guard macros.
C.3:End
U.Kind & SubkindOf (Core)
One‑line summary. Defines
U.Kindas a minimal, context‑local intensional carrier for “what a claim is about,” andU.SubkindOf (⊑)as a partial order over kinds. Kinds do not carry Scope. Scope remains on claims/capabilities (USM). This core pattern supplies only identity, locality, and ordering; intent & membership (KindSignature,Extension/MemberOf) are specified in C.3.2, bridges & congruence in C.3.3, masks in C.3.4, and the AT facet in C.3.5.
Status. Normative in Part C. Identifier C.3.1. Audience. Engineering managers, architects, assurance leads.
Dependencies.
- A.2.6 USM (Unified Scope Mechanism). Scope is a set‑valued USM property over
U.ContextSliceon claims/capabilities; algebra:∈(membership),∩(intersection),SpanUnion(union across independent lines),translate(scope mapping). - C.2.2 F–G–R. F = formality of expression; G = Claim scope; R = assurance/evidence; weakest‑link for F/R; CL penalties feed R, not F/G.
- C.2.3 U.Formality (F). Ordinal F0…F9; no arithmetic; applies to all content, including Kind signatures (defined in C.3.2).
- Part B Bridges & CL. Generic (scope) bridges and CL; Kind bridges are specialized in C.3.3.
Non‑goals.
- No data governance or repository/notation mandates.
- No membership or signature semantics here (defined in C.3.2).
- No Cross‑context mapping/congruence here (defined in C.3.3).
- No role/mask mechanics here (defined in C.3.4).
- No AT facet mechanics here (defined in C.3.5).
Purpose & Audience
This pattern gives one small, stable vocabulary to say what a claim ranges over (its entityOfConcern) without entangling that with where it applies (Scope) or how well it is supported (R). For managers:
- It prevents the costly mistake “more abstract wording ⇒ wider scope.”
- It enables typed composition (you cannot combine claims about incompatible “things”).
- It keeps Scope and Assurance math unchanged and predictable.
Context
across Contexts, “type” means OWL class, SHACL shape, code type, BORO category, etc. A neutral, minimal object is needed to name the kind of entities a claim quantifies over without importing a full type system or altering USM. U.Kind fills that role; ordering between kinds captures “is‑a/refines” relationships a Context relies on.
Problem
- Scope–Type conflation. Teams broaden G by “abstracting” prose, not by adding supported slices.
- Unsafe composition. Claims are joined though they talk about different “things.”
- Cross‑context drift. Without an explicit core notion of kind, bridges blur entityOfConcern vs applicability.
Forces
Solution — Core Objects (overview)
U.Kind— a context‑local intensional object naming a “kind of thing” claims may quantify over.U.SubkindOf (⊑)— a partial order on kinds (reflexive, transitive, antisymmetric).k₁ ⊑ k₂reads “k₁refinesk₂.”
No Scope on kinds. Scope is for claims/capabilities (USM). Kinds supply entityOfConcern only; membership and signature live in C.3.2.
Norms & Invariants (normative)
C3.1‑K‑01 (Partial order). U.SubkindOf (⊑) SHALL be a partial order on U.Kind: reflexive, transitive, antisymmetric. Editors SHALL document any Context‑specific meets/joins if they supply them (optional).
C3.1‑K‑02 (No Scope on kinds). A U.Kind MUST NOT carry a Scope value. Scope lives with claims (U.ClaimScope = G) and capabilities (U.WorkScope) per A.2.6.
Rationale pointer: see C.3.2 for the intent/extent vs Scope split.
C3.1‑K‑03 (Identity & locality). A U.Kind is context‑local. Cross‑context mapping of kinds is handled by KindBridge (see C.3.3); such mapping MUST NOT be conflated with Scope bridging.
C3.1‑K‑04 (Naming). A Context SHALL assign stable identifiers to kinds and SHOULD catalog parent/child ⊑ links. Synonyms/aliases SHALL point to the canonical kind id.
C3.1‑K‑05 (Separation of concerns). This core does not define kind intent or membership; those are specified in C.3.2 (KindSignature with its own F; Extension/MemberOf and determinism).
Interactions (informative)
- With USM (A.2.6). Guards that quantify over a kind use two predicates: “Scope covers TargetSlice” (USM) and whatever membership predicate is defined for the kind (see C.3.2). Kinds themselves carry no Scope.
- With F–G–R (C.2.2). This pattern does not alter the triple; typed checks happen before scope algebra, preventing invalid compositions.
- Order of checks reference. See Annex C.3.A §5 (E‑01) for the normative evaluation order: typed compatibility first, then Scope coverage, then penalties to R and freshness.
- With Formality (C.2.3). A KindSignature (C.3.2) declares its F; claims retain their own F via weakest‑link.
- With Bridges (Part B). Use KindBridge (C.3.3) for entityOfConcern; use Scope Bridge (Part B) for applicability. Penalties land in R via different channels.
Authoring & Review (informative)
When to mint a kind.
Mint a U.Kind when claims repeatedly quantify over “the same sort of thing” and you need: (i) safe composition, (ii) clear Cross‑context mapping, (iii) a place to collect invariants (in C.3.2).
Don’t over‑mint. If a local constraint is temporary or purely procedural, prefer a RoleMask (C.3.4) over a new subkind.
Review prompts.
- Does the draft introduce a new entityOfConcern concept? → consider a kind.
- Does prose hint at “is‑a” relationships? → capture as
⊑, not as scope widening. - Are authors trying to widen scope by abstracting wording? → stop; widen G only via ΔG (USM) with support.
Examples (informative, technology‑neutral)
-
Vehicle/PassengerCar. Mint
Kind Vehicle. Later addPassengerCar ⊑ Vehicle. Claims about Vehicle may be reused by narrowing to PassengerCar without touching G. Scope remains an independent predicate overU.ContextSlice. -
Request/AuthenticatedRequest. If multiple policies speak about “authenticated requests,” declare
AuthenticatedRequest ⊑ Request. Do not widen G to compensate for missing authentication; either change the producer’s kind or insert an adapter (C.3.2/C.3.4) while keeping G honest.
Conformance checklist (normative)
Rationale (informative)
Why a tiny core? Contexts differ wildly in “type” practice. A large, prescriptive core would either (a) force one Tradition’s semantics on all, or (b) become an empty label. The smallest powerful core—identity + ordering—gives managers and integrators what they need (safe composition, predictable edits) and leaves intent/membership/bridges/masks to focused sub‑patterns.
Why “no Scope on kinds”?
Scope (USM) answers “where a claim/capability holds” over U.ContextSlice. Kinds answer “what the claim ranges over.” Blending them recreates the failure mode we are removing (“higher abstraction ⇒ wider scope”). The right split is:
- Kind: intensional name + order (
⊑) (this pattern); intent & membership (C.3.2). - Scope: set of context slices (A.2.6).
- Assurance: evidence & penalties (C.2.2 / Part B).
C.3.1:End
KindSignature (+F) & Extension/MemberOf
One‑line summary. Specifies the intent and extent of kinds: (i) a
KindSignature(k)(the intensional definition of kindk) that declares its own Formality F; (ii) anExtension(k, slice) ⊆ U.EntitySet(slice)and the membership predicateMemberOf(e, k, slice)that are deterministic perU.ContextSlice; (iii) monotonicity of extension underSubkindOf; (iv) a definedness policy that fails closed outside its domain. Kinds still carry no Scope (that rule lives in C.3.1); Scope stays on claims/capabilities (USM). This pattern gives managers and reviewers the observable basis to check “what counts as a member here and now” without entangling applicability (G) or assurance (R).
Status. Normative in Part C. Identifier C.3.2. Audience. Engineering managers, architects, assurance leads, editors.
Depends on.
- C.3.1 (U.Kind & SubkindOf Core): kinds are context‑local;
⊑is a partial order; kinds carry no Scope. - A.2.6 USM (Context slices & Scopes): Claim scope (G) and Work scope live on claims/capabilities; algebra
∈(membership),∩(intersection),SpanUnion(union across independent lines),translate(scope mapping). - C.2.3 U.Formality (F): ordinal F0…F9; no arithmetic; weakest‑link composition applies to content that depends on the signature.
- C.2.2 F–G–R: assurance calculus; CL penalties feed R, not F/G.
- Part B (Scope Bridges & CL). CL (scope congruence) and scope translation live in Part B/USM; kind‑congruence
CL^kand kind mapping live in C.3.3 (KindBridge).
Non‑goals.
- No Scope semantics here (USM); no bridge semantics here (C.3.3).
- No repository/notation mandates; this is concept‑level, not tooling.
Purpose & Audience
This pattern makes entityOfConcern testable in a Context:
- Authors get a place to write what defines a kind (
KindSignature) and at what rigor (F). - Reviewers can ask deterministic questions: “Given this
TargetSlice, which entities are ink?” - Managers can plan ΔF (raise signature rigor) and ΔR (evidence over members) without changing G (applicability).
No tooling assumption. The pattern is conceptual and notation‑neutral (no OWL/SHACL/type‑system requirement); it specifies reviewer‑checkable obligations that managers can read in plain language.
Context
Different Contexts encode “type” intent differently (predicates, schemas, ontologies, Standards). Regardless of notation, a team must be able to answer, reproducibly: who belongs to the kind at this slice? If this is not stable, claims quantified over the kind are unverifiable, bridges are opaque, and composition becomes unsafe.
Problem
- Ambiguous membership. Membership depends on tacit “latest” states or unwritten defaults.
- Signature opacity. A kind’s definition is scattered; no single place to declare rigor (F) or assumptions.
- Order violations. Subkind hierarchies do not guarantee subset behavior in practice.
- Scope leakage. Teams smuggle applicability (G) into kind definitions, recreating G‑ladders by another name.
Forces
Solution — Objects & Standards (overview)
KindSignature(k)— the intensional definition of kindkin the Context; it declaresU.Formalityper C.2.3.U.EntitySet(slice)— the set (or well‑defined universe) of entities addressable in a givenU.ContextSlice.Extension(k, slice) ⊆ U.EntitySet(slice)— which entities belong tokatslice.MemberOf(e, k, slice)— membership predicate:e ∈ Extension(k, slice).
Design split.
- Intent lives in
KindSignature(with F). - Extent is computed per
sliceviaMemberOf. - Applicability (where a claim holds) remains a Scope on the claim (USM) and MUST NOT be encoded into
KindSignature.
Norms & Invariants (normative)
IDs C3.2‑K‑03…K‑08 correspond to the rules announced in C.3; additional local rules use C3.2‑S‑*.
Signature & Formality
C3.2‑K‑03 (Signature F). Every KindSignature(k) SHALL declare U.Formality per C.2.3 (F0…F9).
— Note: Raising signature F does not automatically raise claim‑level F; claims follow weakest‑link along their own support paths.
C3.2‑K‑04 (Signature change = content change). Any change to KindSignature(k) that alters membership (i.e., would change Extension(k, slice) for some slice) SHALL be recorded as a content change (Contexts may version kinds).
Extension & Membership
C3.2‑K‑05 (Deterministic membership). For fixed (k, slice), MemberOf(e, k, slice) MUST be deterministically evaluable from observable content in slice.
— Implication: “latest” is forbidden; Γ_time must be explicit on slice (A.2.6).
— If a classifier makes external assumptions, they MUST be named in KindSignature.
C3.2‑K‑06 (Monotone in ⊑). If k₁ ⊑ k₂, then for every slice:
Extension(k₁, slice) ⊆ Extension(k₂, slice).
C3.2‑K‑07 (Definedness & fail‑closed). Each Context MAY restrict the domain of definedness for MemberOf(–, k, –) (e.g., only when a Standard or dataset is present at a given version). Outside that domain, MemberOf MUST be treated as not defined for guard purposes, and guards MUST fail closed (deny). Implementations MAY internally return False, but there MUST be no path where undefined membership yields implicit success.
C3.2‑K‑08 (Separation from G). Guards SHALL keep Scope coverage (USM) and membership as separate predicates:
“U.ClaimScope(Claim) covers TargetSlice AND MemberOf(?, k, TargetSlice) is defined/used”.
Entity set & time
C3.2‑S‑01 (U.EntitySet). A Context SHALL document what counts as U.EntitySet(slice) (e.g., “rows in dataset D at version v,” “live objects in service S at build b,” “ontology individuals at vocabulary v”). This documentation MUST be stable and addressable via the slice tuple.
C3.2‑S‑02 (Time). slice SHALL specify Γ_time (point/window/policy). Membership MUST NOT rely on implicit recency.
U.EntitySet(slice) MUST NOT expand implicitly via external defaults or time; its extent is fixed by the slice tuple (see C3.2‑S‑02).
Interactions & Placement (informative)
- With C.3.1. Kinds carry identity and
⊑; no Scope on kinds. This pattern adds the intent/extent layer under those constraints. - With A.2.6 (USM). A typed claim’s guard normally evaluates, in the order specified by Annex C.3.A §5 (E‑01): (1) typed compatibility, (2) Scope coverage at
TargetSlice, (3)MemberOf(?, k, TargetSlice)definedness and any instantiation, followed by penalties to R and freshness checks. Use Guard_TypedClaim / Guard_TypedJoin rather than ad‑hoc shapes. - With C.2.3 (F). Signature F influences claims only if the claim depends on the signature content; weakest‑link min applies along the claim’s support path.
- With C.3.3 (KindBridge). When
MemberOfis computed via a kind mapping across Contexts, kind‑congruenceCL^kcontributes a **monotone penalty to R only (Ψ(CL^k)); F/G MUST NOT be adjusted. - With Role‑CAL (C.3.4). A RoleMask may narrow membership (context‑local adaptation). Frequent masks that encode stable narrowing SHOULD be promoted to subkinds (
⊑).
Authoring & Review Guidance (informative)
Authoring KindSignature
- Be explicit and observable. Prefer predicate‑like clauses over prose (“has VIN format …”; “axles ≥ 2”).
- Bind to versions. Name Standards/schemas by version; avoid “current.”
- Declare F honestly. F3 for controlled narrative is fine in early phases; aim F4+ for durable kinds; consider F7+ for safety‑critical cores.
- Name assumptions. If membership requires external conditions (e.g., calibrated rig), put them in the signature.
Authoring membership
- Define
U.EntitySet(slice). Write it down once per Context, make it addressable via theslicetuple, and reuse. - Determinism first. No hidden IO, no implicit time; membership must be recomputable from the slice.
- Document definedness. If
MemberOfis undefined without a Standard, say so; guards will fail closed. - Respect
⊑. If you declarek₁ ⊑ k₂, verify subset behavior (C3.2‑K‑06).
Review checklist (10 minutes)
- Is signature F declared? Is the signature sufficient to evaluate membership?
- Is
U.EntitySet(slice)documented and addressable? - Is membership deterministic with explicit
Γ_time(no “latest”)? - If
⊑links exist, does subset behavior hold at sample slices? - Are Scope and membership kept separate in guards?
- Any Cross‑context classification? If yes, is KindBridge referenced (C.3.3)?
Worked Examples (informative)
Vehicle (signature F4) and membership
KindSignature(Vehicle) (F4):
hasVIN(x)is true and parseable;axles(x) ≥ 2;hasBrakeSystem(x);- Standards:
registryAPI v1.4;Γ_timepolicy: rolling 365 d for registry fields.
U.EntitySet(slice): “records in registryAPI v1.4 for plant A at build b, as of Γ_time.”
Extension(Vehicle, slice): all records satisfying the predicates in that slice.
Monotonicity: PassengerCar ⊑ Vehicle ⇒ Extension(PassengerCar, s) ⊆ Extension(Vehicle, s).
AuthenticatedRequest (definedness & fail‑closed)
KindSignature(AuthenticatedRequest) (F4):
RequestwithauthHeaderpresent andauthSignaturevalid according toAuthStandard v2.3;Γ_time: point in time for key validity check.
Definedness: MemberOf(–, AuthenticatedRequest, slice) is undefined if AuthStandard v2.3 is absent in slice ⇒ guards fail closed (C3.2‑K‑07).
Clinical cohort (low‑F signature; deterministic membership)
KindSignature(AdultPatient) (F3→F4 as it hardens):
ageYears(x, Γ_time) ≥ N(jurisdictional N varies; recorded in the Context’s signature note).EntitySet(slice): EHRehr‑east v7.5@Γ_time;- Membership deterministic if DOB present; undefined otherwise (fail closed).
Anti‑patterns & Remedies (informative)
Rationale (informative)
Why give F to KindSignature?
Because rigor in the definition of a kind materially affects how safely teams can quantify over it. A signature at F4 (predicate‑like) makes membership checkable in principle; F7+ (machine‑checked) can support proof‑carrying development. Keeping this separate from claim‑level F prevents “signature formalization” from inflating unrelated claims.
Why Extension is not Scope
- Extension answers: “Which entities count as
kin this slice?” - Scope (G) answers: “In which slices does this claim hold?” Blending the two recreates the old failure mode where “more abstract wording” was treated as “wider applicability.” USM already gives the set‑algebra for G; Kind‑CAL supplies the typed universe the claim quantifies over.
Why determinism and fail‑closed?
Guards must be reproducible and auditable: same slice ⇒ same membership result. If inputs are missing (undefinedness), the safest default is deny (fail closed), prompting either a richer slice or a scope/claim change.
Conformance checklist (normative)
C.3.2:End
KindBridge & CL^k — Cross‑context Mapping of Kinds
One‑line summary. Defines
KindBridgeas the normative mechanism for moving kinds (their intent and selected subkind‑of links) between bounded contexts (“Contexts”). A bridge declares how a source kind maps to a target kind, which parts of the⊑order are preserved or collapsed, and publishes a type‑congruence levelCL^kwith loss notes and a definedness area.CL^kpenalties apply only to Reliability (R) when a claim depends on Cross‑context classification; F (formality) and G (Claim scope) remain unchanged. Scope translation continues to use the USM Bridge + CL channel; KindBridge is a separate, parallel channel for EntityOfConcern.
Status. Normative in Part C. Identifier C.3.3. Audience. Engineering managers, architects, assurance leads, editors.
Depends on.
- C.3.1 — U.Kind & SubkindOf (Core): kinds are context-local
U.Kindrecords;⊑is a partial order; kinds do not carry Scope. - C.3.2 — KindSignature (+F) & Extension/MemberOf: signature declares its own F; membership
MemberOf(e,k,slice)is deterministic perU.ContextSlice. - A.2.6 — USM (Context slices & Scopes): Claim scope (G) and Work scope live on claims/capabilities; scope bridging and CL penalties are defined there.
- C.2.2 — F–G–R: weakest‑link; penalties land in R, not F/G.
- C.2.3 — U.Formality (F): signature rigor.
Non‑goals.
— No repository/notation mandates; conceptual only.
— No Scope mapping here (that’s USM); KindBridge maps kinds, not scopes.
— No new arithmetic on CL^k; it reuses the ordinal anchor semantics of CL (Part B) but applies to kinds.
Purpose & Audience
Cross‑context reuse fails in two orthogonal ways:
- Applicability (G): where the claim holds (handled by USM Scope Bridge).
- entityOfConcern (Kind): what the claim quantifies over (handled by KindBridge).
C.3.3 gives managers an explicit, auditable channel for (2), so a team can say, with evidence: “Vehicle in Lab maps to TransportUnit in Plant with CL^k=2; the EV subkind collapses; here’s what we lost.” Guards stay deterministic; assurance math stays clean (penalties in R only).
Context
Contexts use different classifications: ontology classes vs shape Standards, regulatory cohorts vs app types, etc. Informal “same‑name” reuse silently mutates entityOfConcern. USM already made scope moves explicit. KindBridge does the same for kinds: declare the mapping, rate its congruence, and capture known losses.
Problem
- Semantic drift. Moving a claim into a target‑context with a different taxonomy changes “what counts” without anyone noticing.
- Hidden order breaks. Subkind relationships invert or vanish; downstream proofs/tests are misapplied.
- Entangled channels. Teams conflate “scope mapping” with “kind mapping,” making it impossible to assign penalties coherently.
- Incomputable guards. “We map it somehow” yields non‑deterministic classification at guard time.
Forces
Solution — The KindBridge object (overview)
A KindBridge connects source Context A and target Context B for a set of kinds. It declares:
- Mapping of kinds: either to named target kinds or via signature translation rules.
- Order preservation: which
⊑links are preserved (monotone), which are collapsed, and which are unknown (not claimed). - Type‑congruence
CL^k: reuses the same anchors/labels as CL (Part B) but applies to kind intent/order (not to Scope). Gloss: higherCL^k⇒ closer preservation of kind intent and declared⊑links. - Loss notes: human‑readable list of invariants and subkinds not preserved.
- Definedness area: the subset of
U.ContextSlicecharacteristics where the mapping is intended to be used (e.g., certain Standards/versions). - Determinism: fixed versions + mapping rules ⇒ deterministic result (no “latest”).
Effect on assurance. When a claim in B depends on classification that goes through this bridge, reduce R by a monotone penalty Ψ(CL^k). Do not change F or G.
Norms & Invariants (normative)
The following formalize the KB‑01…KB‑12 rules announced in C.3.
Subject & Scope of a KindBridge
KB‑01 (Subject). A KindBridge maps:
- one or more KindSignature(s) from source to target; and
- an explicitly declared subset of
⊑links (which it claims to preserve or collapse).
KB‑02 (No Scope). A KindBridge MUST NOT map Claim/Work scope (G). Scope translation uses the USM Bridge + CL channel (A.2.6, Part B).
No blended score. Congruence for Scope (CL) and for Kind (CL^k) MUST NOT be aggregated into a single “interoperability” score in guards; each channel is assessed and penalized separately. See Annex C.3.A §5 (E‑06).
Declaration & Shape
KB‑03 (Declaration). A KindBridge record SHALL include:
- source Contexts, target Contexts, and vocabulary or Standard versions;
- a kind mapping per source kind
k: either a named target kindk′or a signature translation rule that constructs the target‑contextKindSignature(k′)(the result is declared and versioned in the target Context); - an order preservation claim for any
k₁ ⊑ k₂it covers: preserved / collapsed / unknown; CL^kvalue (using the CL anchor ladder) labeled “kind‑congruence”;- loss notes (non‑preserved invariants, collapsed subkinds, equality quirks);
- definedness area (constraints on
U.ContextSlicedimensions where the bridge is meant to apply).
KB‑04 (Determinism & local evaluation). Given fixed Context versions and mapping rules, translateₖ MUST be deterministic (no implicit “latest”). After mapping to k′, membership SHALL be evaluated using the target Context’s own KindSignature(k′) and MemberOf(–, k′, –); source‑context membership results MUST NOT be reused as truth in guards (they may be cited as evidence in R).
Order & Monotonicity
KB‑05 (Monotone order). If the bridge claims to preserve k₁ ⊑ k₂, then in the target Context translateₖ(k₁) ⊑′ translateₖ(k₂) MUST hold.
KB‑06 (No inversions). The bridge MUST NOT assert preserved links that invert order. If real‑world constraints force reversal, the link MUST be marked not preserved with a loss note.
KB‑07 (Collapse semantics). Marking a link as collapsed is allowed (two subkinds mapped to one target kind), but the record SHALL list the merged subkinds and any properties thereby lost.
Congruence & Assurance
KB‑08 (Anchor reuse & AT neutrality). CL^k reuses the ordinal anchor semantics of CL (Part B) but applies to kinds. Editors SHALL label it explicitly as kind‑congruence to avoid confusion with Scope CL. KindBridge records MUST NOT compute or alter KindAT (C.3.5 AT‑04); AT is editorial and independent of CL^k.
KB‑09 (Effect on R only). When a claim in the target Context depends on MemberOf(–, translateₖ(k), TargetSlice), a monotone penalty Ψ(CL^k) SHALL reduce R (alongside any Φ(CL) penalty from the Scope Bridge). Implementations MUST NOT adjust F or G due to CL^k.
KB‑10 (Chaining). For a chain of bridges, effective CL^k = min of the links (weakest‑link).
Loss Notes & Definedness
KB‑11 (Loss notes). Bridges SHALL publish human‑readable loss notes: which invariants of KindSignature are not preserved, which subkinds are collapsed, and any higher‑equality caveats (e.g., up‑to‑iso only).
KB‑12 (Definedness & guard use). The bridge’s definedness area SHALL be stated. Guards MUST fail closed outside it (i.e., if a classification relies on the bridge where it is not defined, the guard denies use).
Interactions (informative)
With USM Scope bridges (two channels)
When using a claim across Contexts, expect two concurrent bridges:
- Scope Bridge (USM): maps G; publishes CL; penalty Φ(CL) to R.
- KindBridge (this pattern): maps kinds; publishes
CL^k; penalty Ψ(CL^k) to R.
Discipline: compute both; do not collapse them into one “interoperability score.”
See Annex C.3.A §5 (E‑01) for the normative evaluation order in guards.
With membership (C.3.2)
After mapping k to k′ = translateₖ(k), the target Context evaluates membership as usual: MemberOf(e, k′, TargetSlice). If the bridge provides a signature translation, that definition becomes the local KindSignature(k′) (versioned per target Context policy).
With Role masks (C.3.4)
If a claim uses a RoleMask(k) across Contexts, you need:
- a KindBridge for
k(CL^k+ loss notes), and - a documented mask adapter (how mask constraints translate). Penalties still land in R. If the mask’s effect is stable and widely reused, consider promoting it to a subkind on the target side.
With guards (Annex C.3.A)
Use the Guard_XContext_Typed macro (Annex C.3.A), which requires both bridges and applies both penalties to R:
- find Scope bridge (CL≥threshold), translate G, check coverage;
- find KindBridge (
CL^k≥threshold), translate kind, check membership definedness; - apply Φ(CL) and Ψ(
CL^k) to R; keep F/G untouched.
Authoring, Review & Rating Guidance (informative)
Authoring a KindBridge
- Start narrow & honest. Declare only the kinds and
⊑links you actually preserve; mark the rest unknown. - Prefer named targets. If the target already has a suitable kind, map to it; use signature translation only when necessary, and list what is preserved, relaxed, or dropped.
- Write loss notes in plain language. Example: “EV vs ICE subkinds collapsed; battery‑health invariants dropped.”
- Fix the definedness area. Bind to target Standards/versions and any environment selectors essential to classification.
- Assign
CL^kfrom exemplars. Calibrate on concrete counter‑examples and preserved properties; resist optimistic ratings.
Review playbook (10 minutes)
- Two bridges present? Scope Bridge and KindBridge?
- Order claims honest? Any
⊑inversions? Collapses disclosed? CL^kplausible? Based on preserved properties, not name similarity?- Loss notes present? Will they force narrowing of Scope or extra tests?
- Definedness area clear? Guard will fail closed outside it?
- Penalties wired to R? No hidden tweaks to F/G?
Rating CL^k (rules of thumb)
- High
CL^k: signature equivalence or up‑to‑iso;⊑fragment preserved; only cosmetic losses. - Medium
CL^k: some invariants relaxed or lost; selected subkinds collapsed; order preserved on critical path. - Low
CL^k: name‑only correspondences; properties diverge; order not preserved. Expect significant R penalty and/or adapters.
Worked Examples (informative)
Vehicle → TransportUnit (manufacturing)
Source kind: Vehicle (K2, signature F4).
target Context: PlantB, kind TransportUnit exists.
KindBridge:
Vehicle ↦ TransportUnit; order: preservesPassengerCar ⊑ Vehicle; collapsesEV ⊑ VehicleintoTransportUnit(no EV subkind).CL^k=2(mid); loss notes: “battery‑health invariants not carried”; definedness: only forregistryAPI v1.4,Γ_timein last 365 d.
Use: Claim quantified over Vehicle crosses to PlantB.
Guards: scope bridge CL=2 (rig bias); kind bridge CL^k=2; both penalties reduce R. F/G unchanged.
AuthenticatedRequest across services (software)
Source kind: AuthenticatedRequest defined by AuthStandard v2.3.
target Context: Frontend with different auth header scheme.
KindBridge: signature translation (authHeader → x‑auth), preserves “signature valid” property; CL^k=3 (high).
Loss notes: none; definedness: only where AuthStandard v2.3 is in scope.
Effect: Rules quantified over AuthenticatedRequest can be reused; R penalty small (Ψ(3) near 1). Scope remains independent (API v2.3).
AdultPatient across jurisdictions (clinical)
Source kind: AdultPatient (≥ 18 at Γ_time).
target Context: JurisdictionY uses ≥ 21.
KindBridge: AdultPatient ↦ AdultPerson_Y with boundary mismatch; CL^k=1.
Loss notes: “Boundary 18 vs 21; map narrows to ≥ 21”.
Guard: Require mask adapter or narrow Scope to cohorts where DOB is known and ≥ 21. R penalty strong; F/G remain as declared.
Anti‑patterns & Remedies (informative)
Conformance Checklist (normative)
Integration requirements with Part B (bridges):
- B‑P1. Part B (Bridges) SHALL list KindBridge as a distinct bridge class alongside USM Scope bridges.
- B‑P2. Part B SHALL state that
CL^kpenalties route to R via a monotone Ψ, never to F/G. - B‑P3. Part B SHALL define chaining = min for both CL and
CL^k(weakest‑link). - Templates. ESG/Method templates should expose fields for Scope Bridge (CL) and KindBridge (
CL^k) with loss notes & definedness.
C.3.3:End
RoleMask — Contextual Adaptation of Kinds (without cloning)
One‑line summary. Defines
U.RoleMask(kind, Context)as a context‑local adaptation of aU.Kindthat (a) adds constraints and/or vocabulary bindings, and (b) may narrow membership deterministically within aU.ContextSlice, without creating a new kind. RoleMasks are catalogued, versioned, and guard‑addressable; frequent, stable constraint masks SHOULD be promoted to explicit subkinds. Cross‑context use of a RoleMask requires a KindBridge (for kinds) and, when needed, a MaskAdapter (for mask constraints). All penalties route to R; F/G remain unchanged.
Status. Normative in Part C. Identifier C.3.4. Audience. Engineering managers, architects, reviewers, editors.
Depends on.
- C.3.1 — U.Kind & SubkindOf (Core): kinds are intensional;
⊑is a partial order; kinds carry no Scope. - C.3.2 — KindSignature (+F) & Extension/MemberOf: signature F; deterministic
MemberOf(e,k,slice);EntitySet(slice). - C.3.3 — KindBridge & CL^k: Cross‑context kind mapping;
CL^kpenalties → R only. - A.2.6 — USM (Context slices & Scopes): Claim/Work scope (G) over
U.ContextSlice; bridges and CL for scope. - C.2.2 — F–G–R; C.2.3 — U.Formality (F).
Non‑goals. — No repository/notation mandates; conceptual only. — RoleMask is not a governance tier, data policy, or “mini‑type system.” — RoleMask does not redefine Scope; context conditions belong to USM.
Purpose (manager’s view)
Teams often need a local projection of a widely used kind:
- Constraint: “For our procedure, take
Vehiclewith ABS only.” - Vocabulary: “Here,
AuthHeaderis calledX‑Auth.”
If each team clones a fresh kind, catalogs fragment and bridges multiply. RoleMask is the disciplined alternative: keep the kind identity, apply declared constraints and bindings, and make the mask first‑class (registered, versioned, guard‑addressable). When a mask becomes stable “de‑facto subkind,” promote it to ⊑.
Benefits: fewer near‑duplicates, cleaner Cross‑context reuse, deterministic guards, and auditable narrowing instead of hand‑wavy “this is the version we mean.”
Context
Kinds (C.3.1/3.2) name what claims quantify over; USM (A.2.6) governs where claims hold. In practice, procedures need local tailoring of kinds for a role/process (compliance profile, product line, cohort). RoleMask gives that tailoring without mutating entityOfConcern (Kind) or applicability (Scope).
Problem
- Kind sprawl. Teams mint near‑duplicate kinds (“Account_PCI”, “Account_Ledger”), and alignment decays.
- Hidden constraints. Informal “we only accept …” statements leak into prose; guards can’t check them deterministically.
- Scope conflation. Contextual requirements (jurisdiction, API version) get smuggled into “type” talk, blurring Scope vs Kind.
- Cross‑context fragility. Masks don’t travel unless their constraints are mapped; teams reuse names and hope.
Forces
Solution — RoleMask (overview)
A RoleMask is a named, versioned binding U.RoleMask(kind, Context) that:
- Adds constraints (entity‑level predicates only),
- Binds vocabulary/notation (aliases, field maps) for the Context/process,
- May declare context expectations (selectors over
U.ContextSlice, e.g., jurisdiction, API version). These are enforced via USM Scope guards (A.2.6) and do not change mask membership. - May narrow membership:
Extension_mask(k, s) ⊆ Extension(k, s)(entity‑level narrowing only), - Never creates a new kind; identity stays with
k. - Is guard‑addressable and deterministic (no “latest”).
Mask types (declared):
- Constraint mask — adds constraints; may narrow membership;
- Vocabulary mask — aliases only; no membership change;
- Composite mask — both.
Separation discipline.
- Entity‑level predicates (e.g., “hasABS(x)”) → mask membership (narrowing).
- Context conditions (e.g., “jurisdiction=EU”, “API=v2.3”) → USM Scope guards (intersection), not mask membership. Masks may carry both kinds of information, but guards must route them into the right channel.
Norms & Invariants (normative)
The following formalize and expand RM‑01…RM‑08 referenced in C.3.
Definition & Shape
RM‑01 (Definition). U.RoleMask(kind, Context) SHALL be a named, versioned record with:
(a) intent (what role/procedure the mask serves),
(b) constraints (entity‑level predicates; optional context requirements),
(c) vocabulary/notation bindings,
(d) membership narrowing definition (if any),
(e) intended guard use.
RM‑02 (Not a new kind). A RoleMask MUST NOT introduce a new U.Kind. If the domain needs a stable refinement, Contexts SHALL publish an explicit SubkindOf node (C.3.1).
RM‑03 (Determinism). Membership under a mask (if defined) MUST be deterministic given slice and published constraints; implicit “latest” is forbidden.
RM‑04 (Mask taxonomy). A mask SHALL declare its type: constraint / vocabulary / composite. — Vocabulary masks MUST NOT change membership; — Constraint/composite masks MAY narrow membership only via entity‑level predicates.
Separation of channels
RM‑05 (Context vs entity).
- Predicates about entities (features, attributes) MAY narrow membership:
Extension_mask(k, s) ⊆ Extension(k, s). - Predicates about ContextSlice (jurisdiction, Standards, Γ_time) SHALL be enforced via USM Scope guards (A.2.6). Masks MUST NOT hide Scope requirements inside membership checks.
Guard routing. Enforce ContextSlice predicates via USM Scope (A.2.6) and entity predicates via membership; see Annex C.3.A §4.3 (Guard_MaskedUse) and §5 (E‑01) for the normative order of checks.
RM‑06 (Guard use). Guards MAY reference a RoleMask by name only if the mask is registered, versioned, and its constraints are observable at guard time. Mask names MUST NOT be treated as kind synonyms.
Promotion & Catalog
RM‑07 (Promotion rule). A constraint mask reused broadly and stably SHOULD be promoted to an explicit subkind with a ⊑ link; retire the mask or keep it as a vocabulary wrapper. Editors SHALL track promotions in the catalog.
RM‑08 (Catalog). Contexts SHALL catalog masks (name, version, type, intent, constraints, bindings, examples, related subkinds, known bridges/adapters). Redundant masks SHOULD be consolidated.
Cross‑context use
RM‑09 (Bridges & adapters). If a claim uses MemberOf(–, RoleMask(k), TargetSlice) across Contexts, the receiving Context SHALL require:
(a) a KindBridge for k (CLᵏ, loss notes), and
(b) a MaskAdapter — a documented, deterministic mapping of the mask’s entity‑level constraints and vocabulary bindings into the target Context — whenever those constraints/bindings differ.
Penalties MUST route to R: Ψ(CLᵏ) for kind, plus any Φ(CL) for scope bridge.
RM‑10 (Definedness & fail‑closed). Mask evaluation SHALL state its definedness area; outside it, guards fail closed.
Invariants & Non‑goals (normative)
- No Scope leakage. RoleMasks cannot widen/narrow Claim scope (G); any context conditions are enforced by USM guards.
- Identity preservation. The carrier kind remains
k; RoleMask does not change entityOfConcern. - Weakest‑link unaffected. RoleMasks do not alter weakest‑link rules on F/R; guards route entity predicates to membership and context predicates to USM Scope.
Interactions (informative)
With Kinds & Subkinds (C.3.1)
Use RoleMask for procedural tailoring. If the tailoring becomes conceptual and stable, introduce a subkind with ⊑ and update references.
With Membership & Signature (C.3.2)
- Entity‑level constraints live in mask membership (deterministic).
- Signature F belongs to the kind; raising F in the signature does not auto‑change masks.
With KindBridge (C.3.3)
A RoleMask crossing Contexts needs two artifacts: the KindBridge (CL^k, loss notes) and a MaskAdapter (how constraints/aliases translate). R gets both penalties; F/G stay intact. If the adapter systematically narrows membership in the target Context, consider target‑side subkind.
With Guards (Annex C.3.A)
Use Guard_MaskedUse (Annex C.3.A §4.3). It requires:
— mask registration & determinism;
— Scope coverage (A.2.6), Γ_time explicit;
— where Cross‑context: KindBridge (CL^k) + MaskAdapter + penalties → R.
— Cross‑context combo. When masks cross Contexts, use Guard_MaskedUse together with Guard_XContext_Typed (Annex C.3.A §4.5) so both bridges are checked and both penalties (Φ(CL) and Ψ(CLᵏ)) land in R.
— Order of checks. Follow Annex C.3.A §5 (E‑01): typed compatibility first, then Scope coverage, then penalties to R and freshness.
Anti‑patterns & Remedies (informative)
Worked Examples (informative)
Vehicle@ABSOnly (constraint mask)
Kind. Vehicle (K2, signature F4).
Mask. Vehicle@ABSOnly — entity‑level predicate hasABS(x)=true; type constraint.
Guards. MemberOf(–, Vehicle@ABSOnly, TargetSlice) defined & deterministic; Scope (surface/speed/rig/Γ_time) checked separately.
Promotion? If ABS‑only becomes a conceptual category, publish VehicleWithABS ⊑ Vehicle and retire the mask.
AuthenticatedRequest@Frontend (vocabulary mask)
Kind. AuthenticatedRequest defined by AuthStandard v2.3.
Mask. @Frontend binds authHeader → X‑Auth (aliases only); no narrowing; type vocabulary.
Cross‑context. If reused in another Context, require KindBridge for the kind; no MaskAdapter needed (aliases are local).
R. Only scope bridge penalties apply (if any).
AdultPatient@Clinic (composite mask) across jurisdictions
Kind. AdultPatient (≥ 18 at Γ_time).
Mask. @Clinic: entity constraint “DOB present”; context hint “EHR system = X” (this part belongs with Scope). Type composite.
Cross‑context. Jurisdiction Y uses ≥ 21 → KindBridge with CL^k=1; MaskAdapter maps DOB fields.
Guards. Scope bridge (coding system) + KindBridge + MaskAdapter; penalties Ψ(1) (kind) + Φ(CL) (scope) to R.
Outcome. Allowed with reduced R; consider target‑side subkind AdultPerson_Y.
Authoring & Review Guidance (informative)
Authoring a RoleMask card
Fields (suggested). name, kind, type (constraint/vocabulary/composite), intent, constraints (entity vs context split), bindings, membership definition (if any), definedness, examples, known bridges/adapters, promotion note.
Rules of thumb.
- Keep entity predicates small and testable.
- Put context in Scope, not in membership.
- If ≥ 3 teams reuse the same constraint mask → promotion review.
Reviewer 7‑point checklist
- Mask registered and versioned?
- Type declared correctly (constraint/vocabulary/composite)?
- Entity vs context split respected?
- Determinism (no “latest”) satisfied?
- Guard routes context to USM and entity to membership?
- Any Cross‑context use has KindBridge + MaskAdapter with penalties to R?
- Promotion warranted (stable, reused) or consolidation needed?
Conformance Checklist (normative)
C.3.4:End
KindAT — Intentional Abstraction Facet for Kinds (K0…K3)
One‑line summary. Defines KindAT as an informative facet attached to
U.Kindthat classifies the intentional abstraction stance of a kind—K0 Instance, K1 Behavioral Pattern, K2 Formal Kind/Class, K3 Up‑to‑Iso—to guide ΔF/ΔR planning, bridge expectations, catalog/search, and refactoring. KindAT is not a Characteristic: it has no algebra, no thresholds, and MUST NOT appear in guards or composition math. All assurance remains in F–G–R; typed semantics remain in C.3.1–C.3.4.
Status. Mixed: — Informative for the anchors, heuristics, examples, and guidance. — Normative for the usage rules that forbid employing AT in guards/composition and constrain its placement.
Placement. Part C (Kinds), identifier C.3.5. Audience: engineering managers, architects, editors, assurance leads.
Depends on.
— C.3.1 (U.Kind, U.SubkindOf (⊑)), C.3.2 (KindSignature + F, Extension/MemberOf), C.3.3 (KindBridge + CL^k), C.3.4 (RoleMask).
— A.2.6 USM (Claim/Work scope over U.ContextSlice), C.2.2 F–G–R, C.2.3 U.Formality (F).
— MM‑CHR distinction Facet vs Characteristic (editors).
Non‑goals. — No numerical scale, no gating, no composition operators, no “quality” scoring. — No effect on F, G, or R besides planning hints.
Purpose (manager’s view)
Teams constantly decide how far to formalize and how broadly to validate:
- Are we speaking about this cohort (instances), about things that behave like X (pattern), about a formal class with invariants, or about objects up to isomorphism?
- Given that stance, should we invest in F4 predicates, F7 proofs, or R across variants?
- What kind of KindBridge is realistic (coarse mapping vs up‑to‑iso), and what
CL^kshould we expect?
KindAT answers these with a small, shared vocabulary (K0…K3) that is safe to use (cannot distort F/G/R) yet actionable for planning and catalog/search.
Context & Rationale
The orthogonality we preserve
- G (Claim scope) is where a claim holds (A.2.6).
- Kinds give what a claim is about (C.3.1/3.2).
- R is assurance (evidence, freshness, penalties).
- F is expression rigor (C.2.3).
Teams often conflate abstraction with applicability (“sounds general ⇒ applies broadly”) or over‑engineer proofs where slice‑checks suffice. AT separates these concerns.
Why a facet, not a Characteristic
Per MM‑CHR, Characteristics (e.g., F, G) carry algebra and appear in guards/composition. KindAT is only a tag on U.Kind:
- No algebra, no thresholds, not used in guards.
- Editorial placement only: on kinds, not on claims.
- Planning signal: what ΔF and ΔR typically pay off; what bridge style to expect.
This keeps AT useful without risking a “second G” or back‑door quality scores.
Design choice recap (moved from C.3 §15.2)
- Making AT a Characteristic would duplicate G’s role and encourage gating.
- As a facet, AT remains a catalog/navigation and planning device, not an assurance dimension.
Anchors K0…K3 (informative)
How to read. Each anchor states the intentional stance of the kind, inclusion cues, non‑examples (to prevent misuse), and planning hints (ΔF/ΔR/bridge expectations). Anchors are context‑local editorial tags on
U.Kind.
K0 — Instance‑level
Intent. The kind denotes exemplars or a tightly curated set; often a named cohort or a concrete template.
Cues. Membership relies on listing or direct identity features; little to no general invariants.
Non‑examples. Any kind with stable, general invariants belongs in K2.
Planning hints. Focus R on TargetSlice (executable checks, F5/6); avoid premature proof engineering. Bridges are instance‑maps; expect low CL^k outside the Context.
K1 — Behavioral Pattern
Intent. The kind is a role/behavioral pattern (“things that act like …”), typically stated via Standards or controlled NL, not a full type.
Cues. “Duck‑typing” flavor; Standards reference behavior/state transitions.
Non‑examples. If you can state global invariants as predicates, consider K2.
Planning hints. Invest in F3→F4 (predicate‑like acceptances); R must test behavioral diversity; bridges are pattern maps with moderate CL^k.
K2 — Formal Kind/Class
Intent. A formal class with explicit invariants/relations (ontology class, type with Standards).
Cues. Predicate‑like signature, subkind lattice, invariants reviewed.
Non‑examples. Pure examples/cohorts (K0); informal roles (K1).
Planning hints. Raise KindSignature F to F4+, consider F7 for safety‑critical cores; R should cover subkinds/variants; bridges are type‑maps, CL^k often medium/high.
K3 — Up‑to‑Iso
Intent. Defined up to isomorphism/equivalence (category‑theoretic flavor; “equal as structure,” not by identity); equality‑as‑structure matters.
Cues. Statements invariant under isomorphism; reasoning by equivalence classes.
Non‑examples. Classes where identity matters beyond structure.
Planning hints. Expect up‑to‑iso bridges; CL^k can be high where equivalence is respected. F7–F9 likely for key properties; R focuses on witnesses of equivalence at interfaces.
Manager Heuristics (informative)
Misuse & Antidotes (informative)
- “Higher AT ⇒ wider G.” Wrong. G changes only via ΔG (USM). AT does not alter scope.
- “Gate on AT.” Wrong. Use F thresholds and scope/evidence guards; AT is never a gate.
- “Depth in
⊑⇒ AT.” Wrong. AT is about intentional stance, not graph depth. - “AT on claims.” Wrong. AT tags
U.Kindonly. - “AT as quality score.” Wrong. Use F and R for rigor/reliability.
Usage Rules (normative)
These are the only normative constraints in this pattern. Everything else is guidance.
AT‑01 (Facet, not Characteristic). KindAT SHALL be treated as a Facet per MM‑CHR: it has no algebra, no thresholds, and MUST NOT appear in guards or composition math.
AT‑02 (Placement). If recorded, KindAT SHALL be attached to U.Kind (or its catalog card). It MUST NOT be attached to claims/capabilities or used as a proxy for G/F/R.
AT‑03 (Editorial discipline). Editors SHALL NOT write text implying “higher AT widens scope” or “higher AT increases rigor/reliability.” Any such text MUST be revised to reference ΔG/F/R explicitly.
AT‑04 (Bridge neutrality). KindBridge records MUST NOT compute or adjust AT; they may include informative remarks about likely anchor alignment. CL^k is independent of AT and is assessed from signature/order preservation.
AT‑05 (Catalog). Contexts that use AT SHOULD record it in Kind catalog entries alongside: signature snippet & F, subkinds, RoleMasks, KindBridges. Absence of AT implies “not set”, not K0.
Authoring & Review Guidance (informative)
How to tag (fast rubric)
- If the card lists concrete items/cohorts, tag K0.
- If the card defines behavioral obligations in prose/templates but few global invariants, tag K1.
- If the card states predicates/invariants and participates in a subkind lattice, tag K2.
- If the card explicitly reasons up to isomorphism, tag K3.
Review checklist (5 minutes)
- Is the carrier a
U.Kind(not a claim)? - Does the tag match the signature (intent)?
- Are ΔF/ΔR implications noted for planning (not gating)?
- Any RoleMasks that should be promoted to subkinds (K2 hygiene)?
- Any Cross‑context reuse that suggests bridge style (pattern/type/iso)?
Integration Notes (informative)
- With C.3.1/3.2 (Kinds, Signature, Extension). AT guides how to evolve signature F and what R coverage is sensible; it does not change membership semantics.
- With C.3.3 (KindBridge). AT hints at likely bridge style (instance‑map / pattern‑map / type‑map / up‑to‑iso), but
CL^kis still computed from signature/order preservation; penalties route to R. - With C.3.4 (RoleMask). Persistent K1‑style masks often warrant promotion to K2 subkinds.
- With A.2.6 (USM). All scope decisions remain under G. AT text should never be used to infer coverage.
- With C.2.3 (F). AT does not raise/lower F; it suggests where raising F is cost‑effective.
Worked Mini‑Examples (informative)
- K0 (Instance).
Account_US_GAAP_2025_Q1_Cohort. Plan R slice checks; avoid type‑maps across Contexts. - K1 (Behavior).
CacheableRequest(“idempotent under retry; cache key well‑formed”). Raise F3→F4; design R for failure‑mode diversity; expect pattern bridges. - K2 (Formal).
Accountwith invariants (balance = debits−credits; posting rules). Raise F4+; plan R overAsset/Liabilitysubkinds; bridge via type maps. - K3 (Up‑to‑Iso).
UndirectedGraphup to node relabeling. Expect up‑to‑iso bridges; proofs at F7+; R checks interface equivalence witnesses.
Conformance Checklist (normative)
C.3.5:End
Typed Guard Macros for Kinds + USM (Annex)
One‑line summary. Provides normative guard macros that combine USM Scope (A.2.6) with Kind‑CAL (C.3.x) so authors can gate state changes and compositions that quantify over kinds without conflating entityOfConcern (Kinds) with applicability (Scope G) or assurance (R). Includes decision trees, anti‑patterns, and examples (informative). AT (KindAT) is never used in guards.
Status. Mixed: — Normative: guard macro clauses, evaluation order, fail‑closed discipline, conformance checklist. — Informative: … decision trees, anti‑patterns, worked examples, macro skeletons.
Placement. Part C (Kinds), identifier C.3.A (Annex). Audience: engineering managers, editors, reviewers, assurance leads.
Depends on.
— A.2.6 USM: U.ContextSlice, U.ClaimScope (G), U.WorkScope, ∈/∩/SpanUnion/translate, Γ_time policy, Bridge + CL (scope).
— C.3.1: U.Kind, U.SubkindOf (⊑); C.3.2: KindSignature (with F) and Extension/MemberOf; C.3.3: KindBridge + CL^k (kind‑congruence) & loss notes; C.3.4: RoleMask.
— C.3.5: KindAT (facet) — explicitly forbidden in guards.
— C.2.2 F–G–R: weakest‑link, penalties to R only; C.2.3 F: F0…F9 (expression rigor).
— Part B Bridges & CL: scope bridge semantics and CL ladder.
Purpose & Audience
Purpose. Give Contexts a single set of guard shapes to: (a) admit typed claims safely, (b) compose typed claims/specs, (c) use RoleMasks properly, and (d) reuse across Contexts via both scope and kind bridges—without inventing new scales or conflating G, F, and R.
Audience. Engineering managers and reviewers who must read/author guards that are legible, deterministic, and auditable in context.
Context & Problem
Projects often:
- treat “more abstract wording” as wider G,
- glue claims with incompatible entityOfConcern (kinds),
- move typed content across Contexts without declared bridges,
- or bake AT (abstraction vibe) into decision logic.
C.3.A fixes this by supplying guard macros that: — separate typed compatibility (kinds) from Scope coverage (USM), — require both bridges where needed, — push congruence penalties to R only, and — forbid AT in guards.
Solution Overview (what these guards do)
All guards in this Annex share three invariants:
- Fail‑closed. If any required predicate is undefined/false, the guard denies the transition.
- Deterministic. Given a fixed TargetSlice (with explicit Γ_time) and published declarations, evaluation yields one outcome.
- Separation of concerns.
Typed compatibility (same‑Context
⊑or KindBridge) is not Scope. Scope coverage is a USM set‑membership judgment over Context slices. Assurance penalties (Φ(CL) for scope bridges; Ψ(CL^k) for kind bridges) reduce R only.
Normative Guard Macros
Notation. “SHALL” clauses are normative obligations. “Notes” are informative reminders. Names like
Guard_TypedClaimare editorial handles; Contexts may alias them, but MUST preserve semantics. Macro names (e.g.,Guard_TypedClaim) are editorial handles; Contexts may alias them provided the logical obligations are preserved.
Guard_TypedClaim — admit a claim quantified over a kind
Intent. Approve a state transition that asserts Claim C which quantifies over U.Kind k at TargetSlice.
Guard_TypedClaim(C, k, TargetSlice, thresholds?) — SHALL include, in this order:
- ScopeCoverage.
U.ClaimScope(C) covers TargetSlice. (USM A.2.6) - Γ_time declared. TargetSlice SHALL specify Γ_time (point/window/policy). No “latest”. (A.2.6)
- Kind definedness.
MemberOf(?, k, TargetSlice)is defined and deterministic. (C.3.2 K‑05/K‑07) - Typed compatibility.
4.1 same Context: if C expects
k′, requirek ⊑ k′. (C.3.1) 4.2 Cross Context: if Contexts differ, require a declared KindBridge that mapsk → k′and publishesCL^k ≥ cwith loss notes. (C.3.3) - Assurance penalties (R only). If step 4.2 used a KindBridge, the guard SHALL apply a monotone penalty Ψ(
CL^k) to R. If a Scope bridge was used to move C’s Scope (USM), apply Φ(CL) to R. (C.2.2 + C.3.3 + Part B) - Evidence freshness (if trust is implied). Freshness windows and expiry checks SHALL be separate predicates (not Scope). (C.2.2)
- Formality threshold (if ESG mandates). If the Context gates rigor, require
U.Formality(C) ≥ F_k. (C.2.3)
Prohibitions. — AT forbidden. KindAT MUST NOT appear in this guard. (C.3.5 AT‑01/02) — No “domain” placeholders. Guards SHALL name an addressable TargetSlice, not a fuzzy “domain”.
Guard_TypedJoin — compose two typed claims/specs (A → B)
Intent. Permit composition where A produces facts over k_A and B consumes k_B.
Guard_TypedJoin(A, k_A; B, k_B; TargetSlice) — SHALL include:
- TypedCompat.
1.1 same Context: require
k_A ⊑ k_B. 1.2 Cross Context: require KindBridge mappingk_A → k′_BwithCL^k ≥ candk′_B ⊑ k_B. - ScopeSerial. Compute
Scope_serial = ClaimScope(A) ∩ ClaimScope(B). RequireScope_serial covers TargetSlice. (A.2.6) - Penalties (R only). Apply Ψ(
CL^k) if a KindBridge was used; apply Φ(CL) if a Scope bridge was used. (C.2.2 / Part B / C.3.3) - Freshness. Guard SHALL assert required freshness windows for evidence along the serial path.
- No type‑by‑scope. The guard MUST NOT widen Scope to “fix” a type mismatch; remedies are subkind introduction, adapter, or bridge.
Mask awareness. If B expects a RoleMask(k_B): either show A’s outputs already satisfy mask constraints, or add a documented mask adapter (see 4.3) and treat any contextual constraints as part of ScopeSerial.
Guard_MaskedUse — use a RoleMask with a kind
Intent. Use U.Kind k under a RoleMask m in Context R.
Guard_MaskedUse(k, m, TargetSlice) — SHALL include:
- MaskRegistered.
RoleMask(k, m, version)is registered and versioned. (C.3.4 RM‑06) - MaskDeterminism. All mask constraints are observable on TargetSlice; if the mask narrows membership, it SHALL be deterministic. (RM‑03)
- MaskType clarity. Mask SHALL declare its type: constraint / vocabulary / composite. (RM‑04)
- Promotion cue. If mask is reused widely as a de‑facto subkind, editors SHOULD promote it to an explicit
⊑link. (RM‑05) - Cross‑context use. If
TargetSlice.Context ≠ owner(k).Context, require: 5.1 KindBridge withCL^k ≥ c; 5.2 MaskAdapter (if constraints need translation), deterministic; 5.3 Penalty Ψ(CL^k) to R. (RM‑07 + C.3.3) - ScopeCoverage.
U.ClaimScope(artifact) covers TargetSlice. (A.2.6)
Prohibitions. — Mask ≠ Kind. Guards MUST NOT treat the mask name as a synonym for the Kind. (RM‑06)
Guard\SpanUnion\Typed — publish parallel coverage across independent support lines
Intent. Publish SpanUnion of scopes for the same typed claim supported by independent lines L₁…Lₙ.
Guard_SpanUnion_Typed(C, k, {Lᵢ}) — SHALL include:
- Per‑line discipline. For each line
Lᵢ, first satisfy Guard_TypedClaim(C, k, Sliceᵢ) (or its Cross‑context variant) at the relevant slices/supports. - Independence justification. Publisher SHALL include a partition or certificate showing that essential components of
Lᵢare disjoint fromLⱼ(no shared weakest link). (A.2.6 §7.3) - Published scope.
Scope_published = SpanUnion({Sᵢ}), where eachSᵢis the serial scope for lineLᵢ. - No overreach. The union MUST NOT include slices not covered by any
Sᵢ. - Typed consistency. The entityOfConcern (kind k) is the same across lines; if not, normalize via subkinds or adapters before union.
Note. Independence and union rules are USM‑native; this macro ties them to typed claims without adding new algebra.
Guard\XContext\Typed — Cross‑context typed reuse (both bridges)
Intent. Reuse C quantified over k in another Context’s TargetSlice.
Guard_XContext_Typed(C, k, TargetSlice) — SHALL include:
- Scope bridge. There exists a Scope Bridge b_s
(source = owner(C).Context, target = TargetSlice.Context)with CL ≥ c_s. (Part B) - Kind bridge. There exists a KindBridge b_k
(source = owner(k).Context, target = TargetSlice.Context)withCL^k ≥ c_k. (C.3.3) - Mapped scope coverage.
Scope′ = translate(b_s, ClaimScope(C))andScope′ covers TargetSlice. - Mapped kind definedness.
k′ = translate(b_k, k)andMemberOf(?, k′, TargetSlice)is defined. - Penalties (R only). Apply Φ(CL(b_s)) and Ψ(
CL^k(b_k)) to R. - Loss notes. Publisher SHALL attach loss notes from both bridges (rig bias, collapsed subkinds, etc.).
Prohibitions.
— Do not “merge” bridges; Scope and Kind are orthogonal channels.
— Do not alter F or G due to CL/CL^k; penalties land in R only.
Evaluation Semantics & Order (normative)
E‑01 (Order of checks). Guards SHALL check typed compatibility first (same‑Context ⊑ or KindBridge), then Scope coverage (USM), then apply penalties to R and verify freshness.
E‑02 (Determinism). Given fixed inputs (slices, bridges, versions), evaluation MUST be deterministic. “Latest” time, unversioned Standards, or implicit mappings are disallowed.
E‑03 (Fail‑closed). Undefined membership (MemberOf) or missing bridge MUST cause guard failure.
E‑04 (No AT in guards). AT is an editorial facet and MUST NOT be referenced. (C.3.5 AT‑01/02)
E‑05 (Weakest link on congruence). For chained bridges, effective CL / CL^k is the minimum of links.
E‑06 (Separation of predicates). Scope coverage and evidence freshness SHALL be distinct predicates; do not fold freshness into Scope or kinds.
Evaluation order. Apply checks in the order defined in §5 (E‑01): typed compatibility → Scope coverage → penalties to R → freshness.
Conformance Checklist (normative)
What counts as “proven‑equivalent” (editorial rule)
A Context may adopt a different surface phrasing iff the Context’s guard contains all obligations listed in the relevant macro, in the same logical roles (typed compatibility, Scope coverage, R penalties, freshness).
Where penalties land (assurance calculus hook)
Norm. Φ(CL) (scope congruence) and Ψ(CL^k) (kind congruence) are monotone non‑increasing functions into R. Contexts SHALL calibrate them per policy; this Annex does not prescribe numeric forms.
Minimal conceptual formulas (informative)
- R after bridges:
R_final = R_base × Φ(CL_scope) × Ψ(CL_kind)(concept only). - No arithmetic on F/G. F is ordinal (thresholds only); G is set‑valued (membership only).
Decision Trees (informative)
D1 - Admitting a typed claim
- same Context? If yes → check
⊑(k ⊑ k′if expected). If no → require KindBridge. - Scope coverage? Compute
covers(TargetSlice). - Membership defined?
MemberOf(?, k(′), TargetSlice)defined? If no → deny. - Bridges used? Apply penalties Φ/Ψ to R.
- Freshness? Check windows. Optional:
F ≥ F_kif ESG mandates.
D2 - Composing A → B
- Typed:
k_A ⊑ k_Bor KindBridge tok′_B ⊑ k_B. - Scope:
Scope(A) ∩ Scope(B)covers TargetSlice. - Penalties: apply Φ/Ψ to R.
- Freshness: along serial path.
- If mask expected: either A implies it or add mask adapter.
D3 - Union across lines
- Prove per‑line typed admission.
- Provide independence partition.
- Publish SpanUnion; no extrapolation.
Guard Anti‑patterns & Remedies (informative)
Worked Examples (informative, brief)
Detailed scenarios remain in C.3 §11. This Annex sketches how the macros apply; cross‑reference as needed.
E1 — Safety braking policy (same Context).
Use Guard_TypedClaim: PassengerCar ⊑ Vehicle passes; ClaimScope ∩ plant scopes covers TargetSlice; no bridges → no penalties; freshness checked.
E2 — Cross‑plant reuse (both bridges).
Use Guard_XContext_Typed: Scope bridge (CL=2) narrows temp; KindBridge (CL^k=2) collapses EV subkind. Apply Φ(2)×Ψ(2) to R; publish loss notes.
E3 — API rule with adapter.
Use Guard_TypedJoin: producer Request → consumer expects AuthenticatedRequest. Either prove ⊑ or add adapter; Scope remains separate (API v2.3 with Γ_time window).
E4 — Masked clinic cohort across jurisdiction.
Use Guard_MaskedUse + Guard_XContext_Typed: registered mask, deterministic DOB constraint; KindBridge CL^k=1; Scope bridge CL depends on coding; penalties to R; Scope narrowed to overlap.
Rationale (why an Annex) (informative)
- Focus. Keeps guard mechanics together, easing adoption in ESG/Method templates.
- Separation. Prevents leakage of AT/typed flavor into “Scope math”.
- Auditability. Standard shapes let reviewers check determinism, bridges, penalties, and freshness quickly.
- Inter‑pattern glue. Hooks USM, Kind‑CAL, Bridges, and F–G–R without inventing new scales.
C.3.A:Annex A - How typed reasoning plugs into Compliance & Regulatory Alignment [A/I]
For managers. This section shows how to make regulatory adoption and reuse precise, auditable, and portable using Kinds, KindBridges (with a kind‑bridge congruence level, noted as CL^k for editors), and USM Scope. It cleanly separates what the law is about from where and when it applies, and routes any cross‑jurisdiction uncertainty to R (assurance). It never changes F (form) or G (scope) to hide mismatches.
C.3.A:A.1 Purpose & fit
What this solves. Regulations and standards name classes of things (“Adult person,” “Class II medical device,” “Personal data,” “Lease”). In one context they are native; in another they are foreign. Without typed reasoning, teams either (a) hand‑translate terms (silently changing meaning), or (b) reduce everything to Context labels (“domain = EU”), which cannot be checked by guards.
What we add.
- Model regulatory categories as Kinds (with
KindSignatureand⊑), - map them across Contexts with KindBridges and type‑congruence
CL^k, - express Claim scope (G) over Context slices that explicitly list jurisdiction, version, and a time selector (Γ_time), and
- apply R‑penalties (
Ψ(CL^k)and, if scope is bridged,Φ(CL)) while keeping F and G unchanged.
C.3.A:A.2 Normative obligations
Conformance. A model or authoring action conforms to A.2 iff it satisfies C‑REG‑1..C‑REG‑8 below.
C‑REG‑1 (Regulatory kinds). Regulatory categories SHALL be represented as U.Kind in the authority’s Context (e.g., AdultPerson@RegY, MedicalDeviceClassII@FDA, PersonalData@GDPR, Lease@IFRS). Each such kind SHALL have a KindSignature with a declared F level (C.3.2).
C‑REG‑2 (KindBridge). Cross‑context reuse of a regulatory category MUST declare a KindBridge with a kind‑bridge congruence level (CL^k) and loss notes (C.3.3). The mapping SHALL preserve the “is‑a / subkind‑of” direction and MUST NOT invert it.
C‑REG‑3 (Scope is USM). Regulatory applicability (jurisdiction, effective dates, product families, platforms) SHALL be expressed as Claim scope (G) over U.ContextSlice, with an explicit time selector (Γ_time). Applicability MUST NOT be encoded into kinds.
C‑REG‑4 (No synonym shortcuts). Editors MUST NOT treat legal terms as synonyms of local kinds without a KindBridge. Any term alignment SHALL be documented (mapping + CL^k + loss notes).
C‑REG‑5 (Determinism). MemberOf(e, k_reg, slice) MUST be deterministically evaluable when used in guards (no “latest law” or unstated grace periods).
C‑REG‑6 (Penalties land in R). When a claim or guard relies on Cross‑context classification (membership decided via a KindBridge), the receiving Context MUST apply the kind‑bridge penalty (based on CL^k) to R; if the Scope is also bridged, apply the scope‑bridge penalty (based on CL) to R as well. Invariant: penalty routing changes R only; F and G remain unchanged.
C‑REG‑7 (Editioning). Changes in law/regulator guidance that alter membership or applicability SHALL be recorded as content changes: update KindSignature (kinds) and/or update Claim scope (ΔG±). Guards MUST name a time selector (Γ_time) and MUST NOT rely on an implicit “latest” time.
C‑REG‑8 (Masks, not clones). Local process nuances (e.g., clinic‑specific cohort definitions) SHALL be captured with RoleMasks over the adopted kind; editors MUST NOT clone a new kind unless a stable subkind is warranted.
C.3.A:A.3 Guard macros (ready to use)
(a) Guard_RegAdopt — adopt a regulatory requirement into a Context (Plain: check scope, map the legal category, and account for penalties)
Use when an internal policy is defined by reference to an authority’s category.
(b) Guard_RegChange — react to a regulatory change (Plain: re‑issue the kind and/or scope and refresh penalties)
(c) Guard_RegXContextUse — cross‑jurisdiction use with both bridges (Plain: move scope and kind, then account for both penalties)
C.3.A:A.4 Worked examples [I]
(1) Healthcare — “Adult” dosage rule across jurisdictions
Reg source. Jurisdiction Y defines AdultPerson@RegY (AT around K2, F4) with age at least 18; your hospital Context uses AdultPatient (age at least 21).
Claim. “For all x ∈ AdultPatient: dosage ≤ D/kg for drug M.”
Adoption.
- KindBridge. Map
AdultPerson@RegY → AdultPatient;CL^k = 1; loss note: boundary mismatch (18↔21). - Scope.
{jurisdiction=Y, formulary=M, time selector (Γ_time)=from 2026‑01‑01}. - Guard.
Guard_RegAdoptpasses; R penalized byΨ(1). Policy narrows Scope to mapped cohort (age≥21) for in‑house use. - Change. If Y changes adult to ≥19 (new edition), run
Guard_RegChange: version the kind, refresh the bridge, re‑assessCL^k, update guards.
(2) Privacy — GDPR↔CCPA PII across Contexts
Reg kinds. PersonalData@GDPR, PersonalInformation@CCPA.
Internal kind. PersonalData@Product with masks per data store.
Policy claim. “No sharing of SensitiveAttribute outside processors.”
Adoption.
- KindBridges.
SensitiveAttribute@GDPR → SensitiveAttribute@Product(CL^k=2);SensitivePersonalInformation@CCPA → SensitiveAttribute@Product(CL^k=1, loss: biometric nuance). - Scope. Two policies with SpanUnion over
{jurisdiction=EU}and{jurisdiction=CA}, each with its own Γ_time windows and evidence freshness. - Guards. For CA, apply stronger R penalty (
Ψ(1)), and narrow to the mapped subset (exclude ambiguous fields). - Do not. Do not rename GDPR terms to local labels without a KindBridge.
(3) Export control — US EAR “600‑series” classification
Reg kind. EAR600SeriesItem@US (AT≈K2, F3→F4 as predicates are formalized).
Local kind. Product@Company.
Work scope. {destination=countries, end_use, time selector (Γ_time)=shipment date} for the shipping capability.
Adoption.
-
KindBridge. Map
EAR600SeriesItem@US → Product@Company;CL^k=2(loss: component kit edge cases); loss notes recorded. -
Capability guard (Method–Work).
U.WorkScope(Ship)coversJobSlice(destination, end use, time).MemberOf(product, EAR600_mapped, JobSlice)defined (classification present).- Apply
Ψ(2)to R (classification uncertainty) and, if reusing US scope text,Φ(CL_scope)too.
-
Outcome. Shipment admitted only for allowed destinations; higher R may require manual review.
(4) Finance — IFRS vs US GAAP “Lease”
Reg kinds. Lease@IFRS, Lease@USGAAP.
Local kind. LeaseStandard@Corp used in policy “recognize lease liabilities.”
Adoption.
- KindBridge.
Lease@IFRS → LeaseStandard@Corp(CL^k=2; loss: short‑term exceptions differ). - Scope.
{jurisdiction=IFRS, Γ_time=financial period, ledger=v7}. - Evidence. LA plans cover subkinds (operating vs finance) per your classification; the kind‑bridge congruence level (CL^k) drives extra testing near boundary cases.
C.3.A:A.5 Design guidance & pitfalls [I]
Do this.
- Treat regulatory categories as Kinds. Put the definition into
KindSignature(aim for F4 predicates where practical). - Make time explicit. In guards, require a time selector (Γ_time) for effective dates and grace periods. Forbid “latest”.
- Publish bridges with loss notes. If two jurisdictions’ categories are “almost the same,” say how, rate
CL^k, and note what is lost. - Split “where” from “what.” Keep Scope (G) over
U.ContextSlice(jurisdiction, plant, Standard versions) separate from MemberOf on the kind. - Route uncertainty to R. Use
Ψ(CL^k)andΦ(CL); never modify F/G to hide ambiguity.
Avoid this.
- Synonym games. Don’t alias “Adult” to local
AdultPatientin prose. Use a KindBridge. - Scope by labels. “Domain = EU” is not a guard. Use explicit
U.ContextSlicefields (jurisdiction, version, time selector) and Scope predicates. - Hiding time. Never rely on “current law”; always fix Γ_time (point/window/policy).
- Widening G to compensate for type gaps. If kinds don’t line up, introduce a subkind, add a mask/adapter, or narrow; don’t “make the scope bigger”.
C.3.A:A.6 Migration checklist [I]
- Inventory regulatory references in policies/specs.
- Create Kind cards for referenced legal categories (intent summary,
KindSignature+ F, known subkinds, AT tag if helpful). - Publish KindBridges to your local kinds with
CL^kand loss notes. - Rewrite guards to use Scope coverage (USM) plus
MemberOfon the mapped kind; add an explicit time selector (Γ_time). - Wire penalties:
Ψ(CL^k)andΦ(CL)lower R; refresh evidence windows. - Catalog RoleMasks for local nuances; promote frequently reused masks to subkinds.
C.3.A:A.7 Manager’s one‑page pattern [I]
- Question 1 — Where does the rule apply? → Scope (G) over Context slices (jurisdiction, plant, Standard, and a time selector (Γ_time)).
- Question 2 — About what things? → Kind (regulatory category) with a KindBridge if foreign.
- Gate recipe. Scope covers the TargetSlice and membership for the mapped kind is defined, and both bridges are present where needed; then apply bridge penalties to R and decide.
- Change handling. New law edition? Update
KindSignature/Bridge (kinds) and/or Scope (ΔG); never rely on “latest.” - Accountability. Keep loss notes, CL/CL^k, and Γ_time in the decision record.
C.3.A:Annex B - How typed reasoning plugs into Assurance Lanes (VA/LA/TA) & Evidence design [A/I]
Intent (manager’s view). Typed reasoning turns “prove/test/qualify” into a repeatable plan. By making what the rule talks about explicit (named Kinds, their subkinds, and optional RoleMasks), you can:
- design proof obligations that actually quantify over the right things (VA),
- build test plans that cover the right variants/subkinds in the right context slices (LA), and
- isolate tool risk (TA) instead of letting it bleed into scope or type semantics.
Invariant reminders.
— Scope (G) is where a claim holds — expressed over U.ContextSlice (with an explicit time selector, Γ_time).
— Kind membership is which things the claim ranges over inside that slice — checked with MemberOf(… , kind, slice).
— Bridge penalties: the scope‑bridge penalty (based on CL) and the kind‑bridge penalty (based on CL^k) both lower R (assurance). They never change F (form) or G (scope).
C.3.A:B.1 What you get with typed assurance [I]
- Targeted proofs (VA). If a policy says “for every PassengerCar …” (notation hint: ∀x:PassengerCar), the VA lane now has a clear target. You can prove obligations once for the kind (and its subkinds), instead of re‑proving per ad‑hoc label.
- Subkind‑aware test plans (LA). Test matrices are indexed by subkinds (and RoleMasks) × context slices; coverage stops being accidental.
- Deterministic guards. A test/proof either applies to the TargetSlice and Kind (
Scope covers & MemberOf defined) or it doesn’t. No “latest,” no silent widening. - Clean tool boundaries (TA). You qualify the prover/model‑checker/classifier once and route tool confidence to TA, not to “broadened” claims.
C.3.A:B.2 Normative obligations for evidence design
EA‑1 (Two checks). Every VA/LA artifact that supports a typed claim SHALL bind both:
- Scope predicate:
U.ClaimScope(Claim) covers TargetSlice(with explicitΓ_time), and - Kind predicate:
MemberOf(?, k, TargetSlice)is defined (deterministic).
EA‑2 (Subkind coverage). When a claim quantifies over k, target‑contexts SHALL justify LA coverage per relevant subkind of k (or per RoleMask if masks stand in for stable subkinds). “Representative set” MUST be stated explicitly.
EA‑3 (Independence for unions). If a published SpanUnion of evidence lines is used to enlarge covered area, independence of lines SHALL be documented (no shared weakest link).
EA‑4 (Bridges accounted). If a VA/LA artifact travels across Contexts:
-
Scope movement SHALL use a Scope Bridge (Part B) with CL and apply the scope‑bridge penalty to R.
-
Kind movement SHALL use a KindBridge (§ C.3.3) with CL^k and apply the kind‑bridge penalty to R. Neither movement SHALL alter F or G.
Neither movement SHALL alter F nor G.
EA‑5 (Freshness). LA evidence SHALL declare freshness windows tied to Γ_time (no implicit “latest”). Expiry MUST fail guards closed until refreshed.
EA‑6 (No scope‑by‑wording). Editors MUST NOT widen G by rewriting a claim to sound “more general.” Widening G (ΔG+) is permitted only with new support that truly enlarges the set of slices.
EA‑7 (TA separation). Tool qualification (TA) SHALL be tracked independently. VA/LA guards MUST NOT substitute “tool is trusted” for content proof/coverage.
C.3.A:B.3 Designing the evidence matrix [I]
A practical way to plan LA/VA is a matrix:
- Choose rows. Start with the kind and list relevant subkinds (notation hint: kᵢ is a subkind of k) or stable RoleMasks.
- Choose columns. Split your declared Scope (G) into named slices you intend to support (e.g., “dry, speed up to 50” and “wet, speed up to 40” with specific rigs and versioned Standards).
- Fill cells. Attach one or more evidence units per cell (proof obligations for VA; test campaigns/monitoring windows for LA). Mark bridged cells and their CL/CL^k penalties to R.
Tip. For formal kinds and “up‑to‑iso” kinds (AT K2/K3), expect more rows (more variants to cover). For instance‑like kinds (AT K0), expect fewer rows and tighter columns (narrow slices, stricter freshness).
C.3.A:B.4 VA lane — proofs that match the kind [A/I]
What VA contributes. Proofs reduce ambiguity and eliminate many LA proof requirements when they truly quantify over the intended kind and live in the declared Scope.
VA‑patterns (informative):
- Proof over the Kind (F7–F8). “For every PassengerCar, the property holds” (notation hint: ∀x:PassengerCar). If the property depends on subkind‑specific rules, split lemmas per subkind.
- Proof‑carrying components. When the content is F8 (dependent types), the build rejects violations; LA can shrink to conformance smoke within the slices.
- Up‑to‑iso (AT K3). Equational reasoning “up‑to‑iso” is acceptable only if the KindSignature works at that level and receivers accept KindBridge that preserves equivalences.
VA‑obligations (normative):
- VA‑1. A proof carrier SHALL cite the Kind it quantifies over and reference the Claim scope slices it assumes.
- VA‑2. Cross‑context acceptance of proofs SHALL use both bridges (Scope+Kind) and apply Φ/Ψ penalties to R (never to F/G).
- VA‑3. If the proof relies on tool kernels, their TA status SHALL be disclosed; weakening TA MUST NOT be “paid for” by silent scope widening.
Mini‑example (VA).
Policy P: “∀ x: PassengerCar. stoppingDistance(x) ≤ 50 m on dry at speed≤50.”
— Kind: PassengerCar ⊑ Vehicle (K2), signature F4 (predicates).
— Scope: {surface=dry, speed≤50, rig=v3, Γ_time=rolling 180 d}.
— Proof: a proof assistant lemma over PassengerCar (tool choice is context‑local).
— Reuse to Plant‑B: a Scope Bridge with CL=2 (rig bias) and a KindBridge with CL^k=3 (same classification). Apply the scope‑bridge penalty for CL=2 and the kind‑bridge penalty for CL^k=3 to R.
C.3.A:B.5 LA lane — tests & monitoring that cover the right variants [A/I]
What LA contributes. Empirical assurance for claims with executable semantics or physical interfaces; especially when F ≤ F6 or when stochastic/real‑world effects matter.
LA‑patterns (informative):
- Cover by subkind. Test at least one representative per subkind; add more where variability inside a subkind matters.
- Boundary probing. Concentrate tests near KindSignature and Scope boundaries (e.g., temp limits, speed caps).
- Hybrid checks (F6). When software controllers interact with physical systems, ensure both sides declare obligations; include their interaction cases in the matrix.
- Monitoring windows. For live systems, define Γ_time policies (e.g., rolling 30 d) and tie alerts to kind‑aware metrics (“error rate per
ServiceInstance”).
LA‑obligations (normative):
- LA‑1. Each test campaign SHALL specify rows/columns in the evidence matrix and attach Scope/MemberOf predicates to each run.
- LA‑2. Freshness windows SHALL be explicit and enforced in guards (no “latest”).
- LA‑3. If a KindBridge merges subkinds, test plans SHALL be adjusted (more cells, stricter acceptance), and the kind‑bridge penalty (based on CL^k) applied to R.
- LA‑4. Publishing SpanUnion coverage requires the independence note (which support lines differ).
Mini‑example (LA).
Claim: “For all x ∈ Vehicle: brakeDistance ≤ 50 m on dry, ≤ 40 m on wet.”
— Rows: {PassengerCar, LightTruck}.
— Columns: {dry, ≤50}, {wet, ≤40} with rigs and versions.
— Cells: PC/dry covered by track tests; LT/wet by simulation + surrogate tests (independent lines → SpanUnion allowed).
— Bridge to jurisdiction Y collapses EV vs ICE ⇒ CL^k=2. Apply Ψ(2) to R; add extra wet tests to compensate.
C.3.A:B.6 TA lane — tool qualification where it belongs [A/I]
What TA contributes. Confidence in provers, checkers, model‑checkers, data classifiers and pipelines. TA is about the machinery, not the claim or kind semantics.
TA‑patterns (informative):
- Prover kernels. Audit/qualification of the kernel version used for VA proofs.
- Automated Model‑checkers. Qualification against seeded faults; document limits (precision, nondeterminism).
- Classifiers used for
MemberOf. If membership uses ML or rules engines, qualify the classifier separately; any drift monitoring belongs to LA freshness.
TA‑obligations (normative):
- TA‑1. Tools critical to VA/LA SHALL declare their qualification status and version; guards SHALL reference these declarations when they matter. TA‑2. Lower tool qualification MUST NOT be hidden by relaxing F or widening G. target‑contexts may offset it by demanding more evidence in R (for example, extra tests), per policy.
C.3.A:B.7 Guard macros for evidence planning & attachment
Guard_EvidencePlan_Typed — approve a plan that is adequate for a typed claim. Plain reading. The first macro checks that the plan names the rows (kinds or masks) and columns (slices), that scope and membership can be checked for each cell, that any Cross‑context moves declare bridges, and that penalties are budgeted in R.
Guard_EvidenceAttach_Typed — attach concrete evidence to a state change. Plain reading. The second macro checks that each attached evidence unit clearly states which row and column it covers, binds scope and membership in a reproducible way, applies bridge penalties to R, and respects freshness.
C.3.A:B.8 Anti‑patterns & remedies
C.3.A:B.9 End‑to‑end example (manager’s cheat‑sheet) [I]
Scenario. You want to publish “∀ x: PassengerCar. brakeDistance ≤ 50 m dry; ≤ 40 m wet” across two plants.
- Kinds.
PassengerCar ⊑ Vehicle(K2, signature F4). - Scope (G).
{surface in {dry, wet}, speed limits, rig version, time selector (Γ_time)=rolling 180 days}in Plant‑A. - VA. Prove the property for PassengerCar using a proof assistant, and cite the Scope slices it assumes.
- LA. Build an evidence matrix with rows
{PassengerCar}and columns{dry, up to 50}and{wet, up to 40}, including rig variants; add boundary tests near the limits. - TA. Qualify the prover kernel and the automated checker used for wet surrogates.
- Bridge. To Plant‑B: a Scope Bridge with CL=2 (rig bias) and a KindBridge with CL^k=3 (same classification).
- Penalties. Apply the scope‑bridge penalty for CL=2 and the kind‑bridge penalty for CL^k=3 to R. Per policy, add extra test cells in Plant‑B to compensate for rig bias.
- Guards. Use
Guard_EvidenceAttach_Typedon the state change; include freshness checks.
Outcome. A defensible, auditable publication: typed, scoped, with clear evidence coverage and explicit risk penalties — no conflation of abstraction with applicability, and no tool risk smuggled into content.
C.3.A:Annex C. ESG guards
Status note. This profile restates the guard semantics from §4 for ESG/Method contexts. It does not add obligations; where wording diverges, §4 controls.
C.3.A:C.1 ESG guard obligations (normative)
When a state transition publishes or affirms a claim that quantifies over kinds, the guard SHALL:
-
Scope coverage (USM).
U.ClaimScope(Claim) covers TargetSlice(singleton or finite set) and TargetSlice declaresΓ_time(no “latest”). -
Typed definedness. A deterministic membership check is available for every kind used by the claim in the TargetSlice. If membership cannot be evaluated in that context, the guard fails closed.
-
Typed compatibility (same Context). If a downstream consumer expects a specific kind, then for each kind used by the claim either:
- the used kind is an is‑a / subkind‑of the expected kind, or
- a documented RoleMask for the expected kind is used and its constraints are met and observable in the TargetSlice.
-
Typed compatibility (Cross‑context). If any referenced kind is used across Contexts, a KindBridge SHALL be declared with a published type‑congruence level (minimum acceptable level per Context policy), order preserved (no inversions), and loss notes. The guard SHALL apply the kind‑bridge penalty to R.
-
Scope translation (Cross‑context claim use). If the Claim’s scope originates in another target‑context, a Scope Bridge with a published congruence level is required; apply the scope‑bridge penalty to R.
-
Formality threshold (if gated). If the ESG state requires rigor, enforce
U.Formality(Claim) ≥ F_k(C.2.3). (Note: Raising F does not widen G; do not substitute.) -
Evidence freshness (R). Where the new state implies trust, assert freshness windows and confirm no expired bindings.
Prohibitions (normative).
- Do not widen G to “hide” a type mismatch. Fix typed compatibility (introduce a subkind, use a RoleMask, publish a KindBridge) or reject.
- Do not treat a mask name as a kind—masks must be registered and deterministic.
- Do not infer G from the size of a kind’s Extension; Scope ≠ Extension.
Method–Work guard obligations (normative)
To admit a capability for a specific Work step at JobSlice, the guard SHALL:
-
Work scope coverage (USM). The capability’s Work scope covers the JobSlice, and the JobSlice includes an explicit time selector (Γ_time).
-
Measures & qualification. All required
U.WorkMeasureshold at JobSlice and theU.QualificationWindowis valid atΓ_time. -
Typed inputs (same Context). For each declared input kind (or RoleMask), assert:
- Membership check available: the system can deterministically decide whether the input belongs to the expected kind in this JobSlice.
- Compatibility: the provided input kind is an is‑a / subkind‑of the expected kind, or the RoleMask constraints are satisfied and observable.
-
Typed outputs and post-conditions (if declared). If the capability guarantees an output kind
k_out, record the obligation to demonstrateMemberOf(output, k_out, JobSlice)(typically via conformance tests or audits). -
Cross‑context typed use. If inputs and outputs are typed in a different target-context than the capability or JobSlice:
- KindBridge(s) are required with a published type‑congruence level and loss notes; apply the kind‑bridge penalty to R.
- If the capability resides in another target‑context, a Scope Bridge with a published congruence level is required; apply the scope‑bridge penalty to R.
-
No substitution by G. Do not “fix” a typed mismatch by widening the Work scope. Use an adapter or a RoleMask, or reject.
Guard macros (ready‑to‑use)
ESG_TypedGate(Claim, TargetSlice, Kinds, thresholds) Manager view: The following macros are for editors; target‑contexts may automate them if desired. Managers can read the comments on each step; the checks are the same ones described in Plain language above.
MethodWork_TypedGate(Capability, JobSlice, InputKinds, OutputKinds, thresholds)
Worked examples (manager‑focused)
(A) ESG — Promote a braking policy to Effective.
Claim. “For all vehicles: braking distance is ≤ 50 m on dry and ≤ 40 m on wet.”
TargetSlice. {surface∈{dry,wet}, speed≤50 km/h, rig=v3, Γ_time=rolling 180 d}
Kinds. Vehicle (K2, KindSignature at F4); the consumer subsystem expects PassengerCar.
Guard.
- Scope covers TargetSlice (USM ✓).
- Definedness of
MemberOf(?, Vehicle, TargetSlice)✓. - Typed compatibility:
PassengerCar ⊑ Vehicle✓. - No bridges → no penalties.
- F‑threshold:
Formality(Claim) ≥ F4✓. - Freshness: evidence ≤ 180 days ✓. Result: Transition allowed. F/R apply weakest‑link on support paths; G remains the set declared.
(B) Method–Work — Admit “RiskScore” step with typed input.
Capability. ComputeRiskScore expects AuthenticatedRequest; promises SLOs (latency ≤ 50 ms, error ≤ 0.5 %).
JobSlice. {api=v2.3, region=eu‑west, Γ_time=now, traffic_class=gold}
Inputs. Producer emits Request (no auth guarantee).
Guard.
- Work scope covers JobSlice; Measures & QualificationWindow ✓.
- Typed inputs:
MemberOf(?, AuthenticatedRequest, JobSlice)must hold. Not true for rawRequest. - Remedy: insert an adapter that enforces/attests auth → yields
AuthenticatedRequest. - No Cross‑context → no bridges. Result: Admitted with adapter; Scope unchanged; R relies on adapter evidence. Widening Work scope is not acceptable to bypass typed mismatch.
(C) Cross‑context ESG — Adopt policy across plants.
Claim Context. SafetyLab@2026. target Context. PlantB@EU.
Kinds. Vehicle ↦ TransportUnit via KindBridge with CL^k=2 (EV/ICE collapsed); Scope Bridge from lab to plant with CL=2 (rig bias ±2 %).
Guard.
- Translate Scope and cover
TargetSlice_B. - Translate Kind and ensure
MemberOf(?, TransportUnit, TargetSlice_B)is defined. - Apply the scope‑bridge penalty (level 2) and the kind‑bridge penalty (level 2) to R; publish loss notes. Result: Transition allowed with reduced R; G is the mapped set; F unchanged.
Anti‑patterns & remedies (normative where noted)
C.3.A:End
Decision Theory (Decsn-CAL)
Type: Calculus (C) Status: Stable Normativity: Normative unless marked informative
At a glance. C.11 is the choice-calculus pattern for the moment when options already exist and the working question is which option to choose, including whether another probe is worth its cost before commitment.
Problem frame
Use this when. Use this pattern when one DecisionSubject already has an OptionSet in hand and the real question is how to choose among those already-available options under uncertainty, preference, causal or subjunctive dependence, and bounded probing or computation.
Start here when. Start here when a person, team, organization, or other decision-capable system must decide whether to choose now or spend more effort on probing, information gathering, or computation before choosing.
First output. The first useful output is one explicit DecisionSubject, one explicit OptionSet, one explicit comparison basis, one explicit ChoiceRule, and one explicit ChoiceResult saying whether the best next move is choose now, reject the current set, probe more, or move to a neighboring question.
If that first output still cannot be written honestly, the current comparison state is not late-stage choice doctrine yet. The case is still unfinished local choice work or one neighboring question in disguise.
Immediate failure indicators.
- The chooser is still moving between person, team, organization, or another collectivity-bearing level.
- The current comparison is still inventing, expanding, or reframing options while also claiming to compare them.
- The current comparison says more information would help but cannot name one next probe that could still change the result.
- The current result is really surfacing one selected set or one enactment plan rather than one local choice.
First-minute questions.
- Who or what is actually choosing here, and at what chooser-bearing level?
- What options are already on the table now?
- What current basis is being used to compare them?
- What next probe could still change the choice, if any?
- Is this still local choice, or has the question already moved to search, pool policy, publication, or enactment?
Typical reroutes. C.18 when the real question is still inventing or reframing options; C.19 when the working question is how broadly to explore or exploit the candidate pool; C.24 when one option is already chosen and the work has become sequencing or enactment; A.13 / C.9 when the hard question is agenthood rather than choice; A.18 / A.19 when the mathematical support question itself becomes primary.
Common neighboring-pattern mistakes. Do not use C.11 to hide search work inside "decision", to hide candidate-pool policy inside one local choice, or to hide execution planning inside one generic rationality account. Do not treat selected-set publication or shortlist semantics as if they were the same question as deciding.
What goes wrong if this pattern is missed. Search, selection policy, planning, and choice doctrine collapse into one blurred notion of rationality. Teams either choose too early because pool policy was never stated, keep probing without one reason the next probe is still worth its cost, or leave only one vague claim that "a decision was made" without one explicit decision record naming the current result.
What this pattern buys. This pattern gives one stable place to compare classical, causal, success-first or subjunctive, bounded-resource, active-inference-adjacent, and quantum-like decision lines without silently reassigning search, selection, or planning doctrine to the wrong question. In practice it buys one explicit answer to four questions: choose now, reject the current set, probe again, or reroute.
Not this pattern when. Do not start here when the current question is still generating candidate options, governing exploration or exploitation over a candidate pool, publishing shortlisted-set semantics, or sequencing execution under an operational plan.
Decision work often fails not because no options exist, but because the choice among existing options is never typed as its own question. C.11 starts from one narrower and more useful center: one decision subject choosing among already-available options, including whether more probing is worth the cost before the choice is fixed.
Problem
Many systems have options on the table but still lack one explicit doctrine for what makes one option rational to choose. They mix together at least four different questions.
One question is still generating candidate options, variants, or open-ended search directions. Another question is governing how broadly a candidate pool should be explored or exploited before narrowing. A third question is planning, sequencing, replanning, or enacting the move once a choice has already been made. The fourth question, and the one governed here, is choosing among already-available options under uncertainty, dependence, and bounded deliberation.
A second distortion appears when decision theory is reduced to one thin slogan about expected utility. Real choosers face evidential and causal distinctions, subjunctive or success-first cases, probe costs, information value, computation value, and situations where the chooser is not just one isolated individual.
Without one explicit place for choice calculus, search, candidate-pool policy, and planning rush into the same question, while the actual doctrine of choosing among live options disappears behind generic talk about rationality.
Solution
Causal-use hook for choice records
When the admissible choice among an existing OptionSet depends on an effect claim, intervention claim, counterfactual comparison, causal policy claim, or off-policy causal evaluation, the ChoiceResult keeps the decision-theory question local and cites C.28 for the causal-use question and support basis.
Optional ChoiceResult.causalUseSpec?:
The causal-use tail may be omitted only when the choice result does not reach CausalUseActivation: it is not decision-bearing on the causal claim, not publication-bearing, not assurance-bearing, and not reused as support for deployment, fairness, benchmark, or downstream selection. If causal wording changes the admissible choice result, the tail is present or the causal wording is downgraded.
What changes in practice: a decision record that says "choose this because it improves outcome", "choose this because it would have prevented harm", or "choose this policy because replay shows it is better" must state whether the claim is observational association, interventional action/effect, or counterfactual comparison before the ChoiceResult is treated as supported.
What this does not authorize: [C.11](/generated/patterns/C.11) does not identify causal effects, certify target-trial emulation, validate off-policy causal evaluation, or decide counterfactual sampling realizability; it emits one ChoiceResult and redirects the causal-use question to [C.28](/generated/patterns/C.28).
Primary EntityOfConcern and admissible decision move
C.11 governs theory-side choice among already-available options. Its selected decision move is deciding what should be chosen from the current OptionSet, including whether further probing, information gathering, or computation is rational before the choice is fixed.
The OptionSet choice question begins only after an option set already exists. It does not govern open-ended generation of options, and it does not govern the execution order of a plan after a choice has already been made.
Decision discipline over a live option set
A conforming C.11 pass does not stop at naming schools of decision theory. It carries one usable choice discipline over a live OptionSet, and it ends with one explicit ChoiceResult under one explicit ChoiceRule.
-
Fix the chooser and the choice-bearing level. State one
DecisionSubjectand oneDecisionSubjectGranularity. If the real dispute is still about who or what counts as the chooser, coordinate withA.13 / C.9instead of hiding that dispute inside one local choice. -
Freeze the current option set. State the already-available options being compared now as one
OptionSet. If the hard work is still inventing, expanding, or reframing the options, stop here and applyC.18. -
Make the comparison basis explicit. State one
PreferenceOrderor oneEvaluativeMeasure, plus oneBeliefStateand oneOutcomeModel. The comparison is not usable if some options are being judged under one belief state and other options under one later, unmarked update. If two options are only comparable after one further probe or one model revision that changes the belief state or outcome model before comparison, say that the current comparison is unfinished and apply step 5 rather than pretending that one silent basis shift already solved it. -
Choose the dependence layer that actually governs the case. Start from the evidential baseline when the choice is being compared through likely outcomes under the current
BeliefState. Add oneInterventionModelwhen taking one option changes the world through intervention rather than mere observation. Add oneCounterfactualModelplus oneSubjunctiveDependenceRelationwhen the case depends on one predictor, one structurally linked chooser, or one decision-procedure coupling that intervention talk alone does not capture. Use the least-committing dependence layer that still covers the live case, and do not switch layers across options without saying so explicitly. -
Run the probe-worthiness test before commitment. State one
ProbeActionSet, oneProbeBudget, and oneCostToProbe. UseValueOfInformationfor additional observation or measurement, andValueOfComputationfor additional reasoning, simulation, or search over the already-available options. This rule is intentionally local or myopic: it judges the best next feasible probe over the currentOptionSetand current comparison basis, not one full sequential or non-myopic experimental program. RicherOEDlines may strengthen this doctrine, but the localC.11closure rule already has to decide whether the next feasible probe can still change the current choice. If no feasible further probe fits the remainingProbeBudget, or if the best available probe no longer justifies itsCostToProbe, close under the current comparison basis. If a feasible probe is still worth its cost, and that probe could still change which option survives or whether the currentOptionSetshould be rejected, run it, update theBeliefStateandOutcomeModel, and return to step 3. If one choice result is already fixed and the remaining probe would change only execution-path description, call-plan ordering, enactment budget, or checkpointing of that chosen move, stop treating the probe as local choice doctrine and applyC.24. -
Apply one
ChoiceRuleand emit oneChoiceResultplus the next question. End with one explicit result:choose now,reject current set,probe again, orreroute because this is no longer local choice. If the result ischoose now, name the winning option or the retained tie-set plus the reason no remaining feasible probe is worth its cost. If the result isreject current set, name the reason no current option survives under the present basis and, when more work follows, the neighboring question that now takes over. If the result isprobe again, name the next probe and the exact comparison defect it is supposed to repair. AC.11pass is done only when it names the lawful next move and the reason that move is lawful.
Well-formed comparison state
Well-formedness constraint: a live C.11 comparison state is usable only when the decision record states all of the following:
- one
DecisionSubjectat oneDecisionSubjectGranularity; - one current
OptionSet; - one current comparison basis through
PreferenceOrderorEvaluativeMeasure, plus oneBeliefStateand oneOutcomeModel; - one active dependence layer for the current comparison, unless the record explicitly says that comparison is still being reopened;
- one current account of whether another probe is still feasible and worth its cost.
The comparison is still unfinished, not yet wrong but not yet closeable, when any of the following remains true:
- the chooser is still shifting between person, team, organization, or another collectivity-bearing level;
- the option set is still changing while the record also claims to rank the options;
- one option is being judged under one belief state and another under one later update that is not itself declared as the next probe result;
- one heavier dependence layer is invoked for rhetorical force, but the record never states what defect of the lighter comparison it repairs;
- the record says more information would help, but never says which probe could still change the choice and why.
Minimal admissible decision semantics
This minimal choice doctrine does not settle every decision-theory dispute, but it already supports some semantic moves by value and rules out others.
The following are lawful in this C.11 body when they are stated explicitly:
- one incomplete or only partially ordered
PreferenceOrder, so long as the unresolved comparison stays visible through one retained tie-set, one further probe, or one honestreject current setresult rather than one fake winner; - one
EvaluativeMeasurefor magnitude, threshold, or trade-off-sensitive cases, so long as the measure being used now is explicit enough to explain why the current result follows under it; - one temporary unresolved criterion conflict, so long as the record says whether the present comparison is using one priority order, one threshold, one explicit trade-off measure, or one unfinished state that still blocks closure;
- one explicit
BeliefStaterevision, so long as it enters the comparison as one named probe result or one named model repair rather than as one silent basis shift; - one widened
DecisionSubjectat person, team, organization, or other collectivity-bearing level, so long as the current subject-bearing level is explicit and the record does not hide unresolved cross-scale or cross-collective conflict behind one generic chooser label.
The following are not admissible in this C.11 body:
- silently totalizing one genuinely partial preference relation just to force
choose now; - silently switching from one criterion mix or one belief state to another across options;
- pretending that unresolved cross-scale or cross-collectivity conflict is already one settled local ranking when the aggregation question has not actually been discharged;
- using one polished record shape as a substitute for one stated comparison doctrine.
This is why C.11 is more than one note-taking protocol. The body already supports local incompleteness, partial order, explicit trade-off measures, and wider chooser-bearing cases, but it requires those semantic facts to change the lawful result rather than remain hidden beneath one elegant summary line.
Probe-worthiness rule
Another probe is worth doing only when all three conditions hold together:
- the probe fits inside the remaining
ProbeBudget; - the expected gain from the probe, through
ValueOfInformationorValueOfComputation, is large enough to justify itsCostToProbe; - the probe can actually change the local choice result by changing the ranking, breaking or creating a tie, showing that no current option survives, repairing one missing comparison, or showing that the question should reroute.
This is the current local or myopic probe-worthiness rule for C.11: judge the best next feasible probe over the current OptionSet, not one whole non-myopic experiment design over longer horizons. Later sequential or non-myopic OED may strengthen this doctrine, but they do not move the local-choice question out of C.11.
Do not keep probing merely because uncertainty remains. Uncertainty is ordinary. What matters is whether one feasible next probe can still change what should be chosen, or whether the current OptionSet should be rejected, from the current local choice question.
If the best available next probe cannot change which option survives, cannot change whether the current set should be rejected, or cannot justify its cost, the correct result is not one vague statement that the case is hard. The correct result is one explicit ChoiceResult under the current basis and current ChoiceRule.
If the next probe would no longer change which option survives but would only change how one already-chosen move gets enacted, budgeted, or checkpointed, the question has already crossed to C.24.
ChoiceRule versus ChoiceResult
ChoiceRule and ChoiceResult are not the same kind of thing.
ChoiceRuleis the doctrine or operator that says how the current comparison basis, dependence layer, and probe-worthiness value support one next move.ChoiceResultis the emitted record stating which next move is lawful now under that rule.
The operational answer of this pattern is therefore one emitted ChoiceResult under one explicit ChoiceRule. The result is complete only when it states the next move and the condition that makes that move lawful.
Only four result forms are lawful here:
choose nowreject current setprobe againreroute
A fifth soft result such as "keep thinking", "stay with the current view", or "the case is still complex" is not a conforming output. It is one unfinished state that still needs to be typed.
For choose now, the emitted ChoiceResult should show:
- the selected option or the retained tie-set;
- the comparison basis under which that result currently holds;
- the reason no still-feasible probe is worth its cost.
For reject current set, the emitted ChoiceResult should show:
- that no member of the current
OptionSetsurvives under the present comparison basis; - the exact shared defect, threshold failure, or dominated-outcome reason that defeats the current set;
- the next neighboring question only when more work now follows, such as new option generation or one explicit escalation path.
For probe again, the emitted ChoiceResult should show:
- the exact next probe;
- the comparison defect that probe is expected to repair;
- the reason the probe is still worth its cost.
For reroute, the emitted ChoiceResult should show:
- the neighboring pattern authority that now governs the question;
- the reason this is no longer local choice among already-available options.
Closure rule over the current OptionSet
The comparison may close as choose now only when all of the following are true together:
- the current
OptionSetis stable enough that the decision record is no longer still inventing options; - the current comparison basis is explicit enough to state why one option survives or why one tie-set remains;
- no still-feasible next probe is expected to change the survivor relation with enough expected value to justify its cost;
- the record is still governing local choice rather than pool policy, publication, or enactment.
The comparison may close as reject current set only when all of the following are true together:
- the current
OptionSetis explicit and stable enough to reject as the present choice set; - the current comparison basis is explicit enough to show why no member survives under the present basis;
- no still-feasible next probe is expected to rescue one member with enough expected value to justify its cost;
- the result is still one local choice conclusion rather than one disguised pool-policy, publication, or enactment result.
The comparison should close as probe again only when all of the following are true together:
- one next probe is named by value;
- that probe fits the remaining
ProbeBudget; - that probe is expected to repair one named comparison defect;
- that repaired defect could still change which option survives, whether the current set should be rejected, or whether the question should reroute.
The comparison should close as reroute when the record has already learned that the selected decision move changed:
- to
C.18when the option set itself is still under invention or reframing; - to
C.19when the question is now how broadly to keep exploring or exploiting one candidate pool; - to
C.24when one choice result already exists and the next task is now sequencing, enactment, or execution-path probe work; - to
G.5when the next task is now selected-set surfacing or publication.
If none of those closure conditions can yet be satisfied, the record is still unfinished. It is not rescued by richer terminology alone.
Minimal decision-record form
A minimal C.11 decision record has this shape:
The record does not need that exact syntax. It does need that exact content.
If the record does not state the current chooser, current options, current comparison basis, current ChoiceRule, current probe decision value, and current ChoiceResult, then it still behaves more like one doctrinal essay than one usable decision record.
Use branch language only when it changes the actual comparison being performed.
Resource-aware choice is one lens over declared source families
- Start from one declared source family or one declared source-family composition such as
Front,Archive, orFront+Archive. - Apply one declared decision lens over that source family rather than inventing one hidden universal winner rule.
CostToProbe,ValueOfInformation, andValueOfComputationbelong to that lens-side choice doctrine.- They may justify another probe, one changed local comparison outcome, or one stop decision, but they do not rename the current
DominanceSetand do not publish one shortlist-family result. - If one candidate remains worth probing because its expected information value still exceeds its expected cost, say that explicitly as one lens-side choice judgement.
- If one archive point remains worth probing because it may change the frontier later, keep that as one resource-aware choice claim, not as evidence that the point is already on the current front.
- The kernel floor here is:
A.19.SelectorMechanismremains the cited set-return floorSelectionSlotremains the selector output floor- if later selector-facing publication is required, that set-returning floor may support one
Shortlistor oneRankedShortlistinG.5rather than one forced single winner
Classical evidential baseline
Stay with the classical evidential baseline when the question is to compare already-available options through preferences, utilities or desirabilities, beliefs, and likely outcomes under uncertainty.
In this baseline, the options are being compared as evidence about what consequences are likely if they are chosen. This is the ordinary default when intervention structure, predictor-coupling, or context-sensitive non-commutativity are not yet doing real work in the case.
Typical practical cash-outs are:
choose nowbecause the current sharedBeliefStateandOutcomeModelalready make one option or tie-set survive, and no still-feasible probe is worth its cost;probe againbecause one further observation, measurement, or comparison pass could still change the ranking without requiring a heavier causal, subjunctive, or context-order repair;reroutebecause the selected decision move is no longer really comparing one fixedOptionSet, but has become search, pool policy, publication, or enactment work.
The baseline is still unfinished when the current comparison invokes it but cannot keep one shared BeliefState and OutcomeModel across the compared options, or when one heavier defect is already live and the current comparison still pretends one plain evidential comparison is enough.
Causal repair
Switch on one InterventionModel when taking one option changes the world through intervention rather than merely signaling which outcome was already likely.
What changes here is not the prestige label of the theory line, but the comparative question itself: the working question is no longer only what this option indicates about the outcome, but what this option causes in the outcome structure.
Typical practical cash-outs are:
choose nowbecause, under the declared intervention structure, one option now causally dominates or remains the survivor and no remaining feasible probe can reverse that causal ranking;probe againbecause one intervention-relevant uncertainty still blocks a lawful causal comparison and one named next probe could still change which option causally survives;reroutebecause the intervention-use question has already moved from local choice into enactment planning, protocol design, or one neighboring question.
This repair has not yet landed if the comparison still treats options only as evidence after invoking causal language, or if an InterventionModel is named without stating what defect of the lighter evidential comparison it repairs.
Success-first or subjunctive repair
Switch on one CounterfactualModel plus one SubjunctiveDependenceRelation when Newcomb-like, blackmail-like, or other predictor-coupled cases remain under-described by the older evidential-versus-causal split.
What changes here is that the comparison must stay answerable to linked decision procedures, predictors, or structurally similar choosers rather than only to direct intervention on one local event.
Typical practical cash-outs are:
choose nowbecause, under the declared counterfactual or subjunctive structure, one option survives once the predictor-coupled comparison is made explicit;probe againbecause one further model clarification, predictor assumption check, or decision-procedure comparison could still reverse the current survivor relation;reroutebecause the selected decision move is no longer settling local choice doctrine but has become one wider characterization, negotiation, or enactment question that only borrowed predictor-coupling language.
If that coupled structure is not live, do not activate this branch. If a predictor-coupled or success-first repair is named but the linked structure that changes the comparison is still unspecified, the branch is not yet load-bearing in the current decision.
Active-inference neighboring repair
Bring the active-inference line into view when the chooser is embodied, online, and socially coupled, and when the decision cannot be understood as one disembodied choose-then-act moment.
What changes here is practical next-move logic, not one neighboring-school label. The comparison is no longer over one frozen snapshot alone. The comparison must now ask whether one more observation, one more coupled update, or one more socially mediated or role-expectation clarification actually changes what should be done now.
This minimal choice doctrine makes that social-expectation pressure explicit, but it does not yet operationalize one full ROE or SocialExpectationRegime object model inside C.11. If that heavier machinery is itself what the case hinges on, the decision record should say so honestly rather than pretending the local C.11 floor has already settled it.
Typical practical cash-outs are:
probe againbecause one further embodied observation, coupled update, or explicit role-expectation clarification can still change the state estimate enough to reverse the current survivor relation;choose nowbecause delay itself now worsens the state being managed, closes the window in which the preferred option remains feasible, or leaves no lawful time for one more socially mediated check;reroutebecause the question has already become enactment sequencing or agent-characterization work rather than local choice.
C.11 keeps the choice question visible there, but A.13 and C.9 still govern the narrower question of what kind of agent or agential system is in play, and C.24 still governs later sequencing and enactment once a choice result has already been fixed.
Do not invoke this line only because one agent is acting in the world. Invoke it when embodied coupling, online updating, or explicit social-expectation pressure actually changes what the chooser should do now from the current OptionSet.
Quantum-like neighboring repair
Bring the quantum-like line into view when context effects, order effects, response-replicability tension, or incompatible-question structure change the comparative state enough that one simple commutative probability reading no longer fits.
What changes here is the practical structure of comparison. One order of questioning or one framing path may produce one different survivor relation from another. The comparison must therefore either stabilize the comparison under one declared order or show why one more clarifying pass is still needed.
This minimal choice doctrine keeps the branch at that measurement-sensitive recognition point. It does not yet claim one full quantum-like state-space package inside C.11; it claims only that the live comparison may need one explicit measurement-class or order-sensitive repair rather than one plain commutative reading.
Typical practical cash-outs are:
choose nowunder one declared order or framing because rival orders no longer change which option survives;probe againbecause one framing-sensitive comparison pass, one further question order, one response-replicability check, or one explicit measurement-class clarification could still reverse the survivor relation;reroutewhen the selected decision move is no longer deciding among live options but has become one publication or enactment problem that only borrowed order-effect language rhetorically.
Do not promote this line to the unmarked default unless those repaired limitations are live in the case.
Do not invoke this line merely because a case feels psychologically subtle. Invoke it when one changed order, framing, response pattern, or incompatible-question structure actually changes the comparison state or the survivor relation in the live choice.
If none of those repaired limitations is live, stay with the classical evidential baseline rather than switching branches without one live repaired limitation.
The family map is therefore one disciplined set of refinements over the same choice question, not one excuse to rename every neighboring question as decision theory.
Reroute as soon as the question stops being local choice
Use C.11 while the question remains: from this current OptionSet, what should the DecisionSubject choose, and is another probe worth its cost before commitment?
Reroute immediately when the question changes:
- If the hard question is still what options should exist at all, or whether the current option set needs to be expanded or reframed, leave this pattern and work in
C.18first. - If the options already exist but the question is how broadly to keep exploring or exploiting the candidate pool, leave this pattern and work in
C.19, where the next useful output is one explicit pool-policy result rather than one localChoiceResult. - If one option is already chosen and the question is how to sequence, budget, or enact that choice, leave this pattern and work in
C.24, where the next useful output is one enactment-facing call plan orCheckpointReturn. - If the question has shifted from deciding to surfacing, publishing, or naming the selected set, leave this pattern and work in
G.5, where the next useful output is one published shortlist, ranked shortlist, narrowed handoff plan, or explicit abstain outcome rather than one more local choice result.
ProbeBudget stays here while it means the epistemic or deliberative budget for one more probe before choice and while that probe can still change which option survives or whether the current set should be rejected. When the same word now means execution budget, call budget, enactment budget, or execution-path scouting after one choice result already exists, the question has moved to C.24.
ValueOfInformation and ValueOfComputation also stay theory-side here as comparative criteria while the question is still local choice among the current options. If one more probe could still change which option survives or whether the current set should be rejected, stay in C.11. If the choice result is already fixed and those criteria now govern only execution-path sequencing, call-plan ordering, or enactment of the chosen move, the question has crossed to C.24. C.19 and C.24 may consume the criteria, but they do not become the doctrine authorities for them.
Outside this pattern remain candidate generation, pool-wide exploration policy, selected-set publication semantics, and execution planning.
Minimal inventory and mathematical floor
The minimum usable inventory for this pattern is:
- subject and option objects:
DecisionSubject,DecisionSubjectGranularity,OptionSet; - evaluative and epistemic objects:
PreferenceOrder,EvaluativeMeasure,BeliefState,OutcomeModel; - dependence and comparison objects:
InterventionModel,CounterfactualModel,SubjunctiveDependenceRelation,ChoiceRule,ChoiceResult; - probe and bounded-resource objects:
ProbeActionSet,ProbeBudget,CostToProbe,ValueOfInformation,ValueOfComputation.
These objects are required because the decision record must carry one explicit path from a live OptionSet through one live ChoiceRule to one emitted ChoiceResult.
Always explicit versus conditionally activated objects
The following objects should be explicit in every usable C.11 decision record:
DecisionSubjectandDecisionSubjectGranularity;OptionSet;- one evaluative basis through
PreferenceOrderorEvaluativeMeasure; BeliefState;OutcomeModel;ChoiceRule;ChoiceResult.
The following objects activate when the case needs them:
InterventionModelfor causal repair;CounterfactualModelplusSubjunctiveDependenceRelationfor success-first or predictor-coupled repair;ProbeActionSet,ProbeBudget,CostToProbe,ValueOfInformation, andValueOfComputationwhen one more probe or one more computation pass is still live.
What matters is not that every decision record mechanically mentions every token. What matters is that the current comparison does not smuggle one active question without naming the object that carries it.
Immediate lexical commitments:
- the default chooser term is
DecisionSubject, notAgent; DecisionSubjectGranularitynames the chooser-bearing level when the question is about whether the chooser is one person, team, organization, or another collectivity-bearing system rather than one generic scalar or coordinate;- relation-heavy wording remains answerable to
A.6.Ptogether withA.6.5.
Local plain glosses for the load-bearing inventory:
DecisionSubject: who or what is actually carrying this choice now, whether that is one person, one team, one committee, one organization, or another collectivity-bearing system;DecisionSubjectGranularity: the level at which the choice is being attributed, such as person-level, team-level, or organization-level rather than one vague "agent" label;OptionSet: the concrete options already on the table now;PreferenceOrder: the current better-than / worse-than ordering over those options for this decision subject;EvaluativeMeasure: the explicit utility-style or desirability-style scoring measure used when the case needs magnitudes, thresholds, or trade-offs rather than only one ordering;BeliefState: the current uncertainty-bearing state about the world, the case, and the likely consequences of the options;OutcomeModel: the model that maps options plus the current uncertainty picture to the consequences that matter for this choice;InterventionModel: the part of the model that says how the world changes because one option is actually taken;CounterfactualModel: the model used to compare relevant non-actual alternatives or alternate decision procedures;SubjunctiveDependenceRelation: the dependence between this choice and one predictor, one linked chooser, or one structurally similar decision procedure when intervention talk alone is not enough;ChoiceRule: the current choice doctrine or operator that says what conditions makechoose now,reject current set,probe again, orreroutelawful in this case;ChoiceResult: the emitted result record saying which of those lawful next moves actually follows now under the currentChoiceRule;ProbeActionSet: the further checks, measurements, simulations, or questions that can still be run before commitment;ProbeBudget: the remaining time, money, attention, or tolerated delay available for those pre-choice probes;CostToProbe: the real cost of another measurement, question, simulation, trial, or delay before commitment;ValueOfInformation: the expected gain from learning more before choosing;ValueOfComputation: the expected gain from spending more reasoning or compute before choosing.
What follows from DecisionSubject being wider than Agent:
- the chooser in
C.11need not be one person-like agent; - a team, committee, organization, or coupled human-tool system may be the
DecisionSubjectwhen that is the real level at which the choice is being made; - the pattern therefore does not force agency characterization to do the job of naming who or what is currently choosing.
This floor is enough to keep choice doctrine inspectable and stable. It does not yet assume one full branch-specific quantum-like package or one cross-scale geometry-heavy package.
Boundary on multilevel and social-expectation doctrine
DecisionSubject and DecisionSubjectGranularity are the local answer to human-only and individual-only narrowing. They keep the chooser explicit at person, team, organization, or other collectivity-bearing level so the doctrine does not silently collapse back into one generic individual agent.
This minimal choice doctrine does not yet settle all of the heavier doctrine that can sit behind that wider chooser-bearing scope. In particular, this body does not yet fully settle:
- collective aggregation doctrine over conflicting preferences or criteria;
- cross-scale or cross-collective conflict between person-, team-, organization-, or broader system-level objectives;
- one full
ROEor social-expectation structure for socially scaffolded choice; - one full multilevel or geometry-heavy formal package for those cross-scale or cross-collective questions.
Those absences are not hidden exceptions. They are explicit scope boundaries of this C.11 body. If one of those heavier questions is already live in the case, the decision record should say that the local C.11 floor is being used only as the current typed floor and should keep the unresolved aggregation, ROE, or multilevel support question visible by value.
Minimal decision tuple and finish condition
A C.11 decision record is complete only when it states:
- who or what is choosing:
DecisionSubjectat oneDecisionSubjectGranularity; - what is currently choosable:
OptionSet; - how the options are compared:
PreferenceOrder,EvaluativeMeasure,BeliefState, andOutcomeModel; - which heavier dependence layer is active when the case needs it:
InterventionModel,CounterfactualModel, andSubjunctiveDependenceRelation; - what comparison doctrine currently governs the case: one explicit
ChoiceRule; - what further probing is still available and worth paying for:
ProbeActionSet,ProbeBudget,CostToProbe,ValueOfInformation, andValueOfComputation; - what the current comparison concludes: one emitted
ChoiceResultthat says choose now, reject the current set, probe again, or reroute. That result must name either the selected option, the retained tie-set, or the next probe or reroute named by value.
Without that explicit tuple, choice doctrine usually collapses into one of three easier but wrong substitutes: generic rationality talk, search folklore, or planning folklore.
The finish condition is more specific than "the record now sounds informed." The record is finished enough for practical use only when the next move follows from the stated comparison basis, stated ChoiceRule, stated probe decision value, and emitted ChoiceResult rather than from unstated background assumptions.
A C.11 pass is finished enough for practical use when all three conditions hold:
- the current comparison basis is explicit enough to state why one option now outranks or survives the others;
- the reason to stop probing, or the reason to probe again, is explicit rather than assumed;
- the next question is explicit:
choose now,reject current set,probe again, orreroute.
If the case remains tied or underdetermined under the current basis, say that directly and keep the tie-set explicit. A lawful ChoiceResult may still be probe again or reroute, but it must not pretend that one winner already exists when the current basis has not earned that conclusion.
If those conditions are still missing, the pattern has not yet answered the choice question even if the terminology already sounds sophisticated.
System grounding
Tell. A research team already has three experiment plans on the table. The option set exists. The real question is to decide which plan to run and whether one more measurement is worth the delay.
Show. The DecisionSubject is the team, the DecisionSubjectGranularity is team-level, the OptionSet is the three current plans, the team's PreferenceOrder puts risk reduction ahead of schedule convenience, and the current OutcomeModel still carries calibration uncertainty. The extra calibration run belongs in the ProbeActionSet, its one-day delay is part of the ProbeBudget, and the practical question is whether its ValueOfInformation exceeds its CostToProbe by enough to change the emitted ChoiceResult under the current ChoiceRule.
Show. If the extra calibration run could still change which plan survives and the one-day delay fits the remaining ProbeBudget, the right ChoiceResult is probe again with that exact calibration run named. If the measurement can no longer overturn the ranking, the right ChoiceResult is choose now with the winning plan and the reason further probing is no longer worth its cost.
Show. A finished result here should therefore read like one decision record, not one research-theory aside: "Team-level chooser; three current plans; risk reduction preferred; calibration uncertainty still live; one extra calibration run remains feasible and could still overturn the current ranking; ChoiceResult = probe again with calibration run." Or, after that probe is no longer worth doing: "ChoiceResult = choose plan B now because the remaining calibration gain no longer justifies one more day of delay."
Show. C.18 is still the place for inventing new plans, C.19 is still the place for broader exploration policy over the plan pool, and C.24 is still the place for the run sheet and execution order after the choice is made.
Episteme grounding
Tell. A model-selection comparison takes three already-articulated explanations and asks whether one more observation or one more comparison pass is rational before preferring one explanation over the others.
Show. C.11 governs the decision doctrine over the current explanation set: one BeliefState, one OutcomeModel, one explicit PreferenceOrder or EvaluativeMeasure, and, when the case needs it, one InterventionModel, CounterfactualModel, or SubjunctiveDependenceRelation rather than one thinner evidential comparison. When another model comparison pass is on the table, ValueOfComputation belongs here as part of the current choice doctrine rather than as one later planning afterthought.
Show. If one more comparison pass cannot realistically change which explanation survives, the decision record should not end with "more analysis may help." It should end with one ChoiceResult that prefers the current explanation now. If one more pass could still reverse the ordering and is cheap enough to justify, the decision record should say exactly which pass is worth doing and what ambiguity it is expected to resolve.
Show. A lawful closing line here is therefore something like: "ChoiceResult = choose model 2 now because the surviving uncertainty no longer changes the ordering under the current evidence" or "ChoiceResult = run one additional comparison pass on models 1 and 2 because the current outcome model still cannot distinguish their failure costs." Anything vaguer leaves the decision question unfinished.
Show. This pattern does not yet govern open-ended hypothesis generation and does not yet govern operational rollout. Those questions stay outside this pattern even when the decision later feeds them.
Collective and contextual grounding
Tell. A clinical board must decide whether to escalate a patient now or order one more test. The board is the chooser, not one isolated individual, and the result shifts when the case is discussed in prognosis-first versus risk-first order.
Show. C.11 keeps the case legible by typing the chooser as one DecisionSubject at explicit DecisionSubjectGranularity, keeping the available actions as one current OptionSet, keeping one explicit BeliefState and OutcomeModel around those actions, and asking whether another test belongs in the ProbeActionSet with enough expected value to justify its CostToProbe.
Show. Active-inference-adjacent pressure is visible because the chooser is embodied, online, and socially coupled; quantum-like pressure is visible because context and question order change the comparison state. C.11 keeps both repaired limitations visible without pretending that the whole pattern has already become one full active-inference or quantum-like formal package.
Show. If the order effect still changes which option survives, the comparison should say that directly and keep the comparison unfinished. The lawful next move is then either one framing-stabilizing probe or one declared comparison order under which the current result will be judged. It should not hide that instability inside one vague statement that the board has mixed intuitions.
Show. An admissible output here therefore looks like one of three concrete records:
ChoiceResult = probe again with one rapid diagnostic test because the current prognosis-first versus risk-first framing still changes which option survives;ChoiceResult = choose now and escalate because, under the fixed risk-first order and current evidence, no remaining feasible test can reverse the survivor relation before delay increases harm;ChoiceResult = the next question is governed by C.24 because the board has already chosen escalation and the next task is now treatment sequencing rather than local choice.
Show. The output still has to be one actionable record. If the current result cannot say which of those three forms is now lawful, then the contextual pressure has been noticed but not yet carried into one usable decision result.
Bias-Annotation
This pattern is intentionally biased toward Prag and Onto/Epist discipline.
It prefers one clear decision-theory EntityOfConcern, one explicit neighboring-question split, and one minimal mathematical floor over one looser but more rhetorically flexible notion of rationality.
That bias can feel too strict in cases where the chooser, option set, or dependence structure is still genuinely moving. The mitigation is not to weaken the pattern back into one general rationality account. The mitigation is to keep the unfinished state explicit: hold one tie-set, hold one probe again result, or state the neighboring governing pattern that now truly governs the question.
The family map also remains plural: causal, success-first, active-inference, and quantum-like repairs stay visible without being overpromoted into one default doctrine.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
One quick usability test helps here: if the closing line does not state one lawful next move for the working chooser or team, the current result is still unfinished even if the doctrine survey looks polished.
Consequences
Rationale
A live option set and a live choice among that set are not the same question as generating options, governing a candidate pool, or sequencing execution. Keeping that distinction explicit is what makes the doctrine usable rather than ceremonial.
DecisionSubject is the better default chooser term because decision theory often applies to persons, teams, organizations, and other system-bearing collectivities. Agent remains useful, but only when an explicit agency claim is actually being made.
A minimal mathematical floor is necessary because choice doctrine without one stable object stack quickly turns into verbal drift. But a pattern also fails if it keeps only the object names and never shows how those objects discipline an actual choice. That is why Solution here is procedural: it must carry the path from OptionSet through one ChoiceRule to one ChoiceResult, including the stop-or-probe decision, rather than only one survey of neighboring theories.
The practical gain of that procedure is not elegance for its own sake. It is that later search, policy, publication, and planning work receive one explicit result instead of one hand-waving claim that deliberation happened somewhere upstream.
At the same time, this pattern should not pretend that one full quantum-like or geometry-heavy package is already settled just because those neighboring lines are real.
SoTA-Echoing
Practical reading of this alignment:
-
In ordinary current-option cases, start with the classical evidential baseline and use it to emit one explicit
choose now,probe again, orrerouteresult under one sharedBeliefStateandOutcomeModel. -
Failure of a simple Bayesian or passive-read-like model is not yet evidence that QL is necessary. Try richer classical, causal, performative, instrument, active-sensing, or representation-abstraction rivals before keeping the QL branch as load-bearing.
-
If intervention structure changes the survivor relation, state that explicitly and switch to causal comparison rather than leaving the comparison at the level of correlation talk.
-
If predictor-coupling or structurally linked choice procedures remain load-bearing, keep the subjunctive layer visible and say what linked structure could still reverse the current result.
-
If another measurement, comparison pass, or search pass is being considered, treat its value and cost as part of the current decision doctrine rather than as one later planning afterthought.
-
If the chooser is embodied, online, and socially coupled, or if context and order effects change the comparison state, keep those repaired limitations visible by naming the observation named by value, social-expectation clarification, order stabilization, response-replicability check, or measurement-class clarification that could still change the current
ChoiceResult, and say directly when fullerROE, quantum-like state-space, or multilevel doctrine still sits outside this local choice body. -
If the quantum-like line is activated, treat it as one measurement-sensitive mathematical lens or representational repair, not as one claim that the chooser or world is physically quantum.
-
If none of those heavier repaired limitations is live, stay with the lighter branch rather than activating one prestigious label that does not yet change the next move.
Worked-slice discipline from these rows:
- the system grounding slice is disciplined primarily by the bounded-resource and classical-baseline rows, so the output must end in one explicit probe-or-choose result;
- the episteme grounding slice is disciplined primarily by the bounded-resource and subjunctive-repair rows, so the output must say what comparison pass or predictor-coupled clarification could still reverse the result;
- the collective and contextual grounding slice is disciplined primarily by the active-inference and quantum-like rows, so the output must name the embodied observation, framing stabilization, or reroute that now becomes lawful.
Relations
- Builds on:
A.6.P,A.6.5,A.13,C.9,A.18,A.19 - Read next when this question moves:
C.18for candidate generation and open-ended search,C.19for one explicit pool-policy result over exploration or exploitation governance,C.24for one enactment-facing call plan orCheckpointReturn,G.5for shortlist-family public selected-set label and emitted selected-set semantics,C.28when the choice result depends on causal-use support - Keeps outside: candidate generation, pool-wide exploration or exploitation policy, selected-set publication semantics, and execution sequencing
- Aligns with: classical evidential decision theory, causal decision theory, success-first or subjunctive repair, bounded-resource metareasoning and probe-cost doctrine,
C.28causal-use question/rung/support vocabulary, active-inference-adjacent decision work, quantum-like contextual repair where context or order effects are real, and multilevel mathematical-lens pressure at the minimal-floor level only
Quantum-like choice-boundary note
Use C.11 first when the question is local choice, belief, preference, comparison, question order, option-menu framing, or an incompatible-question effect inside one decision situation. Quantum-like wording is retained only when it adds a concrete residual order-effect, probe, frame, or comparison reading that ordinary decision or probability language would hide.
Action path:
- State the current
DecisionSubject,OptionSet, comparison basis, andChoiceRule. - Ask whether the apparent QL issue changes the local choice result: choose now, reject current set, probe again, or reroute.
- If the issue is question order, incompatible questions, response-replicability tension, non-shared comparison frames, or CbD-style variable identity / joint-availability trouble inside the current option set, keep the QL repair inside C.11.
- If the current option set itself is suspect, incomplete, generated by the wrong frame, or still needs expansion/reframing/search, leave C.11 and apply
C.18,C.19,A.19, orB.5.2as appropriate. - If the issue changes boundary state, bridge/export faithfulness, coordinated-work evidence, measurement legality, or viability envelope, route out.
- Emit one
ChoiceResultand one next question; do not leave the QL branch as a theory label.
When the question leaves local choice, route it out instead of stretching C.11:
Useful outputs:
choose nowunder a declared order/frame;probe againbecause another question order, response-replicability check, or frame test could still change the survivor relation;reroutebecause the live problem is no longer local choice;- no QL wording when ordinary uncertainty, preference conflict, or option-generation work is enough.
C.11 may cite C.26 as the common quantum-like modeling lens only for the residual question after the local-choice split is applied. It is not the whole-cluster pattern for boundary, bridge/export, distributed-evidence, viability, or state-representation coarsening claims.
C.29 mathematical-lens use relation
C.29may supply a lens-supported prediction, distinction, obstruction, diagnostic boundary, or rival-lens note that a decision record can cite. If the output is aChoiceResult, local choice record, selected-set publication, or selected option set,C.11governs the decision discipline and anyG.5/G.9selector or benchmark publication remains separate.C.29does not select the option by mathematical elegance.
C.11:End
C.13 — Constructional Mereology (Compose‑CAL)
Intent
Provide a single, generative calculus for part–whole structure so that all structural relations in FPF are constructed (not merely declared) from three primitives and thereby inherit extensional identity by design. The calculus is hidden from day‑to‑day users behind relation aliases; its artefacts are traces that witness how a whole arises from its parts.
Also known as “Γₘ mereology”, “constructor‑based composition”.
Layer. calculus. Depends on. Kernel only (no upward imports). Consumed by. CT2R‑LOG (B.3.5) Working‑Model alias logic and any FPF pattern that needs part–whole semantics. Compose‑CAL does not import alias definitions; it merely emits traces that others may reference.
Compose‑CAL introduces a single construction operator Γₘ with exactly three constructors—sum, set, slice—sufficient to build structural wholes, collections‑as‑wholes, and aspects without extending the Kernel’s type set. No “parallel” or “temporal slice” constructor is added. Every construction yields a trace that serves as the witness for structure. Human‑facing relations such as ComponentOf, MemberOf, AspectOf are defined elsewhere as Working‑Model aliases and are grounded in these traces; Compose‑CAL itself remains purely generative and extensional.
Problem frame & Problem
FPF presents a unified structural backbone used across disciplines. Historically, sub‑relations like ComponentOf or MemberOf were declared directly. This maximised usability but provided no generative guarantee that a new subtype was extensionally well‑behaved or reducible to common mereology.
Declared lists of part‑of sub‑relations scale poorly and lack identity guarantees. Engineers ask for a single dial (“is x part of y?”), while ontologists need a principled foundation that (a) avoids Kernel bloat and (b) proves that wholes are nothing over and above their parts. Adding yet another bespoke relation (e.g., PortionOf) should not entail schema surgery or ad‑hoc rules.
Forces
- Parsimony (C‑5). Add no core types if composition suffices; keep the constructor set minimal.
- Minimal Kernel (P‑1). Generativity must live in a calculus pattern, not in Kernel axioms and postulates.
- Cognitive asymmetry. Everyday users want “one part‑of query”; specialists accept complexity backstage.
- Trans‑disciplinary unification. Every pattern that needs mereology should reuse one generative basis.
- Green‑field strictness. With no legacy to break, we can require grounding for new structural edges.
Solution
Solution sketch
Compose‑CAL SHALL provide Γₘ with three and only three constructors:
Γₘ.sum(parts:Set[U.Entity])— returns a whole W such that each p in parts stands in KernelPartOf(p, W).Γₘ.set(elems:Set[U.Entity])— returns a collection C; each e in elems stands in a calculus‑internal mero:KernelPartOf(e, C) under member‑as‑part semantics (publication alias: typicallyut:MemberOf). Counts/order (e.g., parallel/serial factors) are not carried here; they live in method/time families adjacent to structure. Note: althoughmero:KernelPartOfis transitive in the calculus, the publishedMemberOfalias remains non‑transitive by design (see A.14 guards).Γₘ.slice(entity:U.Entity, facet:U.Facet)— returns an aspect S such that mero:KernelPartOf(S, entity) and S carries the declared facet. Temporal facets are excluded here.
Note. The calculus names an internal backbone mero:KernelPartOf; the Kernel’s public ut:PartOf/A.14 catalogue remain unchanged. Publish only via Working‑Model aliases (CT2R‑LOG).
The calculus emits a trace for every construction; Structural aliases MUST be grounded by exactly one such trace.
Non‑goals (clarifications).
- No extra constructors for “parallelism” or “time slices”; parallelism is modelled via set (with order handled in
Γ_method), and temporal parts live in the appropriate temporal/system calculus. This preserves parsimony. - Compose‑CAL does not define user‑visible relation names; those belong to the alias layer.
Normative Standard (high‑level)
- C13‑N1. Extensional identity. Two Γₘ results are identical iff they have the same parts under the same constructor and facet conditions.
- C13-N2. Structural grounding stance. Every structural edge MUST reference exactly one Γₘ trace as its grounding witness and SHALL declare
validationMode = axiomatic(see B.3.5 / E.14). Structural edges MUST NOT be published inpostulateorinferentialstances. - C13‑N3. Algebraic laws.
Γₘ.sumandΓₘ.setare commutative and idempotent over their inputs;Γₘ.slicecomposes only by facet‑compatible refinement. - C13‑N4. Acyclicity & antisymmetry. Structural part‑of induced by Γₘ is transitive, antisymmetric, and acyclic at the level of entities. (Formal axioms appear later in this pattern.)
- C13‑N5. Separation of concerns. Γₘ provides constructions and traces; naming, aliasing and human‑level relation taxonomies are defined outside Compose‑CAL (see B.3.5 for the CT2R‑LOG handshake).
- C13‑N6. Member vs component.
Γₘ.setyields collections whose Working‑Model alias is MemberOf; authors SHALL NOT infer ComponentOf from MemberOf without a separateΓₘ.sumnarrative. - C13‑N7. Domain guard. Do not apply Compose‑CAL to roles, methods, or works (see A.12/A.15): these are outside mereology.
Scope, applicability, terms & notation
Use Compose-CAL whenever a claim concerns structural containment of entities (assemblies, collections, aspects). Compose-CAL is not used for epistemic relations between knowledge epistemes or publications; those are epistemic relations and may be justified by Logical/Mapping and/or Empirical Validation with an explicit validationMode ∈ {inferential, postulate}. Compose-CAL is neutral with respect to domain (mechanical, biological, software, etc.).
- Γₘ — the mereological construction operator of this calculus.
- trace — a minimal, inspectable witness that a constructor was applied to given inputs to yield a whole (or aspect).
- structural part‑of — the structural relation induced by Γₘ; user‑facing aliases (e.g., ComponentOf, MemberOf) are separate patterns that must point back to traces.
Alias readiness. Typical CT2R mappings:
- ComponentOf ⇢
sumnarrative; - MemberOf ⇢
setnarrative; - AspectOf ⇢
slicenarrative; - PortionOf ⇢
slice(entity, facet="material/spatial‑region")plus metrical semantics (A.14); - ConstituentOf (logical/content) ⇢
sumnarrative over conceptual parts. (Material mixtures are notConstituentOf; usePortionOforComponentOfper A.14.)
Archetypal Grounding (System / Episteme duo)
Tell–Show–Show. Compose‑CAL is a thinking‑level calculus for building structural wholes from parts. We show it twice—first on a System (structural) and then on an Episteme case (where constructive grounding is not the primary mode).
System (structural; constructive grounding)
Story. A Skid is assembled from its Pump, Motor, Baseframe, and Manifold.
Constructive grounding (Γ_m).
Narrate a sum of parts: “Skid = sum{Pump, Motor, Baseframe, Manifold}.” This uses Γ_m.sum to obtain a whole whose parts stand in KernelPartOf; the resulting Working‑Model relation engineers publish is ut:ComponentOf on each edge from part to whole. The mapping “sum → ComponentOf” reflects the intended aliasing between constructive traces and human‑facing mereology.
Facets and collections.
Need the inspection surface? Narrate Γₘ.slice(Skid, "spatial") and publish ut:AspectOf. Need a group of Transfer interactions? Narrate Γₘ.set{…} and publish ut:MemberOf—this is a collection-as-whole, not a sub‑assembly; no component identity is implied without a separate Γₘ.sum narrative.
Plane separation. Assembly order and time are not encoded here: parallel lines and schedules live in method/time families and are described adjacent to, not inside, the part‑tree.
Episteme (knowledge‑bearing; non‑constructive first)
Story. A Mass‑Flow Representation is used to stand for a measured flow in a plant dataset.
Grounding choice.
Here the Working‑Model relation (e.g., RepresentationOf) is epistemic. Authors typically justify it by inferential or postulate stances (argument or calibration cues), not by a mereological construction; constructive traces remain optional. This preserves the firewall between structure and knowledge claims while keeping a clear path to an assurance record with additional constructive evidence if the team later reframes part of the representation structurally (e.g., sets of interactions as a Γ_m.set for a flow bundle).
Scope justification
- Universality. The trio sum / set / slice appears across mechanical assemblies, biological complexes, and organizational artifacts; aliasing to ComponentOf / MemberOf / AspectOf provides a stable Working‑Model surface for those domains.
- Parsimony. No “parallel” or “temporal slice” constructor is added; time slices belong in the temporal calculus, and parallelism is modelled as a set plus method metadata.
Bias‑Annotation (cognitive anti‑patterns and counter‑moves)
Conformance Checklist (normative, calculus‑level)
The following regulate how to think and write when invoking Compose‑CAL. They are notation‑agnostic and conceptual.
Author’s note. Compose‑CAL is a calculus for constructive reasoning about structure. Publishing remains in the Working‑Model layer (see B.3.5); constructive narratives are attached when the team seeks an assurance record with additional constructive evidence, never as a substitute for clear human‑facing relations.
Consequences
Benefits
- Extensional clarity. Every structural claim is reconstructed from
Γ_m.sum | Γ_m.set | Γ_m.slice: sum establishes component‑assembly identity; set establishes collection identity; slice yields aspects as parts—without expanding the Kernel. - Human–first publication, formal–on‑demand. Teams keep publishing Working‑Model relations (e.g.,
ut:ComponentOf), while assurance is attached as needed via a constructive grounding narrative andtv:groundedBy(see B.3.5). - Separation of planes preserved. Order/parallelism and temporal coverage remain in
Γ_method/Γ_time; structure is never overloaded to carry them, avoiding recurrent category errors. - Uniformity across domains. The same triad models mechanical assemblies, socio‑technical memberships, and informational wholes without domain‑specific constructors or ad‑hoc exceptions.
- Didactic economy. Authors learn one compact calculus; reviewers gain a predictable place to look for constructive justification when
validationMode = axiomatic(B.3.5 alignment). - Compositional reuse. Traces are reusable fragments of reasoning; complex wholes are narratable as sums of sub‑traces, with sets for concurrency and slices for aspect selection.
Trade‑offs / Mitigations
- Discipline cost at higher assurance. Writing a concise grounding narrative for axiomatic claims takes effort. Mitigation: reuse the micro‑templates in this pattern’s Grounding section and keep narratives notation‑free.
- Over‑use risk. Temptation to treat collections as integrated assemblies. Mitigation: keep MemberOf distinct from ComponentOf; both
setandsumyield wholes, but onlysumestablishes component structure and assembly identity. - Temporal leakage risk. Authors may try to smuggle time into structure via “temporal slices.” Mitigation: use
Γ_timefor temporal statements andsliceonly for intensional aspects, not for time windows.
One‑line takeaway. Compose‑CAL gives a minimal, universal how‑it‑was‑built story for any structural edge, without disturbing the human‑first publication surface defined in B.3.5.
Rationale (informative)
Why exactly three moves?
sum, set, and slice are jointly sufficient and minimally overlapping:
sumcreates an integrated whole from parts and thereby establishes component structure (assembly identity).setcreates a collection‑as‑whole; members are parts of the collection under member‑as‑part semantics, but no component integration is implied.slicereturns an aspect as part of its bearer (facet‑constrained, e.g., spatial/material); temporal facets are excluded here.
All three moves create new entities; sum is the only move that establishes component identity. Neither set nor slice changes the identity of their inputs, and set never upgrades membership to component status. Temporal coverage and workflow order are handled in their own planes.
This separation mirrors long‑standing distinctions between composition, collection, and aspect, while enforcing parsimony: no additional constructors are introduced into the Kernel (C‑5). The calculus remains notation‑agnostic: its meanings are given in prose and mathematics; any diagrams are illustrative only, in line with the Notational‑Independence guard‑rail (E.5).
Why constructive grounding lives outside the publication surface.
FPF privileges Working‑Model relations as the canonical form for communication and design. Compose‑CAL supplies the constructive shoulder of the Assurance Layer: when authors choose validationMode = axiomatic, they narrate the whole as a sum of parts (with optional set and slice scaffolding) and point to that narrative via tv:groundedBy. This keeps the text readable while preserving a path to an assurance record with additional constructive evidence (B.3 family, Authoring Template).
Why order/time are out of scope.
Correctness‑by‑sequence and temporal coverage are orthogonal to parthood. Encoding them as parts breeds contradictions (e.g., “phase‑as‑component”). Compose‑CAL deliberately refuses any “serial/parallel/temporal constructor,” delegating such concerns to Γ_method and Γ_time and aligning with B.1’s flavour separation.
Relations
Builds on
- A.14 Advanced Mereology. Uses its structural catalogue (Component/Portion/Aspect vs Member) as the target of constructive narratives; never collapses Member into Part.
- E.5 Guard‑Rails (Notational Independence). Meanings are given in prose; diagrams are illustrative only.
- E.5 Guard‑Rails (Unidirectional Dependency). Compose‑CAL depends downward only; it never imports alias layers or higher planes.
- E.8 Authoring Conventions. Conforms to the canonical pattern template (Grounding section for architectural patterns; CC placement).
Coordinates with
- B.3.5 CT2R‑LOG.
tv:groundedByrefers (conceptually) to Compose‑CAL traces whenvalidationMode = axiomatic; Working‑Model relations remain the publication interface. - B.1 flavours. Keeps order (
Γ_method) and time (Γ_time) outside structure; may co‑appear in narratives when relevant but never as constructors. - Kind-CAL / Lang‑CHR. Provide the Mapping shoulder of assurance (labels, type alignment) that complements constructive narratives in this pattern.
- KD‑CAL. Provides the Logical shoulder when authors justify relations inferentially instead of constructively.
- C.16 (Measurement substrate). Supplies quantitative hooks when a constructive narrative benefits from explicit counts/ratios (e.g., cardinalities, coverage), while keeping metrics distinct from mereology.
Constrains
- Any pattern that creates or reasons about structural wholes SHOULD narrate them using only
sum | set | slice. - Structural publication MUST NOT encode order/time; such claims belong to their dedicated flavours.
- Introducing new structural constructors requires a separate parsimony argument and is discouraged unless the triad cannot narrate the case without ambiguity.
Provides
- A minimal generative basis (
Γ_m.sum | Γ_m.set | Γ_m.slice) and the corresponding reading discipline for constructive narratives. - A stable interface with CT2R‑LOG for
tv:groundedBylinks undervalidationMode = axiomatic.
C.13:End
Measurement & Metrics Characterization (MM‑CHR)
Status: Stable
Intent (Normative)
Name. Measurement & Metrics Characterization (MM‑CHR). This is a user‑oriented name: in user‑facing narrative we may say metrics; in Tech register we speak Characteristic, Scale, Level, Coordinate, Value, Score, Unit, and ScoringMethod; in Formal register we use U.DHCMethod(Ref), U.Measure, U.Unit, and U.EvidenceStub.
Intent. Provide a transdisciplinary substrate for measurement that any FPF pattern can rely on: a small, stable set of measurement-definition constructs and relations—U.DHCMethodRef, U.Measure, U.Unit, U.EvidenceStub—disciplined by CSLC (Characteristic, Scale, Level, Coordinate) so that every recorded value is interpretable, and any claim of “comparability” is auditable (physics lab time‑of‑flight, figure‑skating judging, architectural modularity, etc.). C.16 does not re‑define Characteristic (A.17) nor the CSLC kernel Standard (A.18); instead, it exports the measurement substrate that binds an FPF pattern’s measurable notions to one Characteristic and one Scale and frames a conceptual link to evidence. This characterization is notation‑neutral, tool‑agnostic, and open‑ended (no “lifecycle” narrative; evolution proceeds via RSG moves with checklists).
One‑minute mental model (didactic; non‑normative).
- Template (
U.DHCMethod) says what a value means: the Characteristic, Scale (and Unit when applicable), plus polarity and applicability. - Measure claim (
U.Measure) says what was claimed about a subject: a value on that Scale, with a time stance and (when required) an EvidenceStub. - Direct comparability is conservative: same template; everything else requires a named and cited comparability basis governed by the relevant FPF pattern, Bridge, method description, or specification record.
Boundary to neighboring governing patterns and specification records. C.16 governs measurement templates, readings, score meanings, scale legality, direct comparability, and evidence-stub adequacy. It does not govern (i) characterization mechanisms such as normalization, indicatorization, scoring, comparison, or selection, (ii) normalization and equivalence notions such as method tokens, invariant-value notions, or equivalence relations, (iii) claim-use policies such as comparability modes and legality gates, or (iv) suite protocol obligations. Those meanings are governed by their FPF patterns or specification records, such as CN-Spec, CG-Spec, and the CHR mechanism-governing patterns. C.16 may cite those patterns or records when motivating evidence or interpretability, but MUST NOT introduce or restate their terminology or laws.
Use this when a value, score, rating, metric label, QL probe output, dashboard reading, or comparison is being treated as meaningful without a visible characteristic, scale, unit, polarity, comparability basis, or evidence pointer. The action is to rebuild the measurement claim as a typed reading: name the subject, bind one characteristic to one scale, state the coordinate or level, declare unit and polarity when they matter, attach the evidence stub, and keep comparison or scoring claims with broader scope, higher evidence requirement, or release or admission use with the governing pattern or specification record that governs that comparison or scoring claim.
Thin precision-restoration pointer: if the issue under repair is still whether wording such as metric, measure, score, axis, dimension, level, coordinate, quality, or stronger/weaker value names a characteristic, scale, coordinate, score, unit, scoring method, quality-term repair, or application of the pattern governing the recovered claim, use C.16.P first. Do not copy the C.16.P trigger table here; C.16 resumes after the measurement or characteristic construction is recoverable.
Useful output: a measurement claim that a reader can interpret and compare only within its declared measurement basis, without turning a convenient number into a free-floating fact.
Metric legality does not make causal use admissible. If a measured value, score, dashboard reading, or metric disparity reaches CausalUseActivation by being used to claim effect, intervention success, causal fairness, policy optimality, counterfactual comparison, or causal method superiority, keep the measurement repair in C.16 and carry the causal-use question, causal-ladder rung, estimand, support basis, support verdict, admissible causal use, and inadmissible causal use in C.28.
Outcomes. (1) A uniform way for FPF patterns to declare what is measured and read what has been measured; (2) explicit Characteristic binding and Scale typing per CSLC; (3) principled comparability and polarity (declared at the template level); (4) traceability via conceptual evidence stubs; (5) seamless alignment with cross‑domain quantity notions (ISO 80000, ISO/IEC 25024, QUDT, SOSA/SSN, Verspoor) through Unification rows (Part F).
Scope & Status (Normative)
Scope. C.16 specifies the measurement substrate for FPF patterns: the roles of U.DHCMethodRef, U.Measure, U.Unit, U.EvidenceStub; their CSLC discipline (by reference to A.17 and A.18); and evidence linkage semantics at the level of conceptual conditions. It defines direct interpretability and direct comparability (same template), and it equips other patterns to state—and audit—comparability claims beyond direct comparability by citing the governing FPF pattern, method description, Bridge, or specification record. It exports these constructs for all FPF patterns (KD‑CAL, Arch‑CAL, etc.) without prescribing domain formulae, procedures, or any CHR mechanism semantics.
Status. Normative C.16 depends on A.17 (canonical Characteristic) and A.18 (minimal CSLC in Kernel). Where C.16 cites external CG‑frames, the stance is through Part F rows and Bridges (with CL and loss notes), not by vocabulary import.
Out of scope. No computational recipes, no workflow prescriptions, no governance or process guidance. No definitions of normalization, indicatorization, scoring, comparison, or selection mechanisms, no comparability policy specifications, and no legality gate specifications. C.16 concerns measurement-definition constructs and their validity conditions for measurement claims, not records or tooling. (Implementation guidance, if any, belongs outside Part C.)
Problem & Context (Informative)
The problem C.16 solves
Across FPF patterns, people say “score”, “metric”, “rating”, “property”. Without a shared substrate, numbers drift: 42 of what? on which scale? comparable to whom? C.16 eliminates drift by requiring every metric notion to bind to one Characteristic and one Scale, and by separating Characteristic/template bindings from descriptions and ScoringMethods. The result is portable meaning: a measure is always readable as a Coordinate on a declared Scale of a named Characteristic, with a principled path to evidence.
Context and prior art
- Kernel canon. A.17 makes Characteristic the sole canonical head for measurability; A.18 fixes CSLC as the minimal sufficiency for interpretability. C.16 relies on both.
- Cross‑domain alignment. The MM‑CHR family already maps FPF U.Types to ISO 80000‑1 (Quantity), ISO/IEC 25024 (Data‑quality Characteristic), QUDT (QuantityKind and QuantityValue), W3C SOSA/SSN (Observable, Observed, and Result), and domain “feature/metric” usage (Verspoor, TF Metrics). C.16 uses these rows as Bridges (Part F), preserving local senses and documenting losses.
- Open‑ended evolution. FPF replaces “lifecycle” with Role‑State Graph (RSG) style state checklists (A.2.5): movement is along certified states with checklists; re-entry is valid when distinctions change. C.16 uses this device only to frame readiness and revision of metric notions conceptually (no processes implied).
Forces (Informative)
F1 — Interpretability first. A value detached from its Characteristic and Scale is meaningless; CSLC supplies minimum context.
F2 — Transdisciplinarity. Physics, architecture, curation, sport judging—one substrate must cover all while respecting scale types and polarity.
F3 — Characteristic/template vs description. Confusing the U.Characteristic or measurement template with its rubric or exemplar text (descriptions) corrupts claims; C.16 keeps them distinct.
F4 — Comparability without coercion. Ordinal ≠ interval; ratio admits unit change, ordinal does not; polarity matters for “better/worse”. C.16 encodes these as conceptual constraints, not formulas.
F5 — Evidence sufficiency. A measure should be checkable in principle; evidence is a conceptual link (not storage advice).
F6 — Lexical discipline. One canon in normative register; narrative labels are didactic only (Part E). C.16 reuses E.10’s register mapping.
Solution Outline (Normative)
S1 — Exported objects. C.16 exports four measurement constructs to be used by any FPF pattern:
U.DHCMethod— a measurement template (a Definition) that binds oneU.Characteristicto one Scale form, with declared polarity and (optionally) a citation point to the governing FPF pattern, method description, Bridge, or specification record for any non-trivial equivalence or comparability claim that is relied upon elsewhere. References to this template useU.DHCMethodRef. It is a measurement-definition specification, not a record layout.U.Measure— an assertion that a subject occupies a Coordinate (or Level, if discrete) on that Scale; the measure references its template and carries a conceptual pointer to evidence (U.EvidenceStub).U.Unit— the unit kind associated with the Scale where applicable (physical quantities, normalized “points”, “stars”, “%”); unit coherence is part of comparability conditions.U.EvidenceStub— a conceptual locator of grounds for the asserted value (type, identifier, brief summary, optional integrity notion); sufficiency criteria are conceptual (see §9 below).
S2 — Comparability stance (boundary‑aware). C.16 states only the direct comparability condition for measurement claims: same template (hence, same Characteristic, Scale, and Unit semantics by reference to A.17 and A.18). Any comparability claim that relies on transformations (normalization, scoring, aggregation, cross‑context transport, bridge losses, legality gating) MUST cite the governing CN-Spec record, CG-Spec record, or relevant mechanism pattern. C.16 does not define those transformations or their laws. (Details: §7–§8 below.)
S3 — Evidence stance. A measure that, by its template, requires evidence, is inadmissible without a meaningful U.EvidenceStub. C.16 defines what it means conceptually for evidence to “connect” the subject, the Characteristic, and its symbolic description; mechanisms are out of scope. (Details: §9 below.)
S4 — RSG framing (open‑endedness). Readiness, calibration, and revision of metric notions are expressed as RSG node moves with checklists (e.g., “characteristic bound”, “Scale typed”, “Unit coherent”, “ScoringMethod declared”), allowing re‑entry when distinctions change; there is no terminal “lifecycle”. (Details: §10 below.)
Lexical Discipline & Registers (Normative)
L1 — Canon. Use Characteristic, Scale, Level, Coordinate, Value, Score, Unit, and ScoringMethod in Tech register; their U.* counterparts in Formal. Narrative labels (e.g., axis, points, stars) are didactic only, and are mapped at first mention to the Tech canon (E.10).
L1‑bis — “metric”. The noun metric is not a Tech‑register canonical token for measurables; use Characteristic, Scale, Coordinate, Score, and ScoringMethod. It may appear in the pattern title and in the Formal names U.DHCMethodRef and U.Measure. Do not use metric as a synonym for Characteristic or Score in normative prose.
L2 — Characteristic/template vs Description. Keep C.16 measurement-definition objects (U.DHCMethodRef, U.Characteristic) distinct from descriptions (rubrics, exemplars) and from claims (U.Measure). No collapsing of names across these positions.
L3 — No synonym sprawl. In normative clauses do not substitute dimension, axis, property, or feature for Characteristic; A.17 governs canonicalization. (C.16 inherits A.17’s rename policy.)
L4 — Bridge‑only unification. Cross‑vocabulary sameness appears only via F.9 Bridges with CL and loss notes; C.16’s lexicon is the source side for measurement rows.
L5 — Plain‑register shorthand. In Plain register metric MAY be used as shorthand for “template + readings”, but on first use it MUST be mapped to U.DHCMethod (template) and U.Measure (reading), and to the Tech canon terms that matter for meaning.
L6 — No local CHR-mechanism terminology canon. Tokens and laws governed by characterization mechanisms (e.g., normalization method tokens, invariant-value notions, indicatorization policy terms) MUST be introduced only by their governing FPF patterns. C.16 may mention them only as cited external terms, never as locally defined canon.
Relations (pointers; details below)
To A.17 and A.18. C.16 uses A.17’s canonical Characteristic and A.18’s CSLC sufficiency; it neither re‑states nor weakens them.
To Part F. C.16 is the exporting pattern behind measurement rows in UTS rows and Bridges (e.g., result‑value ↔ SOSA Result, ISO QuantityValue).
To Arch‑CAL. Architectural qualities (Coupling, Cohesion, Evolvability) become Characteristics measured via C.16 templates; architectural dynamics read as trajectories in CharacteristicSpace (A.17 context).
Normative Core Model (types & Standards)
Position. MM‑CHR does not redefine kernel terms; it binds them to an FPF‑level Standard that every metric must satisfy. Canonical vocabulary and CSLC duties are inherited from A.17 and A.18 and referenced here without duplication.
Governing references. A.17 and A.18 govern Canon and CSLC; C.16 adopts by reference and keeps restatements of their definitions out of scope. C.16 only exports
U.*constructs, comparability stance, evidence semantics, and RSG touch‑points.CHR boundary reminder. Any notion that belongs to characterization mechanisms (normalization, indicatorization, scoring, aggregation, comparison, selection) appears in C.16 only as a pointer to its governing FPF pattern or specification record. C.16 MUST NOT become a shadow governing pattern for any such terminology or laws.
U.DHCMethod — the measurement template (normative)
Role. A measurement-template Standard that fixes what is measured and how values must be read—without producing any values itself. It is a Definition, not a Measure. References to this template use U.DHCMethodRef. (Didactic: think “the meaning declaration for a reading”.)
R-MT-1 (CSLC binding). A DHCMethod SHALL bind to exactly one U.Characteristic and exactly one Scale‑form admissible for that Characteristic (cf. A.18). Level is optional (used when the scale is enumerated); otherwise values are given directly as Coordinates.
R‑MT‑2 (Unit). If the scale carries units (interval or ratio), the template SHALL designate a Unit of presentation. For ordinal or nominal scales, unit may be absent or a nominal label (e.g., “stars”). (Old MM‑CHR Annex A already listed these structural elements; here we fix the conceptual obligation. )
R‑MT‑3 (Polarity). For any ordered scale, the template SHALL declare polarity (higher-is-better, lower-is-better, or target-is-best), as a semantic reading aid and as an input to consuming patterns. If polarity is target-is-best, the template SHALL name the target value (or target set) and MAY cite by reference the governing method description, scoring pattern, normalization pattern, selection pattern, or policy publication that carries any tolerance or fall-off convention used by downstream mechanisms or methods. C.16 does not standardize tolerance or fall-off semantics.
R‑MT‑4 (Applicability). A template SHALL state the applicability frame (what kinds of subjects it meaningfully applies to) in conceptual terms; this is a property of the definition, not of any measure.
R‑MT‑5 (Template vs description). The template is a measurement template. Any rubric, checklist, or prose that explains it is a Description; they are related but not identical (E.10 discipline).
R‑MT‑6 (Cardinality hint). A Template MAY declare its intended cardinality semantics for a subject within a time stance (e.g., latest‑only, at‑most‑one‑per‑day, time series). Where declared, claims outside that semantics are inadmissible conceptually (they must be reframed or versioned). Purpose: prevent silent duplicates and mixed regimes without imposing storage logic.
R‑MT‑7 (MAY). UncertaintyPolicy — optional conceptual guidance on how uncertainty is expressed or read (e.g., band, confidence interval, or quantile), without prescribing methods/tools.
(Informative examples: calibrated probability with a confidence band; a prediction interval; a set‑valued reading such as a prediction set.)
U.DHCMethod — the measurement template (normative)
Role. A measurement-template Standard that fixes what is measured and how values must be read—without producing any values itself. It is a Definition, not a Measure. References to this template use U.DHCMethodRef. (Didactic: think “the meaning declaration for a reading”.)
R-MT-1 (CSLC binding). A DHCMethod SHALL bind to exactly one U.Characteristic and exactly one Scale‑form admissible for that Characteristic (cf. A.18). Level is optional (used when the scale is enumerated); otherwise values are given directly as Coordinates.
R‑MT‑2 (Unit). If the scale carries units (interval or ratio), the template SHALL designate a Unit of presentation. For ordinal or nominal scales, unit may be absent or a nominal label (e.g., “stars”). (Old MM‑CHR Annex A already listed these structural elements; here we fix the conceptual obligation. )
R‑MT‑3 (Polarity). For any ordered scale, the template SHALL declare polarity (higher-is-better, lower-is-better, or target-is-best), as a semantic reading aid and as an input to consuming patterns. If polarity is target-is-best, the template SHALL name the target value (or target set) and MAY cite by reference the governing method description, scoring pattern, normalization pattern, selection pattern, or policy publication that carries any tolerance or fall-off convention used by downstream mechanisms or methods. C.16 does not standardize tolerance or fall-off semantics.
R‑MT‑4 (Applicability). A template SHALL state the applicability frame (what kinds of subjects it meaningfully applies to) in conceptual terms; this is a property of the definition, not of any measure.
R‑MT‑5 (Template vs description). The template is a measurement template. Any rubric, checklist, or prose that explains it is a Description; they are related but not identical (E.10 discipline).
R‑MT‑6 (Cardinality hint). A Template MAY declare its intended cardinality semantics for a subject within a time stance (e.g., latest‑only, at‑most‑one‑per‑day, time series). Where declared, claims outside that semantics are inadmissible conceptually (they must be reframed or versioned). Purpose: prevent silent duplicates and mixed regimes without imposing storage logic.
R‑MT‑7 (MAY). UncertaintyPolicy — optional conceptual guidance on how uncertainty is expressed or read (e.g., band, confidence interval, or quantile), without prescribing methods/tools.
(Informative examples: calibrated probability with a confidence band; a prediction interval; a set‑valued reading such as a prediction set.)
U.Measure — the recorded reading (normative)
Role. A claim that a subject occupies a Coordinate (or named Level) on the template’s scale, backed by a minimal pointer to its grounds.
R‑ME‑1 (Template binding). Every Measure SHALL reference exactly one DHCMethodRef; its Value or Coordinate must be valid for that template’s scale (type, range, category).
R‑ME‑2 (Subject). A Measure SHALL identify its subject‑of‑measurement (the bearer) unambiguously in the same Context of meaning as the template’s applicability frame.
R‑ME‑3 (Evidence stub). Where the template requires it, a Measure SHALL include an EvidenceStub—a conceptual pointer sufficient to support independent reasoning about the claim’s origin. (The old spec framed this as “traceability or provenance”; we keep only the conceptual role here. )
R‑ME‑4 (Time stance). A Measure SHALL carry a time stance (e.g., “as‑observed at T”, or “as‑aggregated over W”), expressed conceptually; it disambiguates the reading’s intended window without prescribing formats.
R‑ME‑5 (Entity vs relation). If the Characteristic is relational, the subject is a tuple (pair, k‑tuple); the wording of the claim reflects that arity and the template’s relation topology (cf. A.17).
R‑ME‑6 (MAY). UncertaintyStub — optional conceptual pointer to the adopted uncertainty estimation for this Measure, if required by the template.
Informative source reference. The old Annex B example “Article Completeness” illustrates the split template/measure/evidence; C.16 keeps the split but keeps storage-level talk out of scope.
U.Unit — semantics of quantities (normative)
Role. A conceptual marker of quantity kind and admissible conversions within that kind; not every scale requires it.
R‑UN‑1 (Quantity kind). Where units apply, the template SHALL indicate the quantity kind (e.g., Time, Length, Dimensionless‑Score). Units are meaningful only within one kind.
R‑UN‑2 (Convertibility). Comparisons across different units are valid iff they are convertible by kind-preserving transformation (ratio or interval scales); for ordinal or nominal scales, no numeric conversions exist. (Old Annex A listed conversion hints; here we assert the conceptual boundary. )
R‑UN‑3 (Canonical labels). % denotes “fraction×100”; “points” denotes dimensionless magnitudes used for scores; “stars” denotes discrete ordinal marks. These are labels of representation, not new characteristics.
R-UN-4 (Quantity-kind bridge). A Template on an interval or ratio Scale SHOULD name the underlying quantity kind (e.g., ISO 80000/QUDT category) to enable safe external bridges. This does not import external vocabularies; it declares an alignment point.
U.EvidenceStub — pointer to grounds (normative)
Role. A compact tie from a Measure to the grounds sufficient for reasoned audit (not a repository prescription).
R‑EV‑1 (Minimal sufficiency). An EvidenceStub SHALL carry, at minimum, a type‑of‑ground and an identifier sufficient to retrieve or reconstruct the grounds in the appropriate Context of meaning.
R‑EV‑2 (Compositionality). Multiple grounds may be composed as a finite set; composition is commutative, associative, and idempotent at the level of stubs, enabling conceptual merge of corroborations.
R‑EV‑3 (Soundness axiom). A Measure is MM‑CHR‑admissible only if at least one auditable chain of grounds can be stated from the bearer to the Characteristic via an appropriate description episteme that carries the measured subject, characteristic, and evidence relation. (Note: mechanism‑level admissibility gates (e.g., legality thresholds or evidence thresholds in CG‑frames or CHR mechanisms) are governed by their FPF patterns or specification records; C.16 defines only the conceptual “has grounds” link.)
R‑EV‑3 (Soundness axiom). A Measure is MM‑CHR‑admissible only if at least one auditable chain of grounds can be stated that connects:
bearer (subject) -> grounds -> Characteristic -> Coordinate or Level on the declared Scale,
in the appropriate Context of meaning. (Informative: this is the measurement-claim binding chain.)
(Boundary note: mechanism‑level admissibility gates (e.g., legality thresholds or evidence thresholds in CG‑frames or CHR mechanisms) are governed by their FPF patterns or specification records; C.16 defines only the conceptual “has grounds” link.)
Polarity, Comparability, and ScoringMethods (normative)
Notation. To avoid clashes with the kernel’s global aggregation symbol, this FPF pattern denotes a ScoringMethod (score‑level mapping) by 𝒢 (calligraphic 𝒢).
R‑POL‑1 (Declared polarity). Every ordered scale SHALL declare polarity at the template. Any disclosed scoring method 𝒢 that issues a Score for that template SHALL be order‑compatible with the declared polarity semantics (monotone for ↑/↓ polarity; target‑aware only when the target semantics is explicitly declared and cited where it depends on external conventions).
R‑CMP‑1 (Direct comparability). Two readings are directly comparable only when they reference the same U.DHCMethodRef (hence share Characteristic, Scale, and Unit semantics by reference to A.17 and A.18). “Same‑template” is the only comparability relation defined by C.16.
(Clarification: sharing a name, unit label, or scale type across distinct templates is not sufficient for comparability in MM‑CHR; cross‑template comparability must be established via R‑CMP‑2.)*
R‑CMP‑2 (Transformed comparability is cited, not defined). If a comparison relies on any transformation or supporting step (e.g., normalization, indicatorization, scoring, aggregation, cross‑context transport, bridge conversions, legality gates), that step SHALL be named and cited via its governing FPF pattern or specification record. C.16 does not define such transformations, their law sets, or their admissibility conditions.
R‑G𝒢‑1 (ScoringMethod disclosure). If a pattern issues a Score (a value on a score scale), its scoring method 𝒢 : Coordinate -> Score SHALL be identified by reference to its governing method-description episteme or FPF pattern, and SHALL disclose: (i) a bounded codomain and score range, and (ii) an explicit order‑compatibility statement (e.g., monotonicity) consistent with the template’s declared polarity. When reproducibility matters, the reference SHOULD be edition-pinned according to that episteme or pattern's authoring discipline. C.16 does not define scoring methods; it only requires that a score be interpretable as a reading on a declared scale.
R‑G𝒢‑2 (Ordinal respect). For ordinal inputs, any cited scoring method must be order‑preserving; interval assumptions MUST NOT be smuggled in. (Normative source for scale legality remains A.18; C.16 only enforces “no silent semantics upgrade”.)
Entity vs Relation bindings (normative clarifications)
R‑ER‑1 (Arity preservation). If the Characteristic is U.EntityCharacteristic, the subject is one bearer; if U.RelationCharacteristic, the subject is a k‑tuple (k ≥ 2). The Measure’s claim text SHALL reflect this arity.
R‑ER‑2 (Relation scale). Relation‑valued scales SHALL fix their symmetry/antisymmetry and directionality (e.g., distance symmetric; influence directional), at the template level.
R‑ER‑3 (Bridge to CG‑frames). In architectural CG‑frames, Coupling/Cohesion are Characteristics over modules (structure) or roles (function). Their measures are relational (Coupling) or unary (Cohesion within an element), but both live in the same MM‑CHR substrate. (Alignment hinted in the old mapping rows across contexts. )
Acceptance (conceptual, RSG‑aware)
Acceptance here is thought‑level. It uses the Role‑State Graph (A.2.5) pattern to organise mental checks—no “lifecycle” narratives.
SCR‑C16‑A (Template sufficiency). You can check—without invoking tooling—that the template has: (i) a fixed Characteristic (A.17), (ii) a typed Scale form (A.18), and (iii) coherent Unit semantics where applicable (plus declared polarity for ordered scales).
SCR‑C16‑B (Reading sufficiency). For a given subject, you can check that the reading: (i) cites the template, (ii) states a value valid for the Scale (Coordinate/Level), (iii) states a time stance, (iv) names 𝒢 when a Score is issued, and (v) provides EvidenceStub(s) where the template requires them.
SCR‑C16‑C (Comparability). When two readings are placed side‑by‑side, you can state in one breath whether they are comparable as‑is or only after 𝒢, and why.
SCR‑C16‑D (Evidence adequacy). For any required EvidenceStub, you can sketch at least one auditable chain of grounds from the subject to the Characteristic via a Description in the right Context.
C.16:5.7 Cross-references & source references
- A.17 (CHR‑NORM). Canonical Characteristic and Entity/Relation split; lexical rules and alias sunset.
- A.18 (CSLC‑KERNEL). One Characteristic + one Scale per template; Level optional; operation guard by scale type.
- Annex C (old MM‑CHR). Cross‑domain alignment hints for Characteristics, Observations, and Quantities across ISO 80000, ISO/IEC 25024, QUDT, SOSA/SSN (used here only as conceptual witnesses).
Scale‑type legality quick reference (Informative)
Didactic note. This table is a memory aid for engineers and managers. It does not introduce new legality rules. Normative legality of operations by scale type is governed by A.18 (CSLC) (and, where mechanized in CG‑frames, by the relevant legality profiles). If any row below conflicts with A.18, treat it as an illustrative example and follow A.18.
Reminders (informative; see A.18 for normative rules). G‑1 (Order). On ordinal, transforms should be monotone. G‑2 (Differences). On interval or ratio, Δ is meaningful; on ordinal or nominal, it is undefined. G‑3 (Ratios). Only ratio Scales admit x/y semantics; interval, ordinal, or nominal do not. G‑4 (Unit coherence). Interval or ratio arithmetic presumes compatible units (or a declared conversion). G‑5 (Target polarity). If polarity is targeted, comparisons use distance‑from‑target semantics as declared by the relevant governing pattern, template, and cited method or mechanism.
(These rules line up with the MM‑CHR exposition of CSLC and term discipline; A.17 fixes the lexical side.)
Evidence Semantics (Normative)
What an Evidence Stub is (and is not)
Definition. U.EvidenceStub is a conceptual pointer that ties a measure to the grounds sufficient for independent checking (observations, arguments, admissible transformations). It is not the run log, not the evidence carrier, and not the characteristic itself. This keeps EntityOfConcern and Description-episteme boundary and specification use distinct per E.10.D2 and the Clarity Lattice.
Rule Σ‑1. Whether evidence is required is a property of the metric template; if required, each U.Measure SHALL include an U.EvidenceStub.
Rule Σ‑2. Evidence composition is commutative, associative, idempotent at the concept level (sets/multisets of grounds); combining grounds can never reduce what is knowable about the measure’s warrant.
Rule Σ‑3. Soundness minimum: there exists a conceptual chain linking bearer → Characteristic → Scale and Unit → admissible method or episteme. (No “free‑floating numbers”.)
Rule Σ‑4. Any declared agreement construct used as evidence (e.g., dual readings, panels) SHALL respect the template’s scale type (per A.18) (e.g., order‑based concordance for ordinal; tolerance‑based agreement for interval or ratio).
Note (boundary). CG‑frame evidence thresholds (e.g., “minimal evidence” gates used by selection, scoring, or comparison mechanisms) are governed by their FPF patterns or specification records. C.16 defines only the EvidenceStub semantics that such gates may cite.
Source references: MM‑CHR units and evidence notion; Strict Distinction and the separation of objects from their descriptions and specifications.
Integration with RSG & Dynamics (Normative and Clarifying)
RSG (Role‑State Graph) touch‑points
MM‑CHR supplies recognisers used in State Checklists. A checklist criterion may refer to a measure (e.g., “Cohesion ≥ T on ordinal ladder”), but the state itself remains the EntityOfConcern of the checklist; the checklist is its description, and a StateAssertion is an evidence‑backed verdict over a Window. No lifecycle language is implied; RSGs are open‑ended graphs with re‑entry edges.
Rule RSG‑M1. When a checklist cites a measure, it SHALL do so by Characteristic + Scale semantics (and unit if applicable), not by colloquial aliases; Tech and Formal registers apply. Rule RSG‑M2. Thresholds in checklists MUST respect the scale type (no ratio talk on interval scales; no arithmetic on ordinal ladders).
Dynamics & CharacteristicSpace
U.Dynamics.stateSpace is a CharacteristicSpace—a named set of Characteristics with units and topology. MM‑CHR provides the measurement side of that space; patterns specify the transition law. Architectural or epistemic dynamics are then trajectories in the declared CharacteristicSpace. No procedural or storage commitments are implied.
Conformance Checklist (Normative)
Thought‑level acceptance conditions for authors and assessors; they constrain meaning, not tooling.
CC-MCHR-1 - CSLC binding. Each U.DHCMethodRef binds exactly one U.Characteristic and exactly one scale; each U.Measure carries a value valid for that scale (cf. A.18).
CC‑MCHR‑2 - Polarity declared. Every ordered scale in a template declares polarity; any Score via 𝒢 is monotone w.r.t. that polarity.
CC‑MCHR‑3 - Unit coherence. Claims that compare or combine values are grounded in unit coherence (or declared conversions for interval or ratio).
CC‑MCHR‑4 - Comparability honesty. Ordered comparisons are asserted only when R‑CMP‑1 holds (same‑template direct comparability) or when a named and cited transformation basis is provided per R‑CMP‑2; otherwise authors use qualitative/set‑level language.
CC‑MCHR‑5 - Evidence sufficiency. Where evidence is required by the template, the measure’s grounds are conceptually sufficient to retrace the claim; composition respects Σ‑1…Σ‑4.
CC‑MCHR‑6 - RSG alignment. If a measure gates a state in an RSG, the checklist criteria respect scale semantics and the EntityOfConcern vs Description-episteme split. No lifecycle phrasing; use RSG open‑ended moves.
CC‑MCHR‑7 - Dynamics awareness. Where discussions involve change, the CharacteristicSpace is named (characteristics, units, topology) and separated from the transition law.
CC‑MCHR‑8 - Lexical guard‑rails. Tech identifiers and headings use Characteristic, Scale, Level, Value, Score, Unit, and ScoringMethod; aliases (axis, dimension, points, or stars) appear only in explanatory Plain register with a first‑mention mapping to the Tech canon.
CC‑MCHR‑9 - Causal-use metric boundary. A measurement, metric disparity, score, dashboard reading, or benchmark value that reaches CausalUseActivation SHALL keep measurement construction, scale legality, comparability, and evidence-stub repair in C.16, and SHALL carry causal-use question, causal-ladder rung, causal estimand, support basis, support verdict, admissible causal use, and inadmissible causal use in C.28.
Invariants & Anti‑Patterns (Normative unless marked “Informative”)
Invariants (N‑rules)
N‑1 — One Characteristic + one Scale per template.
Every U.DHCMethodRef binds exactly one Characteristic and exactly one Scale (its type + admissible range or level‑set). This is the CSLC sufficiency condition for interpretability.
N‑2 — Value validity.
A U.Measure holds a Value that is admissible for the template’s Scale (numeric range, categorical level); when a Level is used, it is among the named levels declared for that Scale.
N‑3 — Polarity is declared at the template. For ordered Scales, the template states the comparison direction (↑ better, ↓ better, or target-is-best). Any ScoringMethod mapping to Score preserves that monotonic ordering. (Note: we use “ScoringMethod mapping” instead of the Greek letter used elsewhere in FPF to avoid symbol conflicts.) For ordered Scales, the template states the comparison direction (↑ better, ↓ better, or target-is-best). Any scoring method 𝒢 that issues a Score is order‑compatible with that declared polarity semantics.
N‑4 — Unit coherence. Within one template there is one primary Unit of expression (or an explicit level‑set for non‑numeric Scales). Conversions are conceptually valid only where the Scale supports meaningful arithmetic (interval or ratio); nominal/ordinal Scales are not subject to numeric conversions.
N‑5 — Comparability guard. Two Measures are comparable iff they share the same template (hence, the same Characteristic, Scale, and Unit) or stand in an explicit comparability relation whose governing FPF pattern or specification record is cited (e.g., an F‑cluster Bridge, or a cited characterization mechanism’s declared equivalence). Otherwise, comparability is not presumed.
N-6 - Evidence as conceptual relation. If a template requires it, each Measure includes an EvidenceStub that conceptually links the Value to its grounds; absence where required makes the Measure inadmissible for use. (This is a conceptual obligation; no process mechanics are implied.)
N‑7 — Arity clarity. If the Characteristic is relational (applies to a pair or tuple), the subject of measurement is the relation itself; the reading must not be re‑described as a unary property of either participant.
N‑8 — Open‑ended evolution; graph, not lifecycle. When MM‑CHR is used in change reasoning, movement happens in a CharacteristicSpace and along a Role‑State Graph (RSG). There is no lifecycle terminal; revisions may re‑enter earlier framing nodes as per A.17. (Conceptual control structure only.)
Anti‑Patterns (A‑rules) — with cures
A‑1 — Scale drift under the same template. Smell: the Scale meaning (bounds, categories) shifts while the template ID remains. Cure: version the template; declare the relation in the Unification suite.
A‑2 — Arithmetic on ordinal. Smell: averaging “stars” or ranking labels as if they were intervals. Cure: either keep order‑respecting operations only, or introduce a ScoringMethod that defines a proper Score range.
A‑3 — Unit soup. Smell: mixing milliseconds and seconds for the same template, or “%” and “points” for one Scale. Cure: one primary Unit per template; conversions (when meaningful) are declared conceptually, not ad‑hoc.
A‑4 — Alias leakage. Smell: “axis”, “dimension”, “point”, or “ladder” in normative identifiers or headings. Cure: use only canonical tokens in normative prose; narrative labels are valid solely in Plain register with first‑mention mapping (A.17).
A‑5 — Multi‑Characteristic stuffing. Smell: one template tries to carry a vector of Values for several Characteristics. Cure: separate templates (one Characteristic each) and compose coordinates explicitly when needed.
A‑6 — Evidence afterthought. Smell: Measures required to have grounds are introduced without an intelligible EvidenceStub. Cure: treat the EvidenceStub as part of the measurement claim itself, not an accessory.
A‑7 — Template mutation after Measures exist. Smell: retro-editing Characteristic, Scale, and Unit of an active template. Cure: immutability of that triad post‑use; publish a successor template if the concept changes.
A‑8 — Score‑of‑everything. Smell: collapsing heterogeneous Values into a single “points” Score without declared ScoringMethod and SCP. Cure: retain the Value on its Scale; add an explicit scoring method by reference to its governing method-description episteme or FPF pattern and an explicit legality profile governed by the relevant FPF pattern or specification record only when there is a justified need for a Score.
Cross‑Domain Vignettes (Informative, transdisciplinary)
Each vignette shows an CSLC‑conformant template → measure, without duplicating the A.17 and A.18 glossaries.
V‑A (Architecture — relational property). Characteristic: Coupling (relational) between modules; Scale: ordinal {Low, Med, High}; Unit: level‑labels; Polarity: ↓ better. Reading: subsystem pair ⟨M₁, M₂⟩ gets Med; ScoringMethod (optional) maps levels monotonically to a bounded Score for comparative dashboards.
V-B (Physics — interval or ratio). Characteristic: ResponseTime; Scale: ratio with non‑negative reals; Unit: seconds; Polarity: ↓ better. Reading: subject S has 0.237 s; direct comparability holds with readings on the same template; cross‑template comparability requires an explicitly cited equivalence relation, Bridge, or transformation relation with its governing FPF pattern or specification record named.
V‑C (Performing arts — ordinal). Characteristic: EdgeControlQuality; Scale: ordinal levels 1…5; Unit: level‑labels; Polarity: ↑ better. Reading: performance P gets 4; any aggregation remains order‑respecting. If a numeric dashboard score is needed, cite a scoring method 𝒢 that maps levels monotonically to a bounded Score.
V‑D (AI ethics — ratio). Characteristic: ParityGap (difference of positive rates); Scale: interval with symmetric bounds; Unit: percentage points; Polarity: ↓ better (0 is target). Reading: model M on cohort C shows 3.2 pp; evidence points conceptually to the derivation rationale (inputs, reference cohorts).
Relations & Placement (Informative)
Precision-restoration relation. C.16.P is the first-stage wording-use restoration pattern for characteristic, scale, coordinate, score, metric, axis, dimension, and related characterization wording when the measurement or characteristic object is not yet recoverable. C.16 keeps the measurement substrate and resumes after the bearer, characteristic, scale, coordinate/value, unit, evidence stub, or exact non-C.16 governing pattern has been recovered.
C.27 temporal-claim relation.
- C.27 may flag: a rate/rate-change reading whose admissible use depends on admissible measurement construction, evidence, sampling window, or finite-difference method.
- This pattern keeps: measurement construction, comparability, units, sampling windows, evidence, and admissible metric use.
- Non-admissible use: a rate-change label is not a measurement template, and temporal words such as velocity, acceleration, throughput, cadence, or recovery speed are not admissible measures by themselves.
- Exit: when load-bearing, the claim cites
baseCharacteristicRef, the relevant measure reference, sampling window, construction method such asDHCMethodRef, andC16RouteRef; C.27 keeps only the temporal-claim adequacy question.
C.28 causal-use relation. C.16 governs measurement templates, readings, score meanings, scale legality, direct comparability, and evidence-stub adequacy. C.28 governs the causal-use relation when the same reading is used to claim effect, intervention success, causal fairness, policy optimality, counterfactual comparison, off-policy causal evaluation, causal-RL evaluation, or causal method superiority. A C.16-admissible measure is therefore not by itself admissible for causal use under C.28.
Kernel. MM‑CHR imports the canonical Characteristic vocabulary and the CSLC discipline fixed by A.17 and A.18; it does not redefine them. CharacteristicSpace reasoning (for change) lives in the patterns that consume MM‑CHR readings.
Using patterns. KD‑CAL, Arch‑CAL and others instantiate templates and produce measures; MM‑CHR remains a neutral measurement substrate. Trade‑off analyses and architectural trajectories operate over coordinates that MM‑CHR makes available, not inside MM‑CHR.
Unification (F‑cluster). External standards (e.g., ISO 80000 quantity types; W3C SOSA/SSN observable properties; QUDT units/quantity kinds) are related via Concept‑Set rows and Bridges; MM‑CHR treats those alignments as context supplied by F‑patterns, not as local re‑definitions.
Measurement and probe note for quantum-like readings
Use C.16 first when the question under repair concerns a measure, metric, score, survey, dashboard, sensor, coordinate, scale, or characteristic. A metric is not quantum-like because it is noisy, probabilistic, discrete, gamed, or difficult to interpret. Metric gaming is not QL; a metric-caused state update may be QL only when the publication, probe, order, frame, or export changes what the result can admissibly support.
Action path:
- Name the Characteristic, Scale, Coordinate or Value, Unit when relevant, and EvidenceStub.
- Separate the observable, probe method, measurement scheme, emitted output or result record, state update, and evidence carrier.
- Ask whether the measurement frame or probe frame changes the represented state, whether probe order changes the admissible reading, whether frames cannot share one sample space, or whether exporting the measured state loses the structure needed for intended use.
- If no, stay in C.16 and ordinary evidence or engineering-justification patterns.
- If yes, add a C.26 reading only for that remaining passive-read, shared-frame, or lossless-export mistake.
- State the local stop condition: which decision, audit, release, comparison, or work use with a higher evidence requirement the measurement does not support.
Minimum measurement and probe note:
Useful outputs:
- a C.16 measure/template repair when the issue is metric legality;
- an A.10/B.3 route when the issue is evidence or assurance;
- a C.26.1 route when the probe changes the state it reports;
- no QL wording when noise, uncertainty, discreteness, or metric gaming is the whole issue.
C.29 mathematical-lens use relation
If a mathematical lens depends on measurement construction, scale, unit, polarity, direct comparability, or evidence-stub adequacy, write that measurement-dependent relation in
C.16before treating the lens as usable for those measurement-dependent claims. AC.29output may state only the measurement-dependentLensUseAdmissibilityValuefor the mathematical-lens use claim; it does not construct the measure, make values comparable, or supply an evidence stub. Evidence paths remainA.10; assurance remainsB.3.
C.16:End
Characteristic and Scale Precision Restoration
Type: Characterization precision-restoration pattern Status: Stable Normativity: Normative unless explicitly marked informative
Plain-name. Characteristic-scale wording repair.
Intent.
Recover characteristic, scale, coordinate, score, metric, indicator, threshold, comparison, and scalar-quality wording whose construction is hidden before a reader applies C.16, A.17, A.18, A.19, C.25, C.29, E.21, or another governing pattern.
This pattern is not a metrics-only pattern, not a measurement-method replacement, not a Q-bundle pattern, and not a gate or decision pattern. It repairs overloaded characterization wording so the exact Characteristic, Scale, Coordinate, Value, Score, Unit, ScoringMethod, indicator role, comparison reference or comparator set, proxy role, admissible use, and governing pattern become recoverable.
Builds on. E.10, E.10.ARCH, A.17, A.18, C.16, A.19, C.25, C.29, E.21, F.18, and A.6.P.
Coordinates with. C.16.Q, A.19.ECS, CHR mechanism patterns, G.0, G.5, G.9, C.11, A.10, B.3, A.20, A.21, C.28, A.15, evidence, assurance, gate, decision, causal-use, release, work, benchmark, and publication patterns governing those claims.
E.10.ARCH governing relation. When E.10 encounters metric, score, axis, dimension, feature, property, indicator, strong, weak, robust, level, coordinate, threshold, benchmark, or scalar-quality wording whose characteristic and scale construction is hidden, E.10.ARCH selects C.16.P only until bearer, characteristic, scale, value or score construction, comparison reference or comparator set, threshold rule or reference, proxy relation, admissible use, and governing pattern are recovered. After that recovery, the governing pattern governs its own invariant.
Use this when
Use this pattern when wording such as axis, dimension, feature, property, metric, indicator, score, strong, weak, robust, level, coordinate, threshold, rating, benchmark, quality coordinate, or architecture score carries a characterization claim but does not yet show the recoverable construction.
What goes wrong if missed. A metric becomes a measure without a scale, a score becomes proof, strong becomes a verdict without a characteristic, a level becomes an undefined maturity status, an indicator becomes the thing indicated, or a benchmark result becomes gate passage or release permission.
What this buys. The reader can recover the bearer, characteristic, scale, value, score, unit, scoring method, indicator role, comparison reference or comparator set, threshold, admissible use, and governing pattern before treating a number, adjective, coordinate, or comparison as actionable.
First useful move. Ask which bearer, characteristic, scale, value or score construction is recoverable; then apply C.16, A.19, C.25, C.29, E.21, or the neighboring pattern governing that claim instead of letting the compact word decide.
Not this pattern when.
- If the
Characteristic,Scale, value set, scoring method, and admissible use are already recoverable, useC.16,A.17,A.18, orA.19directly. - If the claim being made is a Q-bundle, quality-term or evaluative characterization, or pattern-quality coordinate, use
C.25,C.16.Q, orE.21directly after any needed characteristic-scale repair. - If the claim being made is mathematical-lens use, use
C.29. - If the claim being made is evidence, assurance, gate, work, decision, causal-use, release, benchmark harness, or project-side authority claim, use the governing pattern for that claim after characteristic and scale construction is recovered or blocked.
Problem frame
Working texts often need compact characterization words. The problem starts when compact words begin to carry comparison, proof, selection, gate, readiness, release, quality, or decision claim without recoverable characteristic and scale construction.
The repair question is:
What characteristic or scale construction is recoverable, and what governing pattern carries the remaining claim?
The recoverable item may be:
- a
CharacteristicunderA.17; - a
Scale, coordinate, value, unit, scoring method, measure, or measurement use underA.18andC.16; - a
CharacteristicSpaceunderA.19; - a Q-bundle under
C.25; - quality-term or evaluative characterization under
C.16.Q; - pattern-quality coordinate use under
E.21; - mathematical-lens use under
C.29; - comparison, threshold, indicator, proxy, benchmark, gate, evidence, decision, or work claim under neighboring patterns governing those claims;
- ordinary prose with no FPF-governed use.
Problem
How can FPF repair characterization wording without:
- treating
metricas a universal measurement kind; - treating
scoreas proof, readiness, gate passage, release permission, or decision; - treating
axis,dimension,feature,property, orlevelas a recoverable characteristic by appearance; - treating
strong,weak,robust,high,low, orbetteras meaningful without a scale and comparison reference or comparator set; - turning
C.16.Pinto a CHR super-pattern or replacement forC.16,A.17,A.18,A.19,C.25,C.29, orE.21; - copying first-stage characterization repair lists into every governing pattern.
Forces
Solution
Repair compressed characterization wording by producing a characteristic-scale repair note or equivalent local rewrite.
Minimum fields:
Use the full note only when the repair must remain inspectable. Use a local rewrite when one sentence clearly states the characteristic and scale construction and governing pattern.
Recovery sequence
- Capture the trigger. Copy the exact word or phrase and the sentence that uses it.
- Recover the bearer. Name what is being characterized: holon, pattern, DRR, architecture description, structure, model, method, work result, publication, candidate, relation, decision option, evidence path, or another FPF kind named by value.
- Recover the construction. Decide whether the trigger means
Characteristic,Scale, coordinate, value, score, unit, scoring method, indicator, threshold, comparison reference or comparator set, proxy, Q-bundle, mathematical lens, gate, evidence, decision, or ordinary prose. - Select direct governing pattern when possible. If
C.16,A.17,A.18,A.19,C.25,C.29,E.21, or another governing pattern is already recoverable, use it directly. - Repair hidden characteristic and scale construction. When construction is hidden, recover the minimal needed set: characteristic, scale, value set, score, unit, scoring method, indicator role, comparison reference or comparator set, threshold rule or reference, admissible use, and non-admissible use.
- Exit adjacent claims. Evidence, assurance, gate, work, decision, causal-use, release, benchmark, publication, or authority claims go to governing patterns.
- State remaining reader move. Say what the reader can now compare, measure, score, block, or assign to a neighboring pattern. If the result is type-correct but gives no action or recognition reason, the repair is incomplete.
Trigger split
Governing-Pattern Exits Named by Value
Refresh and reopen conditions
Reopen or narrow C.16.P when current pattern-language ecology changes the first characteristic and scale entry:
- a new characteristic named by value, scale, evaluation, benchmark, proxy or indicator, gate or decision, mathematical-lens, quality, OEE, NQD, or publication pattern can receive one row directly;
- current best-known practice changes comparability, proxy-risk, threshold, measurement, scoring-method, or benchmark-harness discipline adopted in
C.16.P:8; - README, ToC,
E.11, retrieval, or local Problem-frame entry cues change the first practical entry for hidden characteristic and scale wording; - a governing pattern starts copying first-stage
metric,score,axis,strong, orindicatortrigger lists that belong here; C.16.Pbegins to act as a metrics catalog, maturity scheme, or CHR super-pattern rather than a wording-use repair pattern for hidden construction.
The refresh action is to remove, narrow, or redirect the first-stage row. It is not to preserve old exits as history.
Worked cases
Reduced SoTA row
Current measurement, quality, proxy-risk, and comparison practice distinguishes characteristics, scales, measures, scores, indicators, thresholds, comparability, proxy status, and decision use. FPF adopts this line only where it changes examples, non-comparability boundaries, indicator and proxy boundaries, scale and scoring method fields, gate and comparison exits, or conformance checks.
This row blocks scalar verdicts without declared scale and admissible use. It does not import metric lists, maturity-status schemes, or external scoring traditions as FPF ontology.
Conformance checklist
Common anti-patterns
Related patterns
E.10catches hidden characteristic and scale wording and selects this pattern only when construction is hidden.E.10.ARCHdefines the shared wording-use recovery order and applicability row.A.17,A.18, andC.16govern characteristics, scales, values, measures, and measurement use.A.19governs characteristic-space construction.C.25governs Q-bundles.C.16.Qgoverns quality-term or evaluative characterization wording.E.21governs pattern-quality evaluation characteristic spaces.C.29governs mathematical-lens use.- Exact evidence, assurance, gate, work, decision, causal-use, release, benchmark, and publication patterns govern their own claims.
C.16.P:End
Quality-Term Precision Restoration
Type: Characterization precision-restoration pattern Status: Stable Normativity: Normative unless explicitly marked informative
Plain-name. Quality-term precision restoration.
Intent. Provide a reusable discipline for repairing overloaded quality and evaluative-characterization wording in FPF texts.
This pattern lives in the C.16 characterization pattern nest. It rewrites bare evaluative prose either into one explicit endpoint-pattern-governed evaluative form or, when endpoint selection is still being stabilized, into one explicit transitional quality-term repair form with a declared sense family, admissible normal form (SignalPack | Characteristic | Bundle | Objective), reference-plane accountability, and lexical guardrails.
It allows philosophical, neuro-symbolic, control-theoretic, engineering, and open-ended-search uses to coexist without false identity by label. It does not treat quality-term or evaluative characterization as relation construction by default. When the found problem is relation construction, bridge, basedness, action-invitation relation, endpoint mismatch, or another relation-shaped claim, use A.6.P or the relation named by value specialization.
Placement.
Part C > C.16 characterization pattern nest > precision-restoration pattern for overloaded quality and evaluative-characterization wording.
Builds on.
E.10, E.10.ARCH, C.16.P, C.16, C.25, E.21, A.17, A.18, A.19, A.7, C.2.1, E.8, F.9, and F.18.
Coordinates with.
A.6.P for relation-construction exits; A.6.A for action-invitation exits; C.2.2a, A.16, A.16.1, A.16.2, and B.4.1 for language-state chart positions, admissible moves, early cue handling, responsibility handoff, and admissible retreat when an evaluative publication must be reopened; B.5.2.0 when the admissible continuation is still an open explanatory probe rather than a stable endpoint characterization; C.2.LS, C.2.4, C.2.5, C.2.6, and C.2.7 for articulation, closure, anchoring, and representation-factor facets referenced but not governed here; E.17.0, E.17, and E.18 for viewpoint publication; A.10 and B.3 for evidence and assurance; A.19.CN for comparability governance; F.9.1 for bridge-stance annotations; C.3.3 for explicit kind-bridge repair when endpoint kind mismatches appear.
E.10.ARCH governing-pattern relation.
When E.10 encounters quality, good, fit, high-quality, quality metric, quality score, quality characteristic, quality requirement, model quality, architecture quality, solution quality, or evaluative -ility wording whose quality sense, bearer, evaluation frame, endpoint normal form, or governing pattern is hidden, E.10.ARCH assigns the repair to C.16.Q only until those values are recovered or the claim being made exits to C.16.P, C.25, E.21, A.6.P, A.6.A, C.29, A.10, B.3, A.20, A.21, C.11, C.2.P, or another pattern governing the recovered claim. C.16.Q does not keep evidence, assurance, gate, decision, work, release, relation, action-invitation, mathematical-lens, source-use, or publication invariants after that exit is recoverable.
Non-goal.
This pattern does not assert that phenomenal character or qualia, phenomenological preconceptual fit, Pirsig-style dynamic quality and static quality, latent fit in learned representations, explanatory merit, engineering -ilities, QD and NQD selector value, and control adequacy are one concept.
Its job is to publish a disciplined evaluative-characterization use across those traditions while preventing false identity by shared label.
It also does not assert that every trigger use of "quality" is admissibly repaired by the transitional quality-term repair form: where the repaired statement is primarily about an action invitation under A.6.A, relation construction under A.6.P, or a requirement or commitment over explicit heads, the admissible move is to exit to the pattern governing the recovered claim rather than assigning a quality-term or evaluative characterization.
Use this when
Use this pattern when wording such as quality, good, fit, high-quality, quality characteristic, quality improved, or an evaluative -ility claim hides which quality or evaluative-characterization use is live.
Lowest sufficient use. Keep ordinary praise or quoted source-local wording ordinary when it carries no FPF-governed use. When the evaluative endpoint is already known, prefer a direct endpoint-governed rewrite. Use qualityTermAscription(...) only when transitional ambiguity must remain inspectable. Use the full slot set only when decision-bearing, publication-bearing, cross-tradition-bearing, or boundary-bearing claim is live.
What goes wrong if missed. A broad quality word becomes a scalar verdict, a gate, an evidence claim, a relation, a bridge, an action invitation, or a bundle by appearance, while the bearer, evaluation frame, quality sense, admissible normal form, and pattern governing the recovered claim remain hidden.
What this buys. The reader can recover the bearer, evaluation frame, candidate quality sense, admissible normal form, bridge or relation exit when live, and the pattern governing the recovered claim before using the quality word as action guidance.
First useful move. Name the bearer and evaluation frame, choose whether the wording is quality-term or evaluative characterization, characteristic-scale construction, Q-bundle, pattern-quality coordinate, relation construction, bridge stance, action invitation, or ordinary prose, then apply the pattern governing the recovered claim.
Not this pattern when.
- If the issue under repair is hidden characteristic, scale, score, metric, coordinate, threshold, or comparison construction, use
C.16.Pfirst. - If the claim being made is already a Q-bundle, pattern-quality coordinate, relation construction, action invitation, evidence, assurance, gate, work, decision, causal-use, release, or source-use claim, use the pattern governing the recovered claim directly after any needed quality-word repair.
- If the word is ordinary praise or source-local wording with no FPF-governed use, keep it ordinary, quote-only, or reduced-use rather than publishing a quality-term repair.
Problem frame
FPF repeatedly encounters a predictable precision failure mode around the token quality:
drafts say:
- “this design has quality”
- “the model quality improved”
- “quality matters before formalisation”
- “quality characteristics”
- “quality in QD and NQD”
- “the world model is higher quality”
- “the explanation is high-quality”
…but the intended meaning is actually one of several different evaluative families, for example:
- Phenomenal character or qualia when the experienced quality itself is the topic of description rather than an externally measured characteristic.
- Preconceptual fit or felt rightness before stable EntityOfConcern characterization.
- Latent and distributed fit signals in learned representations, world models, or active inference loops.
- Explanatory merit of a theory, problem frame, or conjecture.
- Architectural-description fitness and compression merit of an architecture description or architecture model under a declared viewpoint.
- Engineering quality families such as reliability, maintainability, security, evolvability.
- Usefulness and selection value in open-ended search, novelty–quality–diversity, or portfolio selection.
- Control adequacy of a policy, model, or controller in a closed loop.
The failure modes are recurrent:
- Sense elision. One broad evaluative noun hides several non-equivalent evaluative kinds.
- Bearer confusion. The bearer of the evaluation is unclear: record, publication carrier when the carrier itself is evaluated, episode, model, policy, explanation, candidate, architecture, relation, or action loop.
- Form confusion. A non-metric signal is rewritten as a metric; a bundle is treated as one scalar; an objective is mistaken for a characteristic.
- Substrate confusion. Embodied and preconceptual, latent and distributed, and symbolic-local representations are silently collapsed.
- Plane confusion. Quality of the EntityOfConcern being described, quality of the description, quality of the carrier, and quality of the publication face are silently collapsed across
ReferencePlanevalues and A.7 lanes. - Bridge illusion. Similar wording across traditions is mistaken for sameness.
- Illegal scalarisation. Composite engineering families or explanatory merit are compressed into one number without an admissible scoring method.
- Viewpoint conflict. One stakeholder means architectural attributes, another means usefulness, another means preconceptual fit.
Problem
How can FPF let working texts keep the communicative convenience of the word quality while preventing category errors when the term crosses:
- phenomenological and epistemological discourse,
- architecture-description fitness discourse and viewpoint-fit discourse,
- representation-learning and neuro-symbolic discourse,
- Popper- and Deutsch-style explanation-and-criticism discourse,
- engineering architecture and quality-characteristic discourse,
- open-ended evolution, NQD, and selection discourse,
- control, world-model, and active-inference discourse,
- ecological affordance discourse, including source-tradition
affordancecases that must leave quality-term restoration forA.6.Aor another action-invitation governing pattern?
Forces
- Breadth vs precision. “Quality” is attractive because it is broad; that same breadth makes it unsafe at boundaries.
- Preconceptuality vs auditability. Some uses refer to something real but not yet stably characterised.
- Distributed substrate vs local publication. Some evaluative signals arise in distributed or embodied substrates but must later be published in explicit local forms.
- Comparability vs non-reduction. Engineering and selection settings need comparability, but not every evaluative signal is an admissible metric.
- Cross-tradition dialogue vs false unification. The framework should permit parallels without asserting identity.
- Progressive articulation. A term may begin as a felt signal and later become a bundle, proxy set, or objective.
Solution
Stable repair frame > Sense Family > Slots > Normal Form > Change Lexicon > Guardrails
Trigger rule
A use of quality is in scope for C.16.Q when any of the following holds:
- the token quality or high-quality or low-quality appears in Tech or normative prose;
- a boundary statement relies on “quality” for admission, selection, explanation, comparison, assurance, or requirement-setting;
- different traditions are compared using the same word quality;
- a draft introduces quality metric, quality score, quality characteristic, quality requirement, model quality, architecture quality, solution quality, or quality in QD without a declared sense;
- the occurrence is intended to carry more than one of: evaluative fit, measurable characteristic, bundle, utility, or optimization objective.
Operational repair sequence
When the trigger fires, follow the E.10.ARCH recovery order specialized to quality-term or evaluative characterization:
-
Capture the trigger span. Copy the trigger phrase using quality or a red-flag derivative such as high-quality, quality metric, quality characteristic, or model quality.
-
Recover the bearer and publication lane. Name the bearer and the relevant A.7 lane or kind: EntityOfConcern being described, description,
epistemeor publication face, carrier when the carrier itself is evaluated, pattern, model, policy, explanation, candidate, architecture description, work result, relation, action loop, or ordinary prose. -
Reconstruct candidate quality senses and endpoint patterns. Enumerate plausible candidate senses and, when relevant, candidate endpoint-governing FPF patterns or explicit endpoint source references. If the occurrence is decision-bearing, publication-bearing, or cross-tradition-bearing, record a short quality-term candidate note before selecting the repair.
-
Exit when the claim being made is not quality-term or evaluative characterization. If the occurrence is primarily action invitation, relation construction, bridge, basedness, endpoint mismatch, evidence, assurance, gate, work, decision, causal-use, release, mathematical-lens use, characteristic and scale construction, or source-use, do not assign a
QualitySense. ApplyA.6.P,A.6.A,C.16.P,C.29,C.2.P, or the pattern governing the recovered claim. -
Select one explicit quality sense. Pick one
QualitySensetoken and state why rival senses were rejected in this local context. -
Emit an endpoint-explicit or transitional rewrite. Rewrite the sentence either into one explicit endpoint-pattern-governed evaluative form (
Characteristic | Q-Bundle | Objective | ExplanatoryMeritBundle | selector-value endpoint) or, when endpoint choice is still being stabilized, into one explicitqualityTermAscription(...)transitional repair form with bearer, frame, evaluator and viewpoint, normal form, and explicit qualifiers. -
Classify boundary-bearing consequences. If the repaired statement is used for admissibility, commitments, publication, evidence-bearing decisions, gates, release, or work, apply the governing pattern instead of letting quality carry the required claim by itself.
Transitional repair frame: evaluative classification anchored by qualityTermAscription(...)
C.16.Q stabilizes the ambiguity cluster by treating every in-scope quality statement as explicit evaluative content that must name the endpoint governing pattern or publication with named authority-reference relation that carries it, not as a bare adjective.
qualityTermAscription(...) is the canonical transitional quality-term repair form when the endpoint choice is not yet fixed. It is not the universal resting place, not a relation kind by default, and not a shadow endpoint source.
Entry into C.16.Q presupposes enough articulation explicitness to name the bearer, evaluation frame, and at least one candidate evaluative family. Closure degree may remain low while qualityTermAscription(...) is serving as a transitional repair form, but if the content is still only a cue pack, forwarded cue, or open explanatory probe, keep it in A.16.1, B.4.1, or B.5.2.0 rather than publishing it here prematurely. If a previously published evaluative record later loses the evidence, witness, or authority-reference relation needed to keep even that transitional status live, retreat via A.16.2.
The transitional form is:
So the sentence "X has quality" is never accepted as a terminal form. It must be rewritten either into an explicit endpoint-pattern-governed evaluative form or into this transitional repair form with a declared endpoint-governing pattern or explicit endpoint source relation.
Discipline note.
QualitySense is a slot value inside the transitional repair form; it is not a replacement for the endpoint FPF pattern or explicit endpoint source reference. The sense token refines what kind of evaluative characterization is being made while the endpoint source, governing pattern, or EntityOfConcern remains explicit.
Separation note.
evaluator and viewpoint are not synonyms. When both matter, publish them separately: the evaluator is the observing, criticizing, or selecting party or policy, while the viewpoint is the declared U.Viewpoint under which the ascription is presented.
Polarity discipline (bearer-centred; no silent inverse)
qualityTermAscription is bearer-centred.
Tech and normative prose SHALL keep the evaluated participant in the bearer position and SHALL publish evaluator and viewpoint separately.
- “Architects rate the system highly” rewrites to
qualityTermAscription(bearer=System, evaluator=ArchitectureReviewBoard, …). - “The benchmark says model quality is high” rewrites to
qualityTermAscription(bearer=Model, evaluator=BenchmarkPolicy, …).
There is no inverse token that silently makes the evaluator the bearer. If inverse wording is used in Plain prose, the wording SHALL be rewritten into the bearer-centred form (or publish an explicit inverse form under the pattern governing the recovered claim that governs it).
Endpoint-first discipline
When the admissible endpoint-governing FPF pattern or explicit endpoint source reference is already known, the endpoint-pattern-governed evaluative form SHOULD be published directly, and qualityTermAscription(...) SHOULD remain only when preserving the transitional ambiguity is itself informative. qualityTermAscription(...) is therefore a transitional characterization record, not a shadow endpoint source.
Typical direct endpoints are:
- engineering
-ilityheads published as oneCharacteristicor oneQ-Bundle, - selector-context uses published as an
Objectiveheaded byQS.UseValueunless overridden explicitly, - architecture-description uses published under the description-side evaluative head already selected by the viewpoint bundle,
- explanatory-merit uses published under the explicit merit bundle when that bundle head is already known.
Core construct: QualitySense
Every in-scope use SHALL resolve to an explicit QualitySense token.
A QualitySense token publishes at least:
Where:
articulationMode∈{ preconceptual, exemplar-grounded, proxy-grounded, characteristic-bound, bundle-bound, objective-bound }representationSubstrate∈{ embodied-kinesthetic, latent-distributed, symbolic-local, hybrid }defaultNormalForm∈{ SignalPack, Characteristic, Bundle, Objective }admissibleNormalFormsis the explicitly declared set of admissible evaluative normal forms for the sense.defaultNormalFormnames the primary evaluative normal form; any additional endpoint forms MUST be declared here rather than inferred ad hoc. If the quality ascription is published, route publication face, form, unit, carrier, and rendering questions to E.17, E.8, or the publication pattern governing the claim.
Normative starter set of sense families
A Context MAY add local senses, but the following starter set is normative as the initial disambiguation menu:
Default-form note.
QS.EngineeringQualityFamily and QS.ControlAdequacy default to Bundle.
A local Context MAY operationalize one explicit head as a Characteristic, but that is a declared operationalization, not a second default normal form.
Normative rewrite note.
-
In NQD, QD, or selector contexts, bare quality SHALL rewrite to
QS.UseValueunless a differentQualitySenseis explicitly declared. -
In engineering contexts, bare quality SHALL rewrite either to:
- one explicit
U.Characteristic+ CSLC Scale, or - one explicit
Bundle, preferably published as aQ-Bundlewhen composite.
- one explicit
-
In phenomenological contexts, bare quality SHALL rewrite to
QS.PhenomenalCharacterwhen the experienced quality itself is the topic of description, and toQS.PreconceptualFitwhen the talk is about preconceptual fit or felt rightness before stable characterisation. -
In representation-learning and world-model contexts, bare model quality SHALL rewrite to
QS.LatentFit,QS.ControlAdequacy, or both, with the distinction made explicit. -
In epistemic evaluation contexts, “good explanation” SHALL rewrite to
QS.ExplanatoryMerit. -
In architecture-description fitness or viewpoint contexts, bare architecture quality or architectural quality SHALL first disambiguate the bearer lane: if the bearer is the system-side bearer, use
QS.EngineeringQualityFamily; if the bearer is the description or episteme, useQS.ArchitecturalDescriptionFitness.
Required slots for a conforming qualityTermAscription
A conforming qualityTermAscription SHALL make explicit:
-
Bearer tuple. What is being evaluated, with arity explicit.
-
QualitySense. Which evaluative family is intended. -
Evaluation frame. The evaluation criterion or criterion frame under which the ascription is made. Examples: exemplar pack, probe pack, criticism or test pack, Q-bundle definition, CG-frame, acceptance spec, control horizon.
-
Evaluator or viewpoint. State the evaluator (observer, critic, selector policy, stakeholder family, or review body) and, when relevant, the
U.Viewpoint, separately. The two SHALL NOT be silently collapsed when they differ. -
Normal form. Whether the ascription is published as
SignalPack,Characteristic,Bundle, orObjective. -
Scope and time when relevant. The relevant USM scope (
U.ClaimScope,U.WorkScope,U.PublicationScope, or genericU.Scope) andΓ_timeSHALL be explicit when omission changes meaning. Freshness windows, qualification windows, or evidence decay windows SHALL be declared in the appropriate evidence or capability lane rather than smuggled into “quality” as an adjective. -
Reference plane when relevant. Especially when the same trigger phrase can refer to the EntityOfConcern being described, its description, its carrier, or a publication face under a different
ReferencePlane. -
Reference and representation scheme when relevant. Especially when the ascription depends on a declared reference scheme, representation scheme, or viewpoint-specific decoding convention.
-
Representation substrate when relevant. Especially when discussing parallels between preconceptual, latent-distributed, and symbolic-local treatments.
-
Witness and evidence mode. Exemplars, probes, measurements, bundle members, tests, traces, or closed-loop performance carriers.
Normal-form discipline
A QualitySense SHALL declare one admissible default evaluative normal form and MAY declare additional admissible evaluative normal forms explicitly.
The normal forms in this section are endpoint or evaluative forms. They are not publication forms by themselves. Publication face, publication form, publication unit, carrier, rendering, export, and front-end questions remain with E.17, E.8, or the endpoint-governing publication pattern named by value.
QNF-1 - SignalPack.
Use for QS.PhenomenalCharacter, QS.PreconceptualFit, and many cases of QS.LatentFit.
A conforming SignalPack contains:
- exemplar or contrast set or probe set,
- articulation notes,
- source episode, carrier, and observer,
- optional ordinal or thresholded summaries,
- explicit warning that the signal is not yet a
Characteristicunless an admissible proxy is later declared.
QNF-2 - Characteristic.
Use only when the sense is truly one measurable characteristic on one declared scale.
This uses A.17, A.18, and C.16 and inherits full scale legality.
QNF-3 - Bundle.
Use when the sense is composite.
Typical for QS.ExplanatoryMerit, many engineering quality families, and QS.ControlAdequacy.
A conforming bundle contains:
- member heads,
- whether each head is Characteristic, status, mechanism, scope, or test,
- aggregation policy if any,
- prohibition on hidden scalarisation.
Engineering note.
For engineering -ility families, the preferred bundle endpoint is Q-Bundle (C.25), because it keeps Measures[CHR] distinct from ClaimScope and WorkScope and from Mechanisms and Status.
Q-Bundle is a C.25-governed bundle endpoint rather than a fifth normal form beside SignalPack | Characteristic | Bundle | Objective.
Do not use a free-floating bundle with hidden metric semantics.
QNF-4 - Objective.
Use for QS.UseValue in selection, generation, or search contexts.
A conforming objective contains:
- CG-frame or objective endpoint source reference,
- admissible comparators,
- acceptance or selector policy,
- reference plane and window,
- relation to novelty, diversity, and constraints.
Functional vs quality-family discipline
C.16.Q SHALL prevent the collapse of function or capability claims into quality-family claims.
- A statement about what a system does uses
A.6.Ffirst when function-like wording hides the FPF kind named by value, relation, or claim, then the pattern governing the recovered capability, method, work, role,A.6.Mmodule-interface, architecture, mathematical, evidence, assurance, gate, decision, or release claim whose primaryEntityOfConcern, bearer, relation record, or characteristic-space construction is recovered. - A statement about how well, how safely, how robustly, or how maintainably it does so belongs to
QS.EngineeringQualityFamily. - “Quality characteristic” and “functional characteristic” SHALL NOT be used as interchangeable labels.
- In engineering contexts,
-ilitynames are quality-family labels, not automatically Characteristics. They become admissible only as one explicitU.Characteristicor one explicitBundle(preferably expressed throughQ-Bundlewhen composite). - Cross-references are allowed; category collapse is not.
Bridge discipline across traditions
Whenever two different traditions are compared using the word quality, the repair SHALL publish an explicit bridge stance and loss note.
Allowed bridge stances:
localRename— near-synonymous within one Context.operationalizes— one sense is turned into a proxy or measurable form.partialAnalogy— structurally similar but not identical.projection— one richer sense is projected into a narrower evaluative frame.nonEquivalent— same word, no admissible bridge asserted.
Examples:
QS.PreconceptualFit-QS.LatentFitis usuallypartialAnalogy, not identity.QS.PreconceptualFit-QS.PhenomenalCharacteris usually a progression-by-articulation relation, not identity.QS.PreconceptualFit> engineering measures is usuallyoperationalizesorprojection, with loss notes.QS.EngineeringQualityFamily>QS.UseValueis usuallyprojectionunder a CG-frame.QS.ExplanatoryMerit-QS.UseValueis not identity unless a Context explicitly defines such a projection.- Pirsig-style dynamic quality usually applies
QS.PreconceptualFit(sometimesQS.LatentFit) only aslocalRenameorpartialAnalogyunder a declaredU.BoundedContext; it is not identity by label. - Pirsig-style static quality usually applies
CharacteristicorBundlepublication under some other declared sense; it is not identity with dynamic quality. QS.ArchitecturalDescriptionFitness-QS.EngineeringQualityFamilyis usuallyprojectionornonEquivalentunless the Context explicitly states which heads of description-fitness are intended to proxy which system-side characteristics.
Change lexicon
A conforming quality-term repair publication SHALL narrate changes with a stable change lexicon aligned to A.6.P:
declareQualityTermAscription(...)— create a new explicit quality ascription record.withdrawQualityTermAscription(...)— retire a prior record.retargetBearer(...)— change the evaluated bearer tuple while keeping the same quality-term repair form.reviseSense(...)— change the value in thequalitySenseslot.reArticulate(...)— changearticulationModewhile preserving sense family.reProxy(...)— change proxy, probe, or operationalisation details.reBundle(...)— change bundle members or aggregation policy.reScale(...)— change characteristic scale or scale type.reFrame(...)— change evaluation frame.reView(...)— change evaluator and viewpoint.rescope(...)— changeU.Scope.retime(...)— changeΓ_time.refreshWitnesses(...)— refresh evidence or witness bindings.assignToGoverningPattern(...)— semantic move to a non-quality governing pattern; never edit in place silently.
A silent sense rewrite is a breaking semantic change.
If the ascription ceases to mean “quality ascription” at all, use assignToGoverningPattern(...) rather than pretending the same record survived unchanged.
A.6.P rewrite note.
retargetBearer(...) is the family-specific form of retargetParticipant(BearerSlot, …).
reviseSense(...), reArticulate(...), reProxy(...), reBundle(...), reScale(...), reFrame(...), and reView(...) are family-specific refinements of reviseByValue(...) and SHALL preserve the A.6.5 distinction between ref retargeting and by-value edits.
A.6.B boundary classification template for quality-term repair
When a repaired quality statement becomes boundary-bearing, classify it explicitly:
- L —
qualityTermAscriptionrepair-form skeleton,QualitySensesemantics, normal-form admissibility, and declared bridge stances; - A — admissibility conditions for using the ascription in selector, gating, and publication lanes (required qualifiers, witnesses, thresholds, qualification windows);
- D — publication requirements (lexical firewall, mandatory rewrites, publication duties);
- E — carrier-anchored evidence and work effects (measurements, traces, critique sheets, probe packs, selector logs).
Where this family is published as a reusable boundary publication, stable L-Q*, A-Q*, D-Q*, and E-Q* claim ids SHOULD be published (or the reused L/A/D/E-classified claim set should be cited by location), and paraphrase drift across quadrants SHALL be avoided.
Do not let the bare word quality carry L/A/D/E claim by itself.
Lexical guardrails
In Tech and normative prose:
-
bare quality MUST NOT appear without immediate resolution to a
QualitySense; -
high-quality, low-quality, quality metric, quality score, quality requirement, model quality, architecture quality, and solution quality are red-flag tokens;
-
quality characteristic MAY appear only as:
- a bridge label to an external standard or tradition, or
- a family label immediately rewritten into one explicit
U.CharacteristicorQ-Bundle;
-
quality requirement or quality requirements MUST NOT remain bare noun phrases; the text SHALL rewrite them into explicit
RequirementRole,U.Commitment, orU.PromiseContent.acceptanceSpecstructures over one namedU.Characteristic, oneQ-Bundlehead, or one explicit objective head; -
architecture quality or architectural quality MUST NOT appear without an explicit bearer lane (
EntityOfConcern being described,description,epistemeor publication face, or carrier when the carrier itself is evaluated) and, when omission changes meaning, an explicitreferencePlane; -
in QD and NQD contexts, bare quality MUST default to
QS.UseValue; -
preconceptual uses MUST NOT be presented as if they were already Characteristics;
-
latent and distributed fit MUST NOT be presented as if it were automatically explanatory merit;
-
if the occurrence is primarily action-invitation talk, the text MUST NOT assign a
QualitySense; it SHALL exit toA.6.Aor another action-invitation governing pattern, with source-traditionaffordancewording kept only as a quoted cue when needed; -
scope words (applicability, envelope, generality, validity) MUST NOT be used as hidden substitutes for
U.Scope,U.ClaimScope (G), orU.WorkScope; -
quoted metalinguistic uses of the token quality are allowed, but SHALL be marked as token-under-discussion, not as a boundary-bearing term.
Progressive elaboration
C.16.Q permits monotone elaboration:
- Start by selecting a
QualitySenseand capturing rival candidates when ambiguity is live. - Declare bearer, frame, viewpoint, and substrate.
- Choose an admissible normal form.
- Add exemplars, probes, characteristic heads, bundle members, and objective pins.
- Add bridges and loss notes if comparing traditions.
- If the repaired sentence is boundary-bearing, emit
L/A/D/Ehooks rather than letting “quality” carry them implicitly. - Never move between sense families silently.
Archetypal Grounding
Tell
If a draft says quality, the draft has not yet named the evaluative family.
A conforming rewrite publishes either one explicit endpoint-pattern-governed evaluative form or one explicit qualityTermAscription(...) transitional record with one QualitySense, one bearer tuple, one evaluation frame, one evaluator and viewpoint, one admissible normal form, explicit scope, time, and bridge qualifiers when they matter, and declared endpoint-governing pattern or explicit endpoint source relation.
Show (System lane)
Draft: “The model quality improved.”
Repair A — latent representation line
qualityTermAscription( bearer = Model_v5, qualitySense = QS.LatentFit, evaluationFrame = ProbePack_PP2, evaluator = RepLearningReviewBoard, normalForm = SignalPack, Γ_time = Window_W5, witnesses = {ProbeSeparationRun_22, AliasRiskCard_9} )
Repair B — closed-loop control line
qualityTermAscription( bearer = PolicyModelPair_PM5, qualitySense = QS.ControlAdequacy, evaluationFrame = Horizon_H × EnvClass_E, evaluator = ControlReviewBoard, viewpoint = ControlView_VP, normalForm = Bundle, scope = U.WorkScope(ControlDeploymentScope_7), Γ_time = RunWindow_RW, witnesses = {ClosedLoopTraceSet_41} )
Show (Episteme lane)
Draft: “Quality matters before definition.”
Repair A — preconceptual or phenomenological line
qualityTermAscription( bearer = ProblemFramingEpisode_PF3, qualitySense = QS.PreconceptualFit, evaluationFrame = ExemplarPack_EP3, evaluator = ReviewerGroup_A, normalForm = SignalPack, representationSubstrate = embodied-kinesthetic, witnesses = {EpisodeNotes_3} )
Repair B — explanatory line
qualityTermAscription( bearer = Explanation_N5, qualitySense = QS.ExplanatoryMerit, evaluationFrame = CriticismBundle_CB4, evaluator = TheoryReviewPanel, referencePlane = episteme, normalForm = Bundle, witnesses = {CritiqueSheet_14, CounterexampleSet_2} )
Show (Architecture description lane)
Draft: “The architecture quality improved.”
Repair A — quality of the system-side bearer
qualityTermAscription( bearer = PaymentPlatform_v4, qualitySense = QS.EngineeringQualityFamily, evaluationFrame = Q_Bundle_AvailabilitySecurityEvolvability_3, evaluator = ArchitectureReviewBoard, viewpoint = TEVB_ArchitectureViewpointSet, referencePlane = world, normalForm = Bundle, witnesses = {AvailabilityReport_8, CouplingCheck_3, EvolvabilityNote_2} )
Repair B — quality of the architecture description
qualityTermAscription( bearer = ArchitectureDescription_AD12, qualitySense = QS.ArchitecturalDescriptionFitness, evaluationFrame = ViewpointBundle_TEVB × DecisionQuestionSet_DQ7, evaluator = ArchitectureReviewBoard, viewpoint = TEVB_ArchitectureViewpointSet, referencePlane = episteme, normalForm = Bundle, witnesses = {CoverageMatrix_4, CorrespondenceCheck_7, ViewConsistencyNote_2} )
Show (QD or selector lane)
Draft: “Quality in our QD loop.”
Repair
qualityTermAscription( bearer = Candidate_7, qualitySense = QS.UseValue, evaluationFrame = CG_Frame_9, evaluator = SelectorPolicy_P4, normalForm = Objective, Γ_time = SelectionWindow_SW, witnesses = {ObjectiveCard_9, AcceptanceSpec_4} )
Bias-Annotation
Lenses tested: Gov, Arch, Onto-Epist, Prag, Did. Scope: Universal for overloaded evaluative uses of quality in FPF-governed wording.
- Gov bias: this pattern favors explicit evaluative publication and explicit L/A/D/E hooks, which improves auditability but adds drafting overhead.
- Arch bias: this pattern prefers one stable ascription relation over free-form philosophical prose, which improves reuse but can feel rigid in exploratory notes.
- Onto-Epist bias: this pattern refuses to collapse preconceptual, latent, explanatory, engineering, and selector senses into one concept; that increases honesty at the cost of extra lexical work.
- Prag bias: this pattern defaults QD and NQD uses toward
UseValue, which improves selector clarity but can feel narrower than colloquial “quality”. - Did bias: this pattern is intentionally teachable through repeated rewrites; the risk is over-formalizing early exploratory language.
Conformance Checklist (CC-C16Q)
A text or pattern conforms to C.16.Q iff:
-
CC-C16Q-1 - Explicit endpoint classification and explicit sense. Every in-scope use of quality resolves either to one declared endpoint-pattern-governed evaluative form or to one declared
qualityTermAscription(...)transitional record with one declaredQualitySenseand explicit endpoint classification. -
CC-C16Q-2 - Explicit bearer and arity. The evaluated bearer tuple is explicit.
-
CC-C16Q-3 - Explicit frame. Evaluation frame is explicit and reviewable.
-
CC-C16Q-4 - Evaluator and viewpoint are explicit. The ascription states who evaluates, from which viewpoint, or under which selector or observer policy.
-
CC-C16Q-5 - Substrate and referencePlane are declared when relevant. Cross-talk between preconceptual, latent-distributed, symbolic-local, and
ReferencePlanevaluesworld,concept, andepistemeis not allowed without an explicit substrate declaration and, when live,referencePlanedeclaration when those distinctions are live. -
CC-C16Q-6 - Scope and
Γ_timeare explicit when omission changes meaning. If scope or time selection affects interpretation, the ascription declaresU.Scopeand, when live,Γ_timeexplicitly. -
CC-C16Q-7 - Admissible normal form. The ascription uses
SignalPack,Characteristic,Bundle, orObjectiveas its endpoint or evaluative normal form, with the corresponding discipline observed. -
CC-C16Q-8 - No illegal scalarisation. Composite senses are not collapsed into one score without an explicit scoring method.
-
CC-C16Q-9 - No silent sense rewrite. Any semantic change in the ascription uses the declared change lexicon; changing sense silently is forbidden.
-
CC-C16Q-10 - QD default. In search, selection, or NQD contexts, quality resolves to
QS.UseValueunless overridden explicitly. -
CC-C16Q-11 - Engineering family discipline. Engineering
-ilityuses resolve to one explicitU.Characteristicor one explicitBundle(preferably published asQ-Bundlewhen composite); they are not left as free-floating adjectives. -
CC-C16Q-12 - Functional separation. Function or capability claims remain distinct from quality-family claims.
-
CC-C16Q-13 - Bridge accountability. Cross-tradition parallels publish bridge stance and loss notes; cross-context or cross-plane reuse cites explicit Bridge ids and CL policy where applicable.
-
CC-C16Q-14 - Boundary-claim hook when needed. If a repaired quality ascription is used for admissibility, commitments, publication, or adjudication, the downstream
L/A/D/Ehooks are explicit rather than carried implicitly by the word quality. -
CC-C16Q-15 - Lexical firewall. Bare quality is absent from Tech and normative prose except as quoted metalinguistic discussion.
-
CC-C16Q-16 -
qualityTermAscriptionrepair-form skeleton is published. The family-specific transitional tokenqualityTermAscriptionresolves to a repair-form skeleton that publishes bearer position, evaluator and viewpoint slots, qualifier expectations, repair paths for bearer-kind mismatches, witness discipline, admissible change classes, and cross-context or cross-plane policy. -
CC-C16Q-17 - Candidate-Set Note is used when ambiguity is live. If sense selection, bearer facet, or A.7 lane or kind (
EntityOfConcern being described,description,epistemeor publication face, or carrier when the carrier itself is evaluated) is non-obvious, the text records a short Candidate-Set Note before the rewrite is treated as decision-bearing or publication-bearing. -
CC-C16Q-18 - Evaluator and viewpoint are not silently collapsed. When both an evaluator and a
U.Viewpointmatter, they are represented as separate slots or fields. -
CC-C16Q-19 - Family-specific change verbs dock cleanly with A.6.P and A.6.5.
retargetBearer(...)is used only for ref retargeting; sense, frame, bundle, scale, and view edits are narrated as explicit by-value revisions; silent retyping is forbidden.
Common Anti-Patterns and How to Avoid Them
Consequences
Benefits. This pattern makes evaluative language auditable across phenomenology, engineering, and search and selection contexts. It also makes subsequent wording repair easier because the repair is carried by one explicit quality-term repair form plus endpoint governing-pattern assignments rather than by ad hoc prose rules.
Trade-offs and mitigations. The pattern adds drafting overhead and can feel heavy in exploratory notes. Mitigation: allow bare quality in Plain commentary during exploration, but require repair before the term enters Tech and normative, boundary, selector, or assurance use.
Rationale
C.16.Q makes one strategic move:
The word “quality” is not treated as one concept. It is treated as a family of evaluative ascriptions whose members differ by substrate, articulation mode, bearer, frame, and admissible publication form.
This lets FPF discuss:
- Pirsig-like preconceptual fit,
- representation-learning and neuro-symbolic latent fit,
- explanation quality in criticism-driven inquiry,
- architecture-description fitness under a viewpoint,
- engineering quality families,
- use-value in open-ended evolution,
- control adequacy in action loops,
without forcing them into one false universal scalar.
It also makes the distributed-vs-local issue explicit:
- some senses originate in embodied or latent-distributed substrates,
- some are only publishable as symbolic-local CHR, bundle, and objective forms,
- and some require an explicit projection from the first into the second.
It also makes the bearer and plane issue explicit:
- some uses evaluate the EntityOfConcern being described,
- some evaluate its description under a viewpoint,
- some evaluate a carrier or publication face,
- and those uses must not be collapsed without an explicit bearer lane and, when needed, a declared
referencePlane.
That is exactly where semantic drift usually starts; C.16.Q turns that drift into an auditable design choice.
SoTA-Echoing
Evidence binding note. If your Context maintains a SoTA Synthesis Pack for evaluative language, architecture-quality vocabularies, selector and objective semantics, world-model evaluation, or embodied and preconceptual articulation, this section SHALL cite its ClaimSheet IDs, CorpusLedger entries, and BridgeMatrix rows and keep the adoption statuses below consistent with those IDs. Otherwise, use the table below as the current source-use and source-currentness record for this pattern revision, not as a generic seed list.
This section follows the required structure: claim > practice > source use and currentness > source > alignment > adoption status. C.16.Q aligns with contemporary practice across architecture-description standards, software-quality standards, evolutionary architecture, QD search, active-inference and world-model research, phenomenology and TAE, source-tradition affordance work, and philosophy of explanation, while making one explicit FPF move that those traditions usually leave implicit: the overloaded token quality is repaired into explicit evaluative endpoint forms, with qualityTermAscription(...) available as a declared transitional record carrying QualitySense, bearer, frame, admissible normal form, and bridge disposition while governing-pattern assignment remains open.
Source-use convention. Current-best source use means the row is used as the best-known current line for the narrow effect named in the alignment cell. Current-standard and reference-only use means an official standard supplies a useful distinction but does not by itself solve C.16.Q's quality-term restoration question. Current-practice reference use means the source family records a widely used current practice that C.16.Q adapts. Lineage and local-gloss material means the row helps recognition or terminology only. Rejected import states what C.16.Q refuses to import as FPF ontology.
Short alignment notes.
Architecture-description practice. ISO 42010 is a current-standard reference for not collapsing the selected system or other entity under description into its description. C.16.Q adopts that guardrail and adds lexical discipline: a draft may not say architecture quality without publishing which bearer lane is under evaluation and whether the evaluation is description-side or system-side.
Engineering quality practice. ISO 25010 gives a mainstream current-standard reason not to leave quality as a free noun: contemporary quality work is organized around named characteristics and subcharacteristics that are specified, measured, and evaluated. C.16.Q adopts that explicit-head discipline, but adapts it by assigning composite cases to Bundle or Q-Bundle and by treating quality requirement(s) as requirements over explicit heads rather than as self-standing nouns.
Evolutionary-architecture practice. Fitness functions treat architecture-relevant concerns as continuously monitored heads tied to change and governance, not as one mystical scalar. C.16.Q adopts that operational spirit, but adapts it by keeping engineering-family evaluation, control adequacy, and selector value distinct and by forbidding function and quality-family collapse.
QD and NQD practice. Modern QD work is explicit that search returns a collection of solutions that are high with respect to an objective and diverse with respect to declared measures. C.16.Q therefore adopts the default rewrite of selector-context quality to QS.UseValue in Objective form and rejects any rewrite that silently blends novelty, diversity, constraints, and utility into an unexplained scalar.
World-model and active-inference practice. Contemporary world-model and active-inference work uses generative and predictive models for perception, planning, learning, and action, which makes evaluation inherently multi-factor: latent representation quality, model evidence or predictive adequacy, policy adequacy, and task and objective value are not one thing. C.16.Q adapts this by separating QS.LatentFit, QS.ControlAdequacy, and QS.UseValue, and by requiring explicit evaluation frames and witnesses for each ascription.
Phenomenology and TAE practice. TAE-style work treats a felt sense as something that can be clarified and worded progressively, with tentative language that stays responsive to lived experience. C.16.Q adopts this progressive-articulation stance by giving QS.PreconceptualFit an admissible SignalPack form and by keeping QS.PhenomenalCharacter separately available when the experienced character itself, not action-guiding fit, is the topic.
Action-invitation boundary. Recent source-tradition affordance work emphasizes that affordances can be perceptually experienced as action possibilities that position or invite the agent to act. C.16.Q uses that insight only as a governing-pattern boundary cue: when the trigger use of quality is really action-invitation talk, the text should use assignToGoverningPattern(...) into A.6.A or another action-invitation governing pattern rather than forcing a QualitySense or qualityTermAscription(...).
Explanation practice. Contemporary philosophy of explanation keeps explanatory understanding and epistemic value distinct from engineering performance or utility maximization. C.16.Q adapts this by publishing QS.ExplanatoryMerit as its own evaluative family, typically Bundle-shaped, and by rejecting hidden scalarization into “high-quality explanation” without explicit heads.
Scale legality. The rows above do not license free arithmetic on the word quality. Whenever C.16.Q operationalizes engineering heads, selector objectives, or control adequacy numerically, it SHALL bind the comparison to an explicit ComparatorSet, CG-Spec, or declared aggregation policy and SHALL reject covert scalarization of bundles, explanations, or preconceptual signals.
Cross-Context and plane note. This section states alignment and non-identity only; it does not assert silent sameness across U.BoundedContexts or across planes. Any actual reuse of a quality vocabulary, selector head, or viewpoint-bound quality family across Contexts and planes SHALL publish BridgeId, CL, and loss-note policy and, where planes differ, the relevant Φ(CL) and Φ_plane policy ids.
Historical-lineage note. Earlier touchstones such as Pirsig, Popper, and Deutsch remain useful as lineage and local-gloss resources, but C.16.Q does not use them as formal SoTA anchors here because E.8 requires post-2015 primary sources for Architectural patterns unless the row is explicitly lineage or local-gloss material.
This SoTA alignment backs the pattern’s central move: quality is not one universal evaluative noun. In contemporary practice, the relevant work is already distributed across explicit characteristics, objectives, viewpoints, world-model criteria, explanatory virtues, felt signals, and action invitations; C.16.Q makes that distribution first-class and auditable.
Refresh and reopen conditions
Reopen or narrow C.16.Q when any of these current-pattern-language conditions becomes live:
- a recurring quality or evaluative family appears that is not covered by the current
QualitySensestarter set and cannot be treated as an existing endpoint-pattern-governed form; - a new endpoint governing pattern can govern a class of uses that currently require transitional
qualityTermAscription(...); A.7,C.2.P,C.2.1, or bridge-policy vocabulary changes the admissible lane, EntityOfConcern, publication-face, carrier, orReferencePlanewording used by this pattern;- current best-known practice changes a
QualitySense, normal-form boundary, action-invitation boundary, scale-legality boundary, or source-use and currentness row used inC.16.Q:11; - README, ToC,
E.11, retrieval, or local Problem-frame first-entry cues change for quality, characteristic, action-invitation, architecture-description, selector, or explanation wording; - subject patterns begin copying quality trigger lists,
QualitySenserows, or transitional repair-form slots that belong in this first-stage quality-term precision-restoration pattern.
The refresh action is to remove, narrow, or redirect the affected row or exit. Do not preserve a stale QualitySense, endpoint exit, lane wording, or source row as historical compatibility text.
Relations
- Lives in: C.16 characterization pattern nest as the quality-term realization of E.10.ARCH and C.16.P.
- Builds on: E.10.ARCH for shared wording-use restoration architecture; C.16.P for characteristic and scale exits; A.2.6 for explicit scope and
Γ_time; A.17, A.18, and C.16 for admissible measurable characteristics; C.25 for engineeringQ-Bundlepublication. - Coordinates with: A.6.P when the recovered content is relation construction rather than quality-term or evaluative characterization; A.6.A or another action-invitation governing pattern when the trigger invites action rather than evaluates a bearer; C.2.2a, A.16, A.16.1, A.16.2, and B.4.1 for language-state chart positions, admissible moves, early cue handling, responsibility handoff, and admissible retreat or reopen; use A.16.0 only when lineage, branch, loss, or handoff history itself must be published as an explicit trajectory account; B.5.2.0 for prompt-shaped continuations that are not yet stable endpoint publication; C.2.LS, C.2.4, C.2.5, C.2.6, and C.2.7 for language-state facet governance; C.17, C.18, and C.19 for
QS.UseValue, novelty and diversity discipline, and selector policy; E.17.0 and E.17.2 for architecture-description and viewpoint bundles; F.9 and F.9.1 for Bridges, CL, and bridge-stance annotations; A.6.B when repaired ascriptions become boundary-bearing. - Publishes vocabulary through: E.10, F.17, and F.18 when the
qualityTermAscriptionrepair-form skeleton, theQualitySensestarter set, and the red-flag rewrites become stable shared vocabulary.
Language-space refactor note
This pattern uses endpoint-first assignment rather than universal governance of all quality language. qualityTermAscription(...) remains useful as a transitional repair form, but it is not the required resting place or durable local record kind for every repaired use of quality.
Explicit endpoint selection
Admissible endpoints after repair include:
- a single
Characteristic, - a
Q-Bundle, - an
E.21 PatternQualityQBundle, when the bearer is one FPF pattern version and the evaluative claim asks whether the pattern is good enough for a declared reader, use, and scope. In this case, do not assign the claim to generalC.25unless the bearer is a non-pattern engineering quality family, - an
Objective, - an explanatory-merit bundle,
- a selector-value endpoint.
Bare quality in Tech prose should therefore be banned or rewritten immediately under an explicit endpoint-governing FPF pattern or explicit endpoint source reference. If that endpoint source is already known, qualityTermAscription(...) need not remain in the published normal form.
Endpoint-governance boundary
This pattern does not govern articulation-state characteristics, bridge stances, or representation factors. Those remain governed by A.16, C.2.LS, C.2.4, C.2.5, C.2.6, C.2.7, and F.9.1.
C.16.Q:End
Characterising Generative Novelty & Value (Creativity‑CHR)
Status. Mechanism specification (CHR) — normative where stated. Depends on. A‑kernel (A.1–A.15), CHR‑CAL (C.7), MM‑CHR measurement infrastructure (C.16), KD‑CAL and Sys‑CAL for carriers and holons, Decsn‑CAL (utility), Norm‑CAL (constraints/ethics). Coordinates with. B.5.2.1 NQD (abductive generator) for search instrumentation, Agency-CHR (C.9) for agential capacity, B-cluster trust/assurance (B.3), Canonical Evolution Loop (B.4), Role Assignment & Enactment Cycle (Six-Step) (F.6) and Naming Discipline for U.Types & Role Names (F.5). Guard‑rails. Obeys E‑cluster authoring rules (Notational Independence; DevOps Lexical Firewall; Unidirectional Dependency).
What this pattern provides (exports):
This pattern exports Characteristics and measurement templates only. It does not export any Γ_* operators, retained-set composition rules, Front/Archive/Shortlist heads, or selection/scalarization policies; those live in C.18 NQD-CAL, C.19 E/E-LOG, and G.5 (or Decsn-CAL for decision lenses). A Context publishes the measurement space and admissible policies; later choice using that space is attributed to a declared DecisionSubject at explicit DecisionSubjectGranularity under a named lens.
U.CreativitySpace— a CharacteristicSpace (CHR) with named Characteristics and scale metadata for evaluating creative work/outcomes inside aU.BoundedContext.U.CreativityProfile— a vector of coordinates inU.CreativitySpaceattached by aU.Evaluationto a specific Outcome (usually anU.Epistemeproduced byU.Work).- Core Characteristics (kernel nucleus; Context‑extensible):
Novelty@context— distance from aReferenceBasein the current Context/time window; ∈ [0, 1].Use‑Value(alias:ValueGain) — measured or predicted improvement against a declared objective; interval/ratio scale per Context.Surprise— negative log‑likelihood under a GenerativePrior; bits or nats.ConstraintFit— degree of must‑constraint satisfaction (Norm‑CAL / Service acceptance); ∈ [0, 1].- Diversity_P (declared retained-set / portfolio-level) — coverage/dispersion (set-level). Illumination is a report-metric over Diversity_P (coverage/QD-score summaries). It is report-only and never part of the primary dominance test.
AttributionIntegrity— provenance/licensing discipline for lawful, transparent recombination; ∈ [0, 1].FamilyCoverage— (count, polarity ↑, scope=declared retained set or portfolio, unit=families, provenance: F1‑Card)MinInterFamilyDistance— (ratio [0,1] or metric units, polarity ↑, scope=declared retained set or portfolio, DistanceDef@F1‑Card)AliasRisk— (ratio [0,1], polarity ↓, diagnostic; drop if dSig ≥3/5 characteristics collide)U.DomainDiversitySignature (dSig)— 5‑tuple over discrete characteristics [Sector, Function, Archetype, Regime, MetricFamily] attached to eachU.BoundedContext. Used for Near‑Duplicate diagnostics andAliasRisk. Policy: flag as Near‑Duplicate when ≥3 characteristics match; see F.1 invariants and SCR‑F1‑S08..S09.- Note (AliasRisk binding).
AliasRiskMAY be computed usingdSigcollision diagnostics; a Context MUST declare the collision rule and policy id in DescriptorMap provenance when AliasRisk is reported.
-
Supporting types (linking points):
U.ReferenceBase— the domain‑local corpus (by Context & time window) used to computeNovelty@context.U.SimilarityKernel— a declared similarity metric class for the Context (text/image/design/code/etc.), with invariance notes.U.GenerativePrior— a predictive model over the Context’s artifacts/behaviours used to computeSurprise.U.CreativeEvaluation— a specialisation ofU.Evaluationthat yields aU.CreativityProfileand the Evidence Graph Ref.EffortCost(advisory) — resource outlay to achieve the outcome; from WorkLedger (Resrc‑CAL). (For normalization and planning; not itself “creativity.”)
-
Operators (first tranche):
composeProfiles(set → declared retained-set profile),dominates(partial order in space),frontier(Pareto set),normaliseByEffort. (Formal laws introduced in Quarter 2.) -
Relations (informative; not exported): dominance relation (partial order in the space), frontier predicate (Pareto set), retained-set composition view. C.17 exports no operators and does not mint public set-result family heads; these are mathematical relations only.
Scope note. This pattern does not define who is “a creative person.” It characterises creative outcomes and episodes as observed in Work and expressed as Epistemes. Agency (capacity to originate) is measured in Agency‑CHR (C.9); here we measure what came out and how it scores against stated goals and references. A Context publishes the measurement space and admissible policies; later choice is attributed to a declared
DecisionSubjectat explicitDecisionSubjectGranularity, using a named lens within that space. CHR exports no Γ‑operators and no team workflow rules.
Motivation & Intent (manager’s read‑first)
Problem we solve. Teams talk past each other about “creativity”: some prize novelty, others business value, others originality or risk‑managed invention. Without a shared, context‑local measurement space, reviews derail, portfolios drift, and safety constraints are waived ad‑hoc.
Intent. Provide a small, universal measurement kit that turns “this is creative” into checkable, context‑local statements — grounded in evidence, aligned to objectives, and composable from individuals to portfolios.
Manager’s one‑screen summary (what you can do with it):
- Score a design/code/theory change on Novelty–Value–Surprise–ConstraintFit with declared references and models.
- Compare options in a Pareto sense (no single magic score forced).
- Consider constraints as a coordinate in the space; compare options on frontiers while keeping Context for high‑novelty options
- Track the declared retained set’s Diversity_P to avoid local maxima and groupthink.
- Defend decisions with an auditable CreativeEvaluation that cites what was new relative to which base, how value was measured, and why this counts here.
Forces
Design answer. A context‑local CreativitySpace with a small set of characteristics, each with clear measurement templates and Evidence Graph Ref; composition uses frontiers and partial orders, not forced scalarisation.
Solution Overview — The context‑local CreativitySpace
Idea. Creativity is not a type; it is a profile measured on an outcome (episteme) or episode (set of works) inside a bounded context. The context supplies the ReferenceBase, SimilarityKernel, GenerativePrior, objective function(s), and acceptance constraints.
Objects in play (A‑kernel alignment):
- A system (person, team, service) performs
U.Workunder a role (A.2). - That work yields a carrier (doc/model/design/code), i.e., an
U.Episteme. - We apply a
U.CreativeEvaluationto that episteme (and linked work) to produce aU.CreativityProfilewith evidence.
CreativitySpace (first‑class CHR):
U.CreativitySpace(Context) := 〈Novelty@context, ValueGain, Surprise, ConstraintFit, Diversity_P, AttributionIntegrity, EffortCost?〉
with scale/unit metadata from MM‑CHR (C.16), and Context‑specific measurement methods bound by MethodDescription.
DesignRunTag split (A.4):
- Design‑time: score concepts or specs against surrogate value models and priors; record assumptions (USM scopes; A.2.6).
- Run‑time: recompute ValueGain and ConstraintFit from Work evidence (service acceptance, KPIs) and refresh Surprise if priors update.
Vocabulary (CHR terms & D‑stubs)
Names are context‑local; below are kernel terms. Roles like “Designer/Reviewer” are contextual (A.2). Documents don’t act (A.7/A.12); they are evaluated.
-
U.ReferenceBase(D). A curated, versioned set of artifacts (epistemes) and/or behaviours that define “what exists already” in this Context and time window. Conformance (RB‑1): must declare inclusion criteria, time span (TimeWindow), and coverage notes. -
U.SimilarityKernel(D). A declared metric family with invariances (e.g., text: cosine over embeddings, image: LPIPS, code: AST graph edit). Conformance (SK‑1): must cite MethodDescription and test corpus; state limits. -
U.GenerativePrior(D). A model that yields likelihood of artifacts given the Context’s history (n‑gram/LM, design grammar, trend model). Conformance (GP‑1): must publish training slice, fit method, perplexity/fit metrics, and refresh policy. -
U.CreativeOutcome(D). AnyU.Epistemeput forward for creative evaluation (e.g., new design, algorithm, spec, policy draft). Note. If the outcome is a system change without a single carrier, attach the evaluation to a bundle (set) of carriers referenced from Work. -
U.CreativeEvaluation(D). AU.Evaluationthat outputs aU.CreativityProfileand anchors to ReferenceBase, Kernel/Prior, objective(s), acceptance tests, and Work evidence. -
U.CreativityProfile(D). The coordinate tuple inU.CreativitySpacewith provenance to the above inputs and USM scopes. Conformance (CP‑1): profile must include scales/units, scopes, confidence bands (B.3), and the edition of space definitions.
The Core Characteristics (kernel nucleus)
Each characteristic is specified per MM‑CHR (C.16) with: name, intent, carrier, polarity, scale type, measurement template, evidence, scope (USM), and didactic cues. Context profiles MAY add characteristics; kernel characteristics MAY NOT be removed without a Bridge.
Novelty@context — “How unlike the known set is this?”
-
Intent. Quantify distinctness of the outcome relative to
U.ReferenceBase(global or targeted slice). -
Carrier.
U.Episteme(the outcome). -
Polarity. Higher is “more novel.”
-
Scale. [0, 1]; ratio (0 = duplicate under kernel; 1 = maximally distant).
-
Measurement template (normative pattern):
- Declare ReferenceBase
Band TimeWindow window. - Declare SimilarityKernel
σand its invariances. - Compute
Novelty@context := 1 − max_{b∈B} sim_σ(outcome, b), or a robust variant (top‑k mean). - Publish sensitivity note (how results shift with kernel/
B).
- Declare ReferenceBase
-
Evidence. Kernel/version id; top‑k neighbours with distances; ablation on invariances.
-
Scope hooks (USM).
Bmust be a declared slice; Cross‑context use needs a Bridge with CL and loss notes. -
Didactic cues.
- Not “randomness.” Noise has high novelty, low value.
- Local, not global. Novelty is to this Context now, not timeless originality.
Use‑Value (alias: ValueGain) — “What good did this add under our objective?”
-
Intent. Quantify benefit vs a baseline objective (Decsn‑CAL utility, Service acceptance, KPI).
-
Carrier. Outcome (episteme) with Work evidence.
-
Polarity. Higher is better.
-
Scale. Interval/ratio, unit declared by the Context (e.g., ΔSNR, % defects, profit/period).
-
Measurement templates (pick one):
-
Measured:
ValueGain := metric_after − metric_before(declare counterfactual method). -
Predicted:
E[ValueGain | model]with error bars; update post‑run. -
Evidence. Declared objective/criterion; measurements or credible predictions; counterfactual method (A/B, back‑test, causal inference).
-
Scope. State the context window used for the objective; claims outside that window are informative only.
-
Didactic cues.
-
Value is relative to stated objective; if the objective is wrong, the value reflects it.
-
Keep counterfactual discipline; otherwise “gain” is storytelling.
-
Surprise — “How improbable under our learned world?”
-
Intent. Capture unexpectedness given
U.GenerativePrior. -
Carrier. Outcome.
-
Polarity. Higher surprise = more unexpected.
-
Scale. bits or nats:
Surprise := −log p_prior(outcome). -
Measurement template:
- Declare GenerativePrior (training slice, model class).
- Encode outcome for the prior; compute likelihood proxy.
- Publish calibration curve (reliability diagram / PIT histogram).
-
Evidence. Model cards; fit metrics; OOD diagnostics; refresh policy.
-
Scope. Training slice declared as ContextSlice; Bridges penalise R (trust), not the value itself (A.2.6).
-
Didactic cues.
- Novelty vs Surprise: high novelty under one kernel may be low surprise under a broad prior; publish both.
ConstraintFit — “Did it honour the non‑negotiables?”
- Intent. Ensure mandatory constraints (safety, ethics, standards, SLOs) are satisfied.
- Carrier. Outcome + Work evidence.
- Polarity. Higher is better (1 = all mandatory satisfied).
- Scale. [0, 1], ratio or pass/fail.
- Measurement template: declare set
C_must(Norm‑CAL / Service acceptance), computeConstraintFit := |{c∈C_must : pass(c)}| / |C_must|; optionally weight per criticality. - Evidence. Checklists, tests, audits; Who/Role performed the SpeechActs (approvals/waivers).
- Scope. Constraints are context‑local; Cross‑context requires Bridge; waivers are SpeechAct Work with RSG gates (A.2.5).
- Interpretation note. Low
ConstraintFitsignals tension with declared must‑constraints and warrants reframing or redesign; this pattern does not prescribe go/no‑go rules.
Diversity_P (declared retained-set / portfolio-level) — “Are we exploring the space?”
- Intent. At the set level, avoid myopic exploitation; promote coverage.
- Carrier. A set of outcomes.
- Polarity. Higher means broader coverage (not “better” per se).
- Scale. Set‑functional; Context defines metric (e.g., average pairwise distance, k‑cover over features).
- Template. Declare kernel and covering policy; compute score and coverage map (illumination); relate to USM ClaimScopes.
- Alignment note. The illumination/coverage view corresponds to IlluminationScore used by B.5.2.1 NQD‑Generate; no separate characteristic is introduced here—measure it as part of
Diversity_P. - Evidence. Distance matrix/cover plots; sensitivity to kernel.
- Didactic cue. Use Diversity_P to shape portfolios, not to pick single winners.
- Marginal gain (for generators) — normative. For a candidate h and current set S, ΔDiversity_P(h | S) := Diversity_P(S ∪ {h}) − Diversity_P(S). Contexts using NQD SHALL compute D as this marginal and publish the Diversity_P definition alongside the CharacteristicSpace/kernel and TimeWindow.
Heterogeneity Characterisation
- FamilyCoverage (polarity ↑) — count of distinct domain‑families covered by a declared retained set, portfolio, or triad; unit: families; window: declared.
- MinInterFamilyDistance (polarity ↑) — min distance between selected families in DescriptorMap for that declared retained set, portfolio, or triad; unit: per DistanceDef; window: declared.
- AliasRisk (polarity ↓) — collinearity/near‑duplicate risk indicator for contextual signatures; unit: score (0–1) with policy id.
Lexical special case (F.18 naming).
For lexical CandidateSets used by Name Cards (F.18), Diversity_P SHALL be computed over head-term families, not over raw strings. Variants that share the same lexical head (e.g., “Reference plane”, “Plane of reference”, “Planar reference”) MUST be treated as one family for coverage and distance; only candidates with distinct heads contribute to lexical Diversity_P. This aligns lexical use of Diversity_P with FamilyCoverage / AliasRisk and prevents inflating diversity by near-synonyms of a single head.
AttributionIntegrity — “Did we credit sources and licences correctly?”
- Intent. Discourage “novelty theft”; ensure recombination is lawful and transparent.
- Carrier. Outcome + provenance graph.
- Polarity. Higher is better.
- Scale. [0, 1]; fraction of required attributions/licence duties satisfied.
- Template. Trace graph coverage against Context policy; licence constraints as Norm‑CAL rules.
- Evidence. PROV‑style links; licence scans; acknowledgements.
- Didactic cue. High
AttributionIntegritysignals lawful and transparent recombination; low values indicate unacceptable practice in most Contexts. - Default role.
AttributionIntegrityis measurable but non‑dominant. It MAY serve as a policy filter/tie‑break (C.19). If certain attribution duties are must‑constraints, they belong to ConstraintFit (Norm‑CAL) and act as eligibility gates. It is not part of the default dominance set. - Dominance & gating note (normative).
AttributionIntegrityis a measurable Characteristic; it is not in the default dominance set. Contexts MAY use it as a filter or tie‑break via policy (C.19). Legal/ethical must‑fit checks live in ConstraintFit (Norm‑CAL); failing those blocks eligibility before dominance.
EffortCost (advisory) — “What did it take?”
- Intent. Normalise comparisons by cost; not part of “creativity” per se.
- Carrier. WorkLedger.
- Polarity. Lower is better when used as denominator.
- Scale. Resource units (hours, energy, $).
- Template. Sum cost categories over Work that produced the outcome.
- Evidence. Time/resource logs; BOM deltas.
- Didactic cue. Use
CreativityPerCost := f(Novelty@context, ValueGain, Surprise)/EffortCostfor operations planning, not for excellence awards.
Conformance Checklist (first tranche)
Manager’s Quick‑Start (apply in 5 steps)
- Name the Context (context + edition).
- Pick measurement defaults (kernel, prior, objective, constraints) from the Context’s handbook.
- Score outcome →
Novelty@context,Use‑Value,Surprise,ConstraintFit. - Decide by declared set result: identify the non-dominated
Front; emit aShortlistonly through one named lens or policy when selector-facing publication is needed; use ConstraintFit as a gate; apply policy if a scalar is approved. - Record a CreativeEvaluation with evidence; if crossing Contexts, attach the Bridge id.
Mental check. New to our base? Helpful to our objective? Unexpected under our model? Safe & licenced? If any answer is “unknown,” you are not done measuring.
Archetypal Grounding (three domains)
(a) Manufacturing design change)
Outcome. New impeller geometry for Pump‑37.
Context. PlantHydraulics_2026.
Novelty@context 0.42 (shape‑descriptor kernel vs last 5 years).
ValueGain. +6.8% flow @ same power (bench Work).
Surprise. 1.3 bits (within evolutionary trend prior).
ConstraintFit. 1.0 (materials, safety, noise).
Decision. Frontier-based choice: modest novelty, clear value, safe. The retained exploration set keeps Diversity_P by also funding one high‑surprise concept for exploration.
(b) Software architecture refactor)
Outcome. New concurrency model for ETL.
Context. DataPlatform_2026.
Novelty_G. 0.27 (AST/edit kernel vs internal corpus).
ValueGain. −20% latency, −35% p95 stalls (A/B Work).
Surprise. 0.5 bits (trend prior expected co‑routines).
ConstraintFit. 0.83 (fails SoD—same author as reviewer).
Decision. Return for SoD fix; then likely adopt. Creativity is not a waiver over governance.
(c) Scientific hypothesis)
Outcome. A new scaling law claim.
Context. GraphDynamics_2026.
Novelty_G. 0.66 (formula kernel vs literature base).
ValueGain. Predicted: explains 12 prior anomalies (model check).
Surprise. 3.7 bits (strongly unexpected under prior).
ConstraintFit. 1.0 (ethics N/A; evidence roles bound with decay windows).
Decision. Fund replication Work; track R decay per policy.
Anti‑Patterns (fast fixes)
Relations
- A.2 Role & A.15 Run‑alignment. Creative Work is performed by systems in roles; outcomes are epistemes. Creativity is measured by
U.Evaluation, not “done by a document.” - B.3 Trust/Assurance. Coordinates carry confidence bands; Bridges lower R by CL. Evidence roles (A.2.4) bind datasets/benchmarks used in measurements.
- C.9 Agency‑CHR. Agency measures capacity to originate; a high‑agency system may still output low‑creativity outcomes (and vice versa with strong scaffolding).
- A.2.6 USM (Scope). All measurements sit on ContextSlices;
G‑ladderis explicitly not used (C.17 follows A.2.6’s set‑valued scopes). - D‑cluster ethics. ConstraintFit is where must constraints, ethics, and safety bind the evaluation; waivers are explicit SpeechActs.
Authoring Aids (didactic cards)
- Write the Context. Context + edition on every profile.
- Name the base & kernel. Without them,
Novelty@contextis undefined. - State the objective. Value without a KPI is a story.
- Publish priors. Surprise needs a trained model with cards.
- Gate by musts.
ConstraintFit< 1 blocks enactment unless waived. - Prefer frontiers. Identify non-dominated options on the declared
Front; emit aShortlistonly through one named lens or policy when publication needs that head. - Bridge explicitly. Cross‑context talk needs CL and loss notes.
CSLC recap and the Creativity CharacteristicSpace
Purpose. Ground “creativity” as a measurable family of characteristics (CHR) rather than a role, capability, or virtue. Each characteristic is scoped to a U.BoundedContext, evaluated on U.Work episodes, U.Episteme values such as design sketches or models, or holders (systems/teams) via MM‑CHR exports (U.DHCMethodRef, U.Measure, U.Unit, U.EvidenceStub), using the CSLC discipline (Characteristic / Scale / Level / Coordinate).
Strict Distinction (A.7) reminders. Creativity is not a Role (no one “plays CreativityRole”). It’s a characterisation of outcomes/process. Creativity is not Work (no resource deltas). Work produces work results or publications that we later characterise. Creativity is not a service promise clause (no external promise). Promise clauses are judged from Work; creativity may correlate with value.
The Creativity CharacteristicSpace (CHR‑SPACE)
The core characteristics below are kernel‑portable names; Contexts specialise them (rename if needed, but keep semantics). Each characteristic declares: what we measure, on what carrier, typical scale, and where it lives in FPF.
Locality. Every characteristic is context‑local (e.g., Novelty@context). Cross‑context claims must use a Bridge and record CL penalties (B.3). No global novelty.
Context extensions & policy‑level characteristics (non‑kernel)
The following context‑local characteristics remain available but are not part of the kernel nucleus; use them as derived or policy measures:
- ReframeDelta — change in the problem frame that improves solvability (episteme‑pair; ordinal).
- Compositionality — degree of re‑use and new relations among parts (
U.Epistemevalue; boolean + structure score). - Transferability@X — portability to Context X via a Bridge (
U.Epistemevalue; ordinal + CL penalty). - DiversityOfSearch — breadth of approach classes tried (work set; count/rate).
- Time‑to‑First‑Viable — elapsed time to first Use‑Value = Pass (work; duration).
- Risk‑BudgetedExperimentation — planned vs realized exploration share (workplan vs work; ratio; policy gate).
Compatibility note. This split removes duplicate “core lists” and aligns C.17 with B.5.2.1 NQD and C.16/A.17–A.18: the kernel nucleus captures creativity qualities; the items above instrument Work, policy, or declared retained-set shaping without renaming
Front,Archive, orShortlist.
Scale choices (CSLC discipline)
For each characteristic, declare the scale explicitly (nominal / ordinal / interval / ratio). Do not average ordinal scores; fold with medians or distributional summaries. Choose units (when applicable) and coordinate semantics (e.g., what “distance” means).
- Novelty@context.
Coordinate =
1 − max_similarity(candidate, corpus)with a declared encoder (text, graph, CAD). Unitless in [0..1]. Document encoder & corpus freeze (A.10Evidence Graph Ref). - Use‑Value.
Passiff acceptanceSpec (fromU.PromiseContentor Decision KPI) is met from Work evidence; elsePartial/Fail. For scalar KPIs, publish mean ± CI and the acceptance threshold; predicted values carry error bars and are updated post‑run. - ConstraintFit.
Ratio = satisfied / declared must constraints. Constraints are
Norm‑CALrules; count only declared ones (no unspoken “norms”).
Metric templates (normative kernels + manager‑ready variants)
Template syntax (MM‑CHR):
U.DHCMethod { name, context, carrierKind, definition, unit?, scale, EvidencePin, acceptanceHook? }
Note: Data instances carry DHCMethodRef pointing to this template.
Templates (kernel definitions)
MT.Novelty@context
- carrierKind: candidate
U.Epistemevalue or work output. - definition:
1 − max_sim(encode(x), encode(y))over y in ReferenceSet@Context. - scale: ratio [0..1].
- EvidencePin:
{ReferenceSetId, EncoderId, Version}; frozen byA.10. - notes: Publish encoder & corpus drift in RSCR.
MT.Use‑Value
- carrierKind: work-fulfillment occurrence and resulting decision-memo publication.
- definition: Evaluation of an outcome against a declared objective/criterion for the current context (or predicted value with explicit model & error).
- scale: ordinal {Fail, Partial, Pass} or scalar KPI.
- EvidencePin: links to
U.Workthat fulfilPromiseContent`; cite acceptanceSpec edition.
MT.ConstraintFit
- carrierKind:
U.WorkorU.Epistemevalue. - definition:
|{c∈C_must : pass(c)}| / |C_must|within the MethodDescription scope; optional weighting by criticality allowed if declared. - scale: ratio [0..1].
- EvidencePin: constraint list from Norm‑CAL; checks from Work telemetry.
MT.ReframeDelta
- carrierKind: Episteme pair (ProblemStatement v0→v1).
- definition: Categorise frame change as {None, Local, BoundaryShift, Systemic}; justify with a Scope diff (
[A.2.6](/generated/patterns/A.2.6) U.ContextSlicedelta) and causal map simplification. - scale: ordinal 0–3.
- EvidencePin: diff publication plus Bridge notes if Cross‑context.
MT.DiversityOfSearch
- carrierKind: Work set (episode).
- definition: Count of distinct approach classes tried (domain‑local typology) / time.
- scale: count; derived rate.
- EvidencePin: tagged Work items; typology lives in the Context glossary.
MT.Compositionality
- carrierKind:
U.Epistemevalue. - definition: set aggregator (Compose‑CAL) of reused components ≥ K and presence of novel relation among ≥ 2 parts.
- scale: boolean + secondary “structure score” (e.g., depth or edge novelty).
- EvidencePin: component graph + provenance of parts.
MT.Transferability@X
- carrierKind:
U.Epistemevalue. - definition: Applicability in target Context X via a Bridge; report CL and residual scope slice.
- scale: ordinal {not portable, portable with loss, near‑iso}; record CL (0–3).
- EvidencePin: Bridge id + pilot Work in X.
MT.Time‑to‑First‑Viable
- carrierKind: Work episode.
- definition: elapsed wall‑clock to first
UsefulnessEvidence = Pass. - scale: duration.
- EvidencePin: first passing
U.Workid.
MT.Risk‑BudgetedExperimentation
- carrierKind: WorkPlan vs Work.
- definition:
(Planned exploratory spend) / (Allowed risk budget)and realised counterpart; flag overrun. - scale: ratio + policy gate (pass/fail).
- EvidencePin: WorkPlan ledger vs
WorkLedger.
Manager’s quick checks (plain‑language adapters)
- Novelty without a frozen corpus is storytelling—freeze corpus, fix encoder, then score.
- Use‑Value without a consumer‑facing acceptance is a proxy—bind to a Service or explicit Objective.
- Diversity counts approach classes, not color‑swap variants—publish your typology.
Novelty & transfer are context‑local (Bridges mandatory)
Rule N‑1 (Locality). Novelty@context is defined only within its U.BoundedContext. Never compare scores across Contexts without an Alignment Bridge (F.9).
Rule N‑2 (Directional mapping). A Bridge may assert a directional substitution (e.g., Novelty@DesignLab → Novelty@Manufacturing with CL = 2, loss: aesthetics encoder absent). Reverse mapping is not implied.
Rule N‑3 (Penalty to R, not to G). Cross‑context novelty does not change scope G; it reduces R (reliability) by the CL penalty (B.3), unless validated by pilot Work in the target Context.
Practical pattern. Publish novelty with its Context tag and—when reused—attach the Bridge id and target‑context pilot outcomes.
Anti‑Goodhart guard (use creativity metrics safely)
Goodhart’s Law: “When a measure becomes a target, it ceases to be a good measure.” — We bake in guards so creativity scoring improves outcomes instead of gaming them.
Guard‑rails (normative)
- G‑1 Paired appraisal. Never assess Novelty in isolation; pair it with Use‑Value or ConstraintFit to avoid proxy myopia
- G‑2 Frozen references. Novelty requires frozen corpus + encoder; changes create a new edition and RSCR rerun. Portfolio-publication heuristics and selection heuristics are policy-level (see C.19); do not “reward” Illumination beyond its role as a report-metric.
- G‑3 Time‑lag sanity. Include a post‑fact check (e.g., 30–90‑day retention or cost‑to‑serve delta) before celebrating “creative wins.”
- G‑4 Exploration budget. Tie DiversityOfSearch to Risk‑BudgetedExperimentation; flag overspend.
- G‑5 No ordinal averaging. Do not average ordinal scales; use distributions/medians or convert only under declared models.
Conformance Checklist — CC‑C17‑M (metrics & guards)
Worked mini‑cases (engineer‑manager focus)
All names are context‑local; bridges and editions are explicit. We show (a) what is measured, (b) who acts, (c) what is accepted, and (d) how evidence flows.
Case A — Hardware ideation sprint (manufacturing design)
- Context.
DesignLab_2026. - Objective. Reduce fastener count by ≥ 30 % without tooling changes.
- MethodDescription. “Morphological matrix ideation v2.”
- Work. 1‑day sprint, 6 sessions.
- Metrics.
Novelty@context(encoder: CAD‑graph v1; ReferenceSet: in‑house assemblies),ConstraintFit(no‑tooling‑change),Use‑Value(acceptance: Pass if sim shows ≤ +5 % assembly time). - Roles. Performers = design cell (#TransformerRole); Observer = methods coach (#ObserverRole ⊥).
- Outcome. 22 candidates; 4 Pass usefulness; best
Novelty=0.41 with 100 % constraints respected;Time‑to‑First‑Viable= 3 h 40 m. - Evidence. Scorecard episteme holds metrics; links to Work ids; acceptance tied to internal promise content “Design‑for‑Assembly Simulation”.
Manager’s read. “We didn’t just produce ‘novel’ shapes; 4 passed the sim and respected constraints, within the day.”
Case B — Data‑science hypothesis generation (health analytics)
- Context.
Cardio_2026. - Objective. Find a new risk factor candidate for readmission (< 30 days).
- MethodDescription. “Causal discovery v3 + clinician review.”
- Metrics.
DiversityOfSearch(approach classes: feature ablation, IVs, DAG‑learners),Novelty@context(text encoder over prior hypotheses),Use‑Value(AUROC uplift ≥ 0.03 on hold‑out),Transferability@Hospital_B(Bridge CL=2). - Roles. SRE pipeline (#ObserverRole) computes metrics; clinicians (#ReviewerRole) set acceptance; data squad (#TransformerRole) performs experiments.
- Outcome. Two candidates; one meets AUROC uplift; Transferability requires follow‑up (CL penalty).
- Evidence. Episteme bundle: model cards, hold‑out plots, Bridge note.
Manager’s read. “One candidate works here; plan a pilot at Hospital B (we recorded CL=2).”
Case C — Product squad reframing (software UX)
- Context.
SaaS_Onboarding_2026. - Objective. Reduce time‑to‑value (TTV) by 20 %.
- MethodDescription. “JTBD interviews + onboarding flow experiments.”
- Metrics.
ReframeDelta(BoundaryShift: split onboarding into ‘job setup’ and ‘first result’),Use‑Value(TTV ‑22 % on A/B),Risk‑BudgetedExperimentation(within cap),Compositionality(reuse of existing workflow widgets). - Roles. UX researcher (#ObserverRole), squad (#TransformerRole), product ops (#ReviewerRole).
- Outcome. Frame changed; TTV target passed; experiments within budget.
- Evidence. Reframing episteme with Scope diff + A/B report.
Manager’s read. “We changed the problem frame and proved the value drop—within risk limits.”
C.17:15.4 What these cases illustrate (tie‑backs)
- Locality. All novelty/usefulness claims are Context‑tagged; Cross‑context steps use Bridges with CL.
- Dual‑gate. Novelty never acts alone; usefulness/constraints co‑gate decisions.
- SoD & Evidence. Observers are separate from performers; metrics live on epistemes with frozen hooks; Work proves fulfillment.
Working examples
Software (algorithmic/architectural ideation)
Kernel characteristics (↑/↓/gate). Novelty↑ (algorithmic / compositional), Use‑Value↑ (targeted user/job metric), ConstraintFit=gate (resource/latency envelope), Cost‑to‑Probe↓ (hours to runnable spike), Evidence‑Level↑ (tests/benchmarks confidence), Option‑Value↑ (paths unlocked), RegretRisk↓ (scope of adverse impact if wrong).
Priors.
- Novelty prior skeptical beyond nearest known family (discount by conceptual distance).
- Evidence prior at L0 (B.3) until benchmarks exist; regression tests act as ObserverRole evidence.
Context card (one screen).
- Γ_bundle: Cost = sum; ConstraintFit = AND; Novelty = subadditive; Evidence = min (chain) / SpanUnion (indep).
Hardware (mechanical/electro‑mechanical concepting)**
Kernel characteristics. Novelty↑ (principle/material), Use‑Value↑ (performance delta), ConstraintFit=gate (manufacturability window), Time‑to‑Probe↓ (bench jig), Cost‑to‑Probe↓, SafetyRisk↓ (hazard), Evidence‑Level↑ (bench data), Option‑Value↑ (platform reuse).
Priors.
- SafetyRisk has WLNK priority (R must cover hazard chain).
- ConstraintFit must pass manufacturing gate before frontier inclusion.
Context card.
- Γ_bundle: Hazard = max; ConstraintFit = AND; Cost = sum+coupling; Evidence = min on chain; Scope via WorkScope (A.2.6).
Policy design (rules/standards/programs)
Kernel characteristics. Novelty↑ (institutional), Use‑Value↑ (measurable social/operational effect), ConstraintFit=gate (legal/operational), Cost‑to‑Probe↓ (pilot), Evidence‑Level↑ (triangulated), EthicalRisk↓ (D‑cluster), Option‑Value↑ (coalitions/pathways), Scope (ClaimScope G) explicit.
Priors.
- EthicalRisk uses status‑only eligibility conditions; Evidence aging (decay) is fast; cross‑context Bridges carry CL penalties.
Context card.
- Γ_bundle: EthicalRisk = max; ConstraintFit = AND (legal & operational); Cost = sum; Evidence = min/SpanUnion; Scope = ClaimScope (A.2.6).
Consequences & fit (for engineer‑managers)
- You can reason on paper about creativity: compare with dominance, pick along a frontier, and steer exploration with a few policy characteristics.
- Changes to the space (scales, eligibility conditions, operators) are handled by RSCR, so decisions are explainable over time.
- The Context handbooks are a thinking OS: one screen to start ideating without importing tool stacks or management playbooks.
Cross-scale characteristics need one visible distortion account
- Cross-scale talk should state what characteristics are being preserved, aggregated, projected, or lost when the line moves between scales such as organism, species, population, or ecosystem.
BridgeDistortionNoteis the explicit warning that one bridge, aggregation, or projection changes what can be compared directly.- A distortion note does not cancel the declared
Front,Archive, orShortlist; it says how far one cross-scale reading can be trusted without further qualification. - When one retained set, frontier view, or transition path is projected into one atlas-like reading, keep the distortion note near that projection instead of leaving the loss to implication.
- If that projection also depends on one declared
OutcomeMapReforTransitionRelationRef, cite that support next to the distortion note so the reader can see both why the projection is useful and where it stops being faithful. - Different atlas-like projections over the same retained set or frontier may preserve different characteristics; keep those differences visible instead of treating one cross-scale view as information-preserving by default.
- This lets the line say both
the bridge is usefulandthe bridge is not information-preserving in every respect.
Use-Value is not the whole Q-set by default
Use-Valuemay be one member of a declaredQ-set, but it is not the wholeQ-setby default.- When creativity or novelty characteristics stay outside the declared
Q-set, keep that placement visible as tie-breaker, telemetry, archive-retention reason, or explicitly promoted criterion under policy. - Do not let
Use-Valuelanguage silently promoteNovelty@context,DeltaDiversity_P,Surprise, orIlluminationSummaryinto current dominance.
Relations
- Builds on: B.1 Γ‑algebra (WLNK/COMM/IDEM/MONO), B.3 Trust & Assurance (F–G–R, CL), A.2.6 USM (Claim/Work scopes), A.10 Evidence Graph Referring.
- Coordinates with: A.2 Role suite (Observer/Evidence roles for probes), A.15 (Work & plans for probes), C.16 MM‑CHR (scale polarity & units). C.18 NQD-CAL (generation/illumination operators Γ_nqd.*) and C.19 E/E-LOG (policies, selection, and declared retained-set rules). This CHR remains measurement-only.
- Defers to: F.9 Bridges for Cross‑context transfers; D‑cluster for ethical/speech‑act gates.
Quick reference cards (tear‑out)
- Dominance test: apply indicators + eligibility conditions + trust; then partial order.
- Frontier use: show frontier + name the lens that picked your choice.
- Retained-set policy: keep
ExploreShareandWildBetQuota; setBackstopConfidence; rebalance on cadence.
Conformance Checklist (pattern‑level, normative)
Pass these and your CS modelling remains a thinking architecture, not a team‑management manual.
CC‑C17‑1 (context‑local CS).
Every CreativitySpace (the characteristic set where ideation and selection are measured) MUST be defined inside one U.BoundedContext; all characteristics and their scales are local to that Context. (Bridges with CL penalties are required across Contexts; see §C.17.16.)
CC‑C17‑2 (Characteristics, not “characteristics”).
Each CS dimension SHALL be a named Characteristic per MM‑CHR, with kind (qualitative, ordinal, interval, ratio, or set‑valued), unit and scale, polarity, and admissible operations. No free‑floating coordinates. (A.CHR‑NORM / A.CSLC‑Kernel.)
CC‑C17‑3 (Profile ≠ plan). A Profile is a state description over characteristics (what the option is in CS); a Plan or Method is how you will act. Never encode choices or schedules into the profile.
CC‑C17‑4 (Portfolio / retained-set view = set + rule).
A Portfolio or retained-set view is a declared set of candidate profiles plus a selection or retention rule (objective + constraints) declared in the same Context. It is not a synonym for Palette, Front, Archive, Shortlist, or RankedShortlist; use the specific set-result family head when that head is recoverable. Presenting only a scatterplot is non‑conformant.
CC‑C17‑5 (Dominance operator well‑typed). A dominance claim MUST name the characteristic subset and polarity under which it is evaluated. Dominance on incomparable scales (or mixed polarities without explicit transformation) is invalid.
CC‑C17‑6 (Frontier from rule, not from taste). A Frontier (Pareto or constraint‑bound) SHALL be computed from the declared selection rule; drawing a “nice hull” by eye fails conformance.
CC‑C17‑7 (Search–Exploit as dynamics, not policy dogma). Exploration/exploitation MUST be expressed as a dynamics on the declared retained-set measure(s) (e.g., exploration share as a function of marginal value of information), not as a prescriptive budget recipe. Objective, constraint, and decision-policy statements belong to Decsn‑CAL / C.19; C.17 may cite them, but does not own or restate them.
CC‑C17‑8 (Evidence Graph Referring for scores). Any numeric score in a profile MUST cite its MeasurementTemplate (MM‑CHR) and the observation/evaluation that yielded it. No anonymous numbers.
CC‑C17‑9 (Separable uncertainty lanes). Keep aleatory vs epistemic uncertainty separate on characteristics; their combination rule MUST be stated (e.g., interval arithmetic, conservative bound).
CC‑C17‑10 (Time is explicit).
Comparisons across iterations MUST state TimeWindow (snapshot window) and whether drift or refit occurred (§C.17.14). “Latest” is not a time selector.
CC‑C17‑11 (No proxy collapse). If a composite “creativity index” is used, its aggregation algebra (weights, monotone transforms) MUST be declared; the primitive characteristics remain queryable.
CC‑C17‑12 (Work stays on Work).
Resource/time actuals and run logs live on U.Work; CS never carries actuals. We reason about profiles / retained sets; we do not audit operations here.
Worked‑Context Handbooks (concept cards, not runbooks)
Each Context publishes one page per card. These are thinking kernels: priors, objectives, admissible characteristics, and example transforms. No staffing, no process charts.
(a) Kernel Card — “What is a creative win here?”
- Context:
<Context/Edition> - Purpose Characteristic(s): what “win” means (e.g., Novelty, Usefulness, Adoptability), with polarity and admissible ops.
- Constraint Characteristics: Risk, Cost of change, Time to learn, etc.
- Objective (Decsn‑CAL pointer): Maximise
<purpose>subject to declared constraints. - Frontier Rule: Pareto over
{purpose ↑, risk ↓, cost ↓, time ↓}. - Evidence Hooks: which observations/evaluations populate each characteristic.
(b) Priors Card — “What we believe before seeing data.”
- Default priors on uncertainty for each characteristic (e.g., Beta for adoption probability).
- Bridge policy: minimal CL acceptable for imported profiles.
- Exploration prior: initial exploration share as a function of prior entropy.
(c) Objective Variants Card — “Admissible objective shapes.”
- Catalog the few objective forms this Context allows (lexicographic tie‑break, ε‑constraint, max‑min fairness), with didactic pictures of their frontiers.
- State when to switch objective (e.g., during bootstrapping vs exploitation).
(d) Ready‑to‑use transforms (MM‑CHR aligned)
- Monotone maps (e.g., log utility), normalizations, ordinal→interval “do & don’t” (only with evidence of order‑to‑interval validity).
- Forbidden transforms list (e.g., averaging ordinal ranks).
These cards are conceptual fixtures; Tooling may implement them, Pedagogy may teach them, but C.17 only standardises their content as thinking supports.
Placement sanity‑check across the pattern language (avoid scope creep)
- MM‑CHR (C.16): defines Characteristic/Scale/Unit/Measure and the characterisation discipline. All CS dimensions live there; C.17 uses them, never re‑defines scales.
- A.CHR‑SPACE (A.19): exports CharacteristicSpace & Dynamics hooks; C.17 is a Contexted specialisation for creative reasoning (profiles / retained sets / selection).
- Decsn‑CAL (C.11): defines objective functions, constraints, preference orders, utility proofs, and the search–exploit dynamics as decision policies. C.17 only names the hooks (objective, rule), keeps policy math out.
- KD‑CAL (C.2) & B.3 (Trust): carry evidence provenance, assurance and congruence penalties (CL) for Cross‑context reuse. C.17 requires anchors; it does not invent confidence calculus.
- Compose‑CAL (C.13): governs set/union/slice aggregation; a declared retained set is a Γ_m.set over profiles; frontier is derived without ad‑hoc geometry.
- B.4 Canonical Evolution Loop: where Run→Observe→Refine→Deploy sits. C.17 supplies the view in which refinement is judged.
Out of scope here: team staffing, budgeting workflows, data‑governance procedures, ticket states, any “how to manage people”. This pattern organises thought, not teams.
Anti‑patterns & canonical rewrites (conceptual hygiene)
- characteristic‑speak. “Along the novelty characteristic…” → Rewrite: “Along the Novelty characteristic (ordinal; higher is better)…”.
- Pretty hulls. Drawing a convex hull and calling it a frontier → Rewrite: compute Pareto under declared characteristic polarities.
- Ordinal arithmetic. Averaging ranks or Likert values → Rewrite: either treat as ordinal and use order‑safe operators, or justify an interval mapping via MM‑CHR evidence.
- Proxy tyranny. Single composite index driving choice unseen → Rewrite: publish primitive characteristics, index formula, and sensitivity.
- Policy‑as‑math. “10% wild bets” as a rule → Rewrite: declare an exploration dynamics tied to value‑of‑information; if keeping a heuristic, label it as such.
- Global meaning. Porting a profile from another Context by name → Rewrite: attach a Bridge with CL and loss notes; adjust trust, not scales.
- Plan‑profile blur. Putting milestones into profiles → Rewrite: move schedules to
U.WorkPlan; keep CS for how options compare, not how to execute.
Minimal didactic cards (one screen each)
(1) Profile Card
- Option id & Context
- Characteristics table (value, unit and scale, uncertainty split)
- Evidence Graph Ref (Observation/Evaluation ids)
- Notes (bridges used, CL penalties)
(2) Declared Set-with-Rule Card
- Set of candidate profiles (refs)
- Objective & constraints (Decsn‑CAL pointer)
- Dominance subset & Frontier snapshot (with TimeWindow)
- Delta vs previous (entered/exited/moved)
(3) Search–Exploit Card (conceptual)
- Exploration share as function of marginal VOI (symbolic)
- Update cadence (TimeWindow policy)
- Stop conditions (e.g., VOI below threshold; risk bound reached)
(4) RSCR Summary Card
- What changed? (refit/Δ±)
- Sentinels status
- Frontier churn
- Bridge CL drift
These cards are thinking scaffolds; they do not prescribe org process.
Consequences (informative)
Trade‑offs: upfront ceremony (declare characteristics, polarity, TimeWindow) and disciplined bridges. The payoff is comparability and explainability.
C.17:26- Open questions (non‑normative, research hooks)**
- Information geometry of CS: can certain Contexts justify canonical distance metrics across characteristics without violating MM‑CHR parsimony?
- Multi‑agent exploration: how to couple individual CS frontiers into a co‑exploration equilibrium without importing team governance?
- Learning‑to‑rank vs measurement: what minimal evidence suffices to treat an ordinal characteristic as interval for the purpose of frontier estimation?
C.17:End
Open‑Ended Search Calculus (NQD‑CAL)
Status. Calculus specification (CAL). Exports Γ_nqd.* operators for open‑ended, illumination‑style generation. ΔKernel = 0 (no kernel primitives added). Minting note: this CAL does not mint new U‑types; it defines CAL‑records that MAY alias to registered U‑types where present via E.10/UTS.
Depends on. A‑kernel (A.1–A.15), MM‑CHR (C.16) for measurements, KD‑CAL for similarity/corpora, Sys‑CAL for carriers, Decsn‑CAL (objectives; advisory), Compose‑CAL (set aggregation; advisory).
Coordinates with. B.5.2.1 (binding), C.17 Creativity‑CHR (characteristics & scales), C.19 E/E‑LOG (policies: emitter selection, explore/exploit).
Exports (CAL; no U‑type minting here).
- Records:
NQD.DescriptorMap(alias ofU.DescriptorMapif minted),NQD.NQDArchive(alias ofU.NQDArchive),NQD.Niche,NQD.ArchiveCell,NQD.EmissionSeed?,U.EmitterPolicyRef,U.InsertionPolicyRef,U.IlluminationSummary, andNQD.CandidateSet(alias ofSet<U.Hypothesis>).
Problem frame
Open‑ended search (NQD) equips FPF with illumination‑style generation and Pareto / selected-set selection in multi‑criteria, partially ordered spaces; it feeds G.5 without scalarising ordinal or mixed‑scale characteristics.
Problem
Without a disciplined NQD calculus, contexts (a) conflate illumination telemetry with dominance, (b) lose reproducibility due to undeclared DescriptorMap/DistanceDefRef.editions, and (c) perform illegal aggregations across scales.
Forces
• Posets vs. scalarisation — selectors must return sets (Pareto/archive) rather than illegal weighted sums across mixed scales. • Exploration vs. exploitation — emitters must adapt while preserving provenance and editioning. • Telemetry metric vs. objective — Illumination (coverage/QD‑score) informs health but is not a dominance characteristic by default. • Reproducibility vs. adaptivity — budgets, ε, K, and InsertionPolicy must be edition‑tracked.
Solution
Provide Γ_nqd.* operators and U.Types for DescriptorMap, Archive/Niche, policies, and illumination telemetry summaries; bind measurement legality to MM‑CHR and policy control to E/E‑LOG. (Exports/Type notes/Operator specs below are normative parts of this Solution.)
- Operators (Γ):
Γ_nqd.generate(seed?, EmitterPolicyRef, Budget, DescriptorMapRef, QualityMeasuresRef, NoveltyMetricRef, CoverageGrid, CellCapacity K=1, EpsilonDominance ε=0, DedupThreshold?, InsertionPolicyRef?) → CandidateSet<U.Hypothesis>Γ_nqd.updateArchive(Archive, CandidateSet, InsertionPolicyRef?) → Archive'Γ_nqd.illuminate(Archive) → IlluminationSummary{coverage, QD-score, occupancyEntropy, filledCells}(report‑only telemetry summary; not a dominance characteristic unless a policy explicitly promotes it).Γ_nqd.selectFront(Archive|CandidateSet, characteristics={Q components, Novelty@context, ΔDiversity_P, …}) → ParetoFront
Type notes.
U.DescriptorMap (Tech; twin‑labelled Plain) : Hypothesis → ℝ^d(declares encoder, invariances, version, CharacteristicSpaceRef). Publish Tech/Plain per E.10; declareDescriptorMapRef.editionandDistanceDefRef.edition. Dimensionality rule. Required≥2only when QD/illumination surfaces are active; for non‑QD contextsd≥1is lawful.NQD.CandidateSet≡Set<U.Hypothesis>with attached per‑item vectors{Q_i, N_i, D_i:=ΔDiversity_P, S_i?, provenance_i}.U.NQDArchiveholds per‑cell elites and genealogy refs; context‑local.U.Nicheis a region in CharacteristicSpace (grid bucket / CVT centroid / cluster).U.EmitterPolicyRefpoints to a named policy in C.19 E/E‑LOG.U.InsertionPolicyRef— named archive‑update policy (e.g.,replace_if_better | replace_worst | bounded_age | bounded_regret); versioned.U.IlluminationSummaryis a telemetry summary overDiversity_P(see C.17), not a dominance characteristic.
Operator specs (normative).
Γ_nqd.generate(… )SHALL: (a) respect Budget, (b) compute{Q_i}(vector),N_i(Novelty@context),D_i := ΔDiversity_P(h_i | Pool)under the same CharacteristicSpace & TimeWindow as the Pool, and optionalS_i(Surprise), (c) deduplicate byDedupThresholdin CharacteristicSpace, (d) recordDescriptorMapRef.edition,DistanceDefRef.edition,EmitterPolicyRef,ε,K,Seeds, and genealogy references (parent/seed ids) to enable replay and selection auditing.Γ_nqd.updateArchiveSHALL apply local competition per cell (keep up to K elites), preserve genealogy, and enact the declaredInsertionPolicyRef; default isreplace_if_betterwith deterministic tie‑breakers.Γ_nqd.illuminateSHALL return coverage and QD‑score computed against the declared grid and archive edition.Γ_nqd.selectFrontSHALL compute the (ε‑)Pareto front over the declared characteristics; Illumination is excluded by default (report‑only).
Pipeline: apply Eligibility (ConstraintFit=pass) → Dominance over the declared DominanceSet → Tie‑breakers (Novelty@context, ΔDiversity_P, Surprise; Illumination telemetry metric). When the context relies on the ordinary default, consume DefaultId.DominanceRegime from G.Core/G.5 together with the active C.19 emitter/archive policy instead of restating one local dominance doctrine here.
Ordinary default Q-front mode: When no narrower promotion policy is declared, dominance stays on the context-declared Q components while N/ΔD work through archive occupancy and tie-breakers. Any deviation SHALL be declared by policy id and recorded in provenance.
Reproducibility & editions. Each call SHALL emit provenance sufficient for replay: {DHCMethodRef.edition, DescriptorMapRef.edition, EmitterPolicyRef (params), **InsertionPolicyRef**, DedupThreshold?, ε, K, Seeds, TimeWindow}.
Telemetry hook: whenever IlluminationSummary increases (Δcoverage>0 or ΔQD‑score>0), the Context SHALL emit a Telemetry(PathSlice) record that cites {EmitterPolicyRef, DescriptorMapRef.edition, DistanceDefRef.edition, InsertionPolicyRef?, TimeWindow}. (Aligns with G.6/G.7/G.11 PortfolioMode/edition constraints.)
Measurement alignment. Novelty@context, Use‑Value (ValueGain), Surprise, Diversity_P SHALL be measured per C.17 (MM‑CHR templates). IlluminationSummary is a telemetry summary over Diversity_P (coverage/QD‑score); when CharacteristicSpace includes domain‑family cells, publish grid id and FamilyCoverage, plus DescriptorMapRef.edition/DistanceDefRef.edition.
.
Front and archive are different returns
- Start from one declared
EligibilitySet. - Return the non-dominated
Frontover the declaredDominanceSet. - When archive mode is active, return the corresponding
ExplorationArchiveseparately. - Archive membership may use novelty, diversity, stepping-stone potential, or coverage policy and is not by itself evidence of membership in the current
Q-Front. - Keep
TieBreakerSetandTelemetrySetexplicit so diversity or illumination signals do not silently rewrite the front semantics. - Use
RetentionIntent=steppingStonewhen the point of retention is frontier expansion rather than current dominance. - Here
EligibilitySet,DominanceSet,TieBreakerSet, andTelemetrySetare comparison-bundle sets, whileRetentionIntent=steppingStoneis one archive-retention field value; none of them renames the returnedFrontorExplorationArchive. - If one line keeps both returns, say that the front answers current non-domination while the archive answers retained exploration value.
- When retained exploration value depends on future reachability or curriculum expansion across transitions, cite the declared reachability or transfer rule together with
LearningProgressSignal,CompetenceModelRef, orGoalSpaceExpansionCue. That bridge stays archive/pool-policy-side unless one explicit policy promotes it; it does not require the heavier atlas layer and it does not rewrite front semantics.
Conformance Checklist
- C18‑1 Declare
DescriptorMap(encoder, invariances, corpus edition) before generation. - C18‑1b When used in F/G triads, DescriptorMap SHALL declare a domain‑family coordinate (grid/cells) and reference an F1‑Card::DistanceDefRef & δ_family.
- C18‑1c When a domain‑family coordinate is declared, the Context SHALL compute and publish AliasRisk for each front / declared set-result emission, together with the dSig collision rule and the policy id. AliasRisk is computed against
U.DomainDiversitySignature (dSig); the DescriptorMap SHALL publish: (i)collisionRuleId(near‑duplicate threshold, e.g. “≥3 characteristics equal”), (ii)dSigSourcepointers used for coding the five characteristics. The collision rule and formula MUST be part ofDescriptorMapprovenance (see Creativity‑CHR, Heterogeneity Characterisation). - C18‑2 Record
EmitterPolicyRef(policy id from C.19) and parameter set. - C18‑3 Compute
D = ΔDiversity_P(h | Pool)under the same DescriptorMap & TimeWindow as the Pool (see C.17). - C18‑4 Exclude Illumination from dominance unless policy explicitly promotes it.
- C18‑5 Keep
Use‑Valueseparate from assurance scores; do not alterF/G/Rsemantics (see B.3, C.17 §Use‑Value). - C18‑6 Emit full provenance; thinning after front computation MUST be recorded.
- C18‑7 Before computing any front, apply ConstraintFit = pass as a hard eligibility filter.
Defaults. Default-governance responsibility is split on purpose: G.Core and G.5 govern DefaultId.DominanceRegime and selector-facing default routing, while C.19 governs emitter, insertion, and pool-policy defaults. C.18 consumes those defaults and records the active refs instead of restating them locally. Minimum provenance remains: DescriptorMapRef.edition and DistanceDefRef.edition, DHCMethodRef.edition, EmitterPolicyRef, InsertionPolicyRef, TimeWindow, Seeds, DedupThreshold?; also record FamilyCoverage/MinInterFamilyDistance.
Didactic quickstart (Context).
- Pick 2–4 Quality coordinates and a simple DescriptorMap (2–4 dims).
- Set defaults:
K=1,ε=0, a conservativeEmitterPolicy. - Run
Γ_nqd.generateto fixed Budget; inspect the front; log coverage (IlluminationSummary). - Apply abductive plausibility filters; promote prime hypothesis to L0.
Archetypal Grounding
System. Legged‑robot gait exploration: Q = {forward speed, energy efficiency}; DescriptorMap/CharacteristicSpace = morphology/coordination descriptors (ℝ^d); D = ΔDiversity_P(h | Pool) computed over that declared descriptor space; Archive = CVT grid; illumination reports coverage without entering dominance.
Episteme. SoTA palette synthesis: Q is one declared objective tuple for the current synthesis task, for example external-validity gain, reuse value, or Use-Value only when the Context explicitly declares it inside Q; DescriptorMap/CharacteristicSpace carries method-family or claim-graph descriptors; D = ΔDiversity_P(h | Pool) is computed over that declared descriptor space or niche grid. Publish DescriptorMapRef.edition and DistanceDefRef.edition so the front remains reproducible.
Bias‑Annotation
Lexical firewall and notation independence apply; no vendor/tool tokens; ordinal characteristics never averaged; illumination treated as report‑only telemetry unless a policy promotes it. (E.5.1, E.5.2, C.16)
Consequences
• Selected-set honesty (no forced scalarisation). • Reproducibility (editioned maps/policies). • Healthy diversity signals via telemetry metrics.
Rationale
Post‑2015 Quality‑Diversity (MAP‑Elites & successors) demonstrates illumination efficacy; NQD‑CAL captures these ideas while preserving MM‑CHR legality and LOG governance.
Relations
Builds on: C.16, C.2. Coordinates with: B.5.2.1 (binding), C.17, C.19, G.5, G.6, G.11.
C.18:End
Scaling‑Law Lens Binding (SLL)
Status: Stable
One‑screen purpose (manager‑first). Make generation/selection scale‑savvy: at the level of conceptual descriptors, declare (a) which monotone knobs we would scale, (b) the ScaleWindow over which we claim behaviour, and (c) the elasticity class we observed—without imposing numeric fits or vendor tools at Core level. This surfaces knees early and keeps comparisons lawful and fair across families. (Parity is handled by G.9; illumination remains a report-only telemetry unless a CAL policy promotes it.)
Builds on. C.16 (MM‑CHR), C.17 (Creativity‑CHR), C.18 (NQD‑CAL); advisory: C.5 (Resrc‑CAL). Coordinates with. C.19 (E/E‑LOG), G.5 (Selector & Registry), G.9 (Parity Harness), G.10 (Shipping), G.11 (Refresh‑Telemetry), C.24 (Agent‑Tools‑CAL). Keywords. scaling law; Scale Variables (S); ScaleWindow; knee; diminishing returns; iso‑scale parity; UNM/NormalizationMethod‑based mapping; scale‑probe; DoE (design‑of‑experiments); segmented regression; knee detection.
Problem frame
Teams often say a method “scales” without disclosing which resources, across what window, and how outcomes respond (convex rise → knee → plateau). Without that, parity is skewed (unequal budgets, unmatched windows), coverage/illumination report-metrics leak into dominance, and “knees” are found late. SLL supplies a notation‑independent lens to make scale behaviour explicit and comparable.
Problem
Omitting Scale Variables and the comparison window causes: (i) unfair parity (compute/data/FoA mismatched), (ii) illumination/coverage report-metric creep into dominance by default, (iii) late detection of knees and budget waste. G.9 already forbids scalarising mixed scales and mandates equal FreshnessWindows/pinned editions; SLL complements this with ScaleWindow & elasticity.
Forces
Notation independence vs useful scaling heuristics; local context vs cross‑context generality; telemetry vs objectives (illumination stays report‑only telemetry unless policy promotes it); early exploration vs reproducible policy.
Solution — binding lens for generator/selector profiles (normative)
Types (aliases; ΔKernel = 0).
SLL.Profile is an annotation on a MethodFamily/Generator or a Selector profile; no new U.Types are minted (LEX discipline).
Fields (conceptual descriptors).
- S — Scale Variables. Minimal set of monotone knobs for the Context:
compute(steps/tokens/FLOPs/time/energy),data(size/quality),model capacity(params/branches),iteration budget,freedom‑of‑action (FoA)/environment richness, etc. Declare units via Resrc‑CAL and bind to a ScaleWindow. Where training/inference trade, name the phase the claim concerns. - ScaleWindow. Declared range of
Svalues for which behaviour claims hold (editioned). This is distinct from FreshnessWindow used by parity. - Scale‑Probe. At least two (preferably ≥ 3) parity‑respecting points in
Swithin the ScaleWindow, recorded with replicates/seeds and CI/error bars to support elasticity classification. Pick points via a small factorial or Latin‑hypercube when multiple knobs vary. - ElasticityClass
χ ∈ {rising, knee, flat, declining}— a qualitative class; numeric exponents/fits live in domain annexes, not Core. - ParityNotes.
iso‑scale parity?flag (and loss notes if not achieved), plus Bridge/Φ/Ψ IDs when crossing contexts (penalties route to R only).
Norms (SLL).
- SLL‑1 (Declaration). Any profile claiming scale behaviour SHALL declare
Sand a ScaleWindow for the Context. - SLL‑2 (Probe). Early investigation SHALL include a scale‑probe (≥ 2 points in
S, with replicates/CI) and record χ. Multi‑knob probes SHALL hold unspecified knobs fixed or pinned, and disclose invariants. - SLL‑3 (Parity). Where
Sis declared, comparisons SHALL ensure iso‑scale parity and lawful UNM/NormalizationMethod‑based mapping across heterogeneous knobs (e.g., FLOPs↔tokens) before comparing outcomes; FreshnessWindows/editions must be equal/pinned per G.9. Record seeds/replicates, ComparatorSet, and policy‑ids in telemetry/SCR. - SLL‑4 (Selection lens). Within the same Context and ScaleWindow, if other heads (N/U/C) are tied, selectors MAY use illumination as a tie‑breaker, but it SHALL NOT change default dominance; illumination remains report‑only telemetry unless a CAL policy promotes it.
- SLL‑5 (Knee test). A knee is claimed only where a monotone rise is followed by a statistically significant slope drop across adjacent probe points within the ScaleWindow; thresholds (e.g., Δslope & CI level) are policy‑defined (E/E‑LOG) and must be cited. Absent such evidence, classify as rising.
- SLL‑6 (Telemetry invariants). Probes SHALL export seeds/replicates, edition pins, policy‑ids, and Resrc‑CAL units to G.11.
Method — minimal SoTA probe recipe (notation‑agnostic; informative).
- Choose knobs
Sthat are plausibly monotone in the Context (compute/data/capacity/FoA). - Pick 3–5 probe points per active knob (edge/mid/edge) under iso‑scale parity; use a fractional factorial if >2 knobs.
- Run replicates (≥ 3 preferred) and bootstrap 95% CI on the primary objective(s); log seeds.
- Estimate local slopes on a log‑log grid; apply piecewise/segmented regression or a knee detector (e.g., L‑curve/Kneedle) to support
χ. - Record invariants (pinned knobs, safety envelope) and publish SLL.Card@Context.
- If χ changes across the window, split the ScaleWindow and re‑classify per segment.
Interfaces — minimal I/O (conceptual)
G.9 Plan/Run Parity consumes S/ScaleWindow to align budgets, pin editions, and perform UNM/NormalizationMethod‑based mapping; G.11 carries policy‑id, PathSliceId, seeds/replicates, CI level, and edition pins per parity CC.
Conformance Checklist (CC‑SLL)
Sdeclared orS = N/Awith rationale.- Scale‑probe performed; χ recorded with replicates/CI; invariants disclosed.
- iso‑scale parity or loss notes + penalties → R only; editions/seeds pinned; ComparatorSet cited.
- If used as tie‑breaker, the selector cites χ and lens id in E/E‑LOG provenance.
- Knee claims cite the policy threshold and CI level used.
Anti‑patterns & remedies
Hidden budget mismatches; averaging ordinals across families; illumination in dominance by default; unpinned editions; slope claims without replicates/CI; training/inference phase mixing → cure with G.9 parity (equal windows/editions; normalize‑then‑compare; return sets), phase‑label the claim, and record slope uncertainty per Scale‑Audit discipline.
Archetypal grounding (post‑2015; informative)
- LLM scaling. Kaplan‑style & Chinchilla‑optimal regimes; Mixture‑of‑Experts and retrieval‑augmented families shift effective capacity with different inference budgets; prompt‑policies often transfer better than narrow pipelines.
- RL/Planning. Model‑based optimization & general agents vs hand‑tuned controllers; slopes reported wrt budget/FoA under safety envelopes.
- QD/OEE. MAP‑Elites, CMA‑ME, DQD, QDax; POET/Enhanced‑POET families: coverage/illumination as telemetry metrics; parity uses fixed grids/spaces and edition pins.
Payload — exports
SLL.Card@Context (UTS row; editioned):
⟨S{knobs, units, phase}, ScaleWindow, Scale‑Probe{points≥2, design=one‑liner, seeds, CI}, ElasticityClass χ, ParityNotes{iso‑scale?|loss, invariants}, BridgeIds?/Φ/Ψ, PolicyIds? (E/E‑LOG), PathSliceId?⟩.
UTS row template (conceptual; pencil‑ready).
SLL.Card@Context := S=(COMPUTE|DATA|CAPACITY|FOA; units=…; phase=TRAIN|INFER), ScaleWindow=[LOW…HIGH], Probe=(points=…, design=factorial|LHD, seeds=…, CI=…), χ=rising|knee|flat|declining, ParityNotes=(iso=true|false; invariants=…), Bridge/Φ/Ψ=(…), PolicyIds=(…), PathSliceId=(…).
Relations
C.27 temporal-claim relation.
- C.27 may flag: a claim that more review capacity, tool calls, tokens, data, model capacity, parallelism, freedom of action, sprints, or another declared scale variable changes rate, learning, recovery, throughput, stabilization, or improvement.
- This pattern keeps: scale variable, scale window, scale probes, and elasticity posture.
- Non-admissible use: more scale is not linear improvement, and a scale word does not create a C.27 rate-change claim by itself.
- Exit: if comparison or benchmark use is live, cite G.9 for parity; if the statement is only a linear effort fantasy, name the scale variable and scale window or downgrade.
Builds on: C.16/17/18. Coordinates with: C.19 (lenses/policies), G.5 (set‑returning selector), G.9 (parity; ParetoOnly default; UNM/NormalizationMethod‑based mapping), G.10 (shipping).
Pedagogical cue. Say what you would scale, probe it twice, and use the slope‑class to steer.
C.29 mathematical-lens use relation
C.18.1supplies scale-window and scaling-law evidence forC.29when a mathematical lens claims scale behavior, universality, knees, exponents, coarse-graining validity, or diminishing returns.C.29cannot treat mathematical compression as scalable without an SLL or BLP-compatible scale-window account where scale is load-bearing. If no scale claim is live,C.29uses a local stop condition rather than opening scale-law work.
C.18.1:End
Explore–Exploit Governor (E/E‑LOG)
Type: Calculus (C) Status: Stable Normativity: Normative
Plain-name. Explore-exploit governor.
Intent. Govern exploration/exploitation policy over still-live candidate pools so frontier treatment, graduation, narrowing, and sunset treatment stay explicit, auditable, and stated as one pool-policy result without taking over local choice, enactment, or publication questions.
Export relation. No Γ operators are exported; policies parameterize calls in C.18 NQD-CAL.
Depends on. C.18 NQD-CAL (generators), C.17 Creativity-CHR (measurements), Decsn-CAL (objectives/constraints and scalarization lenses), B.3 (trust adjustments), and Compose-CAL (set aggregation; advisory).
Coordinates with. C.11 for local choice among already-available options, C.24 for enactment planning after choice, G.5 for selector-facing publication, C.17, and G.9.
Use this when
- several candidate lines, family regions, or frontier segments remain live under one declared exploration/exploitation policy and the question is now policy over that pool rather than one more local choice result
- the next result should say how the pool will be treated next:
widen,keep frontier,narrow to subset,sunset line, orreroute - the governing lens or policy state must be explicit rather than inferred from vague exploration language
What goes wrong if missed
- scalarized top-1 picks are mislabeled as "the frontier", so it becomes unclear whether the result names one lens-ranked winner or the lawful live set
- exploration continues without one named pool, one named governing lens, or one explicit next treatment
- local option choice, pool policy, enactment planning, and published shortlist semantics collapse into one blurred result
What this buys
- one explicit pool-governance result for exploration, graduation, narrowing, and sunset treatment
- one explicit link from lens or policy state to the next pool-side treatment
- one repeatable way to preserve heterogeneity and frontier discipline without forcing illegal totalization
First-minute questions
- Which still-live pool, frontier segment, or family region is actually under governance now?
- Which lens or policy state is governing it?
- Is the next lawful treatment
widen,keep frontier,narrow to subset,sunset line, orreroute? - What event or threshold would justify changing that treatment next?
First output
The first useful output is one explicit pool-policy result that names the live pool, the governing lens or policy state, the current treatment (widen, keep frontier, narrow to subset, sunset line, or reroute), and the exact event that would justify changing that treatment next.
That result records how the pool will be treated next under the current exploration/exploitation policy; it does not replace one local C.11 choice record, one C.24 enactment plan, or one G.5 published selector result.
If that first output still cannot be written honestly, the current pool-policy result is not finished C.19 policy yet.
Problem frame
The E/E governor provides named, versioned policies and lenses that steer NQD generation/selection under lawful dominance and provenance constraints.
When C.11 has already made local choice among one fixed OptionSet explicit, C.19 begins where the question becomes policy over several still-live candidate lines, family regions, or frontier segments rather than one more local ChoiceResult record.
Immediate failure indicators for this pattern:
- the current pool-policy result cannot name the still-live candidate pool it is governing
- the governing lens or policy state is missing
- the next pool-side treatment exists only as one vague promise to continue exploration later
If the question is still which single option should survive now, apply C.11. If the next artifact must already be one enactment-facing plan, apply C.24. If the retained set must be published for downstream consumption, apply G.5.
Problem
Ad‑hoc exploration mixes ordinal and interval folds, silently scalarises posets, and loses lens/policy provenance—undermining legality and reproducibility.
Forces
• Trust gates vs. discovery — graduation requires backstop confidence while maintaining explore_share. • Heterogeneity vs. focus — fairness quotas by family vs. depth on proven lines. • Lens expressiveness vs. audit — scalarised choices must not be called 'the frontier' and MUST record lens ids.
Solution
Causal data and causal-policy exploration hook
When an exploration/exploitation policy collects data to support a causal claim, changes intervention budget, learns a causal policy, evaluates a policy from behavior/logging-policy data, or treats a counterfactual strategy as a candidate line, the pool-policy result keeps C.19 authority and cites C.28 for causal-use support.
Optional PoolPolicyResult.causalUseSpec?:
The causal-use support tail may be omitted only when the pool-policy result does not reach CausalUseActivation: it does not make, publish, rank, retire, deploy, or reuse a causal claim. If exploration or exploitation is justified by effect, counterfactual replay, causal policy support, or causal data collection, the support tail is present or the result is downgraded to a non-causal pool-policy reason.
What changes in practice: a frontier policy that explores "to learn what works", exploits a causal policy, or graduates a line because counterfactual replay looks better must declare the causal-use question, CausalUseClaimKind, causality-ladder rung, causal evidence support basis, and supported use and unsupported use before the pool-policy result can carry a causal claim.
What this does not authorize: [C.19](/generated/patterns/C.19) does not become causal identification, causal fairness, off-policy causal evaluation, or counterfactual-realizability authority; it governs pool treatment and redirects causal-use support to [C.28](/generated/patterns/C.28).
Define EmitterPolicy (regime key, params, ε, K, insertion/dedup) and selection lenses with a fixed pipeline (Eligibility → Dominance → Tie‑breakers); bind provenance (policy id, lens id) and guard promotions of Surprise/Illumination to dominance to explicit policy declarations.
Decision-subject clarification. Later choices are attributed to one declared DecisionSubject at explicit DecisionSubjectGranularity. Contexts publish measurement spaces and admissible policies as semantic frames; LOG profiles lenses and policies but does not enact choices.
Depends on. C.18 NQD‑CAL (generators), C.17 Creativity‑CHR (measurements), Decsn‑CAL (objectives/constraints, scalarization lenses), B.3 (trust adjustments), Compose‑CAL (set aggregation; advisory).
EmitterPolicy (named profile). A context‑local, versioned policy with fields:
{ name, regimeKey ∈ {UCB, Thompson, BO‑EI, GP‑UCB, PES, InformationGain, …}, params, explore_share∈[0,1], temperature τ≥0, rebalance_period, wild_bet_quota≥0, backstop_confidence (assurance level), epsilon_dominance ε, cell_capacity K, **insertion_policy**, **dedup_threshold** }.
Policies are referenced as U.EmitterPolicyRef by NQD generator call (C.18) and are conceptual lenses, not staffing/budget instructions.
Ordinary default tokens remain governed by G.Core/[G.5](/generated/patterns/G.5); [C.19](/generated/patterns/C.19) explains their pool-policy consequences but does not become one rival default authority.
Decision-theory bridge. [C.11](/generated/patterns/C.11) governs theory-side choice among already-available options and the meaning of ProbeBudget, ValueOfInformation, and ValueOfComputation. [C.19](/generated/patterns/C.19) may consume such outputs only as criteria for pool policy, graduation, keep-frontier, or sunset treatment; it does not re-govern local choice doctrine.
Ordinary default routing (if policy is unspecified):
• Dominance: consume DefaultId.DominanceRegime from G.Core/[G.5](/generated/patterns/G.5); in ordinary Q-front use this means {Q components} with ConstraintFit=pass as eligibility gate.
• Tie‑breakers: Novelty@context, ΔDiversity_P, Surprise; Illumination (telemetry over Diversity_P: coverage/QD‑score) MAY be used as a tie‑breaker but is not in the dominance set.
• Archive: K=1, ε=0, deduplication in CharacteristicSpace.
• Policy family: one uncertainty-aware explore policy family with one declared regime key and explicit change triggers; UCB-class with moderate temperature and explore_share ≈ 0.3–0.5 is one didactic starter profile, not the semantic default family.
• Provenance (minimum): record DescriptorMapRef.edition, DistanceDefRef.edition, DHCMethodRef.edition, EmitterPolicyRef, InsertionPolicyRef, dedup_threshold?, TimeWindow, Seeds.
Scalarization lenses (policy‑level). A lens J_ℓ declares: (a) hard eligibility conditions (e.g., ConstraintFit=pass), (b) soft aggregation (weights/curves), (c) trust policy (how assurance/CL discounts enter).
Conformance. A Context MUST name the lens used to pick from a frontier; scalarized rankings MUST NOT be presented as “the frontier”; the lens id MUST be recorded in provenance of each selection.
Promotion rules (policy).
- Tie‑breaks.
SurpriseandIlluminationMAY act as tie‑breakers; promotion into the dominance set MUST be declared by lens or policy id and captured in provenance. - Graduation. Profiles graduate from Explore→Exploit when backstop_confidence (B.3 level) and eligibility conditions are met.
- Sunset/Pivot. Profiles failing VOI/backstop thresholds are sunset or pivoted at
rebalance_period.
Explore/Exploit loop (per rebalance_period).
- Recompute frontier with trust discounts.
- Enforce
explore_share(minimum attention on high‑Novelty, not‑yet‑proven profiles). - Update generator
temperature τ/ emitter mix. - Apply
backstop_confidenceto graduate; sunset stale probes. - Satisfy
wild_bet_quotaby seeding fresh high‑Novelty candidates. - HET‑FIRST — apply group‑fairness quotas by domain‑family and/or DPP/Max‑min repulsion before exploit lenses; log quotas and sampler policy id.
Named lenses (heuristics; policy‑level, not norms)
The following lens profiles are illustrative heuristics. Contexts MAY reuse/modify them; they are not normative.
• Frontier‑sweeper — maintain attention on the full front; promote only when backstop_confidence holds.
• Barbell — enforce explore_share ≥ θ with a wild_bet_quota; otherwise exploit top‑trust region.
• Spike‑first — pick highest Use‑Value subject to ConstraintFit=pass and a small Cost‑to‑Probe cap.
• Safety‑first — minimize SafetyRisk subject to Use‑Value ≥ θ and ConstraintFit=pass.
• Platform‑option — maximize Option‑Value under probe cost bounds.
• Pilot‑then‑scale — optimize Use‑Value on pilot scope with BackstopConfidence ≥ L1; widen G once R holds.
• Heterogeneity‑first (policy id). Eligibility → Dominance → Tie‑breakers; Hard gate: FamilyCoverage ≥ k, MinInterFamilyDistance ≥ δ_family; Fairness quotas: ≤1 candidate per sub‑family at pre‑front sampling; DPP/Max‑min sampler allowed.
Conformance (lens recording). A decision that uses any lens MUST record its lens id alongside EmitterPolicyRef. (This restates and localizes C19-3.)
Explicit pool-policy result
A finished C.19 pass should publish one explicit pool-policy result rather than one atmospheric statement that exploration will continue somehow.
That result should state:
- the still-live pool, frontier, or family scope under governance now;
- the governing lens id or policy state;
- the next treatment, chosen from
widen,keep frontier,narrow to subset,sunset line, orreroute; - the event or threshold that would justify changing that treatment next.
A compact result may therefore state, for example:
poolScope = frontier_FgoverningLens = barbell_policy_v2nextTreatment = keep_frontierchangeTrigger = backstop_confidence reaches L1 for one retained line
or, for one narrower family region:
poolScope = family_region_betagoverningLens = heterogeneity_firstnextTreatment = narrow_to_subsetchangeTrigger = quota satisfaction plus one explicit novelty floor
Those fields define the result: governed pool, governing lens, next treatment, and change trigger.
Closure rule over the live pool
A C.19 pass may close only when one explicit pool and one explicit next treatment are both visible.
- Close as
widenwhen the current frontier is too narrow for the declared exploration policy or when the evidence basis is too thin to justify current narrowing. - Close as
keep frontierwhen several lines must remain live under the current lens and no narrower lawful subset is yet justified. - Close as
narrow to subsetwhen one declared lens now justifies retaining one smaller internal live set without pretending that one scalar winner has already been chosen. - Close as
sunset linewhen one line or family region no longer clears the current lens, quota, or backstop requirements. - Close as
reroutewhen the question has stopped being pool policy and has become local choice, enactment planning, or selector-facing publication.
One internal retained subset here is still one pool-treatment result. It is not yet one public Shortlist, RankedShortlist, or ShortlistId-bearing selector artifact. If the retained subset must be published for downstream comparison, handoff, or registry-facing consumption, C.19 closes only by rerouting to G.5.
If the result still cannot say which pool remains live, which lens governs it, and which event would justify changing the treatment, it is still unfinished pool policy rather than one finished C.19 result.
Minimal pool-policy record
The smallest useful C.19 record usually states:
livePool = ...governingLens = ...currentTreatment = widen | keep frontier | narrow to subset | sunset line | reroutechangeTrigger = ...learningProgressSignal? = ...when an autotelic or capability-discovery reason materially supports widening, keeping the frontier live, or probing one goal region furthercompetenceModelRef? = ...when the pool policy depends on a model of what the system or method family can learn nextgoalSpaceExpansionCue? = ...when the lawful next treatment widens the goal/task palette rather than merely re-ranking current candidatesgoalSpaceExpansionPolicyRef? = ...when goal/task-space growth is itself governed by one declared archive/curriculum expansion policywhyNotLocalChoice = ...when the result might otherwise be mistaken forC.11
A lawful short record may therefore read:
When currentTreatment = narrow_to_subset, livePool still names one internal retained subset or one live pool subset. It does not yet mint one public Shortlist, one public RankedShortlist, or one ShortlistId. If selector-facing publication is now required, the lawful [C.19](/generated/patterns/C.19) record closes as reroute to [G.5](/generated/patterns/G.5) rather than silently renaming the internal subset as though publication had already happened.
Goal/task-space growth is one pool-policy doctrine over the archive/curriculum side. When autotelic or capability-discovery pressure is active, cite one GoalSpaceExpansionPolicyRef together with the supporting LearningProgressSignal, CompetenceModelRef, or GoalSpaceExpansionCue; that doctrine may justify widen, keep frontier, or one further probe decision value, but it does not become default Q, does not rename the front, and does not publish one selector-facing shortlist without a [G.5](/generated/patterns/G.5) handoff.
If the record does not already state which pool remains live, what governs it, and what would change that policy treatment next, it is still one unfinished [C.19](/generated/patterns/C.19) result.
Worked closure slice
Three short contrasts keep the closure law practical.
Several family regions remain live.
When the point is to keep several lines active under one declared lens, C.19 should not pretend it has already made one local choice:
One region should now be sunset.
When one region no longer clears the active novelty floor or backstop, [C.19](/generated/patterns/C.19) should say so directly rather than leaving that retirement implicit:
The pool has already been narrowed and the next question is selector-facing publication.
When one internal retained subset is already explicit and the next question is to publish it for downstream use, [C.19](/generated/patterns/C.19) should close by rerouting instead of naming that subset as though it were already one public shortlist artifact:
Bounded shortlist from declared source sets
- Treat
Shortlistas the set emitted by one named lens from one declared source set, not as a synonym forFront. - If the mathematical set object must be named, treat it as the choice set underlying that shortlist rather than as one second public head.
- When the current Context consumes the ordinary default
DefaultId.DominanceRegime, keepDominanceSetequal to the declared currentQtuple and cite that consumed default rather than re-governing it here. Novelty@context,DeltaDiversity_P,Surprise, andIlluminationSummarystay outside default dominance unless one declaredPromotionPolicypromotes them.- If
Use-Valuebelongs inQ, declare it there; do not let it drift between core objective and side note. ExplorationArchiveis the exploration-specific specialization ofArchive; useArchiveas the wider family head only when that exploration-specific subtype does not matter.- Resource bounds govern how much probing, comparison, or retention is warranted, but they do not by themselves redefine the front.
- Decision under budget may draw from the front, from the archive, or from both, but the source set and the decision lens must be explicit.
- The selected-set kernel floor here is:
- one set-return comes first
- one named lens acts over that declared return
- one
Shortlistis emitted from that lens-declared source set - one
ShortlistIdmay later name that shortlist when it must be carried as one stable public token - one
RankedShortlistmay appear later when the shortlist is explicitly ordered
PortfolioModemay state how the selector operated, but it does not rename the emitted set result.- When the comparison question becomes load-bearing, the minimum mathematical substrate should stay visible:
- the compared candidates live in one declared outcome or characteristic space
- the archive may depend on one declared search, niche, or reachability space
- the shortlisted result is emitted from one explicit selected-set return rather than from one hidden scalar winner
- When a context-local creativity or novelty characteristic remains outside the declared
Qtuple, keep that distinction visible rather than treating it as one silent override of the current dominance basis.
First public wording for shortlisted outputs
- Prefer wording like
shortlist from the declared Q-Front under LensId=...over wording that makes the shortlisted result sound like one second front. - When one stable emitted object must be cited across documents or tools, say
ShortlistId for that shortlistrather than letting the token name replace the shortlist result itself. - If the shortlist later acquires order, say
RankedShortlistand keep the prior shortlist result recoverable. - Reserve
choice set underlying that shortlistfor mathematical discussion, proofs, or object-level set operations.
Choice doctrine stays source-set explicit
- State the declared source set and the declared decision lens in the same place as the shortlisted-choice rule.
CostToProbe,ValueOfInformation,ValueOfComputation,explore_share, andbackstop_confidencemay appear here when they justify choice from one declared source set.- Those terms explain why another probe, defer, or stop decision is warranted; they do not rename
Front,Archive, orShortlist. - When teams need a fuller account of budgeted probing or sequencing, add that as one separate resource-aware choice explanation rather than overloading the shortlist doctrine itself.
- Selector-facing publications should keep speaking about the emitted set and its source set rather than trying to explain the whole budgeted-choice rationale there.
System grounding
A product-search or architecture-search team often keeps several family regions alive even after one tempting line starts to look best locally. A lawful C.19 result might therefore keep the frontier live under frontier_sweeper_v3 until one retained line actually clears the declared backstop_confidence, instead of collapsing the whole pool into one premature winner.
Episteme grounding
A SoTA pack often compares traditions that stay non-dominated for different reasons: one clears current evidence quality, one keeps broader transfer value, one preserves family coverage. The lawful C.19 result is then often keep frontier or narrow to subset, not one fake scalar champion.
Collective and contextual grounding
A regional or stakeholder-diverse pool may have to sunset one line while keeping others alive to preserve coverage, fairness quotas, or contextual fit. The practical point is that C.19 governs that pool-treatment decision only while the question under repair is still about the live set; once the result must become one local choice, one enactment plan, or one published selected set, reroute immediately.
Bias-Annotation
No global scalarisation of partial orders; ordinal scales excluded from arithmetic; all selections record lens id and policy id; notation/tool neutrality.
Conformance Checklist
-
C19-1 Each NQD generator call (C.18) SHALL cite
U.EmitterPolicyRef(policy id + params) and the activeInsertionPolicyRef/dedup_thresholdwhen not inherited. -
C19-2 The characteristic set and indicators used for dominance MUST be declared; eligibility conditions applied first. (References to C.18 generator operators are descriptive only; LOG exports no Γ.)
-
C19-3 If a lens is used, its id MUST be recorded; do not label scalarized top-1 as "frontier".
-
C19-4 Promotion of Surprise/Illumination into dominance MUST be explicit in policy.
-
C19-5 USM/RSG gate applies: policy actions SHALL operate within the Context's scope and enactable RSG states.
-
C19-6 Each selection lens MUST implement and document the pipeline
Eligibility (ConstraintFit=pass) → Dominance (declared set) → Tie-breakers (declared). Any promotion of Surprise/Illumination into the dominance set MUST be named by lens/policy id and recorded in provenance. -
C19-7 (LEX-AUTH trigger). Any change to
EmitterPolicydefaults that affects domain-family quotas/samplers (HET-FIRST), or any change toDescriptorMapfamily coordinates,DistanceDef, or theδ_familythreshold MUST be authored via E.15 LEX-AUTH. Any resulting LAT lives in the relevant LAT/evidence authority; the DRR need only carry the content decision itself plus any decisive evidence or validation consequence by value when that consequence materially shaped the choice (see CC-DRR.6). Record policy/card ids in SCR. -
C19-8 When the Heterogeneity-first lens is used, provenance MUST include: (i) the family-quota vector (including the default triad quota k), (ii) the subFamilyDef id (from F1-Card) if sub-family quotas apply, (iii) the sampler class, seed, and policy id.
-
C19-9 When
C.19returns one pool-policy result, that result MUST identify the still-live pool or family scope, the governing lens or policy id, and the next treatment (widen,keep frontier,narrow to subset,sunset line, orreroute). -
C19-10 If the question under repair is still local option choice, already one enactment-facing plan, or already one selector-facing publication result,
C.19MUST reroute rather than restateC.11,C.24, orG.5. -
C19-11 If autotelic or capability-discovery evidence is used, the record MUST name the
GoalSpaceExpansionPolicyRefwhen one governs widening and theLearningProgressSignal,CompetenceModelRef, orGoalSpaceExpansionCuethat supports the pool treatment, and it MUST keep those signals outside default dominance unless an explicit promotion policy is recorded. -
C19-12 If exploration/exploitation collects data for a causal claim, changes intervention budget, learns a causal policy, evaluates a policy from behavior/logging data, or treats counterfactual replay as support,
PoolPolicyResult.causalUseSpec?MUST carrytargetCausalityLadderRung,causalUseClaimKind: CausalUseClaimKind, causal evidence support basis when known, supported use and unsupported use, and relevantC.28support refs.
Common Anti-Patterns and How to Avoid Them
- Treating one scalarized top-1 as the frontier. Avoid by naming the governing lens and keeping the live frontier distinct from any lens-ranked pick.
- Running exploration without one explicit next treatment. Avoid by ending each pass with one explicit pool-side action:
widen,keep frontier,narrow to subset,sunset line, orreroute. - Letting
SurpriseorIlluminationquietly become dominance criteria. Avoid by promoting them only through one declared lens or policy id and recording that promotion in provenance. - Absorbing neighboring questions. Avoid by rerouting fixed-option choice to
C.11, enactment-facing call planning toC.24, and selector-facing publication toG.5.
Consequences
- the result states whether the pool is being widened, kept live, narrowed, sunset, or rerouted
- heterogeneity can remain lawful without pretending every frontier is one scalar winner
- the cost is stricter provenance and the need to name lenses, policies, and change triggers explicitly
Rationale
C.19 exists because pool governance is neither local choice nor execution. Once several candidate lines remain live, the key question is no longer which single option should survive now; it is how the pool should be governed next under one explicit lens or policy. That question needs its own explicit pool-policy result, otherwise frontier drift, silent scalarization, and policy amnesia return immediately.
- Post-2015 bandit and Bayesian-optimization practice treats explore/exploit policy as an explicit policy object, not as one hidden side effect of whichever candidate looked best first. The practical implication here is to emit one explicit pool treatment plus one change trigger, not one atmospheric frontier story.
- Contemporary frontier and quality-diversity practice also distinguishes the live frontier from any scalarized pick taken under one declared lens. The practical safeguard is to keep
keep frontier,narrow to subset, andsunset lineas visible alternatives rather than silently totalizing the pool. - Modern pool-management and fairness-preserving lines keep coverage or heterogeneity pressures explicit until one declared reason justifies retirement or reroute. The practical implication is simple: sunset or reroute only when the current pool-policy result can already say why the pool no longer belongs to
C.19.
Relations
C.27 temporal-claim relation.
- C.27 may flag: a temporal claim that changes exploration, exploitation, narrowing, widening, convergence speed, or search cadence in a way that changes admissible use.
- This pattern keeps: pool-policy result and explore/exploit governance, including
keep frontier,narrow to subset, andsunset line. - Non-admissible use: faster narrowing is not automatically a positive result; it may collapse exploration health, diversity, archive coverage, or frontier discovery.
- Exit: use C.19 for the pool-policy result; use C.27 only for the temporal-claim adequacy question when speed or change affects admissible use.
Builds on: Decsn-CAL, B.3. Coordinates with: C.11 for local choice among already-available options, C.18 for candidate generation and open-ended search, C.24 for post-choice enactment planning, G.5 for selector-facing publication, C.28 for causal-use question/rung/support vocabulary when pool policy is used causally, C.17, and G.9.
C.19:End
Bitter‑Lesson Preference (BLP)
One‑screen purpose (manager‑first). Establish, at governing policy level, the empirical Bitter Lesson: prefer general, scale‑amenable methods—those that improve with more data/compute/capacity and greater freedom‑of‑action—over bespoke narrow heuristics when safety and legality are equal. Exceptions require a transparent Scale‑Audit under the parity harness.
Builds on. C.19 (E/E‑LOG), C.24 (Agent‑Tools‑CAL; ATC‑2), B.3 (Assurance), E.3 (Precedence), E.5 (Guard‑Rails). Coordinates with. G.5 (Selector), G.8 (SoS‑LOG Bundles), G.9 (Parity), G.11 (Refresh‑Telemetry), A.0 (On‑Ramp). Keywords. general‑method preference; scale‑amenability; BLP‑waiver; iso‑scale parity; Scale‑Audit; slope vector; α/δ tolerances.
Problem frame
Bespoke heuristics can win locally but do not scale; general methods (search/learning/planning) improve with scale and transfer across bridges/planes. Without a standing policy, selectors drift toward bespoke local heuristics and single-winner leaderboards, violating parity and admissible order relations.
Policy clauses (normative; synchronized with Core)
BLP‑1 — Scale‑Audit requirement. Any DRR that selects a narrower/hand‑engineered method over a general/scalable alternative while claiming scale advantage, BLP override, selector-facing method preference, publication-facing method superiority, or durable project-side method preference MUST include a Scale‑Audit: (a) Parity harness: equal FreshnessWindows, a common ComparatorSet, replicates/seeds, set-returning evaluation; Dominance = ParetoOnly unless a CAL policy says otherwise (policy‑id cited). (b) Budget sweeps: vary compute, data, and FoA within a fixed safety envelope; pin any unsweepable knob and record the invariant. (c) Slopes & uncertainty: report ∂quality/∂compute, ∂quality/∂data, and (where applicable) ∂coverage/∂FoA, with CI/error bars and edition/policy pins in telemetry. Use bootstrapped CIs or repeated‑seed estimates; disclose heteroscedasticity handling. (d) Resources: publish Resrc‑CAL accounts (time/energy/FLOPs) and assurance deltas (B.3). (e) Objective vector: list Q/Risk/Cost and—only if policy promotes them—illumination/coverage telemetry metrics. (f) DoE recipe: for ≥2 active knobs, apply a fractional factorial or Latin‑hypercube with ≥ 3 levels per knob to avoid aliasing; justify any lower design. (g) Knee & regret tests: if claiming a heuristic wins, show either (i) a knee inside the audited window for the general method (per SLL‑5 policy thresholds) or (ii) budget‑constrained regret over the sweep where the heuristic dominates within CI.
BLP‑2 — Preference rule (with α/δ tolerances). Among admissible options with comparable assurance (within δ) and budget (within α), prefer the method whose slope vector Pareto‑dominates over the audited range; if no dominance within error bounds, prefer the more general method; else resolve by the E/E‑LOG tie‑breakers declared in policy. (Agentic contexts implement this as ATC‑2; BLP_delta_α/δ live in ATC.Policy.)
BLP‑2.1 — Valid waiver grounds (override transparency). Overrides of BLP‑2 are allowed only when: • Deontic override: regulation/ethics make the general method inapplicable (E.5/E.3). • Scale‑probe overturn: under iso‑scale parity in the declared ScaleWindow, the heuristic sustainedly outperforms with uncertainty accounted for. • Complementary bias: the heuristic is an inductive bias that improves the general method without blocking scale (graceful degradation as
Sgrows). All overrides record a BLP‑waiver with rationale, responsible role, and expiry/review in the DRR.
BLP‑2.2 — Task-family specialization compatibility.
A bounded task-family specialization remains BLP-compatible when it is produced by a general, scale-amenable substrate, when it acts as a complementary bias that does not block scale, or when it survives the ordinary BLP comparison discipline on the same declared task family and work target. If the user is not claiming scale advantage or overriding a general method, a bounded task-family specialization may be used with explicit task family, work target, budget guard rails, and evidence source or evidence locus. Full Scale-Audit is triggered by scale-advantage, override, selector-facing publication, publication-facing superiority, or durable reusable-method claim, not by the mere existence of specialization. BLP therefore governs whether the narrower current method was generated, compared, audited, waived, and overridden admissibly; it does not require the final local behavior at every moment to look maximally generic.
Low-human-overlap or newly discovered approaches remain admissible when the task family, budget guard rails, and evidence source or evidence locus are explicit by value and the same Scale‑Audit, α/δ, waiver, and override discipline is preserved.
BLP‑3 — Minimal‑prescription default.
Author rules‑as‑prohibitions (negative constraints) instead of stepwise scripts; encode limits in Φ policy tables (and Φ_plane) and allow agents to sequence autonomously within those constraints. Scripts are permissible only when mandated by safety/regulation or with compelling DRR evidence reviewed under E.3/E.5.
BLP‑4 — Heuristic‑Debt register (mandatory).
Record Heuristic Debt only when an admitted heuristic functions as reusable method-family policy, selector-facing method preference, durable override of a general scale-amenable alternative, DRR-backed scale waiver, or project-side method choice that claims scale advantage or BLP override. Ordinary local bounded tactics that make no reusable-method, scale-advantage, selector-facing, or override claim may remain local and bounded without Heuristic Debt publication. BLP.HeuristicDebtEntry is a C.19.1-local or G.11-linked policy/debt entry; it is not a universal U.* record kind unless separately admitted through F.18, C.3, and E.9. For a live debt entry, record scope, responsible role, expiry/review window, and a de-hardening plan; track in CalibrationLedger/BCT and cite in SCR.
BLP‑5 — Continuous‑learning posture. Where product policy allows, enable feedback‑driven adaptation (preference learning, critique loops) within Guard‑Rails and privacy controls; disabling adaptation requires DRR justification and review date.
BLP‑6 — Precedence & safeguards. BLP is constitutional (instantiates P‑10/P‑11/P‑7/P‑1), but does not supersede Guard‑Rails (E.5) or precedence rulings (E.3). Where NQD/E/E‑LOG promotes illumination into dominance, BLP adopts that lens for the audited window.
BLP‑7 — Publication discipline. Scale‑Audit artefacts SHALL be exported to G.11 with edition pins, CI level, α/δ, ComparatorSet, and BLP.Policy@Context reference so downstream selectors can reuse evidence without re‑running audits.
Conformance Checklist (CC‑BLP)
-
α/δ tolerances declared in DRR or via policy profile (and CI level stated).
-
DRR includes a Scale‑Audit (BLP‑1a–g) with slopes, CI, edition/policy pins, and Resrc‑CAL.
-
Selection cites BLP‑2 and precedence checks.
-
Any heuristic that meets the BLP‑4 trigger is recorded as a
BLP.HeuristicDebtEntrywith scope, responsible role, expiry or review window, and de‑hardening plan; ordinary local bounded tactics do not create a debt entry. -
Authoring defaults to rules‑as‑prohibitions; deviations are DRR‑justified and safety‑anchored.
-
Resrc‑CAL accounts and assurance deltas reported.
-
Replicate counts/seeds and confidence intervals recorded for slope estimates; heteroscedasticity handling disclosed.
-
Audit artefacts exported to G.11 with BLP.Policy@Context id.
-
When a narrower specialist method is selected or returned for one declared task family, the record names the task family/work target and the Scale‑Audit, waiver, or override ground that keeps the choice BLP‑compatible.
Anti‑patterns & remedies
Single‑winner leaderboards; hidden budget mixing; promoting illumination into dominance without policy; missing edition pins; heuristics without expiry; slope estimates without CI or with aliased designs → remedy with G.9 parity + edition pins, explicit policy‑ids, DRR publication, Heuristic‑Debt entries, and BLP‑1f DoE discipline.
Elegant-math override. A specialized or elegant mathematical lens is selected over a more general or scale-amenable alternative because of elegance or prestige while scale advantage is live. Remedy: use BLP scale-audit when the claim is scale advantage; otherwise mark the lens as local and bounded by C.29 stop condition.
Archetypal grounding (post-2015; informative)
Source posture: this section is informative grounding for scale-amenable method comparison, not a current SoTA table. A concrete BLP claim still needs the local context, comparator set, alpha/delta tolerances, budget, assurance boundary, and source-currentness row named by the applying pattern or parity harness.
- LLMs: prompt-programs, retrieval-augmented and MoE policies vs narrow task-specific pipelines; set-returning selection across editions/budgets.
- RL & planning: model-based optimization/general agents vs hand-coded controllers (subject to alpha/delta and safety).
- Preference learning: RLHF <-> DPO families.
- QD/OEE: MAP-Elites/CMA-ME/DQD/QDax; POET/Enhanced-POET; illumination remains report-only telemetry unless policy promotes it.
Payload — exports
BLP.Policy@Context (UTS row; editioned):
⟨PreferenceDefault, α/δ tolerances + CI, Scale‑Audit recipe (G.9 link; DoE), WaiverRegister{reason, responsibleRoleRef, expiry}, E/E‑LOG lens policy‑ids, ATC.PolicyRef? (agentic), G.11.TelemetryPins⟩.
UTS row template (conceptual; pencil‑ready).
BLP.Policy@Context := PreferenceDefault=(prefer‑general|neutral), α/δ=(α=…, δ=…, CI=…), Scale‑Audit=(parity=G.9; sweep=S={…}; DoE=factorial|LHD; kneeTest=policy‑τ), WaiverRegister=[{reason=…, responsibleRoleRef=…, expiry=…}], E/E‑LOG=(policyIds=…), ATC.PolicyRef=(…), TelemetryPins=(edition=…, seeds=…, comparatorSet=…).
Relations
Depends on: G.5/G.9 (selector/parity), G.11 (refresh telemetry), C.5 (Resrc‑CAL), C.18 (NQD‑CAL), C.19 (E/E‑LOG), F.7/F.9 (Bridges, CL/Φ/Ψ). Constrained by: E.5 Guard‑Rails and E.3 precedence.
C.29 mathematical-lens use relation
When a mathematical lens is chosen over a general, scale-amenable method because it is elegant, specialized, or theoretically prestigious, C.19.1 governs the scale-advantage and method-preference claim. A C.29 application may state CandidateMathObject, LensMappingMode, PreservedStructure, LostStructure, LensUseAdmissibilityValue, admissibleUse, nonAdmissibleUse, and StopCondition; it does not supply BLP compatibility, scale dominance, or waiver evidence.
If scale advantage is live, cite a Scale-Audit or BLP-waiver. If scale advantage is not live, keep the mathematical lens local and bounded by its C.29 stop condition.
Memory hook. Prefer what scales; explain when you don’t.
When E.23 selects between a Ralph-like general adaptive loop, a specialized object-family cycle, or a mixed operation-family set, C.19.1 governs the BLP comparison and waiver discipline. The local E.23 cost and risk prompt token_or_compute_cost + tool_cost + adaptation_attempt_cost + human_supervision_cost + rework_cost - avoided_loss_value is not a scalar quality score; it is a practical accepted-work cost account for deciding whether the next pass, added operation, or method-family switch is BLP-compatible. Repeated automation alone does not satisfy BLP; the record must still name the object under improvement, object-under-improvement evaluation, protected trade-offs, bounded cost and risk posture, and stop or switch condition.
C.19.1:End
Composition of U.Discipline (Discipline‑CAL)
Builds on. C.2 KD‑CAL (F–G–R & CL routing), A.19/G.0 CG‑Spec (comparability), F.9 Bridges (cross‑Context alignment), E.10 LEX (registers & twin labels). Coordinates with. C.21 (Discipline‑CHR, field health), C.23 (Method‑SoS‑LOG), F.17–F.18 (UTS).
Problem Frame
Disciplines persist as knowledge canons (epistemes), codified practices & standards, and institutional carriers (journals, bodies, curricula). FPF needs a typed, provenance‑preserving way to compose these into a reusable holon of talk that travels across contexts admissibly. Composition must honour KD‑CAL lanes and the CG‑Spec Standard so that any numeric comparison or aggregation remains auditable and legal.
Problem
Without a composition calculus for disciplines:
- fields degenerate into labels; editions and rival Traditions/Lineages blur;
- cross‑Context reuse silently drops meaning (no Bridge/CL), or performs illegal aggregations (means on ordinals; unit mixing);
- selectors (Part G) cannot admissibly gate methods because maturity and evidence are not tied to a field's canon and carriers.
Forces
Solution — the Discipline holon and Γ_disc
U.Types (minting & registers)
U.Discipline— a Holon that composes an EpistemeCanon, Standards/Practices, and Organisational Carriers into a durable unit of talk (R‑core name; twin labels).U.AppliedDiscipline,U.Transdiscipline— subtypes ofU.Discipline. (Kernel U‑types; LEX‑governed).U.Tradition,U.Lineage— auxiliary holons that organise variants/editions within aU.Discipline.
Placement/LEX. U.Discipline and its subtypes are Kernel U‑types introduced under the Open‑Ended Kernel & Ontological Parsimony guards (A.5, A.11) and registered per E.10/F.17. This CAL uses them, it does not redefine them. If not yet present in A‑cluster, mark as “provisionally minted” and open a DRR to finalize placement (E.10 strata).
All are UTS‑published with twin labels; minting follows E.10 registers/prefix policy and A.11 parsimony.
What a U.Discipline is / is not
- A
U.Disciplineis not aU.BoundedContextand not a Domain. Domain remains a catalog label (stitched to D.CTX + UTS): Discipline ≠ Domain is enforceable via E.10 LexicalCheck; any cross‑Domain/Context reuse MUST cite a Bridge (F.9) + CL + loss notes; penalties to R only; F/G invariant (USM/KD‑CAL). - Comparability of a discipline flows only through the discipline’s CG‑Spec entries (no ad‑hoc formulas).
- Cross‑Context/Tradition reuse MUST use Bridge(s) with CL and loss notes; CL penalties route to R (KD‑CAL/B.3); F/G remain invariant.
- Public naming surfaces obey LEX (EntityOfConcern / Description / specification-use; twin labels; banned heads); “discipline column” is didactic only and carries no semantics (enforced by LexicalCheck).
Constructor Γ_disc (CAL export)
Signature.
Γ_disc : ⟨EpistemeCanon, StandardsSet, OrgCarriers, {Bridges}, Policy⟩ → U.Discipline
Intent. Fold the three constituents into a U.Discipline, preserving provenance, publishing UTS cards, and enabling lawful comparability via referenced CG‑Spec rows.
Obligations.
- Provenance & lanes. Each imported episteme/standard declares A.10 anchors and lane tags {TA, VA, LA}; freshness windows are recorded.
- Assurance fold. Use KD‑CAL weakest‑link on R with Φ(CL) (and, where applicable, Φ_plane for ReferencePlane crossings) table‑backed and monotone; publish policy ids. For any justification path P, compute
R_eff(P) = max(0, min_i R_i − Φ(CL_min(P))); for parallel independent lines to the same claim takeR(Γ) = max_P R_eff(P);F(Γ)=minalong used paths. No thresholds inside CHR/CAL (Acceptance‑only). Unknowns propagate as {pass|degrade|abstain} to Acceptance. - CG‑Spec guard. Any numeric comparison/aggregation in Discipline reports MUST cite the discipline’s CG‑Spec with lawful ScaleComplianceProfile (SCP), Γ‑fold, and MinimalEvidence; units/scale/polarity legality via MM‑CHR/CSLC precedes aggregation.
- Scale/Unit/Polarity legality. Before any comparison/aggregation, prove legality via MM‑CHR/CSLC and cite CG‑Spec characteristic ids used in the fold (A.17–A.19).
- ReferencePlane guard. When crossings touch
world|concept|episteme, apply CL_meta and route penalties to R only; record plane on the UTS row. - Edition discipline. Changes to canons/standards that alter computed ⟨F,G,R⟩ create a new edition; DRR captures the rationale; UTS edition-continuity records transitions.
- No stealth globalisation. Cross‑Context mappings are by Bridge only; “by‑name reuse” is forbidden** even with similar labels.
Discipline ESG (state graph, informative surface)
Export a Discipline.ESG with named states and guarded transitions (e.g., Emerging → Consolidating → Codified → Fragmenting), where guards reference C.21 metrics (CHR‑typed; Scale/Unit/Polarity + freshness windows) and cite CG‑Spec ids; all thresholds live only in AcceptanceClauses (G.4). ESG is descriptive; all gating remains in CHR/CAL/LOG packs.
Archetypal Grounding (Tell–Show–Show)
Bias‑Annotation
Lenses: Governance (naming/UTS), Architecture (CAL+CHR split), Onto/Epist (discipline ≠ domain; triangle fidelity), Pragmatic (authoring/editions), Didactic (twin labels; System/Episteme scenes). Scope: context‑local; no “global discipline”.
Conformance Checklist (normative)
Canonical rewrites (anti‑ambiguity)
- “TDD discipline” →
Tradition: Test‑Driven(Plain twin keeps “Tradition”). - “Safety Discipline Owner” →
Holder#DisciplineStewardRole:Safety‑Context. - “ClinicalSafetyDomain Governance” →
DisciplineSpec: Clinical‑Safetywith comparability in CG‑Spec; the Domain mention remains a D.CTX + UTS catalog stitch.
Consequences
Benefits. Auditable field composition; lawful federation across traditions; selector‑ready maturity/evidence linkage; didactic surface for stewardship. Trade‑offs. Discipline authoring requires CG‑Spec literacy and Bridge hygiene; paid back by safe reuse and clearer governance.
Rationale
The calculus keeps entityOfConcern local, comparability lawful, and assurance explicit. It aligns with KD‑CAL’s weak‑link folds and CL routing, with CG‑Spec’s ScaleComplianceProfile (SCP) and Γ‑fold rules, and with LEX twin‑label governance. It avoids “phlogiston disciplines” by tying fields to measurable CHRs (C.21) and evidence lanes.
Relations
Builds on. KD‑CAL (C.2); CG‑Spec (A.19/G.0); Bridges (F.9); LEX (E.10).
Coordinates with. C.21 (field‑health CHRs), C.22 (Problem‑CHR), C.23 (Method‑SoS‑LOG).
Constrains. G.2 MUST publish TraditionCards/BridgeMatrix sufficient for Γ_disc to assemble ≥2 Traditions and ≥3 U.BoundedContext per SoTA synthesis to avoid monoculture. G.5 selector SHALL cite Discipline CG‑Spec ids and EvidenceGraph rows when admitting families.
C.20:End
Field Health & Structure (Discipline-CHR)
Purpose. Give FPF a typed, reviewable way to characterize the health, maturity, and structure of a scientific or engineering discipline, without collapsing into taste, anecdotes, dashboard views, audit labels, or single-number scores. The pattern defines a portable set of Characteristics and guards (legality, freshness, scope) that any Context can specialize.
This pattern supplies the CHR vocabulary of health for disciplines. C.20 composes the discipline; C.21 declares discipline-health characteristics and admissible readings; Part G may publish SoTA palettes or time-series views; Bridges keep cross-context meaning honest; penalties touch R only.
Status & placement. Part C (Kernel Extention Specifications) → Cluster C.I (Core CHRs/CALs).
Depends on: MM-CHR (C.16), KD-CAL (C.2), USM/Scope (A.2.6), Trust & Assurance (B.3), E.10 (LEX‑BUNDLE).
Coordinates with: C.20 Discipline‑CAL (what a U.Discipline is), G.2 (SoTA palette), G.12 (dashboard), G.0 (CG‑Spec registry).
Problem Frame
FPF treats disciplines as first-class holons (see C.20): they aggregate epistemes, practices, standards, institutions, and observed Work. Teams routinely say “the field is fragmented,” “standards are converging,” or “replication is improving,” but these claims are rarely typed (scale/unit/polarity) or replayable (evidence lanes, freshness, scope). C.21 supplies the CHR vocabulary: named Characteristics with CSLC typing, so discipline-health claims can be compared admissibly (CG-Spec) and monitored through time (G.12) when a project needs that use. Each published value declares ReferencePlane ∈ {world|concept|episteme} and DisciplineId (U.Discipline@UTS); cross-plane use applies CL^plane in Assurance (penalty to R_eff only).
Problem
Narrative health claims cause three recurrent failure modes:
- Illegality. Averaging ordinals, mixing units, or comparing incommensurate Contexts ⇒ nonsense roll-ups.
- Staleness. Health “scores” rarely declare freshness windows or evidence lanes (TA/VA/LA).
- Scope slippage. “The field” is left implicit; cross-Context reuse lacks Bridges & CL, leading to silent semantic loss. Any numeric comparison or aggregation cites a CG-Spec row (characteristics, ScaleComplianceProfile (SCP), Γ-fold, MinimalEvidence) before computation.
Forces
Solution — Discipline Health Characterisation (DHC)
Ontology quick sheet (normative, clarifying)
What “DHC” is. DHC is a CHR vocabulary pack that defines Characteristics + Scales/Units/Polarity for discipline health; it is not a document or a run.
Artifacts.
• U.DHCPack (I-lane name; published as an episteme): the slot set (Characteristic/Scale declarations) for a Context.
• U.DHCMethodSpec (S-lane): the computational specification(s) for deriving each DHC slot (e.g., replication‑window definition, CD‑index class), table‑backed; multiple per slot allowed, editioned separately.
• U.DHCSeries (episteme w/ EditionSeries): a time‑indexed publication of computed DHC readings for a Discipline×Context, each value bound to …Ref.edition for every referenced method/metric/distance.
Edition subjects.
(i) DHCPack.edition — when the slot semantics (Characteristic/Scale) change.
(ii) DHCMethodSpecRef.edition — when a computation method (formula/class/policy) changes.
(iii) DHCSeries.edition — when the published series changes its content (not carriers).
Publication. Releases are Work on Carriers; no edition change unless content changes per U.EditionSeries.
Ref discipline. All bindings to packs/methods/distances use ...Ref.edition (dot on the Ref).
Define a portable minimal set of CHR slots. Each slot is CHR-typed (Characteristic, Scale/Unit/Polarity per A.17–A.18), Context-local, and guarded by USM (Claim scope G), freshness windows, and evidence lanes (TA/VA/LA). Contexts may extend the set; conforming extensions do not alter scale types illegally.
“Health” is a vector of CHR‑typed coordinates; no single scalar is implied. Lawful scalarization lives in Acceptance (G.4) under an explicit CG‑Spec ScaleComplianceProfile (SCP) and Γ‑fold rules, and is never embedded in CHR.
Core Characteristics (kernel-portable names)
-
ReproducibilityRate (ratio ∈ [0,1]; polarity ↑; ReferencePlane=episteme; CG‑Spec‑bound) Fraction of tested claims/benchmarks that independent teams replicate under a declared ContextSlice and Γ_time window. Lane tags: LA (validation) with TA (typing) for protocols.
-
StandardisationLevel (ordinal; polarity ↑; ReferencePlane=episteme) {none, emerging, de facto, de jure}. No mean. Use medoid/mode; legal comparisons are ≤/=/> only. Tracks convergence on vocabularies, interfaces, or procedures.
-
AlignmentDensity (ratio; polarity ↑; ReferencePlane=episteme; CG‑Spec‑bound) Density of Substitution Bridges (same senseFamily, CL≥2) between major
U.Traditions per 100 DHC‑SenseCells (G.2 F‑hooks) in the SoTA palette. Substitution rule: free substitution permitted at CL=3; at CL=2 substitute only with extra‑guard (count in reporting, but this is not «free substitution») Units:bridges_per_100_cells. Cross‑Context use requires Bridge+CL; penalties → R_eff only. -
DisruptionBalance (interval; polarity = target band; ReferencePlane=episteme; CG‑Spec‑bound) Relative share of disruptive vs consolidating works within Γ_time using a registered CD‑index class (editioned; cite method id in UTS). Default plane: episteme. Publish the target band via Acceptance (G.4); not in CHR.
-
EvidenceGranularity (Context-declared: ordinal|ratio; polarity ↑; ReferencePlane=episteme) If ratio: units =
claims_per_artifactoranchors_per_claim(declare). If ordinal: publish level names and ORD_COMPARE_ONLY. Fineness of evidential units and declared envelopes (experiment cards, benchmark tasks, audit granules). Encourages smaller, well-scoped claims over monoliths. -
MetaDiversity (portfolio dispersion; polarity ↑ to band; ReferencePlane=episteme; CG‑Spec‑bound) Use entropy/HHI over MethodFamily/Tradition shares (method edition id in UTS); publish guard‑band as Acceptance binding; cross‑ordinal scalarisation is forbidden. Entropy/Herfindahl-type dispersion across
U.Traditions, method families, or data regimes, bounded by a Context-declared guard-band (too low ⇒ monoculture; too high ⇒ incoherence).
Typing & legality. Each slot declares Scale/Unit/Polarity; illegal ops (e.g., mean on ordinals; unit mixing) are fail-fast per A.18/MM-CHR.
Engineering-grade and semio-substitution extension slots
Contexts MAY add these DHC slots when the discipline-health question includes engineering-grade reasoning, architecturing, optimization, prediction, comparison, assurance input, decision input, first-principles justification, mathematical-lens use, or source-publication overread. These slots remain discipline-health characteristics. They do not become evidence relations, assurance relations, gate decisions, mathematical-lens use, measurement legality, release permission, or project authority.
-
EngineeringClaimJustificationRecoverability (ordinal; polarity ↑; ReferencePlane=episteme|world by declared claim; CG-Spec-bound when aggregated) Degree to which engineering-grade claims in the discipline or Context expose the exact justification that carries their force for the declared use. The justification may be a named construction, source, model, lens, evidence relation, characteristic relation, assurance relation, gate relation, method relation, or heuristic triage boundary, but it must cite the neighboring pattern governing the claiming FPF pattern when that force is live (
A.10,B.3,A.15,A.20,A.21,C.16,C.29, or another governing pattern). Heuristic examples may carry recognition and triage only; prediction, comparison, optimization, falsification, assurance-input, decision-input, or architecture-readiness force requires the recoverable justification. -
SemioSubstitutionPressure (ordinal or ratio; polarity ↓ to band; ReferencePlane=episteme; CG-Spec-bound when aggregated) Degree to which discipline texts, patterns, dashboards, views, publications, source chains, or review artifacts substitute wording, publication form, record appearance, source appearance, or explanation fluency for the operative engineering entity, relation, work, evidence, assurance, gate, decision, method, or mathematical-lens claim. Lower pressure is healthier when the discipline keeps EntityOfConcern, episteme, publication, source, carrier, and project-side claim kind or admissible-use boundary separable and names the pattern governing the recovered claim for any claim being made or admissible-use boundary.
Extension guard. Activating either extension slot requires a local EngineeringClaimJustification note or semio-substitution note that names the claim kind being made or admissible-use boundary, neighboring pattern governing the claiming FPF pattern, admissible use, non-admissible overread, and stop or reopen condition. The note is a DHC value explanation, not a new evidence source, assurance case, gate, release record, or work authority.
Guard Macros (normative)
- ORD_COMPARE_ONLY(x) — for StandardisationLevel (ordinal).
- UNIT_CHECK(x) — forbid cross-unit aggregation (AlignmentDensity, ReproducibilityRate).
- POLARITY_CHECK(x) — enforce declared polarity (↑/↓/target-band) per MM‑CHR.
- FRESHNESS(x; window) — ensure values come from evidence within declared Γ_time; record valid_until; stale ⇒ {degrade|abstain} at Acceptance.
- PLANE_NOTE(x) — record ReferencePlane; compute CL^plane on crossings; penalties → R_eff only.
- LANE_TAGS(x; {TA|VA|LA}) — annotate contribution lanes.
- SCOPE_COVERS(x; TargetSlice) — enforce USM coverage of the computation.
- BRIDGE_CL(x; id, CL≥k) — on cross‑Context roll‑ups, require Bridge with CL; penalties route to R only. If planes differ, apply CL^plane and cite Φ_plane policy id. Hint: for AlignmentDensity reporting, set k=2 (CL≥2); CL=3 counts as free substitution.
Legality Matrix (extract)
Note: For MetaDiversity/EvidenceGranularity (ordinal) use median/mode; forbid affine ops; unit mix always fails.
Interfaces & Data Paths
- Inputs.
U.Disciplinefrom C.20 (composition), SoTA Palette/BridgeMatrix from G.2 (DHC‑SenseCells included), EvidenceProfiles from G.4/G.6. - Outputs. Per‑Context DHC rows (these six slots), UTS Name Cards with twin labels (E.5/F.17–F.18), Registry/RSCR hooks on method edition changes; feeds G.12 (time‑series).
- Cross-Context reuse. Only via F.9 Bridges with CL and loss notes; Φ(CL) penalties applied to R (never F/G).
Archetypal Grounding (three fields)
Computer Vision (Benchmarks 2015→)
- ReproducibilityRate. Ratio of independently reproduced results on ImageNet-style tasks within rolling 24 mo (LA lane).
- StandardisationLevel. de facto for dataset specs and metrics in Vision_2024; emerging for robustness protocols.
- DisruptionBalance. Use an editioned CD‑index class (e.g., Wu‑style disruption family) with method id; publish target band via Acceptance; annotate ReferencePlane=episteme.
- AlignmentDensity. Bridges with CL≥2 across sub-traditions (supervised vs self-supervised).
- MetaDiversity. Entropy across method families (CNN/ViT/Hybrid) kept within guard-band to avoid monoculture.
Biomedicine (Gene–Disease Associations)
- ReproducibilityRate. Fraction of associations replicated in independent cohorts within Γ_time(36 mo); LA lane with TA (typing of protocols).
- StandardisationLevel. de jure for certain reporting guidelines; emerging for pre-registration norms.
- EvidenceGranularity. Move from “paper-level” to claim-level units (Context raises the score).
- DisruptionBalance. Target band discourages sustained “novelty spikes” unbacked by replication.
Software Performance Engineering (SPE)
- StandardisationLevel. emerging → de facto for SLO taxonomies and trace schemas across vendors.
- AlignmentDensity. CL-rated Bridges between tracing ecosystems.
- ReproducibilityRate. Share of publicly replicable perf claims in rolling windows.
- MetaDiversity. Balance across load models, failure modes, and toolchains.
Decision‑Making (2015→)
• ReproducibilityRate — share of causal effect estimates replicated across independent datasets within Γ_time; LA lane. • StandardisationLevel — emerging for identification checklists; de facto for SCM notation in leading stacks (ordinal; no means). • AlignmentDensity — CL‑rated Bridges between SCM/DoWhy‑style and RL/BO traditions per 100 DHC‑SenseCells. • MetaDiversity — dispersion across method families (SCM/RL/BO/DT) within guard‑band; entropy/HHI (units declared in CG‑Spec).
Evolutionary Architecture (software)
• ReproducibilityRate — fraction of architecture fitness results reproduced on independent workloads (rolling 18–24 mo; LA lane). • StandardisationLevel — de facto for ADR/ATAM patterns; emerging for continuous fitness protocols. • AlignmentDensity — Bridges across ATAM/SAAM/ADR style guides (CL≥2) normalised per 100 DHC‑SenseCells. • MetaDiversity — portfolio dispersion across patterns (microservices, event‑driven, layered) with guard‑bands; no ordinal arithmetic.
Characteristic reading and publication path
- Declare Context & TargetSlice. (USM) Name editions, Standards, env params,
Γ_time. - Collect evidence. Bind sources via G.6 EvidenceGraph; tag lanes and freshness.
- Compute DHC slots. Enforce Legality Matrix and Guard Macros.
- Bridge (if needed). Map via F.9; attach CL and loss notes; apply R penalties.
- Publish to UTS. Name Cards (Tech/Plain), twin labels; bind
DHCMethodSpecRef.edition,DistanceDefRef.edition, and, where templates are used,DHCMethodRef.edition; register RSCR triggers (method change, ScoringMethod/NormalizationMethod edits). - Publication view. Feed G.12 with time-series and guard-bands (disruption, diversity) when a dashboard or trend publication is live.
Bias-Annotation (E-cluster lenses)
- Didactic. Plain names + twin labels; one-screen tables for managers.
- Architectural. No ordinals averaged; all cross-Context movement goes through Bridges+CL; penalties never touch F/G.
- Pragmatic. Freshness-aware; unknowns tri-state; values are decision-input cues, not trophies.
- Epistemic. Evidence lanes explicit; reproducibility is LA, typing is TA; validation distinct from dashboard or report publication.
Conformance Checklist
This checklist verifies a DHC reading after the practitioner has selected the live discipline-health question. It is not an audit form and not a dashboard specification.
Consequences
Benefits. Scale-legal comparisons; freshness-aware governance; explicit cross-tradition alignment; dashboard views that do not lie by averaging ranks. Costs. Some ceremony (scales, windows, lanes, bridges), offset by template macros and UTS automation. Risks avoided. “Phlogiston disciplines” (charisma-driven fields) surface as unhealthy in DHC readings; No-Free-Lunch preserved by G.5 (selector returns sets, not universal scalars).
SoTA-Echoing and rationale
The practical consequence is that C.21 reads discipline health through typed characteristics. It can feed dashboards or time-series publications, but the dashboard is only a publication view over DHC readings; it is not the discipline-health ontology and not project authority.
Relations
- Builds on: A.17–A.18 (Characteristic/CSLC), A.2.6 (USM scopes), B.3 (assurance lanes), C.16 (MM-CHR templates).
- Coordinates with: C.20 (what a
U.Disciplineis), G.2 (SoTA palette and BridgeMatrix), G.12 (Dashboard operationalization), G.9 (parity harness for fair comparisons). - Constrains: G.10 (pack ships DHC rows + method ids), G.11 (refresh windows/decay), G.5 (selector may reference DHC only via admissible predicates; no cross‑ordinal scalarisation). Coordinates: F.9 (Bridges for cross‑Tradition comparisons).
Annex — Author’s quick template (copy-paste)
C.21:End
Problem Typing & TaskSignature Assignment (Problem-CHR)
Purpose. Give FPF an admissible, minimal, and portable way to type a problem for downstream selector-facing use after the problem-side representation is stable enough for Principles-to-Work, eligibility, acceptance, or policy-governed choice. C.22.2-selector-facing use carries the first problem-framing record for a messy signal; C.22-selector-facing use attaches the stabilized problem to CHR-grounded traits and a minimal TaskSignature (S2) record for downstream selector-facing use. The TaskSignature attachment is Context-local, evidence-relation-traceable, tri-state-aware, and bridge-visible. TaskSignature is minimal but sufficient for eligibility, acceptance, and policy-governed choice.
Status & placement. Part C (Kernel Extensions Specifications) → Cluster C.I (Core CHRs/CALs). Depends on: C.16 MM‑CHR (measurement admissibility), G.5 (selector S2/S3), G.0 (CG‑Spec invariants). Coordinates with: G.4 (Acceptance and Evidence profiles), C.23 (MethodFamily admissibility and maturity), C.18 NQD‑CAL (QD and illumination), C.19 E/E‑LOG (emitters and policies), E.10 (LEX).
Intent
Operationalise No-Free-Lunch discipline in selection by making every run-time decision against a typed TaskSignature (S2), not a paragraph. A problem reaches C.22 when its problem-side representation is stable enough for a selector-facing typed attachment record; a task or work target is ready for selection only when that attachment can be made to a declared TaskKind, task family, or work target without pre-binding a method. Method absence, method contestability, or method-family ambiguity is a common practical cue for this transition, but it is not the ontology of problemhood. The signature is the smallest CHR-typed set sufficient to drive Eligibility -> Acceptance -> policy-governed selection without inadmissible arithmetic or silent coercions; crossings are reviewable (Bridge+CL -> R_eff only).
Term split used in this pattern
TaskSignatureattachment means attaching one typed problem record to one declared task family or work target; it does not pre-bind a method.ScopeSlice(G)means the claim-bounding scope cut overEntityOfConcernRefand scope; it is not an evidence-path slice and not a baseline-set slice.thresholdis not one undifferentiated family here:- articulation and closure thresholds stay with cue or prompt governing patterns such as
B.4.1andB.5.2.0 - acceptance-gate thresholds stay with
G.4 - the work-measure threshold target used in specialization claims is only the declared success mark for the current task family or work target
- articulation and closure thresholds stay with cue or prompt governing patterns such as
ProblemCard@Context relation
ProblemCard@Context is the C.22.2-problem-side record-side record shape for stabilizing one context-bound problem representation before downstream Principles-to-Work (P2W).
A ProblemCard@Context record can be used to prepare ProblemProfile, TaskKind, or candidate TaskSignature material for later use. Binding to one TaskSignature is admissible only when the downstream selector-facing object is ready. If several downstream signatures remain plausible, keep them as candidate signatures rather than binding one chosen TaskSignature.
This relation does not move problem-card fields into TaskSignature. TaskSignature remains the minimal C.22 attachment record for eligibility, acceptance, and selection. ProblemCard@Context remains the reviewable problem-side record that carries the reason this problem, in this context, can proceed to P2W, characterization, comparison, search, refresh, retirement, or another governing pattern.
The corresponding claims are governed by their named governing patterns.
Problem Frame (DesignRunTag split; crossing-visible)
Selector-facing problem case
For selector-facing C.22 use, a problem case applies when the problem-side representation is stable enough to attach or emit a minimal TaskSignature for eligibility, acceptance, and policy-governed selection. Method absence, method contestability, or method-family ambiguity is a common downstream reason for C.22 use, but it is not the only reason a ProblemCard@Context may be needed upstream. C.22 therefore does not define problemhood by method absence; it defines the downstream typed attachment record used once problem-side readiness is truthful. When the question under repair is still a symptom, contested framing, stale context, set-derived candidate, opportunity cue, or preselected work item, use C.22.2 before binding one chosen TaskSignature. When selection or synthesis of a method becomes live, strategy or policy is governed by G.5 and E/E-LOG; C.22 use does not introduce a strategy or policy kernel type.
Unknown‑first discipline. Author S2 with unknown traits rather than coercions; SoS‑LOG branches MUST specify {admit|degrade|abstain|sandbox} handling for unknown via closed enums registered at UTS.
Un‑typed "problems" collapse into informal prose; selectors cannot filter or abstain admissibly; acceptance-gate thresholds leak into scoring; cross‑Context reuse is by name, not Bridge. We need a Context‑local descriptor that (i) obeys MM‑CHR admissibility (Scale/Unit/Polarity proven before any aggregation), (ii) records Assurance lanes (TA/VA/LA) per A.10 and ReferencePlane, (iii) carries tri‑state unknowns explicitly, and (iv) records crossing attestations (BridgeCard + UTS row) with Φ(CL)/Φ_plane policy‑ids.
Problem
Without typed descriptors, Eligibility and Acceptance degenerate into prose; inadmissible operations creep in (ordinal means; unit mixing); cross‑plane comparisons lose CL/Φ penalty assignment (penalties to R_eff only).
Forces
Solution — Problem‑CHR (fields) + TaskSignature (S2) attachment (normative)
Minimal CHR fields (tri‑state aware).
Selector-side field boundary. The fields below are live only after problem framing has been stabilized enough to ask eligibility, acceptance, selection, method-family, or policy-governed choice questions. They are not a universal problem-framing checklist and must not replace the C.22.2 Thin ProblemCard@Context pass for a messy signal. Each live field is CHR-typed (Characteristic, Scale, Unit, Polarity; MM-CHR discipline). Every predicate admits unknown (tri-state). Unknown-handling policy propagates {degrade|abstain|sandbox} per Acceptance profile or EvidenceProfile policy (recorded in SCR). (G.4/G.6 alignment)
Optional extension absence rule. If QD, OEE, archive, generator, parity, specialization, or another optional relation is not live for the current case, the corresponding optional fields are absent, not unknown. Use unknown only for a live field whose value is currently unknown. An absent non-live extension does not trigger {degrade|abstain|sandbox} propagation.
DataShape— data regime and admissible transforms (e.g., tabular, sequence, graph; density; stationarity claims).NoiseModel— uncertainty class and robustness envelope (e.g., iid Gaussian; heavy‑tailed; adversarial budget).ObjectiveProfile— objective heads (Scale, Unit, Polarity and ReferencePlane declared), polarity, and admissible order relations (lexicographic, Pareto, medoid or median where admissible). Weighted sums across mixed scale types are forbidden; ordinal heads use order-only guards. For QD tasks, explicitly enumerate quality heads, diversity or descriptor-space heads, and any policy-authorized QD contribution heads; see DominanceRegime below. Do not introduce a default QD score. If a scalar or set-scalarization policy is live, cite the governing CAL policy and keep dominance and telemetry roles explicit.RegularityTraits— method‑relevant structure (convexity, differentiability, separability, monotonicity) as CHR‑typed predicates with guard‑macros (e.g.,ORD_COMPARE_ONLY,UNIT_CHECK,POLARITY_CHECK). IncludeConditionClass(e.g., stiffness/κ‑proxies) where applicable.Constraints— explicit hard and soft constraint classes (feasibility predicates; ResourceEnvelope and RiskEnvelope). Acceptance-gate thresholds live inG.4only; never inside CHR or code paths.ShiftClassand stationarity — CHR‑typed claims about regime stability (iid | covariate‑shift | concept‑drift | adversarial). Default=unknown. Acceptance or flow use is governed by this field in gating; otherwise abstain.EvidenceGraphRef (A.10)— carriers & lane tags (TA/VA/LA) with freshness windows; no self‑evidence; default Γ‑fold = weakest‑link unless CAL proves an alternative.ScopeSlice(G)— the USM claim-bounding scope cut over EntityOfConcernRef and scope (discipline governance in CG‑Spec; Domain is a catalog mark only).Size/Scale— size and condition proxies (n, m, κ, sparsity) with declared units; unit mismatch ⇒ {sandbox|refuse}.Freshness— validity window for descriptors.Missingness— MCAR, MAR, or MNAR (or mapped equivalents) per CHR.Missingness; MUST be honoured by Acceptance and Flows.KindSet—U.Kind[]for the selected entities addressed by the TaskKind; separates EntityOfConcern kind from Scope (USM).
QD and Illumination extensions (normative; ties to C.18 and C.19).
Use this extension block only when QD, illumination archive, set-return, or OEE generator relation is live for the current case. It is not part of every TaskSignature.
CharacteristicSpaceRef— reference toU.CharacteristicSpace, with declared d≥2; characteristics are CHR‑typed; ReferencePlane per characteristic; pin edition viaCharacteristicSpaceRef.edition.ArchiveConfig— archive topology (grid, CVT, or graph), resolution (bins or centroids), K‑capacity,InsertionPolicyRef(elite replacement, dedup, or novelty), andDistanceDefRef.edition(declare metric or pseudometric status and invariances; any normalisation MUST cite admissible scale transforms in CG‑Spec); admissibility follows CG‑Spec.EmitterPolicyRef— pointer to emitter/governor policy (C.19) applicable to this TaskSignature; edition id recorded.DominanceRegime—{ParetoOnly | ParetoPlusIllumination}. Default =ParetoOnly(illumination remains report‑only telemetry unless CAL explicitly authorisesParetoPlusIllumination, policy‑id cited).IlluminationSummary— a telemetry summary overDiversity_P; reported by default; excluded from dominance unless a CAL enablesParetoPlusIllumination(policy‑id cited).IlluminationMap(parity‑run) — required IlluminationMap publication (grid, CVT, or graph perArchiveConfig) recording coverage per niche or cell withDescriptorMapRefandDistanceDefRef.edition. Leaderboards as single‑score lists are forbidden; comparisons MUST be under CG‑frames.PortfolioMode—{Pareto | Archive}. Default =Archive: selectors preserve retained archive evidence (QD archives) rather than a single “best” set; ε‑fronts remain admissible for local decisions under CG‑Spec.Budgeting— evaluation, time, and batch budgets, including E/E‑LOG exploration budget id; units declared (CG‑Spec).TelemetryHooks— PathSliceId, decay and refresh policy ids, and edition counters to record U.DescriptorMap and policy‑id updates upon illumination gains.GeneratorIntent(OEE) — optional intent to use a registeredGeneratorFamily(G.5), with pointers toEnvironmentValidityRegion,TransferRulesRef, and coverage and regret reporting expectations.
Admissibility. Before any numeric comparison or aggregation, prove CSLC admissibility (Scale, Unit, Polarity) and cite CG‑Spec.Characteristics; record ReferencePlane. Unknowns propagate as {degrade|abstain|sandbox}; no unknown→0/false coercions.
TaskSignature (S2) — attachment definition (design‑time + run‑time).
A TaskSignature is the minimal typed record consumed by selector-facing use:
⟨Context, TaskKind, TaskFamilyRef?, KindSet:U.Kind[], DataShape, NoiseModel, ObjectiveProfile, Constraints{incl. Resource/Risk Envelopes}, ScopeSlice(G), EvidenceGraphRef, Size/Scale, Freshness, Missingness, ShiftClass?, BehaviorSpaceRef?, ArchiveConfig?, EmitterPolicyRef?, DominanceRegime?, PortfolioMode?, Budgeting?, TelemetryHooks?, GeneratorIntent?⟩
Minimality rule. S2 carries only fields required for Eligibility→Acceptance→admissible selection; any additional traits derived at design‑time are recorded as provenance (UTS) but do not expand S2.
Values are CHR‑typed with provenance; traits may be inferred from CHR and CAL bindings (e.g., convexity known? differentiable? ordinal vs interval scales?) and from USM scope metadata. Unknowns are tri‑state; Missingness semantics MUST align with CHR.Missingness and be honored by Acceptance and Flows.
TaskKind names the governing kind of work or problem under this context. TaskFamilyRef? names one comparison-relevant family inside that task kind when specialization, transfer, or parity question is live. TaskSignature is the context-bound typed attachment record for one current case under that kind and scope cut. KindSet continues to name the selected entities addressed by the task kind; it is not a substitute for the task-family reference.
DesignRunTag hygiene. Do not mix DesignRunTag in one signature; record GateCrossings as CrossingBundles (E.18; Bridge+UTS through F.9, F.17, E.17, and E.18) when importing design‑time traits into run‑time.
Specialization-claim reference discipline (normative)
Any claim that one holder, dyad, team, or explicitly scoped specialist portfolio acquired usable specialization SHALL state one declared TaskFamilyRef or TaskSignature, one named work-measure threshold target, an adaptation budget, and the freshness or provenance basis for reuse. A method may be selected, refined, or retired as part of that story, but the method is not the bearer of the specialization claim. The attached task-family record should stay rich enough for the same task family and work target to remain admissible in C.22.1 adaptation signatures, G.5 specialization profiles, and G.9 adaptation parity without reconstructing the claim from narrative prose.
Low-human-overlap or newly discovered task families remain admissible when those task-family or signature references are explicit by value.
Provenance & planes.
Record Context and ReferencePlane for each value; on any cross-Context or cross-plane reuse, attach BridgeDescription + UTS row, apply CL (and, if planes differ, CL^plane) penalties to R_eff only; both Φ(CL) and (if used) Φ_plane MUST be monotone, bounded, and table‑backed; no “distance” language; penalties never mutate F/G. Record policy‑ids in SCR and cite Bridge ids on crossings.
Attachment & use.
- Eligibility gates read TaskSignature against each MethodFamily.Eligibility (C.23) and CG‑Spec.MinimalEvidence for referenced characteristics.
- Acceptance clauses (G.4) use these fields for acceptance-gate threshold predicates (acceptance-gate thresholds live in Acceptance only).
- Selection kernel (G.5.S3) applies an admissible order (often partial); weighted sums across mixed scale types are forbidden. If only a partial order remains, return a Pareto (non‑dominated) set with tie notes. If
PortfolioMode=Archive, the selector may return a QD archive (perArchiveConfig) in addition to or instead of a Pareto set. Illumination enters dominance only ifDominanceRegime=ParetoPlusIlluminationis enabled by CAL (policy id cited); otherwise, QD telemetry values are reported but excluded from dominance. - When
GeneratorIntentis present, G.5-governed selection may use a registeredGeneratorFamily(POET‑class); the selection domain becomes pairs{environment, method}, with Environment guarded byEnvironmentValidityRegionandTransferRulesRef(C.23 wiring). ReportIlluminationSummaryas a telemetry summary overDiversity_P(report‑only by default) in telemetry; dominance remains unaffected unless policy changes as above.
Unknowns.
Every field admits unknown; downstream degrade, abstain, or sandbox behavior is explicit per Acceptance profile or EvidenceProfile; no implicit coercions.
Publication.
Output a ProblemProfile (...Description) that carries the bound TaskSignature, UTS Name Cards for any minted values (twin labels), and SCR-visible provenance (A.10 evidence relations, lane tags, freshness, ReferencePlane). Mark any vendor or tool examples as Plain‑register only (LEX V‑4); they are non‑normative.
Open‑Ended tasks (GeneratorFamily) (normative).
If the problem requires open‑ended generation of tasks or environments, S2 SHALL include GeneratorIntent with pointers to EnvironmentValidityRegion (admissible region for generated environments), TransferRulesRef (cross‑environment transfer constraints), and coverage and regret telemetry expectations. Selector outputs are then declared sets over {environment, method}; coverage and regret are reported telemetry values and IlluminationSummary is a telemetry summary (reported), excluded from dominance unless a CAL policy promotes them (policy‑id recorded in SCR; see DominanceRegime). Edition increments of CharacteristicSpaceRef.edition, DescriptorMapRef.edition, DistanceDefRef.edition, and (OEE) TransferRulesRef.edition, and the policy‑id associated with illumination increases SHALL be recorded in SCR.
Archetypal Grounding (Tell–Show–Show)
Tell–Show–Show hook (per E.8): label examples as Show‑1 (continuous ODE) and Show‑2 (MIP) and cite CHR guard‑macros in‑line so engineers can see which field supplied which Eligibility or Acceptance input. Explicitly annotate which S2 fields triggered each Eligibility and Acceptance decision (e.g., service_level@ordinal → ORD_COMPARE_ONLY, budget@ratio → unit alignment check).
A. Differential equations (continuous systems, solver choice).
ProblemProfile. DataShape=ODE, stiff?=unknown, Size/Scale={n≈10^3}, ObjectiveProfile={↓error@ratio, ↑throughput@ratio}, Constraints={budget≤X, safety_gate@ordinal}, RegularityTraits={Lipschitz known?=unknown, Jacobian sparsity=high}, Missingness=MAR.
Attachment. Selector consumes TaskSignature; eligibility filters MethodFamilies that require known stiffness or differentiability (unknown ⇒ degrade/abstain per family); Acceptance enforces safety_gate as ordinal predicate, not averaged (ORD_COMPARE_ONLY), and budgets with unit‑aligned sums (ratio). The selector returns a Pareto set; no cross‑ordinal weighting.
B. Mixed‑integer optimisation (planning and scheduling).
ProblemProfile. DataShape=MIP, NoiseModel=deterministic, ObjectiveProfile={↓cost@ratio, ↑service_level@ordinal}, Constraints={SLA hard, workforce soft}, RegularityTraits={convex_relaxation=available}, Size/Scale={vars~10^5}, Missingness=MCAR.
Attachment. CG‑Spec forbids means over service_level (ordinal); Acceptance holds acceptance-gate thresholds; Eligibility checks convex‑relaxation availability; Selection applies lexicographic guard (assumption‑fit ≻ evidence‑fit ≻ resource), compute R_eff with Γ‑fold, apply CL penalty to R only; if partial order remains, return a Pareto set.
Contemporary source references (informative): modern Julia ecosystems illustrate a registered outer interface with specialised implementations inside (e.g., DifferentialEquations.jl, JuMP), aligning with C.22→G.5 multi‑method selection under NFL.
C. Quality-Diversity archive and declared set (illumination).
ProblemProfile. DataShape=policy‑search; ObjectiveProfile={↑reward@ratio, ↑coverage@ratio (report‑only)}, DominanceRegime=ParetoOnly, PortfolioMode=Archive, CharacteristicSpaceRef(d=3, characteristics=CHR‑typed), ArchiveConfig(grid, res=32×32×16, K=1, InsertionPolicyRef=elite‑replace, DistanceDefRef.edition=v1), EmitterPolicyRef=v2, Budgeting{eval=1e6}, TelemetryHooks{PathSliceId=…}.
Binding. Selector may return an archive; coverage and illumination are reported but excluded from dominance (default). Any change of DistanceDefRef.edition or Emitter policy is editioned and logged in SCR.
D. Open‑ended environment generation (POET‑class).
ProblemProfile. GeneratorIntent{GeneratorFamilyRef=…, EnvironmentValidityRegion=… (CHR‑typed), TransferRulesRef=…, CoverageMetric=…}, PortfolioMode=Archive.
Binding. Selector outputs {environment, method} pairs that pass Eligibility; TransferRules govern cross‑environment policy reuse; telemetry reports coverage and regret and IlluminationSummary with edition and policy‑id when improved.
Bias‑Annotation (LEX/discipline guards)
- No minted
U.Type“Strategy”. Strategy and policy remain roles insideG.5; keep “strategy” as Plain-register wording where it helps recognition, but do not introduce a newU.Typeor strategy head. - Transdiscipline vs domain. Comparability flows through
U.DisciplineCG‑Spec; “Domain” is a catalog mark stitched to D.CTX + UTS; do not attach norms to Domain labels. - Plain twins and head selection. Use Description and Spec morphology correctly (I, D, S; E.10.D2).
Anti‑patterns (normative):
- AP‑1 Pre‑binding a Method into S2 (“problem as if task”); Remedy: keep S2 method‑agnostic; bind only admissible traits.
- AP‑2 Silent
unknown→falseorunknown→0in Eligibility and Acceptance. - AP‑3 Cross‑ordinal averaging or ordinal–interval scalar mixes.
- AP‑4 DesignRunTag chimera signatures (mixing stances).
- AP‑5 Domain treated as governance (attach governance to U.Discipline and CG‑Spec, not Domain).
- AP‑6 Implicit handling of data‑shift (assume iid); Remedy: declare
ShiftClass(orunknown) and gate via Acceptance. - AP‑7 Tool or vendor tokens in normative text; Remedy: move to Plain‑register note; keep Tech references on CHR and CAL ids (LEX V‑4).
Remedies: tri‑state predicates; admissible order relations (lexi, Pareto, median, or medoid); explicit GateCrossing visibility through CrossingBundle (BridgeCard + UTS row + CL/Φ policy‑ids; E.18, F.9, F.17, E.17, and A.21 where live); Domain stitched to D.CTX + UTS only.
Conformance Checklist (normative)
-
Minimal S2. S2 contains only fields necessary for Eligibility, Acceptance, and selection; any extra derived traits remain provenance.
-
TaskSignature present (S2). Every exported TaskKind has a TaskSignature with all fields declared and CHR‑typed;
unknownis an admissible value for each. -
CHR admissibility proven. Any numeric comparison or aggregation cites CG‑Spec by Characteristic id and proves CSLC admissibility; no mean on ordinals; no unit mixing.
-
Unknowns propagate. Unknowns must map to {pass|degrade|abstain} in Acceptance and Eligibility; no implicit coercions; behavior recorded in SCR.
-
Evidence lanes. A.10 evidence relations + Assurance lanes (TA/VA/LA) + freshness windows recorded; Γ‑fold default=weakest‑link unless proved otherwise.
-
ReferencePlane guarded. ReferencePlane noted per value and per ObjectiveProfile head; on crossings apply CL (and CL^plane if planes differ); Φ(CL)/Φ_plane are monotone, bounded, table‑backed and documented in the
CG‑Spec; penalties → R_eff only (F/G invariant). -
Acceptance thresholds live in CAL. No acceptance-gate thresholds in CHR or code paths; only in G.4 AcceptanceClauses.
-
Selector admissibility. Selection uses admissible (possibly partial) orders; weighted sums across mixed scale types are forbidden; return a Pareto set when appropriate.
-
Crossings visible. Any cross-stance/cross-Context reuse records BridgeCard/BridgeDescription + UTS row with CL notes and (if planes differ) CL^plane + Φ_plane.
-
UTS twin labels. All exported cards include Name Cards with twin labels; Bridges carry loss notes.
-
GateCrossing checks. Exported TaskSignature and any referenced crossings satisfy: (i) stance tagging (if used; informative only), (ii) CrossingBundle presence/consistency (E.18; F.9; F.17; E.17; A.21 when gate checks are live), (iii) LanePurity (CL→R only; F/G invariant; Φ tables present), and (iv) Lexical SD (E.10). Failures are blocking under the active GateProfile / GateChecks (A.21).
-
QD fields (when QD is in scope). If
PortfolioMode=Archiveor QD heads are present, CharacteristicSpaceRef (d>=2), ArchiveConfig (topology, resolution, K,InsertionPolicyRef,DistanceDefRef.edition), and EmitterPolicyRef SHALL be present and CHR-typed; characteristics declare ReferencePlane. -
DominanceRegime default.
DominanceRegimedefaults toParetoOnly; inclusion of illumination in dominance MUST be enabled by a CAL.Acceptance policy; the policy id SHALL be recorded in SCR. -
Telemetry. PathSliceId, decay and refresh policy ids, and edition counters for CharacteristicSpaceRef, DistanceDefRef, and EmitterPolicyRef SHALL be recorded; any illumination increase SHALL log the policy-id that triggered it.
-
GeneratorIntent (when OEE is in scope).
GeneratorIntentSHALL citeEnvironmentValidityRegionandTransferRulesRef(ids resolvable in G.5/C.23); absence =>Abstainfor OEE generator-family use. -
Budgets.
Budgeting(evaluation, time, and batch) SHALL declare units and E/E-LOG exploration budget id when used. -
Archive admissibility.
DistanceDefRef.editionand any novelty measures SHALL be CSLC-admissible and editioned; inadmissible operations => Abstain. -
Planes. ReferencePlane SHALL be declared for all QD heads or characteristics; plane crossings apply Phi_plane (penalty to R only).
-
Unknowns. Unknown QD fields map to
{degrade|abstain|sandbox}; no coercions. -
Specialization claims referenced. Any declared specialization on this TaskSignature SHALL name the task family/work target, named work-measure threshold target, adaptation budget, freshness or provenance basis for reuse, and enough attachment detail for the same claim to remain admissible in
C.22.1,G.5, andG.9use.
Interfaces & Data Paths
Inputs. ProblemProfile (...Description), CG-Spec ids, Evidence Graph Ref (A.10), D.CTX; CharacteristicSpaceRef, ArchiveConfig, and EmitterPolicyRef configs when QD is live; GeneratorIntent when OEE is live.
Produces. TaskSignature under a declared Context field (S2) with provenance; SCR-visible fields; UTS Name Cards for any minted traits; archive, PortfolioMode semantics, and telemetry hooks declared when QD is live. Do not introduce TaskSignature@Context as a separate kind.
Used by. G.5 (Eligibility and Selection kernel), G.4 (Acceptance and Evidence), C.23 (admit, degrade, and abstain rules and method-family maturity checks).
Consequences (informative)
- Admissible selection. Selection is explainable and review-ready; every reason in/out cites TaskSignature fields, CG-Spec rows, and Gamma-fold contributors.
- Local first, portable later. Context-local semantics are primary; Bridges make portability deliberate and costed (penalties to R only).
- Frictionless downstream. G.1-G.5 use one single, typed TaskSignature; thresholds are cleanly separated into Acceptance; unknowns are not guessed.
- QD and OEE-ready. Typed QD and GeneratorIntent fields make declared returned-set structure and open-ended generation contexts explicit, with admissible dominance, editioned distances, and policy-aware illumination.
Relations
Builds on: C.16 MM-CHR, G.0 CG-Spec. Coordinates with: G.4 Acceptance, G.5 Selector, C.18 NQD-CAL, C.19 E/E-LOG, C.23 Method-SoS-LOG. Constrained by: E.10 (selected EntityOfConcern, Description-episteme, specification-use, and publication-lane wording), E.18 (GateCrossing visibility and publication gating).
Practical use checks
- If two candidate approaches are answering different
TaskKinds or differentScopeSlice(G)cuts, a direct comparison is not admissible yet. - If specialization is the live specialization question, the task-family reference, threshold target, adaptation budget, and provenance basis should already be recoverable from the attached
TaskSignature. - If crossing, normalization, or missingness changes what comparison means, state that in the signature and its cited refs rather than hiding it in code, local memory, or later prose.
- If
QDorOEEheads are in scope, archive and generator fields belong in the same typed signature rather than in a detached explanatory appendix.
Goldilocks hook (design‑time)
When generating candidate solutions for a TaskKind, aim for “goldilocks” slots (feasible‑but‑hard) so that the TaskSignature is informative (neither trivial nor impossible); this aligns with G.1 (goldilocks target, abductive provenance) and ensures the TaskSignature is informative (neither trivial nor impossible) for G.5 selection.
C.22:End
Task-family adaptation signature
Status: Stable
One-screen purpose (manager-first).
Make a specialization claim publishable as one typed adaptation record over a declared TaskFamilyRef or TaskSignature, so later selector and parity work compares the same threshold target, budget burn, prior exposure, transfer, durability, downside, and corridor-entry field rather than reconstructing that story from narrative prose.
Builds on. C.22 (TaskSignature attachment and task-family anchoring), C.19.1 (BLP compatibility), A.15 (role, method, work-plan, and work-occurrence split for scout/probe work), C.24 (CheckpointReturn planning semantics), E.16 (budget enforcement).
Coordinates with. G.5 (selector specialization profiles), G.9 (adaptation parity), G.11 (later telemetry and refresh reuse).
Keywords. adaptation signature; task-family specialization; time-to-threshold; budget-to-threshold; prior exposure; corridor entry; stepping stone; transfer; retention; downside field.
Problem frame
Final task score alone does not tell whether a holder, dyad, or bounded specialist portfolio acquired usable specialization quickly, under what budget, with what prior exposure, whether the resulting competence transferred, or whether it entered a genuinely new solution corridor. If those elements are not published together, the adaptation claim splinters across task typing, probe notes, selector prose, and parity notes, and later readers can no longer tell what exactly was being compared.
Problem
FPF needs one compact way to publish a bounded specialization claim on the same declared task family and work target without retyping the task anchor from C.22 or silently pushing the adaptation-signature question into selector/parity prose.
Use this when
- the live task-family adaptation claim is not only that a holder or dyad solved a task, but how fast it acquired usable specialization on a declared task family
- comparison must stay honest about the work-measure threshold target, prior exposure, adaptation budget, transfer field, and reuse window
- movement into a new solution corridor or stepping-stone family is part of the real novelty claim
What goes wrong if missed
- adaptation claims collapse into vague
got betterlanguage with no declared work-measure threshold target or budget-to-threshold account - parity later compares outcomes that were reached under different prior exposure, different work-measure threshold targets, or different reuse windows
- nonhuman or unfamiliar solution corridors are either romanticized as novelty or dismissed as noise because the corridor entry was never typed
What this buys
- adaptation speed becomes reviewable by value on the same declared
TaskFamilyand work target - later
G.5 / G.9portfolio and parity work can compare the same specialization object instead of reconstructing it from narrative prose - stepping-stone or solution-corridor movement becomes visible as one typed part of the adaptation claim rather than one afterthought
Forces
Solution — one adaptation signature over the C.22 anchor
- Use one shared adaptation-signature field set for this question.
G.5,G.9, and later notes may cite or consume it, but they should not silently rename threshold, prior-exposure, transfer, downside, or corridor-entry terms. - When specialization is the live adaptation question, publish one adaptation signature bound to the declared
TaskFamilyReforTaskSignature, not one generic improvement claim. - The signature should expose at least:
thresholdTargettimeToThresholdbudgetToThresholdpostThresholdEfficiency?priorExposureDeclarationtransferTarget?transferGain?retentionWindow?downsideEffect?corridorEntryBaseline?corridorEntryEvidence?steppingStoneEvidence?
- These fields stay anchored to the same work target and work-measure threshold semantics already declared by
C.22, so adaptation is typed as movement toward usable specialization rather than as an ungrounded growth story. C.22continues to carry the declared task-family anchor, task typing, and baselineTaskSignature.C.22.1narrows the adaptation-signature question to threshold timing, reuse, downside, and corridor-entry disclosure over that existing anchor.
Corridor, transfer, and durability discipline
- If the adaptation claim depends on entering a new solution corridor, publish the
corridorEntryBaselinefirst: the prior repertoire, baseline set, or comparison family relative to which corridor entry is being claimed. - Then publish the
corridorEntryEvidencethat marks real entry into that corridor rather than exotic accident, for example a reproducible solution class, a stable descriptor shift, or one explicit stepping-stone sequence. - If a stepping stone mattered, publish the stepping-stone evidence as part of the adaptation signature rather than treating it as retrospective color.
- Corridor or stepping-stone notes do not replace the work-measure threshold account; they explain why the adaptation path matters, not whether the threshold was actually reached.
- A fast threshold result is not yet enough to claim durable specialization.
- If transfer to a neighboring task family is claimed, name the transfer target and the observed gain explicitly.
- If retention is claimed, name the reuse or retention window rather than letting durability hide inside one isolated run.
- If specialization harms neighboring task families, narrows reusable competence, or creates de-specialization cost, publish that in
downsideEffect?rather than telling only the upside story. - If post-threshold performance matters to later exploitation, publish
postThresholdEfficiency?so the claim is not trapped at the threshold-crossing moment only.
Worked moment
- Two agentic research setups both eventually reach an acceptable threshold on a new catalyst-search task family.
- One of them reaches threshold after a small probe budget, shows a declared transfer gain on one adjacent task family, and records that the winning path entered a previously unused solution corridor.
- The other reaches threshold only after much larger budget and without any reusable transfer.
- The adaptation signature makes that difference publishable without pretending that both runs express the same specialization story.
Consequences
- Threshold speed, budget burn, prior exposure, and post-threshold efficiency become part of the same reviewable object instead of one after-the-fact prose explanation.
- Selector and parity pattern applications can consume a stable upstream specialization object without minting shadow vocabularies.
- Corridor-entry and downside fields stay visible in the same claim that celebrates the specialization gain, reducing romanticized novelty talk.
Rationale
The reader needs one place where the adaptation claim stays whole. C.22 keeps the task family and work target explicit. A.15, C.24, and E.16 may generate the probe, checkpoint, and budget evidence. G.5 and G.9 later compare several candidates or parity runs. C.22.1 keeps the specialization story readable across those neighbouring pattern applications by making threshold timing, reuse, downside, and corridor-entry field recoverable in one short read instead of forcing the reader to reconstruct it from scattered notes.
SoTA-Echoing
Claim 1. Current frontier adaptation work judges usable specialization by threshold-crossing under bounded resources, not by terminal score alone.
Practice source, local alignment, and adoption decision. Current QD and agentic-adaptation sources such as A survey on Quality-Diversity optimization: Approaches, applications, and challenges, Swarm and Evolutionary Computation 100:102240 (2026), FactorMiner arXiv:2602.14670v1 (2026-02-16), and SkillOpt arXiv:2605.23904v2 (2026-05-25) repeatedly separate threshold target, budget burn, transfer evidence, reuse evidence, and changed object/version from one final benchmark score. This pattern adopts that practical field set, adapts it through one TaskFamilyRef or TaskSignature-bound adaptation signature, and rejects generic got better narratives that leave threshold and budget semantics implicit.
Claim 2. Current open-ended exploration work treats corridor entry and stepping stones as evidence-bearing novelty signals rather than decorative commentary.
Practice source, local alignment, and adoption decision. Current QD/OEE source-use role/currentness plus current FPF C.17, C.18, C.19, G.5, G.9, and G.11 neighbours distinguish real corridor entry from one exotic sample by asking for explicit baseline, stable descriptor shift, reproducible solution class, or an explicit stepping-stone trace. This pattern adopts explicit corridor baseline/evidence discipline, adapts it as declared adaptation-signature fields, and rejects novelty talk that names no baseline, evidence source, or evidence locus.
Claim 3. Current selector and parity practice needs one stable shared field set for specialization claims.
Practice source, local alignment, and adoption decision. Current FPF selector and parity neighbours keep compared candidates reviewable only when candidates reuse the same published field set for threshold, prior exposure, transfer, retention, downside, and corridor-entry field. This pattern adopts that reuse discipline, adapts it by publishing one stable adaptation-signature field set here, and rejects silent downstream field redefinition in G.5 or G.9.
Evidence-source note. Peer-reviewed or archived frontier anchors carry the most direct evidence for threshold, budget, and parity claims. Fast-moving frontier lines remain explicit evidence for corridor-entry and open-ended exploration pressure only when the row names their local contribution; they are not a flattened single evidence status.
Relations
C.27 temporal-claim relation.
-
C.27 may flag: a claim that a holder, dyad, team, specialist portfolio, method, or agent acquires usable specialization faster on one declared
TaskFamilyReforTaskSignature. -
This pattern keeps: threshold target, time-to-threshold, budget-to-threshold, prior exposure, transfer, retention, downside, corridor-entry evidence, and adaptation-signature fields.
-
Non-admissible use: generic "learns faster" wording without task-family anchors does not create a C.27 profile or a complete adaptation signature; faster threshold crossing is not durable specialization unless transfer, retention, downside, and corridor-entry evidence are stated when claimed.
-
Exit: downgrade to Dyn1 trend when only a trend is live; use C.24 when the question is only tool-use planning; use C.22.1 when specialization is the live adaptation question.
Builds on: C.22 TaskSignature anchoring, C.19.1 BLP compatibility, A.15 role, method, work-plan, and work-occurrence separation, C.24 scout/probe and CheckpointReturn semantics, E.16 budget enforcement.
Coordinates with: G.5 selector specialization profiles, G.9 adaptation parity, G.11 later telemetry/refresh reuse.
Coordinates with: E.23 when a quality-improvement loop claims durable task-family specialization. C.22.1 carries the adaptation-signature fields for threshold target, time-to-threshold, budget-to-threshold, prior exposure, transfer, retention, downside, and corridor entry; it does not restate the E.23 loop method, E.22 review framing, or pattern-quality or DRR-adequacy object-under-improvement evaluations.
Constrained by: E.10 lexical discipline and E.19 pattern-quality review when this child section is newly landed or materially revised.
Not this pattern when
- the claim only needs to name the task family and work-measure threshold target, with no adaptation-speed or transfer claim at all; ordinary
C.22anchoring is enough - the question under repair is already selector or parity law across candidate selected sets; that belongs to
G.5 / G.9 - the text cannot yet declare one work-measure threshold target, one prior-exposure stance, or one evidence source or evidence locus for corridor entry
Conformance checklist
CC-C22.1-1An adaptation signature SHALL bind to one declaredTaskFamilyorTaskSignature, one work target, and one work-measure threshold target rather than one generic improvement story.CC-C22.1-2An adaptation signature SHALL publishtimeToThreshold,budgetToThreshold, andpriorExposureDeclaration; if threshold was not reached, the signature SHALL say so explicitly instead of implying success.CC-C22.1-3Any declared transfer, retention, post-threshold-efficiency, downside, corridor-entry, or stepping-stone claim SHALL be explicit by value with the target, baseline, evidence source, or evidence locus named, not left as narrative garnish.CC-C22.1-4This pattern may refine specialization timing and reuse claims over the declaredC.22anchor, but it SHALL NOT redefine acceptance-gate thresholds, task-family attachment, or selector/parity law governed by another FPF pattern.CC-C22.1-5Downstream selector/parity pattern applications SHALL cite or consume the same published adaptation-signature field set rather than silently redefining threshold, prior-exposure, transfer, retention, downside, or corridor-entry terms.
C.22.1:End
ProblemCard@Context
Type: Calculus (C) Status: Stable Normativity: Normative
Plain-name. Context-bound problem card.
Intent. Give a practitioner one compact problem-side record that turns a messy problem signal into a reviewable problem-side record before downstream Principles-to-Work (P2W) or selector use, while leaving claims outside the card to the governing FPF patterns that govern those claims.
Use this when. Use this pattern when work starts from a signal, anomaly, drift, risk, hypothesis, stakeholder demand or concern, set-derived candidate, underused capability, new constraint, new environment, opportunity-like cue, or solution-shaped request, and downstream task typing, method-family selection, work planning, evidence use, gate passage, autonomy control, or P2W requires a reviewable problem-side record. Also use it when P2W would otherwise use a slogan, wish, ticket-shaped task, preselected work request, or solution-shaped task as if it were reviewable problem-side output.
Do not use this when. Use another pattern directly when the question under repair is already work planning, method selection, evidence, provenance, assurance, gate decision, autonomy, archive, selected-set governance, mathematical-lens use, or ordinary discussion with no project-side move.
Builds on. E.2, E.9, E.10, C.2.P, A.6.P, C.16.Q, C.16, A.19, C.22, C.25, C.29, G.5, G.9, A.6.3.RT, and A.6.4.
Coordinates with. C.11, C.18, C.19, C.22.1, C.24, C.27, C.28, A.15, A.21, E.16, G.6, G.11, A.10, B.3, E.17, E.17.ID.CR, A.6.3, F.9, and E.18.
Boundary summary. C.22.2 use starts from messy problem-side signals and yields one reviewable ProblemCard@Context, a P2W-ready problem-side input for downstream C.22, or a stop with a governing-pattern cue for the claim being made, relation, or boundary outside the card.
Problem Frame
A working team can reach the beginning of development with symptoms, anomalies, stakeholder signals, constraints, risks, old solution evidence, comparison ideas, solution temptations, underused capabilities, new environments, and opportunity-like cues. Opportunity-like signals still need context, scope cut, not-wish reason, improvement or acceptance probe, and honest next move; they do not turn this pattern into an ideation pattern. If FPF only says "type the task" or "choose a method", P2W can start from a slogan, a ticket-shaped wish, or a solution-shaped task before the problem itself is reviewable.
Problematization becomes useful for FPF use when it makes the problem side explicit. A reviewable problem-side record includes symptom detection, improvement check, acceptance probe or candidate acceptance criterion, mandatory constraints, risk condition, problem-formulation next-move reason, validation boundary, freshness or expiry, and a relation to candidate solution search. Many problems also arrive from a retained set: candidates, anomalies, hypotheses, non-dominated fronts, shortlists, selected sets, LivePool records, and retained stepping stones.
Current FPF already has patterns for archive, pool, front, selected set, parity, refresh, method selection, evidence, autonomy, gate, representation transition, bridge, and mathematical-lens use. The missing piece is a compact problem-side output that lets a practitioner see what is present before P2W use starts from the problem-side output and which current FPF pattern carries each heavier question.
The first-minute working question is:
Can I write or review a problem-side record that is specific enough to guide P2W, selection, acceptance, evidence, and first-principles or mathematical-lens use, while keeping archives, fronts, pools, selected sets, parity, evidence, autonomy, and work planning in their existing FPF patterns?
Thin First Use and Output Kind
Thin First-Use Form
The first substantive use of this pattern is the Thin form. It is a practitioner-facing prompt for writing the smallest reviewable problem card, not a demand to complete a field list.
A ProblemCard@Context is complete for its current use when it states:
- why this signal matters now;
- what problem representation is being carried under which context and scope;
- why this is not merely a wish, ticket, slogan, or preselected work request;
- what would count as improvement or an acceptance probe;
- what the honest next move is.
The Thin form asks for:
- the problem signal or selected-problem cue: what made the practitioner stop before downstream task typing or work selection;
- context grounding and scope cut, including what is outside the current problem;
- the reason this is not merely a wish, slogan, ticket, or preselected work request;
- a provisional improvement check or acceptance probe;
- one honest next move:
P2W-ready, characterize, compare, search, refresh, retire, archive,abstainOrNoChange, or apply the FPF pattern governing the named claim kind, relation kind, or boundary that changes the problem-card move.
If the Thin form lacks an improvement check or acceptance probe, it may preserve the signal and choose characterization, comparison, search, refresh, retirement, archive, abstainOrNoChange, or governing-pattern application for the claim being made; the Thin form does not declare P2W-ready.
Only after the Thin form is legible, recover the output-kind boundary:
C.22.2 - ProblemCard@Context is the compact problem-side output under current C.22.
C.22.2 - ProblemCard@Context is the pattern heading. ProblemCard@Context is the C.22.2 problem-side record shape; an instance is a reviewable problem-side record before P2W. ProblemCard@ContextRef may be used as a reference form when downstream text cites such an instance, but it is not a separate durable kind unless a separate naming or kind decision approves one under F.18 and A.6.P. The Tech heading remains C.22.2 - ProblemCard@Context. Plain-register glosses or section-local practitioner labels may appear in this pattern, but those labels do not replace the Tech heading.
Local labels in this pattern are local to the C.22.2 record shape unless a separate accepted FPF naming or kind decision assigns them a broader FPF kind. This includes problem-formulation next-move reason, validation boundary, risk condition, solvability band, P2W-ready, reviewable, stale, refreshed, retired, archived, abstainOrNoChange, and firstPrinciplesCue; they do not create FPF kinds, gate statuses, state-machine kinds, or local mathematical-lens kinds or relations. When a claim outside C.22.2 is current, do not mint a local reference field for it; name the governing FPF pattern, claim kind named by value, project-side reference when known, and stop condition in the next move or source cue. When a mathematical or first-principles cue is current, cite C.29; local problem-formulation next-move reason names only why the problem formulation or structure cue is worth reviewing or moving onward from C.22.2; C.29 carries mathematical-lens use and the problem-formulation next-move reason for that lens.
Reference labels ending in Ref are reference roles, not kind names. This includes ProblemCard@ContextRef, setContextRef, rivalProblemFormulationRef, and representationOrWordingUseRelationRef; do not shorten or promote them into local kind names such as ProblemCardRef, SetContext, RivalFrame, or RepresentationRelation.
@Context means that the card is bound to declared context grounding: a named U.BoundedContext, a project-side context reference, or an explicitly bounded practice situation with recoverable local meaning. Domain or practice wording may identify the informative locus of the problem, but it does not replace context grounding. A broad label such as healthcare, education, engineering, research, or operations is not context grounding by itself. When domain or practice wording is used for context grounding, recover the named bounded context, project-side context reference, or explicit bounded practice situation and state what local meaning or rule is being used. The card does not assert global problem identity outside that declared context grounding.
Plain gloss for P2W-ready: problem-side input ready. It means ready as input to downstream P2W or selector reasoning, not ready for work execution, gate passage, or method selection.
Required Solution Moves
The C.22.2 Solution is organized around practitioner moves from signal to reviewable problem to one governed next move, not around schema completion.
- Capture the symptom, anomaly, risk, stakeholder cue, drift, hypothesis, or other source signal before naming the problem.
- Stabilize the cheap problem-side record: context grounding, scope cut, EntityOfConcern when it changes the problem-side move, primary viewpoint or role concern, and provisional problem framing.
- Make action possible by separating the symptom detector, improvement check, candidate acceptance criterion, optimization objective when current, monitored risk signal when current, and proxy-distortion risk when an indicator can be gamed or substitute for value; then state mandatory constraints, risk condition when current, and intended next move before downstream selection.
- Pay only for current complexity: add conditional fields only when their kind is current for the problem-card move; otherwise stop at the lighter card or name the governing FPF pattern to use next and the claim kind named by value.
- Run the representation-continuity check: if the problem formulation changes the EntityOfConcern, representation scheme, diagram, functional description, or transformation-flow path interpretation, name the representation-transition, retargeting, bridge, structural-reinterpretation, or wording-use relation before reusing an inherited local cue or readiness disposition.
- Close by the honest next move rather than by a completed form. A filled card without a truthful next move is not a successful
C.22.2result.
Cheap-stop rule: the smallest card that gives a truthful next move is sufficient. A conforming C.22.2 use does not require heavier fields merely because the full field list exists.
First practitioner use before governing-pattern cues:
- Capture the problem signal or selected-problem cue, context grounding, and scope cut.
- State why it is not merely a wish, slogan, ticket, or preselected work request.
- State the provisional improvement check or acceptance probe.
- Choose the honest next move. Use the relation boundary aid only when a conditional relation is current.
This is the Thin-form writing order, not a completion sequence for the whole pattern. It adds no fields; it keeps the practitioner on the smallest truthful card before Standard or High-relation material is paid for.
Relation Boundary Aid
Use this aid only after the Thin ProblemCard@Context is legible: signal, context grounding, scope cut, not-wish reason, improvement check or acceptance probe, and honest next move. It is not a second writing order and not a catalogue of other patterns. It answers one question:
Which claim being made, relation, or boundary changes the problem-card move, and which FPF pattern governs that claim, relation, or boundary?
If the claim, relation, or boundary does not change the current problem-card move, leave it out of the card. If it does change the move, keep only the local cue or reference that makes the card reviewable, then apply the governing pattern for that claim, relation, or boundary.
Over-capture symptom: the practitioner spends the pattern use classifying FPF patterns while the problem signal, context, scope, improvement check, acceptance probe, and next move remain unstable.
Repair: return to the Thin problem-side action. State the signal, context, scope, why this is not merely a wish, ticket, slogan, or preselected work request, the improvement check or acceptance probe, and the honest next move. Reopen this aid only for the claim, relation, or boundary that changes that move.
Use Boundaries and Record Budgets
Use C.22.2 when a signal is not yet a problem-side record and downstream task typing, P2W, method-family selection, work planning, evidence use, gate passage, autonomy control, or selected-set use depends on such a record. A known method does not close this pattern when the problem signal, scope, acceptance probe, or EntityOfConcern remains unstable.
Use another pattern directly when the question under repair is already that pattern's EntityOfConcern or governed relation: A.15 for work planning or performed work; A.10, G.6, or B.3 for evidence, provenance, or assurance; A.21 for gate decision; E.16 for autonomy; C.11 for a local choice among explicit options; and C.18, C.19, or G.5 for archive, pool, front, or selected-set governance. C.22.2 may still preserve the problem-side cue or reference that explains why that pattern is now current.
Use record budgets:
- Thin record budget: signal, context grounding, scope cut, not-wish, not-slogan, not-ticket, or not-preselected-work reason, provisional improvement check or acceptance probe, and one honest next move.
- Standard record budget: Thin fields plus the current comparison, acceptance, risk, validation, freshness, unknown-handling, or P2W-readiness fields needed for downstream use.
- High-relation record budget: Standard fields plus only the relation references needed when public, disputed, high-risk, set-derived, cross-context, evidence-adjacent, autonomy-adjacent, gate-adjacent, agentic, temporal, causal, representation, or Part-G relations are current.
Stop at Thin when it gives a truthful next move. Stop at Standard when it is enough to emit or bind a minimal TaskSignature, TaskKind, or ProblemProfile. Apply the governing FPF pattern for the claim being made, relation, or boundary instead of enlarging the card when the issue under repair is no longer the problem-side record itself.
Field Labels and Current-Use Conditions
The first problem-side move is to make one problem usable before P2W by stating these field labels when they are current for the case:
- problem signal;
- source signal reference: prior solution-use evidence, environmental drift observation, new constraint, new environment, underused capability, opportunity-like cue, risk signal, anomaly, hypothesis, stakeholder signal, accepted local theory, or safe-probe or environment cue;
- domain or practice locus when helpful, plus the context grounding that carries local meaning;
- EntityOfConcern or project-side FPF kind or reference named by value when it changes the problem-side move;
- context grounding;
- primary viewpoint or role concern;
- scope cut;
- symptom detection;
- problem hypothesis or cause-theory cue;
- rival-frame reference when multiple plausible problem frames remain current;
- improvement check;
- comparison-and-acceptance cue or acceptance-criterion reference;
- characterization relation;
- characteristic or Q-bundle relation;
- indicator selection;
- comparability or parity relation, or explicit current reason it is not needed;
- mandatory constraints;
- risk condition;
- problem-formulation next-move reason;
- validation boundary;
- freshness or expiry condition;
- unknown handling;
setContextRefwhen a set, pool, front, archive, shortlist, selected set, or portfolio context is current;firstPrinciplesCuefor a first-principles or mathematical structure cue that changes problem formulation;- governing-pattern cue when a claim outside
C.22.2changes the problem-card move: governing pattern for that claim, relation, or boundary; claim kind named by value; project-side reference when known; and stop condition;
Field current-use conditions for C.22.2 are determined as follows:
Field absence rule: if a conditional field kind is not current, the field is absent, not unknown. Use unknown only for a current field whose value is currently unknown. If a current value is unavailable, state whether the next move is blocked, degraded, sandboxed, or requires the FPF pattern governing the named claim kind before that use. If a value is stale, use the freshness or expiry disposition in C.22.2:12 and G.11. If a field is intentionally omitted, state the record-budget reason and do not imply that the omitted kind has been checked. A minimal ProblemCard@Context contains the always-core fields; conditional fields are added only when current for the problem-card move.
When the card compares options, selected-set members, retained candidates, or rival problem formulations, it states the current comparison or parity relation, or state why comparison is not current for the current move. Absence of a parity relation is not automatically a defect; it is a disposition. The governed result is either parity not current for the current card, or a G.9-governed parity relation before P2W-ready is claimed. A local fair-comparison result or selected-set result stays outside C.22.2.
A conforming C.22.2 use includes minimal source and context witness material when source, set, selection, characterization, parity, freshness, representation relation, or wording-use relation is current. Otherwise a Thin card may cite the observed signal in plain form. The field-group label problemCardSource may be used inside the pattern, but it is not a new FPF kind and not an evidence graph. It is a recoverability field group for source cues and project-side references that make the problem-side record reviewable:
Generated problem variants, evaluator feedback, and open-ended problem mutation may be recorded only as sourceSignalRef, selectionOrRetentionCriterion, or setContextRef when they make the problem-side record reviewable. They do not make the problem-side record usable, do not supply evidence sufficiency, and do not justify probe or action.
Anti-Pattern Checks and Worked Slices
Anti-pattern checks start from the local card move:
- card-as-executable-work request: the card is treated as executable work while method, plan, and work occurrence remain undecided;
- form-completion: every field is filled because the template exists, even though the Thin next move would be truthful;
- readiness shortcut:
P2W-readyis declared from signal and scope alone, without improvement check or acceptance probe; - source-claim shortcut: a preselected solution, work request, proof-looking reference, gate-looking cue, or authority-looking cue replaces the problem-side signal, context, scope, acceptance probe, and next move;
- scalar shortcut: archive, set-return, Goldilocks, NQD, OEE, partial-order, stepping-stone, or indicator material collapses into one readiness score;
- prestige shortcut: first-principles or mathematical wording is kept without practical payoff, preserved and lost structure when current, problem-formulation next-move reason, and stop condition.
Local stop rule: if the encountered material tries to carry a claim outside C.22.2, the card keeps only the cue or reference that changes problem formulation or the next move, then names the governing FPF pattern and claim kind named by value to use before that claim is relied on.
A conforming C.22.2 use is testable against at least one Thin worked slice, such as repeated task rework or another compact source signal, showing signal, context, not-preselected-work reason, improvement check, and next move. It is also testable against at least one High-relation worked slice from a set, archive, pool, front, shortlist, selected set, or portfolio context, showing setContextRef, candidate acceptance criterion, risk condition, and the claim being made, relation, or boundary without creating a local portfolio or archive kind.
Conformance Checklist Requirements
The checklist protects a completed or reviewed card from overread. It is not the writing order and not a gate. The writing order remains Thin form, honest next move, and relation references only when they change the move.
Problem-Kind Recovery
For this decision, problem remains an ordinary word in non-FPF-governed prose. Recovery is required only when the wording changes a governed move, FPF kind, FPF relation kind, downstream selector reference, evidence claim, causal-use claim, bridge claim, assurance claim, decision claim, use-boundary claim, or another governed claim named by value. The preferred center is the framed problem representation: a problem-side representation of a selected EntityOfConcern under context, scope, viewpoint or role concern, constraints, and improvement or acceptance probe. When problem carries FPF work, selection, evidence, causal, bridge, assurance, decision, or use-boundary claim, the claim is recoverable through this table:
Local interpretation rule: ProblemCard@Context is the problem-side record shape before downstream typing or work. It may name candidate ProblemProfile, candidate TaskSignature, setContextRef, source cue, governing-pattern cue, or first-principles cue material only when those references change the problem-card move. It does not promote those references into local kinds or claims outside C.22.2.
Problem, Task, Method, Work, and Result Split
ProblemCard@Context remains usable while the method is unknown, contested, not yet selected, or not yet specific enough for downstream work. A known method does not by itself make the problem ready: if the proposed method is known but the problem signal, scope, acceptance probe, or EntityOfConcern remains unstable, C.22.2 remains current. If both the problem representation and the method are already accepted and the remaining question is planned execution, apply A.15. The card may carry method-family cues and reasons for method search, but it does not present downstream work as already known task execution.
Use this split:
Transition condition: ProblemCard@Context may prepare a candidate ProblemProfile, bind an existing ProblemProfile, emit a candidate TaskSignature, or bind a TaskSignature only when P2W or selector readiness is declared. If several downstream signatures remain plausible, keep them as candidate signatures instead of binding one chosen TaskSignature. When the issue under repair becomes method-family selection, selected method, planned work, performed work, result record, or result measurement, apply the governing FPF pattern for that claim; do not expand the card.
Relation to C.22
C.22 remains the foundation for ProblemProfile, TaskKind, TaskFamilyRef, and TaskSignature. ProblemCard@Context is earlier and more explicit: it explains why this problem, under this context, is usable for P2W, search, comparison, characterization, refresh, retirement, or governing-pattern application.
A ProblemCard@Context may prepare a candidate ProblemProfile, bind an existing ProblemProfile, emit a candidate TaskSignature, or bind a TaskSignature only when P2W or selector readiness is declared. If several downstream signatures remain plausible, keep them as candidate signatures instead of binding one chosen TaskSignature.
This relation does not move problem-card field detail into TaskSignature. TaskSignature stays minimal for eligibility, acceptance, and selection. Downstream method, work, result, evidence, gate, autonomy, archive, portfolio, and selected-set claims remain with their governing patterns.
Characterization, Indicators, and Comparability
ProblemCard@Context states either a recoverable characterization relation and comparability or parity relation, or an explicit current reason why the problem can proceed without one.
The heavy content stays with existing FPF patterns:
C.16carries measurement characterization, backing, and comparability discipline;A.19carries characteristic, scale, unit, polarity, and indicator-use discipline;C.25carries Q-bundles and quality-like multi-characteristic bundles;G.9carries parity, comparison-window, comparator, budget, unit, repeatability, and reproducibility pins;G.0carries comparison-frame and CG-Spec governance;G.4carries acceptance clauses and threshold predicates;G.5governs selected-set publication when the problem enters a selected set.
Missing characterization or parity relation is a current disposition. The record applies the characterization, parity, search, or pool pattern when that relation is current instead of pretending the problem is ready for P2W.
The C.22.2 candidate acceptance criterion separates functional check, constraint compliance, risk or safety boundary, parity or comparison relation, and freshness window when those relations are current. Comparison frame, CG-Spec, or comparability governance is governed by G.0. Acceptance clauses and acceptance threshold predicates apply G.4; C.22.2 may name only the needed relation, cue, or reference. Passing a test, improving one observed indicator value, or naming an acceptance phrase is not by itself sufficient for P2W use.
Source Record-Form Recovery
Source record names are recovered by use, not by label shape. This section prevents source prose from becoming local C.22.2 subobjects.
The repair rule is short: if the source form supplies problem-side material, copy the material into the card's current fields. If it supplies another FPF-governed claim, keep only the local cue and apply the pattern that governs that claim.
Portfolio, Archive, and Set-Return Treatment
Archive, portfolio, pool, front, shortlist, selected-set, and set-return material remain source and set cues for the current problem-side record. ProblemCard@Context preserves setContextRef, source-set kind, selection or retention criterion, and the non-scalar next move when current; portfolio and archive governance stays with the named governing patterns and does not become a local problem-card kind.
Archive, portfolio, palette, front, shortlist, ranked shortlist, selected set, LivePool, and set-return material remain current source distinctions, but their current FPF governing patterns are already available:
A singleton problem card is the degenerate case. If it came from a portfolio, front, archive, or pool, the selected problem remains traceable through setContextRef: the lightweight reference to the source set kind, source reference, selection or retention criterion, budget or window, review cadence, and pattern reference named by value when current. setContextRef is a reference field, not a new SetContext kind and not a downstream claim carrier.
setContextRef preserves the recoverable source-set form when current: Palette, Front, Archive, ExplorationArchive, Shortlist, RankedShortlist, SelectedSet, LivePool, or another accepted source-set form. If the source-set form is not recoverable, the card may keep a source cue, but it does not claim selected-set readiness or archive-derived readiness.
When multiple plausible problem formulations remain current, C.22.2 does not bind one TaskSignature prematurely. Each optional rivalProblemFormulationRef states the rival formulation, EntityOfConcern, context, preserved concern, lost concern, reason not selected yet, and next discrimination move. It is not a CG-Frame, not the E.8 Problem Frame, and not a representation-frame kind.
The next discrimination move may be to characterize, compare, retarget, reopen the source, choose a local problem formulation, or apply the relation-bearing pattern. Reframing is triggered when context grounding, EntityOfConcern, viewpoint, scope cut, or cause-theory cue changes the problem representation enough that readiness or use-boundary cannot be inherited by wording continuity.
Goldilocks and Set-Return Docking
Goldilocks problem selection is the problem-side adaptation of the current NQD, OEE, and set-return family. It is not direct QD or OEE vocabulary import, not a new scalar readiness doctrine, not a local QD or OEE vocabulary, and not a single score. C.22.2 does not mint GoldilocksProblem, GoldilocksScore, GoldilocksReadiness, or any equivalent local kind; Goldilocks remains a readiness and selection interpretation carried by current governing patterns.
A Goldilocks, stepping-stone, or archive-derived problem is represented as source context or set context, selection or retention criterion, and current next move, not as problem difficulty, priority, or readiness score.
ProblemCard@Context carries only the problem-side readiness fields and relation references:
- source set kind when archive, pool, front, shortlist, selected set, or portfolio language is current;
- solvability band;
- characteristic-space, declared problem-side characteristic descriptor, or Q-bundle relation;
- declared difference criterion when novelty or diversity is claimed, or apply the governing characterization or comparison pattern;
- non-scalar trade-off, dominance, partial-order, or set-return relation when that relation is being made;
- measurability or explicit unknown handling;
- reversibility or containment for safe probing when current;
- stepping-stone option value when retention matters;
- expiry or refresh condition;
- selected-set, archive, pool, front, or parity relation when that relation is being made.
The local solvability band label means a context-bound, non-scalar interpretation of feasible-but-not-trivial fit under current capability, constraints, validation boundary, and optional set-return relation. It is not a universal difficulty claim, not a hidden readiness scale, and not a single-score ranking.
If the band cannot be tied to a characteristic, Q-bundle, comparison, retention, or capability-context cue, treat Goldilocks wording as informal recognition only and bind any selection, set-return, or parity claim to the governing FPF pattern for that claim.
The current governing family is C.18, C.19, G.5, G.9, G.11, A.6.P:7a, and C.16.Q. The relation to C.22:14 is a role and timing relation inside the same family: C.22.2 uses the family before P2W, while C.22:14 uses it downstream when candidate solutions for a TaskKind make TaskSignature informative.
Structure Cue That Improves Formulation
C.29 carries mathematical-lens use for first-principles or mathematical structure cues used by ProblemCard@Context.
firstPrinciplesCue is a local cue label for a formulation-changing structure and a cue to apply C.29; it is not a local mathematical-lens kind or a substitute for a C.29 lens-use result.
The problem card may ask whether a first-principles or mathematical structure helps find or improve the problem formulation, not only whether an already-mentioned mathematical expression helps the problem formulation. Useful cues include state space, graph, boundary, topology, symmetry, invariant, variational or constrained-optimization structure, probability or information structure, resource bound, obstruction, scale window, composition, or coarse-graining choice.
The practitioner move is:
State the structure that improves the problem formulation, the preserved structure, the lost structure, the practical payoff, the problem-formulation next-move reason, and the stop condition.
Distribution by principles:
When no useful mathematical structure survives, record that absence and proceed without forcing mathematical prose into the problem card.
Validation, Reliance, AI-Agent Cues, and Safe Probing
ProblemCard@Context exposes three local fields for downstream use:
- problem-formulation next-move reason: why this formulation is worth keeping, reviewing, discriminating, or moving onward now;
- validation boundary: what has been checked for the current next move, what may be used now, and which use is governed by another pattern;
- risk condition: the monitored risk, cost-of-error concern, or containment concern that may change the safe next move.
Use these fields to state a local reliance disposition, not to authorize downstream action.
Cause-theory cues may focus problem formulation inside ProblemCard@Context. Association, intervention, counterfactual, responsibility, expected-effect, or causal-evidence claims are governed by C.28 plus evidence, provenance, or assurance patterns when those claims are being made.
Environment design and safe probing may appear as source signal reference, validation boundary, risk condition, or governing-pattern cue. If the next move can affect a controlled EntityOfConcern, the card names the probe need plus the claim kind named by value that blocks local action; it does not authorize the probe locally.
Freshness, Expiry, and Unknown Handling
C.22.2 includes a section-local state and disposition vocabulary for ProblemCard@Context; this vocabulary is not a new FPF kind. These labels describe the card's current governed use; they are not required states in a transition sequence, event kinds, or gate records. The local labels are:
Freshness names the affected locus: problem signal, context, characterization or parity relation, problem-formulation reason or source, set-source reference, representation relation, or wording-use relation. For the problem-signal locus, ask whether the original signal is still present, recurring, solved, absorbed, duplicate, unnecessary, or no longer worth downstream work. For context, ask whether the local context or scope cut has changed enough to alter the formulation. For characterization or parity, ask whether measurement, comparison, and parity relations are current enough for the intended next move. For problem-formulation reason or source, ask whether cited sources, provenance, stated reason references, and source references are fresh enough for the problem-formulation next-move reason. For set-source reference, ask whether archive, front, pool, shortlist, or selected-set membership and the selection or retention criterion are still current. For representation relation or wording-use relation, ask whether wording, diagram, functional description, transformation-flow path, bridge, retargeting, or representation change alters the EntityOfConcern, use-boundary inheritance, context grounding, viewpoint or role concern, scope cut, comparison relation, governed next move, or relation needed for inheritance.
A stale source or evidence reference does not always retire the problem; it may require refresh while the problem remains reviewable. A stale problem signal may lead to refresh, retire, archive, abstain or no-change, or a governing-pattern cue for the claim, relation, or boundary that is checked.
Freshness or expiry failure is a current disposition. A stale or unknown-bearing problem card may remain reviewable as a problem-side record, but it does not become P2W-ready unless freshness and unknown handling permit the intended downstream move. A stale problem card does not silently remain usable as P2W input.
When freshness, expiry, or unknown handling fails, choose one of these current dispositions:
- refresh the problem card or its characterization or comparison relation under
G.11,C.16,A.19,C.25, orG.9; - retire or deprecate the problem-side record under the relevant archive, pool, selected-set, or refresh pattern;
- continue only as explicitly governed bounded-risk use under the governing pattern for the claim being made, relation, or boundary.
Unknown-handling fields state whether they permit use, require degraded use, abstention, or sandbox treatment, or make the current problem formulation blocked. No P2W, no change, or abstain-for-now may be a successful next move when the signal is stale, duplicate, already solved, already absorbed, unnecessary, or not currently worth downstream work. Before ProblemCard@Context emits or binds TaskSignature, it checks whether the problem signal is still present and whether prior work has already solved or removed the problem.
Representation and Wording-Use Relation Continuity
C.22.2 names A.6.3.RT, A.6.4, E.17, F.9, E.18, and E.10 only when changed problem formulations, diagrams, functional descriptions, transformation-flow paths, wording, or PathSlice examples carry a current representation, bridge, retargeting, structural-reinterpretation, or wording-use claim. The card may preserve the local cue, reference, or problem-formulation next-move reason, but it does not prove continuity or use-boundary inheritance by wording similarity.
Framing is not wording repair. A framing change applies when EntityOfConcern, context grounding, scope cut, viewpoint, comparison relation, use-boundary inheritance, or honest next move changes. Wording-use repair is current only when wording, diagram, functional description, transformation-flow path, bridge, retargeting, or representation change alters the carried problem-side representation, EntityOfConcern, use-boundary inheritance, context grounding, viewpoint or role concern, scope cut, comparison relation, governed next move, or governing-pattern cue. Ordinary wording cleanup does not trigger a representation-continuity relation and does not block a Thin ProblemCard@Context.
C.22.2 may not treat changed-problem examples as governed relations unless the appropriate accepted FPF relation is named.
Source and P2W Carry-Forward
The source presentation is not compressed into a generic problem-card summary. The following source details become carry-forward constraints for C.22.2 use and for the P2W-facing relation from C.22.2.
This carry-forward preserves detail, not broader scope. C.22.2 remains the problem-side output; P2W uses it with enough source cues and project-side references to select method families, plans, performed work, and result measurement without making the problem card a P2W pattern.
SoTA Decision-Use Source Material
The following external anchors are adopted or adapted only where they change this pattern's local answer by value.
If a C.22.2 use carries a wider external claim than these dispositions, the claim is outside this pattern and requires a separate content decision or demotion to a non-FPF-governed example.
Each FPF-governed SoTA use is recovered as a local test: source idea, FPF invariant, practitioner check, and popular shortcut rejected. A source citation without that local test is not enough to carry pattern use.
Local SoTA-to-action tests:
Rationale
ProblemCard@Context gives the practitioner one compact problem-side record between vague problem talk and downstream P2W. The card is useful because it is light enough for ordinary use and specific enough to show when comparison, characterization, evidence, selection, mathematical-lens use, method, work, gate, autonomy, bridge, representation transition, or refresh requires another FPF pattern.
The card gives the practitioner one thing to write, inspect, and challenge. A practitioner can see whether a problem is ready without first assembling the problem-side record from TaskSignature, Q-bundle, parity report, evidence note, selected-set output, and refresh record. Claims beyond the problem-side record stay with their governing patterns.
The archive and portfolio distinctions remain current when they matter because the card preserves setContextRef and names the governing pattern for any current set, archive, or portfolio claim. Changed problem formulations, diagrams, functional descriptions, or transformation-flow path interpretations require the accepted representation or retargeting relations before a local cue or readiness disposition is reused. Current SoTA and first-principles cues matter only when they change fields, relation references, boundaries, or the problem formulation itself.
Problem-Card Use Invariants
Misuse Modes and Repairs
Use-Quality Checks
These checks protect the card's practical use; they do not add fields.
Worked Slices and Anti-Cases
Five-Case Worked Slices
Compact P2W-ready Disposition Slice
A support team sees repeated failed hand-offs after a new interface policy. The incoming request says "rewrite the escalation workflow." A conforming ProblemCard@Context first repairs the problem-side record instead of accepting the work-shaped request.
The P2W export is narrow: accepted problem-side material, context grounding, improvement check, validation boundary, freshness condition, and governing-pattern cues. If the improvement check or acceptance probe is missing, the card stays reviewable-only or source-finding and cannot claim P2W-ready. If the next user wants evidence sufficiency, a gate decision, work authorization, or selected method, the card preserves the cue and the corresponding governing pattern carries that later claim.
Anti-Cases
Machine-Assisted Drafting Boundary
Machine-assisted ProblemCard@Context drafting is only a drafting aid. Before the draft is used for P2W or selector-facing work, a practitioner checks the card's local fields and any governing-pattern cues for claims outside C.22.2.
Required practitioner checks for a machine-assisted draft:
- source signal;
- improvement check or acceptance probe;
- problem-formulation next-move reason;
- unknown handling;
- freshness or expiry disposition;
- governing-pattern cues for claims being made, relations, or boundaries outside
C.22.2.
First Practical Entry Aid
This section is a discoverability aid only. It helps a practitioner or assistant find a candidate pattern; it does not prescribe a transition sequence and does not require opening C.22.2 for every problem-sounding text.
These likely practitioner entry phrases point to C.22.2:
- "We have a problem, but it is not yet clear what work should be done."
- "This looks like a ticket, but I am not sure the problem is stated."
- "A signal or anomaly keeps recurring before method selection."
- "We selected this candidate from a front, archive, pool, or selected set, but need to state why it is a problem now."
- "P2W would otherwise use 'implement X' as if it were reviewable problem-side output."
- "There is a symptom, but we do not yet know what to solve."
- "We need to know whether this problem is ready for P2W or should apply another pattern."
Direct-entry cues that are not C.22.2:
- accepted method or work planning: use
A.15; - proof, provenance, reliability, or assurance claim: use
A.10,G.6, orB.3; - local choice among explicit options: use
C.11, orG.5when set publication or selected-set semantics are current; - agent tool-call, gate, or autonomy claim: use
C.24,E.16, orA.21;ProblemCard@Contextmay only name the problem-side cue or relation named by value; - ordinary discussion with no downstream project-side move: no
C.22.2use.
First-use Thin-card test:
Given a messy signal, a practitioner can produce a Thin ProblemCard@Context in under one page and correctly choose one governed next move: P2W-ready, characterize, compare or parity, search or pool, refresh, retire, abstainOrNoChange, or apply the FPF pattern that governs the claim being made, relation, or boundary outside the card.
Entry relation:
The entry relation is local: C.22.2 is introduced under C.22, and C.22 names the ProblemCard@Context relation. The C.22.2 body carries the Problem frame, first-entry phrases, tempting-wrong-pattern boundaries, and first-use Thin-card test needed for ordinary discovery.
Downstream Cue Export
ProblemCard@Context exports problem-side material, not a claim over downstream use.
The compact export fields are:
- problem signal and context grounding;
- EntityOfConcern and scope cut when they change the move;
- improvement check or acceptance probe;
- readiness disposition: reviewable-only,
P2W-ready, no-work orabstainOrNoChange, refresh, retire, archive, or governing-pattern application cue; - source-set or representation relation reference when current;
- problem-formulation next-move reason and validation boundary when P2W relies on the card.
For P2W carry-through, use E.18.1 with the accepted problem-side material and the current relation named by the card. For selector-facing readiness and candidate TaskSignature relation, use C.22. For selected-set or search cues, use G.5 only when that relation is current. For work need, use the A.15 family only after work planning, performed work, or work-relevant source restoration is current. For any other claim being made, apply the pattern that governs it; do not treat the whole card as carrying that claim.
Consequences
Benefits
- FPF gains a clear problem-side output for problematization as the input P2W can use.
- P2W uses a typed problem-side record rather than a slogan, ticket-shaped wish, or preselected method.
C.22.2has practical value for FPF when it reduces at least one expensive failure: a wish enters P2W asTaskSignature; a preselected work request is treated as the problem; method selection happens before the problem is reviewable; a problem from a set losessetContextRef; an indicator is used without a declared indicator-use relation; problem-formulation next-move reason is cited as proof; a stale problem remains active; scalar readiness replaces set-return; or the problem-formulation next-move reason is inherited across a changed representation without the governing representation-continuity or wording-use relation.- Current archive, pool, front, shortlist, set-return, parity, refresh, evidence, and
C.29patterns are reused instead of duplicated. - The positive role of mathematical and first-principles thinking is preserved: it can find missing structure, not only check already-written mathematics.
- Characterization and parity are no longer optional background when they are prerequisites for problem reviewability.
- Representation-change relations are handled through named relation references rather than local proof inside the problem card.
Costs of Use
- A
ProblemCard@Contextadds a small writing step before P2W. The cost is justified only when the signal is not yet reviewable before downstream use. - The practitioner keeps the card small: preserve the split between problem, task, method, work, and result; keep
TaskSignatureminimal; and add conditional fields only when their relation is current. - For problems emitted from archives, pools, fronts, selected sets, or portfolios, the practitioner preserves
setContextRefor the set-source relation without turning the card into a portfolio, archive, selected-set, or work-planning carrier. - External or source-local terms may guide recognition only when they change a concrete boundary, field, relation, or validation requirement. Otherwise they remain examples or source cues.
Relations
- Builds on:
E.2,E.9,E.10,C.2.P,A.6.P,C.16.Q,C.16,A.19,C.22,C.25,C.29,G.5,G.9,A.6.3.RT, andA.6.4. - Coordinates with:
C.11,C.18,C.19,C.22.1,A.15,A.21,E.16,G.6,G.11,A.10,B.3,E.17,E.17.ID.CR,A.6.3,F.9,E.18, andE.18.1.
C.22.2:End
MethodFamily Evidence & Maturity (Method‑SoS‑LOG)
LOG (logic) for deductive shells for admissibility First use expansion: SoS‑LOG = Science‑of‑Science LOG (LEX short‑form discipline applied).
RegistrationContext. For this pattern, RegistrationContext means the U.BoundedContext where a MethodFamily is registered (LEX D.CTX).
Builds on. G.5 (MethodFamily registry/selector), G.4 (Acceptance & EvidenceProfiles), C.22 (TaskSignature S2), C.18 NQD‑CAL (QD/illumination), C.19 E/E‑LOG (emitters/policies), B.3 (Assurance lanes & R_eff), A.10 (Evidence Graph Ref), E.10 (LEX), E.18 (GateCrossing / CrossingBundle visibility). Coordinates with. G.6 (EvidenceGraph), G.8 (LOG bundling), G.9 (Parity), G.11 (Refresh).
Problem frame
Families of methods compete inside a CG‑Frame. The selector (G.5) must admit, degrade, or abstain per family without universal scores, using typed problem descriptors and auditable evidence. Maturity of a family (how far it has travelled from “clever idea” to “run‑safe”) must be visible to LOG rules yet separate from thresholds (which live only in AcceptanceClauses, G.4).
Problem
Unstructured “readiness” stories and undisciplined evidence lead to:
- (i) Illicit scalarisation across mixed scale types,
- (ii) Prose‑only gating that a dispatcher cannot execute,
- (iii) Cross‑Context reuse without Bridges/CL, and
- (iv) Immature families leaking into production.
We need a notation‑independent LOG layer that turns TaskSignature (S2) + EvidenceProfiles into executable rules for admit / degrade / abstain, routing any CL penalties to
R_effonly (never mutating F/G).
Forces
- Pluralism vs. dispatchability. Competing Traditions expose different invariants; selection must compare without semantic flattening.
- Maturity vs. opportunity. Open‑ended exploration (E/E‑LOG) must coexist with run‑safe exploitation; immature ≠ forbidden → provide safe degrade paths.
- Unknowns (tri‑state). Missing or
unknownS2 fields must propagate explicitly to degrade/abstain/sandbox; no silent coercions. - Lexical discipline. Head‑anchoring, EntityOfConcern / Description / specification-use separation, Bridge hygiene; no tool names in Core.
Solution — Method‑SoS‑LOG: deductive shells over Eligibility & Evidence
Objects & heads (LEX/I‑D‑S)
Tech heads; Plain twins are published via UTS.
MethodFamily (registered in G.5) carries Eligibility and artefact identity; MaturityCard (this pattern) carries evidence‑aware maturity; SoS‑LOG.Rule (this pattern) is an executable rule schema that returns one of {Admit | Degrade(mode) | Abstain} for a (TaskSignature, MethodFamily) pair. Descriptions live as …Description; when harnessed they become …Spec.
Rule schema (normative)
For each MethodFamily f, author an executable rule set:
with the following branch obligations:
R0 — CG‑Spec gate (precondition, RegistrationContext). Before R1–R3, verify CG‑Spec.MinimalEvidence for every CHR characteristic referenced by f’s Acceptance/Flows in the registered U.BoundedContext; failure ⇒ Abstain with reasons (no silent sandbox). Publish the CG‑Spec ids consulted.
Rationale: selector legality requires the CG‑Spec gate to be explicit, not implicit in prose. Publish associated ReferencePlane notes alongside the consulted ids.
R0.QD — QD/OEE pre‑gates (if applicable). If S2 declares BehaviorSpaceRef/ArchiveConfig/EmitterPolicyRef or PortfolioMode=Archive, verify:
(i) CharacteristicSpaceRef characteristics are CHR‑typed, d≥2, ReferencePlane per characteristic declared;
(ii) ArchiveConfig is lawful (topology, resolution, K>0, InsertionPolicyRef, DistanceDef with edition id and declared metric/pseudometric status);
(iii) EmitterPolicyRef present (with edition id);
(iv) DominanceRegime present; if absent, default= ParetoOnly.
Failure of any ⇒ Abstain with reasons.
R1 — Admit. Admit IFF
(a) S2 satisfies Eligibility predicates of f (tri‑state aware),
(b) EvidenceProfile minima referenced by Acceptance/Flows for f are met (lanes/anchors/freshness) in the registered U.BoundedContext (post R0),
(c) all relevant CAL.AcceptanceClauses (G.4) evaluate to true under lawful CHR comparisons,
(d) any maturity gating (e.g., a floor on Maturity rungs) is expressed as an AcceptanceClause and referenced here by id (no thresholds inside LOG).
LOG never sets thresholds; it only executes and cites Acceptance verdicts.
R2 — Degrade. If (a) holds but (b) or (c) is partially satisfied or unknown, return Degrade(mode) where mode ∈ {scope‑narrow | sandbox | probe‑only} and emit scope notes (USM Scope(G), Γ_time). Record which S2 unknowns or Evidence minima caused the degrade. LOG‑Degrade never changes CHR scales or planes; it narrows Scope (G) or execution mode.
Note (CAL vs LOG). CAL‑level degrade.order (fall‑back to order‑only comparisons) is governed by G.4/CG‑Spec and is not a LOG mode. SoS‑LOG never overrides CAL outcomes; a LOG branch only narrows Scope(G) or execution mode (e.g., sandbox, probe‑only), it does not alter CHR scales or admissible orders.
probe‑only MUST cite an E/E‑LOG policy id (exploration budget) and Acceptance‑bound guards.
R3 — Abstain. If S2 violates Eligibility or R0 fails, return Abstain (with reasons). Abstain is mandatory on illegal CHR operations (e.g., ordinal means) and when Bridge/CL requirements are unmet.
R4 — CL routing. Any cross-Context or cross-plane reuse must cite Bridge ids (with loss notes). Apply Φ(CL) and (if planes differ) Φ_plane that are monotone, bounded, table‑backed; publish policy‑ids in the SCR; penalties reduce R_eff only; F/G must remain invariant.
R5 — Proof hooks. Every branch MUST cite Evidence Graph Ref (A.10), lane tags (TA/VA/LA), freshness windows, and (if bridged) Bridge ids + loss notes; the decision is SCR‑visible. When G.6 EvidenceGraph is present, also publish EvidenceGraph path id(s) for the branch (admit/degrade/abstain). No self‑evidence.
R6 — QD archive / PortfolioMode semantics (if applicable). If PortfolioMode=Archive, Admit may return a QD archive (per ArchiveConfig) instead of only a Pareto set. Unless CAL authorises DominanceRegime=ParetoPlusIllumination (policy‑id recorded in SCR), IlluminationSummary is a report‑only telemetry summary and any coverage/regret are telemetry metrics (reported) that do not affect dominance.
R7 — GeneratorFamily branches (open‑ended). If S2 includes GeneratorIntent, SoS‑LOG MUST:
(i) verify EnvironmentValidityRegion is declared and lawful;
(ii) verify TransferRulesRef exists; if unknown ⇒ Degrade(scope‑narrow) or Abstain per family policy;
(iii) treat the selection surface as pairs {environment, method}; publish coverage/regret and IlluminationSummary as report‑only telemetry (IlluminationSummary = telemetry summary; coverage/regret = telemetry metrics); dominance participation per R6.
R8 — Telemetry & Refresh hooks. On any illumination increase or archive change, publish edition increments for CharacteristicSpaceRef/DistanceDefRef and the policy‑id (Emitter/Acceptance) that caused the change; expose PathSliceId for refresh/decay in SCR.
Aphorism. “Admit on admissibility and sufficiency; degrade on uncertainty; abstain on inadmissibility.”
Maturity ladder (poset, not a scalar; Description, not Spec)
Publish a MethodFamily.MaturityCardDescription@Context (UTS enum ids; Scale kind = ordinal; ReferencePlane declared). Do not embed thresholds here; any maturity floors used for admission are authored as G.4 AcceptanceClause and referenced by id from R1.
- L0 — Anecdotal. Claims exist; lanes sparse; examples ad‑hoc.
- L1 — Worked‑Examples. Multiple worked examples with lane tags and Scope slices declared; no replication yet.
- L2 — Replicated. Independent replication(s) in distinct Context slices (publish D.CTX + UTS rows), lane separation observed, decay windows explicit.
- L3 — Benchmark‑Severe. Repeated wins or parity on community baselines or severe tests; cross‑Tradition bridges declared with loss notes.
Optional rung (for QD/OEE‑heavy families; ordinal, closed enum):
- L4 — QD‑Hardened. Archive stability under declared InsertionPolicy/DistanceDef editions; reproducible IlluminationSummary improvements under controlled budgets; OEE generators pass EnvironmentValidityRegion severe tests.
Norms. M1. The ladder is lane‑aware (TA/VA/LA) and freshness‑aware; it is not a global numeric score. Declare Scale kind=ordinal and the closed enumeration of rungs; register the enum at UTS (twin labels; editioned). M2. Transitions MUST be justified by EvidenceGraph paths (once G.6 is available) and UTS publication; missing anchors ⇒ no advance. M3. Any maturity floor used for admission (e.g., “run‑critical Context requires ≥L2”) MUST be authored as a CAL.AcceptanceClause and referenced by id from R1; SoS‑LOG does not embed thresholds. M4. Declare ReferencePlane for the MaturityCard; on ReferencePlane crossings apply published Φ_plane policy (penalty to R_eff only), with Bridge id and loss notes.
Rationale note. Treating maturity as a poset aligns with B.3’s lane calculus and avoids scalarisation across ordinal/ratio scales; assurance penalties remain on R, never F/G.
Unknowns & Shift classes (tri‑state discipline)
U1. (LEX). Enumerations for Degrade(mode) and Maturity rungs MUST be declared as closed value sets and registered at UTS (twin labels). Lexical SD (E.10) applies.
U2. Every S2 field is tri‑state; unknown MUST map to a branch (Degrade or Abstain) declared on the family (no coercions). Each branch publishes a branch‑id and (where used) a mode from a closed enum registered at UTS (LEX enum clarity).
U3. ShiftClass semantics follow C.22. If ShiftClass ∈ {covariate‑shift, concept‑drift, adversarial} or unknown, default outcome is Degrade(scope‑narrow) unless a CAL.AcceptanceClause explicitly guards the regime.
Publication & wiring
W1. Each family publishes a MaturityCardDescription@Context (UTS twin labels; ReferencePlane declared) and registers SoS‑LOG rule ids; editions are versioned and RSCR‑tested for branch‑coverage (Admit/Degrade/Abstain, unknown paths). Φ(CL)/Φ_plane policy‑ids must be present in SCR where applicable.
W2. Admissibility Ledger. Publish an AdmissibilityLedger@Context: rows = (MethodFamilyId, RuleId, MaturityRung, BranchIds, BridgeIds, ΦPolicyIds, EvidenceGraphPathIds?, DominanceRegime, PortfolioMode, Edition), UTS‑registered; this ledger is the selector‑facing export.
W3. Strategy token. Do not mint a U.Type “Strategy”; strategy remains a composition inside G.5 (Compose) under E/E‑LOG.
W4. Selector (G.5) consumes these rules; results appear in the Dispatcher Report with reasons in/out and cited anchors/bridges.
Archetypal Grounding (Tell–Show–Show)
(Plain register for pedagogy; Core remains notation‑independent per E.10/E.8.)
Show‑1 - Continuous dynamics (ODE task).
S2 excerpt. DataShape=ODE; stiff?=unknown; Size≈10^3; Objective={↓error@ratio, ↑throughput@ratio}; Constraints={safety_gate@ordinal}; Jacobian_sparsity=high; Missingness=MAR.
Families. Implicit‑BDF vs Explicit‑RK vs Symplectic.
Rules.
— Implicit‑BDF: Eligibility tolerates stiff?=unknown if Jacobian_sparsity=high (guarded precondition); MaturityCard=L3 (replicated & benchmarked). Outcome: Admit.
— Explicit‑RK: requires stiff?=false; with unknown ⇒ Degrade(sandbox) (probe).
— Symplectic: eligible only when Hamiltonian=true; here ⇒ Abstain.
Didactic anchor. This mirrors C.22’s typed‑signature discipline and CHR legality (no ordinal means; unit alignment for ratio).
Contemporary ecosystem examples of these families (post‑2015) are organised in DifferentialEquations.jl, which exposes multiple solver families under one call surface—precisely the pattern G.5 expects. (Journal of Open Research Software)
Show‑2 - Planning/scheduling (MIP task).
S2 excerpt. DataShape=MIP; NoiseModel=deterministic; Objective={↓cost@ratio, ↑service_level@ordinal}; Size≈10^5 vars; convex_relaxation=available.
Families. MILP (branch‑and‑bound), Constraint‑Programming, Heuristic meta‑search.
Rules.
— MILP: Eligibility requires convex_relaxation=available; MaturityCard=L3 in the registered U.BoundedContext ⇒ Admit.
— Constraint‑Programming: MaturityCard=L2; Acceptance demands service_level≥B (ordinal predicate). With B met but baseline parity unknown ⇒ Degrade(scope‑narrow).
— Heuristic meta‑search: MaturityCard=L1 ⇒ Degrade(sandbox) or Abstain depending on RSCR parity policy.
Didactic anchor. Selector returns a Pareto set (no cross‑ordinal weighting), as required by G.5.
Contemporary “single call / many solvers” packaging that motivates MethodFamily rows is exemplified by JuMP (2017–2022), which cleanly separates model description from solver choice. (Miles Lubin)
— DifferentialEquations.jl illustrates family‑based solver packaging (multi‑method under one interface), 2017–2024 ecosystem. (Journal of Open Research Software) — JuMP illustrates model/solver separation and registry‑like selection (2021–2022 papers, site). (Miles Lubin) — Science of Science review (2018) supports the emphasis on replication/benchmarks in maturity assessment. (Science)
Show‑3 - QD archive (policy search).
S2 excerpt. PortfolioMode=Archive; CharacteristicSpaceRef(d=2); ArchiveConfig(CVT, res=1k cells, K=1, DistanceDefRef.edition=v2, InsertionPolicyRef=dyn‑elite); EmitterPolicyRef=v3; DominanceRegime=ParetoOnly.
Rules. Admit returns an archive; illumination reported; changes to DistanceDef/Emitter editioned in SCR; dominance remains ParetoOnly.
Show‑4 - Open‑ended GeneratorFamily (POET‑class).
S2 excerpt. GeneratorIntent{GeneratorFamilyRef=GF‑01, EnvironmentValidityRegion=EVR‑A, TransferRulesRef=TR‑A, CoverageMetric=…}; PortfolioMode=Archive.
Rules. Admit yields declared sets over {environment, method}; Degrade(scope‑narrow) if TransferRules=unknown; telemetry publishes coverage/regret and IlluminationSummary with edition/policy‑id on improvements.
Bias‑Annotation
Principle‑taxonomy lenses. Universality (trans‑discipline), Didactic primacy (Tell–Show–Show), Open‑ended evolution (refresh‑ready), Lexical firewall (no tool names in Core), Notation independence. Limits: Worked examples reference widely‑used ecosystems in Plain register only.
Conformance Checklist (normative)
Consequences
- Explainable admission. Every Admit/Degrade/Abstain is backed by anchored evidence and explicit unknown handling (selector reports are SCR‑linked).
- Run‑safe pluralism. Multiple families can co‑exist with policy‑governed exploration (E/E‑LOG) and maturity‑aware gating.
- Portable governance. Bridge hygiene and CL routing make cross‑Tradition reuse deliberate and costed (penalties to R only).
Rationale
The ladder and LOG shells align with FPF’s Assurance calculus: F (form) is governed by artefact kind, G (scope) by USM slices, and R (reliability) accumulates via WLNK then Φ(CL) penalties. Treating maturity as evidence‑typed rungs—rather than a “score”—avoids illegal arithmetic and lets DesignRunTag values remain separate via DesignRunTag discipline (A.4) and explicit GateCrossings. This mirrors contemporary science‑of‑science insights: replication, benchmarking, and field health indicators are the currency of maturity, not anecdote. (Science)
Relations
Builds on: G.5 (selector consumes these rules), G.4 (Acceptance & EvidenceProfiles), C.22 (S2 typing), C.18 NQD‑CAL, C.19 E/E‑LOG, B.3 (Assurance tuple & WLNK). Publishes to: UTS (MaturityCards, rule ids), SCR/RSCR (branch coverage; parity hooks). Constrains: G.8 (LOG Bundling must cite MaturityCards), G.9 (parity harness draws baselines per rung), G.11 (refresh windows per rung & decay), G.5 (Open‑Ended Family mode for GeneratorFamily). Outcome. The pattern introduces new content (LOG shells + maturity poset + degrade modes + publication Standard) and does not duplicate CG‑Spec legality rules, CHR guard‑macros, or CAL acceptance mechanics; it integrates them into admissibility logic for MethodFamilies.
C.23:End
Agentic Tool-Use and Call Planning (C.Agent-Tools-CAL)
Type: Calculus (C) Status: Stable Normativity: Normative
Plain-name. Agentic tool-use and call planning.
Intent. Govern admissible tool-call planning and replanning under explicit budget, assurance, and policy while keeping upstream choice, pool policy, planning, and execution distinct.
Instantiates and refines Pillars. E.2 P-3 Scalable Formality, P-7 Pragmatic Utility, P-10 Open-Ended Evolution, P-11 SoTA Alignment, and the Bitter-Lesson Preference: prefer scalable, general methods that benefit from more data or compute over fragile hand-tuned heuristics when assurance and cost stay comparable.
Depends on. A-kernel (A.1–A.15) for holonic basics and Role-Method-Work separation; B.3 Trust & Assurance (F–G–R with CL penalties); E.3/E.5 (precedence and Guard-Rails); C.5 Resrc-CAL; C.18 NQD-CAL (candidate generation and declared set results); C.19 E/E-LOG (explore-exploit policies); optional Compose-CAL and KD-CAL where available.
Coordinates with. U.WorkPlan and U.PromiseContent bindings (acceptance gates), Working-Model publication discipline per B.3, and evidence or provenance (G.6).
Use this when
- one concrete choice result already exists and the next task is now how to plan, gate, sequence, and replan tool calls admissibly
- the next admissible output should be one enactment-facing
CallPlanor oneCheckpointReturn, not one more local choice result or pool-policy result - budget, assurance, and stop conditions must be visible before calls are burned
What goes wrong if missed
- calls get scheduled by ad-hoc heuristics, so the plan cannot say which budget is being burned or what event should stop or replan execution
- planning quietly collapses into execution, or execution quietly inherits unresolved upstream choice and pool-policy questions
- a successful probe is mistaken for committed rollout even though the commit trigger was never made explicit
What this buys
- one tool-agnostic planning record for admissible calls, budgets, stop conditions, and replan triggers
- one explicit enactment record with objective, budget, stop conditions, and next move
- one replayable call graph and assurance record instead of one opaque chain of tool invocations
First-minute questions
- Has one choice result already been fixed, with the accepted decision material named, so that planning may begin now?
- Which budget is being burned now: enactment budget, tool-call budget, or still one upstream probe budget?
- What event stops or replans the route?
- Is the next admissible output one
CallPlan, oneCheckpointReturn, or a neighbouring-pattern exit?
First output
The first useful output is either one enactment-facing CallPlan with the current objective, cited route descriptions, the planned budget envelope, the stop or replan condition, and the next move stated explicitly in one place, or one bounded CheckpointReturn with the current objective or task family, the burned and residual actual budget, the commit trigger, and the recommended next action stated explicitly in one place.
If that first output still cannot be written honestly, the current planning result is not finished C.24 planning yet.
Problem frame
Modern systems in agential roles increasingly rely on tool-call planning: selecting admissible tool-service routes, arranging intended call work, and replanning under uncertainty. Without a calculus:
- calls are scheduled by ad-hoc heuristics,
- budgets (compute, cost, wall-time) are implicit,
- assurance and policy provenance are lost, and
- systems in agential roles either over-constrain themselves with brittle scripts or wander without guard-rails.
This CAL provides the conceptual API for thought that lets any implementation (LLM-based, search-based, code-based, robotic) plan calls admissibly, auditably, and scalably. (Role-Method-Work alignment; didactic primacy.)
Immediate failure indicators for this pattern:
- the current planning result cannot say whether one choice result already exists,
- the current text cannot distinguish route description, call plan, and executed call work,
- the budget being burned is still only probing-before-choice budget rather than enactment or tool-call budget, or
- the next admissible output is still undefined as one enactment-facing plan, one
CheckpointReturn, or one neighbouring-pattern exit.
If the question under repair is still which fixed option should survive now, apply C.11. If it is still pool policy over several still-live candidate lines, apply C.19. If it is already public selected-set publication, apply G.5.
Problem
We need a tool-agnostic way to (i) identify admissible route descriptions, (ii) compose one call work plan that cites them, (iii) allocate an explore/exploit share, (iv) enforce budget & harm gates, and (v) replan on signals—without baking domain-specific heuristics into the core and without collapsing U.MethodDescription, U.WorkPlan, and U.Work into one object.
Forces
Solution — Signature & Realization
Types (aliases).
ATC.CallRouteDescription ≡ U.MethodDescription with accessSpec for one tool service or callable route;
ATC.CallPlan ≡ U.WorkPlan specialised for intended tool-call work; it cites one or more ATC.CallRouteDescription editions plus planned order, budget ceilings, stop or replan triggers, and next move;
ATC.CallGraph ≡ Evidence/Provenance graph over a U.Work ledger;
ATC.Policy references U.EmitterPolicyRef (E/E-LOG) and local call gates including BLP tolerances (alpha, delta).
Roles. A System in AgentialRole prepares or revises one CallPlan that cites one or more CallRouteDescription editions. Upon enactment, a Performer executes Work (calls), and Observers record Observations with acceptance checks. Route descriptions stay design-time; the call plan stays schedule-of-intent; actual call work stays run-time. (A.15 strict distinction.)
Operators (Gamma_agential; CAL, conceptual):
-
Gamma_agential.eligible(tool, TaskSignature, K_ctx) -> {true|false, notes}Eligibility gate based on capability fit, policy allow-list or deny-list, and context K (including safety constraints). -
Gamma_agential.enumerate(TaskSignature, K_ctx) -> CandidateSet<ATC.CallRouteDescription>Returns admissible callable route descriptions. It MAY delegate to NQD-CAL for heterogeneous route families and MUST apply the current E/E-LOG lens (objectives & telemetry) to tag candidates. -
Gamma_agential.plan(Objective, CandidateSet, Budget, ATC.Policy) -> ATC.CallPlanProduces one call plan that cites the selected route descriptions, declares one planned budget envelope (compute, cost, time, risk), one intended call order, and one stop or replan policy. Internal route logic remains in the cited method descriptions; the plan is aU.WorkPlanthat cites method descriptions, not a method description and not yet work. -
Gamma_agential.execute(ATC.CallPlan) -> {ATC.CallGraph, Observations}Executes with hard gates (budget, risk, constraint-fit) and logs provenance suitable for B.3 assurance reporting (design-time and run-time separated). -
Gamma_agential.replan(Signals, ATC.CallPlan, BudgetPrime) -> ATC.CallPlanPrimeTriggered by sentinel breaches, assurance drops, or policy events; preserves editioned policy, cited route descriptions, and context. -
Gamma_agential.score(Route or PlanAlternative) -> <ValueProxies, Cost, Risk, FGR_floor>Computes selection signals without illegal scalarisation across mixed scales; uses Pareto comparison under the C.19 E/E-LOG lens and leaves final dominance to declared policies.
Bounded scout/probe cycle for unfamiliar task families
When the choice result is already fixed enough that enactment planning is admissible under C.24, but the route across heterogeneous or unfamiliar callable approaches is still uncertain, the system may spend a bounded scout/probe budget before committed rollout and return one checkpoint package that compares the tested routes.
If additional probing could still change which option survives the current OptionSet, the budget is still C.11-side epistemic budget and the question reroutes upstream. If choice result is already fixed and the uncertainty is only about route or rollout shape, the budget is now enactment budget and the checkpoint belongs in C.24.
That CheckpointReturn should state the declared utility objective and current TaskFamily, the route descriptions or candidate approaches tested, the evidence on each route, the burned and residual actual budget, the recommended next action, and the commit trigger named by value that would justify leaving probe state.
A successful probe does not by itself justify a larger burn or a committed rollout. C.24 carries the CheckpointReturn record and call-plan semantics for this probe loop; A.15 carries the DesignRunTag split and E.16 carries the budget partition plus guard and ledger enforcement. Low-human-overlap approaches remain sound only while they stay tied to the declared utility objective, budget boundaries, and evidence locus explicitly.
Bridge to neighboring patterns. ProbeBudget belongs to C.11 while it means epistemic budget for further probing before choice. C.24 carries budgets once they are enactment, tool-call, or rollout budgets. If the question is still which option survives now, apply C.11; if it is now pool policy over several still-live candidate lines, apply C.19; if it is selector-facing publication of the selected result, apply G.5.
Explicit enactment result. A conformant C.24 pass should therefore leave either one enactment-facing CallPlan that states the current objective, the cited route descriptions or planned call order, the planned budget envelope, the stop or replan condition, and the next move, or one CheckpointReturn that states the current objective or task family, the burned and residual actual budget, the evidence locus, the commit trigger, and the recommended next action.
Unfinished-state rule. A C.24 result remains unfinished when it cannot say whether execution should continue now, pause at one checkpoint, or reroute, when it confuses route description with plan or plan with executed work, or when it does not state which budget is planned versus already burned and what event would stop or replan the current route.
Normative Laws (ATC-Laws).
- ATC-1 (Model-the-Call, not the App). A tool call is one Work instance that enacts a referenced MethodDescription promised by a Service; plans schedule intended calls and cite route descriptions but are neither the route descriptions themselves nor the calls. (A.15.)
- ATC-2 (Bitter-Lesson Preference). When two admissible choices are within delta (assurance) and alpha (budget), prefer the more general, scale-benefiting method whose slope vector Pareto-dominates under the declared E/E-LOG objectives; any override MUST record a BLP-waiver with expiry. (E.2; precedence governed by E.3.)
- ATC-3 (Budget & Harm Gates). Plans SHALL declare ceilings on compute, cost, wall-time, and risk; execution MUST abort or replan on breach. Actual burned or residual budget belongs in
CheckpointReturn,CallGraph, or other work-side reporting, not inside theCallPlanfield set. - ATC-4 (Explore-Share Discipline). Plans MUST declare
explore_share; defaults inherit from E/E-LOG profiles. Informative defaults:0for safety-critical or deterministic tasks;approx 0.2-0.4for ambiguous tasks with heterogeneous tool families. Promotion of illumination telemetry into dominance requires explicit policy. - ATC-5 (Provenance & Replay). Every call MUST emit a CallGraph with: Service id, cited MethodDescription edition, inputs and outputs (redacted per privacy),
CallPlanref, EmitterPolicyRef, and budget deltas. (NQD/E/E provenance fields apply when used.) - ATC-6 (Assurance-First Decisions). Selection MUST respect B.3: WLNK minima on F/R (weakest-link floors), CL penalties on integration, and no chimera scores across design-time and run-time scopes. Publish <F,G,R> for the typed claim
this plan is admissible under K,S. - ATC-7 (Notation/Vendor Independence). Core pattern text MUST NOT encode vendor-specific tokens; bindings occur in Context via Bridges/Profiles. (Lexical guard-rails.)
Planning under budget must consume the same declared doctrine
Causal action-use spec for call plans
When a tool-call plan selects observation, intervention, counterfactual-rung evidence collection, counterfactual policy conditioning, or off-policy causal evaluation work, the CallPlan carries an optional causal action-use spec and cites C.28 for the causal-use authority.
Optional CallPlan.causalActionUseSpec?:
The causal action-use tail may be omitted only when the call plan does not reach CausalUseActivation: it is not using the call sequence as causal support, not choosing between observation/intervention/counterfactual-policy regimes, and not publishing the result as causal evidence. If the plan says the call will prove, estimate, improve, prevent, or counterfactually establish an outcome, the support tail is present or the wording is downgraded.
What changes in practice: a call plan that probes, intervenes, samples, simulates, or evaluates a policy for a causal purpose must state CausalUseClaimKind and the causal regime of the planned action before execution evidence is treated as support for a causal-use claim.
What this does not authorize: [C.24](/generated/patterns/C.24) does not estimate effects, prove identification, certify fairness, or turn simulation output into realized counterfactual-rung evidence; it governs admissible call planning and redirects causal-use support to [C.28](/generated/patterns/C.28).
- Planning should reuse the declared source set, decision lens, probe budget, and stopping condition rather than creating one planning-only choice semantics.
- Budgeted sequencing may mix exploitation and exploration, but the declared source set and the declared reason for the next probe must stay recoverable.
- Use planning language such as
probe next,hold as archive,apply [G.5](/generated/patterns/G.5) for shortlist publication, orstop for nowonly when the relevant lens-side reason is stated directly. explore_share,backstop_confidence, probe budgets, and replan triggers are planning harmonization terms for that same declared choice doctrine.- They may regulate sequence and stopping; they do not redefine
Front,Archive,Shortlist, orSelectionSlot. - If the next planned move is one public
ShortlistorRankedShortlist,[C.24](/generated/patterns/C.24)should name that as a neighbouring-pattern exit to[G.5](/generated/patterns/G.5), not emit the selector artifact itself.
Policy profile and BLP precedence
ATC-Policy fields (conceptual).
{ backstop_confidence, explore_share, risk_bound, cost_ceiling, time_ceiling, tie_breakers, novelty_quota?, wild_bet_quota?, stop_conditions, BLP_delta_alpha, BLP_delta_delta } - realised by referencing an E/E-LOG EmitterPolicy and adding Bitter-Lesson-Preference clauses. Defaults inherit from C.19; any deviation is editioned.
BLP precedence. In conflicts with tactics that hard-code narrow scripts, the Bitter-Lesson Preference applies subject to E.3/E.5 precedence. Where scripts encode safety-critical gating or regulatory compliance, scripts prevail unless the governing context publishes the override rationale, expiry, measured hazard avoided, and planned re-evaluation window.
Didactic quick card
Agentic Call Plan (public field set).
Objective - Context(K) - RouteRefsInOrder[edition-pinned] - BudgetEnvelope{time_budget, compute_budget, cost_budget, risk_limit} - PolicyRef - Explore-share - StopConditions - ReplanConditions - BLP tolerances - BLP waiver (if any) - Assurance<F,G,R|K,S> - Provenance ids
Explicit enactment outputs and closure rule
A finished C.24 pass should publish one enactment result rather than one vague statement that the system now has a plan.
Two output shapes are admissible here:
- one enactment-facing
CallPlan; or - one bounded
CheckpointReturnwhen probing is still the admissible next move inside enactment planning.
A CallPlan should state at least these fields:
- current objective;
- cited route descriptions or planned call order;
- active policy or planning state;
- planned budget envelope or reserved budget;
- stop or replan condition;
- next move if the current plan is accepted now.
A CheckpointReturn should state at least these fields:
- current task family or objective;
- candidate routes tested so far;
- evidence on those routes;
- burned and residual actual budget;
- recommended next action;
- explicit commit trigger.
A compact result may therefore look like:
or:
Close as one enactment-facing CallPlan when the choice result is already fixed enough that execution order, gating, and replanning are now the call-planning question. Close as one CheckpointReturn when bounded scout/probe work is still admissible inside enactment planning. Return to the neighbouring pattern when the result has actually fallen back into local choice, pool policy, or selector-facing publication.
If the result still does not state what should execute now, what budget is planned or already burned, and what event stops or replans the route, it is still unfinished [C.24](/generated/patterns/C.24) work.
Worked closure slice
Two short contrasts keep the closure law practical.
Known route, execution should begin now.
When the objective and route are already fixed enough, C.24 should close as one enactment-facing call plan:
Unfamiliar route, one bounded scout pass still admissible.
When the route is still uncertain inside enactment planning, [C.24](/generated/patterns/C.24) should close as one CheckpointReturn:
The practical distinction is simple: if route order and budgeted execution are already the call-planning question, emit one CallPlan; if bounded scout work is still the call-planning question inside planning, emit one CheckpointReturn.
-
Research-assistance system in agential role. Task: answer a novel technical question. Candidate tools: retrieval, structured web search, code runner, table or plot generator. Plan: cite route descriptions for
search,retrieve,synthesize, andcode_check; declareexplore_share approx 0.4; replan on sentinellow_R. The admissible structure here is one declared budget envelope, one explicit route order, and one visible replan trigger. -
Program-repair system in agential role. Task: propose a patch against a failing test suite. Candidate tools: repo introspection, static analyzer, unit runner. Plan: keep repo-introspection, patch-application, and targeted-test route descriptions distinct; use scout quota across patch families before committed rollout.
-
Lab-automation system in agential role. Task: adjust a wet-lab protocol under drift. Candidate tools: planner, pipetting controller, spectrometer, Bayesian optimizer. Plan: a bounded probe or pilot can inform the route, but committed rollout waits for the declared commit trigger and assurance floor.
Bias-Annotation
Lexical firewall and notation independence apply; no vendor tokens; mixed-scale characteristics are never averaged; route descriptions remain distinct from U.WorkPlan, and both remain distinct from executed U.Work; a successful probe remains distinct from committed rollout until the commit trigger is satisfied.
Conformance Checklist
- CC-ATC-1 - Declared separation.
ATC.CallRouteDescriptionis aMethodDescription;ATC.CallPlanis aU.WorkPlanthat cites route descriptions; execution isWork; acceptance is viaU.PromiseContent. No method-side route logic or actual burn is smuggled into theU.WorkPlanfield set. - CC-ATC-2 - Budgets on record. Time budget, compute budget, cost ceiling, and risk limit exist ex ante; stop conditions are listed.
- CC-ATC-3 - E/E policy.
EmitterPolicyRef(or equivalent) andexplore_shareare editioned and logged. - CC-ATC-4 - Assurance tuple. Publish the typed claim
Plan admissible under K,Swith<F,G,R>and CL penalties traceable in theCallGraphSCR. Design-time and run-time never merged. - CC-ATC-5 - BLP waiver discipline. Any heuristic override against a general method includes expiry and re-evaluation date.
- CC-ATC-6 - Provenance minimum. Record
{PromiseContentRef, CallPlanRef, MethodDesc.edition, EmitterPolicyRef, DescriptorMapRef? (if NQD), DistanceDefRef? (if NQD), TimeWindow, Seeds?, Dedup?}. - CC-ATC-7 - Notation independence. No vendor tokens in conceptual text; bindings via Bridges or Profiles only.
- CC-ATC-8 - BLP tolerances declared.
alpha/deltatolerances are present inATC.Policyor referenced via the activeE/E-LOGprofile. - CC-ATC-9 -
CheckpointReturnfor bounded specialization. When one route still uses scout/probe discipline on a new task family, it SHALL publish oneCheckpointReturnwith candidate routes, evidence, burned/residual actual budget, next action, and commit trigger; a successful probe alone never counts as committed rollout. - CC-ATC-10 - Recoverable enactment closure. When
C.24returns one enactment-facing call plan or oneCheckpointReturn, theCallPlanSHALL state current objective, route refs in order, planned budget envelope, stop or replan condition, and next move, whileCheckpointReturnSHALL state burned/residual actual budget plus next action and commit trigger. - CC-ATC-11 - Neighboring-pattern boundary. If the question under repair is still fixed-option choice, pool policy over several live lines, or selector-facing publication,
C.24SHALL applyC.11,C.19, orG.5rather than restating those patterns. - CC-ATC-12 - Role discipline. User-facing prose and emitted artifacts SHALL speak about systems in agential roles or equivalent typed performers, not one generic
agenthead, when that generic head would blur the holder kind. - CC-ATC-13 - Causal action-use spec. If one
CallPlanselects observation, intervention, counterfactual-rung evidence collection, counterfactual policy conditioning, or off-policy causal evaluation for a causal purpose, it SHALL carryCallPlan.causalActionUseSpec?withtargetCausalityLadderRung,causalUseClaimKind: CausalUseClaimKind, supported use, unsupported use, and aC.28causal-use support reference rather than letting call-planning vocabulary certify the causal claim.
Common Anti-Patterns and How to Avoid Them
- Treating route description as plan. Avoid by keeping callable logic in
ATC.CallRouteDescriptionand keepingATC.CallPlanas oneU.WorkPlanthat cites it. - Treating planning as execution. Avoid by publishing actual burn only through
CheckpointReturn,Work, andCallGraph, not inside theCallPlanfield set. - Burning enactment budget while the question under repair is still upstream choice or pool policy. Avoid by rerouting unresolved fixed-option choice to
C.11and unresolved live-pool governance toC.19before building one call plan. - Counting a successful probe as committed rollout. Avoid by publishing one
CheckpointReturnwith a visible commit trigger instead of smuggling rollout through a positive scout result. - Hiding stop conditions or replan triggers. Avoid by making them part of the public
CallPlanfield set rather than one private implementer intuition.
Consequences
- tool use under systems in agential roles becomes inspectable as one admissible plan, not one opaque sequence of calls
- downstream work receives one explicit enactment record with objective, route refs, budget envelope, stop conditions, and next move
- the cost is stricter discipline around route-description versus plan versus work separation, explicit budgets, and visible policy state before execution begins
Rationale
C.24 exists because tool-use systems fail in a distinctive way: they can look adaptive while actually hiding route choice, budget burn, stop conditions, and replan logic inside one opaque execution chain. A separate planning calculus is therefore necessary so that tool use remains auditable, replayable, and governable before the first irreversible call is made.
Source-use role/currentness for this rationale: these rows are current-practice pressure and BLP-neighbour alignment, not a standalone SoTA-Echoing table. A current tool-use or agentic-loop source becomes load-bearing only when it changes one CallPlan, CheckpointReturn, budget, stop or replan condition, BLP waiver, or relation row.
- Contemporary tool-use systems in agential roles work best when planning, feedback, and replanning stay explicit rather than collapsing into one brittle script. The practical implication is to publish one
U.WorkPlanthat cites route descriptions and carries stop or replan triggers before execution. - Post-2015 search, optimization, and agentic systems also show that bounded probing is useful but dangerous when it silently becomes commitment. The safeguard here is the explicit
CheckpointReturnplus visible commit trigger and one explicit split between planned budget envelope and burned actual budget. - Scaling-first practice favors general, learnable methods over fragile hand-tuned tactics when assurance and cost remain comparable. The practical implication is not blind optimism but disciplined BLP: when a narrow heuristic wins, record the waiver, expiry, and re-evaluation window.
Relations
C.27 temporal-claim relation.
-
C.27 may flag: a tool-use plan claiming that tool use changes debugging, learning, search, repair, rollout, narrowing, uncertainty reduction, stabilization, or stop/replan rate.
-
This pattern keeps: call planning, tool-use sequence, budget, stop/replan, and work trace.
-
Non-admissible use: tool-call count, more context, or faster narrowing is effort evidence or input evidence at most; it is not task-success, reasoning-quality, evidence-quality, repair-success, cost, or validity-window evidence by itself.
-
Exit: a speed-up claim names task outcome, evaluation harness, repair-success evidence locus when claimed, cost or budget condition, validity window, stop or replan condition, and non-admissible use as a benchmark claim; C.24 remains the tool-use pattern.
Builds on: A.15 Role-Method-Work alignment (planning vs execution vs service), B.3 Trust and Assurance (F-G-R with CL), C.5 Resrc-CAL, C.18 NQD-CAL (candidate generation and declared set results), and C.19 E/E-LOG (policies). Coordinates with C.28 when a call plan is used to observe, intervene, collect counterfactual-rung evidence, condition a counterfactual policy, or evaluate a policy for causal-use support. Coordinates with E.23 when a repeated quality-improvement loop is enacted through tool-using agents: C.24 carries call plans, checkpoint returns, tool-call budgets, stop or replan conditions, and the separation among CallRouteDescription, call plan, and executed work; it does not restate the E.23 loop method, BLP comparison and cost discipline, or pattern-quality or DRR-adequacy object-under-improvement evaluations. Constrains: any U.PromiseContent used as a tool MUST expose acceptance conditions and observation hooks sufficient for B.3 reporting. Enables: human-facing Working-Model publication forms with policy and assurance disclosures while keeping design-time and run-time separated.
C.24:End
Q-Bundle: Authoring "-ilities" as Structured Quality Bundles
Type: Definitional (D) Status: Stable Normativity: Normative unless marked informative
Plain-name. Quality-bundle normal form.
Builds on.
A.2.6 (USM scope algebra), A.6.1 U.Mechanism, C.16 MM-CHR, A.18 CSLC, B.3 Trust & Assurance Calculus.
Coordinates with.
C.17-C.19 for quality-related measurement families, C.16.P when characteristic/scale/score wording is not yet recoverable, A.15 for method, work-plan, or work-occurrence gating, and C.16.Q for quality/evaluative-characterization wording before the endpoint is one explicit characteristic, Q-Bundle, objective, or another governing pattern.
Problem frame
Engineering quality language repeatedly drifts into one of two invalid simplifications: either every -ility is treated as one scalar characteristic, or every engineering-quality statement is left as loose evaluative prose. A conforming engineering corpus therefore needs a uniform discipline that keeps admissible measurements, scope declarations, mechanisms, statuses, and evidence visibly separated without inventing a new kernel ontology.
Problem
Without a normal form for engineering quality families:
- Composite families are scalarized illegally. Terms such as resilience, security, or maintainability are treated as if one number exhausted them.
- Scope is confused with measurement.
A claim's
ClaimScope/WorkScopeis spoken of as if it were a magnitude rather than a USM set-valued applicability object. - Mechanism and status are mistaken for evidence or metrics. Presence of redundancy, certification, or audit controls is described as if it were itself a measurement value.
- Guards become unstable. Admission checks silently mix scope coverage, numerical thresholds, mechanism presence, and evidence freshness in one phrase.
- Evaluative governing-pattern selection remains underspecified.
After
C.16.Qrepairs a bare quality term, orC.16.Prepairs characteristic, scale, score, metric, or proxy wording inside that term, the admissible endpoint is unclear unless FPF distinguishes single-CHR cases from bundle-shaped quality families.
Forces
Solution - Q-Bundle normal form
C.25 defines a lightweight authoring normal form for engineering quality families. A publisher facing a quality term first decides whether the intended endpoint is:
- one admissible CHR characteristic, or
- one structured quality bundle whose measurable slots, scope slots, mechanisms, statuses, and evidence remain explicit.
Endpoint split
Use a single U.Characteristic when the quality claim is genuinely one measurable aspect with one declared scale and ordinary CHR legality.
Use a Q-Bundle when the quality family depends on more than one of the following:
- one or more measurable characteristics,
- a declared claim/work scope,
- mechanism or status requirements,
- qualification windows,
- evidence anchors that are not reducible to one scalar.
Q-Bundle shape
Q-Bundle := <Name, QualityBearer, ClaimScope?, WorkScope?, Measures[CHR], QualificationWindow?, Mechanisms?, Status?, Evidence?>
The pattern adds no new Kernel kind for these slots. It reuses existing kinds and keeps them in one disciplined authoring structure.
Field meanings
- Name. The engineering quality family label, such as
Availability,Resilience, orSecurity. - QualityBearer. The bearer of the quality claim: typically
U.System,U.PromiseContent, orU.Episteme. - ClaimScope / WorkScope. USM sets over
U.ContextSlicedescribing where the claim holds or where the capability can deliver. These are set-valued scope objects, not characteristics. - Measures[CHR]. One or more admissible CHR characteristics, each bound to one declared scale.
- QualificationWindow. The temporal policy under which the quality claim is judged.
- Mechanisms / Status. References to
U.Mechanismrealizations, control presences, certification states, or similar gating structures. They are not measurements. - Evidence. Anchors that justify the measures, mechanisms, or scope claims.
Guard reading
A conforming quality guard typically has the conceptual form:
Scope covers TargetSlice AND Measures meet thresholds AND QualificationWindow is valid AND required Mechanisms/Status are present
This keeps coverage, thresholding, and admissibility in separate typed slots instead of hiding them inside one quality adjective.
Archetypal Grounding
Tell. A quality family is not automatically one metric. Sometimes it is one characteristic; often it is a structured bundle whose measurable, scope, and mechanism slots must remain explicit.
Show (Availability). Availability may be authored as one CHR-centric bundle with AvailabilityRatio[%] as the principal measure, a declared service/time scope, and explicit redundancy mechanisms. The measure is scalar; the scope is not.
Show (Resilience / Security). Resilience or security usually requires more than one measure, plus scenario scope, mechanism references, and qualification windows. Treating either as one scalar "quality score" erases the bundle structure that the claim actually needs.
Bias-Annotation
The pattern biases authors toward explicit decomposition. That bias is intentional. It is better to publish a visibly structured quality bundle than to gain short-term convenience by collapsing scope, measures, and mechanisms into one overloaded quality label.
Conformance Checklist
CC-C.25-1If an engineering quality claim is intended as one measurement characteristic, the publisher SHALL bind it to one namedU.Characteristicwith one declared scale.CC-C.25-2If the claim requires multiple measures, scope slots, mechanism slots, status slots, or qualification windows, the publisher SHALL use a Q-Bundle rather than an undeclared scalar surrogate.CC-C.25-3ClaimScopeandWorkScopeSHALL remain USM set-valued scope objects; they MUST NOT be treated as ordinal or numeric quality levels.CC-C.25-4Mechanism or status slots MUST NOT be conflated withMeasures[CHR].CC-C.25-5Any scalar comparison or thresholding inside a Q-Bundle SHALL apply only to declared CHR measures, not to scope slots.CC-C.25-6Cross-context penalties and bridge losses SHALL apply toRperB.3/F.9; they MUST NOT silently alter the type of the bundle'sF, scope, or CHR type authority.
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
Engineering quality language is useful precisely because it groups recurring concerns under memorable family labels. The same grouping becomes dangerous when those labels are mistaken for one universal metric. C.25 preserves the family labels but forces the underlying structure to stay typed and visible.
SoTA-Echoing
Contemporary engineering quality practice routinely mixes service-level measures, capability windows, scenario envelopes, mechanism presence, certification state, and evidence traces. C.25 adopts that practical richness but refuses the common shortcut of compressing the whole family into one undefined score.
Relations
E.21 specialises the Q-Bundle normal form for FPF pattern-quality claims. C.25 remains the general endpoint for engineering quality families; E.21 is the endpoint governing pattern when the quality claim evaluates one FPF pattern version as action-guiding FPF text.
C.27 temporal-claim relation.
-
C.27 may flag: a quality-family statement where agility, resilience, adaptability, recovery, or robustness depends on braking, redirection, stabilization, recovery rate, or rhythm under effort.
-
This pattern keeps: quality-family bundle structure, scope, mechanism/status slots, evidence, qualification window, and failure mode.
-
Non-admissible use: temporal adequacy is not quality adequacy; speed, recovery, or rhythm becomes quality content only when C.25 declares the quality family, scope, mechanism/status slots, evidence, and failure mode.
-
Coordinate with C.27 only when the temporal dynamic changes admissible use; do not make every quality bundle carry dynamic slots.
-
Builds on:
A.2.6for scope algebra,A.6.1for mechanism references, andC.16 / A.18for CHR legality. -
Coordinates with:
C.2.2a,A.16.0,B.3for assurance penalties,A.15for gate use,C.16.Pfor unresolved characteristic, scale, score, metric, or proxy wording inside a quality-family statement,C.16.Qfor overloaded quality or evaluative-characterization wording,C.17, C.18, and C.19for adjacent quality-family measures, andF.9 / F.9.1when cross-context bundle comparison or bridge stance annotation is required. -
Constrains: engineering quality authoring whenever a quality term would otherwise drift between single-CHR and composite-bundle readings.
Endpoint function in evaluative classification
In evaluative repair, C.25 is the system-side endpoint pattern for engineering quality families after overloaded quality wording has been repaired by C.16.Q and any hidden characteristic, scale, score, metric, or proxy wording has been repaired by C.16.P. qualityTermAscription(...) may remain a transitional repair record, but it is not the universal resting place when the admissible endpoint is a single Characteristic, a Q-Bundle, or an explicit objective-oriented quality bundle.
Decision Test: Single Characteristic or Bundle?
The most common authoring failure is not in the bundle syntax itself; it is in choosing the wrong endpoint shape. The quickest useful test is to ask what would make the quality claim false.
Use one U.Characteristic when
A quality claim should terminate in one admissible CHR characteristic only when all of the following hold together:
- one measurable aspect is actually doing the evaluative work,
- one declared scale is enough to compare relevant cases,
- the bearer and scope are already clear without introducing extra quality slots,
- mechanism or status presence is not itself part of the core quality head,
- and downstream gates can read the claim without needing a bundle decomposition.
Examples include a narrowly declared AvailabilityRatio[%], a specific latency percentile, or one response-time threshold under one fixed window.
Use a Q-Bundle when
A quality claim belongs in C.25 when one family label is standing over several distinct typed concerns, for example:
- several measures are needed together,
- scenario or claim scope is load-bearing,
- mechanism presence or certification state constrains admissibility,
- qualification windows alter the reading materially,
- or one scalar head would hide which part of the family is actually failing.
The bundle is not a fallback for laziness. It is the explicit authoring form for claims whose truth conditions are already composite.
Borderline cases
Some quality families contain both a bundle-shaped form and a narrow single-characteristic form. For example, a service team may use:
- one CHR characteristic for a very narrow uptime commitment, and
- one Q-Bundle for the broader service-availability family that includes scope, windows, failover mechanisms, and evidence.
This is legitimate as long as the text states clearly which head is currently in play. The single-characteristic form does not replace the broader family; it selects one evaluative slice of it.
Slot Interaction Law
The practical payoff of C.25 is not just that it names the slots. It also stabilizes how those slots interact.
Scope and measure remain orthogonal
ClaimScope and WorkScope answer where or under what contextual slice the quality claim holds. Measures[CHR] answer how a measurable aspect behaves. A broader scope is not a larger measurement value; a narrower scope is not a penalty value. Scope is governed by set inclusion and coverage, not by scalar order.
Mechanism and status are gating slots
Mechanisms and statuses may be load-bearing for admissibility, but they do not become measurements merely because they matter. A redundancy mechanism may be required for claiming a resilience bundle, and a certification status may be required for external publication, yet neither slot is itself the Measures[CHR] head.
This matters because many quality arguments fail by turning mechanism presence into an implicit hidden score.
Qualification windows are not decorative
A quality claim that depends on rolling windows, observation periods, maintenance intervals, or disruption horizons must publish that temporal qualifier explicitly. If the truth of the quality claim changes when the window changes, then the window is part of the declared bundle record rather than optional commentary.
Report-only summary proxies
A publisher may compute a report-only summary proxy for convenience, for example a compact quality summary proxy value or an oversight-facing composite score. Such a proxy is admissible only if:
- it is explicitly declared as a report-only proxy,
- the underlying bundle slots remain visible,
- and no norm, gate, or bridge silently substitutes the proxy for the bundle itself.
This prevents a convenience summary from becoming a covert replacement for the typed quality claim.
Worked Quality Families
Availability family
A narrow service commitment may use AvailabilityRatio[%] as one characteristic. A broader availability family usually still needs a bundle because the claim depends on:
- declared service and time scope,
- observation and qualification window,
- one or more mechanism slots such as failover or redundancy,
- and evidence tying the measurement to declared observation conditions.
The bundle form makes it possible to distinguish "the measurement fell short" from "the measurement is fine but the declared mechanism prerequisite was absent".
Resilience family
Resilience is almost never one scalar. It commonly binds together:
- disruption scenario scope,
- restoration-related measures such as
MTTR,RTO, orRPO, - recovery mechanisms and preparedness states,
- and scenario-specific evidence about drills, restorations, or incident traces.
Trying to compress this into a single resilience value usually destroys the difference between fast recovery in one scenario and structural fragility in another.
Security family
Security claims routinely combine:
- trust-zone or attack-class scope,
- measurable characteristics such as patch latency, control coverage, or response interval,
- control-set and certification slots,
- and evidence from audit, observation, or incident review.
C.25 therefore treats broad security-family claims as bundle-shaped unless the claim has already been narrowed to one admissible CHR characteristic.
Maintainability and evolvability
Maintainability or evolvability claims often drift into pure rhetoric. In C.25, they become usable only when the publisher separates:
- the declared scope of systems or change classes,
- the measurable slots (for example change lead time, defect reintroduction rate, restoration interval, review load),
- the enabling mechanisms (modularity rules, test harnesses, interface discipline),
- and the window or evidence conditions under which those measures were observed.
This is exactly the kind of quality family that looks scalar in speech but turns composite once the claim is made explicit.
Authoring and Review Guidance
For authors
Authors should begin with the question: what is the actual head of this quality claim? If the truthful answer is "several measures plus scope plus mechanism constraints," start with a bundle and narrow only if a later slice genuinely deserves one CHR head.
A useful authoring order is:
- name the family label,
- identify the bearer,
- publish scope,
- publish measures,
- add mechanism/status slots,
- publish qualification window,
- bind evidence,
- and only then consider whether a report-only summary proxy is needed.
For assessors
A checking reader should ask:
- whether the chosen endpoint shape is admissible,
- whether any scope slot has been smuggled into scalar language,
- whether mechanism presence has been mistaken for a metric,
- whether the window is truly optional or actually load-bearing,
- and whether any summary proxy is trying to replace the underlying bundle.
In practice, most defects are visible as soon as the checking reader asks what exactly one reported number stands for.
For gate designers and assurance leads
Gate designers should resist writing guards against vague family labels such as resilience must be high. A conforming gate should instead name the relevant bundle slots:
- coverage over the target slice,
- threshold satisfaction on declared measures,
- qualification-window validity,
- and any required mechanism or status slots.
This keeps the gate auditable and prevents later disputes about what the family label was supposed to mean.
Repair and Boundary Notes
Repair from bare quality requirement prose
Bare phrases such as quality requirement, security requirement, or availability requirement should not survive as bare heads when the underlying endpoint is actually a characteristic or bundle. The repair rule is:
- choose the endpoint shape first,
- then bind the requirement or commitment to that explicit head.
C.16.Q may still be the entry repair for overloaded quality wording, and C.16.P may repair characteristic, scale, score, metric, or proxy wording inside the same statement; C.25 is the resting place only after the engineering quality family has been made explicit.
Boundary to assurance penalties
Cross-context transport, bridge loss, or plane mismatch do not change whether the endpoint is one characteristic or one bundle. Those effects apply to R and its penalties. C.25 therefore should not be used to hide assurance degradation inside the quality-family ontology.
Boundary to publication convenience
A report, summary publication, or executive summary may expose only one slice of a Q-Bundle, but the underlying authoring structure remains the bundle. Publication convenience is not a reason to collapse the ontology at the source.
Serviceability and supportability
Serviceability, supportability, and adjacent family labels often look simple in prose but become composite as soon as operational use is declared. An admissible bundle for this family may need:
- support-scope slices,
- measured restoration or service intervals,
- mechanism slots for support mechanisms, access discipline, or replacement procedures,
- and evidence from service traces or support records.
The lesson is the same as elsewhere in C.25: once the truth of the family claim depends on several typed contributors, the bundle should stay explicit.
Boundary to description-side and selector-side evaluation
C.25 is for engineering quality families whose bearer is a system-side, promise-side, or explicit quality-bearing artifact. It does not automatically cover:
- viewpoint-fit or grounded architecture adequacy claims, which may belong in viewpoint or evaluative-ascription patterns,
- or selector/objective heads where quality means use-value under a search or portfolio frame.
This boundary matters because the same word quality appears across those zones. C.16.Q repairs overloaded quality wording, C.16.P repairs characteristic, scale, score, metric, or proxy wording when that is the hidden object, and the resting endpoint depends on what is actually being evaluated.
Bundle Decomposition and Comparison Law
Local decomposition rule
A family label may remain stable while its internal slots differ materially across contexts. Conforming comparison therefore starts by aligning the bundle decomposition: scope slots with scope slots, measure slots with measure slots, mechanism/status slots with their own kinds, and evidence/window slots with their own kinds. Comparing one bundle's measure directly to another bundle's mechanism claim is a category error even if both sit under the same family label.
Narrow slice versus whole family
A context may admissibly extract one narrow slice from a broader Q-Bundle and publish that slice as a single CHR characteristic, but the publication should say that the slice is only one member of the broader family. What is not admissible is to report the slice as though it exhausted the entire family claim.
Cross-context family comparison
Cross-context comparison of quality families should proceed through explicit bundle alignment and, where needed, F.9 bridge discipline on the relevant heads or slots. The bundle ontology stays in C.25; bridge loss, translation-relation adequacy, and cross-context penalties remain outside the bundle itself.
Gate, Proxy, and Reporting Discipline
Report-only summary proxy
A context may publish a summary proxy for reporting convenience, but the proxy remains secondary to the Q-Bundle. The proxy should state what it summarizes and what it leaves out. No report-only proxy may replace the bundle in norms, gates, or endpoint ontology.
Gate binding rule
When a gate uses a quality family, the gate should bind to explicit bundle slots: declared scope, specific measures, qualification window, and any required mechanism or status slots. Gate authors should not rely on the family label alone, because labels invite different local decompositions.
Roll-up caution
A summary publication or review may aggregate several bundle instances, but the roll-up must remain visibly downstream from the underlying bundle structure. If the roll-up begins to drive local engineering decisions directly, the governing bundle slots should be surfaced again rather than hiding them behind one summary score.
Review Matrix and Repair Tests
A checking reader can test a Q-Bundle with five questions:
- Is the endpoint shape admissible? One characteristic where one characteristic is live, one bundle where several typed contributors are load-bearing.
- Are scope and mechanism slots kept distinct from measures?
- Is any summary number trying to replace the bundle?
- Would a gate still be auditable if the family label were removed?
- If the claim crosses contexts, is bridge work kept in
F.9rather than hidden inside the family bundle?
Repair from bare family prose should therefore recover bundle shape first, then choose whether any narrow slice deserves a separate CHR publication.
Viability-envelope, quantum-like, and temporal-claim relation note
Use C.25 when the question under repair is a quality bundle, "-ility" decomposition, proxy metric, trade-off, gate, or report. A viability claim should not become quantum-like merely because it involves uncertainty, feedback, several qualities, or changing operating conditions; a temporal claim should not become a Q-Bundle merely because the working phrase mentions speed, cadence, rhythm, or recovery.
Practical reading:
- Decide whether the quality claim is one admissible Characteristic or a Q-Bundle.
- If it is a bundle, name bearer, scope, measures, qualification window, mechanisms/status, and evidence.
- Ask whether the claim is really viability-envelope work: protected promise/function, viable region/bounds, several variables, disturbance, sensors/probes, actuators, boundary conditions, adaptation cost, and failure mode.
- If one proxy or bundle is enough, stay in
C.25. - If the envelope reading depends on a probe, sensor, frame, export, action, coarsening, or boundary interaction that changes what can be said admissibly, the remaining viability-envelope question belongs with
C.26.3. - If the sentence is an intervention-sensitive temporal claim about rate-change under effort, window, resistance, or cadence, inspect
C.27for the smallest honest temporal-claim adequacy card before using the quality label for action. - State viable region/bounds, trade-off, admissible use, non-admissible use, and failure mode before viability language is used for action.
Minimum viability-envelope note:
Useful outputs:
- a Q-Bundle when the issue is quality decomposition;
- a
C.26.3envelope-regulation note when probes/actuators/boundary conditions change the admissible viability reading; - a
C.27temporal-claim adequacy card when rate-change, effort, window, resistance, or cadence changes the admissible use; - no QL wording when ordinary quality-bundle, proxy, feedback, or control tuning carries the work.
C.25:End
Quantum-Like Modeling Lens
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
FPF already has local patterns for decisions, boundaries, bridges, work, measurement, search, and quality bundles. Some real architecture cases still break when those patterns are applied as if every read, question, dashboard, workshop, bridge, or simplified representation were a passive view of a stable state.
Use this pattern when the ordinary FPF pattern remains active but misses one extra representational issue: the act of probing, framing, exporting, comparing, or coarsening changes what can admissibly be inferred from the represented state. The useful move is small. Add a quantum-like mathematical lens only where it tells the user how to avoid a concrete representational mistake.
This pattern is not a physics claim. In FPF, quantum-like names a detached mathematical and representational lens, comparable in role to probability, calculus, optimization, or state-space modeling. It is cheap as a QL-lite note and expensive only when the claim becomes reusable law, assurance evidence, empirical superiority, formal reconstruction, or ontology.
Unifying principle: use QL to cheapen the first correct move, not to make the first mention more expensive.
What this lens buys in practice:
Plain glosses:
quantum-like: a detached mathematical / representational lens, not a claim about what the target is made of.probe: an operation that both produces an output and may change the represented state or admissible use of the output.frame: a probe frame, measurement frame, comparison frame, or model frame. If the text means FPF semantic context, sayU.BoundedContextor bounded context explicitly.state: the represented condition relevant to the current decision, not a generic newU.Statekind.state update: a typed update claim. When load-bearing, say whether the update is a system change, work change, epistemic reading update, carrier update, emitted-output update, formal model update, or update-law change; do not let one phrase carry all of them.context: not a shorthand for frame. Use it only in explicit FPF terms such asU.BoundedContext, bounded context, or cross-context bridge.export: a carried representation whose use may lose timing, coordination, role, use conditions, confidence, or relation structure.coarsening: an intentionally cheaper state representation with declared loss and reopen conditions.
Phrase hygiene:
Example style:
Informative bilingual translation note:
Problem
Without this pattern, teams make five recurring mistakes.
They treat a probe as a neutral read when the probe changes later answers or behavior. They combine two posterior-looking outputs as if both came from one shared sample space. They export a team state, dashboard value, or context-map result as if it were a faithful-enough export for the intended use. They compress a large state representation for speed and then reuse the shortcut outside its admissible-use scope. They let words such as quantum, entanglement, collapse, or field import ontology that the model never earned.
The result is not merely loose wording. The team may approve a release from a dashboard whose publication and operational use changed the work it was supposed to report, average incompatible risk estimates, copy a local decision into another bounded context after the bridge lost the live coordination, or claim a speed gain because the representation was low-bit, linear, symbolic, or compressed without naming the loss.
Forces
Solution
Start with the ordinary FPF pattern. Add this lens only when ordinary wording would falsely treat a probe, question, metric, dashboard, API read, workshop, bridge, comparison frame, or coarsened representation as passive, stable, jointly comparable, or faithfully exportable. The main entry question for the whole cluster is: "What should the user do with this lens so that the representational mistake does not arise here?"
Action path:
- Name the ordinary FPF pattern that already carries the baseline question.
- Name the concrete representational mistake: passive read, shared comparison frame, false faithful-enough export claim for the intended use, exact-state shortcut, or unsupported coarsened representation.
- Test the positive QL cue and the negative activation list.
- Fill the QL-lite card if the cue survives.
- Emit one practical result: use ordinary pattern only, add QL-lite note, select one C.26 child pattern as the applicable pattern body, add evidence and assurance, or drop the QL wording.
- Escalate only when the claim becomes reusable, assurance-bearing, formal, empirical-superiority-bearing, or ontology-bearing.
C.26 ordinary output: produce one of these, then stop or select the neighboring applicable pattern body:
- no C.26 pattern selection because the ordinary FPF pattern carries the case;
- QL-lite note with the minimum sufficient field set;
- use the ordinary pattern that carries the question under repair;
- escalation to evidence, assurance, or formal-model work when the claim’s evidence or authority demand requires it.
Keep the entry cost proportional to the use. A QL situation does not begin with a full record.
Do not make the decision-bearing or assurance record the ordinary entry cost. The everyday pattern move is a small recognition note plus a bounded action.
Affordability by working-reader situation:
Do not require a practitioner or architect to produce a researcher-level record when the claim is only recognition or local-working support condition.
Checking discipline:
Cluster maxim: quantum-like wording does not raise assurance load by default. Assurance load rises only when the claim itself is reused, contested, evidence-bearing, release-facing, high-impact, comparative, formal, or ontology-bearing.
Pattern-local-note dependency rule: when an existing FPF pattern cites C.26 or a C.26.* child, the pattern's ordinary action guidance and conformance text remain primary. The citation means only: if a residual QL cue remains after the ordinary FPF pattern has carried its part, use this lens for that residue. It does not make every citing-pattern case depend on the full C.26 record or on every child-pattern semantic.
QL boundary selection:
The default output is a QL-lite card:
Decision diff examples:
Minimum viable QL-lite note:
This is enough for QLP-0 / QLP-1 ordinary working use unless the claim is reused, externalized, contested, assurance-facing, comparative, formal, or ontology-bearing.
Use the [C.11](/generated/patterns/C.11) mini-output discipline across the cluster: finish with one next move, not with an interesting label.
Retire QL when the residual cue disappears. If [A.6](/generated/patterns/A.6), [F.9](/generated/patterns/F.9), [C.16](/generated/patterns/C.16), [A.10](/generated/patterns/A.10), [B.3](/generated/patterns/B.3), [A.15](/generated/patterns/A.15), [C.25](/generated/patterns/C.25), [A.6.3.CSC](/generated/patterns/A.6.3.CSC), [A.6.3.RT](/generated/patterns/A.6.3.RT), or another ordinary FPF pattern now carries the claim without a false passive read, false shared frame, false faithful export, unsupported distributed-state reading, or QL-specific coarsening residue, remove QL wording from the active working note or pattern prose.
Use the lens only after the activation test survives both sides. QL remains active only when the ordinary FPF pattern cannot admissibly treat the output as a passive read, a shared-frame comparison, a faithful-enough export, or a use-scope-preserving state representation. Bridge loss, feedback, coupling, openness, compression, and coarsening are not QL cues unless they change the admissible state, probe, frame, or export reading for the current use. C.26 carries the full negative activation catalog; child and citing patterns should repeat only the local non-trigger that is frequent enough to matter for that pattern.
Canonical cue grammar:
Practical payoff in ordinary prose:
- "the metric reported readiness" becomes "the metric publication or measurement regime functioned as a probe interaction that changed readiness behavior";
- "two risk scores disagree" becomes "the two scores may come from non-shared comparison frames with no declared admissible joint comparison route";
- "the workshop discovered the split" becomes "the workshop was a probe whose order and framing changed alignment and local meaning";
- "the team knows" becomes "coordinated work evidences a low-recoverability distributed-state reading with carriers, window, and export loss";
- "this smaller model is enough" becomes "this coarsened state representation carries only its declared admissible-use scope and reopen condition".
Inherited QL boundary
Invariant QL-NQ: within FPF, quantum-like is a detached mathematical and representational modeling lens. It may use quantum-theory-derived structures such as contextual probability, Hilbert-like state spaces, non-Boolean logic, instruments, operator-like update, order effects, open-system descriptions, or incompatible probes.
Quantum-like does not assert physical quantum substrate, microscopic quantum process, qubits, quantum computation, physical entanglement, nonlocal causality, literal collapse, mystical observer effects, social substance, or collective mind. A physical-quantum claim is a different claim and needs separate physical or empirical support outside this pattern cluster.
Child patterns inherit QL-NQ. They should not restate the global boundary as local guidance unless they are repairing a specific confused phrase.
Pattern selector
Causal-use exit before QL retention
Before retaining QL-lite, QL-NQ, or a quantum-like framing for a claim being made, check whether the actual question is intervention, counterfactual comparison, causal effect, causal fairness, causal policy, off-policy causal evaluation, or realizability of counterfactual-rung data. If so, redirect the claim/question to C.28 before any quantum-like retention.
What changes in practice: "the model is quantum-like" cannot be used to skip causality-ladder rung declaration, causal identification, causal evidence support basis, or counterfactual sampling realizability.
What this does not authorize: [C.26](/generated/patterns/C.26) does not become a causal-use pattern and does not treat counterfactual material as a quantum-like subcase; it keeps quantum-like modeling discipline and sends causal-use support to [C.28](/generated/patterns/C.28).
Use this as a diagnostic sequence before retaining QL wording. DDD, microservice domain analysis, and ordinary boundary/bridge patterns stay first for bounded contexts, service cuts, integration points, and exported meaning; QL is retained only when a workshop, probe, export, or frame changes what can admissibly be inferred.
- Measurement, metric, scale, method, evidence, or assurance load goes first to measurement and evidence patterns:
[C.16](/generated/patterns/C.16),[A.10](/generated/patterns/A.10), or[B.3](/generated/patterns/B.3). - Bridge, translation, publication, rendering, or exported-loss question goes first to bridge and publication patterns:
[F.9](/generated/patterns/F.9),[E.17](/generated/patterns/E.17), or[E.17.EFP](/generated/patterns/E.17.EFP). - Causal intervention, command, work enactment, role alignment, or routine question goes first to work and authority patterns:
[A.15](/generated/patterns/A.15)and the relevant neighboring pattern. - Boundary/interface wording, service-interface typing, bridge endpoint, relation precision, or lexeme-collision question goes first to boundary and language patterns:
[A.6](/generated/patterns/A.6),[A.6.B](/generated/patterns/A.6.B),[A.6.P](/generated/patterns/A.6.P),[A.7](/generated/patterns/A.7),[E.10](/generated/patterns/E.10), or[F.18](/generated/patterns/F.18). - Quality, viability, feedback, or control-tuning question goes first to quality, dynamics, and measurement patterns:
[C.25](/generated/patterns/C.25),U.Dynamics, and[C.16](/generated/patterns/C.16). - Suspect option menu, unknown alternative, local plateau, basin movement, or candidate-generation question goes first to search and regime patterns:
[B.5.2](/generated/patterns/B.5.2),[C.18](/generated/patterns/C.18),[C.19](/generated/patterns/C.19), or[A.19](/generated/patterns/A.19). - Retain QL only for the remaining declared state, probe, export, frame, open-information-system, or coarsening cue.
C.26 does not choose among options, generate missing alternatives, or settle [C.11](/generated/patterns/C.11) decision quality. It can mark that the available readings sit in non-shared comparison frames or lack a declared admissible joint comparison route; the choice/search output still belongs to [C.11](/generated/patterns/C.11), [B.5.2](/generated/patterns/B.5.2), [C.18](/generated/patterns/C.18), [C.19](/generated/patterns/C.19), or [A.19](/generated/patterns/A.19).
Escalation by evidence or authority demand
Math reveal sequence:
Most C.26 use should stay at M0 or M1.
Evidence-use class is escalation by consequence, not an admission gate. QLP-0 or QLP-1 is the ordinary entry class for quick QL-lite use; QLP-2 / QLP-3 appears only when the claim is reused, contested, decision-bearing, assurance-facing, high-impact, or made part of reusable pattern action guidance or conformance text.
Evidence-use class scales by use:
Recognition case matrix
State-representation coarsening card
This card discipline is active when a fuller state representation is too detailed, unstable, unavailable, or expensive for the current bounded decision and a reduced-detail state representation is useful only under a declared QL cue. It is not a standalone speed pattern, not a standalone coarsening pattern, and not a new state-representation kind.
C.26 does not carry ordinary coarsening. A.6.3.CSC carries controlled coarsened rendering; A.6.3.RT carries same-selected-entity representation-scheme transition; A.19, U.Dynamics, modeling patterns, and ordinary abstraction patterns carry ordinary state abstraction. C.26 carries only the residual QL cue plus the loss/use boundary for this shortcut.
Question-to-pattern map:
Start with this coarsening mini-card:
For the representation shortcut itself, fill this coarsening card:
If the text claims that the shortcut is faster, cheaper, more compressed, more linear, more stable, or more tractable, add this claim declaration. The claim is separate from the coarsening card: the card controls the reduced-detail state representation; the declaration controls the performance or tractability assertion.
No speed, compression, linearity, or tractability claim follows merely from the words linear, operator, quantum-like, quantized, tokenized, low-bit, finite-dimensional, compressed, or symbolic.
If the shortcut carries a transition-speed, stabilization, or control claim, add the optional dynamics card:
Archetypal Grounding
Tell: A reliability dashboard says "Ready" after a new readiness metric is published. Before publication, teams treated incidents as local triage. After publication, they change priorities to satisfy the metric, while unmeasured recovery work gets delayed.
Show, System side: the delivery system, teams, dashboard, incident-handling cycle, and release decision form one operational situation. The dashboard is not only a window; it is part of the work ecology because it changes attention, escalation, and behavior.
Show, Episteme side: the QL-lite card says the ordinary FPF patterns are C.16, A.10, B.3, and C.25. The QL cue is an instrument-like metric publication that changes readiness behavior. The minimal admissible output is "treat the dashboard as probe-coupled evidence, not release proof." The local stop is release approval without fuller evidence.
Second grounding: a large state-space model is too expensive for triage, so the team uses four typed operational states. That shortcut is admissible only if the source model, state reduction, loss, admissible use, and reopen trigger remain explicit. The shortcut helps choose a work response; it does not prove the four states are the full system.
Bias-Annotation
This pattern intentionally biases authors toward ordinary FPF patterns before QL vocabulary. That bias prevents prestige use of the word quantum-like and keeps the mathematical lens useful rather than theatrical.
It also biases authors toward minimal admissible outputs. In ordinary use, the right result is often "apply the neighboring FPF pattern", "do not merge these comparison frames", "mark this dashboard as an instrument", or "return to the source representation if the shortcut fails", not a new doctrine about the target system.
The pattern may under-admit some mathematically valid QL models when the author cannot explain the practical payoff. That is acceptable for FPF pattern prose: a model that cannot say what it buys the working reader is not ready for Core-facing law.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Near-miss taxonomy:
Cluster conformance scenarios
Use these as quick applicability tests. A good C.26 use leaves one practical output, not just a clever label.
QL can also generate better design options:
AI and LLM work-cycle route examples
LLM-mediated work cycles often create the same representational mistakes C.26 repairs: false passive read, false faithful summary, false shared comparison frame, and shortcut without loss/use declaration. This does not make LLMs quantum-like.
Consequences
This pattern gives FPF a single place to define QL-lite and the inherited non-quantum boundary. That reduces repeated disclaimers in child patterns and makes ordinary use lighter.
Cluster success criteria:
The best outcome may be fewer but better QL mentions.
Do not retrofit QL into existing FPF examples merely because they involve measurement, context, service boundaries, feedback, coarsening, or distributed work. Patch only examples where a named false passive read, false shared frame, false faithful export, low-recoverability distributed-state reading, or QL-specific coarsening residue changes the decision.
The cost is authoring discipline. A writer must name the ordinary FPF pattern, the actual QL cue, and the local stop. That is more work than saying "context matters", but it prevents the most expensive mistake: treating a changed, thinned, or frame-bound representation as if it were a full state.
The state-representation coarsening card makes speed and tractability claims more honest. It lets teams use cheaper state descriptions while keeping loss and reopen conditions visible.
Rationale
The cluster stays small on purpose. A single giant "Quantum-Like Architecture" pattern would hide distinct modeling concerns. Scattering the lens across local pattern bodies would repeat the same definition and boundary notes. This modeling-lens pattern lets the common lens live once while child patterns carry their own primary EntityOfConcern and admissible move.
The key rule is simple: quantum-like is not quantum. Once that is typed, FPF can use the math lens normally. The lens earns its keep when it prevents a passive-read, one-space comparison, faithful-copy, or exact-state shortcut.
Evidence is not prestige. Literature supports the modeling move; local evidence supports the local state, export, or probe claim. A source anchor can justify why order effects, contextual probability, instrument-like readings, or open-system modeling are legitimate modeling patterns. It does not prove that this dashboard changed this team's state, that this workshop changed a boundary, or that this export lost the live coordination. That proof or evidence still belongs under A.10, C.16, A.15, B.3, and the ordinary pattern for the local claim.
SoTA-Echoing
Selected operational source anchors
This section is intentionally short. It carries operational anchors for using the pattern, not an expanded bibliography.
Relations
C.28 causal-use relation.
- C.28 governs causal-use question, causality-ladder rung, causal estimand, identification, counterfactual sampling realizability, causal evidence support basis, causal-use verdict, causal fairness, causal policy, and causal method parity.
- This pattern keeps residual quantum-like probe, frame, order, export, or coarsening discipline after ordinary causal-use explanation has been tried.
- Non-admissible use: intervention, causal effect, causal fairness, causal policy, counterfactual comparison, causal method parity, or counterfactual-rung-data realizability do not activate quantum-like modeling by themselves.
- Exit: when the question under repair is causal, cite
C.28before retaining QL-lite or QL-NQ.
C.27 temporal-claim relation.
-
C.27 may flag: ordinary state/rate/rate-change, effort-window, rhythm, braking, coasting, or intervention-timing claims before any quantum-like cue is considered.
-
This pattern keeps: residual quantum-like probe, frame, order, export, or coarsening discipline.
-
Non-admissible use: discreteness, finite differences, typed states, state-space reduction, tokenization, dashboards, probes, measurement plans, speed words, rhythm words, or Dyn2 words do not activate quantum-like modeling by themselves.
-
Exit: use C.27 and ordinary FPF patterns first; use C.26 only where residual probe, frame, order, export, or coarsening cue remains after those relations are named.
-
Builds on:
E.8,E.9,C.11,C.16,C.25,A.6,A.6.P,F.9,A.15,A.10,B.3,A.3,C.18,C.19,A.19. -
Constrains: QL wording in
C.26.1,C.26.2, andC.26.3. -
Carries: state-representation coarsening as a card inside
C.26:4.5, not as a separate pattern. -
Does not cover: physical quantum claims, a generic probe ontology, a generic state ontology, a service/cell pattern, or a field-like synchronization pattern.
-
Name boundary:
Quantum-Like Modeling Lensis a pattern label for a modeling lens and modeling discipline, notU.Lens, notQuantumLikeArchitecture, notQuantum Substrate, notQuantum Ontology, and not a universal architecture doctrine.
C.29 mathematical-lens use relation
C.26is a C.29-compatible specialization for quantum-like modeling. It carries a pre-filled adequacy profile for QL work: preserved structure includes order, probe, and contextual-probability effects when supported; lost structure includes physical quantum ontology; the canonical stop condition remainsQL-NQ. A QL-lite note does not inherit a blank fullMathLensUse.FullCard. A full C.29-compatible profile is needed only when the QL claim is decision-bearing, reusable, publication-bearing, assurance-bearing, bridge-bearing, or formal-model-bearing.
C.26:End
Probe-Coupled Boundary Interaction
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
Use this pattern when a boundary read, meeting, metric, API read, dashboard, workshop, survey, split, bridge, or message is being used as if it merely revealed or transferred state, but the probe or interaction changes the represented state enough to alter the architecture decision.
This is the main everyday entry into the QL cluster. It is useful because many teams already know how to talk about boundaries, interfaces, metrics, and workshops. The missing move is to notice when the act of reading or crossing the boundary participates in the state being read.
Plain glosses:
passive read: treating a workshop, metric, dashboard, API read, survey, or message as if it only reports state.probe-coupled: the read/export/intervention participates in the represented state enough to change the lawful decision.coupling channel: the concrete workshop, metric, message, API, dashboard, meeting, bridge, or event stream through which the effect travels.export loss: what the carried output cannot faithfully carry into another context or decision.
Problem
Architecture work often treats boundary interactions as passive. A dashboard "shows readiness". A workshop "discovers the context map". An API read "returns state". A meeting "collects alignment". A message "transfers a decision".
Sometimes that is good enough. Sometimes it is false for the current decision. Publishing the dashboard changes readiness behavior. Running the workshop changes alignment and local meaning. Reading the API changes timing assumptions. Sending the message changes trust, escalation, or error handling. Splitting the service changes the viability envelope that the split was meant to optimize.
When the false passive reading survives, the team may keep the wrong boundary, trust the wrong export, combine incomparable outputs, or redesign the system around an artifact that partly created what it reports.
Forces
Solution
Before accepting a passive read or unjustified lossless-transfer reading, ask whether the probe or interaction changed what the output may admissibly mean.
C.26.1 is active only when the interaction both participates in the represented state and its output is being used as evidence, export, comparison input, or decision input as if it were passive. Mere behavior change, ordinary feedback, or ordinary influence is not enough.
A probe-coupled interaction may be useful and intentionally state-shaping. The repair is not to avoid it; the repair is to stop using its output as if it were a neutral pre-probe read.
Start with this recognition note:
Use the fuller decision-bearing record below when the boundary result will be reused, contested, used as evidence, or used to change an architecture decision.
Full decision-bearing record:
Activation boundary
This pattern is active only when the interaction both participates in the represented state and its output is being used as evidence, export, comparison input, or decision input as if it were passive. A passive-read, unjustified lossless-transfer, one-way-message, or ordinary-bridge treatment must be materially false for the current decision.
Ordinary influence is not enough. A meeting that changes attention is ordinary work unless the meeting output is later used as a passive reading of alignment. An API call that is a mutating operation by its interface semantics is ordinary service/API semantics unless the call result is used as a neutral state export. A feature flag that changes behavior is ordinary intervention unless the flag readout is being used as evidence of the state it changes.
Performative prediction is also an important ordinary rival. If a prediction, score, or metric changes behavior because people act on it, but no incompatible probe frame, order-sensitive reading, contextual-probability cue, or instrument-like state/export support load remains, try performative-prediction analysis and the ordinary C.16, A.10, and B.3 patterns first. Keep C.26.1 only for the residual probe admissibility question.
Finish conditions
The pattern emits one of these results:
Probe-coupled context-cut worked use slice
This worked use slice is not a standalone pattern. It tests DDD and bounded-context work when the context cut is not only discovered but also changes meaning, coordination, export validity, or viability.
Ask: was the bounded-context cut merely discovered, or did the workshop, dashboard, API extraction, bridge, split, merge, or orchestration change alignment, ownership, vocabulary, export validity, or viability?
Boundary interaction under concern and operational sequence
The boundary interaction under concern is a boundary interaction used as evidence, export, comparison input, or architecture decision input. The interaction may be a meeting, question sequence, dashboard, metric, API read, survey, workshop, event stream, canary, test harness, service split, bridge, message, or management review. The pattern is active only when that interaction participates in the represented state enough that passive-read wording or unjustified lossless boundary-to-decision inference would change the decision.
The pattern governs one move: convert an apparently passive boundary read into a typed probe-coupled boundary decision. That decision says what the interaction read, what it changed, what the output can support, what it cannot support, and which neighboring FPF pattern takes over if the question is really bridge, measurement, evidence, work, decision, or viability.
Action path:
- Name the boundary or relation being crossed.
- Name the probe lane, including the concrete artifact or work act that produced the output.
- State the false passive reading: what the team would have assumed if the probe were only a window.
- State the pre-probe hypothesis and the observed or inferred post-probe state.
- State the evidence carriers and uncertainty posture.
- State the export loss, memory, order effect, or frame effect that makes the output not faithful enough for the declared use.
- Choose the finish result: keep boundary with probe note, redesign probe, order, or frame, redesign bridge or export, change the split, merge, or orchestration, or apply a neighboring FPF pattern.
Required output: produce a probe-coupled interaction reading, a corrected use of the output, and, when it would reduce the problem, a redesign or decoupling move for the probe, order, frame, bridge, metric, dashboard, API read, or boundary interaction.
This sequence is deliberately small. It is the boundary analogue of the C.11 local choice pass: the pattern should end with a usable result, not with a richer vocabulary label.
Well-formed probe-coupled boundary state
A probe-coupled boundary decision is usable only when the record states all of the following:
- the boundary, context bridge, service interface, team boundary, role relation, authority relation, or system edge involved;
- the probe lane and output carrier;
- the state reading before the interaction and the state reading after the interaction;
- the state-change evidence, including traces, changed labels, changed priorities, changed timings, changed routines, changed bridge fields, or changed downstream decisions;
- the local stop condition: which use the output does not support without another pattern;
- the neighboring FPF pattern that would carry the other claim.
The record is unfinished when any of these remains true:
- the output is named, but the operation that produced it is hidden;
- the operation is named, but the state that changed is not named;
- the state changed, but the decision that changes because of that fact is not named;
- the bridge/export loss is stated only as a vague warning rather than as a concrete non-admissible use;
- the same interaction is alternately treated as evidence, command, measurement, and bridge without role split.
The minimal admissible output is often enough: "this dashboard value is probe-coupled evidence for readiness behavior under window W"; "this workshop work changed alignment and therefore the workshop note cannot be treated as passive discovery"; "this API read is a non-neutral observation under these interface semantics"; "this context cut needs both F.9 bridge loss and C.26.1 probe-coupling treatment."
Probe, observable, output, and carrier split
Do not identify the thing being asked with the method that asks it, the output that appears, or the output carrier.
This split prevents a common mistake: "the dashboard says ready" hides at least four objects. The dashboard definition, the displayed result, the behavior it changes, and the readiness decision are distinct.
Reroute and disambiguation guide
Use this guide when a draft says that a boundary, system, team, or service is "coupled", "aligned", "interacting", "measured", "exported", "synchronized", or "read".
When relation wording is load-bearing, do not mint a relation token here. Keep the sentence as local explanatory prose or apply A.6.P or F.18 to reusable relation work.
Positive examples and near misses
The positive examples are intentionally ordinary. QL value here is not exotic formalism; it is noticing that a read, metric, workshop, or interface often participates in the state it later claims to report.
Evidence posture for probe-coupled claims
Use the least-committing evidence posture that still supports the intended use.
Do not make QLP-3 the ordinary entry cost. Most practical C.26.1 use lives at QLP-0 or QLP-1, with escalation only when the output is reused or carries higher consequence.
Archetypal Grounding
Tell: A team runs a service-boundary workshop after a series of incidents. The first map says "Payments is separate from Checkout". A week later, incident triage and backlog priorities have changed because the workshop reframed payment failure as a customer-promise risk.
Show, System side: the teams, services, dashboards, event stream, workshop format, and escalation routine are part of the boundary situation. The workshop is not only a carrier of information; it changes alignment and future work.
Show, Episteme side: the minimal evidence-bound claim is not "the workshop discovered the true topology." It is "the workshop work functioned as a probe lane that changed the represented boundary state and exposed export loss across Checkout and Payment." The next admissible move is a boundary or probe decision plus F.9 bridge notes.
Bias-Annotation
This pattern biases authors against passive-reading convenience. That bias is useful when dashboards, workshops, surveys, and API reads are treated as if they carry state without changing it.
The pattern also biases authors against overusing QL. It keeps ordinary intervention, ordinary message passing, ordinary bridge loss, ordinary API semantics, and ordinary work enactment with their existing FPF patterns when no probe-coupled reading remains.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
This pattern makes boundary decisions more honest. It turns "the workshop showed the split" into "the workshop both showed and changed the split-relevant state." It turns "the dashboard says ready" into "the dashboard is probe-coupled evidence with a limited decision use."
The cost is that some familiar artifacts lose false authority. Dashboards, workshops, surveys, API reads, and messages remain useful, but they no longer get to pretend they are always neutral windows.
Rationale
The pattern exists because boundary work is where the QL lens becomes practically visible fastest. Teams already experience dashboard effects, workshop effects, order effects, and bridge loss. The pattern gives those experiences a lightweight, typed, ordinary-pattern-compatible form.
The pattern is not a generic interaction theory. It is a boundary/probe repair for cases where passive read or unjustified lossless-transfer reading is materially false.
SoTA-Echoing
Worked-use-slice discipline from these rows:
- start from the ordinary FPF pattern before QL wording;
- show the concrete operation that produced the output;
- show the state update or export loss that changes the decision;
- keep relation tokens local unless
A.6.P/F.18gives them a reusable declaration; - keep source-formalism language as modeling support, not as pattern-body ontology.
Relations
- Builds on:
C.26,A.6,A.6.B,A.6.P,F.9,A.15,C.16,A.10,B.3,C.25,A.1.1. - Coordinates with:
C.26.2when coordinated work evidences a non-exportable distributed state;C.26.3when the boundary interaction changes a viability envelope. - Carries: a worked use slice inside
C.26.1:4.3, not a standalone pattern or relation token. - Does not mint:
U.Probe, a new boundary kind, or reusable relation predicates. - Name posture:
Probe-Coupled Boundary Interactionnames a boundary and probe relation, notEntangled Boundary,CoupledBy(...),Interaction Field,State-Changing Communication, or a reusable relation token. Relation wording remains local untilA.6.PandF.18ratify it.
C.26.1:End
Enacted Distributed State Evidence
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
Use this pattern when coordinated work, behavior, or trace patterns give evidence that a team, organization, service mesh, market, or other collective system is acting from a state that no single participant report, survey, policy sentence, dashboard, or API export faithfully carries.
The pattern supports only a minimal evidence-bound claim. It lets an author say that coordinated work, behavior, or trace patterns are consistent with a distributed-state reading during a declared window, while keeping the claim tied to carriers, probes, rival explanations, and export loss.
Plain glosses:
collective bearer: the declared team, organization, service mesh, market slice, or otherU.Systemwhose coordinated work, behavior, or trace pattern is being read.coordinated work or behavior: role-work, service behavior, market participant traces, routine, commitment, artifact use, or coordinated action.distributed-state reading: a minimal evidence-bound interpretation of coordinated work or behavior, not a new hidden group entity.carrier: a log, trace, artifact, commitment, routine, dashboard, report, API response, or document that grounds but does not equal the state.faithful-enough export: a representation good enough for the current decision; when it is not faithful enough, state what was lost and why.
Problem
Teams often need to talk about latent alignment, readiness, market posture, service-mesh behavior, or an enacted "we already decided" before one explicit representation exists. Without a pattern, they oscillate between two bad options.
One option is magic language: "the organization knows", "the culture decided", "the market wants", or "the service mesh understands". The other option is false reduction: a survey answer, policy sentence, dashboard, or report is treated as the whole state.
Both fail. Coordinated behavior may evidence a real working state, but it does not automatically identify a durable mind, internal representation, causal mechanism, or faithful-enough export for the intended use.
Forces
Solution
Model the claim as evidence-bound U.Episteme over a declared collective U.System. Do not make the distributed state a bearer-independent thing. Do not treat a survey, dashboard, report, or API response as the state itself.
If the bearer is a market slice or service mesh, declare whether it is a collective U.System, delivery system, trace population, or evidence set. Do not infer systemhood from coordinated-looking traces alone.
The primary evidence family is coordinated work, service behavior, market participant traces, distributed cognition, routine dynamics, team cognition, work traces, and socio-technical evidence. QL enters only when probe, frame, export, incompatible read, or carrier/export structure that is not faithful enough for the declared use changes the admissible state reading.
The canonical EDSE move is to separate the factorable part from the coordination residue before making the minimal state reading:
- state what ordinary routines, policies, incentives, shared stimuli, dashboard-following, or copied artifacts explain;
- state what the carriers show;
- state what residue remains as a minimal state reading;
- state what action this residue supports.
Start with this recognition note:
Use the fuller EDSE record below when the reading will change coordination, be reused, be contested, support evidence, or leave the immediate local discussion.
Full EDSE record:
Minimal claim principle
Preferred wording stays close to observed work:
- "During window W, the incident-response organization acted consistently with a rollback-readiness posture, evidenced by release timing, escalation criteria, and shared trace use."
- "The service mesh exhibited a coordinated throttling regime under policy P, evidenced by route changes and saturation traces."
- "Market traces support an expectation-shift claim under probe Q, with media amplification still a rival explanation."
Avoid wording that asserts a heavier claim, such as "the organization decided", "the market knows", or "the team has a distributed mind", unless another FPF pattern and evidence requirement independently support it.
Finish conditions
This pattern emits one of these results:
Rival explanation rule
Before using this pattern, name the principal ordinary rivals:
Export-loss discipline
The phrase "not faithfully exportable under current probe and bridge conditions" is supported only when the text says:
- what export was attempted;
- what would have counted as faithful enough for the current decision;
- what state, coordination, evidence path, timing, role alignment, option structure, survivor relation, or use limit was lost;
- whether the loss comes from bridge, measurement, representation, audience, timing, state change, or another cause;
- whether a more discriminating probe, bridge, representation, or time window could produce a higher-fidelity export.
Compound-state decomposition card
When the distributed-state reading is load-bearing, state the decomposition explicitly. Its practical purpose is the canonical EDSE move: ordinary rivals first, carriers second, coordination residue third, admissible use or action invitation fourth.
Evidence-bound state reading and claim floor
The evidence-bound state reading is an evidence-bound U.Episteme reading over coordinated work, behavior, or trace patterns by a declared collective U.System. The pattern does not govern an inner group entity, a culture substance, a market mind, a hidden service intelligence, or a reusable kernel state kind.
The minimal state-reading move is to turn coordinated work, behavior, or trace patterns into the minimal useful state reading while keeping the reading bound to:
- the collective bearer and its boundary;
- the observed work and evidence carriers;
- the time window and persistence support;
- the probe or export conditions;
- the ordinary rival explanations;
- the current export loss and higher-fidelity export possibility;
- the next neighboring FPF pattern if a claim requiring additional evidence is needed.
This pattern is useful because many real work states are enacted before they are articulable. A team may behave as if a release freeze exists before any single person states it cleanly. A service mesh may exhibit one routing posture before any one dashboard carries the whole situation. A market may shift expectations before any one survey faithfully exports the shift. The pattern lets FPF say that much, and no more, without pretending that one carrier is the state.
Operational evidence sequence
Action path:
- Name the collective bearer as a declared
U.Systemboundary, not a bare social label. - Name the coordinated work, behavior, or trace pattern being read through
A.15: actions, routines, commitments, role-work, service behavior, market participant traces, artifacts, or timing. - Name the evidence carriers through
A.10so the reading is inspectable. - State the time window, persistence support, decay/refresh condition, reprobe cost, and ordinary rival explanations.
- Name the candidate state reading only as a minimal evidence-bound
U.Epistemereading. - State the attempted export and what it lost.
- State the minimal supported claim, the supported action or use it carries now, and the other uses that remain unsupported by this reading.
- Add
B.3assurance only when consequence level, audit, release, or accountability use demands it.
Required output: produce a minimal evidence-bound distributed-state reading, the time window that bounds it, the live rival explanations, and the supported bounded action or use that follows from that reading.
The pass is complete only when the resulting sentence can survive without magical collective wording. A good output sounds like:
During incident window W, the incident-response organization acted consistently with rollback-readiness posture P, evidenced by deployment queue changes, escalation messages, rollback artifacts, and support-routing changes; this reading is not faithfully exported by survey S because S loses timing, role-work, and trace linkage.
That sentence is narrower than "the organization decided", but it is much more useful. It supports adjusting incident communication and release-triage posture during window W; it does not support a durable culture claim or release-readiness assurance claim.
Well-formed EDSE record
A usable EDSE record has this shape:
The syntax is illustrative. The content is not optional when the state reading is used for a decision.
Well-formedness constraints:
collectiveBeareris a declared collective system, not a metaphorical subject.evidenceCarriersare inspectable publication units, traces, records, commitments, logs, or work-result records.timeWindowbounds the claim; persistence beyond that window needs its own support.ordinaryRivalsinclude at least the principal policy, incentive, routine, shared stimulus, dashboard-following, copied-artifact, or social-desirability explanation that could explain the same coordination.minimalSupportedClaimstates only what survives after rivals and export loss are named.unsupportedUsenames the neighboring claim or use that the current claim does not carry without applying the neighboring FPF pattern governing that claim that governs that claim.
Carrier, probe, report, and state split
The pattern keeps four objects separate:
A survey can be an evidence carrier and a probe. It is not the distributed state. A policy can be a carrier or a routine explanation. It is not automatically evidence that everyone shares one state. A dashboard can be a carrier, a probe, and a behavior-changing instrument. It is not automatically faithful enough for the intended use.
Case bank and near misses
Evidence posture and confidence
EDSE claims become useful when the text says how much consequence the evidence can carry.
For QLP-0 or low-consequence QLP-1, do not force persistence, decay, or reprobe-cost fields when the claim is explicitly momentary and the bounded action is local. Name the bearer, carriers, window, minimal reading, rival, practical change, and local stop; add the fuller temporal fields only when reuse, contest, or consequence makes them load-bearing.
The ordinary EDSE claim is minimal but actionable. It says: "this coordinated work or behavior supports this bounded reading for this use." It does not say: "the collective has one hidden durable state that a report can copy."
Archetypal Grounding
Tell: During an incident, several teams independently stop non-critical releases, reroute support, and prepare rollback evidence before any single manager issues a written decision. Later, a survey asks whether "we had decided to freeze release", and answers conflict.
Show, System side: the collective bearer is the incident-response organization during a declared incident window. Its carriers include deployment logs, meeting records, escalation messages, rollback preparation, support routing, and release queue changes.
Show, Episteme side: the supported claim is minimal. The organization acted consistently with a release-freeze readiness posture during window W. The claim does not say every participant knew the same proposition or that the coordination exists apart from the declared evidence carriers. A management directive, playbook, or dashboard effect remains a rival unless evidence narrows it.
Bias-Annotation
This pattern biases authors toward minimal evidence-bound claims and explicit evidence. That may feel conservative, but it makes distributed-state language usable without magic.
It also biases authors to keep primary grounding in distributed cognition, team cognition, organizational routines, socio-technical work, and evidence practice. The QL lens is secondary and only becomes active when probing, exporting, or comparing the state changes or loses load-bearing structure.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
This pattern lets FPF discuss enacted collective states without mysticism. It gives authors a disciplined way to use traces, routines, coordinated work, and export loss in one minimal claim.
The cost is that many attractive claims become narrower. That is the point. Minimal evidence-bound claims are often more useful than confident but ungrounded stories.
Rationale
Existing FPF patterns can carry parts of the support requirement, but no single ordinary pattern makes the combined minimal distributed-state claim easy to write. A.15 carries work, A.10 and B.3 carry evidence and assurance, F.9 carries export loss, and C.16 carries formal measurement. C.26.2 coordinates those neighboring-pattern applications for the specific case where coordinated work evidences a non-articulated state.
SoTA-Echoing
Worked-slice discipline from these rows:
- ground the claim in coordinated work before QL vocabulary appears;
- state the evidence carriers and time window before stating the state reading;
- name rivals before retaining a distributed-state claim;
- treat survey/report/dashboard outputs as carriers or probes, not as the state;
- escalate to measurement, evidence, assurance, or authority patterns when the use requires measurement, evidence, assurance, or authority support.
Relations
- Builds on:
C.26,A.15,A.10,B.3,F.9,C.16,E.17.EFP,C.11. - Coordinates with:
C.26.1when the probe changes the state being evidenced;C.26.3when the coordinated state is part of viability-envelope regulation. - Does not mint:
U.DistributedState, a bearer-independent group entity, or a durable state beyond declared evidence and time window. - Name posture:
Enacted Distributed State Evidencenames an evidence-boundU.Epistemereading over work carriers, notDistributed Mind,Collective Consciousness,Social Field, orOrganization Knows.
C.26.2:End
Viability-Envelope Boundary Regulation
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
Use this pattern when architecture work is maintaining, recovering, or changing viable operating ranges across boundaries. The working problem is not "optimize one metric"; it is "keep a bundle of characteristics inside a viable region while disturbances, probes, actuators, boundary conditions, and operating regimes change."
Most envelope work covered by this pattern is ordinary control, quality, SRE, causal, or work discipline, not QL. FEP, allostasis, and active inference are source analogies for envelope discipline, sensor and action coupling, and partial observability; ordinary control, SRE, quality-bundle, causal, and work patterns remain primary unless probe, order, export, or coarsening cue remains load-bearing after ordinary viability, quality, dynamics, measurement, boundary, and work patterns have carried their part.
Plain glosses:
viability bearer: theU.System, collective system, delivery system, role configuration, organism-as-system, or explicitly modelled market slice whose viable range is being regulated.protected promise / function: theU.PromiseContent, stakeholder value, function, operating regime, commitment payload, or delivery promise the bearer is trying to keep viable.service situation: anA.6.8facet-binding lens that identifies access point, delivery system, provider principal, promise content, commitment, delivery work, and evidence; it is not itself a new root bearer unless the relevant system facet is declared.viability envelope: the region where the bearer can still keep the relevant promise or function, across several dimensions.envelope variable: one characteristic that must stay within bounds, such as latency, reliability, support load, compliance exposure, safety margin, energy, or operator attention.actuator: a work move that can change the situation, such as cache policy, throttle, staffing, routing, bridge rewrite, protocol, access, escalation, or measurement design.allostasis: preserving function by changing settings, environment, boundary condition, actuation, or operating regime when circumstances change.
Problem
Teams often collapse viability into one dashboard value or fixed target. They optimize latency and damage operator load. They improve availability and increase compliance exposure. They preserve one metric while exhausting the team, hiding risk, or making recovery slower.
A second failure is passive sensing. A metric, probe, dashboard, alert, or health check is treated as a neutral window into viability, even when it changes behavior, hides unmeasured dimensions, or becomes an actuator through Goodhart effects.
A third failure is static stability. Teams say "keep the system stable" as if stability always means holding one internal variable fixed. In real architecture work, preserving viability may require changing environment, access, staffing, caching, throttling, routing, protocol, context split, or measurement design.
Forces
Solution
Use C.25 / U.Dynamics alone for ordinary envelope work. Use C.26.3 only when the viability-envelope reading is distorted or constrained by probe, frame, export, coarsening, or incompatible representation cue. Otherwise use ordinary viability, quality-bundle, dynamics, measurement, boundary, and work patterns.
Start with this recognition note:
Use the fuller envelope-regulation record below when the viability reading will change a metric, actuator, boundary, staffing, routing, promise, or evidence decision.
Full envelope-regulation record:
Homeostasis and allostasis reading
Homeostasis means keeping a parameter or bundle inside viable bounds. Allostasis means preserving functioning by changing internal settings, external environment, boundary conditions, actuation, or operating regime when circumstances change.
Do not say that all architecture is homeostasis. Say that some architecture decisions are viability-envelope decisions.
Finish conditions
This pattern emits one of these results:
Metric-induced distortion
Treat sensors, probes, dashboards, alerts, and metrics as possible participants in the viability relation, not as neutral windows by default.
Conditional dynamics detail
When rate, acceleration, second-order change, inertia, damping, resistance, effort, or actuator strength is load-bearing, state:
- what rate or acceleration matters;
- what slows or speeds the change;
- whether the rate of change itself is changing, rebounding, overshooting, or damping out;
- which inertia is useful and which is harmful;
- which actuator can actually change the envelope fast enough;
- which evidence shows the dynamic state.
If those variables are not load-bearing, do not force dynamics machinery into the case. The short recognition note or the full envelope-regulation record is enough.
Primary EntityOfConcern and operational sequence
The primary EntityOfConcern is a viability-envelope claim or plan. It is not a generic quality score, not a control-theory survey, and not a biological analogy. The claim says that some bearer can keep a promise, function, or operating regime viable only if a set of variables remains inside a usable region under declared disturbances, probes, sensors, actuators, boundary conditions, and adaptation costs.
The first useful move is to turn a one-scalar stability story into an inspectable envelope-regulation decision.
Action path:
- Name the viability bearer and the promise or function being preserved; if service or market language is used, declare whether the bearer is a collective
U.System, delivery system, trace population, evidence set, or relevantA.6.8facet-binding before treating the situation as a bearer. - Name the envelope variables and the viable range or qualitative boundary for each.
- Name the disturbance or regime change.
- Name sensors/probes and say whether they only report, also frame, or also change behavior.
- Name available actuators and who or what can enact them in time.
- State the boundary condition being preserved or changed.
- State the trade-off condition and adaptation cost.
- State the failure mode and re-probe/destabilization condition.
- Add dynamics detail only if rate, inertia, damping, latency, resistance, or acceleration changes the decision.
Ordinary output: produce a viability-envelope record with envelope variables and viable region, a disturbance/sensor/actuator map, and a trade-off, adaptation, and failure condition that tells the practitioner what changes in the work.
The output should tell a practitioner what changes in the work: redesign the metric, change cache policy, adjust staffing, reroute traffic, split or merge a context, add a bridge note, change an escalation promise, or drop the envelope claim.
Viability envelope record
A usable envelope record is a pattern-local writing card, not a constructor. Use the fields below when envelope regulation is load-bearing:
The record is not U.ViabilityEnvelopeRegulation, not a new kernel kind, and not a universal architecture constructor. It is a pattern-local normal form for writing envelope work clearly.
Well-formedness constraints:
- the bearer is a declared
U.System, collective system, delivery system, role configuration, organism-as-system, explicitly modelled market slice, or other explicitly bounded bearer of viability; - service-situation language identifies its
[A.6.8](/generated/patterns/A.6.8)facets rather than treating the situation label as a root bearer by itself; - at least two envelope dimensions are visible when the claim says "viability" rather than one ordinary metric;
- at least one actuator is named when the text proposes regulation rather than only diagnosis;
- the actuator has an authority and latency story, otherwise the recommendation is only a wish;
- the adaptation cost is named, because allostasis hides cost when phrased as "stability through change";
- the failure mode is named, because viability is otherwise indistinguishable from optimism.
Sensor, probe, actuator, and metric split
Do not let one dashboard value stand for the whole envelope.
A metric value or dashboard carrier is not an actuator by itself. A measurement regime, publication act, alerting workflow, or governance routine may function as an actuator when the system responds through work: routing changes, escalation changes, staffing changes, cache policy changes, access changes, or boundary changes. An actuator can damage another envelope variable while repairing the one that triggered the work.
Homeostasis, allostasis, and architecture work
Homeostatic wording is useful when the work preserves one variable or bundle inside a stable range. Allostatic wording is useful when the work preserves function by changing settings, boundary conditions, environment, access, staffing, routing, protocol, cache policy, or operating regime.
Use the minimal reading that carries the case:
Do not call every adaptation allostasis. The term earns its place only when stability-through-change is the useful architecture reading.
Case bank and near misses
Source-to-pattern translation
Allostasis, active inference, FEP, Markov blankets, and computational-boundary sources are useful here only after translation into FPF architecture terms:
This translation keeps the pattern practical for architects. The reader should be able to move from a source line to an action: change a metric, change a probe, change an actuator, change a boundary condition, state a trade-off, or reroute.
Archetypal Grounding
Tell: A platform team tries to preserve checkout latency during a traffic spike. The first move is to increase cache aggressiveness. Latency improves, but support load rises because stale payment-failure status causes confused customer contacts.
Show, System side: the viability bearer is the checkout/payment service situation. Envelope variables include latency, payment correctness, support load, customer-promise reliability, and operator attention. Actuators include cache policy, retry policy, routing, dashboard query, escalation promises, and context bridge changes.
Show, Episteme side: the supported claim is not "latency is the viability state." It is an envelope-regulation claim: latency was preserved by an actuator that damaged another envelope dimension. The repair is to state the trade-off, adaptation cost, actuator authority, and failure mode.
Bias-Annotation
This pattern biases authors against scalar comfort. That bias prevents "green dashboard" from replacing viability.
It also biases authors toward actionable architecture work. The pattern asks who or what can actually change the boundary, access, protocol, staffing, cache, throttle, bridge, or measurement setup, and how quickly that action can matter.
The pattern may feel too broad if it is applied to every quality concern. It is not for every quality concern. Use C.25 alone when one quality bundle or metric can be handled without envelope, disturbance, boundary condition, actuator, adaptation cost, or viability failure mode.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
This pattern helps architects see stability-through-change. It supports decisions such as throttling, staffing, routing, protocol redesign, context split/merge, cache changes, measurement redesign, and escalation changes as envelope-regulation moves.
The cost is that simple metric stories become less simple. That is acceptable when the metric story hides the actual viability relation.
Rationale
Ordinary quality-bundle work does not always show boundary conditions, actuators, disturbances, adaptation cost, and failure modes together. C.26.3 coordinates those elements while preserving ordinary FPF patterns.
The QL lens is secondary. It matters when the way viability is probed, exported, or coarsened changes the state reading or admissible use of the representation.
SoTA-Echoing
Worked-slice discipline from these rows:
- state the envelope before importing source terminology;
- translate source terms into selected structures,
ArchitectureOf@Contextrelations, architecture descriptions, structural views, or named C.30 subcases; - keep sensors, probes, actuators, and metrics distinct;
- state adaptation cost and failure mode;
- apply ordinary quality and measurement patterns to one-scalar quality concerns.
Relations
C.27 temporal-claim relation.
-
C.27 may flag: braking, throttling, cadence, recovery, or stabilization moves in claims such as slow rollout protecting support capacity, request throttling preventing collapse, or cadence change preserving attention/team health.
-
This pattern keeps: viability bearer, protected promise/function, viable region, disturbance, sensor/probe/action split, adaptation cost, and failure mode.
-
Non-admissible use: stabilization wording is not a viability envelope, and C.27 is not the pattern for all stability-through-change claims.
-
Exit: if the claim being made is only better quality, healthier team, or more resilient service without a declared viability envelope, use C.25, E.13, or the relevant quality/proxy/value pattern rather than C.26.3 or a C.27 profile.
-
Builds on:
C.26,C.25,U.Dynamics,A.6,A.15,C.16,A.10,B.3,A.3,A.19,C.18,C.19. -
Coordinates with:
C.26.1when sensors, probes, dashboards, or metrics change represented state;C.26.2when coordinated work evidences the envelope state. -
Does not replace: ordinary quality-bundle patterns, generic control theory, full FEP doctrine, or biological homeostasis claims outside FPF bridge and loss discipline.
-
Name boundary:
Viability-Envelope Boundary Regulationnames architecture work over a viability envelope and boundary/action conditions, notHomeostasis Pattern,Allostasis Doctrine,Control Ontology,Quality Optimization Pattern, orViability Substance.
C.26.3:End
Temporal Claim Adequacy: State Readings, Temporal Trends, and Intervention-Sensitive Temporal Change
Type: Claim-adequacy pattern Status: Stable Normativity: Normative unless marked informative
Plain-name. Temporal claim adequacy.
Primary EntityOfConcern. C.27 concerns authored temporal claims: prose, plans, benchmark lines, dashboards, method notes, promises, or explanations that treat state, rate, rhythm, recovery, braking, coasting, redirection, stabilization, or rate-change as sufficient for some practical use.
Use this pattern when a claim about speed, rhythm, throughput, recovery, convergence, rollout, adoption, braking, coasting, redirection, or stabilization is being used to change action and therefore must name the temporal reading, effort or intervention, window, resistance or cost, evidence relation or assumption relation, supported use, unsupported use, and reopen condition.
Do not use this pattern when the wording is ordinary prose, a positive temporal aspect with no adequacy question, a state reading or rate reading whose measurement construction is enough, a formal U.Dynamics model, an actual work trace, a benchmark harness, a service promise, a quality judgement, or a residual quantum-like probe case without an intervention-sensitive temporal claim.
C.27 in 60 seconds. A trend is not yet an intervention model. Use C.27 only if:
- temporal wording is used to justify action, comparison, budget, gate, promise, assurance, or an explicit relation to another FPF pattern;
- the difference between state, rate, and rate-change changes supported use;
- a small card can name the temporal reading or bearer, intervention, window, resistance or cost, evidence relation or assumption relation, supported use, and unsupported downstream claim, effect, use, or reopen trigger.
For local diagnosis or planning, C.27 usually ends with one Dyn2TemporalClaimAdequacyCard. Plain references are enough while the use stays local. Boundary-crossing use can require a Dyn2TemporalClaimProfile, but the profile remains a pattern-local authored temporal-claim adequacy record, not the dynamic system, not the work trace, not a publication role, and not the default output.
Split boundaries. Use C.27.TA to name positive temporal aspects such as time window, freshness, cadence, rhythm, trajectory, recovery timing, stabilization timing, effort over time, inertia, or refresh condition. Use A.3.4 when the question under repair is the bounded transformation itself. C.27 may judge an authored temporal claim about a transformation, but it does not identify the U.Transformation value, supply its slot relation, or turn a temporal reading into evidence, permission, or work.
Description and support discipline. The described system, work, practice, method, service, or benchmark is not the C.27 record. A Dyn2TemporalClaimAdequacyCard or Dyn2TemporalClaimProfile is an authored description of temporal-claim adequacy; a document, table, page, report, or card may carry that description. supportedUse and unsupportedUse state the pragmatic reach of that authored temporal-claim description. Use an evidence relation, model assumption, source-use reference, planning assumption, or named FPF pattern relation for the reason a reading is credible; do not let bare "support" do hidden ontology work.
Problem frame
Causal-use boundary
C.27 can say that a temporal claim is dynamic, intervention-sensitive, rate-sensitive, inertia-sensitive, braking-sensitive, coasting-sensitive, or rhythm-sensitive. When the temporal claim already depends on a causal-use question, causalInterventionSpecRef, comparator or counterfactual, estimand, assignment or intervention window, causal follow-up window, outcome measure, causalAssumptionSetRef, rivalCauseSetRef, identification strategy, counterfactual-sampling realizability claim, CausalUseEvidenceDesignRecord, supported causal use, or unsupported causal use, cite C.28 as the governing causal-use source.
What changes in practice: a sentence such as "this effort changes adoption speed" may remain a Dyn2 temporal claim, but "this intervention causes adoption speed to improve" must also declare its C.28 causal-use class, supported causal use, and unsupported causal use.
What this does not authorize: C.27 does not estimate causal effects, certify counterfactual comparisons, or judge counterfactual sampling realizability; it keeps temporal claim adequacy, rate-change, effort, inertia, rhythm, braking, coasting, and intervention-sensitive temporal wording.
FPF already has established constructs and patterns for time, work, resources, measurement, CharacteristicSpace, dynamics laws, planning, publication, and quantum-like probe and frame issues. What is missing is a cheap claim-adequacy lens for authored temporal claims when a state or rate reading is used as if it supplied the evidence relation, assumption relation, or pattern relation for a rate-change, rhythm-change, regime-change, braking, coasting, redirection, recovery, or stabilization claim.
The first-minute working situation is simple: a manager, method author, researcher, operator, or agentic-tool planner says that something should speed up, slow down, converge faster, recover sooner, sustain rhythm, improve throughput, accelerate learning, brake risk, or redirect effort. FPF should help the reader ask whether the claim is only a state reading, only a rate or trajectory reading, or an intervention-sensitive claim about changing a rate under effort, resistance, rhythm, feedback, constraint, or cost.
What goes wrong if missed: the text measures or names a rate and then behaves as if it knows how to change that rate. This produces speed-only management, benchmark theater, hidden promises, causal overclaim, effort-free acceleration, rhythm-as-vibe, and false QL relevance.
The intended FPF gain is not "add physics metaphors". The gain is a compact thinking-and-action discipline for cases where speed talk hides effort, timing, resistance, evidence, scale, reversibility, and supported use.
Anti-case: if a phrase uses speed or rhythm only as ordinary explanatory prose, or if a state or rate reading is enough for the use, C.27 should be easy not to use.
Use C.27 because it gives a working reader a useful pause before acting on speed talk. The intended use is not to formalize every temporal sentence. The intended use is to stop a small set of expensive mistakes:
- a rate is measured and then treated as if the intervention mechanism is known;
- visible throughput improves while hidden queues, rework, quality loss, or burnout worsen;
- a past slope is treated as a future control model;
- a local rate-change is projected across scale without aggregation relation or evidence;
- rhythm or cadence is used as a vibe label with no bearer, timing reference, window, proxy relation, evidence relation, or supported use;
- a planning note becomes a
C.28-governed causal-use claim, benchmark result, service promise, or assurance claim; - quantum-like modeling is treated as relevant merely because the text contains discreteness, types, probes, tokens, or state-space wording.
The positive reader use compact is short:
- If the statement is only a state reading, use the ordinary state relation or evidence relation.
- If the statement is only a rate or trajectory reading, use measurement and sampling-window discipline.
- If the statement claims that effort, policy, input, rhythm, constraint, or resistance changes the rate, use the least-committing C.27 record that changes supported use.
- If the claim crosses the local working boundary into comparison, benchmark,
publication, gate, assurance, public promise, durable rationale,
reusable method, formal use, control use, prediction use, or cross-context transfer,
strengthen the C.27 record and name the existing patterns that carry the
specialist claim questions. Local decision-use can often remain a
Dyn2TemporalClaimAdequacyCard.
This is the central anti-bureaucracy invariant: no C.27 record unless the Dyn0, Dyn1, and Dyn2 distinction changes interpretation, decision-use, evidence relation, resource allocation, benchmark reading, supported use, or reopen trigger.
Dyn2-Affordability: a correct C.27 use leaves less work behind than the ambiguity would have caused. If applying C.27 creates more work than the temporal distinction changes, stop.
At the point of use, the C.27 question is concrete. Before adding a C.27 record, recover:
- what rate, rhythm, trajectory, regime, or stability claim is in play;
- whether the text is reading state, reading rate, or claiming rate-change;
- what effort, input, policy, method, intervention actor reference, role assignment, or resource envelope is supposed to change the temporal behavior;
- what resists, delays, stores momentum, introduces lag, or makes reversal costly;
- what evidence, trace, assumption, model, or diagnostic judgement supplies the reason for the reading;
- what use the claim can carry and what downstream claim, effect, or use remains unsupported;
- when the simplified reading should reopen, downgrade, or cite the fuller FPF pattern that governs the other question.
The pattern buys practical action, not a vocabulary test. A person can explain the check as: "A trend is not yet an intervention model; show the effort, window, resistance, use, and reopen condition, or keep the claim narrower."
Some useful temporal observations arrive before they can carry a claim:
- the team may not only be slow; it may be unable to brake;
- the problem may not be throughput but rhythm mismatch;
- a metric may improve while operations-service demand accumulates;
- "the process sped up" may hide orders, invoices, shipments, service tickets, PRs, tests, and deployments moving through different event traces and interaction windows;
- more tool calls may accelerate activity traces without accelerating reasoning or repair.
These are temporal-claim adequacy cues, not C.27 records. C.27 should preserve their cue-only disposition. When the reader suspects a hidden Dyn2 claim question but cannot yet state temporal reading or bearer, intervention, window, resistance or cost, evidence relation or assumption relation, and supported use, the correct output is a partly-said material cue held through A.16, A.16.1, B.4.1, or B.5.2.0; it becomes a C.27 record only after the rate-change, rhythm-change, braking, coasting, recovery, stabilization, or intervention claim is explicit enough to name the card minimum.
If the question under repair is not temporal-claim adequacy, use the pattern that carries that question: C.16 for measurement, C.26 for residual QL cue, E.17.AUD for publication-unit stability, or viability or assurance patterns when the observation lacks the evidence, witness, or currentness relation needed for the viability or assurance boundary claim.
Problem
C.27 governs the adequacy of intervention-sensitive temporal claims.
C.27 does not govern:
- transition laws or reusable dynamics models, which
A.3.3 U.Dynamicscarries; - state-space or coordinate construction, which
A.19andC.16carry; - measurement construction, measurement comparability, evidence construction, provenance, assurance claim,
or evidence decay, which
C.16,A.10,B.3,B.3.4, andG.6carry as applicable; - work actuals and resource burn, which
U.WorkandGamma_workcarry; - planning structures and authorized work, which
U.WorkPlan,U.MethodDescription,C.24, and relevant planning patterns carry; - autonomy-budget declarations, guard checks, ledgers, depletion, pause or resume,
or freedom-of-action governance, which
E.16carries; - state-change or evolution loops and language-state movement, which
A.4,B.4,A.16, andB.4.1carry; C.28-governed causal-use claim, whichC.28carries, or evaluation and evidence claim, which the relevant evaluation and evidence patterns carry;- metric proxy and value substitution, which
E.13carries; - service promises, agreement text, SLA-like statements, release gates, public
commitments, and service-acceptance bindings, which
A.2.3,A.2.8,A.2.9,A.6.C,F.12, and assurance patterns carry; - benchmark harnesses, which
G.9carries; - dashboard time-series, telemetry pins, path and slice publication, pack shipping,
discipline-health slots, and refresh orchestration, which
C.21,G.12,G.6,G.10, andG.11carry; - selector publication roles, which
G.5carries only when a concrete selector-publication case consumes a dynamic benchmark result; - quantum-like probe, frame, export, or coarsening residues, which
C.26carries; - publication roles, MVPK faces, primary EntityOfConcern values of related FPF patterns, or Kernel
U.*kinds.
Dynamic-order labels are pattern-local claim classifications, not FPF kinds.
C.27 does not mint U.Force, U.Mass, U.Acceleration,
U.Rhythm, U.Practice, or U.SecondOrderProcess.
FPF gains a compact discipline for claims that otherwise hide behind words such as speed, agility, throughput, adoption, rhythm, velocity, convergence, debugging speed, service recovery, faster improvement, acceleration, braking, redirection, or cadence.
The main failure to prevent is:
A text measures or names a rate and then behaves as if it knows how to change that rate.
C.27 should make three distinctions cheap:
Dyn0: state or snapshot reading;Dyn1: rate, trend, trajectory, flow, throughput, tempo, or cadence reading;Dyn2: intervention-sensitive temporal reading: rate-change, regime transition, braking, redirection, coasting, pause, stabilization, rhythm fit, effort profile, resistance, inertia, policy effect, feedback, uncertainty, or constraint handling.
C.27 protects against the managerial speed cult. Faster is not the default value. Braking, pausing, stabilizing, redirecting, coasting, delaying, widening before narrowing, or slowing rollout can be the correct C.27 outcome.
Local temporal-value boundary:
C.27 can classify the temporal move. It does not decide that acceleration, braking, stabilization, coasting, recovery, convergence, or release speed is valuable. The FPF patterns for value alignment, assurance, promise, ethics, safety, legal, proxy, or audit concerns carry value, utility, constraint fit, harm, promise impact, and proxy distortion.
This boundary applies to claims such as "faster onboarding is better", "more throughput is better", "faster convergence is better", or "rapid release is our goal". C.27 may make the temporal claim adequate enough to inspect, but it does not turn speed into value by default.
These are claim-relation boundary tests, not keyword exclusions. C.27 may still supply a short temporal-claim note when the state, rate, rate-change, rhythm, or regime reading changes supported use. The named neighbouring pattern then carries the non-C.27 question. If the temporal distinction does not change supported use, stop before opening C.27.
Do not make C.27 the governing pattern when:
- the text only reports a state or snapshot and no rate or use distinction changes interpretation;
- the text only reports a rate, trend, throughput, cadence, or trajectory and no intervention-sensitive rate-change claim is made;
- a word such as speed, rhythm, acceleration, agility, or inertia is only a teaching metaphor or casual Plain wording;
- the issue under repair is publication-unit stability: one overloaded local head, drifting publication-unit primary entity of concern, bounded comparison, explanation faithfulness, or approval wording or action wording should use E.17.AUD, E.17.ID.CR, E.17.EFP, or the pattern that governs the downstream claim, effect, or use before C.27;
- the question under repair is whether a measure is constructed, comparable, or interpretable:
C.16carries measurement construction, with C.27 only citing the temporal C.27 relation if the measure supplies evidence for an intervention-sensitive claim; - the question under repair is a transition law, simulation, prediction, or control model:
A.3.3 U.Dynamicsand formal or evidence patterns carry the formal dynamics, with C.27 only naming the supported-use limit of the authored claim; - the question under repair is work actuals or resource actuals:
U.WorkandGamma_workcarry the evidence, with C.27 only using it as effort evidence or planning assumption for a Dyn2 claim; - the question under repair is scaling-law or elasticity adequacy: C.18.1 carries scale variables, scale window, scale probes, and scale-elasticity value, with C.27 only naming the temporal-claim adequacy question if scale change is used as the scale-variable relation for rate-change, learning, recovery, throughput, or stabilization;
- the question under repair is a work plan, tool-use plan, method description, or authorized intervention actor reference or role assignment: the planning pattern carries the plan, with C.27 only active when the plan's supported use depends on rate-change, recovery, stabilization, or braking;
- the question under repair is task-family specialization: C.22.1 carries adaptation signature fields, with C.27 only naming the temporal-claim question when learning or adaptation speed changes supported use;
- the question under repair is preserving a viability envelope under disturbance, adaptation cost, latency, operations-service demand, or boundary regulation: C.26.3 carries the envelope claim, with C.27 only naming the temporal move if braking, throttling, cadence change, recovery timing, or stabilization changes supported use;
- the question under repair is causal attribution:
C.28carries causal-use claim, and evaluation and evidence patterns carry non-causal evaluation and evidence claims; C.27 may mark the temporal claim's causal use as unsupported until thatC.28relation is satisfied; - the question under repair is a benchmark, budget, promise, service boundary, SLA-like statement, public commitment, assurance, or release gate: the relevant benchmark, boundary, promise, service, assurance, or planning pattern carries that claim or use, with C.27 only naming the temporal claim that the other pattern inspects;
- the question under repair is residual quantum-like probe, frame, export, or coarsening cue:
C.26carries it only after ordinary dynamics, work, measurement, benchmark, proxy, and assurance patterns have carried their parts.
Overlap example: "Adding review capacity for two sprints will double backlog
reduction rate and justify a budget increase" is not solved by C.27 alone. C.27
types the Dyn2 temporal-claim question; the planning pattern carries planned effort,
C.16 carries the rate or rate-change measure, the budget or planning pattern carries
approval, and C.28 carries any causal-use claim. The short
temporal-claim note is a Dyn2TemporalClaimAdequacyCard: it prevents those
patterns from missing the hidden rate-change question, but it does not replace
them.
C.27 does not introduce:
- literal Newtonian or physical ontology for organizations, practices, services, dances, learning, or work cycles;
- physical quantum ontology or quantum-like superiority;
- mandatory ODE, PDE, or calculus formalism for all temporal claims;
- new Kernel types for force, mass, acceleration, rhythm, or practice;
- a new publication role, separate pattern, law sheet, or MVPK face;
- default C.27 profiling for every temporal word;
- thin C.27 echo records when a local C.27 card or profile can cite the FPF pattern that governs the other question.
Forces
The source article contributes three practical ideas that should survive into C.27 prose.
First, the useful question is an effort-profile question, not a derivative-word question. In management, learning, tool-use, incident response, practice transfer, dance, and service operations, the relevant change is often a profile of effort over windows: impulse, scheduled push, feedback policy, adaptive regime, brake, pause, coast, or redirect. C.27 should preserve effort over time, not just a scalar acceleration label.
Second, rhythm is interval-structured. A rhythm claim needs a timing reference, bearer, window, evidence proxy or observation relation, and supported use. "Rhythm" as mood or vibe is not enough; it must be possible to recover whose rhythm, across which intervals, by which observation or proxy, and for which decision. Coupling, phase, synchronization, or entrainment-like wording is only needed when the claim depends on a relation between bearers.
Third, useful formalization improves replicable practice code. C.27 should help make a practice transferable by recording effort windows, rhythm timing references, bearer, resistance proxy, evidence relation or assumption relation, and reopen condition. It should not require equations merely because the source analogy used dynamics language.
Borrowed-frame translation:
Design alternatives:
Solution
Use the least-committing dynamic-order output that changes the supported use. Dyn0 and Dyn1 are readings in ordinary prose, not C.27 record classes; C.27 records start only when a Dyn2TemporalClaimAdequacyCard or Dyn2TemporalClaimProfile for boundary-crossing claim use is needed.
A Dyn2 classification is not evidence that a U.Dynamics model exists. It is
only evidence that the authored claim is using temporal change in a way that may
need a dynamics pattern relation if a downstream claim, effect, or use is claimed.
Normativity follows boundary-crossing use:
- normative when the claim carries decision, gate, budget, benchmark, publication, assurance, public promise, or reusable method;
- advisory when the claim is exploratory, abductive, or early planning;
- informative when the pattern teaches examples, vocabulary, or anti-patterns.
This is the ordinary first-minute reader-facing form and the main visible C.27 record for ordinary C.27 use. It remains referenced to an authored claim rather than becoming a free-standing consulting card.
Window default: for a local card, one window line may stand for claim, sampling,
effort, rhythm, and validity when the distinction does not change supported use.
Split windows only when evidence is sampled over a different interval than the
claim, effort or intervention occurs over a different interval than the outcome,
benchmark baseline, adaptation, and follow-up windows differ, the rhythm timing reference and rhythm window
differs from the measurement window, or validity or refresh depends on a separate
freshness window.
Do not add compact catch-all reason or state fields to a local card. If boundary-crossing use appears, name the actual evidence relation, evidence record, trace, measurement relation, model assumption, planning assumption, benchmark reference, [C.28](/generated/patterns/C.28) causal-use relation, promise pattern, or assurance pattern that carries the added claim. That named neighbour relation helps choose the matching dynClaimUseClass; the local card itself does not strengthen the claim.
claimText and claimRef keep C.27 tethered to the PublicationUnit or claim-carrying U.EpistemePublication that carries the temporal claim. temporalReadingOrBearer separates the bearer and the temporal reading from the intervention, so "we accelerate the team" gets repaired into a rate, rhythm, or trajectory question. move protects against
acceleration bias: braking, pausing, stabilization, recovery, coasting,
widening, and narrowing are also Dyn2 moves when they change supported use.
If the author cannot answer these in short lines, the correct repair is usually
to clarify the claim, not to escalate immediately to a full Dyn2TemporalClaimProfile.
Compact C.27 rhythm-claim discipline:
Cadence as observed interval rate may be Dyn1. Rhythm becomes Dyn2 only when interval structure, effort pattern, coordination, recovery, stabilization, or intervention-sensitive use changes supported use.
This discipline keeps rhythm connected to a dynamic claim. A plain "release cadence" or "workshop rhythm" does not need phase or entrainment language unless the supported use depends on a relation between bearers. If the rhythm wording does not change a rate, intervention, recovery, coordination, or supported-use reading, it should remain ordinary prose rather than make C.27 relevant.
Compact C.27 coasting-claim discipline:
Coasting becomes a full Dyn2TemporalClaimProfile block only when a promise,
gate, assurance, benchmark, cross-scale transfer, or public comparison depends
on continued movement or stability after effort changes or stops. Local cases
such as adoption continuing after incentives stop, quality degrading after
acceleration stops, operations-service demand continuing after rollout, a trained practice
persisting after training, or a queue draining after intervention ends usually
need only the card fields above.
Coasting and debt fork:
- Use
dyn2CoastingClaimBlock?when supported use depends on continued movement, stability, adoption, queue drain, practice persistence, or operations-service demand after effort changes or stops. - Use
dyn2DebtHysteresisBlock?when supported use depends on residue, reversibility, hidden cost, delayed damage, repayment, braking, or recovery plan. - If both relations apply, coasting describes continued motion or stability; debt and hysteresis describe what remains and how costly reversal or recovery is.
Rare boundary-crossing profile reference
Skip this reference subsection for ordinary local diagnosis and planning. The first C.27 output remains the one-screen Dyn2TemporalClaimAdequacyCard; open the Dyn2TemporalClaimProfile reference only when the authored temporal claim is used beyond the local working context.
Use the Dyn2TemporalClaimProfile only for authored temporal claims used beyond the local working context. It is a pattern-local authored temporal-claim adequacy record, not a model of the dynamic system itself, not a publication role, not a Part G record, not an MVPK face, and not the default C.27 record.
Read the profile-block menu only when boundary-crossing use is being made. The list below is a pattern-relation menu, not a form. The absence of an inactive block is normal; it is not a missing field.
The shape is a header plus present profile blocks. The header carries the minimum boundary-crossing claim-use classification. Each block should be read from its applicability sentence first, and a block appears only when supportedUse relies on that claim relation. These blocks are not fields of one universal dynamic EntityOfConcern; they are different evidence descriptions and pattern relations made relevant by supported use.
Profile-block closure rule: every present block is either defined by C.27,
a pattern-reference-only block that cites the existing FPF pattern carrying the
other question and adds no new C.27 EntityOfConcern, or absent from activeBlocks.
A block name is not a new EntityOfConcern.
Active-block naming rule: read each activeBlocks name by one of three statuses.
localAdequacyBlock means C.27 states local adequacy fields for an authored
temporal claim. patternReferenceOnly means C.27 states only the temporal
move, window, and supported-use boundary and cites the FPF pattern that carries the
other question. relationOnly means the concern appears in relations or
examples but not as an active block. dyn2PromiseBoundaryRelation?,
dyn2HighStakesTemporalMoveRelation?, and dyn2PolicyTransferRelation? are
pattern-reference-only by default; dyn2PolicyTransferRelation? is folded into
dyn2ControlPolicyRelation? when behavior-policy and evaluation-policy transfer is
FPF-governed.
Absence of an inactive block is normal. It is not a missing field. A block
becomes active only when the supported use relies on it; otherwise the Dyn2TemporalClaimProfile
should stay smaller or downgrade to a Dyn2TemporalClaimAdequacyCard, Dyn1 reading, or ordinary prose.
Pattern-reference-only blocks:
dyn2PolicyTransferRelation?is handled insidedyn2ControlPolicyRelation?when behavior-policy and evaluation-policy transfer or off-policy transfer is FPF-governed. C.27 namesbehaviorPolicyRef,proposedPolicyRef,offPolicyRisk, and the evaluation or control pattern relation; it does not create a separate policy-transfer pattern.dyn2PromiseBoundaryRelation?states only the temporal move, window, supported use, unsupported downstream claim, effect, or use, and references to the patterns that carry promise, commitment, instituting speech act, service acceptance, contract unpacking, and assurance:[A.2.3](/generated/patterns/A.2.3),[A.2.8](/generated/patterns/A.2.8),[A.2.9](/generated/patterns/A.2.9),[A.6.C](/generated/patterns/A.6.C),[F.12](/generated/patterns/F.12), and assurance patterns.dyn2HighStakesTemporalMoveRelation?states only the high-stakes temporal move, window, unsupported downstream claim, effect, or use, and reference to the pattern that carries the harm, quality, safety, ethics, legal, financial, operations-service, or human-wellbeing question.
Header discipline: for a Dyn2TemporalClaimProfile for boundary-crossing claim use, claimRef,
entityOfConcernRef, dynClaimUseClass, dynOrder, claimWindowRef,
supportedUse, unsupportedUse, and reopenTrigger are mandatory.
temporalBearerRef is present when the temporal bearer differs from the
EntityOfConcern or is otherwise FPF-governed. profileCarrierRef is present
when publication or evidence needs the authored carrier named. baseCharacteristicRef
is mandatory only when measurement, comparison, or C.16 relation is FPF-governed; for a Plain diagnostic claim it may remain a local phrase in the temporalReadingOrBearer line.
Window split rule: one local window is enough only when the claim window, sampling window, effort or intervention window, validity window, baseline window, and follow-up window are the same for the supported use. Split them when the evidence is sampled over a different interval than the claim, effort is applied before or after the measured change, a comparison needs a baseline, an outcome is observed after exposure, or the claim remains valid only for a shorter period than the historical trace. If the split is unknown and the supported use depends on it, downgrade the use or add the relevant window reference before relying on the temporal claim.
C.16 rate-measurement relation: when rate or rate-change is FPF-governed, C.27 cites the C.16 measurement relation. C.27 does not define measurement legality.
C.27 effort and work block: when a rate-change claim depends on effort, resource,
method, intervention actor, role-assignment availability, or performer eligibility, C.27 separates planned
effort, method description, resource envelope, actual work trace, and
authority relation, proposed-work plan, hypothetical-use note, and U.Capability reference when a capability claim is being made. It does not turn work evidence into a dynamics law.
interventionActorRef means the actor, role assignment, tool, system, policy
rule, or human work arrangement claimed to apply the intervention, plus an
authority relation, proposed-work plan, hypothetical-use note, and U.Capability reference when a capability claim is being made. If a planning claim says "add review capacity", C.27 should make visible whether there is a role assignment, work plan, authority relation, or U.Capability reference that can carry the intervention claim, while leaving role, method, work-plan, and work-occurrence alignment to A.15 and work patterns.
C.27 resistance and inertia block: dyn2ResistanceInertiaBlock? is present when supported use depends on what resists, delays, stores momentum, creates residue, or makes the change costly. This is core C.27 content because it prevents effort-free acceleration claims. The Dyn2TemporalClaimAdequacyCard asks the question locally; the Dyn2TemporalClaimProfile uses a separate active profile block only when that answer matters beyond the local working context.
resistanceProxyEvidenceOrAssumption = unknown is an acceptable C.27 result. Unknown resistance need not
block a local diagnostic Dyn2TemporalClaimAdequacyCard, but it should block durable
acceleration, causal, benchmark, promise-like, or assurance use until the relevant evidence relation, measurement relation, model assumption, or carrying pattern reference is supplied.
C.27 control or policy relation: dyn2ControlPolicyRelation? is present only when dynClaimUseClass is controlModel, policyRule, adaptive, a planningModel with feedback relation, or an explicit C.24, C.19, or evaluation relation. This relation says that the authored temporal claim has crossed into control model, policy model, or policy-evaluation use. It does not make C.27 an MPC, reinforcement-learning, or policy-evaluation pattern.
C.27 causal-use relation: dyn2CausalUseRelation? is present only when the authored temporal claim uses a rate-change, intervention, effort, workshop, policy, or practice change to make a causal-use claim. Core rule: C.27 can say a claim is Dyn2 and intervention-sensitive; C.27 cannot turn that rate-change or intervention relation into a [C.28](/generated/patterns/C.28)-governed causal-use claim. The fields below are [C.28](/generated/patterns/C.28) refs consumed by C.27, not [C.27](/generated/patterns/C.27)-defined causal aliases.
C.27 dynamic benchmark requirement: dyn2BenchmarkParityBlock? is present only when a comparison or benchmark depends on rate, rate-change, recovery speed, rhythm improvement, intervention effect, effort budget, or dynamic outcome. Content rule: C.27 declares the dynamic claim question of the benchmark; [G.9](/generated/patterns/G.9) carries parity.
C.27 metric-target effect block: dyn2MetricTargetEffectBlock? is present only
when metric publication, target use, incentive use, dashboard use, gate use, or
public comparison changes temporal behavior or supported use. C.16 carries the
measure; E.13, assurance, or governance patterns carry proxy distortion and utility distortion;
C.26 is relevant only if residual probe, frame, order, or export cue remains.
C.27 object-centric trace block: dyn2ObjectCentricTraceBlock? is present only
when a work-cycle or process-rate claim depends on several object bearers, event
traces, interactions, or aggregation relation rather than one scalar speed label.
C.27 records why scalar throughput is insufficient; object-centric process
mining or local process evidence carries the detailed log discipline.
C.27 cross-scale transfer field: dyn2CrossScaleTransferBlock? is present only when a dynamic claim transfers rate, rate-change, rhythm, recovery, acceleration, braking, or agility from one bearer, holon level, or aggregate to another. Aggregate rate-change and local rate-change are different readings unless aggregation relation and bearer continuity are declared.
C.27 scale-variable claim block: dyn2ScaleVariableClaimBlock? is present only when the
authored temporal claim says that changing a resource or scale variable changes
rate, improvement, learning, recovery, throughput, or stabilization. This is
not the same as cross-scale transfer: scale-variable claim asks which variable is
changed and over what scale window; cross-scale transfer asks whether a dynamic
reading is carried across bearer, holon level, or aggregate. C.18.1 carries scale
variables, scale windows, scale probes, and scale-elasticity value; C.27 records
only that the scale change is being used to make a temporal-claim reading.
C.27 task-family adaptation relation: dyn2TaskFamilyAdaptationRelation? is present
only when the temporal claim says that a holder, dyad, team, specialist
portfolio, method, or agent reaches usable specialization faster on one declared
TaskFamilyRef or TaskSignature. C.22.1 carries the task-family adaptation
signature. C.27 records only the learning-rate or adaptation-rate question and the
supported use that made it relevant.
C.27 viability-envelope relation: dyn2ViabilityEnvelopeRelation? is present only when
a temporal claim says braking, slowing rollout, throttling, cadence change,
recovery timing, adaptation cost, operations-service demand, or stabilization keeps a
viability bearer inside usable bounds. C.27 may type the temporal move and its
window. C.26.3 carries the viability-envelope claim: protected promise or
function, viable bounds, disturbance, sensor split, probe split, action split, adaptation
cost, and failure mode. Do not make C.27 the pattern for all "stability through
change" claims.
C.27 residual QL relation: dyn2QLResidualRelation? is present only when ordinary FPF
patterns have already carried the temporal-claim, measurement, work, benchmark,
value-proxy, scale, adaptation, viability, promise, or evidence relation and a
residual probe, frame, order, export, or coarsening cue still changes the supported
reading. C.26 carries the residual QL reading. C.27 only records that the authored
temporal claim has a residual QL relation; this block stays hidden by default when
no such residue exists.
C.27 debt and hysteresis block: dyn2DebtHysteresisBlock? is present only when supported use depends on sustained acceleration, braking, recovery, stabilization, domain residue after effort changes, or a public promise, gate, assurance, or high-stakes decision about rate-change. Unknown reversibility is allowed, but it bounds supported use.
These C.27 dynamic-claim profile-block field definitions are boundary-crossing
material for Dyn2TemporalClaimProfile and for higher-stakes authored temporal
claims used beyond the local working context. They are not the default C.27 user
interface, not a data model, and not a universal C.27 dynamic-claim field list
that every user must fill.
C.27 uses physical words only as Plain analogies. Tech prose uses effort,
input, and work references rather than force; resistance and inertia proxies rather
than mass; rate-change readings rather than acceleration as a new kind; and
rhythm bearer, timing reference, and rhythm window rather than U.Rhythm.
Each field definition either carries a small local C.27 temporal-claim adequacy value or points back to the existing FPF pattern that governs the referenced EntityOfConcern or relation. A field name is not a pattern. Metric, process, service, practice, policy, harm, operations-service, and envelope wording does not create a free C.27 slot. It must resolve to a local C.27 value, an existing FPF kind and reference, or a governing-pattern relation; otherwise it remains Plain example language.
dynClaimUseClass discipline: in Dyn2TemporalClaimProfile, dynClaimUseClass is a
pattern-relation declaration, not a maturity scale. A diagnosticReading does not mature
into a causalClaim by adding fields; [C.28](/generated/patterns/C.28) carries causal-use
questions and records. A planningModel does not become promiseBoundaryUse by
publication; promise, boundary, commitment, service, or assurance patterns carry
promise-like claim use. Changing dynClaimUseClass may change the governing relation, pattern,
evidence relation, model assumption, planning assumption, or assurance-facing relation.
No C.27 field completion upgrades dynClaimUseClass; a higher-stakes dynClaimUseClass is a
relation change.
C.27 has a small core. Specialized cases are C.27 dynamic-claim relations or optional profile blocks for authored temporal claims used beyond the local working context; they are not mandatory rules for every C.27 use.
These entries are not a general relation list. They apply only after an authored temporal claim already has C.27 relevance because it changes supported use. Each entry names the neighbouring FPF pattern to inspect when that C.27-typed dynamic claim also depends on one non-C.27 question. If the text has no state, rate, rate-change, rhythm, regime, recovery, stabilization, transfer, or intervention relation that changes supported use, no entry here applies.
Plain words may remain didactic. Tech prose must name the FPF pattern that carries the FPF-governed question.
Problem frames and worked examples may use speed, force, inertia,
acceleration, rhythm, cadence, agility, or process-speed language when it helps
recognition. Field definitions, conformance requirements, and governing-pattern
relations should use the Tech readings below.
Minted C.27-local labels must carry the dynamic claim question in the label: use
Dyn2, Temporal, RateChange, Rhythm, Inertia,
CrossScale, MetricTarget, ControlPolicy, or another explicit dynamic
qualifier. A generic head such as Profile, Card, Process, Service,
Practice, Policy, Harm, OperationalSupport, or Envelope is not enough by itself.
Ordinary prose may use those words only as Plain examples or after resolving the
actual FPF kind and reference or governing pattern.
Avoid as Tech tokens unless already governed by the named pattern:
carrierOrSubject, D2DynamicsProfile, Metric, Axis, Dimension,
Process, Practice, Service, generic card names, Profile, ProcessBearer,
PolicyEvaluation, HarmEnvelope, force, mass, acceleration, and
rhythm.
Prefer: DynOrder, Dyn2TemporalClaimAdequacyCard, Dyn2TemporalClaimProfile,
entityOfConcernRef, temporalBearerRef, profileCarrierRef,
baseCharacteristicRef, MeasureRef, DHCMethodRef, claimWindowRef,
samplingWindowRef, effortWindowRef, rhythmWindowRef,
plannedEffortRef, actualEffortTraceRef, inputCharacteristicRefs,
interventionActorRef, authorityRelationRef, proposedWorkPlanRef,
hypotheticalUseNote, actorCapabilityRef, resistanceOrInertiaProxy,
resistanceProxyEvidenceOrAssumption,
dyn2MetricTargetEffectBlock?, dyn2ObjectCentricTraceBlock?,
dyn2CrossScaleTransferBlock?, dyn2HighStakesTemporalMoveRelation?,
supportedUse, unsupportedUse, and reopenTrigger.
The dynamic-order labels are values of a claim classification, not kinds of
things. Dyn0, Dyn1, and Dyn2 classify what a temporal claim treats as sufficient
for its use. They do not become U.Dyn0, U.Dyn1, U.Dyn2,
U.Acceleration, U.Rhythm, U.Practice, U.Force, or
U.SecondOrderProcess.
Kind-locality rule: DynOrder, Dyn0, Dyn1, Dyn2,
Dyn2TemporalClaimAdequacyCard, and Dyn2TemporalClaimProfile name readings
or records of authored temporal claims. They do not classify the primary EntityOfConcern
itself unless an existing FPF pattern separately types that EntityOfConcern. "Team
throughput accelerated" may receive a Dyn2 claim reading; the team does not
become a Dyn2System, throughput does not become U.Acceleration, and the
card or profile does not become a dynamics law.
Dyn2TemporalClaimProfile is a pattern-local episteme record about the adequacy of
a temporal claim. It is not U.Dynamics, U.Work, U.WorkPlan,
U.MethodDescription, U.Measure, or CharacteristicSpace. If materialized
as a document, card, table, or file, that material is a carrier of the Dyn2TemporalClaimProfile
content, not the actual work, process, law, practice, or system being discussed.
A.7 EntityOfConcern, Description episteme, and publication-carrier split: Dyn2TemporalClaimAdequacyCard and
Dyn2TemporalClaimProfile are authored descriptions of temporal-claim adequacy.
They are not the dynamic system, not the work trace, not the measure, not the
service promise, not the intervention actor reference or role assignment, not the dynamics law, and not identical to the
document, card, or page that carries them.
The EntityOfConcern, temporal bearer, and carrier split is:
Loose words require resolution in Tech prose. A process may be a method recipe, dated work run, transition law, event-log view, or service situation. A practice may be method description plus work traces. A service claim may involve system, promise content, delivery work, boundary semantics, or assurance. C.27 should not use these as untyped substitutes for named FPF kinds and references.
Copy-paste authoring forms (informative). These forms make C.27 cheap enough to use without jumping straight to a full profile.
Dyn0 or Dyn1 stop:
Local Dyn2 card:
Boundary-crossing profile header:
AI-assisted drafting rule (informative). An AI-assisted draft may propose that C.27 is relevant, but a profile appears only after the supported use and the boundary-crossing reason are named. First classify the prose as ordinary prose, Dyn0, Dyn1, Dyn2 card, or profile or pattern relation. The draft does not infer: more tool calls means better reasoning; faster narrowing means better search; higher throughput means better quality; metric improvement means system improvement; or trend means intervention model.
Archetypal Grounding
Read these cases before the fuller field definitions. They show supported stopping points for ordinary work:
- no C.27 record for ordinary state, metaphor, or unsupported broad-use language;
- Dyn1 or C.16 when the issue under repair is only measured rate;
Dyn2TemporalClaimAdequacyCardwhen a local temporal intervention, rhythm, braking, coasting, or tool-use rate-change claim needs a bounded evidence relation, model assumption, planning assumption, or neighbouring-pattern relation;Dyn2TemporalClaimProfileor a named FPF pattern relation only when the authored temporal claim is used beyond the local working context, benchmarks, promises, assures, becomes causal, crosses scale, or carries decision-use that affects gate, release, assurance, benchmark, or work-plan use.
Example breadth (informative). C.27 appears across several work domains, not only project-velocity prose.
Teaching cases:
These slices show what C.27 changes in use. They are action examples, not extra forms to fill.
Operations: backlog acceleration:
The value is not that every backlog sentence gets a profile. The value is that an acceleration claim used for a decision cannot hide effort, window, resistance, and unsupported downstream claim, effect, or use.
Learning: practice transfer:
This carries the source article's replicable-practice idea: the useful formal payload is an effort, rhythm, and window description that can be copied and checked, not a forced equation.
Rhythm and practice style vignette:
This keeps the article's useful dance and practice insight: style distinction may depend on effort and rate-change patterns over rhythm intervals, not only on static poses, single trajectories, mood words, or a general rhythm theory.
Rhythm: embodied or team coordination:
The important correction is that rhythm has a bearer and proxy. It is not a decorative label for good mood or smoothness.
Agentic tool-use: AI work cycle:
This keeps C.24 useful without turning tool-use quantity into a proxy for thinking quality.
Benchmark: faster improvement:
This prevents "faster" from hiding unequal effort, unequal windows, or unequal measurement templates.
Service-boundary promise:
The key point is that C.27 does not become a hidden promise pattern. It prevents temporal claims from silently widening into promises.
Aggregate or cross-scale transfer:
This protects multi-scale FPF reasoning: a rate-change does not transfer across holon levels merely because the same speed word appears at each holon level.
Metric-target temporal effect:
This is the practical C.27 bridge: metric publication may be a temporal intervention, while C.16 carries measurement, [E.13](/generated/patterns/E.13) carries proxy or value distortion, C.26 carries only residual probe/frame/export cues, and evidence patterns carry the evidence relation.
Bias-Annotation
Use C.27 only where it helps a working reader notice temporal-claim inflation and choose the least-committing supported result: no C.27 record, Dyn0 reading, Dyn1 reading, a local Dyn2TemporalClaimAdequacyCard, a boundary-crossing Dyn2TemporalClaimProfile, or a named neighbouring-pattern relation. A correct dynamic-claim schema is not enough. The useful result is that a working reader can notice when a state or rate reading is being used as a rate-change, rhythm-change, intervention, braking, coasting, recovery, stabilization, benchmark, promise, or assurance claim; choose the least-committing supported next output; and stop or cite the carrying pattern without making C.27 absorb that pattern's governed concern.
The missing-question content belongs here only where it strengthens
three practical abilities:
- how a reader finds C.27 from ordinary working language such as speed up, slow down, recover, stabilize, sustain cadence, improve faster, change direction, or reduce risk faster;
- how source ideas become FPF-facing guidance without turning physical or dynamic metaphors into new ontology: adopted, adapted, carried by another FPF pattern, or rejected as literal dynamics ontology;
- how C.27 keeps higher-demand claim relations with existing FPF patterns instead of becoming a general pattern for measurement, dynamics law, work, search, benchmarks, promises, assurance, viability, publication-unit stability, or QL.
Additional detail is useful only when it improves one of those three abilities or clarifies a stopping condition. More fields, case notes, or pattern-relation prose is rejected when they only make C.27 harder to refuse, harder to stop, or easier to misread as a general theory of change.
Gov. C.27 reduces hidden decision-claim inflation: local diagnosis, planning assumption or planning-model relation, benchmark use, public promise, and assurance use remain different claim uses.
Arch. C.27 is biased against stealing work from neighbouring patterns. It types authored temporal-claim adequacy question while measurement, formal dynamics, work, search, benchmark, promise, causality, quality, value, viability, scale, adaptation, and QL relations remain with the patterns that govern those concerns.
Ontology and episteme. C.27 is biased toward described system, description, and carrier separation and toward explicit temporal-claim-use classification. It treats Dyn0, Dyn1, and Dyn2 as readings of authored temporal claims, not as kinds of systems.
Pragmatics and didactics. C.27 is biased toward cheap stopping, card-first use, and teaching through cases before field machinery. The first lesson is: a trend is not yet an intervention model.
Conformance Checklist
Use these requirements to judge whether a C.27 record or C.27-facing paragraph is sufficiently supported for the use it is making. Ordinary local use can stay small.
Value and harm boundary. A temporally adequate claim is not automatically a valuable claim. A valuable claim is not automatically temporally adequate. If value, harm, safety, legal, ethics, quality, or promise impact is FPF-governed, C.27 states only the temporal move, window, supported use, unsupported downstream claim, effect, or use, and pattern relation. The value, harm, safety, legal, ethics, quality, or promise pattern governs the other question.
Conceptual lint classes (informative). These labels describe cheap inspection faults, not a required tool.
Common failure modes after adoption (informative).
Common Anti-Patterns and How to Avoid Them
C.27 starts with the anti-patterns most likely to make a working reader misuse a state or rate reading as a Dyn2 temporal claim. Less frequent traps belong in the extended bank and should not become a first-screen checklist.
Use the negative cases to make non-use easy. They are not profile triggers.
Use the extended anti-patterns only when the temporal claim actually raises that trap.
Consequences
C.27 should make FPF better at planning and reviewing dynamic claims while keeping ordinary state and rate claims cheap. Its main cost is one more C-pattern and several neighbour notes in existing FPF patterns. The mitigation is the central affordability rule: C.27 must be easier not to use than to misuse.
C.27 claims decay over time. Refresh or reopen when one of the listed conditions changes.
Refresh demand stays proportional:
- sampling window, cadence, or time base changes;
- effort envelope or resource budget changes;
- intervention actor reference, role-assignment availability, performer eligibility, authority, or holder availability changes;
- inertia or resistance proxy changes: new tooling, team, queue topology, domain, work mix, constraints, or service environment;
- metric becomes a target, incentive, gate, dashboard, or public comparison;
- cross-scale transfer is attempted;
- outcome reverses, overshoots, oscillates, or becomes unstable;
- hidden queues, rework, burnout, quality loss, operations-service demand, safety demand, or coordination debt appear;
- rhythm bearer, timing reference, window, proxy, or coupling changes;
- claim use changes from assumption or diagnostic to benchmark, assurance, causal, promise-like, publication, or formal model use;
- the claim is reused outside its original validity window or domain;
- a coasting, braking, or recovery claim continues after effort changes or stops.
Local Dyn2TemporalClaimAdequacyCards normally need only a reopen, downgrade,
or pattern-reference condition. Dyn2TemporalClaimProfiles for boundary-crossing claim use should cite
validityWindowRef or evidence valid_until when the claim carries a
benchmark, gate, assurance, promise-like use, reusable method, publication, or
formal-model relation. If rate-change evidence decays, freshness and epistemic-debt
handling belongs with B.3.4 or G.11 rather than becoming a C.27 freshness calculus.
When a Dyn2 benchmark, task-family adaptation claim, public method claim,
selector-facing claim, SoTA publication claim, or other Part G publication carries a
temporal-claim record, C.27 reopenTrigger is not enough by itself. C.27 states
the temporal-claim question and its validity or reopen condition; G.9 carries benchmark parity
when comparison is being made; G.11 carries refresh orchestration such as refresh
queue, refresh plan, refresh report, deprecation notice, or edition bump when
evidence, comparator editions, method editions, claim windows, or validity
windows drift.
Rationale
The source material is most relevant where it replaces the question "what is the speed?" with "what effort profile, over which windows, changes speed, rhythm, direction, or stability under resistance and cost?" The C.27 keeps that practical move while rejecting physics ontology, mandatory calculus, false QL relevance, and default full-profile bureaucracy.
C.27 acts in FPF as a small modern correction for one recurring failure: working texts observe or name a rate and then behave as if they know how to change that rate. The pattern brings FPF up to modern practice only in the following shape:
- the state, rate, and rate-change distinction remains the cheap recognition gain;
- control, policy evaluation, causal inference, process mining, benchmarking, rhythm, and high-stakes temporal-move cases appear as present profile blocks;
- quantum-like residual cases appear only as C.26 relations, not as C.27 claim-adequacy content blocks or fields of one universal dynamic EntityOfConcern;
- control fields stay absent by default and appear only for control-style use;
- behavior-policy versus evaluation-policy discipline is visible when off-policy or sequential-policy transfer is claimed;
- causal claims carry intervention contrast, time zero, follow-up, outcome, assumptions, and identification or evaluation relation rather than C.27 shorthand;
- performative and Goodhart cases separate metric-as-measure, metric-as-target, and metric-as-intervention;
- work-cycle and process-rate claims name bearer, object trace, event trace, interaction, and convergence or divergence rather than one generic process-speed label;
- dynamic benchmarks use C.27 to type the temporal-claim question while G.9 carries parity;
- rhythm claims stay bearer plus timing reference plus window plus evidence proxy relation plus supported use by default, with entrainment or coupling claims with cross-bearer evidence commitments only when the claim needs them;
- quantum-like use stays out of C.27 unless a residual probe, order, frame, or export cue remains after ordinary C.27, C.24, C.16, G.9, and E.13 pattern relations;
- full
Dyn2TemporalClaimProfiles remain rare, and the pattern improves action quality more than it increases paperwork.
One-line SoTA formulation for C.27: it makes
intervention-sensitive temporal claims explicit - policy, effort, window,
resistance, feedback, evidence, bearer, and supported use - while refusing to
treat every speed or rhythm phrase as control theory, C.28-governed causal-use claim, benchmark
superiority, or quantum-like modeling.
SoTA-Echoing
C.27 should be shaped by current modeling practice without becoming a survey paper. The C.27 SoTA claim is: C.27 is intervention-sensitive temporal claim adequacy with explicit evidence relation and temporal-claim-use classification, not literal second derivative everywhere and not universal control theory.
Source binding used by this section:
Currentness source set: as of June 2026, newer safe-learning MPC and safe-continual-RL work reinforces the existing fields rather than changing the C.27 ontology. Reopen this source use when current control, policy-evaluation, dynamic-treatment-regime, benchmark, or rhythm practice changes the required horizon, constraint, uncertainty, feedback-update, policy-overlap, nonstationarity, safety-boundary, bearer, timing-reference, evidence, or supported-use obligations.
SoTA lesson to C.27 obligation map:
Source id references:
D2-SRC-1: Статика, динамика первой производной, динамика второй производной.D2-SRC-2: Learning-Based Model Predictive Control: Toward Safe Learning in Control, Review on model predictive control: an engineering perspective, and Goal-oriented safe active learning for predictive control using Bayesian recurrent neural networks.D2-SRC-3: A Survey of Constraint Formulations in Safe Reinforcement Learning, A Review of Off-Policy Evaluation in Reinforcement Learning, Conservative Q-Learning for Offline Reinforcement Learning, Methods in dynamic treatment regimens using observational healthcare data, and Safe Continual Reinforcement Learning Methods for Nonstationary Environments: Toward a Survey.D2-SRC-4: Causal Inference: What If and Causal Inference About the Effects of Interventions From Observational Studies in Medical Journals.D2-SRC-5: Performative Prediction, Performative Prediction: Past and Future, and Categorizing Variants of Goodhart's Law.D2-SRC-6: OCEL 2.0 and Object-Centric Event Logs: Specifications, Comparative Analysis and Refinement.D2-SRC-7: Active Inference: A Process Theory and Embodied decisions as active inference.D2-SRC-8: Neural entrainment underpins sensorimotor synchronization to dynamic rhythmic stimuli, A review of psychological and neuroscientific research on musical groove, and Finding the rhythm.CT-TIME-SRC: David Deutsch and Chiara Marletto, Constructor theory of time.
Control and MPC. Control-style claims need horizon, constraints, uncertainty,
feedback update, and stability only when a control-style claim is being made. A local
Dyn2TemporalClaimAdequacyCard can say "we plan to brake rollout for two weeks to protect operations-service capacity" without becoming MPC. If the claim is not control-style, do not fill
control fields. A control claim used beyond the local working context needs the neighboring governing-pattern relation.
C.27 control or policy relation: dyn2ControlPolicyRelation? is present only when
dynClaimUseClass is controlModel, policyRule, adaptive, a planningModel with feedback relation, or an explicit C.24, C.19, or evaluation relation. The block says that
the temporal claim has crossed into control claim-use or policy claim-use; it does not make
C.27 an MPC, reinforcement-learning, or policy-evaluation pattern.
Sequential decision and reinforcement-learning practice. Many real rate-change
claims are policy or regime claims, not one-shot effort claims. Policy-transfer
control details and policy details belong inside dyn2ControlPolicyRelation?, not in the default
Dyn2TemporalClaimAdequacyCard. When it applies, the block should recover behavior policy, evaluation policy,
overlap note, uncertainty or bound reference, unsafe-exploration note,
and pattern reference to C.19, C.24, U.Dynamics, or the evaluation pattern. This matters for
adaptive rollouts, agentic tool-use, clinical-like treatment regimes, and
repeated operational interventions.
Causal inference. C.27 is not a C.28 causal-use claim pattern. Effort plus observed rate-change may
carry a planning or diagnostic reading, but a causal attribution needs a separate
C.28 causal-use relation. When dyn2CausalUseRelation? is present, it should name the causal question,
intervention reference, comparator or counterfactual, estimand, time-zero or
assignment window, follow-up window, outcome measure, assumptions, rival causes,
identification strategy or evidence design when available, supported causal use,
and unsupported causal use.
Core rule: C.27 can say a claim is Dyn2 and intervention-sensitive. C.27 cannot
turn that temporal relation into a C.28-governed causal-use claim with estimand, identification, realizability, evidence design, and supported-use judgment. Dyn2 can describe an intervention-sensitive
temporal-claim question; it does not estimate causal effect unless dyn2CausalUseRelation?
is active and C.28 causal-use discipline carries the causal question.
Metric publication and target use. When a metric becomes a target, dashboard, incentive, gate, or public comparison, it may change temporal behavior. C.27 uses dyn2MetricTargetEffectBlock? only for the temporal intervention and supported-use change. C.16 carries metric-as-measure, E.13 or an assurance pattern carries target, proxy, utility-distortion, or optimization-target adequacy, and C.26 appears only for residual probe, frame, order, or export cues after ordinary C.27, C.16, and E.13 pattern relations are named. This keeps Goodhart from becoming a C.27 mini-pattern.
Process mining and object-centric process mining. Scalar throughput is often a
thin view. Some dynamic claims need trace topology, multiple object bearers,
interaction notes, and evidence about how queues, tickets, incidents, customers,
orders, services, engineers, deployments, or review windows interact. When this question is current, C.27:4 - Solution defines the
dyn2ObjectCentricTraceBlock? fields. This section explains why multi-object
trace requirements should be named instead of pretending that one scalar
throughput rate says enough.
Active sensing and active inference. Measurement may be an action rather than a passive read, but that is still usually ordinary FPF pattern relations: measurement, state-space, planning, evidence, control, causal, or process-log relation. QL is not made relevant by typing, discreteness, state reduction, tokenization, or planned measurement. C.27 may notice dynamic or probe pressure, but it must not promote active inference, quantum cognition, or QL mathematics unless C.26 remains relevant after ordinary-pattern non-use tests.
Rhythm and embodied dynamics. Rhythm claims used beyond ordinary local prose need bearer, timing reference, window, evidence proxy relation, and supported use. Coupling, phase relation, entrainment-like relation, perturbation response, tempo drift, or synchronization evidence are downstream claim, effect, or use fields only when the claim depends on coordination between bearers. This preserves the useful dance and practice analogy without minting a rhythm ontology.
C.27 is a middle recognition-and-relation lens, not a general dynamic-theory pattern. It notices when a claim has moved from state or rate reading to intervention-sensitive temporal adequacy, then keeps higher-demand claim relations with the existing FPF pattern that carries them:
The following lines connect common failures to C.27 action, not to a literature catalog:
Relations
C.27 is the pattern for authored temporal-claim adequacy. It asks whether a claim about speed, rhythm, throughput, recovery, convergence, rollout, adoption, braking, coasting, redirection, or stabilization is sufficiently supported for the use being made of it. It does not become the pattern for the described system, work, measurement, benchmark, promise, quality bundle, or formal dynamics model.
When a temporal claim also touches another FPF concern, use the FPF pattern that governs that concern and let C.27 state only the temporal-claim adequacy question.
Use pattern references before expanding a C.27 record. When measurement,
transition law, work evidence, planning, benchmark parity, C.28 causal-use
claim, promise content, assurance claim, quality, viability, or residual QL
discipline governs the other question, the C.27 record cites that pattern and
keeps only the temporal-claim adequacy question.
When a temporal claim touches neighbouring work, keep these boundaries:
- Fields in a C.27 card do not imply new Kernel kinds.
- State space, measurement, transition law, work, planning, benchmark, causality, promise, service, quality-bundle, publication, transformation, and QL questions stay with the FPF pattern that governs each question.
- The described object, authored temporal claim, temporal bearer, profile content, and profile carrier remain distinct.
- If the text says process, work cycle, practice, service, method, system, transformation, or rhythm, the real bearer or changed object is named through a named FPF kind and reference rather than treated as one generic moving thing.
- Derivative-like readings remain compatible with C.16 measurement construction.
- Full
Dyn2TemporalClaimProfiles remain rare and justified rather than default. - At least one golden case stops or downgrades from Dyn2 correctly.
- Braking, pause, stabilization, redirection, and coasting are first-class temporal moves rather than failures to accelerate.
- QL relevance stays inactive unless ordinary pattern relations leave residual probe, frame, export, or coarsening cue.
- Causal, benchmark, promise-like, transformation, and assurance claims cite the governing pattern relation that carries the claim rather than relying on an ordinary
Dyn2TemporalClaimAdequacyCard.
This is the neighbouring-question boundary check, not a second relation matrix and not a form for ordinary use. Before expanding C.27, ask four questions:
- Is the EntityOfConcern still the authored temporal claim, with the described object, claim-bearing description, and carrier kept separate under A.7/C.2.1? If not, return to the pattern that governs the described object or episteme.
- Is local dynamic wording (
Dyn2, rhythm, force, inertia, speed, acceleration, trend, rate-change) turning into a new FPF kind or a hidden coordinate system? If yes, use E.10/F.18 and the direct characteristic/measurement patterns before writing more C.27 apparatus. - Is the current governed question actually measurement, dynamics, work, work planning, causality, benchmark parity, promise, service acceptance, quality, viability, evidence, provenance, QL residue, or transformation? If yes, use the governing pattern named in the relation table and keep only the temporal-claim adequacy question here.
- Is the local one-screen
Dyn2TemporalClaimAdequacyCardenough? If yes, do not open aDyn2TemporalClaimProfileand do not copy neighboring-pattern doctrine into C.27.
At use time, the concrete relation is enough: name the temporal-claim adequacy question, name the pattern that governs the other question, state the unsupported downstream claim, effect, or use, and choose the minimal C.27 output or the pattern relation that carries the other claim.
Core discipline: C.27 does not name new objects in the world. It names when an authored temporal claim has started to need intervention-sensitive temporal adequacy, then keeps each higher-demand claim relation with the FPF pattern that already governs that concern.
Practitioner-readable problem:
A trend is not yet an intervention model. Use C.27 when a claim about speed, rhythm, throughput, recovery, convergence, rollout, or adoption is used to change action and therefore needs effort, window, resistance, evidence relation or assumption relation, and reopen discipline.
One-minute working script:
When a text says something should get faster, slower, recover, stabilize, or keep rhythm, first ask: are we only reading a state, only reading a rate, or claiming that an intervention changes the rate, rhythm, recovery, or stabilization? If it is only state or rate, stop. If it is an intervention claim, write the smallest
Dyn2TemporalClaimAdequacyCard: what changes, by what effort, in what window, against what resistance or cost, with what evidence relation or assumption relation, for what supported use, and what downstream claim, effect, or use is not carried by the temporal-claim record. Only boundary-crossing claims need aDyn2TemporalClaimProfile. Formal laws, measurements, work,C.28causal-use claim, benchmarks, promises, assurance, viability envelopes, scale-variable claims, adaptation signatures, and QL residues stay with the existing FPF patterns that govern those concerns.
C.27 also carries an early non-improvement boundary:
C.27 is not a temporal theory of everything. It is the smallest useful repair for one recurring authored-claim failure: rate talk pretending to know rate-change.
C.27 does not present itself as improving all temporal reasoning, all
process modeling, all practice description, all rhythm theory, all
control, RL, causal inference, all performance management, all QL or
active-inference modeling, all scaling claims, or all adaptation claims. It
improves one narrow working failure: it prevents state or rate readings from being
laundered into intervention-sensitive temporal claims without effort, window,
resistance, evidence or assumption relation, and supportedUse and unsupportedUse field discipline.
The first C.27 record should be the one-screen Dyn2TemporalClaimAdequacyCard, not a full Dyn2TemporalClaimProfile.
The Dyn2TemporalClaimProfile is a boundary-crossing claim-use C.27 record. Existing formal patterns carry formal models; a C.27 record cites them when the other question is current instead of copying C.27 theory into another pattern relation.
The durable bottom line is:
C.27 is useful when it notices state or rate readings being laundered into rate-change claims, produces the least-committing supported next output, and keeps every higher-demand claim relation with the existing FPF pattern that governs that concern.
It should help FPF users act more carefully with speed, rhythm, effort, inertia, braking, coasting, and redirection claims. It does not make FPF carry mathematical theater, physics ontology, false QL relevance, or unassigned compliance claims.
C.27:End
Temporal Aspect: Time Windows, Rhythm, Cadence, and Currentness
Type: Definitional pattern Status: Stable Normativity: Normative except where a section is explicitly informative
Use This When
Use this pattern when a project needs to name a positive temporal aspect of a governed object, claim, transformation, work plan, evidence relation, architecture move, benchmark, source use, or publication use.
Use it when the working question is:
- which time window, interval, duration, latency, cadence, rhythm, synchronization, currentness, freshness, validity window, recovery timing, stabilization timing, trajectory, effort over time, inertia, or refresh condition matters;
- which bearer has that temporal aspect: system, episteme, work plan, work occurrence, claim, source, benchmark, architecture-selected structure, method description, publication, or project-world object;
- which temporal reference makes the statement reviewable: calendar time, clock time, event order, cycle, sprint, epoch, release train, sampling interval, follow-up interval, or domain-local timing reference;
- whether the temporal aspect is merely named, measured, used in a temporal claim, used in a transformation claim, or used in a work, evidence, or decision relation.
Primary EntityOfConcern. The EntityOfConcern is a temporal aspect of a governed object or claim. C.27.TA introduces no new U.TemporalAspect kind; it supplies slot discipline for temporal aspects that fill relations in other patterns.
E.24 ontic boundary. C.27.TA follows E.24 by refusing a new ontic root here. A temporal aspect is identified by its bearer, aspect kind, temporal reference, window or interval, relation to the governed object or claim, and governing use relation. Those slots make the aspect reviewable without claiming that timeWindow, cadence, freshness, trajectory, or recoveryTiming are standalone U.* kinds. If an authored temporal claim uses the aspect as sufficient for action, C.27 carries adequacy; if a transformation, dynamics model, work plan, evidence use, benchmark, or assurance claim is being made, the governing pattern for that use carries it.
First useful move. Write a TemporalAspectStatement: bearer, aspect kind, bounded context, temporal reference, interval or window, relation to the governed object or claim, and the governing FPF pattern relation that carries the use.
What goes wrong if missed. Temporal words become vibe labels. A cadence is named without bearer, a freshness claim has no validity window, a rhythm has no timing reference, a recovery claim has no interval, an architecture trajectory has no changed structure, and a transformation claim smuggles timing into method, mechanism, or evidence.
What this buys. A practitioner can name the temporal aspect as a positive subject before deciding whether C.27, A.3.4, A.3.3, A.15.2, A.15.1, C.16, C.28, G.9, evidence, source, gate, or assurance patterns carry the actual use.
Not this pattern when.
- If the question is adequacy or supported use of an authored temporal claim, use
C.27. - If the question is bounded transformation under conditions, use
A.3.4. - If the question is a state-space and transition-law episteme, use
A.3.3. - If the question is work planning or dated work, use
A.15.2orA.15.1. - If the question is measurement construction, rate construction, scale, score, or metric comparability, use
C.16and related characterization patterns. - If the question is causal use of an intervention or policy, use
C.28. - If the temporal phrase is ordinary prose and no practical use changes, do not introduce a C.27.TA statement.
Problem Frame
C.27 previously carried two different concerns. One concern is temporal-claim adequacy: whether an authored claim about speed, rhythm, rate-change, recovery, or stabilization can carry a named use. The other concern is positive temporal subject matter: windows, duration, cadence, synchronization, freshness, currentness, inertia, effort over time, recovery, stabilization, and trajectory as aspects of objects or claims.
This pattern carries the second concern. It lets FPF say "what temporal aspect is in play?" without immediately opening an adequacy card, a dynamics model, a work plan, a causal-use record, or a transformation statement.
Problem
Without C.27.TA:
- Cadence and rhythm become decorative words. A text says "release cadence" or "team rhythm" without naming bearer, interval, timing reference, or use.
- Freshness becomes a vague virtue. A source, benchmark, dashboard, or claim is called current without a validity window or refresh relation.
- Recovery and stabilization hide their interval. A claim says "recover faster" or "stabilize" without saying over which window, after which disturbance, and for which bearer.
- Effort and inertia float free. A text speaks about momentum, residue, stored work, adaptation cost, or resistance without linking it to a temporal window and governed object.
- Transformation absorbs time silently. A transformation statement names a change but leaves timing and ordering implicit, so method, mechanism, work, evidence, and temporal claims get tangled.
Forces
Solution
Definition
A temporal aspect is a time-bearing or order-bearing aspect of a governed object, claim, or relation. It is not automatically a temporal claim, dynamics law, work trace, method, mechanism, gate, evidence relation, or permission.
Typical temporal aspects include:
timeWindow;duration;latency;freshness;currentness;validityWindow;cadence;rhythm;synchronization;trajectory;recoveryTiming;stabilizationTiming;effortOverTime;inertiaOrResidue;refreshOrReopenCondition.
These names are aspect labels inside a statement, not new U.* kinds.
Temporal Aspect Statement
Use this compact statement when the temporal aspect changes the governing pattern use relation:
bearerRef names the object or claim that has the temporal aspect. temporalReference states the clock, event order, cycle, sprint, epoch, release train, sampling interval, follow-up interval, or domain-local timing reference. blockedLocalOverread names one local overread blocked by this aspect statement: for example, "this cadence statement does not prove recovery", "this freshness window does not create permission", or "this rhythm statement is not yet a C.27 adequacy card".
Governing Use Relation
Rhythm, Cadence, And Synchronization
Rhythm and cadence require bearer, timing reference, and window. Coupling, phase, synchronization, entrainment, dependency, or coordination wording appears only when the claim depends on a cross-bearer temporal relation.
Compact rhythm statement:
A plain "release cadence" or "workshop rhythm" may remain ordinary prose. It needs C.27.TA when cadence or rhythm changes transformation, work planning, benchmark, source, assurance, coordination, or claim-use decisions.
Currentness, Freshness, And Validity Window
Currentness and freshness need a reference time and a validity window. A source, benchmark, model, dashboard, or claim may be fresh enough for one use and stale for another.
Use C.27.TA to name:
- what object or claim is current;
- relative to which reference time or edition;
- for which window or use;
- which refresh or reopen condition changes the temporal aspect.
Use source, evidence, benchmark, assurance, or refresh patterns for the actual evidence, provenance, parity, assurance, or refresh work.
Recovery, Stabilization, Inertia, And Effort Over Time
Recovery, stabilization, inertia, and effort over time are temporal aspects when they name timing, interval, persistence, residue, or reversal cost for a governed object. They become C.27 temporal-claim adequacy only when an authored claim uses them to carry a practical use.
Use C.27.TA to name:
- disturbance or starting condition;
- bearer;
- recovery or stabilization window;
- effort, resistance, residue, or inertia relation;
- governing pattern relation that carries transformation, work, evidence, value, or assurance.
Archetypal Grounding
Release Cadence
A platform team says its release cadence changed from monthly to weekly.
C.27.TA names the bearer, release-train timing reference, window, interval structure, and governing use relation. It does not by itself say that the change is good, that quality improved, that work happened, or that a promised service level was met.
Source Freshness
A benchmark comparison uses a model report from April and a competitor report from June.
C.27.TA names the source-currentness and validity windows. G.9, source-use, evidence, and benchmark patterns carry comparator parity, provenance, and evidence use.
Architecture Recovery Timing
An architecture move is expected to reduce an interlevel conflict after two release cycles.
C.27.TA names the recovery window, cycle reference, bearer, and trajectory. A.3.4 names the structure transformation; architecture patterns govern the selected structure and characteristic; evidence and result patterns govern observed effects.
Work Rhythm
A review practice depends on a two-day response rhythm across several roles.
C.27.TA names the rhythm bearer, timing reference, rhythm window, and coupling relation when cross-bearer coordination matters. Work planning, role assignment, and method-description patterns carry their own claims.
Bias-Annotation
Lenses tested: Onto, Prag, Epist, Arch, Gov.
Resisted distortions:
- rhythm-as-vibe: rhythm or cadence appears without bearer, timing reference, and window;
- freshness-as-permission: currentness is treated as permission, evidence, or gate passage;
- time-as-transformation: timing language is treated as the transformation relation;
- dynamics theft: a temporal aspect is treated as a state-space or transition-law episteme;
- measurement theft: a temporal aspect is treated as a completed measurement construction.
Conformance Checklist
Common Anti-Patterns
SoTA-Echoing
Consequences
- C.27 can be narrowed to adequacy and supported use of authored temporal claims.
- A.3.4 gains a clean temporal reference slot without carrying the whole temporal ontology.
- A.3.3 stays the dynamics episteme pattern.
- Work planning, actual work, source currentness, benchmark parity, and evidence use keep their own governing patterns.
- Users gain a small positive statement for temporal aspects before heavier adequacy, dynamics, causal, benchmark, or assurance patterns are needed.
Relations
- Builds on:
E.24,A.6.5,A.7,C.2.1. - Coordinates with:
C.27,A.3.4,A.3.3,A.15.2,A.15.1,C.16,C.28,G.9, evidence, source, assurance, refresh, and publication patterns. - Used by: patterns that need a positive temporal aspect without making a temporal-claim adequacy judgement.
C.27.TA:End
CausalUse-CAL: Causal-Use Questions, Causality-Ladder Rungs, Identification and Realizability
Type: Calculus (C) Status: Stable Normativity: Normative unless explicitly marked informative
Plain-name. Causal-use calculus.
Intent. Govern live causal questions and decision-bearing causal use: improvement, intervention effect, causal fairness, counterfactual comparison, causal policy optimality, realized counterfactual-rung evidence, identified counterfactual estimate, or simulation-only counterfactual output.
Primary EntityOfConcern. A causal-use question or claim together with the causal-use basis and follow-on records needed to use it admissibly: causality-ladder rung, estimand or contrast, evidence basis, identification status, counterfactual sampling realizability status, supported use, unsupported use, and next move.
Not a physical ontology. C.28 governs how FPF authors, reviewers, and operators use causal models, evidence, and counterfactual reasoning in records, policy claims, fairness claims, method comparisons, and work plans. It does not define physical causality in general and does not replace local domain science.
Use This When
Use C.28 when a claim is being used causally:
- "method A improves result";
- "users who received intervention X had better outcomes";
- "this practice is fair";
- "the agent chose optimally";
- "the model simulates what would have happened";
- "the system can collect counterfactual data";
- "this benchmark shows a causal method is better";
- "this policy should be deployed because it would have changed the outcome".
Use C.28 especially when the claim must distinguish:
- observed association;
- intervention or action effect;
- counterfactual comparison;
- direct counterfactual-rung data collection;
- identified counterfactual estimate;
- simulation-only counterfactual output;
- causal policy class;
- causal fairness use;
- causality-ladder parity in method comparison.
Not this pattern when. If no causal use is claimed, keep the work in the neighboring pattern: C.16 for measurement, C.27 for temporal trend or rate-change adequacy, B.3 for assurance result, A.10 for evidence graph reference, G.9 for ordinary parity, C.11 for local choice, C.19 for pool policy, C.24 for call planning, or C.26 for a surviving quantum-like modeling cue after ordinary causal explanations have been tried.
Activation boundary. C.28 activates at CausalUseActivation: causal wording changes what the claim makes admissible for publication, choice, deployment, assurance, audit, benchmark, or support treatment. The trigger is admissible downstream use, not the presence of a causal-looking word. If the wording is only exploratory prose and no causal use governed by C.28 is made, rewrite to association, trend, measurement, or simulation-only wording and stop.
Exploratory causal-looking prose is not a CausalUseActivation by itself. A note may say that a relation is plausible, worth probing, or suggested by traces and still remain in C.16, C.27, A.10, C.11, C.19, C.24, G.5, or G.9 until the text makes a causal use governed by C.28 admissible. The moment the text makes publication, choice, deployment, assurance, audit, benchmark, or support treatment depend on causal support, C.28 governs the causal-use boundary.
What Goes Wrong If Missed
A causal-looking phrase backed only by association, proxy, simulation-only, or rhetorical support gets promoted into a causal use that requires a named C.28 support basis and verdict.
Correlation becomes intervention effect. Interventional proxy becomes counterfactual fairness. A simulation becomes realized counterfactual-rung evidence. A benchmark compares methods across different causality-ladder rungs and still publishes one scalar superiority claim. An agentic policy is called optimal without saying whether it is a natural behavior policy, an interventional policy, or a counterfactual policy.
The practical error is laundering: the reader sees causal language but cannot recover what rung, estimand, evidence basis, and supported use are actually admissible.
What This Buys
C.28 gives FPF one cheap first stop for causal use.
The first useful result is not a heavy record. It is one small causal-use triage that says whether causal use is present, which causality-ladder rung is being used, what comparator or counterfactual is in play, what causal support-basis triage value supports it, and what the next move is.
Durable cards and profiles appear only when the claim needs them. The pattern buys explicit causal discipline without turning every causal word into a paperwork exercise.
First-Minute Questions
C.28 in 60 seconds is the operational entry into CausalUseTriageRecord:
- Detect whether the claim reaches
CausalUseActivation: it changes what publication, choice, deployment, assurance, audit, benchmark, or support treatment is admissible. - Stop with
nextMove.cheapStopif the claim only reports association, trend, description, measurement, or simulation-only output. - If causal use is live, fill
targetCausalityLadderRung,comparatorOrCounterfactualRef, andcausalSupportBasisTriageValue. - Fill
supportedUse: CausalUseSupportStatementandunsupportedUse: CausalUseUnsupportedStatementas one action pair. - Fill
nextMove: CausalUseNextMove: choosecheapStopor escalate only when the claim is decision-bearing, publication-bearing, assurance-bearing, fairness-bearing, benchmark-bearing, or reusable.
First Output
The first output is a CausalUseTriageRecord:
cheapStop values are terminal or downgrade actions. They close the local causal-use question for now by saying what narrower use remains admissible, which neighboring pattern governs the remaining non-causal question, or that causal use is declined. escalateOnlyIfUseDependsOnCausalSupport values are record-opening actions. They are admissible only when the supported-use and unsupported-use boundary cannot safely carry the reader's next action by itself.
If this first output cannot be written honestly, the causal-use claim is not ready.
CausalUseSupportStatement is one concrete causal-use action the current support makes admissible, such as publish association-only wording, use a bounded interventional estimate for a named decision, deploy only under a named policy constraint, run a fairness audit under a named causal estimand, or compare methods only inside one declared causality-ladder rung. It is not a confidence label, graph name, method name, or generic "evidence exists" phrase.
CausalUseUnsupportedStatement is the matching concrete causal-use action the current support does not make admissible, such as intervention-effect wording, realized counterfactual sample wording, causal fairness certification, causal policy optimality, cross-rung benchmark superiority, or release use or deployment use. The supported and unsupported statements travel as a pair so the reader can act without inferring the boundary from prose tone.
The triage record may be the final causal-use record. Triage lines are enough when they block the overclaim and tell the reader what narrower use remains admissible. Do not open a local card merely because the word "cause", "effect", or "counterfactual" appears.
The triage causalSupportBasisTriageValue field is the first-pass local field for CausalEvidenceSupportBasis | missing. If a claim escalates beyond triage, the value must be refined to CausalEvidenceSupportBasis; missing becomes unsupportedUse, CausalUseSupportVerdict = unsupported, or abstain.
Problem Frame
FPF already has dedicated neighboring patterns for measurement, evidence, assurance, temporal claims, decisions, exploration, call planning, fairness, method dispatch, parity, and quantum-like modeling. None of those neighbors should become the general authority for causal use.
C.28 exists because causal use cuts across those neighbors. The same sentence can be:
- a measurement description handled by
C.16; - a temporal trend handled by
C.27; - an assurance claim handled by
B.3; - an evidence graph reference handled by
A.10; - a decision record handled by
C.11; - a pool-policy record handled by
C.19; - a call-planning record handled by
C.24; - a fairness audit handled by
D.5; - a parity report handled by
G.9; - a quantum-like residual handled by
C.26; - or a causal-use claim governed here.
The first pattern task is therefore not to classify wording for its own sake. It is to recover the live causal question, the target causality-ladder rung, the support basis currently available, and the cheapest truthful next move. Sometimes that move is to downgrade the claim to association, temporal change, metric-only fairness, or simulation-only use. Sometimes it is to open identification, realizability, evidence-design, fairness, policy-evaluation, or benchmark-parity work. C.28 exists to keep those moves distinct and to stop teams from acting as if an identification, realizability, or intervention-support basis had already been earned.
Problem
Causal language is easy to overclaim because ordinary prose hides the difference between association, action, counterfactual comparison, realized counterfactual sample, identified estimate, and simulation.
Three collapses are especially dangerous:
- Rung collapse. Observational association, interventional action or effect, and counterfactual comparison are treated as one causality-ladder rung.
- Support collapse. Observed data, experimental data, direct counterfactual-rung samples, identified estimates, and simulations are treated as one evidence basis.
- Use collapse. A result that supports one use, such as association reporting, is reused for another use, such as causal fairness, policy optimality, or method superiority.
C.28 prevents those collapses by making rung, support, and use explicit before claims requiring higher causal support are admitted.
Forces
Solution
Use a three-level causal-use escalation:
- Start with
CausalUseTriageRecord. - Escalate to
LocalCausalUseQuestionCardorDurableCausalUseQuestionCardonly when the claimed use needs a reusable causal-use record. - Add profiles or specialized records only when the claim triggers that exact need: identification, realizability, evidence design, fairness, policy evaluation, transportability, estimation validity, causal-variable representation, or parity.
The default move is cheap. The heavy move is triggered.
Causal-use governance and consumer carry-through boundary
C.28 governs causal-use objects, CausalEvidenceSupportBasis values, causal-use support and unsupported-use statements, identification and realizability profiles, and causal-use verdicts.
Neighbor patterns keep their local authority and consume only the causal-use pieces they need: measurement, evidence path, assurance, fairness, decision, exploration, call-planning, dispatch, parity, and refresh records do not become causal-use governing patterns by carrying C.28 fields.
A neighbor may quote the C.28 values it consumes for by-value readability. Quoting the values does not transfer governing authority. A neighbor pattern governs only its local record and must cite C.28 when the causal-use question or causal-support basis is live.
Compact crosswalk:
Rung-support-use examples:
Causality-Ladder Rung
CausalityLadderRung is a controlled value set:
observationalAssociationRungmeans passive observation, natural behavior, association, or seeing-only case.interventionalActionRungmeansdo(x), intervention, action setting, experiment, policy change, or action-effect case.counterfactualComparisonRungmeans counter-to-fact comparison, unit-history-conditioned comparison, potential-outcome contrast, or counterfactual-imagination case.
A higher causal-use rung is not supported by lower-rung data unless a CausalIdentificationProfile, CounterfactualSamplingRealizabilityProfile, or bounded-use statement says exactly what is supported and what is not.
Causal-Use Claim Kind
CausalUseClaimKind is the controlled value set for the local causal-use claim being made:
causalEffectClaimmeans a result is used as an effect, improvement, harm, intervention claim, or outcome claim.counterfactualComparisonClaimmeans a counter-to-fact, potential-outcome, or unit-history-conditioned comparison is being used.causalFairnessClaimmeans fairness is claimed through a causal path, intervention, counterfactual, or causal estimand rather than only a metric.causalPolicyClaimmeans a policy, action rule, exploration rule, or agentic strategy is claimed as causally preferable.causalBenchmarkParityClaimmeans causal methods are compared for parity, superiority, or benchmark consumption.causalEvidenceSupportClaimmeans an evidence path is being used as causal-use support.causalAssuranceSupportClaimmeans an assurance tuple or support verdict is being used for a causal-use claim.
Simulation-only causal use stays inside the existing claim-kind set. simulationOnlyCounterfactualOutputBasis is a support-basis value, with bounded use written through supported-use and unsupported-use statements; it is not a new CausalUseClaimKind. Use the relevant claim kind, usually counterfactualComparisonClaim, causalPolicyClaim, causalBenchmarkParityClaim, or causalEvidenceSupportClaim, and set CausalEvidenceSupportBasis = simulationOnlyCounterfactualOutputBasis with bounded model-supported use and unsupported use. Bounded model-supported simulation use does not become realized counterfactual sample evidence or intervention-effect evidence. Do not mint a separate simulation-only claim kind merely to avoid naming the support basis value.
Encoding rule: choose the causal-use claim kind by the question being answered, then choose simulationOnlyCounterfactualOutputBasis as the support basis and write CausalUseSupportStatement and CausalUseUnsupportedStatement for the bounded simulation use.
Causal-Use Cards
Use a local card when the claim needs a small working record:
Use a durable card when the claim is decision-bearing, publication-bearing, fairness-bearing, benchmark-bearing, assurance-bearing, or reusable:
The durable card is not the default. It is the record used when a causal note without the required [C.28](/generated/patterns/C.28) support basis would be unsafe.
Causal Evidence Support Basis
CausalEvidenceSupportBasis is a controlled value set:
This is the [C.28](/generated/patterns/C.28)-governed value set for causal evidence support basis. causalAssumptionOnlySupport and noCausalEvidenceSupport are not values of CausalEvidenceSupportBasis: assumption-only support condition belongs in causalAssumptionSetRef plus supported use and unsupported use; no-support basis value belongs in CausalUseSupportVerdict, unsupportedUse, or abstain.
Simulation-only output never becomes realized counterfactual-rung evidence by name alone. It may support model-based use only when assumptions, validation, and supported use and unsupported use are declared.
CausalEvidenceSupportBasis names a support-basis value. It is distinct from an evidence source, an [A.2.4](/generated/patterns/A.2.4) evidence-use relation, and an [A.10](/generated/patterns/A.10) evidence-provenance path. Some support bases are direct empirical support-basis classes, such as observational or interventional support. Other support bases are inferential support-basis classes, such as identified counterfactual estimate support. Do not read this value set as only a raw evidence-source kind.
realizedCounterfactualSampleSupportBasis does not mean observing two incompatible outcomes for the same unit in one realized world. It means physically obtaining samples from the declared target counterfactual distribution under the profile's physical, ethical, operational, unit-history, and graph constraints.
Identification Profile
CausalIdentificationProfile answers whether a causal or counterfactual estimand can be expressed from available data plus assumptions, graph representation, and inferential calculus.
Identification is inferential support. It is not direct physical sampling.
Realized counterfactual data may change an identification derivation, tighten a bound, or change which assumptions are still needed. When it does, the profile names the data refs, identification method, and bound ref that changed the result. It does not erase the distinction between identification and direct sampling; the profile must still state what is identified, bounded, unknown, or not identified.
Counterfactual Sampling Realizability Profile
CounterfactualSamplingRealizabilityProfile answers whether samples from a counterfactual-comparison target distribution can be physically obtained through admissible actions under physical, ethical, operational, unit-history, and graph constraints.
Realizability is operational. It asks what work can be done, by which system, with which action primitives, under which constraints.
Applied Causal-Inference Profiles
Target-trial and potential-outcomes claims use TargetTrialProtocolRecord and U.PotentialOutcomeContrast when the causal-use claim is an applied intervention-effect claim.
Target-trial emulation from observational data adds a mapping and reporting record. TargetTrialEmulationMappingRecord records the fit between the protocol and the observed data; TargetTrialProtocolRecord alone does not state emulation adequacy.
Numerical causal estimates use CausalParameterEstimationProfile when estimation validity is live:
Transported support uses CausalTransportabilityProfile:
Off-policy causal evaluation uses OffPolicyCausalEvaluationProfile when a policy is evaluated from data generated by another behavior or logging policy:
Causal representation learning uses CausalVariableRepresentationRecord when abstract causal variables are learned, selected, abstracted, or represented from fine-grained observations rather than given by the domain:
Causal Graph Representation Names
Use names that causal inference specialists can recognize:
When graph separation or graphical calculus is part of the causal-use support, use controlled values rather than open prose:
CausalGraphRepresentationKind, GraphSeparationCriterionKind, and CausalInferenceCalculusKind are formal-support classification values, not minted model objects. They classify the formal support form being used for causal support. Concrete ...Ref fields point to actual models, diagrams, proof objects, assumptions, or epistemes and must be present when the causal-use claim depends on that formal support form. For example, StructuralCausalModelRef cites a concrete SCM object, while structuralCausalModelTwinNetworkRepresentation classifies a representation form.
StructuralCausalModel is the causal model kind with endogenous variables, exogenous variables, structural assignments, and intervention semantics. structuralCausalModelTwinNetworkRepresentation means the SCM twin-network representation used in counterfactual reasoning with shared exogenous variables. It is not a deep-learning twin network.
Acronyms such as SCM, DAG, ADMG, SWIG, and AMWN may appear as source labels, plain labels, and bridge notes. FPF Tech values expand the source name when expansion reduces alias risk.
Causal Use Evidence Design
Use CausalUseEvidenceDesignRecord when the causal-use claim needs evidence planning, evidence graph support, experiment or quasi-experiment design, counterfactual randomization, mixed-design accountability, or simulation validation.
This record does not replace [A.10](/generated/patterns/A.10) or [B.3](/generated/patterns/B.3). It gives them causal-use structure.
Higher-requirement causal evidence is worth planning only when it can change a choice, deployment decision, fairness consequence, assurance consequence, or benchmark conclusion enough to justify its cost, risk, and delay. If additional support would not change the next action, keep the narrower supported use explicit and stop.
Verdicts
CausalUseSupportVerdict is the action grammar:
supportedmeans proceed only under the named supported use.boundedmeans proceed only inside the named limit and recordcausalBoundedUseReason.unsupportedmeans downgrade the claim or remove causal use.abstainmeans no causal-use conclusion and recordscausalAbstainReason.
No verdict is allowed to silently widen the claim beyond its evidence support basis.
Causal Action Policy Class
Use CausalActionPolicyClass when a decision, exploration policy, call plan, or agentic strategy depends on causal rung:
naturalBehaviorPolicyfollows observed or natural behavior.interventionalPolicychooses an action ordo(x).counterfactualPolicyacts conditioned on natural action, unit history, or counterfactual response.
This distinction matters for [C.11](/generated/patterns/C.11), [C.19](/generated/patterns/C.19), and [C.24](/generated/patterns/C.24); it does not make those patterns the authority for causal evidence, identification, or realizability.
CausalActionPolicyClass is a classification value for policy-use class: natural behavior, interventional action, counterfactual policy, mixed policy, or unknown policy. It is not the policy object, not U.Policy, not [C.19](/generated/patterns/C.19) pool policy, and not the executable policy used by an agent.
Local U.* alignment
U.CausalUseQuestion names the question whose answer would make a causal use admissible: association use, intervention-effect use, counterfactual-comparison use, causal fairness use, causal policy use, causal evidence support use, causal assurance use, or causal parity use. It governs the question-to-use relation, not the evidence path, estimator, policy object, graph object, or local neighbor pattern.
U.CausalEstimand names the target quantity, contrast, distribution, or functional answer shape for a U.CausalUseQuestion. It binds the question to what would have to be estimated, identified, sampled, bounded, or emulated. It is not the estimator, not the observed metric, not the graph, not the policy object, and not the support verdict.
The card and profile family relates to those heads this way: triage decides whether a U.CausalUseQuestion is live; local cards and durable cards stabilize the question, U.CausalEstimand, and supported use and unsupported use boundary; profiles and specialized records state what support basis, formal support form, operational work, assumptions, and admissible use the question-estimand pair can carry.
Local name cards:
Lexical tripwires:
Neighbor Governing-Pattern Selection Table
Non-Goals
C.28 does not:
-
define physical causation or decide what causation is in the modeled world;
-
choose one causal school, such as SCM and PCH, potential outcomes, target-trial emulation, transportability, causal ML, causal RL, or causal fairness, for all FPF use;
-
certify a DAG, SCM, SWIG, AMWN, or other graph as true or sufficient causal support by naming it;
-
replace local domain science, domain intervention definitions, outcome definitions, or substantive rival-cause knowledge;
-
replace
C.16measurement and metrics characterization, including metric construction, calibration, and non-causal score interpretation; -
replace
A.10evidence graph referring, provenance paths, A.2.4 evidence-use relations, source-use relations, publication-use relations, or evidence graph path discipline; -
replace
B.3trust and assurance calculus, assurance tuples,F-G-R/CLconsequences, or assurance publication use; -
replace
D.5bias audit and ethical assurance, causal-fairness audit responsibility, human-impact review, or group-impact review; -
replace
G.9parity benchmark harness, causal-rung parity screen, or benchmark report structure; -
replace
C.11choice,C.19exploration and exploitation policy, orC.24call-planning patterns; it only supplies causal-use support boundaries consumed by those patterns.
Cheap Downgrade Library
Use a downgrade sentence when a narrower admissible use is enough:
Each sentence below is an admissible cheapStop wording. It closes the causal-use question for the named insufficient-support case unless the author keeps a publish, choose, deploy, assure, audit, benchmark, or support-treatment use that commits the text beyond the cheapStop boundary alive.
Causal-use payoff check
The causal-use payoff check keeps a causal-use record only when it changes the admissible next action or blocks a concrete overclaim. Keep the causal-use record only when at least one answer is "yes":
PublicationUnit Stability Relation
When the live problem is only local wording pressure inside one PublicationUnit, local lexical-head repair under E.17.AUD.LHR, whole-unit primary entity-of-concern stabilization under E.17.AUD.OOTD, relational precision restoration, explanation faithfulness, or conservative retextualization, apply the governing publication-side FPF pattern rather than C.28. C.28 opens at CausalUseActivation, when the wording makes publication, choice, deployment, assurance, audit, fairness, policy, or benchmark use depend on causal support.
Causal-Laundering Golden Cases
Archetypal Grounding
Tell. A causal-use claim is a promise about what a reader may do with a result. The claim is safe only when the rung, contrast, support basis, and allowed use are named.
Show (System). A product team observes that users who received an intervention had better outcomes. C.28 first records an observational association unless the team can name an interventional-action design, target trial protocol, identification profile, or evidence design that supports intervention-effect use. If the team only has observational association, the next move is to publish association or build evidence, not to claim causal improvement.
Show (Episteme). A fairness report says one model is fair because a metric improved after a policy change. C.28 asks whether the fairness claim is associative, interventional, or counterfactual. If it is interventional-action-rung only, it cannot be published as counterfactual fairness without identification or realizability support.
Show (Policy). A team wants to deploy a causal policy learned from logged behavior data. C.28 records causalPolicyClaim, interventionalActionRung or counterfactualComparisonRung as appropriate, CausalActionPolicyClass, OffPolicyCausalEvaluationProfile, support checks and overlap checks, uncertainty, supported policy use, and unsupported policy use. If the behavior policy cannot support the target policy, the admissible output is bounded use or abstain rather than "the policy is optimal".
Show (Causal RL). An online learner uses behavior-policy logs and counterfactual data-fusion to choose a treatment, ranking, or action policy. C.28 records the natural behavior policy, evaluation policy, CausalActionPolicyClass, target rung, confounding assumptions and support assumptions, OffPolicyCausalEvaluationProfile, uncertainty, supported policy use, and unsupported policy use. The learner may publish bounded causal policy support only for the declared regime; it must not turn replay reward, exploration success, or counterfactual strategy output into an unqualified optimal-action claim.
Show (Evidence Work). A lab can physically run a counterfactual-rung sampling procedure by assigning compatible action regimes to matched units under ethical and operational constraints. C.28 separates CounterfactualSamplingRealizabilityProfile from CausalIdentificationProfile: the realized sampling work becomes U.Work with A.10 evidence path refs, A.2.4 evidence-use relations, and guards, while identification remains the inferential derivation from assumptions, graph, calculus, and available data.
Show (Simulation-Only). A simulator produces "what would have happened" traces for a rollout decision. C.28 can allow useful model-supported use without calling the traces realized counterfactual-rung evidence: the record uses simulationOnlyCounterfactualOutputBasis, names counterfactualModelAssumptionSetRef, simulationValidationRef, supported simulation use, and unsupported use. The output may support rehearsal, sensitivity exploration, or model-based explanation inside declared limits; it does not support direct counterfactual sample wording or intervention-effect publication by vocabulary alone.
Show (Benchmark). A benchmark compares one observational predictor, one intervention optimizer, and one counterfactual strategy. C.28 does not ban the comparison, but it requires CausalMethodRungParityRecord through G.9: if rung, estimandRef, interventional-action basis, support basis, consumed C.28 support record and verdict, transportability, follow-up window, and estimation-validity basis are not comparable, the benchmark publishes bridge and loss relation, degraded use, or abstain instead of one superiority claim.
Bias-Annotation
C.28 is mainly a causal-discipline and anti-overclaim pattern for decision-bearing causal use. One part of that work is catching language laundering, but the larger job is to keep causal reasoning, evidence design, realizability, policy evaluation, fairness use, and benchmark parity from silently borrowing a C.28 support basis, support verdict, or admissible-use value they do not actually have.
Common biases:
- Causal prestige bias. A result sounds more important when phrased causally, so under-supported evidence gets overused.
- Simulation laundering. A simulated counterfactual is treated as observed or realized counterfactual-rung evidence.
- Metric proxy bias. A fairness or performance proxy is treated as a causal result without rung and estimand.
- Benchmark scalarization bias. A method comparison collapses different causal rungs, estimands, or transport assumptions into one score.
- Graph sufficiency bias. A named graph is treated as enough without assumptions, data regime, calculus, and admissible use.
The repair is not to ban causal language. The repair is to recover the live causal question, choose the least-committing admissible causal use supported by the available evidence, and then either downgrade, bound, design a causal-evidence plan with the required C.28 support basis, open identification or realizability work, or abstain.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
C.28 makes causal use slower only when the claim commitment, consequence risk, or evidence demand warrants it. Cheap causal triage remains cheap.
Positive consequences:
- Causal claims become inspectable by rung, support basis, and admissible use.
- Counterfactual sampling realizability becomes operational rather than merely philosophical.
- Identification and realizability no longer collapse.
- Fairness, policy, and benchmark claims stop borrowing causal-use authority beyond what their evidence supports.
- Adjacent patterns use narrow causal hooks without becoming general causal authorities.
Costs:
- Authors must learn a small causal vocabulary.
- Some attractive claims will be downgraded to association, bounded use, simulation-only, or abstain.
- Higher-rung claims need more evidence, assumptions, or work-plan detail.
The cost is intended. It is cheaper than publishing an unsupported causal use.
Rationale
FPF needs this pattern because causal language changes what a reader may do.
Temporal language can say that something changed. Measurement language can say that a score is higher. Assurance language can say that evidence has more or less support. None of those alone says that an action caused a result, that a counterfactual comparison is supported, or that a causal policy should be deployed.
C.28 therefore uses a semantic-authority split:
C.28governs causal-use question, rung, estimand, identification, realizability, causal evidence support basis, and causal-use verdict.- Neighbor patterns keep their own authority and cite
C.28only when causal use is live. C.26applies only after C.28 causal-use triage leaves a residual quantum-like issue: intervention, causal effect, causal fairness, causal policy, and counterfactual-rung-data realizability are ordinary causal-use questions before they are quantum-like modeling questions.
The pattern is not Pearl-only. SCM and PCH provide the rung discipline, but potential outcomes, target-trial emulation, causal ML estimation, transportability, causal representation learning, causal RL, and causal fairness all change the fields that FPF must preserve.
SoTA-Echoing
Relations
C.16governs measurement and metrics.C.28activates only when a measurement is used causally.C.27governs temporal claim adequacy.C.28activates when temporal change is used as causal effect, intervention evidence, or counterfactual comparison.A.10governs evidence graph referring.C.28supplies causal evidence support basis and causal-use support refs for evidence paths.A.2.4governs episteme evidence-use and status-use relations.C.28requires causal support-basis and causal-use distinctions that keepsimulationOnlyCounterfactualOutputBasis,identifiedCounterfactualEstimateSupportBasis, interventional evidence, andrealizedCounterfactualSampleSupportBasisfrom being confused.A.6,A.6.B, andA.6.Cgovern boundary, deontic, promise, commitment, utterance, contract-language, and L/A/D/E-classified claim language.C.28supplies only causal-use support when mixed boundary sentences claim causal effect or counterfactual support.A.15governs role, method, plan, and work alignment.C.28supplies the causal-use semantics for intervention assignment, target-trial emulation, counterfactual sampling work, and causal evidence collection.B.3governs trust and assurance.C.28supplies the causal-use verdict thatB.3can degrade, bound, or abstain over.C.11governs decision theory.C.28supplies causal-use question and causal action-policy class when value, utility, regret, or optimality depends on causal rung.C.19governs explore/exploit pool policy.C.28supplies causal rung, policy fields, and regime fields when exploration collects causal data or learns causal policy.C.24governs agentic tool use and call planning.C.28suppliescausalActionUseSpecwhen calls select observation, intervention, counterfactual-rung evidence collection, or counterfactual policy conditioning.D.5governs bias audit and ethical assurance.C.28supplies causal fairness rung, estimand, support, and supported fairness use.G.5governs method dispatch and MethodFamily registry.C.28supplies causal method or policy class declarations when method dispatch compares causal methods.G.9governs parity and benchmarks.C.28supplies causal method rung parity.G.11governs refresh orchestration.C.28supplies causal-use support records whose realizability, identification, fairness, representation, off-policy, target-trial, and simulation-validation shifts can trigger refresh.C.26governs quantum-like modeling.C.28must first triage causal use when the question under repair is intervention, causal effect, causal fairness, causal policy, counterfactual comparison, or counterfactual-rung-data realizability;C.26applies only to the residual quantum-like modeling issue.
C.29 Mathematical-Lens Use Relation
C.29may document that a mathematical mapping appears abstraction-like, quotient-like, coarse-graining-like, simulation-like, or macro-model-like. It does not decide causal-use support. When the supported use includes intervention, policy, counterfactual, causal explanation, or causal decision, applyC.28; otherwise recordCausalUseDisposition = noCausalUseClaimorcausalUseBlocked.
C.28:End
Mathematical Lens Use
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative
Plain-name. Mathematical lens use.
Primary EntityOfConcern. C.29 concerns a declared mathematical-lens use for a stated phenomenon, EntityOfConcern, relation, claim, or structure-bearing situation. The use names the mathematical object, formalism, learned representation, simulation object, local formal role, or mathematical family; the mapping mode; the preserved structure; the lost structure; the visible payoff or obstruction; the declared lens use; the blocked overread; and the stop condition. FPF-governed wording, pattern examples, method notes, review records, PublicationUnits, decision-facing text, comparison-facing text, bridge-facing text, and assurance-input text can contain or cite that use, but they are not the primary EntityOfConcern of C.29.
Slot discipline. C.29 uses CandidateMathObject for the mathematical object, formalism, learned representation, simulation object, local formal role, or family in a declared mathematical-lens-use relation. U.Signature(profile=FormalSubstrate) in A.6.0 is a different relation position: it declares vocabulary, laws, imports, and applicability for a formal-deductive profile. A.6.1 governs mechanism import or realization when that U.Signature(profile=FormalSubstrate) declaration is used in a mechanism; E.18.1 governs P2W carry-through when accepted problem-side material needs that formal declaration for later work. The same mathematical object may appear in several of these positions, but the governing pattern is selected by relation position and claim being made, not by a source-local head word.
Output boundary. C.29 outputs are lens-use notes, one-line entries, mini-cards, full cards, and neighboring-pattern notes. They state which declared mathematical-lens use is bounded as usable, what remains blocked, and which neighboring FPF pattern governs any non-lens claim being made. Project approval, work, evidence, assurance, decision, or release use must be recorded through the governing pattern for that use.
No new U.* from C.29 local lens-use outputs. MathLensUse.OneLine, MathLensUse.MiniCard, MathLensUse.FullCard, MathLensUse.Card@Context, MathLensUseOutputRef, and CC-C29-* are C.29-local instruments. They do not mint U.MathLens, U.MathLensUseRecord, LensKind, MathLensUseCompliance, or a durable record family. Durable names, kinds, or records require an accepted FPF naming and kind decision through F.18, C.3, F.8, and E.9.
First-use card
Use this card before the full card. It is enough for the first use pass unless publication, bridge, assurance input, benchmark, model selection, prediction, formal pattern claim, or repeated cross-case use is being made.
Start with the useful lens decision: choose, apply, bound, replace, or remove a mathematical lens when the mathematical structure changes explanation, decision, prediction, comparison, publication, bridge, assurance input, reusable transfer, or the next lens-use repair. If no next lens-use move changes, keep ordinary prose or write NoMathLensUseNeededNote. If state, transition, measurement, causal use, bridge semantics, temporal adequacy, assurance, selector, benchmark, or release is the claim being made, apply the governing FPF pattern and keep C.29 to the mathematical-lens use part.
Problem frame
FPF already uses mathematical structures in several local patterns. A.6.P asks for stable relation-precision structure during relation precision restoration; A.3.3 governs dynamics; A.19 governs characteristic spaces and structural overlays; C.18.1 and C.19.1 govern scale-law and Bitter-Lesson claims; C.26 contains the separation of a quantum-like lens from physical quantum ontology; F.9 governs cross-context bridges and loss.
The positive need is as important as the guard. In working projects, first-principles mathematical thinking starts from the smallest declared structure that can make a next move derivable, inspectable, or honestly blocked. A queue can expose waiting and bottlenecks, a state space can expose variables and transitions, a graph can expose dependencies, a metric-space distance or topology can expose comparability limits, a symmetry can expose invariants, a variational principle or constrained optimization functional can expose an extremal condition, constrained variation space, boundary condition, conservation link, or trade-off, an information or probability measure can expose uncertainty, a resource bound can expose realizability limits, and an obstruction can expose where a transfer or simplification stops.
The missing FPF rule is general but narrow: when FPF-governed wording, a pattern example, method note, review record, PublicationUnit, or neighboring-pattern note uses or plausibly needs a mathematical object, formalism, or family for explanation, decision, prediction, comparison, publication, bridge, assurance input, or reusable application, the C.29 application records the useful first-principles modeling structure and its boundary. It names the candidate mathematical object or family, what structure is preserved, what structure is lost, what invariant, lens-bounded distinction, obstruction, diagnostic boundary, or constructive limit becomes visible, which LensUseBoundaryValue value is declared for that use, and where the mathematical-lens use stops.
A C.29 application is justified when a mathematical object is used for explanation, decision, prediction, comparison, publication, bridge, assurance input, or reusable transfer, or when a stable working problem is under-lensed and a cheap candidate lens could expose useful structure for the next move. Mathematical appearance alone is not enough.
The first move is not a full-card demand. It is a first-principles entry decision: choose the smallest mathematical structure that changes the next lens-use move, keep ordinary prose when no mathematical structure changes the move, or apply the governing FPF pattern when the claim being made is outside the declared lens use. The result records what the lens preserves, what it loses, what it makes visible, what remains blocked, and where the use stops.
Selected compact formulation:
A useful mathematical lens is compression with invariants and declared losses.
This compact line is retained as a Plain-register orientation, not as a substitute for the card. It keeps the useful metaphor of a lens: a mathematical object can make a hidden structure visible, but only by carrying some structure and dropping other structure. The first practitioner questions are: what survives the transfer, what is lost, what can now be done, and where does the lens stop?
First-minute working situation
A practitioner applying FPF faces a working situation where ordinary prose can hide useful structure, or where a mathematical phrase is already doing work:
- waiting, backlog, bottleneck, or throughput can call for a queue or flow lens;
- state change, stabilization, control pressure, or forecast can call for state-space or dynamics vocabulary;
- dependency, interface, composition, or transfer failure can call for graph, hypergraph, category, operad, or compositional vocabulary;
- similarity, distribution shift, population movement, or shape change can call for metric-space distance, topology, embedding, or optimal-transport vocabulary;
- scale transition, coarse behavior, universality, knee, or scaling pressure can call for coarse-graining, RG, or scaling-law vocabulary;
- probe effects, order effects, context effects, or incompatible frames can call for quantum-like or contextual-probability vocabulary.
The useful first-minute intuition is not “hunt for overclaim.” It is “find the structure that would improve the next move, then name the limits.” A vivid phrase can remain when the C.29 output records what the lens makes visible, what it does not license, and which governing pattern governs any causal, evidence, bridge, dynamics, scale, measurement, assurance, or release claim.
Without a general lens-use discipline, the reader cannot tell whether the phrase is a bounded structure-preserving representation, an analogy-only prompt, an ungrounded ontology import, a local domain model, or prestige language.
Minimum scenario and anti-case set
Positive scenario. A production line is represented as a queueing network. The lens preserves flow, bottlenecks, service rates, and waiting times; it loses human meaning, contractual obligations, rare failure modes, and causal interventions not represented by the network; the stop condition says that the queueing lens is declared usable for throughput and latency reasoning, not a full organizational ontology.
Anti-case. “The organization is a quantum system” is written without a candidate mathematical object, probe distinction or readout distinction, preserved structure, lost structure, LensUseBoundaryValue, or stop condition. The C.29 result is either a downgrade to local metaphor or a repaired use through C.29 and, where relevant, C.26.
Under-lensed anti-case. “The work stream has dynamics” or “this portfolio is a network” is used for a diagnosis that affects prediction, comparison, repair, or stop conditions, but no mathematical object changes what can be predicted, compared, diagnosed, repaired, or stopped. The repair is to choose a cheap candidate lens that exposes useful structure, or keep the sentence as ordinary prose.
False-positive scenario. A Markov kernel appears inside accepted local reliability modeling. If no contested lens-transfer, publication, assurance, bridge, or reusable explanation claim is being made, the claim stays under A.3.3 and does not require a C.29 output.
Intended FPF use-value
C.29 gives a cheap-output choice before any full card or boundary table. Its first job is to help the working reader introduce, choose, repair, bound, or decline a mathematical lens by selecting the cheapest honest output: no C.29 output, a candidate note, a one-line repair, a mini-card, a full card when high-reliance use requires it, or a neighboring-pattern note when the claim being made is outside declared mathematical-lens use. Use it only when the mathematical lens affects a claim or next move; ordinary local math and decorative prose stay outside C.29. A successful C.29 result makes useful mathematical compression available to FPF as a disciplined modeling move while reducing ontology smuggling, prestige vocabulary, loss-free transfer, causal laundering, bridge duplication, evidence laundering, and assurance laundering.
Problem
Accepted FPF mathematical-lens use criteria are distributed and local:
A.6.Pgoverns relation precision restoration, but not every mathematical-object transfer.A.3.3governs state, transition, observation, validity, constraints, and calibration for dynamics, but not all mathematical representation choices.A.19governs characteristic spaces, structural overlays, comparability, normalization, and bridge-aware state comparison, but not the adequacy of all mathematical lenses.C.18.1andC.19.1govern scale-law and BLP claims, but not non-scale mathematical lenses.C.26is the local precedent for mathematical-lens detachment, but only for quantum-like modeling.F.9governs cross-context semantic bridges, but does not decide whether a mathematical object, formalism, or learned representation is adequate inside one context or as a domain-transferring lens.
There are two symmetric failure modes.
The first failure mode is mathematical under-lensing: a working situation needs a mathematical lens that changes prediction, comparison, diagnosis, repair, or stop conditions, but the record contains only ordinary prose, familiar school math, or a broad family name such as graph, field, space, score, trend, dynamics, or quantum-like without a useful invariant, obstruction, state variable, mapping, scale behavior, rival lens, or action-changing payoff.
The second failure mode is mathematical overread:
a mathematical phrase begins as a helpful representation and then silently becomes ontology, evidence, causality, comparability, assurance, or use-boundary claim.
Forces
Solution and selected answer
Selected answer in one paragraph
C.29 — Mathematical Lens Use is the general FPF discipline for mathematical lenses used in explanation, decision, prediction, publication, comparison, assurance input, bridge, or reusable transfer. It handles two first-use cases, with the positive case first: an under-lensed situation where the next lens-use move can benefit from a cheap first candidate lens; and an existing candidate lens proposed for application, repair, bounding, replacement, or rejection. Its job is to help the reader introduce, choose, apply, limit, replace, or remove a mathematical lens so that a useful next lens-use move survives. A mathematical lens is usable for a declared use when it compresses a phenomenon by preserving declared structure, exposing useful invariants, and producing lens-bounded predictions, distinctions, obstructions, or diagnostic boundaries inside a bounded context. It is blocked for an undeclared or out-of-bound use when it imports source-domain ontology, hides loss under metaphor, treats source prestige as evidence, or licenses claims outside its declared scale, context, validation, bridge, causal, or assurance boundary.
C.29 does not mint MathLens, U.MathLens, LensKind, or any universal FPF lens object. In this pattern, “mathematical lens” names a declared use of a mathematical object, formalism, learned representation, simulation object, or mathematical family under declared mapping, preserved structure and lost structure, LensUseBoundaryValue, declared lens use, and stop condition; the target phenomenon and any claim outside that declared lens use keep their own FPF kinds.
Naming boundary: C.29 governs mathematical-lens use claims. It does not mint mathematical-lens kinds, and it does not govern or create the EntityOfConcern named by a neighboring claim-bearing episteme, Bridge, evidence path, causal-use relation, assurance score, measurement construction, dynamics semantics, decision record, work record, explanation rendering, comparative review unit, representation transition, coarsened rendering, selector, benchmark, or scale audit. Its outputs are local lens-use outputs unless another accepted FPF pattern names a durable FPF kind.
Mathematical Lens Use Principle
Mathematical Lens Use Principle. A mathematical lens is usable for a declared use when it compresses a phenomenon by preserving declared structure, exposing useful invariants, and producing lens-bounded predictions, distinctions, obstructions, or diagnostic boundaries inside a bounded context. It is blocked for an undeclared or out-of-bound use when it imports source-domain ontology, hides loss under metaphor, treats source prestige as evidence, or licenses claims outside its declared scale, context, validation, bridge, causal, or assurance boundary.
Compact plain form:
A useful mathematical lens is compression with invariants and declared losses.
Register policy: Tech exactness below, Plain metaphor above. Plain phrases such as “structures that survive transfer,” “what the lens makes visible,” and “where the lens stops” are acceptable as recognition aids. When a sentence makes an FPF-kind, relation, evidence, use-boundary claim, causal, assurance, bridge, gate, work, decision, or pattern-application commitment, the corresponding C.29 output recovers the fields named by value and governing patterns.
Zero and first-principles compatibility note: E.1 and E.2 govern the mission and pillar authority. C.29 serves them by making mathematical first-principles lens use inspectable for one declared use: candidate mathematical object, preserved structure, lost structure, visible payoff, bounded move, neighboring-pattern boundary, and stop condition. It does not replace pillar authority, neighboring governing patterns, ordinary FPF reasoning, or the E.9 design-rationale record for normative changes.
Mathematics is not a prerequisite for FPF use. Ordinary prose is enough when no mathematical structure changes the next lens-use move. C.29 earns its place only when a mathematical object, formalism, learned representation, simulation object, or mathematical family changes explanation, decision, prediction, comparison, publication, bridge, assurance input, reusable transfer, or the next lens-use repair.
Plain and Tech bridge:
State and transition semantics stay with A.3.3; temporal aspects stay with C.27.TA; characteristic spaces and overlays stay with A.19; temporal-use adequacy stays with C.27; scale-law and general method-scale preference claims stay with C.18.1 and C.19.1; architecture scale-preference claims stay with C.31.ASAP; causal-use question and verdict stay with C.28.
Mathematicalization Utility Principle
A mathematical lens is worth introducing only when it changes the working reader's next lens-use move by making at least one first-principles modeling structure visible:
- a declared signature, structure, state variable, transition, or observation map;
- a symmetry, invariant, conservation-like constraint, equivalence, or composition rule;
- a local-global relation, boundary relation, scale variable, coarse-graining rule, scale window, or correspondence condition;
- a variational principle, action, energy, free-energy, loss, or value functional, Euler-Lagrange or stationarity condition, constrained optimization target, dual view, objective vector, or resource trade-off;
- an uncertainty, probability, information, typicality, approximation, sensitivity, or validation boundary;
- an algorithmic, constructive, resource, realizability, implementation, or adversarial limit;
- a bottleneck, obstruction, impossibility, consistency boundary, or failed transfer in the candidate-model space;
- a rival-lens distinction that changes model choice;
- a causal, intervention, or counterfactual preservation question governed by
C.28; - a bridge or export loss governed by
F.9; - a measurement or comparability condition governed by
C.16.
If no next lens-use move changes, keep the text as ordinary prose, downgrade it to a didactic metaphor, or return NoMathLensUseNeededNote. A lens that merely makes prose more impressive is not a successful C.29 result.
First-principles lens-family use
C.29 admits first-principles use only when the principle family changes what the working reader can derive, inspect, compare, observe, or honestly block. The family name is never enough. Each row below is a discovery and recovery discipline: it tells the reader what must be named before claim-bearing mathematical-lens use is bounded for use.
This table is normative as a recovery guide, not as a mandatory taxonomy. A local project may name a closer family, but it must recover the same claim-bearing structure: CandidateMathObject or candidate family, preserved structure, lost structure, visible payoff, lens-use boundary value, and stop condition.
P2W and formal-declaration boundary: when one of these families is used in a P2W carry-through from accepted problem-side material into later work, C.29 still records only the declared mathematical-lens use. A declared formal relation can make mathematical-to-mathematical exactness or near-sameness visible; it does not by itself declare a FormalSubstrate signature, PrincipleFrame, mechanism, observation-bound world claim, evidence path, causal-use relation, Bridge-declared lens use, or work. Use A.6.0 for the U.Signature(profile=FormalSubstrate) declaration, A.6.1 when mechanism import or realization is being claimed, and E.18.1 when accepted problem-side material needs a formal declaration for later FPF use.
Bounded-observer structural-information lens
Use this subcase when a mathematical lens estimates, compresses, codes, compares, or otherwise exposes how much selected structure a bounded observer can recover from a description, relation trace, generated graph, model, or reusable-structure accounting result. Typical examples include MDL-like two-part codes, epiplexity-style extracted-structure estimates, compression-complexity comparisons, and information-functionals over relation graphs. The EntityOfConcern remains the declared mathematical-lens use, not the architecture, not the description, and not the observer.
Minimum record:
When the target is a physical, organizational, or project-world situation, the record must say whether the structural-information claim is observational, postulated, simulated, or only a description-local compression. When the lens is used in architecturing, [C.30](/generated/patterns/C.30) governs architecture as EntityOfConcern, [C.30.ASV](/generated/patterns/C.30.ASV) governs structural-view adequacy, [C.30.AD](/generated/patterns/C.30.AD) governs architecture descriptions, and [C.31](/generated/patterns/C.31) or [C.31.RSA](/generated/patterns/C.31.RSA) governs modularity or reusable-structure accounting. [C.29](/generated/patterns/C.29) records only the declared lens use: what recoverable structure the mathematical lens makes visible, what it loses, and where that use stops.
Architecture-local lens descriptions
Architecture work may use C.29-local descriptions for graph, flow, control, structural-information, RG or coarse-graining, and multilevel-learning or frustration lenses. These names are C.29 output descriptions, not architecture ontology, not proof, and not durable FPF kinds by themselves.
MLU.Description@RGArchitecture applies only when the use names a declared aggregation scope, scale variable or scale window, coarse-graining rule, preserved structure, lost structure, source-return condition, and the overread named by value that the lens does not license. If the claim becomes a scale-preference claim, C.31.ASAP governs the architecture preference side; C.29 keeps only the declared mathematical-lens use.
Minimum RG architecture description:
For architecture work, a common RG-shaped candidate object is:
The index _l is a declared aggregation-scope index inside this C.29 lens, not a generic level, tier, layer, or ladder. Each use names the aggregation scope, the coarse-graining rule, the lost structure, and the source-return condition.
MLU.Description@MultilevelLearningFrustration applies only when the use names declared holon levels or declared scopes, a mapping between them, conflicting constraints or residuals, preserved structure, lost structure, and the nearest neighboring FPF pattern for any measurement, causal, evidence, assurance, work, selected-set, or decision claim.
Minimum multilevel-learning and frustration description:
Declared lens use: triage, explanation, candidate generation, rival-lens comparison, scale-window reasoning, source-return triggers, and architecture-decision rationale only when the neighboring pattern governs any non-C.29 claim. Blocked overread: no proof that the project literally optimizes one global function, no causal proof, no assurance score, no claim that complexity necessarily grows, and no replacement for [C.11](/generated/patterns/C.11), [C.28](/generated/patterns/C.28), [B.3](/generated/patterns/B.3), [C.16](/generated/patterns/C.16), [G.5](/generated/patterns/G.5), or stakeholder and ethics patterns.
Use boundary
This boundary prevents C.29 from being over-applied.
Use C.29 when a mathematical object, formalism, learned representation, simulation object, or mathematical family is used as a lens for explanation, decision, prediction, publication, comparison, assurance input, bridge, or reusable transfer over a physical, organizational, epistemic, social, computational, scientific, or methodological phenomenon, or when a phenomenon, decision, explanation, comparison, model-selection, diagnosis, or method-choice problem is stable enough that the first useful move is to choose a cheap candidate lens that makes relevant structure visible.
Do not use C.29 as the governing pattern when:
- the mathematics is ordinary local domain theory already governed by a domain pattern;
- the phrase is a purely didactic analogy that is not reused for decisions, evidence, assurance, publication, bridge, comparison, or transfer;
- the question under repair is causal-use question, causal-use justification, or verdict, which is governed by
C.28; - the question under repair is measurement construction, scale construction, direct comparability, or evidence-stub adequacy, which is governed by
C.16; - the question under repair is cross-context meaning or substitution safety, which is governed by
F.9; - the question under repair is dynamics semantics without a separate lens-transfer claim, which is governed by
A.3.3; - the question under repair is a
CharacteristicSpaceoverlay with no domain-transfer, prediction, assurance, publication, or reusable explanation claim, which stays underA.19. - the use under repair is a
ChoiceResult, local choice record, selected-set publication, selected method,U.WorkPlan, performedU.Work, work-result record, or work-relevant source restoration; those claims stay withC.11,G.5orG.9,A.15,A.15.1, orA.15.4as appropriate. - the use under repair is an explanation-facing rendering, bounded comparative review unit, same-EntityOfConcern representation-scheme transition, or controlled semantic coarsening; those claims stay with
E.17.EFP,E.17.ID.CR,A.6.3.RT, orA.6.3.CSC, with C.29 fields carrying only mathematical-lens use when the mathematical lens affects the stated declared lens use. - the claim being made is about forecast, rate, trajectory, rhythm, recovery, convergence, stabilization, speed, temporal window, or rate-change as sufficient for use; temporal-claim adequacy stays with
C.27.
This boundary keeps mathematical-lens use from becoming a shadow record for neighboring work.
Lexical rule: use structure-preserving representation rather than structure-preserving identification in discoverability-bearing prose, unless equivalence or identity is explicitly the declared LensMappingMode.
Output choice before the full card
Begin with action guidance, not with the full card.
First action choices: keep ordinary prose, introduce a cheap candidate lens, name the CandidateMathObject or formal role that fits the stated use more directly, add visible payoff, add loss, choose the principal rival lens, add validation regime, narrow an existing claim, downgrade an overclaim, or apply the governing FPF pattern to any non-lens claim being made.
Memory hook: a successful C.29 application can raise or lower the mathematical claim-bearing use. It can introduce a first candidate lens, keep ordinary domain prose, remove a mathematical lens, repair relation wording through A.6.P, declare a CharacteristicSpace through A.19, use C.16 for measurement and comparability, apply F.9 for bridge semantics, ask the C.28 causal-use question, restore work or source responsibility through A.15, or apply C.27 for temporal-use adequacy.
No-lens cheap output: name the ProblemStructureCue, choose the cheapest candidate lens family that makes it visible, test whether that lens changes the next lens-use move, and if no move changes, keep ordinary prose or collect more observations before using mathematical-lens wording.
First neighboring-pattern map:
Governing-pattern boundary: C.29 coordinates the declared mathematical-lens use across relation-precision structure, state spaces, characteristic spaces, measurement, dynamics, scale, bridge, causal, evidence, assurance, selector, and benchmark patterns. It does not replace any one of them.
- Find the claim-bearing phrase. Mark the mathematical phrase named by value that affects explanation, decision, prediction, comparison, publication, bridge, assurance-input, or reusable transfer.
- Choose the smallest output class that preserves honesty. The output-class decision happens before any full-card fields.
- Name the concrete mathematical object or structure. Family labels such as
category theory,field,graph,quantum,RG, orgeometryare entry prompts, not adequateCandidateMathObjectvalues for the stated use by themselves. - State the lens mapping mode. Use the least committing honest
C.29-local lens mapping mode: analogy-only prompt, representation, empirical fit, simulation, quotient, abstraction, coarse-graining, embedding, homomorphism, isomorphism, functor-like transfer, cross-context lens-transfer candidate, or accepted local theory. If cross-context meaning, substitution, CL, sense cells, or bridge or substitution use is being claimed,F.9governs that claim; the C.29 fields record only mathematical-lens use for the declared transfer. - State preserved structure and lost structure. This is the central repair move.
- State what becomes visible. Name the invariant, obstruction, fixed point, symmetry, conservation law, diagnostic boundary, lens-bounded distinction, model-selection consequence, or other payoff.
- State the declared lens use and blocked overread. Say what the declared lens use now carries, what remains blocked, and which governing FPF pattern governs any claim being made outside the declared lens use.
- If the claim does not pass, repair rather than merely fail. Downgrade, narrow, switch to a principal rival lens, add
LensUseBoundaryValueor validation regime, split any non-lens claim to its governing FPF pattern, or remove the mathematical phrase from claim-bearing use.
Application output classes:
Micro-template examples:
Architecture and P2W first-use slice:
This filled slice is a C.29 first-use output. It does not declare the formal signature, complete P2W carry-through by itself, select the method, or create work. Those claims are governed by [A.6.0](/generated/patterns/A.6.0), [E.18.1](/generated/patterns/E.18.1), [A.15](/generated/patterns/A.15), [A.15.1](/generated/patterns/A.15.1), [A.15.4](/generated/patterns/A.15.4), [A.10](/generated/patterns/A.10), [C.28](/generated/patterns/C.28), or [B.3](/generated/patterns/B.3) when those claims are being made.
For MathLensUse.OneLine, VisiblePayoff says what the lens makes visible, such as a bottleneck, invariant, obstruction, incompatibility, loss boundary, or diagnostic split. NextLensUseMove says the now-bounded user move, such as compute a local quantity, compare only inside a declared structure, run a validation slice, apply a neighboring pattern, keep the phrase as local metaphor, or remove the phrase from claim-affecting use. ObservationOrReadoutNeeded? names the missing observable, readout, assignment, outcome, validation slice, or scale point needed before the repaired line makes the stated move usable. OrdinaryRivalOrFallback says what the reader would use without this mathematical lens: ordinary prose, accepted local domain theory, direct measurement, a causal model, a queueing model instead of a quantum-like metaphor, an [A.19](/generated/patterns/A.19) space declaration instead of [C.29](/generated/patterns/C.29), or an [F.9](/generated/patterns/F.9) bridge instead of category-like wording. If two mathematical lenses already change the next move at this cheap-output class, add one ordinary-language note about the disagreement and use MathLensUse.MiniCard or MathLensUse.FullCard before claiming a reusable rival-lens relation.
MathLensUse.LensCandidateNote is not evidence, assurance, a bridge, a decision record, a selector result, a literature survey, or a full lens-use card. It is a cheap first-candidate lens selection note. Its successful next outputs are NoMathLensUseNeededNote, MathLensUse.OneLine, or a named neighboring governing-pattern note.
Name guard for this note: ProblemStructureCue is a recognition cue, not a FPF signature; CandidateLensFamily is a family prompt, not a kind; NextLensUseMove is action guidance, not a work record; NextMathLensUseOutput is the next C.29 output class, not a new record family.
Do not use MathLensUse.OneLine with an empty CandidateMathObject. If the candidate object has not yet been named, use MathLensUse.LensCandidateNote first, keep ordinary prose, or write a NeighborGoverningPatternNote when a non-lens claim is being made.
Cheap stop: if the mathematical phrase does not affect any claim beyond orientation, do not use the full card. If the first honest output is NoMathLensUseNeededNote, that is a successful [C.29](/generated/patterns/C.29) result, not an underfilled card.
Output set and declared-use boundary
After applying C.29, the output is one of these:
Positive warning: a successful C.29 output makes the mathematical lens honest for its declared use. Any empirical truth, causal-use, bridge, assurance, release, decision, or benchmark claim still needs its governing FPF pattern.
LensMappingMode, LensUseBoundaryValue, and declared lens use are separate fields.
LensMappingMode names construction, not permission. Typical local values include representation, abstraction, quotient, coarse-graining, embedding, homomorphism, isomorphism, functor-like transfer, simulation, and learned or fitted representation. A broad family name such as graph, field, category, geometry, quantum-like, variational, or Bayesian is only a prompt until the concrete construction and preserved structure and lost structure are named.
LensUseBoundaryValue declares only a limited lens-use boundary:
Declared lens use is not inferred from elegance, familiarity, source prestige, or mapping type. It is stated in declaredLensUse, blockedLensOverread, and StopCondition. Any empirical truth, causal-use, bridge, assurance, release, decision, or benchmark claim remains a separate neighboring-pattern claim.
From lens to local action
Local action change from a mathematical lens is limited to these cases unless a neighboring pattern governs the needed non-C.29 use:
- observe or measure a newly named variable or relation;
- compare only under a declared structure and loss boundary;
- diagnose a bottleneck, obstruction, mismatch, invariant, or failed transfer;
- choose or reject a principal rival lens for this local use;
- narrow, downgrade, or block a tempting overread;
- apply the governing FPF pattern when a claim being made exceeds the declared lens use.
Each item closes either as a local C.29 output or as a named neighboring-pattern application. If the needed result is a work plan, choice result, selector output, benchmark, or evidence record, publish that neighboring result in its governing pattern rather than from this list.
No-lens entry: choosing a first candidate lens
Use this when the next lens-use move can benefit from a mathematical lens but no adequate mathematical object has been named. The output is MathLensUse.LensCandidateNote, not MathLensUse.OneLine and not a full card. State the ProblemStructureCue, choose one cheap CandidateLensFamily, say what it could make visible, name the ObservableOrControllableCue? when available, state the NextLensUseMove, compare it with the OrdinaryRivalOrFallback, and stop if no action changes. If the cue is still pre-articulation and no stable ProblemStructureCue can be named, do not mathematize it; preserve cue plurality through C.2.LS, A.16, A.16.1, B.4.1, B.5.2.0, or the relevant language-state pattern before applying C.29.
Candidate guidance rows are examples for first recognition. Use the row that fits the working cue, or state a closer local cue using the same fields.
MathLensUse.LensCandidateNote is local first-candidate guidance. It does not replace G.2 SoTA synthesis, tradition mapping, or broad lens-family review. Use G.2 when the work being done is tradition-scale source synthesis; use C.29 when the local need is to choose one cheap candidate lens that changes the next lens-use move. The cheap observation and control check does not apply C.16 or A.10 by default; it only asks what the user can observe, read out, assign, vary, or validate now. Measurement construction, evidence relation, intervention-use claim, or validation is still governed by the governing pattern when that claim is being made.
First honest C.29 entry cases
For E.11-style first-entry recognition, distinguish the working entry case before choosing an output:
False-positive bank and entry stops
Do not use a C.29 output for these non-use cases unless a separate lens-transfer, publication, assurance, bridge, comparison, or reusable-explanation claim is being made:
- ordinary ODE inside accepted physics or local engineering model;
- Markov kernel inside accepted stochastic dynamics;
- graph used as a local data structure;
- metric-space distance, topology, order, product, subspace, or embedding declared inside
A.19CharacteristicSpacewith no domain-transfer claim; - category-theoretic proof internal to a domain where that formalism is the local theory;
- one-off pedagogical metaphor not reused for decision, evidence, assurance, publication, bridge, comparison, or transfer.
False-negative bank: use C.29 even when no polished mathematical buzzword appears if the working problem has a structure that changes an next lens-use move and ordinary prose is currently hiding it.
Entry guidance states when C.29 is the first governing pattern and when another pattern is first:
C.29 entry stops are: no C.29 output needed, MathLensUse.OneLine used, or a neighboring governing pattern applied.
Governing-pattern boundary table
A C.29 application uses this governing-pattern discipline so mathematical-lens use stays in the C.29 discipline rather than becoming a second authority over neighboring claims.
Positive claim kind:
A C.29 application gives a pattern-local adequacy discipline for claims that use a mathematical object, formalism, learned representation, simulation object, or mathematical family as a mathematical lens for a stated use. The application asks for candidate mathematical object, lens mapping mode, preserved and lost structure, visible invariant or distinction,
LensUseBoundaryValueor validation regime, declared lens use, blocked overread, and stop condition.
Boundary application rule: when the claim being made is a choice result, work plan, evidence path, assurance tuple, explanation rendering, comparative review unit, representation shift, temporal claim, bridge, causal-use claim, measurement claim, scale-law claim, selector, or benchmark, the NeighborGoverningPatternNote names the governing FPF pattern and project-side record. A C.29 application can contribute a lens-bounded prediction, distinction, obstruction, diagnostic boundary, or rival-lens note that the governing record can cite; it does not create that neighboring record.
Mathematical object or learned representation read as world structure: if a model state, embedding, simulator, category, graph, tensor object, vector-store relation, or learned representation is being used as a mathematical lens for a phenomenon, C.29 records only the declared mathematical-lens use. The output must name TargetPhenomenon, CandidateMathObject, LensMappingMode, PreservedStructure, LostStructure, LensUseBoundaryValue or validation boundary, declared lens use, and StopCondition. Measurement, evidence, assurance, dynamics, causal-use, formal-substrate, characteristic-space, publication, benchmark, selector, work, gate, release, or decision claims remain with the direct governing pattern named in the table below.
MathLensUse.Card@Context shape
MathLensUse.Card@Context is a pattern-local card in C.29. It is not U.MathLensUseCard, U.LensUseRecord, or any universal U.* kind.
Namespace note: MathLensUse.Card@Context, MathLensUseOutputRef, MathLensUse.OneLine, MathLensUse.MiniCard, MathLensUse.FullCard, and CC-C29-* are C.29-local instruments unless they cite existing FPF kinds or refs. MathLensUseOutputRef references the applicable C.29 output for the stated use; it is not a demand for MathLensUse.FullCard. Do not mint generic suffixes such as SystemMathLensUse, MathLensUseQuality, or MathLensUseCompliance. Durable cross-pattern MathLensUse.* names, records, or refs require explicit minting or reuse plus naming, kind, and design-rationale decisions through F.8, F.18, C.3, and E.9; otherwise they remain pattern-local labels.
Read MathLensUse.Card@Context through three aspects:
Validity boundary: mathematical validity of the object under its assumptions is not the same as representational adequacy to the phenomenon; representational adequacy is not empirical validation for a use; empirical validation is not a causal-use verdict; a causal-use verdict is not assurance, release confidence, decision sufficiency, or benchmark superiority.
Conditional fields apply only when the corresponding neighboring claim, claim-bearing use, or publication use is being made:
Plain card gloss. A useful mathematical lens says: what phenomenon is being seen, through which mathematical object, by what mapping, what survives, what is lost, what becomes visible, what lens-use boundary value and validation boundary make this use bounded, the now-bounded user move, the blocked user inference, and where the lens stops.
Conditional overlays
The base card stays light. These overlays are used only when their corresponding use is being made. Ordinary C.29 use does not fill this block; it escalates here only when the claim is already publication-facing, assurance-input, benchmark, bridge, model-selection, prediction, scientific or model, learned-lens, or causal-use facing.
Use the validation overlay when the lens is used for prediction, publication, assurance input, benchmark use, model selection, or scientific claim or model claim. LensUseBoundaryValue alone is then insufficient. Keep the neighboring notions separate: verification is proof or formal checking under stated assumptions; validation is fit for a declared use and regime; calibration aligns model parameters or readouts with observations; explanation states why the lens makes a distinction intelligible. The C.29 output does not let any one of these four labels silently stand in for the others.
Use the learned-lens overlay when the mathematical object is fitted, learned, latent, simulation-trained, data-derived, a neural operator, a surrogate solver, an embedding, or a world-model representation.
Learned-lens stop variants are named explicitly when they are tempting:
This is not a first-class causal abstraction card. It is a lightweight check: when LensMappingMode is abstraction, quotient, coarse-graining, macro-model, or simulation, and declaredLensUse would include intervention, policy, counterfactual, or causal explanation, apply [C.28](/generated/patterns/C.28) for causal-use question and verdict.
Repair decision table
Field meanings
Neighboring-pattern boundaries
Neighboring patterns remain necessary and are not displaced. A retained neighboring-pattern application note answers the working question for the neighboring pattern being used: what does the reader do with the mathematical lens now? State the neighboring-pattern trigger and the first bounded move for that neighboring pattern. If a note only repeats that C.29 does not replace a neighbor, keep that boundary in the C.29 governing-pattern table instead of copying generic boundary prose into the neighboring pattern:
A.6.Phandles relation precision restoration.A.3.3handles dynamics semantics.A.19handles characteristic spaces, overlays, normalization, and comparability.F.9handles cross-context semantics and Bridge loss.C.18.1andC.19.1handle scale-law and BLP claims.C.26handles one specific quantum-like lens family.C.28handles causal-use question and verdict.A.10andB.3handle evidence and assurance.C.11,A.15,A.15.1, andA.15.4handle choice results, method and work separation, work plans, performed work, and work-relevant source restoration.E.17.EFP,E.17.ID.CR,A.6.3.RT, andA.6.3.CSChandle explanation-facing renderings, bounded comparative review units, same-EntityOfConcern representation-scheme transitions, and controlled semantic coarsening.C.27.TAhandles temporal aspects;C.27handles temporal-claim adequacy.
Use the C.29 discipline when the question under repair is: Is this mathematical lens adequate for this declared use, and where does it stop?
Naming, ontology, and epistemic precision-restoration account
Name
Name: C.29 — Mathematical Lens Use.
Local namespace: MathLensUse = Mathematical Lens Use. No prior temporary code is reused; the pattern-local card and reference namespace uses MathLensUse; checklist IDs use CC-C29-*.
The stable name is Mathematical Lens Use because C.29 governs a declared use and its use boundary, not intensity on an unnamed scale. Plain prose can still say that a useful mathematical lens compresses many cases while preserving declared distinctions; claim-bearing use is recovered through CandidateMathObject, LensMappingMode, PreservedStructure, LostStructure, LensUseBoundaryValue, and StopCondition.
C.29-local naming guard
MathLensUse.* instruments are C.29-local unless separately admitted. They are not U.* kinds, not durable FPF record families, and not substitutes for U.Kind, KindSignature, KindBridge, BridgeCard, EvidenceGraph, ChoiceResult, U.WorkPlan, U.Work, or assurance records.
Do not mint LensKind, MathLensKind, MathLensUseQuality, MathLensUseCompliance, or MathLensUseRecord from C.29 use.
When one C.29 application needs a mathematical-lens name to become reusable outside that application, use F.18 local-first naming; when it quantifies over a class of described entities, use C.3 Kind-CAL; when it creates or reuses a durable concept or record family, use F.8 minting or reuse and E.9 design-rationale discipline.
Tempting wrong names rejected
Ontology guard selected for FPF
A physical, organizational, or epistemic phenomenon is not directly identified with a mathematical object; it is represented through a mathematical object by an explicitly declared mapping that preserves some structures and loses others.
C.2.P recoveries applied
Rationale
Why this improves FPF
The selected first-principles position in C.29 is operational, not metaphysical. It treats first-principles mathematical thinking as local construction discipline: declare the smallest structure, rule, invariant, resource condition, observation, or consistency boundary from which the next move follows or is blocked. In that sense, a C.29 application puts mathematical construction before adequacy control: the reader can introduce a queue, graph, state space, measure, topology, algebraic structure, variational quantity, simulation object, or learned representation when that structure improves the work, and then record the mapping, preserved structure, lost structure, lens-use boundary value, and stop condition.
First-principles mathematical structures can come from several families without turning any one family into an FPF-wide foundation: signatures, logics, axioms, type or abstraction distinctions, symmetries, invariants, compositional structure, local-global relations, scale relations, boundary conditions, variational principles, action, energy, free-energy, loss, or value functionals, constrained optimization structure, probability, information, typicality, algorithmic construction, resource bounds, implementation constraints, consistency boundaries, causal or intervention-preservation questions, operator or function-space mappings, and declared observation maps. Each use still needs declared mapping, preserved structure, lost structure, validation regime or lens-use boundary value, and stop condition.
This fits FPF because FPF already commits to state explicitness, bounded contexts, evidence and assurance, cross-context bridges, open-ended evolution, SoTA alignment, notational independence, and avoidance of ornamental formalism.
C.29 makes an existing discipline explicit: when FPF uses a CandidateMathObject, local formalism, learned representation, simulation object, or mathematical family as a mathematical lens for a stated use, the C.29 application declares what that use preserves, what it loses, what it makes visible, which rival lenses still change the next lens-use move, and where its declared lens use stops.
The compact Plain line remains useful because it points to a real heuristic: good mathematical lenses are not decoration; they are compact ways of seeing structures that survive transfer. The Plain line stays readable, while the card and checklist record the FPF commitments named by value.
Alternatives rejected
Pillar impact analysis
Principle-taxonomy balance
Consequences and validation harness
Validation harness for stable-pattern review and material refresh
For stable-pattern review or material refresh of C.29, run a small C.29 validation harness. The harness is not a benchmark mandate and not a tool requirement. It is a repeatable validation check that the pattern yields correct first outputs, avoids false positives, preserves neighboring-pattern writing boundaries, and keeps the first useful move visible.
This subsection governs steward-side validation, not the ordinary C.29 user application. A working user applies the output-choice discipline and chooses the cheapest honest output; they do not run the harness merely to decide between ordinary prose, MathLensUse.OneLine, MathLensUse.MiniCard, or NeighborGoverningPatternNote.
C.29 output-change conditions:
Smallest source-return and output-change conditions:
AI-assisted thin-echo result rule:
C.29 edge-case boundary results:
Harness shape:
Minimum harness cases:
Reader-fit checks for stable-pattern review or material refresh:
Archetypal grounding
Worked micro-cases by failure mode:
Vanchurin-style universe-as-learning is not an ordinary first grounding archetype. Keep it in the validation harness and SoTA use as a candidate stress test: it can teach overclaim control and adapt-not-adopt discipline, but it does not ground accepted physics, assurance, quantitative law, or routine lens use.
Bias annotation
Conformance checklist
C.29 checklist verifies the output-choice discipline without replacing the Solution. Candidate-lens guidance belongs in C.29:4.4.3 or worked grounding, not in this checklist; the checklist verifies only that the cheapest honest output and next lens-use move remain visible.
Common anti-patterns
SoTA-echoing account
SoTA source use for C.29 is accepted only when it changes action guidance. A citation that only decorates the file does not establish C.29 use.
C.29 separates source-use relations from source-use disposition. Adopt, Adapt, Reject, and candidate-stress-test disposition say what FPF does with the source; SourceUseRelation says what work the source may perform inside a C.29 application.
Sandberg Thread and Structural Sameness Examples
Adopt the Sandberg thread as a recognition cue, with two distinct source-use functions retained: the original X post is the source identity locator, while the Axis of Ordinary Math section is the checked text carrier used here.
The source examples are not a proof source and not an exhaustive taxonomy. They are a checked example carrier for InvariantsExposed: generalized Stokes and boundary-exterior derivative duality; de Rham, cohomology, and topological obstruction; CLT as RG or fixed-point viewpoint; Lawvere-style diagonal family; Noether and symmetry-conservation; and Legendre, potential-duality, and tropical-limit family.
Plain register: the thread illustrates mathematical compression that makes hidden structure visible. Tech register: every FPF use still needs CandidateMathObject, LensMappingMode, PreservedStructure, LostStructure, LensUseBoundaryValue, and StopCondition.
Do not adopt the thread as a proof source, peer-reviewed taxonomy, or authority for all mathematical details.
Vanchurin 2026 as candidate lens
Adopt and adapt the following as a candidate lens family:
learning dynamics → coarse-graining → effective geometry → gauge fields, metric-tensor fields, or distance-like structure → variational or thermodynamic optimality
Use this source as the case for why FPF needs a lens-use card: the source discusses many mathematical structures, but its claims are broad and speculative. The candidate-lens stress-test value comes through trainable variables, local update rules, Legendre transforms, thermodynamic potentials, gauge-field, metric-tensor-field, and distance-language claims, memory and processing trade-offs, and RG-like re-optimization of compressed representations.
The Plain lesson is “this is a useful candidate lens, not a new FPF cosmology.” Selected lens use:
Adoption stance: Adapt, not Adopt.
Adapt:
- learning dynamics as a general language of change,
- resource constraints as a possible source of effective laws,
- coarse-graining as a mechanism for simple macrodescriptions,
- thermodynamic or variational potentials as links between cost, memory, processing, and geometry,
- RG-like re-optimization as a scale-transition discipline.
Do not adopt as FPF norm:
- “the universe really is a neural network,”
- “physics has already been proven from learning,”
- “quantum, GR, or gauge theory reduce to a learning rule or learning dynamics” as established fact.
Known limitations from the checked source-use disposition remain material for mathematical-lens use: non-Abelian gauge fields are not treated as a landed FPF result; thermodynamic RG flow is not treated as a quantitative FPF law; quantitative predictions require explicit learning-algorithm specification.
Plural foundations source-use decision
Adopt the plural-foundations source-use decision: several structural families can be reusable across domains, and their adequacy depends on declared mapping, local use, mutual interpretability, and recoverable loss.
Source-use relation: Rodin supplies source material for the positive decision that several structurally useful families recur across domains. C.29 records this as local adequacy discipline: select the family that fits the declared use, state the mapping, and publish recoverable loss.
Rodin/P2W micro-slice:
Read the slice by relation position. [C.29](/generated/patterns/C.29) records preserved and lost structure for the mathematical-lens use. [A.6.0](/generated/patterns/A.6.0) declares vocabulary, laws, imports, and applicability when a U.Signature(profile=FormalSubstrate) declaration must be written. [E.18.1](/generated/patterns/E.18.1) governs P2W carry-through of the accepted problem-side distinction into the next declared FPF use. If the claim becomes measurement, evidence, causal use, Bridge semantics, mechanism realization, or work, apply [C.16](/generated/patterns/C.16), [A.10](/generated/patterns/A.10), [C.28](/generated/patterns/C.28), [F.9](/generated/patterns/F.9), [A.6.1](/generated/patterns/A.6.1), or [A.15](/generated/patterns/A.15) to that claim being made.
Applied category theory
Adopt applied category theory as one major organizer for cross-domain transfer, especially composition, interfaces, views, transformations, and bridges. Retain the concrete source examples: databases, electric circuits, and dynamical systems as application families; adjoint functors, enriched categories, and toposes as categorical structures that organize transfer.
In C.29, category-theoretic material is used through the same local adequacy fields as any other lens: stated use, named structure, preserved composition or interface, lost structure, failed transfer, and neighboring-pattern applications. It is especially useful when composition, interfaces, views, transformations, or bridges matter to the bounded move.
Obstructions to compositionality
Adapt the obstructions and failures-of-compositionality perspective into LostStructure and StopCondition: a lens can be useful precisely because it exposes where transfer fails, not only where it succeeds. In Plain language, a good lens does not only say “this travels”; it also names the boundary where transfer stops.
Source locators and source-use guard
SoTA materials are not nameless background. Decision grounds and governing inheritance remain recoverable by value, and SoTA rows shape action guidance rather than decorate the file. The source locators and the source-use relation of each external source are retained here.
Source locators and governing-use rows
Source-use boundary notes
VAN-GEOM-LEARNING-2025/2026is a replayable candidate-lens source for geometric learning dynamics. Its useful FPF contribution is the metric-tensor, noise-covariance, and learning-dynamics lens family and the stress it puts onCandidateMathObject,LensMappingMode, preserved and lost structure, validation boundary, and stop condition.- Vanchurin-style physical or biological interpretations remain source-side claims unless a local C.29 output and neighboring evidence, causal-use, validation, or assurance pattern bound the use. C.29 does not promote those interpretations to FPF law.
SAND-THREAD-MATH-LINKS-2026-05-12is a recognition cue, not a mathematical proof source or FPF law.- CLT-as-RG or fixed-point wording is retained only as a structural modeling viewpoint. A safe formulation is: under the usual normalization, the Gaussian is an attractive fixed point for finite-variance distributions; other stable laws are other fixed points under suitable normalization.
- The intake correction from direct identification to structure-preserving representation is selected and becomes a central ontology guard.
Informative taxonomy seed
Use this recognition menu only to identify a possible lens family and likely neighboring-pattern applications. After selecting a row, state the local C.29 fields that make the lens adequate or stop the use.
Relations
-
Builds on:
A.1.1,A.6.P,A.3.3,A.19,A.10,A.15,B.3,C.16.P,C.16,E.17.EFP,E.17.ID.CR,A.6.3.RT,A.6.3.CSC,F.9. -
Constrained by:
E.8,E.10,C.2.P,E.19. -
Design-rationale input:
E.9design-rationale discipline and the source-use rows inC.29:13a. -
Contributes to:
E.2pillar-impact analysis when a pillar argument relies on mathematical first-principles structure; only declared mathematical-lens use is in scope, with no amendment to pillar content, priority, or constitutional authority. -
Coordinates with:
A.6.0,A.6.1,E.18.1,C.11,A.15.1,A.15.4,C.18.1,C.19.1,C.26,C.27.TA,C.27,C.28,C.31.ASAP,G.5,G.9,G.2,G.10. -
Specialization relation:
C.26is selected as a C.29-compatible specialization for quantum-like modeling, with affordability qualifications. -
Neighboring claims stay with their governing patterns. Use
F.9for bridges;C.28for causal use;A.3.3for dynamics semantics;A.19andC.16for characteristic-space and measurement construction;A.10andB.3for evidence and assurance;C.11,A.15,A.15.1, andA.15.4for decision, method, and work records;E.17.*for explanation and comparative-review publication use;A.6.3.RTandA.6.3.CSCfor representation transition and coarsening;C.27.TA,C.27,C.18.1,C.19.1, andC.31.ASAPfor temporal-aspect, temporal-claim adequacy, scale-law, method scale-preference, and architecture scale-preference claims; and Part G for selector and benchmark work. C.29 records only the declared mathematical-lens use and the governing-pattern boundary for the claim being made.
C.29:End
Grounded Architecture and Selected-Structure Adequacy
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
Use this pattern when the current question is an ArchitectureOf@Context claim: which selected U.Structure refs matter for one described U.Holon in one U.BoundedContext, and what next architecture move follows.
The first useful move is small:
architectureConcernCue is recognition wording only until it helps choose one selected structure kind and one architecture move. When a controlled cue is useful, use changeLocalization, substitutionOrReplacement, flowBottleneck, controlOrRateMismatch, dataCustodyOrStateResidence, physicalSeparationOrPlacement, evidenceReuseOrAssuranceReuse, scaleWindowOrCoarseningLoss, runtimeFailureMode, crossScopeResidual, descriptionViewLoss, or otherDeclared. Local phrases such as change localization failure, hidden crossing, source return, generated-view loss, or state-residence uncertainty may remain in sourcePhrase? or Plain prose. If the described holon, bounded context, selected structure, and first move cannot yet be named, set questionDisposition to concernCueOnly or problemCardReady rather than promoting it to ArchitectureOf@Context by wording alone.
ArchitectureQuestionCard@Project is a project-side triage aid for choosing one architecture move. questionDisposition records the card's current result: keep it as a concern cue, prepare a ProblemCard@Context, open an ArchitectureOf@Context claim, or name the non-architecture governing pattern. The card is not an evidence record, gate, decision, release record, quality score, risk rating, or publication-authority claim. When those claims are being made, name the governing FPF pattern and keep C.30 to the architecture-claim portion; later sections cite this boundary rather than repeating the full non-use catalogue.
Use a conditional ArchitectureDescription@Context bridge only when durable architecture-description use is current: cross-team reuse, regulated or safety use, reusable design, comparison, source or lens reuse, or another named full-mode architecture-description use. Ordinary use stops at ArchitectureQuestionCard@Project when it makes one next architecture move clear. If the architecture description itself becomes the EntityOfConcern under repair, use [C.30.AD](/generated/patterns/C.30.AD).
What goes wrong if C.30 is missed: the practitioner reasons from a document, module diagram, workflow graph, mathematical lens, benchmark, maturity score, or decision record instead of recovering the described holon, selected structures, first architecture move, and neighboring claim kind.
What C.30 buys in practice: a practitioner can separate architecture claim, selected structure, architecture description, view, publication form, source relation, and non-architecture claim kind, then choose one small next architecture move.
Not this pattern when the EntityOfConcern under repair is not an architecture claim, selected architecture-relevant structure, source relation, description relation, view relation, publication-role recovery for an architecture claim, or the thin architecture-description bridge needed for one architecture move. Use the direct governing pattern named by the recovered relation, and keep C.30 only for the architecture-claim portion if that portion is being claimed. Common neighboring claim boundaries are summarized in [C.30:12](/generated/patterns/C.30#relations).
Thin precision-restoration pointer: if the issue under repair is still whether architecture, architecture description, structural view, module diagram, model, source material, functional architecture, or a source label such as layer, level, tier, stack, block, expert, cache, router, or gate names an architecture claim, description, view, publication form, source relation, structure, or non-architecture governing-pattern application, use [C.30.P](/generated/patterns/C.30.P) or [C.30.STRAT](/generated/patterns/C.30.STRAT) as triggered before applying C.30 to the recovered architecture portion. If the recovered issue is mathematical-lens use, apply [C.29](/generated/patterns/C.29); when no mathematical-lens move changes the architecture work, keep ordinary prose or use NoMathLensUseNeededNote under C.29 rather than creating a C.30-local lens result. Keep the trigger tables in those patterns; C.30 is applied only after ArchitectureOf@Context, selected architecture-relevant structure, conditional ArchitectureDescription@Context bridge use, [C.30.AD](/generated/patterns/C.30.AD) application, or the non-architecture application named by value is recoverable.
Problem
Engineering teams use "architecture" for several different things:
- the selected structure of a holon;
- a diagram, model, table, dashboard, generated relation graph, or document;
- a module layout;
- a selected transformation-flow structure, flow description, or mathematical graph description;
- a functional, control, information, deployment, logical, or physical structure view;
- an ADR-like publication;
- a project-side claim carried by another governing FPF pattern.
These uses are all useful in ordinary engineering speech, but they cannot carry the same FPF claim. The core distinction is the one already used across FPF: the architecture-relevant selected structure, the architecture claim over that structure, the Description episteme or view of that claim, the publication of that description or view, and the project decision about changing architecture are different records.
The first-minute practitioner can ask: Are we choosing an architecture, or just naming a module layout? Which structure is being described: function, flow, control, module structure, interface relation, work, role relation, enactor structure, evidence relation, assurance relation, information structure, data structure, placement structure, deployment structure, scale structure, or declared logical structure? What is the inspected material being used as: architecture claim, description, view, publication form, decision, source relation, or mathematical lens?
How can FPF describe architecture without:
- creating
U.Architectureas a new root kind; - treating a description, view, diagram, graph, ADR, dashboard, or generated relation graph as the architecture;
- reducing architecture to module structure or interface relation;
- letting E.18 transformation-flow structures, LCA structures, control structures, C.29 lenses, quality language, evidence, assurance, gates, work, or decisions silently become architecture ontology;
- making architecture descriptions so heavy that ordinary practitioners cannot get a first useful move.
Forces
Solution
C.30 starts from one architecture move over one described U.Holon in one U.BoundedContext: recover the ArchitectureOf@Context claim record when it is being claimed, selected U.Structure references, structure kind refs, the source, description, view, or publication role of the inspected material, and first admissible architecture move. Use a conditional architecture-description bridge when durable, reusable, multi-view, regulated, comparison, or reliance-bearing description is being made. If ArchitectureQuestionCard@Project gives one usable next move, stop there.
In C.30, the EntityOfConcern for this use is the architecture claim, one of its selected structures, or the relation record or claim record named by value for the architecture use being made. The description is not the architecture itself, and description hygiene is not the center of C.30.
Architecture-description material in C.30 is deliberately minimal. C.30 itself is not the full architecture-description mechanism. It binds ArchitectureDescription@Context to ArchitectureOf@Context, selected structures, structural views, correspondence, source return, and admissible use only when durable description use is being made. C.30.AD carries the full architecture-description EntityOfConcern: multi-view description sets, viewpoint-based views, correspondences, source return, freshness, specification use, and publication boundary over ArchitectureOf@Context. Generic Description, view, viewpoint, publication-face, and publication-form machinery still remains in A.7, E.17.0, E.17.1, E.17.2, and E.17. C.30.ASV carries the selected-structure-kind-to-view relation; C.30.TFS-REL, C.30.LCA, and other named subpatterns carry named structure relations.
C.30 does not mint U.Architecture and does not redefine U.Viewpoint. It specializes A.22 structure records and U.MultiViewDescribing only for architecture descriptions whose DescriptionContext EntityOfConcernRef is the ArchitectureOf@Context claim record for a holon, while preserving the EntityOfConcern and Description-episteme and specification-use distinction between architecture and its descriptions. Use A.1 for U.Holon, A.22 for selected U.Structure, and E.24.PUB when the problem is a confusion among ontic, ontic-description episteme, and publication form.
C.30 governs grounded architecture adequacy for one ArchitectureOf@Context claim record over selected U.Structure references for one described holon in one bounded context. It governs ArchitectureOf@Context, ArchitectureQuestionCard@Project, selected architecture-relevant structures, architecture structure-kind recovery, source, description, view, or publication-role recovery, first architecture-question assignment, characteristic assignment, small boundary notes, and the thin ArchitectureDescription@Context bridge when durable description use is being made. It does not mint U.Architecture and does not govern all architecture structure-kind views; C.30.ASV governs architecture structural views, and C.30.AD governs the full architecture-description mechanism. Generic guards about publication, permission, promise, evidence sufficiency, gate passage, work authority, decision authority, or release authority stay in the publication-use boundary or in governing patterns.
Architecture claim record
ArchitectureOf@Context is a project-side architecture claim record over selected structures. It is not the selected structure itself, not a Description episteme, not a view, not a diagram, not a publication face, not a decision, and not a new root U.* kind.
ArchitectureOf@ContextRef is admissible as a DescriptionContext.EntityOfConcernRef for architecture Description epistemes and views. The holon whose architecture is claimed remains ArchitectureOf@Context.describedHolonRef; it is not the DescriptionContext EntityOfConcernRef for those architecture descriptions unless a separate direct holon description is opened.
EntityOfConcern bridge. In C.30, the primary EntityOfConcern is the ArchitectureOf@Context claim record, one of its selected structures, or a related relation record or claim record selected by the use under repair. Selected architecture structure is dependent, non-agentive, and claim-bearing through episteme or view records, but it is not a second EntityOfConcern family beside EntityOfConcern. Publication faces, forms, units, and renderings publish descriptions or views; they do not become the architecture claim or the selected structure.
Conditional architecture-description bridge
C.30 does not define a second local ArchitectureDescription@Context record shape. The canonical ArchitectureDescription@Context record is governed by C.30.AD:4.1. C.30 admits only a thin bridge to that record when durable architecture-description use changes the first architecture move.
The minimum bridge recoverable in C.30 is:
This bridge does not mint another ArchitectureDescription@Context definition, does not add local fields to the canonical record, and does not collect non-architecture claim kinds as architecture-description ontology. It lets the C.30 reader say why a description matters for the next architecture move, then applies [C.30.AD](/generated/patterns/C.30.AD) whenever the architecture description itself becomes the EntityOfConcern under repair or the full mechanism is needed: multi-view composition, correspondence, source return, freshness, specification-use boundary, publication-use boundary, or reusable architecture-description use.
An architecture-description freshness cue is also canonical in C.30.AD:4.4. C.30 may point to that cue only to bound the admissible use of the first architecture move; the cue is not evidence sufficiency and not assurance.
Publication-use boundary
This subsection is the C.30 publication-use boundary. It says what an architecture description or its publication does not carry by itself, while the subject Solution stays about architecture claim, described holon, selected structures, structural views, and the next architecture move. If a guard concerns permission, promise, prescription, evidence sufficiency, assurance, decision, gate passage, work authority, release, or authority-source claim, keep it here, in C.30.AD, or in the description or publication pattern governing that claim rather than expanding C.30's thin bridge.
ArchitectureDescriptionPublication@Project is subordinate to E.17 and MVPK machinery. It publishes one source episteme or episteme-lane view reference. publicationViewpointRef? names the publication-side viewpoint only when MVPK needs one; it is not an architecture viewpoint and not a TEVB viewpoint. mvpkFaceRef is a publication-lane face reference, not an alternative source episteme, source view, or source relation. Publication does not add neighboring claim authority; apply C.30:4.3 and the governing pattern when evidence, gate, work, assurance, decision, or release claims are current.
Model cards, system cards, and evaluation harness reports enter C.30 through the same publication boundary or source-relation boundary. They may describe a model, deployed AI system, architecture claim, evaluation harness, or policy, but the architecture move still needs ArchitectureOf@Context, selected structures, and any neighboring proof, release, or gate claim assigned to its governing pattern.
If the card or harness is used beyond transparency, recover the architecture structure kind being used first and then apply [A.10](/generated/patterns/A.10), [G.6](/generated/patterns/G.6), [B.3](/generated/patterns/B.3), [A.20](/generated/patterns/A.20), [A.21](/generated/patterns/A.21), [C.16](/generated/patterns/C.16), [C.28](/generated/patterns/C.28), or [C.11](/generated/patterns/C.11) for the non-architecture claim kind.
Architecture name formation
The word architecture is shorthand only after the described holon, bounded context, selected structures, structure kind, and source, description, view, or publication role are recoverable. Without those qualifiers, it is a recovery trigger, not a stable FPF term.
Architecture characteristic assignment
C.30 uses three bearers before any quality, fitness, measure, metric, score, modularity, or ility wording carries an architecture-adequacy claim. Those words are triggers for bearer recovery, not stable architecture adequacy by themselves.
C.30 keeps only a thin bridge from structural characteristics to Q-Bundle relevance. If the claim says architecture causes an outcome improvement, assign the causal-use claim to [C.28](/generated/patterns/C.28) before causal use. If a structural characteristic is used as a mechanism, constraint, predictor, proxy, evidence relation, or causal hypothesis for a Q-Bundle slot, start with ArchitectureStructuralCharacteristicQBundleRelationLine rather than a formula such as low coupling = maintainability; assign measurement, modularity scoring, reusable-structure accounting, bespoke-residue accounting, evidence, assurance, gate, causal, and scale-audit claims to their governing patterns.
ArchitectureStructuralCharacteristicQBundleRelationLine is the only ordinary first-contact relation shape C.30 introduces for this case. Do not add a second generic characteristic relation record in C.30. Use the line when the useful move is to show why one structural characteristic may matter without opening the full relation record. Do not use this line as a measurement record, modularity score, evidence sufficiency statement, assurance verdict, or causal proof:
Minimal structural-characteristic relation-line examples:
ArchitectureCharacteristicQBundleRelationRecord is a triggered full-mode record, not the ordinary first-contact shape. Use the full record only when publication, comparison, causal use, evidence reliance, assurance, gate, decision, or reusable cross-case relation reliance is being claimed and the thin line cannot keep the relation inspectable, reusable, or bounded. This preserves the protection against causal or quality overread without turning C.30 into a measurement-first pattern.
Relation kinds in this record are C.30-local relation tokens. They must remain recoverable as A.6.P-style relation specifications: polarity, participant slots, qualifiers, witness expectations, admissible semantic change classes, and bridge or loss boundary where those boundary conditions are being claimed. ISO/IEC 25010-like quality models may be used as quality vocabulary or comparison lineage for product qualities such as reliability, security, maintainability, usability, efficiency, compatibility, or portability. C.30 does not inherit them as architecture theory. Architecture relates to qualities through Q-Bundle slots, mechanism slots, relation class or admissible-use value, evidence or causal governing patterns, or report-only use.
Relation to structural views
C.30.ASV governs ArchitectureStructuralView@Context. C.30 governs the ArchitectureOf@Context claim and, only when durable description use is being made, how its thin ArchitectureDescription@Context bridge uses structural views, with hidden or lost structure, correspondence, source or reliance relation, and source-return boundaries recoverable when those boundaries affect action. C.30.AD governs the full architecture-description mechanism.
A diagram, model, table, selected transformation-flow diagram, mathematical graph description, LCA diagram, C.29 lens output, ADR, dashboard, generated explanation, or other publication face may carry an architecture description or an architecture structural view. It does not become the architecture, and it does not become a conforming view only because it looks like a view.
Use AffectedArchitectureStructureNote when the next architecture move needs to name affected structures or view losses without using an architecture decision, ADR, gate, evidence, assurance, or release record:
This note only names affected architecture structure for the next move. Decision, ADR, gate-passage, evidence-sufficiency, and release-authority claims apply the patterns governing those claims.
Minimal boundary notes
Use these notes when a common architecture phrase is close to a governing pattern but the full governing-pattern application is not yet needed for an asserted claim.
Use the thinnest relation form that preserves the next architecture move. Use fuller relation governing the asserted use records only when the relation being used cannot be inspected, used, compared, refreshed, or bounded without it. Typical thin forms are ArchitectureMathLensUseBoundary before C.29 Mini or Full, AffectedArchitectureStructureNote before an architecture decision record, and ArchitectureStructuralCharacteristicQBundleRelationLine before full measurement records, causal records, or evidence records.
These notes are not substitutes for the module named by value-and-interface repair pattern, interface specifications, signature records, conformance evidence, or module-and-interface repair. An open or platform label is not substitutability proof, security proof, scale proof, assurance, or universal maturity evidence. A source label such as layer, stack, block, expert, cache, router, or gate enters this note only after [C.30.STRAT](/generated/patterns/C.30.STRAT) recovers a module-interface or adjacent architecture-relevant item. It becomes architecture-relevant only through local structure, interface, variation, substitution, migration, update, and hardening boundaries. Relation-heavy wording inside these notes remains a Plain cue until an module relation reference named by value, interface relation ref, relation governing the asserted use record, or governing FPF pattern application is named. The note keeps first use honest until the non-architecture claim kind named by value is being made.
Architecture mathematical-lens boundary
Architecture descriptions may use C.29 lenses, but the lens does not become architecture ontology.
Use the one-line boundary only when it is enough to keep the lens from being overread. Use a C.29 Mini or Full card when the lens choice, preserved structure, lost structure, relation class or admissible-use value, or stop condition changes the architecture move.
Lens use by architecture problem:
This table is not a C.29 replacement and does not make mathematics mandatory. It helps the practitioner see when a lens may add a useful architecture move; C.29 still carries lens-use result, preserved structure, lost structure, relation class or admissible-use value, and stop condition when those description or view uses are being made.
Epiplexity-like use remains a C.29 bounded-observer structural-information lens. It may help recover learnable structure from traces, but it is not an architecture quality, task relevance proof, causal proof, assurance, or selector authority.
Boundary and repair table
Worked slices
"We have the architecture in this diagram." The diagram is a publication face unless it explicitly publishes an ArchitectureDescription@Context or ArchitectureStructuralView@Context.
"Low coupling gives maintainability." C.30 does not allow that formula to carry the claim by itself. The ordinary repair starts with the thin relation line:
Use ArchitectureCharacteristicQBundleRelationRecord only when publication, comparison, causal use, evidence reliance, assurance, gate, decision, or reusable cross-case relation reliance needs the fuller record. The useful move is to decide whether a structural characteristic has a bounded relation to a maintainability slot, not to accept the slogan as architecture truth.
"The backup-pump architecture is safe because the loop is redundant." C.30 starts with the plant holon, bounded operating context, and selected structures: control loop, material-flow structure, placement structure, module-interface relation, and maintenance-work relation. The redundancy phrase may motivate an architecture move, but safety proof, causal proof, evidence sufficiency, gate passage, and work authorization move to their governing patterns. The C.30 output is the selected structure and next architecture move, not a safety case by slogan.
"We replaced the neural-network block, so the architecture improved." Treat block first as a source label and apply [C.30.STRAT](/generated/patterns/C.30.STRAT) unless the changed value is already recovered. The phrase is admissible architecture recognition only after the changed structure kind, transformation-flow relation, module or interface claim kind, preserved and lost structure, changed characteristic, source relation, and decision or evidence governing patterns are named. A block label, benchmark result, ablation, pruning mask, or distillation result is not an architecture decision, evidence sufficiency, gate passage, assurance, or architecture adequacy by itself.
Archetypal Grounding
Bias-Annotation
Lenses tested: Arch, Onto, Epist, Prag, Did, Gov. Scope: FPF architecture-description use over holons.
This checklist verifies the preceding guidance after the practitioner has chosen the selected move; it is not a required project control form and not a substitute for the card, note, view, relation, or repair move above.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
Architecture is most useful in FPF when it stays close to selected structure over a holon and far away from document-as-architecture, graph-as-architecture, model-as-architecture, and decision-as-architecture collapses. The ArchitectureOf@Context record gives the selected structure a project-side claim handle without minting U.Architecture.
C.30 and C.30.ASV establish an FPF architecture kernel: architecture as selected EntityOfConcern structure for a described holon, with Description epistemes and structural views, structure-kind discipline, correspondence and source-return boundaries, and characteristic-relation applications. They do not by themselves provide full measurement, synthesis, decision, causal proof, safety proof, or assurance.
The small first card is deliberate. Architecture discussions often need one immediate move: name the holon, choose the structure kind under consideration, recover a source, description, view, or publication role, assign an evidence or assurance claim to its governing pattern, or stop. A full architecture description is useful only when durable publication, cross-team use, comparison, regulated use, source reuse, or reliance-relation reuse is being made.
The DescriptionContext structure also preserves plurality. The same architecture claim may have several descriptions and views; several publications may render one description; several source records may be source relations for a view with different validation boundaries. C.30 keeps those variants usable without turning any one publication form into the architecture.
SoTA-Echoing
Relations
Builds on: A.1, A.22, E.24.PUB, C.30.P, C.2.1, A.6.3, A.7, E.10.D2, E.17.0, E.17.1, E.17, E.17.2, A.6.P, F.18, E.10, and C.2.P.
Coordinates with: C.30.STRAT, C.30.ASV, A.6.F, C.30.TFS-REL, C.30.LCA, C.30.ILC, E.18, C.29, C.16, C.25, C.28, A.10, G.6, B.3, A.20, A.21, A.15, C.11, E.17, and named governing patterns for architecture decision and candidate-set claims when those claim kinds are being made.
Neighboring claims stay with their governing patterns: A.1 for the described holon, A.22 for selected-structure EntityOfConcern, E.24.PUB for ontic-description and publication-form boundary, C.30.STRAT for stratification-wording and source-label repair, C.30.ASV for structural-view adequacy, E.18 for selected transformation-flow structure, path, and crossing discipline, E.18.2 and C.29 for mathematical graph descriptions and mathematical-lens use, C.16 for characterization, C.25 for Q-Bundles, C.28 for causal use, A.10 and G.6 for evidence, B.3 for assurance, A.20 and A.21 for gate or release records, A.15 for work, C.11 for decisions, and E.17 for publication. C.30 governs the grounded architecture claim, selected structures, and the next admissible architecture move.
C.30:End
Architecture Description Adequacy
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative
Plain-name. Architecture-description adequacy.
Intent. Keep an architecture description useful without letting the description, view, diagram, publication, or tool publication face become the architecture itself.
Builds on. C.30, C.30.ASV, A.1, A.22, E.24.PUB, A.7, A.6.3, E.17.0, E.17.1, E.17.2, E.17, C.2.P, E.10, and E.10.ARCH.
Coordinates with. C.30.P, C.30.TFS-REL, C.30.LCA, C.30.ILC, A.6.F, A.6.M, C.29, C.16, C.16.P, A.10, B.3, A.20, A.21, A.15, C.11, C.28, E.8, E.24.CD, and F.18.
Use this when
Use this pattern when an architecture description is the EntityOfConcern under repair: a durable description, multi-view description set, architecture documentation set, model set, generated architecture relation graph, view set, or specification-use record over one ArchitectureOf@Context.
Use C.30.AD when the practitioner needs to know:
- which
ArchitectureOf@Contextclaim the description is about; - which selected structures or architecture structure kinds are described;
- which views are used under which viewpoints;
- which correspondences, source returns, freshness boundaries, or specification-use boundaries make the description usable;
- what the description can guide and which uses are non-admissible.
What goes wrong if missed. A diagram, documentation set, generated relation graph, model card, ADR publication set, or architecture model starts acting as architecture, proof, gate, assurance, decision, work authority, or release permission by presentation alone.
What this buys. The practitioner can keep one architecture description inspectable across views, viewpoints, selected structures, correspondences, publications, source returns, and neighboring-pattern applications.
First useful move. Write one ArchitectureDescriptionUseCard@Project:
The use card is a controlled first-pass slice. It can close ordinary use only when it names one architecture claim, one usable description purpose, the selected structures or structure kinds being described, viewpoint refs being used, admissible use, non-admissible use, and one remaining architecture move or neighboring-pattern application. Expand to the fuller ArchitectureDescription@Context record when cross-view correspondence, reuse, source return, freshness, specification use, regulated use, comparison, or project-side authority use is being made.
Not this pattern when.
- If the use under repair is a grounded architecture claim or one first architecture question, use
[C.30](/generated/patterns/C.30). - If the use under repair is a selected structure or structural description outside architecture, use
[A.22](/generated/patterns/A.22). - If the use under repair is one architecture structural view, use
[C.30.ASV](/generated/patterns/C.30.ASV). - If architecture or structure wording is still ambiguous, use
[C.30.P](/generated/patterns/C.30.P). - If the use under repair is only a publication face, publication form, report, dashboard, file, or source-current relation, use
[C.2.P](/generated/patterns/C.2.P),[E.17](/generated/patterns/E.17), or the publication or source pattern governing the claim. - If the description is being used as evidence, assurance, gate passage, decision, work authority, causal-use claim, release permission, or mathematical-lens use, keep
[C.30.AD](/generated/patterns/C.30.AD)only for the description boundary and apply the neighboring pattern governing that claim to the claim being made.
Problem frame
Architecture practice needs durable descriptions: multi-view documents, view models, generated relation graphs, architecture transformation-flow views, LCA control sketches, module or interface diagrams, deployment views, model cards, system cards, and architecture decision description sets. These descriptions are useful because they let teams compare, reuse, refresh, inspect, and use architecture claims across viewpoint families and working concerns; A.15 role-enactor semantics apply only when a project role relation itself is being governed.
The difficulty is that the description is not the architecture. The same architecture can have several descriptions. The same description set can contain several views. Each view is written from one viewpoint or concern-framed practice and can hide, lose, coarsen, or emphasize different structure. A view can describe functional structure, flow or transformation-flow structure, control structure, module or interface structure, placement structure, information custody, evidence-reuse relation, assurance relation, scale or coarsening relation, or another declared architecture-relevant structure.
The first-minute practitioner can ask:
- What
ArchitectureOf@Contextis this description about? - Which selected structures or structure kinds does this view describe?
- Which viewpoint makes this view useful?
- What correspondence connects this view to the architecture claim and other views?
- When does source return to a source episteme, source view, or neighboring pattern governing that claim become necessary?
- What admissible architecture move remains after the description has been used?
Problem
How can FPF govern architecture descriptions without:
- treating a description, model, view, diagram, graph, card, table, dashboard, file, publication, publication form, or rendering as the architecture itself;
- treating all architecture documentation as one generic description with no selected-structure recovery;
- losing the link between a viewpoint and the architecture structure kind being described;
- letting one attractive view hide lost structure, stale source, or missing correspondence;
- letting publication quality become evidence sufficiency, assurance, gate passage, decision authority, work completion, or release permission;
- making ordinary architecture triage too heavy for a first useful architecture move.
Forces
Solution
Use ArchitectureDescription@Context when the EntityOfConcern under repair is the description episteme or specification-use record over one ArchitectureOf@Context. The described holon is recovered through ArchitectureOf@Context.describedHolonRef; the DescriptionContext.EntityOfConcernRef for the architecture description points to the architecture claim record.
C.30.AD does not mint U.Architecture, does not redefine U.Viewpoint, and does not replace generic Description, view, publication, or publication-form machinery. It specializes those records for architecture descriptions whose views remain tied to selected architecture-relevant structures.
Architecture-description record
describedHolonRef is a recoverable field copied from the referenced ArchitectureOf@Context; it is not the architecture description's DescriptionContext.EntityOfConcernRef.
Minimum conformance for the record:
architectureClaimRefnames oneArchitectureOf@Context;selectedStructureRefsorstructureKindRefsname the architecture-relevant structures being described;- every architecture structural view names its viewpoint and selected structure or structure kind;
correspondenceRefsor a source-return condition is present when cross-view or source reuse is being made;admissibleUseandnonAdmissibleUsesay what the description can and cannot carry.
Traceable architecture multi-view description chain
A full architecture description is traceable only when the reader can recover the chain that makes a view useful without turning the view into the architecture. The chain is a trace requirement, not a prescribed method or work plan:
[E.17.0](/generated/patterns/E.17.0) carries the generic multi-view Description machinery. [C.30.ASV](/generated/patterns/C.30.ASV) carries the selected-structure-kind-to-view relation and view adequacy. [C.30.AD](/generated/patterns/C.30.AD) carries the architecture-specific composition and use boundary: which architecture claim the description is about, which structural views it uses, what correspondence or source return keeps the use honest, and which architecture move or neighboring pattern remains admissible.
If any link in the chain is absent, do not fill it with a documentation label. Either add the missing reference, reduce the admissible use, or apply the governing pattern that can recover the missing relation.
View membership, viewpoint, and structure-kind binding
Architecture descriptions can contain several ArchitectureStructuralView@Context records. Each such view remains governed by C.30.ASV; C.30.AD does not mint a second structural-view record and does not decide whether the view has the right structure kind, viewpoint, hidden or lost structure note, correspondence, or source return.
C.30.AD records only membership or use of an already recoverable architecture structural view inside one architecture description:
Use [C.30.ASV](/generated/patterns/C.30.ASV) when the question under repair is whether the view has the right structure kind, viewpoint, hidden or lost structure note, correspondence, or source return. Use [A.22](/generated/patterns/A.22) when the question under repair is structure as such. Use [C.30](/generated/patterns/C.30) when the question under repair is the grounded architecture claim. Use [C.30.AD](/generated/patterns/C.30.AD) only for the description's membership, composition, correspondence, source-return, freshness, specification-use, publication-use, or remaining-move boundary.
Common architecture-description views:
Correspondence and source return
Architecture descriptions become risky when a reader cannot tell whether two views describe the same architecture claim, the same selected structure, related structures, or different entities of concern. Use correspondence records or source-return conditions when the description is reused across viewpoints, source editions, tool outputs, generated views, or regulated use.
Correspondence is not proof, assurance, or gate passage. It is a relation that lets a reader use more than one architecture view without silently changing the EntityOfConcern.
Freshness and currentness boundary
Use a freshness cue only when the architecture description's admissible use depends on source edition, structure edition, model version, deployment context, or external condition.
Freshness does not make the description evidence-sufficient. It only bounds the use of the description.
Specification-use and publication boundary
An architecture description can be used as a specification only when that use is declared. Specification use is not a new architecture kind; it is a use boundary over a Description episteme or its publication.
If the specification use becomes evidence, assurance, gate, work, decision, causal-use, or release authority, apply the neighboring pattern governing that claim to that authority claim. The architecture description remains the description boundary, not the authority.
Publication forms, diagrams, model faces, files, cards, dashboards, and generated relation graphs remain publications, views, faces, source-current records, or renderings unless the source episteme and use boundary are explicit.
Neighboring-pattern applications
| Generic description, view, viewpoint, publication, publication form, MVPK face | A.7, E.17.0, E.17.1, E.17.2, E.17, or C.2.P |
| Function or functionality wording | A.6.F |
| Module, interface, port, signature, or reusable structure relation | A.6.M, a signature or interface pattern named by value, C.31, or C.31.RSA |
| Mathematical lens or preserved and lost mathematical structure | C.29 |
| Characteristic, scale, coordinate, score, or quality claim | C.16.P, C.16, A.19, C.25, or quality pattern governing the claim |
| Evidence, assurance, gate, work, decision, causal-use, release | A.10, B.3, A.20, A.21, A.15, C.11, C.28, release or admissibility pattern, or governing pattern |
Worked cases
Conformance checklist
Common anti-patterns
SoTA-Echoing
Related patterns
C.30governs grounded architecture and selected-structure adequacy.C.30.Prepairs overloaded architecture or structure wording before this pattern is used.C.30.ASVgoverns architecture structural views and structure-kind and viewpoint separation.C.30.TFS-REL,C.30.LCA, andC.30.ILCgovern architecture structure-relation subcases named by value.A.7,E.17.0,E.17.1,E.17.2, andE.17govern generic EntityOfConcern, Description, view, viewpoint, publication, and MVPK machinery.C.2.Prepairs source-current and publication-form relation-set overreads.
C.30.AD:End
Architecture and Structure Precision Restoration
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative
Plain-name. Architecture-structure wording repair.
Intent.
Recover architecture or structure wording whose selected structure, architecture relation, architecture-description use, structural-view use, source-return relation, or named C.30 subcase is hidden before a reader applies A.22, C.30, C.30.ASV, or a named C.30.* pattern.
This pattern does not mint U.Architecture, does not fuse architecture and structure into one kind, and does not replace grounded architecture adequacy or structural-view adequacy. It repairs overloaded wording so the architecture, structure, description, view, publication, source, relation, characteristic, mathematical-lens, evidence, assurance, gate, work, decision, causal-use, release, or ordinary-prose use becomes recoverable by value.
Builds on. E.10, E.10.ARCH, A.22, C.30, C.30.ASV, C.2.P, A.6.P, A.6.F, C.29, C.16.P, C.16, C.25, E.17, and E.8.
Coordinates with. C.30.TFS-REL, C.30.LCA, C.30.ILC, named C.30.* structure and view patterns, A.10, B.3, A.20, A.21, C.11, C.28, A.15, E.11, and work, release, and publication patterns governing those claims.
E.10.ARCH governing relation. When E.10 encounters architecture or structure wording whose selected structure, architecture relation, architecture-description use, structural-view use, source-return relation, source label, or neighboring claim is hidden, E.10.ARCH selects C.30.P only until the use under repair and governing pattern are recovered. C.30.P then stops applying; it does not become a registry of architecture topics or a substitute for A.22, C.30, C.30.AD, or named C.30.* patterns.
Use this when
Use this pattern when architecture or structure wording hides which use is being made and recoverable by value.
Typical triggers:
architecture,architecture description,architecture model,architecture diagram,architecture map,architecture dashboard,architecture score;structure,structural view,structural model,module layout,component structure,interface structure, or stratification wording or source-label wording such aslayer,level,tier,stack,ladder,rung,block,expert,cache,router, orgatethat must go toC.30.STRATbefore local architecture or structure assignment;graph,flow,transformation-flow graph expression,control sketch,LCA diagram,ADR,dashboard,benchmark,source, orviewbeing treated as architecture or structure by wording alone;- a function, module, interface, signature, flow, control, quality, score, evidence, assurance, gate, work, decision, causal-use, or release claim being smuggled under architecture or structure wording.
What goes wrong if missed. A diagram becomes the architecture, a graph becomes proof, a view becomes the selected structure, a source document becomes an architecture decision, a score becomes architecture adequacy, or a function, module, or interface claim becomes architecture by default.
What this buys. The reader can recover the architecture or structure use under repair, block the overread, and move to the governing pattern: selected structure under A.22, grounded architecture claim or conditional architecture description under C.30, architecture structural view under C.30.ASV, stratification-wording repair and source-label repair under C.30.STRAT, architecture transformation-flow relation under C.30.TFS-REL, control-structure view under C.30.LCA, mathematical lens under C.29, characteristic and scale repair under C.16.P, or a project-side evidence, assurance, gate, work, decision, causal-use, release, or publication pattern.
First useful move. Ask which selected structure, architecture relation, architecture-description use, structural-view use, source-return relation, or neighboring claim the architecture or structure wording is actually naming, then either apply the architecture or structure pattern named by value directly or use one architecture-structure repair note to assign the claim elsewhere.
Not this pattern when.
- If the use under repair is already a selected structure, use
A.22directly. - If the use under repair is already
ArchitectureOf@Context, useC.30directly. If the use under repair is the fullArchitectureDescription@Contextmechanism, useC.30.AD; useC.30only for the thin architecture-description bridge tied to one architecture move. - If the use under repair is already an architecture structural view, use
C.30.ASVor a namedC.30.*view pattern directly. - If the claim being made is evidence, assurance, gate, work, decision, causal-use, release, mathematical-lens use, characteristic and scale construction, quality characterization, source-use, or relation construction, use the governing pattern for that claim after any architecture or structure wording is demoted or assigned.
Problem frame
Working engineers often say "architecture" or "structure" while pointing at a useful artifact: a diagram, model, graph, table, dashboard, ADR, code-agent relation graph, neural-network architecture-operation diagram, benchmark result, or source document. Ordinary speech is acceptable; FPF-governed prose is not. If the artifact is named by a source label such as block, layer, expert, cache, router, or gate, use C.30.STRAT before assigning the recovered use locally.
The repair question is:
Which selected structure, architecture relation, architecture-description use, structural-view use, source-return relation, or neighboring claim does the wording name, and which FPF pattern governs that claim?
The architecture or structure use under repair may be:
- selected structure under
A.22; - an
ArchitectureOf@Contextclaim underC.30, a thin architecture-description bridge underC.30, or the full architecture-description mechanism underC.30.AD; - an
ArchitectureStructuralView@Contextor namedC.30.*subcase; - a publication, view, face,
PublicationUnit, carrier, dashboard, ADR, source document, or source-return relation underC.2.PorE.17; - a relation construction under
A.6.P; - a function or functionality-kind use under
A.6.F; - a mathematical-lens use claim under
C.29; - a characteristic, scale, score, coordinate, threshold, or quality-coordinate claim under
C.16.PorC.16; - a Q-bundle or quality-characterization claim under
C.16.Q,C.25, orE.21; - an evidence, assurance, gate, work, decision, causal-use, release, or method claim under its governing pattern;
- ordinary prose with no FPF-governed use being made.
Problem
How can FPF repair architecture or structure wording without:
-
creating
U.Architecture; -
treating architecture and structure as one fused kind;
-
treating a description, view, diagram, graph, dashboard, source, ADR, model, or publication as the architecture itself;
-
assigning all function, flow, module-interface, signature, control, evidence, assurance, gate, decision, work, quality, mathematical-lens, or source claims to architecture;
-
duplicating first-stage repair lists inside
A.22,C.30,C.30.ASV, and every namedC.30.*subpattern?
Forces
Solution
Repair architecture or structure wording by producing an architecture-structure repair note or an equivalent local rewrite.
Minimum fields:
Use the note only when the repair must remain inspectable. A direct local rewrite is enough when one sentence clearly names the selected-structure claim being made, architecture relation, architecture-description use, structural-view use, source-return relation, or governing pattern.
Recovery sequence
- Capture the trigger. Copy the architecture or structure wording and the sentence that uses it.
- Recover the encountered FPF kind or reference. Decide whether the text points to a selected structure, architecture claim, description, view, diagram, graph, model, dashboard, ADR, source document, carrier, publication, stratification-wording case or source-label case for
C.30.STRAT, function, module-interface relation, signature, flow, control, score, quality term, evidence, gate, work, decision, release, or ordinary prose. - Recover source-publication relations before architecture assignment. If the wording relies on a source, publication, view, face,
PublicationUnit, dashboard, ADR, file, carrier, or source-return relation, applyC.2.Pfor source-use, source-currentness, and publication relations before assigning the architecture or structure claim. - Choose the governing pattern for the architecture or structure use.
- selected structure ->
A.22; ArchitectureOf@Context, selected architecture-relevant structure, or thin conditionalArchitectureDescription@Contextbridge use ->C.30;- full
ArchitectureDescription@Contextmechanism ->C.30.AD; - architecture structural view ->
C.30.ASV; - architecture transformation-flow relation ->
C.30.TFS-REL; - control-structure view ->
C.30.LCA; - cross-scope conflict or frustration triage ->
C.30.ILC; - stratification wording or source-label wording such as
layer,level,tier,stack,ladder,rung,block,expert,cache,router, orgate->C.30.STRATbefore choosing the final governing pattern; - named C.30 subcase -> that subpattern.
- selected structure ->
- Assign non-architecture claims to their governing patterns. If the sentence uses architecture wording to carry relation, function or functionality, mathematical-lens, characteristic and scale, quality, evidence, assurance, gate, work, decision, causal-use, release, or method claim, apply the governing pattern for that claim and keep this pattern only for the architecture or structure wording repair.
- State admissible and non-admissible use. Say what the reader may do with the repaired wording and what non-admissible adjacent interpretation is blocked.
- Stop C.30.P after assignment. Stop after the governing pattern or ordinary-prose demotion is named.
Direct governing-pattern assignments
Refresh and reopen conditions
Reopen or narrow C.30.P when the FPF pattern-language ecology changes the first architecture or structure entry:
- a named
C.30.*, structural-view, architecture transformation-flow, LCA or control, module-interface, mathematical-lens, characteristic, evidence, assurance, gate, work, decision, causal-use, release, or publication pattern now governs one row directly; - source-current architecture-description, view, model, decision-record, or architecture-documentation practice changes one adopted distinction in
C.30.P:7; - README, ToC,
E.11, retrieval, or local Problem-frame entry cues change the first practical entry for hidden architecture or structure wording; - a governing pattern starts copying first-stage architecture or structure trigger lists that belong here;
C.30.Pbegins to act as a registry of architecture topics rather than a wording-use repair pattern for hidden selected structure, architecture relation, architecture-description use, structural-view use, source-return relation, or named C.30 subcase.
The refresh action is to remove, narrow, or reassign the first-stage row. It is not to preserve old assignment wording as history.
Worked cases
Reduced SoTA row
Current architecture-description, model, view, and decision-record practice treats architecture as distinct from architecture descriptions, models, views, viewpoints, diagrams, and decision records. FPF adopts that line only where it changes action guidance: examples, non-use boundaries, governing-pattern assignments, source-return conditions, and conformance checks.
This row belongs in this pattern because it blocks diagram-as-architecture, graph-as-proof, view-as-structure-kind, publication-as-claim, and ADR-as-decision overreads. It does not import any external standard as FPF ontology.
Conformance checklist
Common anti-patterns
Related patterns
E.10catches architecture or structure wording and selects this pattern only when the selected structure, architecture relation, architecture-description use, structural-view use, source-return relation, or named C.30 subcase is hidden.E.10.ARCHdefines the shared wording-use recovery order and applicability row.A.22governs selected structure and structural views as structure.C.30governs groundedArchitectureOf@Contextadequacy and thin conditionalArchitectureDescription@Contextbridge use.C.30.ADgoverns the full architecture-description mechanism whenArchitectureDescription@Contextis the EntityOfConcern under repair.C.30.ASVgoverns architecture structural views.C.30.STRATgoverns stratification wording or source-label wording before C.30.P assigns any recovered architecture or structure portion.- Named
C.30.*patterns govern their own structure adequacy or view adequacy questions. C.2.Precovers source, publication, view, face,PublicationUnit, carrier, and source-use disposition.A.6.Prepairs relation construction;A.6.Frepairs function and functionality wording;A.6.Mrepairs module-relation and interface-specification wording.C.16.Prepairs characteristic-and-scale wording, andC.16.Qrepairs quality-term or evaluative characterization wording before score or quality use.C.29governs mathematical-lens use and does not become architecture by analogy.
C.30.P:End
Stratification Wording Precision Restoration
Type: Architectural precision-restoration subpattern under
C.30Status: Stable Normativity: Normative unless explicitly marked informative
Plain-name. Stratification and architecture-operation source-label repair.
Intent. Recover source wording such as layer, level, tier, stack, ladder, rung, block, expert, cache, router, and gate by completing the E.10.ARCH recovery row for that wording use: semanticAreaBaseConcept, semanticAreaSenseFamily, selected ontologicalNeighborhood, primary EntityOfConcern kind, encountered FPF kind or reference, relation to the primary EntityOfConcern, recovered kind, relation, or claim-use, source-use disposition, governing pattern, admissible use, non-admissible use, and remaining reader move. No conforming C.30.STRAT use mints U.Layer, U.Level, U.Tier, U.Stack, U.Ladder, U.Rung, U.Block, U.Expert, U.Cache, or one universal U.Stratification.
Builds on. E.10, E.10.ARCH, E.8, F.18, C.30.P, A.22, and C.30.
Coordinates with. C.30.ASV, C.30.LCA, C.30.TFS-REL, C.30.ILC, A.6.M, A.6.F, E.18, C.16.P, C.16, A.19.SPR, C.2.P, E.17, C.29, C.28, A.10, G.6, B.3, A.20, A.21, A.15, A.2, G.5, and C.11.
E.10.ARCH governing relation. When E.10 encounters a stratification or architecture-operation source label whose ontologicalNeighborhood, primary EntityOfConcern kind, recovered kind, relation, claim-use, source-use disposition, or governing pattern is hidden, E.10.ARCH selects C.30.STRAT only until those row fields are recovered or the wording is lowered to ordinary source label, quote-only wording, reduced-use cue, blocked use, or incomplete rewrite. C.30.STRAT then stops at the source-label repair row; the governing pattern carries any recovered non-source-label claim or relation.
Use this when
Use this pattern when stratification or architecture-operation wording is doing FPF-governed work but the selected ontologicalNeighborhood and governing pattern for the source-label use are not yet recoverable by value.
Typical source labels:
layer,level,tier,stack,ladder,rung;block,expert,cache,router,gatewhen architecture-operation prose uses them as recognition labels before the FPF kind is known.
What goes wrong if missed. A source label starts acting as ontology. Layer may be taken as a holon level, control layer, publication layer, scale window, or module boundary without saying which ontological neighborhood is being used. Stack may become architecture by label. Block may become a module. Expert may become a role. Cache may become a memory relation or state. Router may become a decision policy. Gate may become a gate decision. None of those interpretations is admissible by word shape alone.
What this buys. The practitioner can keep useful source language while recovering the selected ontologicalNeighborhood and applying the governing pattern, instead of replacing the source label with another umbrella word.
First useful move. Treat the word as a sourceLabel and complete the recovery row: source label, bounded text, selected ontologicalNeighborhood, primary EntityOfConcern kind, relation to that EntityOfConcern, recovered kind, relation, or claim-use, governing pattern, admissible use, non-admissible use, and remaining reader move.
Not this pattern when. If the governing pattern is already recoverable by value, use it directly. Do not use C.30.STRAT merely because a familiar word appears. If the wording is only ordinary source prose with no FPF-governed use, keep ordinary prose or quote-only wording and stop.
Problem frame
Architecture and engineering sources use compact labels because they work in local practice. Neural-network architecture prose says block, expert, cache, or router. Control architecture says layer. Organizations say level or tier. Documentation says section, stack, or view. Mathematical and scale prose says level, resolution, or coarse-graining step.
Those labels are useful recognition cues, but FPF cannot rely on them as kinds. A label is not enough to know whether the next admissible move is module-relation repair, structure selection, functional-structure record, control-structure view, scale-window naming, source-publication return, or non-source-label claim assignment named by value.
The repair question is:
Which
ontologicalNeighborhooddoes this source-label use belong to, and which governing pattern now governs the recovered kind, recovered relation, recovered claim-use, source-use disposition, or non-use disposition?
Problem
How can FPF keep common stratification and architecture-operation language without:
- minting false root kinds for
layer,level,tier,stack,ladder,rung,block,expert,cache,router, orgate; - making
C.30govern all structure-like wording; - making
A.6.MorC.30.LCAcarry a duplicate local trigger registry; - treating source labels as non-source-label FPF-governed claims by appearance;
- removing useful source language before a remaining admissible reader move is recoverable?
Forces
Solution
Produce a StratificationSourceLabelRepairNote or an equivalent local rewrite. The note records the recovered E.10.ARCH row fields for this source-label use. It is not itself the selected structure, relation, source publication, neighboring claim record, or governing-pattern result.
Recovery sequence
- Bound the text and label. Name the sentence, table row, diagram label, publication unit, or source span; copy the source label; and state the local sentence role.
- Check cheap closure. If there is no FPF-governed use, keep ordinary prose or quote-only wording and stop. If one small local rewrite restores the intended non-FPF use, close locally under
E.10. - Recover candidate ontology. Recover candidate primary
EntityOfConcernkinds, candidate encountered FPF kinds or references, relation candidates, claim-use candidates, source-use candidates, scope, time, viewpoint, and context facets. Include literal and intended candidates when metonymy or compression is plausible. - Select the ontological neighborhood. Select the first applicable neighborhood by recovered relation, claim-use, source-use disposition, formal apparatus, or governing-pattern field set, not by the source label.
- State the apparatus that makes the repair checkable. Use relation slots, control roles and rate bands, module-interface fields, flow fields, transformation-flow fields, characteristic and scale construction, publication relation set, source-use disposition, mathematical-lens fields, evidence path, assurance argument, gate record, work occurrence, decision record, causal-use record, or ordinary non-use disposition, with scope, time, viewpoint, and context facets only where the recovered claim or use needs them.
- Project back to wording. Produce the repaired wording, compact note, direct governing-pattern application, or non-use disposition. The replacement candidate is accepted only after it passes
E.10. - State use and move. State admissible use, non-admissible wider or adjacent use, and one remaining reader move. If no move remains, the disposition is reduced-use, quote-only, blocked use, or incomplete rewrite.
Ontological-neighborhood governing-pattern applications
Same-sentence claim boundary
When one sentence uses a source label to carry another FPF-governed claim, do not repeat a local "not proof, not gate, not work" catalogue at every occurrence. Keep the source-label repair in C.30.STRAT and apply the governing pattern for each recovered non-source-label claim. C.30.STRAT:4.2 names the common choices; worked cases keep only local false positives that the source label itself makes tempting.
Source-label cue table
Placement discipline
semanticAreaBaseConcept: stratification wording and architecture-operation source labels.
semanticArea: the Part-F semantic row-set used for layer, level, tier, stack, ladder, and rung plus architecture-operation labels such as block, expert, cache, router, and gate when they are used as source labels before the governing FPF pattern recovers their selected kind, relation, or publication-use boundary.
semanticAreaSenseFamily: source-label wording for stratification, ordering, aggregation, and architecture-operation recognition; not a topic label, pattern-placement claim, or pattern-nest grouping.
ontologicalNeighborhood: the applicability neighborhood selected by the recovery row, not a second ontology. The admissible neighborhoods are the rows in C.30.STRAT:4.2: control structure; selected structure or structural view; module-interface and substitution; function-like or transformation-flow; characteristic, scale, or mathematical-lens use; episteme, publication, view, or source-use; state, currentness, temporal, or dynamics; evidence, assurance, gate, work, decision, or causal-use; and ordinary source-label non-use.
The pattern nest is C.30.* because the recurring first failure is architecture or structure wording in architecture-operation prose. That placement does not make C.30 the governing pattern for non-source-label claims named in C.30.STRAT:4.2. The selected ontologicalNeighborhood and governing-pattern row decide which pattern governs the case.
Worked cases
Filled repair note
A compact local rewrite can therefore say: The response cache is a candidate state-bearing architecture structure. Architecture scaling, mathematical-lens use, proof, and assurance claims are separate claims; apply [C.16.P](/generated/patterns/C.16.P), [C.29](/generated/patterns/C.29), [C.31.ASAP](/generated/patterns/C.31.ASAP), [A.10](/generated/patterns/A.10), [B.3](/generated/patterns/B.3), or [G.6](/generated/patterns/G.6) only when one of those claims is being made.
Lowering and reopen conditions
A StratificationSourceLabelRepairNote remains admissible only while its source span, selected ontologicalNeighborhood, governing pattern, and remaining reader move stay recoverable. Reopen or lower the repair when:
- the source label starts carrying a new relation, characteristic, publication, evidence, assurance, gate, work, decision, causal-use, or mathematical-lens claim;
- a direct governing pattern becomes recoverable and
C.30.STRATno longer buys action guidance; - the selected neighborhood was chosen by label similarity rather than by recovered apparatus;
- the repair preserves kind recovery but leaves no useful admissible reader move;
E.10.ARCHchanges the required recovery fields,C.30.Pchanges architecture-wording repair law,F.19changes apparatus-vs-usability policy, or a more source-label realization pattern now governs a label family currently repaired here.
Lower the result to quote-only, reduced-use cue, blocked use, or incomplete rewrite when the governing pattern, admissible use, non-admissible use, or remaining move cannot be stated.
Archetypal Grounding
Bias-Annotation
Lenses tested: Arch, Onto and Epist, Prag, Did, and Gov. Scope: architecture and engineering source-label precision restoration, with non-architecture governing-pattern applications when recovery selects them.
This pattern intentionally biases away from lexical replacement and toward ontology-first recovery. The mitigation is the cheap-closure rule: ordinary source prose stays ordinary, quote-only wording stays quote-only, and already recovered cases skip C.30.STRAT.
Conformance checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
Stratification words are common because they compress local practice. That compression is useful at entry time and unsafe as ontology. FPF therefore keeps the word as a source label, recovers the ontologicalNeighborhood, and then uses the governing pattern for the recovered claim.
The pattern is placed under C.30 because architecture and structure prose is the recurring entry point. The placement does not make C.30 the governing pattern for every recovered case. If the recovery result is outside source-label repair, the governing pattern named in C.30.STRAT:4.2 carries the recovered claim content.
SoTA-Echoing
Reduced SoTA is sufficient for this precision-restoration pattern. The source practice being adopted is not a new external ontology; it is the observed architecture and engineering habit of using compact labels such as layer, level, tier, stack, block, expert, cache, router, and gate as local recognition language. FPF adapts that practice by keeping labels as source labels and requiring ontology-first recovery before they carry FPF-governed use.
Internal FPF current practice is the governing source here: E.10 supplies trigger handling, E.10.ARCH supplies the recovery architecture, C.30.P supplies architecture and structure wording repair, F.19 supplies apparatus-vs-usability discipline, and governing patterns carry recovered cases. The Solution, checklist, worked cases, and relations in this pattern change because that source-use disposition rejects lexical replacement and trigger-table fanout.
Currentness front. Recheck this pattern when E.10.ARCH changes the recovery row fields, C.30.P changes architecture or structure wording repair, F.19 changes apparatus policy, or a more source-label realization pattern now governs a label family currently repaired here. The smallest changed locus is the affected row field, Relations entry, worked case, or subject-pattern thin pointer; do not rebuild a local trigger registry.
Relations
E.10catches the trigger and selects this pattern only when stratification or architecture-operation source-label recovery is needed.E.10.ARCHsupplies the recovery architecture, placement rule, and anti-fanout discipline.C.30.Premains the broader architecture and structure wording repair.C.30.STRATis the narrower stratification source-label realization when those labels recur with stable recovery apparatus.A.6.Mgoverns only recovered module-interface relation and interface-specification cases.C.30.LCAgoverns only recovered control-structure view cases with control roles, relations, rate bands, control-layer labels, and bounded context.C.31andC.31.RSAgovern only recovered characteristic, reusable-locus, bespoke-residue,accountingBasisRef, or report-only share cases.C.2.P,E.17,A.6.F,E.18,C.30.TFS-REL,C.16.P,A.19.SPR,C.29,C.28,A.10,G.6,B.3,A.20,A.21,A.15,A.2,G.5, andC.11carry their recovered cases when the case is named by value.
Neighboring claims stay with their governing patterns: A.22 for selected-structure EntityOfConcern, C.30 for grounded architecture and selected-structure adequacy, C.30.P for architecture and structure precision restoration, C.30.ASV for structural-view adequacy, C.30.LCA for control-structure view adequacy, A.6.M for module-interface repair, A.6.F for function-use repair, E.18 for graph, path, crossing, and flow-valuation discipline, C.16 for characterization, C.29 for mathematical-lens use, C.2.P for source and publication relation repair, and the non-source-label governing patterns named in C.30.STRAT:4.2. C.30.STRAT governs stratification wording and architecture-operation source-label repair only.
C.30.STRAT:End
Architecture Structural View Adequacy (ASV)
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
Use this pattern when an architecture discussion needs a view over selected architecture-relevant U.Structure refs in an ArchitectureOf@Context claim.
The first useful move is ArchitectureStructureKindTriage@Project: name the architecture claim or pre-claim described holon and bounded context, the smallest useful ArchitectureStructureKindRef set, the selected structure or structure-kind under consideration, and the next admissible architecture move.
Start with [C.30](/generated/patterns/C.30) when the architecture claim itself is unclear. Use C.30.ASV only when a structural view over selected architecture-relevant structure changes the next move. Use a full ArchitectureStructuralView@Context only when the view changes action, selected reliance relation, correspondence, source return, publication, comparison, or another governing-pattern use.
What goes wrong if C.30.ASV is missed: one favored diagram, module view, TEVB viewpoint, generated relation graph, control sketch, or neural-network block diagram is treated as the architecture view or proof without naming the selected structure kind, hidden or lost structure, correspondence, and next move.
What C.30.ASV buys in practice: the practitioner can bind selected structure kind to view record, viewpoint, construction mode, selected relations, hidden or lost structure, correspondence, source-return condition, and admissible use before relying on that view.
Not this pattern when the question under repair is only the general architecture claim, structure as such, selected transformation-flow relation, mathematical graph description, path relation, or crossing relation. Use [C.30](/generated/patterns/C.30), [A.22](/generated/patterns/A.22), [E.18](/generated/patterns/E.18), [E.18.2](/generated/patterns/E.18.2), [C.29](/generated/patterns/C.29), or C.30.TFS-REL as appropriate. If the view is used for another claim being made, use the governing pattern and keep C.30.ASV only to the view portion.
Thin precision-restoration pointer: if the issue under repair is still whether view, architecture view, architecture structural view, diagram, model, graph, layer, or functional architecture names a structural view, an architecture description, a publication face, a publication form, a source relation, or another governed claim or relation named by value, use [C.30.P](/generated/patterns/C.30.P) first. Do not copy the [C.30.P](/generated/patterns/C.30.P) trigger table here; apply C.30.ASV only after the architecture structural-view claim or non-ASV claim named by value is recoverable.
Problem
An architecture structural view is selected-structure triage for an ArchitectureOf@Context claim: which architecture-relevant structure is being viewed, which structure kind is under consideration, what relation, constraint, invariant, operation, dynamics description, hidden or lost structure, correspondence, source or reliance relation, and source-return condition changes the next architecture move. The view is represented as a Description episteme, including an episteme-lane U.View when the view claim is being made, only to record that selected-structure move. Publication faces, forms, units, and renderings may publish the view; they are not the view and do not become the selected structure.
Without this pattern:
- a module-interface view is treated as all architecture;
- a selected transformation-flow structure, mathematical graph description, or control diagram is treated as proof;
- a structure kind is treated as a
U.Viewpoint; - a TEVB viewpoint bundle is mutated to carry architecture-specific structure kinds;
- a diagram, table, dashboard, generated relation graph, or ADR is treated as the view itself;
- functional architecture is treated as a peer ontology rather than a structure-kind interpretation under C.30;
- cross-view consistency is asserted by prose instead of correspondence records;
- omitted structure is relied on in subsequent work without a source-return condition.
Forces
Solution
Govern architecture structural views by first naming the selected architecture-relevant structure, structure kind, view construction, correspondence, hidden or lost structure, source or reliance relation, source-return condition, admissible use, and next architecture move. Use ArchitectureStructuralView@Context as the record form when that view must be durable, reusable, comparable, or reliance-bearing.
A conforming ArchitectureStructuralView@Context record is a Description or view over selected U.Structure references in one ArchitectureOf@Context claim record, under one declared ArchitectureStructureKindRef and one DescriptionContext.ViewpointRef. The description and view machinery makes the selected-structure move inspectable; it does not replace that move.
C.30.ASV is the selected-structure-kind-to-view relation pattern for architecture work. It explains how different selected structure kinds become views under declared viewpoints and concerns. It is not a complete architecture-description pattern; a durable ArchitectureDescription@Context composes one or more structural-view records through C.30 and E.17.0 only when description use is being made.
C.30.ASV does not extend the TEVB core viewpoint set by implication. It defines architecture structure kinds and architecture-specific structure-kind and view-record bindings. TEVB viewpoints are reused when the structure-kind view uses one of the TEVB core viewpoints; other structure-kind views use VF.ARCH.STRUCTURE, a declared local viewpoint bundle, a governing FPF pattern, or a source or reliance record.
Architecture structural view record
StructuralAspectDescription@Context describes one selected structural aspect under A.22. It is not an ArchitectureStructureKindRef by itself. ArchitectureStructuralView@Context is a C.30.ASV view over structures selected by ArchitectureOf@Context and typed by ArchitectureStructureKindRef.
DescriptionContext.EntityOfConcernRef names the selected structure or selected structure set represented by structureRefs. architectureClaimRef names the enclosing ArchitectureOf@Context claim, and the described holon and bounded context are recovered through that claim record.
EntityOfConcern discipline. C.30.ASV treats selected structure as the EntityOfConcern for this view use when the view concerns dependent, non-agentive organization rather than one publication form or source material. This does not add a parallel EntityOfConcern head: DescriptionContext.EntityOfConcernRef, selectedStructureEntityOfConcernRef, and structureRefs must converge on the same selected structure or structure set, while architectureClaimRef remains the enclosing architecture-claim context.
viewpointRef is a recovery label for descriptionContext.ViewpointRef, not a second independent viewpoint slot. If the implementation stores only DescriptionContext, the viewpoint remains recoverable there.
structureKnowledgeState? states how the selected structure is known when partial knowledge matters: declared, observed, inferred, generated, simulated, extracted, hypothesized, or with an unknown region present. Unknown or inferred structure may guide inspection or source return; it cannot by itself supply assurance, gate, release, causal proof, or architecture decision.
Architecture structure-kind classifier
ArchitectureStructureKindRef is a C.30-local DiscriminatorToken enumeration over architecture-relevant U.Structure references selected by ArchitectureOf@Context. It is not U.Kind, U.Viewpoint, U.ViewpointBundle, StructuralAspectDescription, StructuralView@Context, or a root U.* kind. ArchitectureStructuralView@Context uses structureKindRef to say which selected structure kind is being viewed.
The first group is the seed classifier set for ordinary architecture structural-view use. SecurityTrustBoundaryStructure, WorkMethodStructure, RoleEnactorStructure, EvidenceAssuranceStructure, and ScaleEvolutionStructure are classifier values over selected U.Structure references, not new root kinds. ASV may use them to name the selected architecture-relevant structure, but their full semantics stay in the named security, work and method, role-enactor, evidence and assurance, scale, characterization, or mathematical-lens patterns.
Do not enumerate structure kinds by default. Choose the smallest useful structure-kind set that changes the next architecture move. If no structure kind changes action, keep the phrase as ordinary recognition wording or a source note. This does not weaken kind discipline; it prevents ArchitectureStructureKindRef from becoming an audit checklist.
Inside C.30.ASV, OtherDeclaredStructureKind is always an architecture-structure-kind classifier value over U.Structure; it does not mint a general FPF root kind.
OtherDeclaredStructureKind is admissible only when the local text names:
declaredStructureKindName;declaredStructureKindDefinition;- allowed relation families;
- locally triggered overreads;
- governing-pattern applications;
boundedContextRef.
Each structure kind needs a short definition, allowed relation families, locally triggered overreads, typical governing-pattern applications, and example architecture structural view records. This is not a new root-kind set; it is a controlled classifier set over U.Structure.
Small triage output
Use ArchitectureStructureKindTriage@Project before a full view record when the practitioner only needs to identify the structure kind under consideration and next architecture move.
architectureConcernCue? and sourceMaterialRef? are recognition and source-reference positions; they do not create ArchitectureStructureKindRef values. primaryGoverningPatternApplicationRef? names the one neighboring pattern that carries the next non-ASV claim kind when such a claim is current. nonAdmissibleOverread? names only the overread that would change this triage. Candidate generation, evidence, assurance, gate, publication, decision, or work claims are named through governingPatternApplicationRefs? and stay with their governing patterns rather than becoming ASV fields.
When architectureClaimRef is absent, describedHolonRef and boundedContextRef are required for triage. This pre-claim form does not create a new kind and does not publish an ArchitectureOf@Context claim by itself; it only lets the practitioner identify the structure kind under consideration before forming a full architecture claim. A full ArchitectureStructuralView@Context still requires architectureClaimRef; do not promote triage to a full view record until that architecture claim is available.
Practitioner prompt labels are first-entry cues, not ArchitectureStructureKindRef values. FPF-governed records use the Tech values below:
Architecture viewpoint bundle and binding rows
Architecture structural views use VF.ARCH.STRUCTURE without turning structure kinds into viewpoints. The bundle is separate from VF.TEVB.ENG: it may import TEVB, but it does not expand the TEVB core engineering viewpoint set.
Declaration source: VF.ARCH.STRUCTURE is an E.17.1 and F.18 declared viewpoint bundle for architecture structural-view records. Its VP.Architecture* ids are viewpoint ids only. They do not add TEVB viewpoints, name structure kinds, define publication faces, or carry decision, evidence, gate, or assurance authority.
Structural-view publication-use boundary
This subsection is the C.30.ASV structural-view publication-use boundary. C.30.ASV governs architecture structural-view adequacy: selected architecture-relevant structure, structure kind, view construction, correspondence, hidden structure and lost structure, source return, and next architecture move. When a view, diagram, graph, card, benchmark, probe output, model publication, or architecture note is used for evidence sufficiency, safety assurance, gate passage, release permission, work record, or decision authority, apply the pattern governing that claim; keep only the structural-view record and the next architecture move in C.30.ASV.
TEVB is the small engineering viewpoint bundle over holons. The architecture problem is broader than TEVB, but the broader coverage is not solved by placing record sets inside a U.ViewpointBundle. The U.ViewpointBundle carries viewpoints; a separate architecture-local description binds structure kinds, view record sets, construction modes, correspondence requirements, and governing-pattern applications.
viewRecordSetRef names the allowed Description-episteme or specification-use record set for one structure-kind binding. It is not a package grouping, not a U.ViewpointBundle, not a ViewFamilyId, and not a new TEVB viewpoint.
Initial architecture structure kinds and view records
The initial set is a seed for first architecture moves, not an atlas. Use the table to choose one structure kind under consideration and the governing-pattern application that carries any non-ASV claim kind.
Externally governed classifier values remain admissible when they are the architecture-relevant structure under consideration, but C.30.ASV does not define their full record families:
Minimum useful seed examples:
SecurityTrustBoundaryStructure carries adversarial-boundary interpretation: which protected assets or effects are under consideration, who or what is trusted, where untrusted input crosses, what authority or privilege is exposed, which adversarial paths and attack exposures matter, which data-flow or control-flow security boundaries matter, and where secure defaults, hardening, update or supply-chain channels, detection, or response boundaries change the next architecture move.
Apply evidence, assurance, gate, or compliance patterns only when the architecture move relies on evidence sufficiency, assurance verdict, gate passage, regulatory acceptance, or release authority. If the selected move is structural, first recover the structure: trust boundary, loss-control relation, control relation, evidence reuse structure, or affected structure or affected view.
Use a SafetyLossControlStructureNote when a safety-architecture concern first needs the architecture-side loss-control structure rather than a safety-case verdict:
The note gives a positive first architecture move: find the loss-control structure, controlled process or plant, constraint, foreseeable misuse, operational design scope, and action-relevant boundary. It does not replace evidence, assurance, gate, causal, dynamics, or temporal claims.
Functional structure view boundary
FunctionalStructureView@Context under C.30.ASV does not mint U.Function. It may publish FunctionalElement@Context as a view-local functional-structure record when the view selects a bounded context, a functional behavior, and a bearer or candidate-bearer locus. The functional element is not identical with the behavior: the behavior is grounded as U.Transformation for one bounded required change or required effect, or as TransformationFlowStructure for compound behavior, while the functional element is the view-local record that binds that behavior to bearer, capability, ports, and allocation claims when those claims are current.
Identity for FunctionalElement@Context is:
- selected
FunctionalStructureView@Context; - bounded context;
- functional behavior reference:
U.TransformationorTransformationFlowStructure; - bearer or candidate-bearer locus: normally
U.Systemor candidate system bearingTransformerRole@Context, or an explicit not-yet-allocated gap.
If no bearer or candidate allocation is current, do not claim a full functional element. Record a required transformation gap, required effect gap, capability gap, functional behavior slot, or candidate allocation question. This preserves the practical architecture move without pretending that a module, component, diagram row, or function word has already supplied the bearer.
A selected transformation-flow structure, mathematical graph description, path slice, crossing, or flow valuation is not a functional element by default. When a transformation-flow relation is being used, connect the functional view to TransformationFlowStructure through C.30.TFS-REL. When a mathematical graph description is being used, connect it through [E.18.2](/generated/patterns/E.18.2); when math-lens use is being claimed, connect it through [C.29](/generated/patterns/C.29). When module allocation is being claimed, connect the functional view to [A.6.M](/generated/patterns/A.6.M) module-relation repair rather than treating function and module as one kind. Functional ports and module interfaces can both use U.Signature discipline, but functional ports govern behavior input and output slots while module interfaces govern substitution, compatibility, boundary, and change-policy claims.
Composability and quality compositionality are separate claims. If the view says parts can be assembled, keep that as a structure claim or use claim. If it says a quality of the whole follows from parts, assign the quality-composition claim to [C.25](/generated/patterns/C.25) and C.16-backed measurement or quality claim.
Compositional formalisms may express explicit composition structures and view relations and model relations. They do not make safety, latency, reliability, or another quality propagate automatically.
Correspondence and source return
Use correspondence records when the view relates functional, flow, control, module-interface, information, runtime, placement, work, evidence, scale, or logical structures. Do not assert cross-view consistency by prose alone.
Correspondence examples:
Use SourceReturnCondition when compression, extraction, coarsening, evidence reuse, ML evaluation, bounded exception, many-to-many allocation, publication, or decision claim hides a distinction needed for action, assurance, causal use, legal review, regulatory review, comparison, or reopening.
If viewConstruction is query, extraction, coarsening, correspondenceSlice, or sourceReturnSlice, and omitted structure changes action, assurance, causal use, legal or regulatory review, or subsequent decision reopening, SourceReturnCondition is needed.
When the view is used to name affected structures for a next move but no decision record is being used, use C.30 AffectedArchitectureStructureNote: affected structure kinds, affected structure refs when known, affected ASV refs, accepted or suspected view loss, source-return condition, and the next admissible move. The note is not an architecture decision, ADR, gate passage, evidence sufficiency, or release authority.
Use the thinnest source or reliance relation that preserves the next architecture move. Use fuller source, evidence, assurance, or claim-kind relation only when the source or reliance relation being used cannot be inspected, used, compared, refreshed, or bounded without it. A ControlStructureViewNote may precede full C.30.LCA use or proof-governing pattern applications when one control relation and its boundary are enough for the architecture move being made.
Treat source return as a user action, not only a metadata field:
Do not make source return mandatory for ordinary local recognition when no hidden distinction is being used for action. Do not omit source return when a hidden distinction carries a selected reliance relation, assurance, legal, comparison, causal, gate, or decision commitment. The condition is needed only when the repaired text still relies on the hidden source-side distinction.
Model cards, system cards, and evaluation harness reports may publish or substantiate an architecture structural view only when the structural-view claim is recoverable. The view must name the relevant structure kind, such as RuntimeInteractionStructure, InformationDataStructure, SecurityTrustBoundaryStructure, EvidenceAssuranceStructure, ModuleInterfaceStructure, or another declared structure kind; it must also state intended-use scope, evaluation scope and known loss when evaluation is used, deployment-context mismatch when that mismatch is being claimed, and the evidence or assurance governing pattern when the publication is used beyond transparency. A card or harness is not architecture adequacy, safety proof, or release claim or gate claim by publication alone.
Worked slices
Runtime degradation. A team says, "The architecture is fine, but incidents happen when failover starts." The first architecture move is to recover runtime interaction, control relation, failover relation, placement, and evidence-assurance structures before turning a dashboard or deployment diagram into proof:
Use [C.24](/generated/patterns/C.24) only when tool-use, call planning, call graph, work execution, or budgeted agentic tool-use is the claim being made. Do not absorb those claims into architecture structure.
CPS or plant architecture. A plant drawing, P&ID-like publication form, LCA sketch, or safety-case view is not the plant architecture by itself. First recovery can require:
Chiplet or device architecture. A packaging diagram or interconnect sketch may involve several structure kinds:
Organization or operating-model architecture. An org chart or work-method diagram can be architecture-relevant only after the work, role, information, and evidence records are separated:
Evidence reuse across product variants. A certification or test package reused across module variants may be architecture-relevant as an evidence-and-assurance structure view, but it is not an assurance verdict:
Organization service architecture. A service organization sketch that shows teams, handoffs, escalation points, and dashboards is not the organization architecture by itself. First recovery can require:
AI agent diagram. A "planner-memory-tools" diagram is not the agent's architecture by itself. It may start first recovery as a structure-kind set, without minting an AI-domain ontology:
Structural AI-agent security is architecture structure when these structure kinds change the next architecture move. When the claim being made is latent representation, decoding, or effect adequacy rather than architecture structure, keep the phrase as a reduced-use source cue until the representation, decode, or effect-adequacy pattern governing that claim carries that claim.
Generated code-agent relation graph. A probe JSON or code-agent architecture relation graph can be an architecture structural view publication only after observed, inferred, or unknown observation value, evidence pointers or source pointers, unexplored regions, typed relation semantics, and source-return conditions are present. Belief-state proof and downstream-change safety assurance apply the patterns governing those claims.
Neural-network block replacement. Replacing attention, FFN, convolution, SSM, recurrent, memory block or cache block, MoE expert-selection, pruning, distillation, or another block is an architecture move only when the changed structure kind, flow relation, module-interface claim kind, preserved and lost structure, affected characteristic, source relation, and decision or evidence governing pattern are named.
Archetypal Grounding
Bias-Annotation
Lenses tested: Arch, Onto, Epist, Prag, Did, Gov. Scope: architecture structural-view claims over holons.
This checklist verifies the preceding guidance after the practitioner has chosen the selected move; it is not a required project control form and not a substitute for the card, note, view, relation, or repair move above.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
C.30.ASV exists because architecture descriptions are multi-view by nature, but FPF cannot let "view" absorb every architecture claim. A structure kind and a viewpoint are different. A structure kind says what kind of selected structure is being described; a viewpoint says how an episteme or view is oriented toward a concern. They may be bound, but they are not interchangeable.
The pattern keeps first use light by providing ArchitectureStructureKindTriage@Project. If triage identifies the structure kind under consideration and the next admissible architecture move, no full view record is needed. The full record is used when a view changes action, correspondence, publication, source return, source or reliance use, or non-view claim kind.
The TEVB decision is conservative. TEVB remains the small engineering viewpoint bundle over holons. Architecture may import it, but architecture-specific structure kinds and view-record bindings are defined beside TEVB rather than mutating TEVB.
SoTA-Echoing
Relations
Builds on: C.30.P, C.30, A.1, A.22, E.24.PUB, A.6.3, E.17.0, E.17.1, E.17.2, A.7, E.10.D2, E.10, C.2.P, and F.18.
Coordinates with: A.6.F, A.6.M, C.30.TFS-REL, C.30.LCA, C.30.ILC, E.18, C.29, C.16, C.25, C.28, A.10, G.6, B.3, A.20, A.21, A.15, C.11, and governing patterns for architecture decision and candidate-set claims. Use A.6.M when the module-interface claim kind is being made.
Neighboring claims stay with their governing patterns: C.30 for grounded architecture and selected-structure adequacy, A.1 for the described holon recovered through ArchitectureOf@Context, A.22 for selected-structure EntityOfConcern, E.24.PUB for ontic-description and publication-form boundary, E.18 for selected transformation-flow structure, path, and crossing discipline, E.18.2 and C.29 for mathematical graph descriptions and mathematical-lens use, C.16 for characterization, C.25 for Q-Bundles, C.28 for causal use, A.10 and G.6 for evidence, B.3 for assurance, A.20 and A.21 for gate or release records, A.15 for work, C.11 for decisions, and E.17 for publication. C.30.ASV governs architecture structural-view adequacy for the selected structure being viewed.
C.30.ASV:End
Control Structure View Adequacy (LCA)
Type: Architectural subpattern under
C.30Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
Use this pattern when a selected control structure or control-structure relation changes the next architecture move: a controller regulates a plant, an observer or estimator changes what can be known, a planner provides references to lower-rate control, a supervisor constrains a subsystem, a policy loop changes allowed behavior, or an LCA cue makes roles, rates, observation boundaries, actuation boundaries, feedback, or externalities architecture-relevant.
The first-minute working situation is ordinary engineering talk: a diagram says the supervisor watches a subsystem, a controller regulates a plant, an observer estimates state, a planner gives references to a lower-rate controller, or a policy relation or control relation changes allowed controller behavior. The useful first move is to recover a ControlStructureView@Context: which architecture claim is being described, which control roles and relations are present, which rate bands or recovered control-layer relations are being claimed, which feedback or externality boundaries are named, and which governing pattern carries any additional claim being made. If the source only says layer, level, tier, or stack without a control-specific relation, use C.30.STRAT first.
What goes wrong if C.30.LCA is missed: a control diagram becomes proof; stratification labels bypass C.30.STRAT and start carrying undeclared scope; and B.2.5, E.18 transformation-flow-structure prose, or Layered Control Architecture (LCA) prose is overread as control adequacy.
What C.30.LCA buys in practice: the practitioner can keep useful controller, plant, observer, regulator, supervisor, feedback, rate, and control-layer language while recovering the control-structure view and the governing pattern that carries any proof or claim named by value.
Not this pattern when the issue under repair is generic stratification or source-label repair, only an E.18 transformation-flow path slice, function description, module boundary, measurement head, causal intervention, or safety case. Use C.30.STRAT, C.30.TFS-REL, A.6.F, A.6.M, C.16, C.28, or the assurance or evidence pattern governing the claim as appropriate.
The primary EntityOfConcern for this pattern use is the selected control structure or control-structure relation set under an ArchitectureOf@Context. The ControlStructureView@Context is a describing episteme for that selected structure; proof, safety, evidence, gate, and architecture-as-whole claims remain claim named by value refs governed by their governing patterns. Ordinary use may stop with a typed control-structure view note:
The full ControlStructureView@Context is used when the control claim being made needs declared roles, relations, rates, recovered control-layer labels, boundary refs, or explicit governing-pattern applications beyond that note.
Problem
Control diagrams are persuasive because they look operational: arrows imply feedback, boxes imply responsibility, and recovered control-layer labels imply separation. In practice that is often enough for orientation, but not enough to make the architecture claim admissible. A control-stack description can quietly overclaim that stability, safety, evidence sufficiency, gate validity, assurance, or causality has already been established; a non-control layer, level, tier, or stack label belongs first to C.30.STRAT, not to C.30.LCA.
FPF needs a pattern that preserves the useful recognition of control architecture without letting the recognition cue become a proof. The control roles, feedback relations, externality boundaries, and rate separations belong in an architecture structural view. Claims about dynamics, temporal aspects, authored temporal-claim adequacy, causal use, evidence, assurance, gates, or mathematical lens transfer belong in the governing pattern that governs that claim kind.
Forces
- Control talk is useful and current engineering practice uses it, so deleting it would make architecture prose less usable.
- The same source labels can name different things. C.30.LCA applies only to recovered control-layer, rate-band, control-relation, bounded-context, and
B.2.5supervisor-subholon uses; otherlayer,level,tier, orstackuses are recovered withC.30.STRATand then governed by their governing patterns when those claims are being made. - Layered and multi-rate control descriptions often need timing and dynamics claim before they can carry stability or safety claims.
B.2.5already gives FPF a supervisor-subholon feedback-loop pattern, but it does not turn every loop diagram into proof.E.18TransformationFlowStructurevalues and their mathematical graph descriptions can describe flow, path, crossing, or transformation-flow relations that participate in control, but the transformation-flow description or graph expression is still a description or view, not the control structure itself.- Practitioners need one small first output; dynamics, C.29, evidence, assurance, and gate records are used only when the question under repair calls for that governing pattern use.
Solution
Treat LCA-like material as a control-structure view under C.30. Recover the described architecture claim, the selected control structure or control-structure relation set, the control roles, the control relations, the relevant rate bands or recovered control-layer labels, and the boundary refs that make the view checkable. If the source label is not yet control-specific, apply C.30.STRAT before applying C.30.LCA to the case. Then state the admissible use and the non-admissible overread.
The ordinary minimum may stop with a compact ControlStructureViewNote:
Use rateBandRefs?, controlLayerRefs?, and externalityBoundaryRefs? only when rate, recovered control-layer, or externality wording carries a control-structure claim being made. Otherwise the ordinary note may stop after one control relation, loop state, and the proof-governing pattern application named by value if that claim is being made. Generic stratification labels stay with [C.30.STRAT](/generated/patterns/C.30.STRAT) until recovered.
When a recovered control-layer relation is used to justify decomposition, substitution, or design reliance, recover the inter-layer assumption-guarantee relation or mark the control-layer relation as orientation only. interLayerControlRelationRefs? is used only when the relation is already control-specific and is used for decomposition, substitution, design reliance, safety, or stability claim kinds.
Use this note only when a recovered control-layer relation is used for decomposition, substitution, safety or stability claim, or architecture decision claim. It is not proof. Otherwise keep C.30.LCA at the small note or ordinary view form, or return the source label to [C.30.STRAT](/generated/patterns/C.30.STRAT).
DescriptionContext.EntityOfConcernRef names the selected control structure or control-structure relation set represented by selectedControlStructureEntityOfConcernRef. architectureClaimRef names the enclosing architecture claim and supplies the bounded context and described holon; it is not the EntityOfConcern of the control-structure view itself.
Safety-loss control-structure note
Use a SafetyLossControlStructureNote only when safety wording is being used for a loss-control claim and the practitioner first needs the architecture-side loss-control structure, not a safety-case verdict:
The note gives a positive safety-triggered architecture move: find the loss-control structure, controlled process or plant, constraint, foreseeable misuse, operational design scope, and action-relevant boundary. It does not replace the generic control-structure view and does not replace evidence, assurance, gate, causal, dynamics, or temporal claims.
Role interpretation.
Control-specific stratification gate. Layer, level, tier, and stack enter C.30.LCA only after [C.30.STRAT](/generated/patterns/C.30.STRAT) or the local sentence recovers a control-specific item: controlLayerRef, controlRoleRef, controlRelationRef, interLayerControlRelationRef, rateBandRef, bounded context, and, where the supervisor-subholon relation is being claimed, [B.2.5](/generated/patterns/B.2.5) supervisor-subholon relation. Generic system level, aggregation scope, organization level, work or evidence scope, scale window, coarse-graining, deployment tier, and publication section do not stay in C.30.LCA. A layer label is not a control structure, not a system level, not a rate band, and not evidence of separation by itself.
B.2.5 boundary. [B.2.5](/generated/patterns/B.2.5) remains the supervisor-subholon feedback-loop check pattern. [C.30.LCA](/generated/patterns/C.30.LCA) can cite a [B.2.5](/generated/patterns/B.2.5) relation when a supervisor-subholon loop is part of the control view. It does not use [B.2.5](/generated/patterns/B.2.5) prose as proof of stability, safety, causality, evidence sufficiency, gate validity, or assurance. If an episteme appears in a control example, the acting Transformer, publication or review practice, and publication relation, source relation, or reliance relation are named; an episteme does not sense, judge, plan, adapt, or act as an agent.
Transformation-flow boundary. An [E.18](/generated/patterns/E.18) transformation-flow path slice may supply flow-structure, path, crossing, or transformation-flow-structure input to the control view when that relation is being used. The transformation-flow graph expression remains a mathematical description or view of transformation-flow structure. It does not become the functional architecture, the control structure, or proof of control adequacy.
C.29 boundary. LCA may be an accepted local control-theory description in one context and a transferable mathematical lens in another. When transfer, prediction, assurance input, or reusable cross-domain explanation is being claimed, use MathLensUse.FullCard or at least MathLensUse.MiniCard. Dynamics, temporal aspects or rate bands, authored temporal-claim adequacy, and causal claims are still assigned to [A.3.3](/generated/patterns/A.3.3), [C.27.TA](/generated/patterns/C.27.TA), [C.27](/generated/patterns/C.27), and [C.28](/generated/patterns/C.28).
Nesting and scale rule. If a control-structure view nests without a local depth limit, the record uses scaleAuditRef? when the nesting affects latency, stability, observability, accountability, or assurance.
Worked slice A - LCA diagram used as proof. A safety note says: The Layered Control Architecture proves the plant is safe because the supervisor monitors the lower controller. A conforming repair keeps the control-structure view and names planner, controller, plant, and supervisor relations, observation and actuation boundaries, and any rate bands. Safety and assurance claims use [B.3](/generated/patterns/B.3), evidence to [A.10](/generated/patterns/A.10) or [G.6](/generated/patterns/G.6), temporal-aspect and rate-band claims to [C.27.TA](/generated/patterns/C.27.TA), authored temporal-claim adequacy to [C.27](/generated/patterns/C.27), and dynamics or stability claims use [A.3.3](/generated/patterns/A.3.3) or the appropriate dynamics claim.
Worked slice B - multi-rate controller. A source says a control stack has a slow planner, a faster regulator, and an observer with a different update period. Apply [C.30.LCA](/generated/patterns/C.30.LCA) to the case only after the stack label has been recovered as control roles, relations, and rate bands; otherwise the label is recovered first by [C.30.STRAT](/generated/patterns/C.30.STRAT). C.30.LCA does not claim rate adequacy. If the rate relation matters for oscillation, latency, stability, or safety, the next admissible move is [C.27.TA](/generated/patterns/C.27.TA) for temporal aspect or rate-band structure, plus [C.27](/generated/patterns/C.27) only when an authored temporal-claim adequacy question is under repair, and the dynamics or assurance pattern named by value when that claim kind is being made.
Worked slice C - supervisor-subholon loop. A subsystem is supervised by an external controller that changes allowed modes. [C.30.LCA](/generated/patterns/C.30.LCA) records the supervisor-subholon relation and may reference [B.2.5](/generated/patterns/B.2.5). If the text claims that this loop authorizes work, passes a gate, or proves a policy constraint, the claim uses [A.15](/generated/patterns/A.15), [A.20](/generated/patterns/A.20), or [A.21](/generated/patterns/A.21).
Archetypal Grounding
Bias-Annotation
- Diagram authority bias. A neat feedback diagram can look more persuasive than the source relation, reliance relation, or claim pattern it actually uses. Repair by naming that relation named by value and the governing pattern that carries the claim kind being made.
- Stratification-label bias. A
layer,level,tier, orstacklabel can hide whether it names a control relation, rate band, aggregation, scale, organization, work scope or evidence scope, deployment, or publication section. Repair withC.30.STRAT; C.30.LCA applies only to the recovered control-specific case. - Supervisor anthropomorphism. A supervisor label can make an episteme, policy, or dashboard sound agentive. Repair by naming the acting transformer, method, or work practice.
- Transformation-flow and LCA conflation. A transformation-flow graph expression and a control view can inform each other, but neither replaces the other. Repair by naming the description context and structure kind for each view.
This checklist verifies the preceding guidance after the practitioner has chosen the selected move; it is not a required project control form and not a substitute for the card, note, view, relation, or repair move above.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
The gain is a small, usable control-structure output that preserves common architecture language while blocking proof overread. Practitioners can still say controller, plant, supervisor, feedback, and control layer, but the record shows what those words carry; generic stratification labels use C.30.STRAT before they are allowed to enter this pattern.
The cost is an extra relation note before downstream reliance. When the claim being made is only recognition, that cost is small. When the claim being made is safety, stability, evidence, assurance, or gate passage, the cost is appropriate because those claims were never carried by the diagram alone.
Rationale
Control architecture is too important to leave to diagram authority and too useful to remove from architecture language. The FPF move is to keep the practice cue and recover the control-structure content first: controlled holon or architecture claim, control roles, control relations, recovered rate or control-layer labels, observation and actuation boundaries, externality boundaries, and the next admissible control-architecture move. The record may be a Description episteme or episteme-lane view, possibly admitted for specification use, but that is the record lane for the control-structure move, not the center of the pattern. It can cite C.30.STRAT, B.2.5, E.18 transformation-flow structure, dynamics, C.27.TA, C.27, C.28, evidence, assurance, gates, and C.29, but it does not absorb their claim kinds.
This also protects the architecture ontology's EntityOfConcern and Description-episteme boundary plus specification-use discipline. The architecture-relevant EntityOfConcern is the selected control structure under ArchitectureOf@Context; the LCA diagram or control note is an architecture description or view when description or view use is being made. Several descriptions may describe the same control structure, and one description may be published without becoming the structure it describes.
SoTA-Echoing
Relations
- Builds on
C.30for grounded architecture and selected-structure adequacy andC.30.ASVfor structural-view adequacy. - Uses
A.22for structure and structural-view kind discipline. - Coordinates with
C.30.STRATwhen layer, level, tier, stack, ladder, rung, block, expert, cache, router, gate, or similar source labels must be recovered before any control-specific use enters C.30.LCA. - Coordinates with
B.2.5for supervisor-subholon feedback-loop recognition. - Coordinates with
E.18andC.30.TFS-RELwhen transformation-flow path slices supply structure input to the control view. - Applies
A.3.3for dynamics and stability claims,C.27.TAfor temporal-aspect or rate-band structure,C.27for authored temporal-claim adequacy,C.28for causal-use claims,A.10orG.6for evidence claim,B.3for assurance,A.20orA.21for constraint validity and gate decisions,A.15for work authority, andC.29when LCA is used as a transferable mathematical lens.
Neighboring claims stay with their governing patterns: C.30.STRAT for stratification and source-label precision restoration, C.30 for grounded architecture and selected-structure adequacy, C.30.ASV for architecture structural-view adequacy, B.2.5 for supervisor-subholon feedback-loop discipline, E.18 for graph, path, and crossing discipline, A.3.3 for dynamics claims, C.27.TA for temporal-aspect or rate-band structure, C.27 for authored temporal-claim adequacy, C.28 for causal use, A.10 or G.6 for evidence, B.3 for assurance, A.20 or A.21 for gate and constraint-validity records, A.15 for work, and C.29 for mathematical-lens use. C.30.LCA governs only the control-structure view relation being claimed.
C.30.LCA:End
Cross-Scope Architecture Residual Triage
Type: Architectural subpattern under C.30 Status: Stable Normativity: Normative for FPF pattern, companion-text, and project-description use that claims architecture-specific residuals across declared scopes.
Problem frame
Use this pattern when a project situation contains a cross-scope architecture residual for a described holon, often described in project speech as:
The first useful move is CrossScopeArchitectureResidualTriage@Context: name the affected declared holon levels or declared scopes, the selected structure in which those levels or scopes are recoverable, residual-bearing locus, local repair already attempted, why local repair is insufficient, and the first admissible architecture move or governing-pattern application.
The primary EntityOfConcern is the cross-scope or interlevel architecture residual in the described holon or holon family under a bounded context. The described holon may be a system, episteme, method, organization, publication family, or another structured holon. A phrase in a description, a diagram label, or a mathematical-lens output may make the residual visible, but it is not the residual itself and does not become the center of this pattern.
InterlevelConflict@Context applies when two or more declared holon levels, declared scopes, or level-bearing structure relations of the same described holon or holon family impose incompatible or tensioned constraints, objectives, admissibility conditions, tempos, resource allocations, information paths, or assurance requirements. Examples include declared system levels, declared episteme levels, aggregation scopes, typed control layers, declared organizational scopes, work scopes, evidence scopes, system scopes, environment scopes, description-use scopes, publication-use scopes, or other declared scopes. A selected structure matters here only when it carries, separates, or relates the declared levels or scopes. A conflict between structures belongs in C.30.ILC only when those structures are assigned to different declared holon levels, declared scopes, scale windows, or coarse-graining steps; a same-level, same-scope, or unassigned conflict between structures belongs elsewhere until a level, scope, scale-window, or coarse-graining assignment is recovered.
FrustrationResidual applies when a persistent cross-scope or interlevel residual remains after local repairs have been attempted or deemed insufficient: local optimization in one declared holon level or declared scope improves local fit while degrading, blocking, or destabilizing another declared holon level, declared scope, or level-bearing structure relation.
ComplexityGrowthPressure is admitted only as conditional architecture pressure: reducing an interlevel residual may require adding, splitting, mediating, or stabilizing a declared holon level, declared scope, aggregation scope, interface grammar, control loop, evidence scope, work-method scope, abstraction scope, source-return scope, or declared system level when that special case is being claimed. It is not a claim that complexity is good or that complexity necessarily grows.
Entry condition: if declared holon levels or declared scopes, the selected structure or architecture structure kind that carries them, one residual-bearing locus, and one first admissible architecture move cannot be named for the described holon in context, keep the issue at ordinary problem framing or ProblemCard@Context; do not claim CrossScopeArchitectureResidualTriage@Context yet.
What goes wrong if C.30.ILC is missed: a local improvement, control layer, scale label, interface grammar, or evidence reuse is treated as whole-holon architecture adequacy while the residual moves into another declared holon level or declared scope.
What C.30.ILC buys in practice: the practitioner can keep useful conflict or frustration language as an entry label while governing the architecture residual itself: affected holon levels or scopes, the selected structure that carries them, residual-bearing locus, and one admissible architecture move or governing-pattern application.
Interlevel conflict and frustration may appear in ordinary project descriptions, but the conforming record governs the residual through declared holon levels or declared scopes, the selected structure that carries them, and a residual-bearing locus. The pattern does not create a generic level scale or U.Frustration. It asks which declared holon level, declared scope, aggregation scope, control layer, organizational scope, work scope, evidence scope, system scope, environment scope, scale window, interface grammar, allocation boundary, publication section, or source-return condition bears the residual. A system level or episteme level is a special case of a declared holon level.
Not this pattern when the issue under repair is only stakeholder negotiation, ethics, measurement, scale relation, coarse-graining relation, mathematical-lens validation, candidate generation, residual-reducing candidate-set work, final selection, causal outcome, evidence, or assurance. Use the governing pattern and keep C.30.ILC only to the architecture residual-bearing locus.
Problem
Architecture work often starts from a residual: a local fix works in one declared holon level or declared scope and fails in another. Component optimization increases whole-holon or product-line integration cost. A new module boundary reduces local complexity and increases exceptions at the product-line scope. A control layer improves local safety and creates accountability or latency claims elsewhere. A reusable evidence set reduces repeated work and hides a new source-return obligation.
The useful architecture intuition is narrower than a new Frustration kind: local optimization at one declared holon level or declared scope can create a persistent residual in another declared holon level, declared scope, or level-bearing structure relation. Depending on the claim being made, that residual is governed by C.29 only when a recoverable multilevel mapping, scale mapping, or coarse-graining mapping is being claimed; by C.31.ASAP when architecture scale preference over declared alternatives is being claimed; or by G.5 when residual-reducing candidate architecture moves form a candidate set being used. An ordinary conflict between structures is not enough for the RG lens or frustration mathematical lens, but a conflict between structures assigned to different declared holon levels or scale windows may be enough when the mapping, preserved-structure line, and lost-structure line are recoverable. The first C.30.ILC output is only the grounded triage record.
Without a pattern, teams either discuss the residual as vague complexity, treat it as ordinary stakeholder conflict, jump into measurement, use mathematical frustration language as proof, or jump to candidate generation too early. C.30.ILC keeps the first move small: identify whether the residual is architecture-shaping and name the first admissible architecture move or governing-pattern application.
The practical work is often not to draw another view. It is to assign the residual to the locus named by value that can bear it: declared holon level, declared scope, level-bearing selected structure, structure kind, constraint, characteristic or Q-bundle, evidence-reuse boundary, source-return condition, or non-architecture claim kind.
Forces
- Local optimization can be real and still be harmful at another declared holon level or declared scope.
Level,layer,scope,scale,abstraction,organization,system, andenvironmentlabels can sound precise while naming different project-side entities, relations, scopes, or claim kinds.- Frustration language can be useful because it points to incompatible constraints or fitness contributions, but it can also smuggle a physics, biology, psychology, or global-optimizer ontology into architecture prose.
- Measurement is tempting because the residual feels numeric, but a measure before declared-scope and structure-kind recovery can hide the real conflict.
- Ethics and stakeholder mediation may be present, but not every cross-scope residual is a mediation problem.
- Architecture synthesis may be needed, but a small triage output often identifies a narrower move: split scope, add mediator, add interface grammar, change allocation, expose coupling, add evidence scope, accept bounded exception, or return to source.
- The pattern is not a prescribed sequence of moves; architecture work is often case-managed through loops, checks, and dead ends.
Solution
Create a CrossScopeArchitectureResidualTriage@Context record when an architecture concern is carried by residuals across declared holon levels, declared scopes, or level-bearing structure relations.
Layer, level, tier, stack, and declared-scope labels. Declared holon level is the general level-bearing recovery field for this pattern; system level and episteme level are special cases when the described holon or selected structure makes them relevant to the claim. System level may remain as ordinary recognition language when a practitioner would naturally use it, but the record recovers the project-side scope references through declaredHolonLevelRefs or declaredScopeRefs; a system level is not the default architecture level. When the source says layer, level, tier, or stack, recover exactly one or more of: declaredHolonLevelRef, controlLayerRef, declaredSystemLevelRef, aggregationScopeRef, rateBandRef, organizationLevelRef, workEvidenceScopeRef, scaleWindowRef, or publicationSectionRef when the wording only names a document layer. A move such as splitDeclaredHolonLevel, splitDeclaredScope, or, in the special system-level case, splitDeclaredSystemLevel is admissible only when the affected declared holon level, declared scope, selected structure, declared system level, aggregation scope, control layer, organization scope, work scope, evidence scope, system scope, environment scope, rate band, scale window, publication section, or source-return condition is named. A layer label is not a structure kind, not a system level, not a rate band, and not evidence of separation by itself.
Interlevel conflict, frustration residual, and complexity-growth recovery. A conflict is architecture-shaping only when the record names the declared holon levels or declared scopes, the selected structure or structure kind that carries them, and the conflict carrier: constraint, objective, admissibility condition, tempo, resource allocation, information path, or assurance requirement. A frustration residual is architecture-shaping only when local repair or local optimization leaves a persistent residual in another declared holon level, declared scope, or level-bearing structure relation. Complexity-growth pressure is only a candidate reason to add, split, mediate, or stabilize structure when that change is expected to reduce the residual enough to justify the new cost and its own residue.
crossScopeResidualDescription is not enough by itself. A residual becomes architecture-shaping only when its residual-bearing locus is declared: hidden coupling, interface exception, control-rate conflict, scale-window loss, evidence-reuse failure, regulatory bespoke residue, work-method exception, data-semantics drift, placement or jurisdiction conflict, security trust-boundary break, or another declared locus.
Multilevel optimization boundary. [C.30.ILC](/generated/patterns/C.30.ILC) can recognize that local optimization in one declared holon level or declared scope degrades another declared holon level or declared scope. It does not optimize the architecture and does not prove that one global function exists. Use [C.29](/generated/patterns/C.29) with MLU.Description@MultilevelLearningFrustration only when the mathematical representation supplies a recoverable mapping between declared levels, scopes, scale windows, or coarse-graining steps and states what structure is preserved and lost. Conflicting structures can enter this lens only when each structure is assigned to a declared holon level, scope, scale window, or coarse-graining step and the mapping shows why the conflict is interlevel. If scale window, RG relation, coarse-graining relation, preserved structure, lost structure, or conflict residual slope becomes an architecture scale-preference claim, use [C.31.ASAP](/generated/patterns/C.31.ASAP) and keep any mathematical-lens claim in [C.29](/generated/patterns/C.29). If the practitioner needs to generate, compare, or publish residual-reducing candidate architecture moves, use [G.5](/generated/patterns/G.5) for the candidate set and [C.11](/generated/patterns/C.11) when a final local choice is being made; [C.30.ILC](/generated/patterns/C.30.ILC) stops at the residual and first admissible move. If the case is only a conflict between two selected structures with no declared multilevel mapping or scale mapping, keep it in [C.30](/generated/patterns/C.30), [C.30.ASV](/generated/patterns/C.30.ASV), [D.3](/generated/patterns/D.3), [D.4](/generated/patterns/D.4), [C.28](/generated/patterns/C.28), evidence, assurance, or decision patterns as applicable.
Anti-collapse rule: no generic frustration score, no risk-matrix residual, no stakeholder-mediation takeover, no physics or biology ontology transfer, no global-optimizer proof, no causal proof, and no assurance proof. A frustration or risk label does not govern the case until declared holon levels or declared scopes, the selected structure or structure kind that carries them, residual-bearing locus, and first architecture move are recoverable; stakeholder mediation applies [D.3](/generated/patterns/D.3) or [D.4](/generated/patterns/D.4) only when values, ethical conflict, or negotiation is being claimed.
Stop condition. Stop after CrossScopeArchitectureResidualTriage@Context when it names the residual and the first admissible architecture move. It does not measure scale preference, generate candidate architectures, mediate stakeholder conflict, or select a decision. Apply a governing pattern only when a claim kind being made exists:
D.3 and D.4 boundary. [D.3](/generated/patterns/D.3) and [D.4](/generated/patterns/D.4) handle conflict topology, values, stakeholder mediation, and ethical negotiation. [C.30.ILC](/generated/patterns/C.30.ILC) handles architecture-specific recognition: whether the conflict is borne by declared holon levels or declared scopes inside a selected structure: structural views, allocation, interfaces, control rates, work reuse, evidence reuse, scale windows, or coarse-graining loss. It is a triage and architecture-move pattern, not a negotiation pattern.
Architecture-move examples.
Worked slice A - clean module layout, bad flow. A product team redraws modules so each component has an explicit responsibility relation or enactor relation, but order-to-cash flow now crosses more work transfers and exceptions rise. [C.30.ILC](/generated/patterns/C.30.ILC) names the module structure, selected transformation-flow structure, affected work scope, cross-scope residual, and first move: expose hidden coupling or apply C.30.TFS-REL. It does not turn the exception count into a modularity measure until [C.16](/generated/patterns/C.16) or the characteristic pattern governing the characteristic under evaluation is applied.
Worked slice B - AI agent control conflict. A local agent optimizes its local objective and violates a supervisor's allowed-mode constraint. [C.30.ILC](/generated/patterns/C.30.ILC) names the agent scope, supervisor scope or control scope, control relation, local optimization claim, residual-bearing locus, and local repair attempted. The first move may be add control layer, change allocation, or apply [C.30.LCA](/generated/patterns/C.30.LCA). Safety, causality, and gate claims use their governing patterns.
Worked slice C - evidence scope residue. A reusable certification evidence set removes repeated evidence work for several product variants, but one variant has a hidden environment difference. [C.30.ILC](/generated/patterns/C.30.ILC) names the work scope or evidence scope and source-return condition. It applies [A.10](/generated/patterns/A.10) or [G.6](/generated/patterns/G.6) when an evidence-validity claim is being made.
Worked slice D - frustration residual before synthesis. Several decompositions reduce local module work but each creates a different integration, control-rate, or evidence-reuse residual in another declared scope. [C.30.ILC](/generated/patterns/C.30.ILC) records the residuals and first architecture moves. If the team needs a residual-reducing candidate palette, [C.30.ILC](/generated/patterns/C.30.ILC) stops and applies [G.5](/generated/patterns/G.5) to the candidate set. If the team claims a multilevel-learning lens or frustration lens, [C.29](/generated/patterns/C.29) carries the lens-use fields and stop condition only after the level mapping, scope mapping, scale-window mapping, or coarse-graining mapping and preserved structure and lost structure are recoverable.
Archetypal Grounding
Bias-Annotation
- Local-success bias. A local improvement is treated as whole-architecture improvement. Repair by naming the wider declared holon level or declared scope and the residual.
- Pseudo-level bias.
Level,layer, orscopesounds precise but no declared holon level or declared scope exists. Repair throughdeclaredHolonLevelRefsordeclaredScopeRefs. - Generic-structure-conflict bias. A conflict between selected structures is treated as interlevel conflict even though no declared holon level, scale window, or coarse-graining relation is recoverable. Repair by keeping the case in
C.30,C.30.ASV, or the governing pattern unless the structures are assigned to different declared holon levels or scale windows. - Frustration-ontology bias. A useful conflict or frustration entry label becomes a new first-order architecture kind, physics ontology, biology ontology, or psychology claim. Repair by recovering declared holon levels or declared scopes, the level-bearing structure, conflict carriers, residual-bearing locus, and the governing pattern for any lens, proof, evidence, mediation, or synthesis claim.
- Global-optimizer bias. Local optimization in one declared holon level or declared scope is used as if the architecture literally optimizes one global function. Repair by keeping the local optimization claim as a triage input unless
C.29supplies an admissible mathematical-lens use with recoverable level mapping or scale mapping and the candidate-set or decision pattern carries any synthesis or selection claim. - Measurement-first bias. A residual is measured before its level-bearing structure and scope grounding are declared. Repair by applying
C.16or the characteristic pattern governing the characteristic under evaluation only after triage names the affected characteristic or measurement relation. - Mediation-default bias. Every conflict is treated as stakeholder conflict. Repair by checking whether the use under repair is architecture structure, allocation, interface grammar, control, work or evidence scope, source-return, or another declared level-bearing architecture relation.
- Synthesis-jump bias. A local residual immediately triggers candidate generation. Repair by identifying the first admissible architecture move before applying
G.5to a residual-reducing candidate set.
This checklist verifies the preceding guidance after the practitioner has chosen the selected move; it is not a required project control form and not a substitute for the card, note, view, relation, or repair move above.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
The gain is an early architecture move that is small and precise. The practitioner can preserve useful problem language such as conflict, frustration, level, layer, or local optimization while recovering the FPF fields that keep the claim reviewable.
The cost is that C.30.ILC refuses to solve the whole problem. It identifies the first architecture move or governing-pattern application. Measurement, scale relation, RG relation, coarse-graining relation, mathematical lens use, stakeholder mediation, candidate generation, evidence, assurance, and final choice remain outside until those claims are being made.
This makes multilevel optimization usable rather than decorative. C.30.ILC identifies the residual that makes optimization relevant; C.29 carries an admissible mathematical-lens use only when level mapping or scale mapping and preserved structure and lost structure are recoverable; G.5 carries residual-reducing candidate sets; and the decision pattern carries any final selected architecture.
Rationale
Interlevel conflict and frustration are useful Plain entry labels because they point to a recurrent architecture failure: local repair in one declared holon level or declared scope leaves a residual in another. They are dangerous as generic labels because they can hide which level, scope, level-bearing structure, relation, conflict carrier, or source-return condition bears the residual.
A local optimum or successful local repair is therefore not treated as whole-architecture adequacy. It becomes architecture-relevant only when the residual-bearing locus is recoverable and the next move can be named.
C.30.ILC keeps the entry label but recovers the architecture relation or structure claim. It treats conflict or frustration as architecture-shaping only when declared holon levels or declared scopes, the level-bearing structure, conflict carriers, and residual-bearing loci are named. This lets FPF preserve the practical intuition without introducing a second ontology of levels, a hidden measurement pattern, a physics or biology transfer, a global optimizer proof, or a prescribed architecture work order.
SoTA-Echoing
Relations
- Builds on
C.30andC.30.ASVfor grounded architecture, selected-structure, and structural-view adequacy. - Uses
A.22for structure and structural-view discipline. - Coordinates with
C.30.TFS-REL,C.30.LCA,A.6.F, andA.6.Mwhen the residual concerns flow, control, function, allocation, module, or interface structure. - Applies
C.16or the characteristic pattern that governs the characteristic under evaluation for measurement or characteristic claims. - Applies
C.29withMLU.Description@MultilevelLearningFrustrationonly when multilevel learning or frustration is used as a mathematical lens with recoverable level mapping or scale mapping and preserved structure and lost structure; appliesC.31.ASAPfor architecture scale-preference claims andC.29for mathematical-lens claims when scale, RG, coarse-graining, preserved structure, lost structure, or scale-window adequacy is being claimed. - Applies
G.5for candidate generation and residual-reducing candidate architecture moves. - Applies
C.11for final local choice,C.28for causal outcome claims,A.10,B.3, orG.6for evidence or assurance, andD.3orD.4for ethical or stakeholder mediation.
Neighboring claims stay with their governing patterns: C.30 for grounded architecture and selected-structure adequacy, C.30.ASV for structural-view adequacy, A.22 for structure and structural-view discipline, C.30.TFS-REL for architecture-transformation-flow relation, C.30.LCA for control-structure view relation, A.6.F for function-use repair, A.6.M for module-interface repair, C.16 or the local characteristic pattern for the characteristic under evaluation, C.29 for mathematical-lens use, C.31.ASAP for architecture scale-preference, G.5 for candidate-set generation, C.11 for final local choice, C.28 for causal use, A.10, B.3, or G.6 for evidence or assurance, and D.3 or D.4 for ethical or stakeholder mediation. C.30.ILC governs only cross-scope architecture residual triage.
C.30.ILC:End
C.30.TFS-REL - Architecture Transformation-Flow Structure Relation
Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative Tech-name:
ArchitectureTransformationFlowStructureRelation(relation record) Plain-name: architecture transformation-flow structure relation Governed object: the architecture-side relation fromArchitectureOf@Context, selected architecture-relevant structure, architecture structural view, or conditional architecture-description use to one selectedTransformationFlowStructureunderE.18.
C.30.TFS-REL:1 - Problem frame
Use this pattern when an architecture discussion depends on a selected TransformationFlowStructure, its path, path slice, crossing, flow valuation, edition pin, plane pin, context pin, no-hidden-scalarization claim, or mathematical description.
The first useful move is small. ArchitectureTransformationFlowStructureRelation@Context is a C.30-side relation record for a relation being used between ArchitectureOf@Context, selected architecture-relevant structure, architecture structural view, or conditional ArchitectureDescription@Context use and the E.18 selected transformation-flow structure being used for architecture work. It names the architecture locus, selected structure or view reference when used in the relation, conditional description reference when durable description use is being made, any functional structure view, view-local functional element record, functional behavior, transformer-side filler, candidate bearer, input condition, output condition, functional port, E.18 selected structure, mathematical description, math-lens use, correspondence, source-return condition, and admissible architecture use that changes the relation.
Ordinary minimum: name at least one architecture-side reference (architectureClaimRef, selectedArchitectureStructureRefs, architectureStructuralViewRef, or architectureDescriptionRef when durable description use is being made), at least one E.18-side reference (transformationFlowStructureRef, selectedPathOrSliceRefs, crossingBundleRefs, or flowValuationRefs), one blocked overread, and stop or governing-pattern application. Use functional-structure, functional-element, functional-behavior, transformer-side filler, candidate-bearer, input-condition, output-condition, functional-port, transformation-flow-structure, mathematical-description, math-lens-use, crossing, flow-valuation, correspondence, and source-return fields only when they change the next architecture move. All other fields are conditional and may be not used.
Use this relation only when a grounded architecture claim, selected architecture-relevant structure, architecture structural view, functional-architecture view, transformation-flow-structure claim, or conditional architecture-description use depends on an E.18 selected structure, path, crossing, or valuation relation. Stop when the architecture-to-transformation-flow relation and non-admissible uses are clear. If another claim is being made, that claim is governed by its governing pattern and this relation remains only the architecture-to-transformation-flow relation.
What goes wrong if this pattern is missed: a transformation-flow diagram, graph-shaped mathematical description, path slice, or flow valuation becomes functional architecture, whole architecture ontology, performed-work occurrence, work-result record, evidence, gate passage, or project decision by appearance.
What this buys in practice: the practitioner can use E.18 for selected transformation-flow structure while C.30 remains the grounded architecture and selected-structure adequacy locus and C.30.ASV remains the architecture-structural-view locus.
Not this pattern when the question under repair is a selected transformation-flow structure, mathematical description, path, crossing, or flow valuation without a relation being used for grounded architecture adequacy, conditional architecture-description use, or an architecture structural view. Use E.18 directly for the selected structure. Use E.18.2 when the mathematical-description claim is current and C.29 when the math-lens-use claim is current. If the question under repair is an architecture claim or durable architecture description without a transformation-flow-structure relation, use C.30. If it is a functional view without transformation-flow relation, use C.30.ASV and A.6.F. If another claim being made is present, use the governing pattern and keep C.30.TFS-REL only to the architecture-to-transformation-flow relation.
C.30.TFS-REL:2 - Problem
Grounded architecture claims, selected architecture-relevant structures, architecture structural views, and conditional architecture descriptions often need E.18 objects when they discuss transformation-flow structure, functional dependencies, data movement, control paths, evidence-flow descriptions, neural-network dataflow, or code-agent relation graphs.
C.30.TFS-REL prevents collapse by requiring the selected architecture-side reference, such as ArchitectureOf@Context, structure ref, structural view, or conditional description use, before any E.18-governed selected transformation-flow structure, path, slice, crossing, or valuation gets architecture use.
C.30.TFS-REL:3 - Forces
C.30.TFS-REL:4 - Solution
C.30.TFS-REL is the C.30 entry relation to E.18 when a grounded architecture claim, selected architecture-relevant structure, architecture structural view, or conditional architecture description uses selected TransformationFlowStructure, path, crossing, or flow-valuation objects as an architecture-relevant transformation-flow relation.
It supplies only the architecture-to-transformation-flow relation:
At least one architecture-side field and at least one E.18-side field must be named by value. Optional fields stay not used unless they change inspection, correspondence, source return, governing-pattern application, or stop.
C.30.TFS-REL:4.1 - Use trigger
Use this pattern only when a ArchitectureOf@Context claim being made, selected architecture-relevant structure, architecture structural view, functional-structure view, transformation-flow-structure claim, or conditional ArchitectureDescription@Context use depends on one or more E.18 objects:
TransformationFlowStructureRef;PathIdorPathSliceId;CrossingBundleRef;U.Transferflow valuation;- edition, plane, or context pin;
- no-hidden-scalarization or set-return discipline;
- correspondence between functional structure and transformation-flow structure;
- generated or extracted relation graph used as architecture-to-transformation-flow source material.
If the sentence only says that work occurred, use A.15 or the governing work pattern. If the sentence only says that a selected transformation-flow structure exists, use E.18. If the sentence uses a graph-shaped expression as mathematical description, use E.18.2. If it relies on a mathematical lens, use C.29.
C.30.TFS-REL:4.2 - Relation to functional structure
FunctionalStructureView@Context under C.30.ASV may cite ArchitectureTransformationFlowStructureRelation@Context when a transformation-flow relation is being used. That relation does not make the selected E.18 structure a functional element and does not make a functional element identical with the system, module, method, or flow. It says that a functional structure view, functional behavior, or selected functional element corresponds to, is declared relative to, or positively co-refers with one E.18 selected structure, path, crossing, or valuation relation under a named context.
FunctionalElement@Context is a view-local functional-structure record governed by C.30.ASV, not a new root kind. It is current only when C.30.ASV has a selected functional structure view, bounded context, functional behavior, and bearer or candidate-bearer locus. Its functional behavior may be a bounded U.Transformation or a compound TransformationFlowStructure; its transformer-side filler is recovered through A.3.4 when a transformer claim is current; its module relation is allocation or correspondence through A.6.M. A graph-shaped expression, path, valuation, or flow packet is therefore not the functional element by default.
Use this note when the practitioner needs to see whether the function-to-transformation-flow relation changes inspection, split, relation-making, downgrade, claim-governance assignment named by value, candidate generation, or stop. Use C.30.ASV for the functional structure view, A.6.F for function-like wording recovery, A.3.4 for bounded transformation and transformer slots, A.6.M for module-allocation claims and module-correspondence claims, and E.18 for selected transformation-flow structure.
C.30.TFS-REL:4.3 - Claim-kind applications named by value
This table is the single boundary for generic non-flow claims. Elsewhere in this pattern, keep only blocked local overreads that the transformation-flow relation itself makes tempting: structure-as-architecture, graph-description-as-architecture, flow-as-work-log, crossing-as-gate, valuation-as-score, generated relation-graph proof, and prompt-data-tool flow as authority proof.
C.30.TFS-REL:4.4 - E.18 selected-structure boundary statement
For an E.18-governed selected TransformationFlowStructure used by ArchitectureOf@Context, selected architecture-relevant structure, architecture structural view, or conditional ArchitectureDescription@Context, an architecture-to-transformation-flow relation may cite the selected E.18 structure over the described holon plus MVPK faces and correspondences.
Grounded architecture adequacy and conditional architecture-description use are governed by C.30. E.18 supplies selected transformation-flow structure objects and relations; it does not define all architecture structure kinds.
This is the named E.18 selected-structure boundary statement for this relation. It is not a second E.18 source of truth and does not depend on a section number staying stable.
C.30.TFS-REL:4.5 - Worked slices
Functional architecture with a transformation-flow relation being claimed. A team says, "The functional architecture is this flow diagram." The repair is:
Filled relation record:
Near miss: if the selected transformation-flow structure has no C.30-side architecture reference named by value, the case stays in [E.18](/generated/patterns/E.18). If the same sentence is a mathematical description, use [E.18.2](/generated/patterns/E.18.2); if it is a math-lens-use claim, use [C.29](/generated/patterns/C.29). If it is a work log, evidence claim, gate decision, or benchmark result, that non-flow claim is governed by its governing pattern and this relation keeps only the architecture-to-transformation-flow relation.
Pump-station flow relation. A plant team says, "the safety architecture is the bypass flow." C.30.TFS-REL applies only if the plant ArchitectureOf@Context, selected control or material-flow structure, and E.18 selected bypass-flow structure are named. The bypass path may be architecture-relevant, but it is not safety proof, performed maintenance work, gate passage, or release permission. The relation record names the plant architecture locus, selected E.18 path or crossing, source-return condition, and the one architecture move changed by the bypass relation.
Supply-chain transformation-flow relation. A logistics architecture view may use an E.18 selected flow structure for supplier handoff, transport crossing, freshness window, and valuation. The architecture claim remains about selected supply-chain structure; work occurrences, contractual commitments, evidence, and gate decisions stay with their governing patterns.
Neural-network dataflow change. Source labels such as attention block, SSM block, convolution block, memory mechanism, cache mechanism, and MoE expert-selection go through [C.30.STRAT](/generated/patterns/C.30.STRAT) unless the changed value is already recovered. C.30.TFS-REL applies only when the changed structure kind and transformation-flow relation are named. A benchmark, ablation, or pruning result may bear on a non-architecture claim named by value, but it does not make the flow relation an architecture decision or evidence sufficiency by itself.
Code-agent relation graph. A code-agent relation graph with IMPORTS, CALLS_API, REGISTRY_WIRES, or DATA_FLOWS_TO edges can be used for an architecture-to-transformation-flow relation only with source edition, a source observation class selected from {observed, inferred, unknown}, typed relation semantics, unexplored regions, and source-return condition when subsequent action relies on hidden distinctions.
C.30.TFS-REL:4.6 - Lowering and currentness conditions
Lower, narrow, or reopen the relation at the smallest changed locus when:
- E.18 selected structure, path, crossing, or flow-valuation semantics change;
- edition, plane, context pin, set-return, or no-hidden-scalarization discipline changes;
- source graph edition, path slice, source observation class, source pin, unexplored region, or source-return condition changes;
- the C.30 architecture locus, selected architecture-relevant structure, architecture structural view, conditional architecture description, or C.30.ASV relation changes;
- functional-to-transformation-flow correspondence changes;
- a non-flow claim is being made and is governed by
C.30.TFS-REL:4.3rather than by this relation; - C.29, C.16, C.28, A.10, G.6, B.3, A.20, A.21, A.15, C.30, C.30.ASV, A.6.F, C.30.STRAT, or E.18 changes the governing boundary used by the relation.
Admissible repair results are: update the affected reference, add or change correspondence, add or change source-return condition, narrow admissible use, keep the selected-structure claim inside E.18, keep the mathematical-description claim inside E.18.2, keep the math-lens-use claim inside C.29, apply the governing pattern to a non-flow claim, lower to quote-only or reduced-use cue, or block the architecture-to-transformation-flow use.
C.30.TFS-REL:5 - Archetypal Grounding
C.30.TFS-REL:6 - Bias-Annotation
Lenses tested: Arch, Onto, Epist, Prag, Did, Gov. Scope: architecture-to-transformation-flow relations using E.18 objects.
This checklist verifies the preceding guidance after the practitioner has chosen the selected move; it is not a required project control form and not a substitute for the card, note, relation, or repair move above.
C.30.TFS-REL:7 - Conformance Checklist
C.30.TFS-REL:8 - Common Anti-Patterns and How to Avoid Them
C.30.TFS-REL:9 - Consequences
C.30.TFS-REL:10 - Rationale
E.18 is the governing FPF pattern for selected transformation-flow structures, paths, crossings, flow valuations, and related pins. Architecture needs to use that work without letting it become generic architecture ontology. The smallest stable relation is therefore a C.30-side record that points to E.18 objects and states admissible and non-admissible architecture use.
This pattern also protects functional architecture. A functional structure view may correspond to a transformation-flow structure, and in some cases both may refer to the same selected U.StructureRef; that identity is not automatic. The relation is useful precisely because it preserves the difference while allowing correspondence or positive co-reference.
C.30.TFS-REL:11 - SoTA-Echoing
Currentness front. The governing currentness sources are E.18 object semantics and pins, C.30 and C.30.ASV architecture-side relation law, the source observation class, and the non-flow governing patterns named in C.30.TFS-REL:4.3. When one changes, the relation changes only at the affected reference, correspondence, source-return condition, admissible-use boundary, or governing-pattern assignment.
C.30.TFS-REL:12 - Relations
Builds on: C.30, C.30.ASV, A.22, A.6.F, E.18, E.17, E.17.0, A.7, E.10, C.2.P, and F.18.
Coordinates with: C.30.STRAT, A.15, A.20, A.21, A.10, G.6, B.3, C.28, C.29, C.16, admitted measurement, selection, or candidate-set governing patterns when those claims are being made, A.6.M module-and-interface repair, A.6.5 slot discipline, and A.6.0 when a signature declaration is being made.
Related claims stay with their governing patterns: C.30.STRAT for stratification wording and source-label repair, E.18 for selected transformation-flow structure, path, crossing, and flow-valuation discipline, E.18.2 and C.29 for mathematical descriptions and lens-use claims, C.30 for grounded architecture and selected-structure adequacy, C.30.ASV for architecture structural-view adequacy, A.6.F for function-use repair, and the non-flow governing patterns named in C.30.TFS-REL:4.3. C.30.TFS-REL governs only the architecture-to-transformation-flow-structure relation being claimed.
C.30.TFS-REL:End
Modularity and Reusable Structure Characteristics
Type: Characterization pattern Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
Use this pattern when modularity or reusable-structure language is doing work in an architecture discussion and the practitioner needs to know which few characteristics matter, what repair follows, and whether any measurement or comparison is admissible.
The first useful move is deliberately small:
Start with recognition, at most three characteristics under evaluation, the observed problem, and a repair direction. A report-only proxy is an admissible stop when no beyond-local-repair use is being made.
Claim-use boundary: comparison, publication, evidence, assurance, gate, decision, benchmark, causal-use, cross-case reuse, selection, procurement, and architecture scale-preference are beyond-local-repair uses in C.31. Add their fields only when that use is being made and recoverable by value and the governing pattern can be named.
What goes wrong if C.31 is missed: "modular" becomes a binary label; a single modularity score hides incompatible characteristics; interface publication is confused with substitutability; internal cohesion is improved while evidence reuse gets worse; bespoke residue moves from templates into work or assurance; and complexity language becomes a commensurable score without a declared characteristic, scale, measurement basis, comparison basis, or admissible-use boundary.
What C.31 buys in practice: the practitioner can see which modularity characteristic changes the next move, which false use is blocked, which repair is plausible, and which governing pattern governs measurement, evidence, causal, scale, selection, or accounting claims.
Not this pattern when the question under repair is only source-label recovery, module-interface relation repair, reusable-structure accounting, general measurement legality, quality-family claim, architecture scale-preference claim, mathematical-lens use, candidate architecture synthesis, or selection. Use [C.30.STRAT](/generated/patterns/C.30.STRAT), [A.6.M](/generated/patterns/A.6.M), [C.31.RSA](/generated/patterns/C.31.RSA), [C.16](/generated/patterns/C.16), [C.25](/generated/patterns/C.25), [C.31.ASAP](/generated/patterns/C.31.ASAP), [C.29](/generated/patterns/C.29), [G.5](/generated/patterns/G.5), or [C.11](/generated/patterns/C.11) as appropriate; do not treat C.31 as the synthesis or selector pattern.
Problem
Architecture work often asks for more modularity, better reuse, lower coupling, more explicit interfaces, cleaner allocation, or less bespoke residue. These phrases point to real engineering work, but they do not name one scalar property.
Modularity can improve along one characteristic while worsening another. A design can reduce external coupling and increase interface alphabet size. A platform can standardize interfaces and create unhelpful rigidity. Evidence reuse can improve while functional-to-module allocation remains tangled. A report can show a high reuse share while hiding source-return work or residual uncertainty.
C.31 turns modularity talk into a small characteristic vector plus repair direction. It does not promise that every characteristic is measurable now, comparable across cases, causal, admissible for decision use, or evidence-backed.
Forces
Solution
C.31 governs modularity and reusable-structure characteristics as C.16-compatible characteristic heads, composite descriptions, lens-backed characteristic interpretations, temporal or scale-sensitive characteristic interpretations, causal-use-sensitive characteristic interpretations, or report-only proxies. It starts from action guidance and adds fields for beyond-local-repair use only when a use being made requires them.
Ordinary output: ModularityVectorLite
ModularityVectorLite is the ordinary output. It names at most three characteristics under evaluation because the first task is to find the next repair, not to audit all possible modularity interpretations.
The vector is complete enough when it states what can be done next and what cannot be inferred. If a characteristic is used beyond local repair, use the appropriate card and governing pattern; architecture scale-preference claims are governed by [C.31.ASAP](/generated/patterns/C.31.ASAP).
Filled ModularityVectorLite
Near miss: a high interface-standardization count alone is not a C.31 improvement. If field-service work, source-return events, or variant-specific evidence increase, the vector records that proxy divergence and returns to repair rather than treating the count as architecture quality.
Characteristic classes
Every C.31 head is classified before use:
In C.31, declared basis and comparability basis name C.16-compatible measurement or comparison fields. They are not generic reason words and are not substitutes for evidence, assurance, cause, source, decision, or architecture-description relations.
Measurement-head mapping
When a head becomes decision-facing or publication-facing, create MeasurementHeadMapping before relying on it:
This mapping is not a measurement template by itself. It prepares a C.16-compatible characteristic card or a report-only boundary. When the head is decision-facing or publication-facing, the mapping names required evidence plus at least one evidence path or source relation. If no evidence claim is being made, evidenceClaimAbsentBecause states why the head remains local, report-only, or repair-only.
C.31 characteristic card
Use the full card only when the use goes beyond local repair:
Each card states its own C.16 well-formedness fields: characteristic, scale, unit or unitless interpretation, declared measurement basis, comparability basis, evidence path or evidence-claim-absent reason, non-admissible use, and repair move. When source material is used as evidence, the source relation is named. A source checklist, source-discharge slice, dashboard label, or inherited score is not enough.
Seed characteristic heads and repair moves
These heads are seeds, not an exhaustive taxonomy. Use only the heads that change the next move.
Claim-scoped residual heads
C.31 uses residual heads only as qualitative repair cues. These heads do not create one complexity characteristic.
Proxy-risk discipline
Every decision-facing C.31 card includes ProxyRisk and AuditQuestion. If the proxy diverges from the value it was meant to represent, the card stops at report-only use or returns to repair.
Rejected shortcut
The expression ModularityScore = average(all measures) is not admissible as a C.31 result. A local score is admissible only when the scoring method, codomain, polarity, characteristic basis, comparability basis, and use boundary are disclosed through the governing scoring or comparator pattern. Without that, keep the result as report-only or return to ModularityVectorLite.
Lowering and currentness conditions
Lower or reopen a ModularityVectorLite, ModularityCharacteristicCard, or report-only proxy when any of these conditions changes the characteristic use:
- proxy audit worsens, such as more integration failures, workarounds, source-return events, stale evidence reuse, or bounded exceptions;
- measurement basis, comparability basis, scoring method, codomain, polarity, unit policy, or declared characteristic basis changes;
- evidence path, source relation, evidence-claim-absent reason, or source-return condition changes;
- described holon, bounded context, architecture claim, structure kind, characteristic head, or repair direction changes;
- a report-only proxy is used for comparison, selection, publication, assurance, benchmark, causal-use, cross-case reuse, decision, procurement, or architecture scale-preference;
C.31.RSA,C.31.ASAP,C.16,C.25,C.29,C.30.STRAT,A.6.M,C.30,C.30.ASV,A.10,B.3,A.20,A.21,G.5, orC.11changes the boundary for the neighboring claim being made.
Admissible repair results are: keep the result report-only, split or rename the characteristic head, update basis or evidence fields, revise the repair direction, change relatedClaimGovernanceIfClaimed, lower a score to a local proxy, or stop C.31 use for the beyond-local-repair claim and use the governing pattern.
Archetypal Grounding
Tell. Modularity is a vector of action-guiding characteristics, not a magic scalar. A good C.31 interpretation says what to repair next.
Show. A product architecture can have high interface standardization and still poor substitutability. A software-system architecture can reduce external coupling while increasing hidden data custody. A safety-case architecture can reuse evidence while increasing regulatory bespoke residue. Each case needs a different characteristic and a different repair.
Show. A DSM or dependency graph can substantiate a modularity interpretation, but the graph does not by itself say which dependency kind matters, what scale applies, whether the interpretation is comparable, or what action follows.
Holon and episteme: architecture and modules are selected structures of described holons; the described holon may be a system, episteme, method, organization, publication family, or another structured holon. C.31 heads, cards, vectors, and report-only proxies are characteristic records, declared-measurement-basis records, comparability-basis records, or report-only records about those structures.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Benefits:
- Modularity becomes action-guiding without becoming one fake score.
- Cheap repair remains possible before measurement.
- Characteristic, declared-measurement-basis, comparability-basis, proxy-risk, and governing-pattern boundaries are visible.
- DSM, MOSA, platform, product-line, and architecture-operation sources can inform practice without importing their ontology wholesale.
Costs:
- Familiar score language often has to be downgraded to report-only use.
- Cross-case comparison requires additional C.16, C.25, G.2, comparator, evidence, or decision claim.
- Some attractive "complexity" statements are assigned to characteristic named by value, lens, or residual cue rather than becoming a general complexity pattern here.
Rationale
C.31 is a characterization pattern because modularity and reusable-structure talk changes engineering action through characteristics: coupling, cohesion, interface variation, substitutability, reuse, evidence reuse, hidden coupling, source-return cost, and residual growth. Those heads are useful only when their subject, scale, declared measurement or comparison basis, false use, and repair move are visible.
The pattern puts ModularityVectorLite first to preserve affordability. Many practitioners need to see one relation to repair, one interface grammar to tighten, or one residue to account for. Requiring the full measurement apparatus too early would turn C.31 into a control form and would violate the architecture source invariant: repair succeeds only when one useful admissible action remains.
The pattern rejects a single complexity or modularity score because selected heads are not automatically commensurable. When a local score is genuinely useful, it belongs under disclosed scoring, comparator, characteristic, declared-measurement-basis, and governing-pattern discipline.
SoTA-Echoing
Source-currentness front. Use the table's Currentness or lineage use cell as the source-use boundary. A lineage row can explain why a characteristic family matters, but it cannot establish current comparison, procurement, assurance, benchmark, decision, publication, or other beyond-local-repair use without a current source relation under G.2 or the governing pattern for that use. Refresh the source use when MOSA or acquisition guidance changes, platform or product-line practice changes, DSM or modularity-index practice changes, queueing or coordination-overhead assumptions change, proxy-pressure law is used for a new claimed value relation, or architecture-operation language is used as current practice rather than as source-side recognition language. When refresh changes the source role, update the affected characteristic head, proxy-risk field, audit question, related claim governance, or report-only boundary rather than treating the older source as current by default.
Rows named current, such as MOSA guidance, current platform practice, current scalable-workload extensions, or current architecture-operation corpus material, require source refresh before beyond-local-repair use when the named practice changes. Rows named lineage stay lineage unless a current source relation is explicitly recovered.
Older or local sources may serve as lineage or worked examples only when the row says so. They do not stand in for current competitive source, and they do not make a modularity value admissible for beyond-local-repair use without the governing pattern for that use.
Relations
C.31:End
Reusable Structure Accounting
Type: Characterization pattern Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
Use this pattern when a practitioner needs to locate where reusable structure lives, where bespoke residue grows, which accounting basis is being used, what can be refactored, and what remains a bounded exception or source-return condition. A report-only share stays report-only unless the relevant outside-RSA use is governed by its governing pattern.
Claim-use boundary: comparison, publication, evidence validity, assurance or safety-case reliance, gate use, architecture scale preference, causal-use, selected-set publication, candidate-synthesis, and local decision are outside-RSA uses. C.31.RSA may state the reusable locus, bespoke residue, accounting basis, report-only share, repair direction, and source-return condition. Add those other claims only under their governing patterns when those claims are being made.
The first useful move is ReusableStructureTriage:
Use the fuller accounting description only when an accounting basis and structure references are declared. Ordinary use stops when the practitioner knows where reusable structure lives, where bespoke residue grows, what can be refactored, and what remains a bounded exception.
What goes wrong if C.31.RSA is missed: a reusable share is treated as a proof of modularity; one-off work is hidden under a reuse label; evidence reuse is counted without validity context; hidden residual uncertainty is averaged with reusable templates; and "more reusable structure" is treated as always better.
What C.31.RSA buys in practice: the practitioner can state where structure is reusable, where it is bespoke, what source-side distinctions must remain reachable, and when the result is only report-only accounting.
Not this pattern when the question under repair is source-label recovery, module-interface relation repair, modularity-characteristic selection, measurement or comparability legality, architecture scale preference, mathematical-lens use, or any outside-RSA use named above. Use [C.30.STRAT](/generated/patterns/C.30.STRAT), [A.6.M](/generated/patterns/A.6.M), [C.31](/generated/patterns/C.31), [C.16](/generated/patterns/C.16), [A.10](/generated/patterns/A.10), [B.3](/generated/patterns/B.3), [G.6](/generated/patterns/G.6), [C.31.ASAP](/generated/patterns/C.31.ASAP), [C.29](/generated/patterns/C.29), [G.5](/generated/patterns/G.5), or [C.11](/generated/patterns/C.11) as appropriate; do not treat C.31.RSA as the synthesis or selector pattern.
Problem
Architecture teams often say that structure is reusable, repeated, templated, common, standardized, or bespoke. Those phrases are useful, but they do not say what is being counted, described, or compared. Structure can be selected from functions, flows, control relations, module interfaces, work methods, evidence packages, regulatory arguments, data schemas, deployment constraints, or exception networks.
Functional, flow, control, module-interface, work, evidence, and assurance structures may be included only when their declared accountingBasisRef and evidence relation named by value, assurance relation, source relation, or source-return condition are declared when those relations are being claimed.
The practical question is: which reusable loci matter, which bespoke residue remains, what source distinctions are lost by accounting, and what repair or source return follows?
Forces
Solution
C.31.RSA governs reusable-structure accounting as a typed description over declared structures and structural aspects. It starts with ReusableStructureTriage; it uses ReusableStructureAccountingDescription@Context only when the accounting basis is declared.
Typed accounting description
accountingBasisRef states the accounting rule being used: description length, dependency edges, work items, evidence package count, cost share, template instances, interface variants, regulatory case sections, or another declared accounting rule. The accounting rule is not implied by the word "reuse".
Well-formedness: every slot is over declared structureRefs, declared structuralAspectRefs, and one declared accounting basis. Slot labels are explanatory; they are not root kinds and are not automatically commensurable.
Explanatory slot labels
A local accounting description may use explanatory slot labels such as:
These labels are local slots, not FPF ontology. H_residual is residual uncertainty or unmodelled variance under the accounting basis. It is not obviously the same unit as interface grammar, work template, evidence package, or regulatory argument.
Report-only shares
Numeric shares require a declared accountingBasisRef, declared scale or unitless-value rule, unit when relevant, polarity when relevant, admissible comparability relation, and comparator admission named by value such as CG-Spec, ComparatorSetRef, or a comparator-governing reference named by value before they can guide outside-RSA use such as comparison, ranking, selection, gate use, or decision use. Without that, the share remains local report-only guidance.
Pseudo-sum boundary
An explanatory decomposition may be useful:
This is not ReusableStructureEquation, not an architecture amount, and not a hidden StructureAmount kind. It is a readable decomposition of one declared accounting description. If the slots do not share a declared accounting basis and comparability rule, they cannot be summed or ranked.
Structure-relocation moves
RSA is useful because it points to relocation and repair moves:
High reusable structure is not always good. The architecture question is where structure lives and what action follows: reusable templates, interfaces, flows, control relations, work methods, evidence packages, or unique exception networks and hidden coupling.
After a relocation or reuse move, ask what got worse:
The result is not "more reuse is better." A conforming RSA move states the reusable locus, the bespoke or residual locus, the accounting basis, the first repair direction, and the first cost, loss, or source-return condition that can make the move inadmissible.
Triage and accounting use boundary
Use only ReusableStructureTriage when:
- there is one local case;
- no outside-RSA use is being made;
- the practitioner only needs a repair direction;
- no numeric share is being relied on.
Use ReusableStructureAccountingDescription@Context when:
- the accounting basis is declared;
- a report-only share is useful;
- structure refs or structural aspects need to be compared inside one declared
accountingBasisRef; - source-return conditions matter;
- reusable structure or bespoke residue is used for outside-RSA use such as cross-case report, publication, assurance, architecture scale preference, or decision.
Reopen and lowering conditions
An RSA result remains valid only inside its declared accounting basis, structure edition, source-return condition, and comparator admission. Reopen the triage or lower the admissible use when any of the following changes:
- a hidden source distinction becomes action-relevant;
- the accounting basis changes or proves heterogeneous;
- the selected structure, structural aspect, interface grammar, evidence package, work method, or assurance argument changes edition;
- a comparator set, CG-Spec, or outside-RSA use is added after a report-only share was recorded;
- downstream reliance uses the RSA result for outside-RSA evidence, assurance, gate, causal-use, scale-preference, or decision work that the RSA note did not admit;
- evidence validity, assurance window, or source-return condition decays;
- a local bounded exception becomes repeated enough to require refactoring;
- a reuse move improves one locus while worsening interface cost, variation loss, evidence decay, assurance work, source-return cost, or hidden bespoke residue.
Lower the result to report-only when outside-RSA comparison, ranking, selection, gate use, or decision use lacks comparator admission named by value. Lower it to quote-only or source cue when the accounting basis cannot be recovered. Mark it blocked when the reusable locus and bespoke-residue locus cannot be separated.
Archetypal Grounding
Tell. Reusable structure is not a substance. It is structure located in declared places under a declared accounting basis.
Show. In one architecture, reusable structure may be located in a template and interface grammar. In another, it may be located in a test package, regulatory argument, work method, or flow pattern. In a third, the reusable part may be small, but the bounded exception is exactly what preserves safety or local fit.
Show. A share can be useful as a local report. It becomes misleading when it hides which structure was counted, which structure was not counted, and when the reader must return to source records.
Holon and episteme: the structures being accounted over are selected architecture-relevant structures in context. The RSA description, slots, report-only shares, and source-return condition are accounting descriptions, slot-bearing records, report-only records, and source-return records about those structures.
Worked case: reusable evidence package, bespoke delivery work
Situation:
ReusableStructureTriage:
Admissible move: publish the local report-only RSA note and repair the recurring delivery approval work into reusable work structure and reusable evidence structure. Non-admissible move: claim that the reusable evidence package proves every deployment or that a high reusable share makes the architecture better.
Anti-case: high share hides a bad architecture move
Situation:
This is not a successful RSA result. The accounting basis counts template instances but hides interface relation cost, lost variation, hidden bespoke work, and evidence decay. The repair is to mark the share as report-only, add the missing bespoke-residue slots, and apply A.6.M, C.31, or an characteristic pattern governing the claim to the interface relation cost before any comparison or decision use.
Lowering replay: the team tries to use the 85 percent share to rank this template architecture above another product-line variant and approve the template program. The use is lowered to local report-only accounting because the comparator set, accounting-basis alignment, interface-cost measure, source-return condition, and decision record are absent. Before comparison or decision use, A.6.M must repair the interface grammar, C.16 or A.19 must govern comparability and characteristic space, and C.11 must govern the local decision claim.
Stop condition: do not use the 85 percent share for outside-RSA ranking, gate, assurance, or decision. Reopen the RSA note when the interface grammar, exception register, or comparator set changes.
Transfer case: neural-network block replacement
Situation:
RSA can transfer from product-line architecture to neural-network architecture only after [C.30.STRAT](/generated/patterns/C.30.STRAT) has treated block, cache, and related terms as source labels unless the reusable locus is already recovered. Then RSA names the declared structures and accounting basis:
- reusable structure may be located in recovered repeated-block topology, dataflow pattern, cache-placement rule, or evaluation harness;
- bespoke residue may be located in model-specific tuning, data distribution dependence, memory-layout exception, or ablation gap;
- benchmark gain is not reusable-structure accounting by itself;
- evidence claims apply
[A.10](/generated/patterns/A.10)and[G.6](/generated/patterns/G.6); causal claims apply[C.28](/generated/patterns/C.28); mathematical-lens or compression claims apply[C.29](/generated/patterns/C.29).
Admissible move: record which recovered structural locus was reused, what changed, what source distinctions must remain reachable, and which governing pattern governs benchmark, evidence, causal-use, or mathematical-lens claims. Non-admissible move: treat "block replacement improved the architecture" as RSA proof.
Bias-Annotation
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Benefits:
- Reusable structure and bespoke residue become visible without a false architecture amount.
- Practitioners get a cheap triage before accounting.
- Report-only shares can guide repair without becoming proof.
- Evidence reuse, work repeatability, interface grammar, and bounded exceptions can be separated instead of averaged.
Costs:
- Some attractive reuse reports remain report-only.
- Numeric shares require declared
accountingBasisRef, declared scale or unitless-value rule, relevant unit and polarity, admissible comparability relation, and comparator admission named by value before they can guide outside-RSA comparison, ranking, selection, gate, or decision use. - The pattern raises a source-return question whenever accounting hides distinctions needed by downstream action.
Rationale
C.31.RSA is separate from C.31 because accounting over reusable structure has a different reusable-structure accounting question from choosing modularity characteristics. C.31 asks which characteristic changes action. C.31.RSA asks where reusable structure and bespoke residue are located under a declared accounting basis.
The pattern refuses StructureAmount because architecture is selected structure in context, not a substance. A useful accounting description can still report shares, but only under declared structure refs, structural aspects, and an accounting basis.
The pattern also keeps residue ethically and practically neutral until interpreted. Bespoke residue can be a defect, a local necessity, a safety boundary, a regulatory constraint, or a deliberately accepted exception. The repair is to name which one.
SoTA-Echoing
Source-currentness front. Use the table's Currentness or lineage use cell as the source-use boundary. Rows named current, such as ISO/IEC/IEEE 42010:2022, MOSA guidance, current product-line or variability work, GSN Community Standard v3, current safety-case reuse work, and the architecture-operation corpus material used as current practitioner language, require source refresh before outside-RSA use when the named standard, guide, practice family, or corpus role changes. Rows named lineage, such as DSM or product-architecture lineage, Eppinger and Browning lineage, Goodhart and Campbell proxy-pressure lineage, system-evolution and information-hiding lineage, and Pohl, Boeckle, and van der Linden lineage, stay lineage unless a current source relation is explicitly recovered.
Refresh or lower the RSA result when a source-role change alters the reusable locus, bespoke-residue locus, accounting basis, source-return condition, comparator admission, evidence-validity relation, assurance or safety-case reliance, architecture scale-preference relation, or any outside-RSA use. A source row may explain why an accounting distinction matters, but it does not make an RSA share current for comparison, decision, assurance, gate, or publication without the governing pattern for that outside-RSA use.
Older or local sources may serve as lineage or worked examples only when the row says so. They do not stand in for current competitive source, and they do not make an RSA share admissible for outside-RSA use without the governing pattern for that use.
Relations
C.31.RSA:End
Architecture Scale-Amenability Preference
Type: Characterization pattern Status: Stable Normativity: Normative unless explicitly marked informative
Problem frame
Use this pattern when a practitioner compares architecture alternatives under a declared scale variable or scale window and needs to avoid treating a modularity label, platform label, product-line label, reusable-structure share, or coarse-graining metaphor as an automatic scale-preference claim.
The first useful move is ScaleClaimTriage:
Ordinary use starts by naming the alternatives, the scale variable, the scale window, the claimed preference under scale, the available slope or scale-probe evidence or no-probe reason, the expected stable or improving structure, and the exception growth risk. Use ArchitectureScaleAuditRecord@Project only when the scale preference is being used to affect a comparison, selected set, publication, assurance input, or architecture decision.
What goes wrong if C.31.ASAP is missed: "modular", "platform", "product line", "reusable", "general", "open", "coarse-grained", or "RG-like" becomes a shortcut for a scale-preference claim; a locally hand-engineered solution is called debt even when safety, legality, or mission constraints justify it; exception growth is hidden until the architecture is already expensive to change; and coarse descriptions keep losing lower-scope safety or semantic distinctions without a source-return condition.
What C.31.ASAP buys in practice: the practitioner can say what is being scaled, where the scale claim holds, what structure is expected to remain stable or improve, what exceptions are allowed, what evidence or no-probe reason exists, which scale-preference claim stays in C.31.ASAP, and which governing pattern governs any lens-use, evidence, assurance, selection, or decision claim being made.
Not this pattern when the question under repair is only module-interface relation repair, modularity-characteristic selection, reusable-structure accounting, mathematical-lens use, scale-law adequacy, method preference under general BLP, candidate architecture generation, selected-set return, or final local choice. Use [A.6.M](/generated/patterns/A.6.M), [C.31](/generated/patterns/C.31), [C.31.RSA](/generated/patterns/C.31.RSA), [C.29](/generated/patterns/C.29), [C.18.1](/generated/patterns/C.18.1), [C.19.1](/generated/patterns/C.19.1), [G.5](/generated/patterns/G.5), [G.9](/generated/patterns/G.9), or [C.11](/generated/patterns/C.11) as appropriate. C.31.ASAP governs architecture scale-preference claims; it does not select the architecture, prove the scale law, or certify the project.
Problem
Architecture work often asks whether one structure will scale better than another: a product-line architecture rather than bespoke variants, an open interface rather than a closed integration, a stable flow topology rather than repeated project exceptions, or a reusable evidence package rather than repeated assurance work.
These claims are useful only after the scale relation is declared. "Scales better" can mean fewer interface grammar variants, lower exception growth, better learning transfer, more reusable templates, more stable control relations, less source-return cost, fewer regulatory exceptions, or more freedom of action. Those are not the same claim.
C.31.ASAP turns architecture scale-preference talk into a declared scale variable or window, a preference claim, evidence or no-probe reason, expected stable or improving structure, exception-growth risk, and source-return condition. It does not turn scale preference into proof, selection, assurance, causal use, or a universal law.
Forces
Solution
C.31.ASAP specializes scale-amenability preference for architecture alternatives. It applies when an architecture alternative set, scale variable or scale window, and claimed preference under scale are named.
Applicability fields
C.31.ASAP applies only when all of the following are present:
- a declared architecture alternative set;
- a declared scale variable or scale window;
- a claimed preference under scale;
- slope evidence, scale-probe evidence, or a no-probe reason;
- an expected stable or improving structure, exception-growth risk, or source-return condition that changes the next architecture move.
If those fields are absent, keep the claim in C.31 as a temporal or scale-sensitive characteristic cue, in C.31.RSA as report-only accounting, in C.29 as a bounded lens-use output, or in ordinary architecture prose.
ScaleClaimTriage
Use ScaleClaimTriage before any heavier scale audit:
The triage is complete enough when it states the next admissible architecture move and the nearest blocked overread. It may stop at local guidance when no comparison, publication, assurance, selected-set, or decision use is being made.
Architecture scale-preference rule
When architecture alternatives satisfy the same safety boundary, legal boundary, and assurance boundary, prefer the alternative whose reusable functional-structure, flow-structure, control-structure, module-interface, work-template, and evidence-package structure and learning-transfer slopes remain stable or improve over the declared scale window, unless an ArchitectureScaleAuditRecord@Project records a bounded exception.
This is not a selector result. If an alternative set, shortlist, selected set, local choice, gate, or decision is being claimed, use G.5, G.9, C.11, A.21, or the governing pattern. C.31.ASAP governs only the scale-preference claim and its boundary.
Scale variables
Typical architecture scale variables include:
The scale variable is not enough by name. The claim being made also needs a scale window, expected stable or improving structure, exception-growth risk, and source-return condition.
Scale audit outputs
Use the heavier audit only when the scale preference changes comparison, publication, selected-set, assurance-input, or decision use:
ArchitectureScaleAuditRecord@Project is a project-side triage record governed by this pattern. It is not an assurance proof, gate record, selected-set publication, local decision, or work plan.
Waiver discipline
Not every non-scale-amenable choice is debt. A deontic constraint, safety boundary, legal boundary, mission constraint, assurance infeasibility, or scale-probe overturn can justify a bounded exception without creating ArchitectureHeuristicDebt.
ArchitectureHeuristicDebt remains report-only unless tied to a decision, risk, work, evidence, assurance, or selected-set record through its governing pattern.
Scale-refactoring moves
Before scale-preference guidance becomes action-guiding, name at least one possible repair or stop:
C.29 lens relation
C.31.ASAP does not prove a scale law and does not perform mathematical-lens recovery. Use C.29 when the scale preference depends on an RG, coarse-graining, epiplexity, graph, multilevel-learning, or frustration lens.
For architecture use, the C.29 output should name MLU.Description@RGArchitecture, MLU.Description@MultilevelLearningFrustration, or another local MathLensUse output only when the lens changes the next admissible move. The C.31.ASAP side records the scale variable, scale window, slope or scale-probe evidence, exception-growth risk, and source-return condition. C.29 records candidate mathematical object, mapping mode, preserved structure, lost structure, visible payoff, admissible use, non-admissible use, and stop condition.
Archetypal grounding
Filled triage slice
Admissible move: prefer the platform alternative as a local scale-preference guide and start interface-grammar repair before deployment spread increases. Non-admissible move: treat the platform label, reusable-share number, or six-site probe as architecture selection, evidence sufficiency, assurance, gate passage, or final decision.
Near-miss lowering slice
Near-miss: a team says the platform architecture should win because it has an 82 percent reusable-structure share, an RG-like coarse description, and "less bespoke debt" than the local variant.
Lowering replay:
- The platform label is a source cue, not scale-preference evidence; recover variability slots, extension rules, exception curve, and source-return condition first.
- The 82 percent reusable-structure share stays report-only under C.31.RSA until the scale variable, scale window, accounting basis, comparator admission, and admissible comparison relation are declared.
- The RG-like phrase stays with C.29 unless the mathematical-lens fields, preserved structure, lost structure, payoff, admissible use, and stop condition are recoverable.
- The "bespoke debt" label is lowered to waiver review when safety, legal, mission, assurance, or scale-probe overturn reasons may justify the local variant.
Stop C.31.ASAP use when the scale window, probe evidence or no-probe reason, comparator admission, or source-return condition is absent. Reopen it only after those fields are recoverable and the platform-label, share, lens, and waiver claims have their governing patterns.
Bias annotation
Conformance Checklist
Common anti-patterns
Consequences
Rationale
C.31.ASAP is added because C.31 and C.31.RSA can expose scale-sensitive characteristics and reusable-structure residue, but they should not themselves decide which architecture alternative is preferable under scale. C.31.ASAP governs this architecture scale-preference claim family; it is narrower than general BLP and broader than one measurement card.
The pattern adapts BLP-style scale-amenability to architecture: prefer the alternative that preserves or improves reusable structure over a declared scale window when safety, legality, and assurance boundaries are comparable. It also blocks the common shortcut that treats modularity, reuse, platform practice, or mathematical coarse-graining as scale-preference evidence by itself.
SoTA-Echoing
Relations
- Builds on:
C.31,C.31.RSA,C.16,A.17,A.18,A.19,C.18.1,C.19.1, andC.29. - Coordinates with:
A.6.Mfor module-interface relation repair;C.30,C.30.ASV,C.30.LCA, andC.30.ILCfor architecture and selected-structure questions;A.10,B.3, andG.6for evidence and assurance reliance;G.5,G.9, andC.11for selected-set, parity, and choice claims. - Boundary:
C.31.ASAPgoverns architecture scale-preference claims.C.31,C.31.RSA,C.29,C.18.1,C.19.1,G.5,G.9, andC.11govern modularity-characteristic, reusable-structure accounting, mathematical-lens, scale-law, general method preference, selected-set, parity, and local-choice claims when those claims are being made. - Precision-restoration relation: source wording recovered by
E.10,E.10.ARCH, orC.30.STRATis governed by C.31.ASAP only when the recovered claim being made is architecture scale preference over a declared alternative set, scale variable, and scale window.
C.31.ASAP:End
Last Updated: 2026-06-17 — upstream FPF commit 646b0b9b (github.com/ailev/FPF)