#Part C — Kernel Extensions Specifications

Preface node heading:part-c-kernel-extensions-specifications:33925

#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.EpistemeSlotGraph 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 graph, which reifies every episteme through U.EpistemeSlotGraph: 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 graph

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-graph link. The assurance components are stated over U.EpistemeSlotGraph: 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, compute R_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), use R(Γ) = max_P R_eff(P) (annotate independence); never exceed the best attested line. Cross‑context steps and NotationBridge traversals contribute to CL_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 is min 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-graph 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

1. C2‑1 (Slot graph). Every U.Episteme MUST satisfy C.2.1 slot discipline for ClaimGraph, EntityOfConcernSlot, GroundingHolonSlot, Viewpoint, View, and ReferenceScheme; carriers link through SCR/RSCR or other exact carrier relations and are never parts of the episteme.
2. C2‑2 (Coordinates). Each episteme SHALL declare [F,G,R] with a brief rationale; F is U.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.
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, take R(Γ) = max_P R_eff(P) (never exceeding the highest-R support line). Compute F(Γ) = min along 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) to R.
4. C2‑4 (NotationBridge). Multi‑notation representation components SHOULD register NotationBridge edges with CL and loss note; any cross‑notation reasoning MUST cite the bridge’s CL.
5. 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 graph and CL scale keep the discipline brief and repeatable.

#Rationale

KD‑CAL turns the coarse legacy semiotic picture into holonic composition over U.EpistemeSlotGraph, 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 graph 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 graph (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 NotationBridge with 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 graph

One-line summary. U.Episteme is the holon type for epistemes; its internal ontology is given by U.EpistemeSlotGraph, a typed graph n-ary relation over EntityOfConcern, GroundingHolon, ClaimGraph, Viewpoint, View, and ReferenceScheme, aligned with U.RelationSlotDiscipline and ready for both symbolic and distributed representations. A coarse Symbol-Concept-Object triangle may be used only as a didactic projection of this graph, not as the normative ontology.

#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 artifacts (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, graph‑shaped 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),
• and keeps the coarse semantic triangle only as a didactic projection, not the normative ontology.

In this pattern:

• U.Episteme is the holon genus for epistemes (C.2), with components and identity governed by A.1/A.6.0/A.7.
• U.EpistemeSlotGraph names the internal ontology graph of U.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.EpistemePublication are holonic realisations of U.Episteme whose component structure is constrained to be compatible with U.EpistemeSlotGraph.

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:

1. EntityOfConcern-Description episteme-publication carrier soup. Diagrams and files are treated as the theory itself. Changes to a PDF are confused with theoretical change.
2. 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.
3. 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).
4. Trust without evidence path. Claims accumulate with no explicit justification graph or evidence freshness, so assurance degrades invisibly.
5. 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 graph: 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:

1. 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.

2. 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.

3. 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.View pair 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.

4. 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”.

5. 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 (EntityOfConcernRef used 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.

Thus we have problems of:

• EntityOfConcern drift. Specifications and models accumulate without a stable notion of which EntityOfConcernSlot value they carry; fields like SubjectRef are overloaded and resist safe refactoring.
• Viewpoint confusion. Engineering, publication and governance views are mixed, making it hard to maintain consistency across publication faces/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.TGA, multiple implicit triangles appear, each with slightly different semantics, instead of a single shared U.EpistemeSlotGraph.

We need a replacement for the triangle that keeps its didactic clarity but matches the graph‑ and morphism‑centric reality of contemporary epistemic work.

#Forces

#Solution — U.EpistemeSlotGraph as the normative episteme ontology

#Overview

For U.Episteme, U.EpistemeSlotGraph is the normative small, typed ontology graph and n-ary relation view over the core episteme positions:

Nodes / positions / slots. Minimal kernel SlotKinds (with their ValueKinds) that every episteme can refer to, following A.6.5:

• EntityOfConcernSlot (ValueKind U.Entity or a declared subkind) → “what this episteme is about”;

• GroundingHolonSlot (ValueKind U.Holon) → “where/how this is grounded”;

• ClaimGraphSlot (ValueKind U.ClaimGraph) → “what is being said (claim content)”;

• ReferenceSchemeSlot (ValueKind U.ReferenceScheme) → “how we read claims as statements about entities”;

• ViewpointSlot (ValueKind U.Viewpoint) → “under which viewpoint we read/validate this episteme”;

• ViewSlot (ValueKind U.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 tuple filling these slots (U.EpistemeTuple), 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.EpistemeSlotGraph; 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. 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 graph, not the normative ontology; it is simply the projection to:

  • Symbol ≈ a subset of U.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 interface defined here.

#Minimal epistemic positions (nodes & slots)

This section defines the minimal node set for U.EpistemeSlotGraph 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. Older entity of concern wording is source-standard or source-migration wording, not a live Tech head.

Intent. Provide a single, explicit slot for the entity (or entities) that an episteme is about, avoiding the former conflation of Object/Reference/Context.

Normative definition.

1. EntityOfConcernSlot is a SlotKind in the sense of A.6.5 U.RelationSlotDiscipline.

   • Its ValueKind is U.Entity.
   • Its RefKind is U.EntityRef (or a species thereof) and MUST be realised in data as a field named entityOfConcernRef : U.EntityRef (E.10 discipline).

2. Species of U.EpistemeKind MAY constrain the ValueKind to a subtype EntityOfConcernClass ⊑ U.Entity (for example, “the entity of concern is always a U.Holon and, more specifically, a U.System or U.Episteme”). The subtype MUST NOT be named U.EntityOfConcern; “EntityOfConcern value” is a local slot-use phrase, not a kernel type.

3. Wherever episteme previously used U.EpistemicObject as a separate type, it is re-interpreted as “U.Entity filling EntityOfConcernSlot” and is retained only as source-migration 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.

1. GroundingHolonSlot is a SlotKind with:

   • ValueKind U.Holon,
   • RefKind U.HolonRef (or a species thereof),
   • and recommended field name groundingHolonRef? : U.HolonRef in episteme cards/views.

2. GroundingHolonSlot is 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.

3. The phrase “grounding holon” is plain‑register; there is no kernel type U.GroundingHolon. It always means “the holon currently filling GroundingHolonSlot for 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.

1. U.ClaimGraph is the ValueKind for ClaimGraphSlot:

   • nodes: typed claims (definitions, axioms, theorems, requirements, properties, assumptions);
   • edges: logical/derivational/refinement relations, as already defined in C.2.

2. ClaimGraphSlot is a SlotKind whose instances are always stored by value in core patterns:

   • content : U.ClaimGraph is the normative field in U.EpistemeCard / U.EpistemeView;
   • C.2.1 MUST NOT introduce U.ClaimGraphRef as a ValueKind. Any reference type for ClaimGraphs, if needed, is a RefKind defined by discipline packs on top of U.ClaimGraph.

3. ClaimGraphSlot is mandatory: every U.EpistemeKind that uses C.2.1 SHALL have exactly one ClaimGraphSlot.

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.

1. U.Viewpoint is the type of viewpoint specifications:

   • role-bearing system families 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.Viewpoint is fixed in E.17.0, not here.)

2. ViewpointSlot is a SlotKind with:

   • ValueKind U.Viewpoint,
   • RefKind U.ViewpointRef,
   • normative field name viewpointRef? : U.ViewpointRef on episteme cards/views.

3. For Description epistemes, including Description epistemes admitted for specification use, under E.10.D2, viewpointRef is a mandatory part of DescriptionContext; C.2.1 treats that as a species-level constraint, not as a universal requirement for all epistemes.

4. ViewpointSlot may 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 a ViewpointBundle.

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), alias 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 publication face/form/interop publication form publication-face kind values and the external carriers/renderings on which views are made available (E.17, publication-face/form discipline, SCR/RSCR).

Normative definition.

1. U.EpistemeView is a species of U.Episteme whose episteme kind includes, at minimum:

   • one ClaimGraphSlot (typically a sliced or projected ClaimGraph),
   • one EntityOfConcernSlot,
   • one ViewpointSlot,
   • and appropriate ReferenceSchemeSlot.

2. U.View is an alias for U.EpistemeView in E‑cluster patterns (especially E.17.*), used where the word “view” is conventional.

3. ViewSlot is a SlotKind whose:

   • ValueKind is U.View,
   • RefKind is U.ViewRef (or U.EpistemeViewRef species),
   • intended usage is in meta‑structures such as U.MultiViewDescribing families and MVPK.

4. ViewSlot MUST NOT be confused with publication-face labels, publication-face kind declarations, or carrier slots: a concrete MVPK face that is a view is represented as U.View or U.EpistemeView, while the face label or publication-form profile, publication face/form kind or interop publication form kind, and carrier or rendering remain separate lanes.

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.

1. U.ReferenceScheme is a component type of epistemes, not an external entity:

   • it determines how nodes of U.ClaimGraph are mapped to properties/relations over values of EntityOfConcernSlot,
   • it specifies measurement/evaluation templates (how to test claims on GroundingHolon),
   • it fixes claim-scope predicates / admissible regions over declared U.ContextSlice selectors (and, where needed, references to domain spaces used inside those selectors).

2. ReferenceSchemeSlot is a SlotKind with:

   • ValueKind U.ReferenceScheme,
   • no RefKind in the minimal core (ReferenceSchemes are stored by value as referenceScheme? : U.ReferenceScheme fields on episteme cards/views). Discipline packs may introduce U.ReferenceSchemeRef as a RefKind, but must not repurpose it as a new ValueKind.

3. ReferenceScheme is 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 node set and extension C.2.1+

The minimal U.EpistemeSlotGraph core for C.2.1 consists of positions (the episteme core SlotKinds of A.6.5 CC‑A.6.5‑5):

• EntityOfConcernSlot (ValueKind U.Entity),
• GroundingHolonSlot (ValueKind U.Holon),
• ClaimGraphSlot (ValueKind U.ClaimGraph),
• ViewpointSlot (ValueKind U.Viewpoint),
• ViewSlot (ValueKind U.View),
• ReferenceSchemeSlot (ValueKind U.ReferenceScheme).

This pattern only fixes these positions. The extension C.2.1+ (second step of the refactor) adds:

• U.RepresentationScheme and RepresentationSchemeSlot,
• U.RepresentationToken and RepresentationTokenSlot,
• U.PresentationCarrier and PresentationCarrierSlot,
• U.RepresentationOperation and RepresentationOperationSlot (with inference regime annotations),

without changing:

• the definition of U.EpistemeKind,
• the minimal U.EpistemeCard interface,
• or the assumptions A.6.2–A.6.4 / E.17.* make about episteme components.

In C.2.1+ U.PresentationCarrier, publication face/form 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/form 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/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.EpistemeSlotGraph deliberately does not reify every episteme-adjacent structure as a node. Several key structures remain attached, non-slot components of U.Episteme:

• JustificationGraph — the argument/evidence graph for nodes of U.ClaimGraph (A.10/B.3).
• EvidenceBindings — per-claim U.EvidenceRole assignments that connect claims to external U.Work and carriers.
• EditionSeries — the PhaseOf chain of episteme editions (A.14) with change-class annotations (symbol-only vs ClaimGraph vs ReferenceScheme changes).
• ScopeCard and U.ClaimScope — USM scope values (A.2.6) describing where the episteme's claims hold.

These attached structures are not extra positions of U.EpistemeSlotGraph; 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:

1. n‑ary relations with a signature (slots & values), and
2. 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.

1. 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).

2. U.EpistemeKind is a special case of U.Signature (A.6.0), with its slots governed by U.RelationSlotDiscipline (A.6.5). C.2.1 MUST NOT define an alternative slot discipline.

3. For the minimal core, every U.EpistemeKind MUST include:

   • exactly one ClaimGraphSlot,
   • at least one EntityOfConcernSlot,
   • and at least one ReferenceSchemeSlot. Inclusion of GroundingHolonSlot, ViewpointSlot, ViewSlot MAY be species-level constraints (mandatory for Description epistemes, including Description epistemes admitted for specification use, optional for others).

Didactic cue. “An EpistemeKind is the type of episteme: which positions it has and what can go into them.”

#U.EpistemeTuple — episteme as filled n‑ary relation

Tech: U.EpistemeTuple (kernel species).

Intent. Model filled instances of an episteme’s signature, separating the n‑ary relation from any particular holonic packaging or publication.

Normative definition.

1. U.EpistemeTuple is a species whose instances are pure value tuples:
   • 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).
2. U.EpistemeTuple is notation‑agnostic and carrier‑agnostic: it does not know about files, formats, publication faces/forms, or carriers. It exists to give A.6.2–A.6.4 a minimal notion of “episteme as a point in Ep”.
3. In episteme, U.EpistemeTuple rarely appears directly; it is typically induced by U.EpistemeCard and U.EpistemeView (which add component structure and meta‑information).

Didactic cue. “An EpistemeTuple is the abstract record of what fills which slots — nothing more.”

#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.EpistemeTuple.

Normative definition.

1. U.EpistemeCard. A species of U.Episteme whose components correspond one‑to‑one to slots of some U.EpistemeKind:

   • content : U.ClaimGraph (for ClaimGraphSlot),
   • entityOfConcernRef : U.EntityRef (for EntityOfConcernSlot),
   • groundingHolonRef? : U.HolonRef (for GroundingHolonSlot),
   • viewpointRef? : U.ViewpointRef (for ViewpointSlot),
   • referenceScheme? : U.ReferenceScheme (for ReferenceSchemeSlot),
   • optionally representationSchemeRef? : U.RepresentationSchemeRef (C.2.1+),
   • meta : Edition/Provenance/Status…. Minimal episteme identity is the pair ⟨content, entityOfConcernRef⟩ within a U.BoundedContext; all other fields are optional at the genus level but may be mandatory in species. Changes that alter content or the effective referenceScheme (or that intentionally re-identify entityOfConcernRef) SHALL be realised as new phases in an U.EditionSeries (PhaseOf chain) under A.14 and A.7. Changes confined to U.PresentationCarrier, publication-side values, MVPK face, carrier, or rendering relations do not create a new episteme; they are captured as publication work over the same U.Episteme.

2. U.EpistemePublication. A species representing epistemes that have been published through publication faces/forms or MVPK relations. It:

   • has at least the components of U.EpistemeCard,

   • plus references to MVPK U.View, face identity, publication face/form and interop publication form publication-face kind values, publication-scope fields, profile fields, and external carrier or rendering refs as required by E.17 and publication-face/form discipline,

   • but does not re-interpret face labels, publication-face kind values, or carriers/renderings as parts of the episteme; carriers remain external.

3. U.EpistemeView. As defined in §4.1.5, a species of U.Episteme representing a view under a specific U.Viewpoint. Its components are a specialisation of U.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.EpistemeKind it 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 lanes (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 lane as U.EpistemePublication or as a governed U.Episteme publication. Then keep the adjacent lanes 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 profile;
• view, including MVPK face — U.View or U.EpistemeView under a declared U.Viewpoint, including MVPK faces such as PlainView, TechCard, InteropCard, or AssuranceLane;
• carrier or rendering — the SCR/RSCR, document, dashboard, generated screen, trace file, transport envelope, or display 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 — governingPatternRef when one FPF pattern governs admissible interpretation or use; authoritySourceRef when a non-pattern authority-source referent such as an external standard, editioned register, DRR, 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.

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 P2W lanes 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:

1. EntityOfConcernSlot.
   • SlotKind = EntityOfConcernSlot;
   • ValueKind = U.Entity (species may constrain to EntityOfConcernClass ⊑ U.Entity);
   • RefKind = U.EntityRef (or a species thereof);
   • normative field name in episteme cards: entityOfConcernRef : U.EntityRef. No kernel type named U.EntityOfConcern is introduced; the phrase “EntityOfConcern value” always means “an instance of U.Entity filling EntityOfConcernSlot”.
2. GroundingHolonSlot.
   • SlotKind = GroundingHolonSlot;
   • ValueKind = U.Holon;
   • RefKind = U.HolonRef;
   • normative field name: groundingHolonRef? : U.HolonRef. There is no kernel type U.GroundingHolon; “grounding holon” is a slot-filler phrase. Any episteme that previously mixed slot/value/ref concepts (e.g., using EntityOfConcernRef as if it were a type) MUST be migrated to this discipline over time; C.2.1 provides the normative reference, and F.18 / discipline packs provide the migration guide.

#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):

1. entityOfConcernSet : U.Episteme → P(U.Entity) derivable from EntityOfConcernSlot and ReferenceScheme

   • For an episteme E, entityOfConcernSet(E) is (at least) the singleton containing the entity referenced by entityOfConcernRef(E); in more complex cases, it may be a finite set or bundle of entities, determined by ReferenceScheme.
   • The functorial EntityOfConcern mapping δ_E : Ep → Ref used 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>.

2. grounds : (U.Entity, U.Holon) ⇝ GroundingRelation relates EntityOfConcern values to grounding holons

   • Captures how values of EntityOfConcernSlot are 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.

3. designates : (U.ReferenceScheme, U.ClaimGraph, U.Entity, U.Holon) ⇝ DesignationProfile how claims are read as statements about entities in contexts

   • Specifies, for each claim in content and each <entityOfConcernRef, groundingHolonRef>, what property/relation it purports to state, and under what conditions.

4. satisfies / evaluatesTo : (U.ClaimGraph, U.ReferenceScheme, U.Holon) → TruthProfile/SuccessProfile evaluation of claims under a reference scheme and grounding

   • Forms the bridge to KD‑CAL’s F, G, R evaluation; details are given in C.2 and B.3.

5. View-related morphisms (to be connected with A.6.3):

   • viewProject : (U.Episteme, U.Viewpoint) → U.View — effect-free, EntityOfConcern-preserving projection that slices ClaimGraph and specialises ReferenceScheme under a given viewpoint.
   • viewEmbed : U.View → U.Episteme — embedding of a view back into the wider episteme, typically as a reference with correspondence proofs.

6. Reflexive entityOfConcern guard. When EntityOfConcernSlot or ReferenceScheme picks 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).

#Legacy 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 the richer hypergraph U.EpistemeSlotGraph:

• “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 the U.ClaimGraph publication.
• “Concept” corner ≈ U.ClaimGraph + U.ReferenceScheme under a chosen U.Viewpoint. This is the claim content plus its interpretation recipe.
• “Object” corner ≈ the slot filler of EntityOfConcernSlot (ValueKind U.Entity) plus the slot filler of GroundingHolonSlot (ValueKind U.Holon) and the grounding relation between them.

Under this didactic projection the triangle is a three-node quotient of the U.EpistemeSlotGraph:

(Symbol)      = RepresentationToken + Scheme + Carrier
(Concept)     = ClaimGraph + ReferenceScheme (+ Viewpoint)
(Object)      = EntityOfConcern + GroundingHolon

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:

1. As an introductory picture in guidance material (“this is the coarse triangle; the actual pattern is the episteme slot graph”).
2. As a quotient diagram: an explicit note that “this figure ignores viewpoint, grounding, carrier, and operationality; see C.2.1 for the full structure”.
3. 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.EpistemeSlotGraph”, 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 and components of U.EpistemeSlotGraph.

#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:

DescriptionContext = ⟨EntityOfConcernRef, BoundedContextRef, ViewpointRef⟩

where:

• EntityOfConcernRef : U.EntityRef — fills EntityOfConcernSlot (ValueKind U.Entity, species often constrained via EntityOfConcernClass ⊑ U.Entity).
• BoundedContextRef : U.BoundedContextRef — points to the context that fixes vocabulary, units, and legal inferences for this description (E.10.D1).
• ViewpointRef : U.ViewpointRef — fills ViewpointSlot (ValueKind U.Viewpoint) and determines which concerns, role-bearing system families, 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:

1. subjectRef SHALL be decodable to a well‑formed DescriptionContext triple.
2. EntityOfConcernRef from that triple SHALL be identical to the field entityOfConcernRef that fills EntityOfConcernSlot in the corresponding U.EpistemeCard/U.EpistemeView.
3. ViewpointRef in DescriptionContext SHALL agree with viewpointRef in the episteme card or be uniquely derivable from a U.ViewpointBundle in 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 graph into a third Specification ontology class.

#EntityOfConcern-to-Description morphism and specification-use exit over C.2.1

• Describing (Describe_EoC_DescEp : EntityOfConcern -> DescriptionEpisteme). Produces an episteme whose:

  • content : U.ClaimGraph encodes the descriptive claims about the EntityOfConcern value,
  • entityOfConcernRef points to the EntityOfConcern value,
  • groundingHolonRef (if present) fixes where the description is evaluated or tested,
  • viewpointRef selects the describing viewpoint.

  Describe_EoC_DescEp is conformant to A.6.2 but not an Ep→Ep morphism (domain is the EntityOfConcern value, codomain is a Description-side U.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.EpistemeCard or U.EpistemeView with content, entityOfConcernRef, groundingHolonRef?, viewpointRef?, and referenceScheme? fields, and
• wire these fields into subjectRef as DescriptionContext.

#Alignment with A.6.2–A.6.4 (episteme morphisms) (normative)

U.EpistemeSlotGraph is the slot-level substrate for the episteme morphism patterns:

• A.6.2 U.EffectFreeEpistemicMorphing
• A.6.3 U.EpistemicViewing
• A.6.4 U.EpistemicRetargeting

#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.Episteme instances realised as U.EpistemeCard / U.EpistemeView with at least the minimal core components:

  content            : U.ClaimGraph
  entityOfConcernRef : U.EntityRef      // EntityOfConcernSlot
  groundingHolonRef? : U.HolonRef       // GroundingHolonSlot
  viewpointRef?      : U.ViewpointRef   // ViewpointSlot
  referenceScheme?   : U.ReferenceScheme// ReferenceSchemeSlot (ByValue)

  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. f MUST declare a entityOfConcernChangeMode ∈ {preserve, retarget}:

  • preserve — entityOfConcernRef(Y) = entityOfConcernRef(X) and any change to groundingHolonRef/viewpointRef must 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 declared KindBridge in 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 alongside EntityOfConcern.

• 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_Y read via referenceScheme_Y about the new <EntityOfConcern, GroundingHolon> do not go beyond what already follows from content_X via referenceScheme_X under 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 in EntityOfConcernSlot.
• groundingHolonRef is preserved, or changed only within a fixed grounding context (e.g. normalising identifiers for the same lab or runtime).
• viewpointRef is either:
  • preserved (internal normalisation under the same viewpoint), or
  • replaced by another U.ViewpointRef within a U.MultiViewDescribing family (E.17.0), with invariants enforced by a CorrespondenceModel.
• content and referenceScheme are transformed conservatively: no new claim content about the same EntityOfConcern is introduced.

Typical examples:

• filtering or aggregating U.ClaimGraph to 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 for EntityOfConcernSlot changes;
• a KindBridge must relate Kind(entityOfConcernRef(X)) and Kind(entityOfConcernRef(Y));
• groundingHolonRef may 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 receiving bundle <EntityOfConcernSlot, GroundingHolonSlot> (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 bundle 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.TGA becomes a species of A.6.4);
• signal vs spectrum transitions (Fourier-style moves where the EntityOfConcernSlot value 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.EpistemeSlotGraph 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/…Spec episteme with:
  • entityOfConcernRef into that EntityOfConcernClass,
  • viewpointRef drawn from a U.ViewpointBundle,
  • subjectRef decoding to DescriptionContext.

Within this pattern:

• U.Viewpoint is exactly the ValueKind of ViewpointSlot in C.2.1.
• U.View is U.EpistemeView, a species of U.Episteme whose content is already restricted to a particular U.Viewpoint and often also to a particular U.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.Viewpoint instances tailored to a class of entities of concern (e.g., holons in engineering contexts).
• TEVB fixes EntityOfConcernClass = U.Holon (typically U.System or U.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 viewpointRef to TEVB’s EngineeringVPId set, 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.EpistemicViewing species (A.6.3) to generate publication‑oriented views from engineering or logical views;
• it then publishes these U.View epistemes through publication face/form values with declared publication viewpoints and faces.

C.2.1’s distinction between:

• U.Viewpoint (epistemic perspective specification) and
• U.PresentationCarrier (carrier in C.2.1+ and publication-face/form discipline)

keeps epistemic perspective and physical medium separate:

• MVPK operates on U.View epistemes 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.View as a U.EpistemeView with a valid C.2.1 core,
• document which C.2.1 slots it reads/writes (typically only representation/carrier‑related ones, leaving EntityOfConcernSlot and GroundingHolonSlot untouched),
• 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 graph is therefore built around slots for EntityOfConcern, GroundingHolon, Viewpoint and ClaimGraph, not around abstract “propositions in the void”.

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.EpistemeSlotGraph. 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:

content            : U.ClaimGraph
entityOfConcernRef : U.EntityRef
groundingHolonRef? : U.HolonRef
viewpointRef?      : U.ViewpointRef
referenceScheme?   : U.ReferenceScheme      // ByValue
meta               : …                      // edition, provenance, status (A.7/F.15)

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 (*Slot for SlotKinds, *Ref only for RefKinds/fields),
• declare a ValueKind and refMode (ByValue or 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 EntityOfConcernRef matches entityOfConcernRef (EntityOfConcernSlot), and
• ensure that ViewpointRef matches viewpointRef or is derivable from a U.ViewpointBundle under documented rules.

CC‑C.2.1‑5 - Morphism declarations over slots. Any pattern in A.6.2–A.6.4, E.17, E.TGA, or discipline packs that defines morphisms between epistemes SHALL:

• state whether it is a species of U.EffectFreeEpistemicMorphing, U.EpistemicViewing, or U.EpistemicRetargeting,
• declare its entityOfConcernChangeMode (preserve/retarget),
• name which SlotKinds it reads and writes,
• state its behaviour on entityOfConcernRef, groundingHolonRef, viewpointRef, and referenceScheme.

CC-C.2.1-5a - Episteme/publication lane 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 live, 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.EpistemeSlotGraph, and
• normative laws are stated in terms of C.2.1 nodes 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.ClaimGraph is interpreted in a ReferencePlane,
• how GroundingHolonSlot figures 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 routed to R‑lanes 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 A.7 and A.12 separation obligations: U.PresentationCarrier values, publication-side values, and U.Work occurrences MUST NOT be treated as parts of U.Episteme or as values of any SlotKind in U.EpistemeSlotGraph. Episteme content stays in U.ClaimGraph and U.ReferenceScheme; evidence enters only via U.EvidenceRole bindings that point to external U.Work occurrences and carriers (A.10 and B.3). Changing carriers or re-publishing work alone does not change the episteme determined by ⟨content, entityOfConcernRef, referenceScheme⟩ 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 external evidence (U.Work with U.EvidenceRole) 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 workflows (e.g. ReAct, tool‑augmented LLMs, latent protocols). FPF can model both symbol‑heavy and latent‑heavy workflows 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.
• Migration effort. Legacy uses of “EpistemicObject”, “Facet”, “Subject”/“Object”, and raw …Ref fields will need refactoring into C.2.1 slots + A.6.5 SlotSpecs. Current prose uses the selected C.2.1 slots and A.6.5 SlotSpecs directly; old wording is source/input material for repair, not a live alternate vocabulary.
• Exposure of representation biases. Being explicit about RepresentationSchemes and Operations may surface disagreements 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 of subjectRef as 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}) over EntityOfConcernSlot/GroundingHolonSlot.

• E.17.0–E.17.2 — by specifying how EntityOfConcern, Viewpoint, View and ReferenceSchemes are represented at episteme level.

• E.17 (MVPK) — by separating U.View (episteme) from U.PresentationCarrier (publication carrier), and by requiring that publication morphisms be U.EpistemicViewing species 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 with entityOfConcernChangeMode = 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 and EntityOfConcernClass constraints.
• E.17 (MVPK) — to publish episteme views through publication faces/forms and carriers.
• E.TGA — to interpret StructuralReinterpretation and other engineering projections as episteme morphisms over a well‑typed U.EpistemeSlotGraph.

Together, these relations make U.EpistemeSlotGraph 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: Architectural (A), C.2 precision-restoration pattern Status: Stable Normativity: Normative unless a section is explicitly informative

#Use this when

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, admissible uses, 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 live 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, admissible 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 admitted for FPF-governed use, and pattern-application wording when those are used as claim-bearing or admissibility-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 live 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 admissible 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 live 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 live and the found problem is not relation construction. E.10 detects the wording problem and selects the applicable path; 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 remain admissible until the sentence gives them FPF-kind, relation, authority, evidence, admissibility, 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-, admissibility-, 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 live, 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 admissible use. Do not replace a clear plain phrase with a technical phrase unless the technical phrase blocks a live 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 with named source, evidence, architecture, or 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 admissible 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 live, 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 admissibility 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 exact 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 surviving admissible action 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 admissible remaining use after recovery.

Primary working reader. The first reader is an author or reviewer of conformant FPF-style text who must repair wording without losing ontology. The downstream reader is the engineer-manager using the resulting 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 admissible action remains; and when the reader must apply the FPF governing pattern named by value because evidence, gate, decision, work, assurance, bridge, release, or reliance is live. 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, the claim-bearing status, 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:

1. 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 with named source, evidence, architecture, reviewed publication, review packet, review record, or review state, or project-side FPF kind and reference named by value;
2. 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;
3. slash lists and heterogeneous rows become false group kinds;
4. unclear source meaning is guessed into FPF-governed wording rather than blocked or assigned to an accepted FPF extension;
5. authors copy the same loose wording into DRRs, patterns, source-basis 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:

1. the head kind and sentence function are recoverable under E.10;
2. a stable reusable name has F.18 status;
3. a relation, comparison, dependency, support, sameness, grounding, mapping, or endpoint claim has A.6.P relation precision, with admissibility and project-side reliance questions split into their own fields;
4. 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.1 typing or named FPF claim or admissible-use boundary named by value;
5. publication, view, face, and carrier distinctions satisfy E.17.0, E.17, and MVPK;
6. the repaired text satisfies E.2 Pillars, especially P-2 Didactic Primacy, by preserving or restoring one remaining admissible 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 live, the Plain or didactic line maps back to the recovered Tech kind, relation, or FPF pattern application under E.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 admissibility 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;
7. the final phrase preserves the distinction without adding another claim;
8. 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 admissible use 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 live. 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 live.

Use the short form when only one field is live. Use the full record when several fields are live 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, receiving-side relation, publication face, EntityOfConcern, or bounded publication-unit status.

0. 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.10 and the governing patterns named by the recovery.

1. E.10 trigger scan and head-kind recovery. Use E.10:0.2 as the shared trigger scan. Decide what the head noun names before accepting the phrase: EntityOfConcern, Description episteme, or Description episteme admitted 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.1 dated U.Work occurrence, A.6.A action invitation, A.2.9 SpeechActRef, A.2.8 U.Commitment, U.Method, U.MethodDescription, document with named source, evidence, architecture, 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.

2. 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 the E.10:0.2 replacement-candidate anti-umbrella rule.

3. 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 admissibility, evidence, and work. For support wording, do not stop at a substitute label: select the live support-like claim or relation under A.6.P first, including source-description relation, EntityOfConcern or grounding-holon grounding, base relation through A.6.6, evidence, assurance, causal-use, mathematical-lens, characteristic or measurement, admissible-use, work or enablement, or publication-companion use. If ambiguity remains, write a local Candidate-Set Note rather than debating synonyms.

4. C.2.1 episteme-slot pass when the item 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 use PublicationUnit or a carrier word as a substitute episteme.

5. E.17.0, E.17, MVPK publication pass when the item 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 live. 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 live, fill admissibleUse and projectSideFPFRef instead of treating the generic publication face or MVPK face under E.17 constraints as the source value.

5a. Precision-restoration exit 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 precisionRestorationExit 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.

6. Remaining admissible reader move. After the kind, relation, publication, and project-side splits are recovered, state the remaining admissible 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 live, 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 admissibility 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.

7. 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 relationClaimSlice only when a relation claim is live, and fill admissibleUse plus projectSideFPFRef when an admissibility or project-side reliance claim is live;
• if the recovered wording is type-correct but leaves no remaining admissible reader move, recognition reason, Tech-to-Plain mapping when both registers are live, 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 admissibility 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 admissibility claim;
• a lazy and/or-style join that must be split or recovered before FPF-governed use;
• a composite-kind candidate that needs F.18 and A.6.P recovery;
• a relation claim that needs a RelationKind, a QualifiedRelationRecord, 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 FPF kinds, or current FPF episteme and publication ontology;
• the claim is understandable, but current FPF does 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 exact U.Episteme, selected EntityOfConcern, 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 with named source, evidence, architecture, reviewed publication, review packet, review record, or review state, project-side FPF kind and reference named by value when projectSideFPFRef is live. The selected value is one live value, not the list: C.11 ChoiceResult; C.11 decision record; A.6.A action invitation; A.15 U.WorkPlan; A.15.1 dated U.Work occurrence; U.Method; U.MethodDescription; A.20 constraint or adjudication decision record; A.21 GateDecision; A.21 DecisionLogRef; A.10 evidence path; typed evidence record; B.3 assurance 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 DRR content decision, or campaign-scoped content question, but it does not carry current authority, evidence, or admissibility claim until an accepted architecture decision, accepted DRR, or accepted FPF pattern supplies that authority;
• source wording without FPF-governed use: the phrase has no current authority, evidence, or admissibility 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 not admissible 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 admissible reader move, recognition reason, Tech-to-Plain mapping when both registers are live, or FPF pattern application, or a Plain or didactic line carries ontological, evidence, causal, assurance, bridge, gate, work, decision, or admissibility 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 admissible use, 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 live. 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 admissibility, 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 live in the sentence. The same local-aid rule applies to neighboring field names such as sourceRelationClass, explanationSourceRelationClass, comparativeRelationClass, representationValidityAdmissibilityValue, 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 admissibleUse, 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, live episteme-publication relation set, use disposition, and remaining admissible 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 live entity is a bounded unit inside a publication, use PublicationUnit; when the live 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 item.

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 live, use an 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 live 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 Admission 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.

F.18 and A.6.P admission interpretation:
  Context: conformant FPF authoring and review where bounded publication units must not be confused with epistemes, views, publication forms, generic publication faces, MVPK faces under E.17 constraints, carriers, authoring work, or review process.
  Kind: primary-entity or local-head field for a bounded unit inside one publication.
  Purpose and use-domain: keep one human-inspected publication unit distinct from episteme, view, publication form, generic publication face, MVPK face under E.17 constraints, carrier, authoring work, and review process.
  Selected Tech label: PublicationUnit.
  Plain interpretation: bounded unit inside a publication that a person inspects as one unit.
  Candidate head families considered:
    - authoring-centered unit labels
    - reader-action-centered unit labels
    - mixed authoring-and-reader-action unit labels
    - PublicationReadingUnit
    - PublicationAuthoringUnit
    - PublicationUnit
    - ContentSpan
    - DocumentUnit
  F.18 result:
    - `PublicationUnit` has better SemanticFidelity than authoring-centered unit labels because the unit belongs to the publication lane, not to the authoring process.
    - `PublicationUnit` has better MorphologicalActionFit than mixed authoring-and-reader-action unit labels because it does not mix author, reader, and unit-boundary roles in one head.
    - `PublicationUnit` has lower AliasRisk than `content span` and `document unit` because `content` and `document` blur episteme, publication form, and carrier.
    - `PublicationUnit` still has nonzero AliasRisk because `publication` itself splits into act or occurrence of publishing, episteme publication, form, generic face, MVPK face under E.17 constraints, unit, and carrier; therefore FPF-governed uses keep the nearby definition or explicit publication relation set.
  Current status: admitted reusable FPF head for conformant episteme-publication-heavy FPF text within the declared bounded-publication-unit repair scope; use a more specific already accepted head where one governs the text under repair.

#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 admissible 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, admissibility, 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-basis or review-basis document cleanup where a sufficient FPF kind, relation record, relation phrase, or tuple-like record can be recovered without minting a new FPF head.

Compact epistemic precision-restoration row:
  file path, if live:
  FPF pattern, if live:
  pattern section, if live:
  sentence reference:
  phrase under repair:
  live sentence function:
  selected FPF kind named by value or project-side FPF kind:
  `relationClaimSlice` triggered? yes or no
  relation problem, if triggered:
  admissibleUse triggered? yes or no
  projectSideFPFRef triggered? yes or no
  relation claim? yes or no
  if relation claim:
    RelationKind:
    endpoint, slot, qualifier notes:
    admissibilityTargetKind:
    admissibilityTargetRef:
  if local current-context unpacking:
    FPF-side kind, reference, or relation:
    project-side FPF kind, if live:
    project-side reference named by value, if live:
    notTriggeredReason:
  replacement:
  remaining admissible reader move:
  distinction disposition: preserved, split, intentionally retired, still missing

#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 with named source, evidence, architecture, or reviewed publication, review packet, review record, or review state, or resolve a contested source-meaning problem.

Epistemic precision-restoration check:
  file path, if live:
  FPF pattern, if live:
  pattern section, if live:
  sentence reference:
  phrase under repair:
  sentence function:
  distinction carried:
  E.10 head kind and EntityOfConcern and Description-episteme boundary and specification use interpretation:
  F.18 naming status: no stable term, reuse, MintNew sketch, DocumentLegacy
  F.18 candidate head families, if naming is live:
  F.18 lexical Q result, if naming is live:
    SemanticFidelity:
    CognitiveErgonomics:
    MorphologicalActionFit:
    AliasRisk:
  A.6.P trigger? yes or no
  A.6.P selected relation kind, slots, qualifiers, if live:
  claim-bearing episteme live? yes or no
  FPF kind and relation set:
  EntityOfConcern, grounding, ClaimGraph, viewpoint slots triggered:
  E.17 and MVPK publication form, generic face, MVPK face under E.17 constraints, view, carrier split:
  PublicationUnit typing, if any:
  FPF-side or project-side sentence:
  `relationClaimSlice` triggered? yes or no
  relation problem, if triggered:
  admissibleUse triggered? yes or no
  projectSideFPFRef triggered? yes or no
  relation claim? yes or no
  if relation claim:
    RelationKind:
    QualifiedRelationRecord slots:
    admissibilityTargetKind:
    admissibilityTargetRef:
  if local current-context unpacking:
    FPF-side kind, reference, or relation:
    project-side FPF kind, if live:
    project-side reference named by value, if live:
    notTriggeredReason:
  rejectedOverread, if live:
  project-side record, work, action, method, carrier crossing:
  heterogeneous-list classification: one kind under repair, relation set, tuple-like record, alternative cases, failed ontology, not triggered
  pattern application, project work, decision distinction:
  chosen rewrite:
  remaining admissible reader move:
  distinction disposition: preserved, split, intentionally retired, still missing
  unrecovered wording retained? no, yes, with scope and reason:
  use disposition: recovered by value, extension candidate, reduced-use cue, blocked use, rewrite incomplete, not triggered

#Epistemic Precision-Restoration Note

Use an epistemic precision-restoration note only when wording carries ontology, authority, evidence, or admissibility claim. The note records the original phrase, recovered FPF kind or relation, reference named by value when live, project-side FPF kind and reference when live, remaining admissible 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:

1. E.10 trigger result is kept as input and the text does not restart from word taste;
2. 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;
3. the recovered episteme, publication, view, face, carrier, publication unit, EntityOfConcern, grounding relation, project-side reference, or use disposition is named by value;
4. every relation-like slice that remains live is assigned to A.6.P or its retained specialization, rather than being hidden inside this pattern;
5. the remaining admissible 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 live, 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, or mapping without 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 live evidence, assurance, gate, work, decision, publication, architecture, structure, relation, or naming claim;
• an entry cue, ToC row, summary, dashboard, retrieval snippet, or source-basis 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 admissible 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-basis notes, review-basis notes, and pattern-host 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 admissible 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, live episteme-publication relation set, use disposition, and remaining admissible reader move. When the relation-bearing slice is live, 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 PublicationUnit for bounded publication units;
• use EntityOfConcern and EntityOfConcernRef when the episteme slot is live, and translate describedEntity source 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 with named source, evidence, architecture, reviewed publication, review packet, review record, or review state, and project-side FPF kind and reference named by value separate;
• name relationClaimSlice, admissibleUse, and projectSideFPFRef separately when more than one is live;
• 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, admissibleUse, and projectSideFPFRef separately 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 admissibility 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 live;
• 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 live 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 admissible recognition wording 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 admitted for the recovery discipline; it does not create a new ontology and does not outrank the FPF patterns named below.

External-practice boundary. External traditions are admitted 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.10 supplies the head-kind, term, morphology, register, and forbidden-umbrella discipline.
• E.10.D2 gives the "thing vs words vs rules" discipline and the carrier humility rule.
• F.18 gives 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.P gives 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.1 gives the episteme slot graph and selected EntityOfConcern discipline.
• A.7 keeps EntityOfConcern, Description episteme, and publication carrier distinct.
• E.17.0, E.17 distinguish views, viewpoints, MVPK faces, publication forms, and publication projections.
• A.15.4 is 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 makes work or reliance admissible.
• A.16, A.16.0, A.19, B.2.5, C.27, and A.3.3 provide the movement, control, and temporal machinery used when episteme-publication prose talks about route, trajectory, movement, cadence, or dynamics.
• E.19 already treats terminology and sentence-level precision restoration as required review checks, not editorial polish.
• A.6.A carries action-invitation discipline when a publication, representation, or cue invites an action without itself becoming authority, evidence, gate passage, or work completion.
• C.11 carries decision-making and decision-record discipline when the question under repair is a decision rather than generic action.
• A.15 and A.15.4 split role, method, work-plan, and actual-work alignment from work-relevant source restoration, so episteme-publication prose must not let A.15 become a universal episteme-publication governing pattern.
• E.9 is the campaign DRR pattern for campaign-level content decisions; E.11 is 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, admissible use, 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 live) and select the live E.19 profile by the changed pattern claim. Do not mint a local evidence-review profile inside C.2.P.

#Relations

• Builds on: E.2 Pillars, especially P-2 Didactic Primacy; E.10, E.10.ARCH, A.7, F.18, A.6.P, C.2.1, E.17.0, E.17, MVPK, and A.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, and E.17.ID.CR.
• Does not replace: E.10 general lexical rules, F.18 naming protocol, A.6.P relation precision, or local episteme and publication patterns. It tells authors 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:

1. Auditable. A reader can trace R to concrete evidence and see how reuse penalties were applied.
2. Composable. R can be propagated through claim graphs conservatively, without illegal scale arithmetic.
3. Orthogonal. R is not conflated with F (expression) or G (scope).
4. Bridge-safe. Any loss from transport across contexts/kinds/planes is explicit and affects R only.
5. 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 for c, treated as a ratio-scale scalar in [0,1] (or an ordinal proxy at [M‑0/M‑1]; see §4.5.A). R_eff is 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:

• K is the declared U.BoundedContext.
• S ∈ {design, run} is the claim’s stance carrier (no DesignRunTag chimeras).
• ReferencePlane is declared where applicable; plane crossings apply CL^plane and 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); if ReferencePlane=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 R means “the evidence and its relevance supports relying on this claim under this scope.”
• A higher F means “the claim’s form is amenable to higher-formality checking and wider reuse,” but does not itself imply the claim is warranted.
• A larger G means “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_PlantB maps lab rig → plant rig and introduces a measurement correction; CL(Bridge#MatLab_to_PlantB)=2 with loss note “±2 °C bias.”
• Scope translation: G_tgt := translate(b, G_src) which (in this case) narrows the temperature span to [122,148]°C due to the correction.
• Penalty routing: using policy Φ=Φ_v1, compute R_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:

• CL be the congruence level of a scope bridge (B.3).
• CL^k be the congruence level of a kind bridge (C.3).
• CL^plane be 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 when ReferencePlane differs.

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_eff requires 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 ⊑ K2 or K2 ⊑ K1 (an explicit kind relation/cast is named), or
• (cross‑Context) there exists a declared KindBridge relating K1 and K2 with an explicit CL^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:

1. Fix the typed claim. State the claim as a typed proposition about a EntityOfConcern (Kind‑CAL, C.3).

2. Declare claim scope. Write G explicitly using A.2.6 operators; avoid scope-by-wording.

3. Declare stance carriers. Declare K=U.BoundedContext, S ∈ {design, run}, and (where relevant on Working‑Model surfaces) validationMode ∈ {postulate, inferential, axiomatic}; declare ReferencePlane if crossings are in play.

4. Bind evidence. Attach evidence stubs and lane tags (TA/VA/LA) and validity windows / decay policy where applicable (B.3.3, B.3.4).

5. Choose Γ-mode. Declare whether the support is series (required) or parallel (independent lines to the same claim).

6. Compute R_raw. Use the weakest-link fold on the entailment spine; for parallel support, use max only with an explicit independence note.

7. 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_PlantB with CL=2 and an explicit loss note, applying policy ids Φ=Φ_v1 (and, where applicable, Ψ=Ψ_v2, Φ_plane=Φ_plane_v1) to reduce R_eff only.

8. Compute R_eff. Apply the declared penalty policies into R (never into F or G), 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_*_min values are bottlenecks on the relevant path/dimension (no averaging).
• valid_until is 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)=F5 because 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 R coordinate 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:

1. teams collapse several facets into one maturity story;
2. F is silently misused as a surrogate for articulation, closure, anchoring, and representation factors;
3. thresholds are published as vague readiness statements instead of explicit facet conditions;
4. source phenomena, governed epistemes, publication forms, publication faces, and carriers are conflated;
5. 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.3 for F;
• C.2.4 for articulation explicitness;
• C.2.5 for language-state closure degree;
• C.2.6 for language-state anchoring mode;
• C.2.7 for 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.Episteme publication 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, ValueSet claims, 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 ValueSet claims 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 F statement.

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.2a
• C.2.LS
• C.2.4–C.2.7
• A.16
• A.16.0–A.16.2
• B.4.1
• B.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-1 U.LanguageStateSpace SHALL be treated as the declared language-state chart over U.CharacteristicSpace, not as a rival kernel space and not as a disguised F progression.
• CC-C.2.2a-2 Published positions SHALL cite explicit facet governing patterns when those positions matter for movement, routing, or endpoint entry.
• CC-C.2.2a-3 Position claims SHALL use slot-explicit values, ValueSet claims, or intervals; uncertainty SHALL NOT be hidden inside stage words such as ready, early, or mature.
• CC-C.2.2a-4 A position claim in the chart MUST NOT be conflated with the current ground, witness, publication form, publication face, or carrier.
• CC-C.2.2a-5 Cross-context comparison of positions or threshold talk SHALL go through bridge discipline rather than label similarity.
• CC-C.2.2a-6 Corridor 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-7 If 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 F to 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.9 bridge 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, ValueSet claims, 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:

1. Is the author naming a position claim in the chart, or only a folk stage label?
2. Is F being used as a surrogate for another slot?
3. Are source phenomena, publication forms, publication faces, and carriers being confused with the occupant?
4. Are threshold claims explicit enough for the next move or endpoint decision?
5. 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:

1. Rigor is narrated inconsistently. Different contexts invent local mode/tier language with no shared comparability.
2. Status and rigor collapse. Something accepted, published, or approved is mistaken for something precisely expressed.
3. Expression changes are hidden. A move from sketch to predicates or from executable model to proof is not recorded as a distinct content change.
4. 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.
5. 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 (abbreviated F in 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:

• F is not G; scope remains governed by U.ClaimScope and other USM structures.
• F is not R; evidence, warrant strength, and decay remain assurance concerns.
• CL and bridge losses affect R, not F.
• Changes in notation, carrier, or rendering form do not change F if 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 F value.
• Thresholds that depend on rigor should be written explicitly as F >= Fk conditions.
• Any raise or lowering of F is a content change, not a status-only change.
• F remains 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-1 Every normative U.Episteme SHALL declare exactly one U.Formality value, either a default anchor or a local sub-anchor explicitly docked to one.
• CC-F-2 F SHALL be treated as an ordinal characteristic; arithmetic over F values is invalid.
• CC-F-3 Higher F SHALL mean greater or equal strictness of expression, not greater truth, trust, or scope.
• CC-F-4 Contexts MUST NOT publish alternative "formality modes" or "tiers" as surrogates for F.
• CC-F-5 Local sub-anchors SHALL preserve the global ordering and the parent anchor meaning.
• CC-F-6 The episteme-level F of a composite episteme SHALL be bounded by the least-formal essential support on the relevant support path.
• CC-F-7 Implementations MUST NOT average F values numerically.
• CC-F-8 Changes in G, R, or CL SHALL NOT change F unless the expression form itself changes.
• CC-F-9 Cross-context transport SHALL preserve the attributed F; if the receiving context rewrites the claim materially, it becomes a new episteme with its own F.
• CC-F-10 Translation loss, bridge loss, and plane crossings SHALL affect R rather than being hidden as F changes.
• CC-F-11 Assigned F values SHALL be justifiable by observable content such as explicit predicates, executable semantics, or machine-checked proofs.
• CC-F-12 Declaring a tool or notation SHALL NOT by itself justify a higher F unless the content satisfies the target anchor semantics.
• CC-F-13 Status labels such as Draft, Approved, or Published MUST NOT substitute for F.
• CC-F-14 A context that uses F in gates or policies SHALL write those thresholds explicitly.
• CC-F-15 Language-state facets such as articulation or closure MUST NOT be hidden as pseudo-levels of F.

#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 F coordinate of the typed F-G-R assurance tuple.
• Builds on: characteristic machinery from A.18 / A.19 and 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, and C.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

1. Can a competent reader misread the claim materially? If yes, the expression is likely at F0-F2; if not, it may be F3 or above.
2. Are the critical claims visible as explicit predicates or invariants? If yes, the expression is at least F4.
3. Does the expression have declared executable semantics? If yes, it is likely in the F5-F6 region.
4. Would a logic kernel or type checker reject an incorrect change to a core claim? If yes, the expression is likely F7-F8, or F9 if 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 F ladder.
• 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.Formality from C.2.3
• articulationExplicitnessRef -> U.ArticulationExplicitness from C.2.4
• languageStateClosureDegreeRef -> U.LanguageStateClosureDegree from C.2.5
• languageStateAnchoringModeRef -> U.LanguageStateAnchoringMode from C.2.6
• languageStateRepresentationFactorBundleRef -> U.LanguageStateRepresentationFactorBundle from C.2.7
• thresholdRefs? -> context-local threshold declarations over the governed facets
• routeNotes? -> 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, or U.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-1 A language-state facet profile SHALL reference explicit facet governing patterns rather than invent local unnamed factors.
• CC-C.2.LS-2 C.2.LS MUST NOT redefine F or create a second formality progression.
• CC-C.2.LS-3 Thresholds that matter for routing, reopening, or lexical repair SHALL be published on explicit facets.
• CC-C.2.LS-4 Trajectory accounts that rely on facet profiles SHOULD reuse A.16 move kinds and E.18 path publication rules.
• CC-C.2.LS-5 Composite labels such as early, settled, or ready SHALL NOT stand in for the explicit facet bundle when those states matter operationally.
• CC-C.2.LS-6 Composite readings, overlays, and route notes SHALL remain decomposable into named facets and MUST NOT behave as hidden master factors.
• CC-C.2.LS-7 A 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/late as a master scale. Split the judgement into the named facets.
• Formality capture. Letting F stand in for closure or articulation. Publish those facets explicitly.
• Bundle inflation. Turning U.LanguageStateFacetProfile into a second A.19. Keep it thin and referential.
• Opaque readiness. Using words such as ready or mature without 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 or authoritySourceRef targets.

#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/F3 because the note is structurally controlled but still lightweight;
• AE = AE2 because candidate anchors are visible but not yet fully relation-shaped;
• CD = CD1 because several routes remain live;
• LanguageStateAnchoringMode = AM.OperatorLoop because 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:

1. start from the local authoring problem rather than from a memorized progression;
2. name the facet refs explicitly;
3. add threshold refs only when a threshold changes routing, repair, or governance;
4. 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, and LanguageStateRepresentationFactorBundle;
• any threshold refs that substantively affect routing, repair, bridge interpretation, or review load;
• the local relation to F when readers might otherwise treat F as 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, or B.5.2.0 actually match the facet bundle;
• if the profile crosses a bridge or viewpoint boundary, are stance and loss notes kept in F.9 or F.9.1 rather 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

• AE may be used to state entry conditions for A.6.P.
• AE may be used to justify why an episteme remains in A.16.1 or B.4.1.
• AE shall not be used as a surrogate for closure, confidence, or truth.
• High F shall not be taken to imply high AE, and high AE shall not be taken to imply high F.

#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-1 AE SHALL NOT be treated as a synonym for F.
• CC-C.2.4-2 Entry into A.6.P SHOULD require at least the Context's declared articulation threshold.
• CC-C.2.4-3 AE judgements that drive routing or repair SHALL cite the anchors, contrasts, or slots that justify the chosen level.
• CC-C.2.4-4 Raising AE SHALL 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, low AE. Declare both.
• Mystical cue immunity. Low AE presented 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 AE is 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-1 Closure SHALL be declared independently from F and AE when it matters for routing, docking, or reopening.
• CC-C.2.5-2 Reopen/backoff moves SHALL cite the prior closure state they are relaxing.
• CC-C.2.5-3 Strong-closure states SHOULD name the guard, governingPatternRef, or authoritySourceRef that makes the closure binding.
• CC-C.2.5-4 Endpoint 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 CD explicitly.
• 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, or authoritySourceRef makes 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 not a representation factor bundle, not a closure state, and not a truth status. 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 often justifies a stance annotation 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-1 Anchoring mode SHALL NOT be inferred from publication phrasing alone when it matters for routing, trust, or bridge interpretation.
• CC-C.2.6-2 Embodiment-sensitive or operator-loop cases SHOULD declare the embodiment or operator anchor explicitly.
• CC-C.2.6-3 U.LanguageStateAnchoringMode MUST NOT be collapsed into U.LanguageStateRepresentationFactorBundle.
• CC-C.2.6-4 Mixed-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

A routed 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 handoff

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.LocalityDistribution
• U.Sparsity
• U.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;
• Formality;
• ArticulationExplicitness;
• LanguageStateClosureDegree.

A representation may be distributed yet have high trace anchoring; symbolic yet low-articulation; sparse yet low-closure. Those combinations shall remain visible.

#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-1 LanguageStateRepresentationFactorBundle SHALL be published as a factor bundle, not as a hidden scalar.
• CC-C.2.7-2 Local aliases such as EncodingBasis MAY exist only with an explicit docking to the governed factors.
• CC-C.2.7-3 Representation factors MUST NOT silently replace LanguageStateAnchoringMode or LanguageStateClosureDegree.
• CC-C.2.7-4 New 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 EncodingBasis or 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, symbolic/neuro-symbolic stacks, 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-stack 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 routing, comparison, or bridge claims.

#Boundary reminder

U.LanguageStateRepresentationFactorBundle describes representational organization only. It does not determine route authority, 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 routing, 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

#Kinds, Intent/Extent, and Typed Reasoning (Kind‑CAL)

One‑line summary. Establishes U.Kind as 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.

1. A neutral typed layer: name what a claim quantifies over (Kinds) without binding to any particular “type technology” (OWL, PL types, shapes…).
2. 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).
3. Typed reuse across Contexts: a dedicated KindBridge with CL^k (type‑congruence), so you can predict risk without touching F or G.
4. 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

1. 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.
2. 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.
3. 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).
4. Unsafe composition. Claims about incompatible “things” get composed because the entityOfConcern was implicit in prose.

#Forces