Cluster A.V - Constitutional Principles of the Kernel

Preface node heading:cluster-a-v-constitutional-principles-of-the-kernel:17874

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

Strict Distinction (Clarity Lattice)

Intent

Provide a single, didactically clear lattice of distinctions that keeps models free from category errors. This pattern is the guard‑rail that prevents four recurrent confusions:

  1. Role vs Function (mask vs behaviour),
  2. MethodDescription vs Method vs Capability vs Work (description vs abstract way-of-doing vs system ability/envelope vs performed occurrence),
  3. Holon vs System vs Episteme (what can act and what cannot),
  4. EntityOfConcern vs Description episteme, View, and Publication (the item under concern vs epistemes and publication lanes that make claims about it; specification is a gated use or refinement of a Description episteme, not a third peer member of this distinction).

It harmonizes A.12 (External Transformer), A.13 (Agential Role & Agency Spectrum), A.14 (Advanced Mereology), A.15 (Role-Method-Work Alignment), C.2.1 (U.EpistemeSlotGraph), E.17 (publication and view discipline), and F.9, F.17, and F.18 bridge and naming discipline.

Problem frame

  • Holons (A.1) and systems. All holons are part-whole units; only systems can enact behaviour.
  • Externalization (A.12). Every change is performed by a system bearing TransformerRole across a boundary; there is no “self‑magic”.
  • Quartet backbone (A.3, A.15). We separate MethodDescription (description), Method (abstract way-of-doing), Capability (a system's ability or envelope to enact a Method under conditions), and Work (run‑time occurrence), with the system bearing TransformerRole as the acting side.
  • Evidence (A.10). Knowledge claims cite Symbol-Carrier Register (SCR) carriers; epistemes never “act”; systems inspect, revise, publish, store, or rely on the carriers, publication forms, and project records that make an episteme available.

Practitioner check: if a sentence could be read as “the document decided” or “the process executed itself”, it violates A.7.

Boundary for use from other patterns: A.7 restores the EntityOfConcern, the admissible describing relation, and the publication boundary, then returns the work to the subject pattern. Do not let A.7 turn an architecture, structure, work, method, evidence, characterization, or decision question into a general discussion of descriptions. If the EntityOfConcern is itself a Description episteme or view, keep the pattern centered on that episteme as the item under concern; description-of-description or publication-force issues open only when they are the exact claim being made.

Problem

When documents blur the above lines, three classes of defects appear:

  1. Category collapse. People write “function”, “role”, or “process” interchangeably; teams then disagree whether they are changing a MethodDescription, a Method, a Capability envelope, or reporting an actual Work occurrence.
  2. Agency misplacement. Epistemes (documents, models) are treated as doers; collectives as raw sets; or a “holon” is used where only a system makes sense.
  3. Audit failures. A MethodDescription is cited as if it were evidence; Work has no evidence carriers or time span; or a Description episteme, a Description episteme admitted for specification use, a View, publication face, publication unit, or carrier is treated as if it were the EntityOfConcern, decision, permission, gate, work occurrence, or assurance result.

Forces

ForceTension
Didactic brevity vs conceptual precisionTeams want short words (“process”, “function”) ↔ the framework must keep five distinct distinctions apart.
Universality vs domain idiomsWe admit engineering idioms (procedure, SOP, algorithm, workflow) ↔ internally we must map them unambiguously.
Parsimony vs completenessMinimal concept set ↔ enough distinctions to avoid the classic traps (role/function; description/method/capability/work; episteme/carrier).

Solution — The Clarity Lattice (normative distinctions & safe vocabulary)

Terminology (normative): orthogonal characteristics

senseFamily — the categorical characteristic, used by F.7/F.8/F.9: {Role | Status | Measurement | Type‑structure | Method | Execution}. Rows must be sense‑uniform. • ReferencePlane — the referent mode per CHR: {world/external | conceptual | epistemic}. • EntityOfConcern and Description-episteme boundary — the item under concern is separated from Description epistemes (E.10.D2, C.2.1). Specification use is a gated use or refinement of a Description episteme; the exact gate must name checkability, formality plus checkable constraint, harness, acceptance condition, C.16 measurement criterion, verification use, or another specification-granting neighbouring pattern. Specification is not a third member of the strict distinction. • DesignRunTag — the design vs run DesignRunTag. It is not a temporal “plane”, generic layer, or stance. • Publication face, form, unit, carrier, and rendering boundary — Description epistemes, including Description epistemes admitted for specification use, may be made available through publication units, publication forms, faces, renderings, and carriers. These publication values are not the EntityOfConcern value, not the Description episteme itself, not the specification-use gate or refinement, and not evidence, gate passage, work, assurance, or decision force by readable form. The ordinary didactic faces for architectural patterns in FPF are: {PlainView (explanatory prose), TechCard (typed cards and IDs), NormsCard (TechCard profile for checklists), AssuranceLane (evidence bindings and lanes)}. Publication faces and forms are orthogonal to the EntityOfConcern and Description-episteme boundary, to specification-use gates and refinements, and to DesignRunTag. • Typed describing morphism and specification-use exitDescribe_EoC_DescEp : EntityOfConcern -> DescriptionEpisteme describes an EntityOfConcern value into a Description episteme under a declared construction/reference trace; it is not a mechanism and does not execute work. A later refinement, formalisation, or specification-use claim over that Description episteme is governed by the neighboring pattern governing the claim whose force is live: 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. A.7 keeps those exits visible but does not turn them into a second strict-distinction member. Laws (normative for A.7): (DESC-1) Non-extensibility of content and (DESC-2) identity and meaning-preserving composition. Specification-use/refinement laws are enforced by the neighboring pattern governing the claim that selects the gate and value set.

EntityOfConcern / episteme / publication boundaryEntityOfConcern wording names the item under concern under the declared construction/reference trace; it does not name a document, publication face, carrier, or unspecified referent. Describe_EoC_DescEp yields a Description-side U.Episteme about that EntityOfConcern value. A Description episteme may later be used as a specification only when a bounded use declares formality plus checkable constraint, harness, acceptance condition, C.16 measurement criterion, verification use, or another specification-granting gate. Publication faces, cards, views, lanes, records, and carriers remain orthogonal lanes: they can make Description epistemes available, but they do not become the EntityOfConcern value, the Description episteme, specification-use gate/refinement, evidence, gate passage, work, assurance, or decision force by appearing in a publication form.

A.7 establishes the following pairs and triplets. Use their names and scope exactly as below.

Role vs Function (behaviour)

  • Role (role‑object, mask). A contextual position a holon can bear (A.2, A.15). A role is not behaviour; it is the mask under which behaviour may be enacted. Example: Cooling‑CirculatorRole in a thermal loop.

  • Function = behaviour = Method under a role. What a system is described as doing when bearing a role. In Transformer context, this behaviour is a Method (abstract way-of-doing) that a system may have the Capability to enact under conditions and that can be performed as Work (run‑time).

    • Safe rewrite for earlier “Holonic Duality (Substance ⧧ Function)”: Holonic Duality (Substance ⧧ Role). A U.System keeps its identity (substance) while switching roles; each role may entail a Method (abstract way-of-doing), a Capability envelope to enact that Method under conditions, and possible Work (performed occurrence).

Normative guard: Use “Role” for the mask; use “Method” for the abstract way-of-doing, “Capability” for a system ability/envelope to enact a Method under conditions, and “Work” for the performed occurrence. Do not call the role itself a function, and do not define Method as Capability.

MethodDescription vs Method vs Capability vs Work (description vs way-of-doing vs ability envelope vs occurrence)

  • MethodDescription — the description (algorithm / SOP / recipe / script) at design-time. Its publication cites SCR carriers when the carrier is used as evidence or source.
  • Method — the abstract order-sensitive way-of-doing composed with Γ_method (B.1.5). A Method is not an occurrence and not the system ability itself; concrete values are bound at U.Work creation. Outside executions we refer to it via MethodDescription (see A.3.1 CC‑A3.1‑5/‑9; A.15 §2.2, §4.1).
  • Capability — the system ability/envelope to enact a Method under stated roles, conditions, resources, and constraints. A Capability belongs to a system-in-context; it is not the MethodDescription and not the performed Work.
  • Work — the dated run‑time occurrence (what actually happened), with resource spend (Γ_work) and temporal coverage (Γ_time).

Normative guard: Never use MethodDescription as evidence of Work; never present Method or Capability as if it had happened; never define Method as Capability.

Holon vs System vs Episteme (who can act)

  • System — the only holon kind that can bear behavioural roles and enact Method and Work.
  • Epistemecannot act; it is changed via its carriers by a system. Epistemes may bear non‑behavioural roles (e.g., ReferenceRole, ConstraintSourceRole).
  • Holon — umbrella term; do not use it where only system is meaningful (e.g., “holon bearing TransformerRole” is invalid; write “system bearing TransformerRole”).

Normative guard: Behavioural roles (including TransformerRole) have domain = system. Epistemes may bear purely classificatory roles only.

Episteme vs Symbol Carrier (SCR/RSCR)

  • Episteme — the knowledge content (claim, model, requirement set).
  • Symbol Carrier — the physical or digital carrier for an episteme publication or stored representation (file, volume, dataset item), tracked in SCR; remote sets in RSCR.
  • Use: Evidence, provenance, and reproducibility address carriers; arguments and validity address epistemes.

Normative guard: When you say “we updated the spec”, detail which carriers changed (A.10).

Collective vs Set, and MemberOf vs Component/Constituent/Portion/Phase (A.14)

  • Set / Collection (MemberOf)mathematical or catalog grouping; no joint behaviour implied.

  • Collective System — a system with boundary and coordination Method (e.g., a team).

  • Use relations correctly:

    • ComponentOf — mechanical/structural part in systems.
    • ConstituentOf — logical/content part in epistemes.
    • PortionOf — quantitative portion with conserved extensives.
    • PhaseOf — temporal part/state across a continuous identity.
    • RoleBearerOf — a system is the bearer of a Role.

Normative guard: If the grouping is expected to act, model a collective system (not a set) and provide its role, Method, and Work.

Operator alignment (required names)

  • Γ_sys — composition of system properties (physical/systemic).
  • Γ_method — composition of Method (order, branching).
  • Γ_time — composition of Work histories and temporal parts.
  • Γ_work — composition of resource spend and yields tied to Work. Do not track costs with Γ_method; costs (resources/yield) belong to Γ_work.

Normative guard: Avoid generic “process” for these operators. Reserve “process” for domain idioms; map internally to Method (design) and Work (run).

EntityOfConcern and Description-episteme boundary vs publication face, form, unit, and carrier boundary (orthogonal, normative)

  • A.7 and E.10.D2 govern the EntityOfConcern-to-description boundary. What the EntityOfConcern value is and how it is described are distinct questions. Description is a U.Episteme use with DescriptionContext. Specification is a gated use or refinement of a Description episteme, selected by checkability, formality plus checkable constraint, harness, acceptance, C.16 measurement criterion, verification use, or other neighboring pattern governing the claim force; it is not a peer class beside EntityOfConcern and Description.
  • Publication governs availability. Publication units, publication forms, faces, renderings, and carriers make Description epistemes available to readers or tools, including Description epistemes admitted for specification use. They do not become the EntityOfConcern value, the Description episteme, the specification-use gate/refinement, or a symbol carrier by the same relation; physical and digital carriers stay in SCR/RSCR (A.10).
  • Publication-face field pins. When Description epistemes or Description epistemes admitted for specification use are shown on TechCard, the minimal CHR-Pins are {UnitType, ScaleKind, ReferencePlane, EditionId}.
  • Bridge routing. Cross-context or cross-reference-plane reuse cites Bridge id + CL; Phi(CL) and Phi_plane penalties route to R (trust) only; F and G invariant.

Same or near-same EntityOfConcern across descriptions and views

Different descriptions, views, viewpoints, publication units, or role-method-interest positions may concern the same EntityOfConcern, different entities of concern, or an unresolved candidate set. A.7 does not accept sameness by publication title, view label, carrier continuity, shared ordinary name, or common reader interest.

Use this split when the text needs to say whether two descriptions or views are about the same thing:

CaseA.7 relation caseAdmissible move
same referent by valuethe localized EntityOfConcern or relation named by value/claim/reference case and the resolved entityOfConcernRef, where live, refer to the same item by declared reference disciplinesame-entity work inside the declared use
preserved by viewingA.6.3 viewing preserves entityOfConcernRef while changing content, representation, viewpoint, or other episteme slotssame-EntityOfConcern Description, Specification, or view transformation
publication-unit primary onlya bounded publication unit states what it is mainly about, plus its carried move and outside-work boundary, without establishing a claim-bearing episteme trace by itselfpublication-unit stability only
bridge-conditional near identityF.9, F.17, or F.18 admits bounded near-identity or substitution under bridge kind, CL, direction, loss, and bridge-admissible usebridge-scoped reuse only
retargeted under invariantA.6.4 changes entityOfConcernRef under KindBridge, invariant, and loss disciplineretargeted use only under stated invariant
unresolved candidateconstruction/reference/bridge/witness trace is insufficientcandidate tracking, question framing, or non-use
different entityno admissible sameness or near-sameness path exists for the intended usekeep entities distinct

If the same or near-same relation needs mathematical or postulate-theory justification, A.7 exits rather than pretending to prove it: use C.29 for the mathematical lens, TGA and P2W where transduction and postulate-theory work supply the required justification, E.18 where a gate crossing is the live relation, or the relevant architecture or TGA pattern where the comparison is about structure, graph, flow, or architecture description.

Typed describing morphism and specification-use exit (normative)

What Describe_EoC_DescEp means in A.7. For any EntityOfConcern value X, describing X is the morphism application Describe_EoC_DescEp(X) : DescriptionEpisteme. A.7 does not define a second strict-distinction arrow from Description to Specification. When a Description episteme is formalised, constrained, test-harnessed, accepted, or used as a specification, that is an episteme-refinement or specification-use question handled by A.6.2, C.2.3, A.21, C.16, E.17, E.10, or another neighboring pattern governing the claim according to the live force.

Example. A formal postulate theorem in physics can be a Description episteme about the behaviour of a physical grounding holon. 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, or verification use. Formal notation alone does not make it a third kind beside the physical EntityOfConcern and the Description episteme.

Invariants (normative for A.7, split by EntityOfConcern kind):

  1. Episteme-source preservation (DESC-1E). When the EntityOfConcern value X is itself a U.Episteme, a claim graph, a claim-bearing view, or another claim-bearing source, Describe_EoC_DescEp(X) MUST NOT silently add epistemic commitments. Added structure is only declared representation, indexing, cross-reference, or refinement/loss under the neighboring pattern governing the claim that grants it.
  2. Non-episteme describing trace (DESC-1N). When X is a system, structure, work occurrence, role assignment, method, physical object, characteristic, relation, or other non-episteme value, claims are not "inside X" waiting to be copied. A Description episteme may add claims about X only through a declared construction, reference, measurement, observation, model, postulate-theory, or witness trace, with admissibility conditions visible for the intended use.
  3. Identity and meaning preservation (DESC-2). If f : X -> Y is a meaning-preserving, bridge-admitted, or construction-preserving map for the selected EntityOfConcern values, then Describe_EoC_DescEp(f) is defined only for the declared scope and preserves the identity, near-identity, bridge, loss, or retargeting relation that the governing pattern admits. Where meaningful composition exists, Describe_EoC_DescEp(f o g) = Describe_EoC_DescEp(f) o Describe_EoC_DescEp(g) only under that declared relation.
  4. Specification-use exit. If a Description episteme is refined into specification use, the refinement must name the neighboring pattern governing the claim and gate that grants that use. A.7 only requires that the refinement remains separate from the EntityOfConcern, from publication expression, and from Work.
  5. Separation from Gamma. Describe_EoC_DescEp and any neighbouring specification-use refinement do not compose with Gamma_method, Gamma_time, or Gamma_work; describing, formalising, or specifying is not execution and accrues no resource or time semantics.
  6. Ontology preservation. Describing any EntityOfConcern value, such as a Calculus, Signature, Mechanism, Structure, Work occurrence, or Episteme, via Describe_EoC_DescEp does not change its ontology; it yields a Description episteme under A.7 rules. Publication through faces, forms, units, and carriers is handled separately in E.17 (MVPK).

Bridge to U.Work (normative invariants)

OUTSPEC‑INV‑1 (No metonymy). promisedOutcomeSpecRef points to an OutcomeSpec, not to U.Work and not to an extensional delivered-result referent. The actuals live on U.Work (A.15.1) and its evidence carriers.

OUTSPEC‑INV‑2 (Evaluability from work evidence). All predicates referenced by workPredicateRef, postConditionRef, and unitOfDelivery.countingRule.* MUST be evaluable from U.Work facts and cited evidence (including U.Work.Δ state records or evidence carriers). They MUST NOT require introspecting the internal structure of the provider system unless that structure is itself exposed as evidence.

OUTSPEC‑INV‑3 (Counting coherence). If unitOfDelivery is present, its countingRule MUST select only work episodes that are eligible to satisfy the promise content and MUST not silently double‑count (use dedupeKeyRef or a cited policy).

Canonical examples (didactic)

Example 1 — Work‑only (promise the work): “provide consultation for ≥5 minutes”.

OutcomeSpec(OS‑Consult‑5min) := {
  mode: WorkOnly,
  workSpec: {
    methodConstraintRef?: MD‑Consultation,
    workPredicateRef: E‑(duration(work) ≥ 5 minutes)
  }
}

unitOfDelivery := {
  unitLabel: "minute",
  countingRule: {
    selectorRef: E‑(work fulfils OS‑Consult‑5min),
    quantityRef: E‑durationMinutes(work),
    aggregation: sum
  }
}

Example 2 — Result‑only (promise the world state): “a hole of depth ≥ 1 m exists”.

OutcomeSpec(OS‑Hole‑1m) := {
  mode: ResultOnly,
  resultSpec: {
    deliveredResultReferentRef: kind(Hole),
    statePlaneRef: GeometryPlane,
    postConditionRef: E‑(depth(hole) ≥ 1 m ∧ location(hole) within SiteScope)
  }
}

unitOfDelivery := {
  unitLabel: "hole",
  countingRule: {
    selectorRef: E‑(work fulfils OS‑Hole‑1m),
    quantityRef: E‑1,
    aggregation: count,
    dedupeKeyRef: E‑holeId(work)         // prevents double counting when rework happens
  }
}

Example 3 — Composite (promise both): “hairstyle for the evening, produced within 20 minutes, by cut+style (not a wig)”.

OutcomeSpec(OS‑Hair‑Evening‑20min) := {
  mode: Composite,
  workSpec: {
    methodConstraintRef: MD‑CutAndStyle‑NoWig,
    workPredicateRef: E‑(duration(work) ≤ 20 minutes)
  },
  resultSpec: {
    deliveredResultReferentRef: kind(HairstyleOnClient),
    statePlaneRef: AppearancePlane,
    postConditionRef: E‑(looksLike(style="Evening") ∧ survivability(afterShower) ≥ acceptable)
  }
}

unitOfDelivery := {
  unitLabel: "session",
  countingRule: {
    selectorRef: E‑(work fulfils OS‑Hair‑Evening‑20min),
    quantityRef: E‑1,
    aggregation: count,
    dedupeKeyRef: E‑appointmentId(work)
  }
}

(Where E‑(…) denotes an Episteme/predicate defined in the relevant Context; this appendix does not introduce an expression language.)

Archetypal Grounding (Tell-Show-Show; System and Episteme)

System and Episteme example

System archetype — “Digital‑twin vs asset”. Claim: The twin (episteme) does not “act”; the system bearing TransformerRole enacts Work on the asset; evidence binds to carriers. Show: A maintenance MethodDescription (tech card) lives at design‑time; a Work record (assurance face) lists Γ_time, Γ_work, PathId and carrier ids for telemetry. The twin’s update is Work on the carrier, not the asset; CL^plane penalties are disclosed when twin–asset crossings are analysed.

Episteme archetype — “Peer‑review vs manuscript”. Claim: A review is Work by a system (the reviewer) on carriers of an episteme (the manuscript). Show: The MethodDescription is the review SOP; the Work cites carrier ids (file/edition) and the selected episteme; arguments/rebuttals live on epistemes; acceptance gating lives in CAL, not in CHR cards.

Didactic examples

Example 1 — Pump in a cooling loop

  • Substance (system): Centrifugal pump P‑12.
  • Role: Cooling‑CirculatorRole.
  • MethodDescription: “Loop Circulation v3” (TechCard, cited through SCR carriers).
  • Method: ordered way-of-doing: start → ramp → hold → stop (Γ_method).
  • Capability: P-12 control-unit ability/envelope to enact that Method under stated roles, conditions, resources, and constraints.
  • Work: run on 2025‑08‑09 10:00–10:45; energy ledger via Γ_work; log via Γ_time.
  • Safe phrasing: “The system playing Cooling‑CirculatorRole (via the P‑12 control unit as Transformer) had the Capability to enact the Method described by MethodDescription, and executed Work …”
  • What not to write: “The pump’s function is the role” (role ≠ behaviour).

Example 2 — Standard document cited in a design

  • Episteme: “Safety Standard S‑174”.
  • Carriers: PDF (SCR id: scr://std/S‑174/2025‑07), printed volume (scr://print/S‑174/2e).
  • Role: ReferenceRole in the valve selection activity.
  • System bearing TransformerRole: design team’s selection service.
  • MethodDescription: “Valve Selection SOP v5”.
  • Method: abstract valve-selection way-of-doing described by that SOP.
  • Capability: design team's selection-service ability/envelope to enact the Method under the project conditions.
  • Work: dated selection session that used the standard; the episteme did not act.

Example 3 — Set vs team

  • Set (MemberOf): {Alice, Bob, 3.14} — a collection; no behaviour implied.
  • Collective system (team): boundary, coordination Method, supervision Work; can bear AgentialRole (A.13).
  • Safe phrasing: “Team T plays Cooling‑MaintenanceRole and executed Work W…”

Conformance Checklist (normative)

IDRequirementPractical test
CC‑A7.1 (Role/Behaviour split)A Role must be modelled as a contextual mask borne by a holon; behaviour must be expressed as Method (abstract way-of-doing), with Capability as the system ability/envelope to enact that Method under conditions and Work as the run-time occurrence.In any sentence, if “role” is used as if it does something, rewrite: the system bearing TransformerRole does it by enacting a Method through a Capability in Work.
CC‑A7.2 (Transformer domain)TransformerRole SHALL be borne only by a system.Type‑check: bearer ∈ U.System. “holon bearing TransformerRole” is invalid.
CC‑A7.3 (Episteme non‑agency)An episteme SHALL NOT be described as acting. All changes to epistemes must be routed to their symbol carriers (A.10) by a system bearing TransformerRole.Text contains the acting system + carriers (SCR ids).
CC‑A7.4 (MethodDescription ≠ Method ≠ Capability ≠ Work)MethodDescription (description episteme), Method (abstract way-of-doing), Capability (system ability/envelope to enact a Method under conditions), and Work (performed occurrence) SHALL be kept distinct in wording and modelling.Ask: is there a MethodDescription or design-time publication, a Method, a Capability claim about a system, or a dated occurrence? Each live MethodDescription, Method, Capability claim, and dated Work occurrence must be named separately.
CC‑A7.5 (Operator fit)Use Γ_method only for composing Method; Γ_time only for Work histories; Γ_work only for resource spend/yields; Γ_sys for systemic properties of systems.No sentence should use a single generic “process operator” for all three.
CC-A7.6 (SCR carrier reference)Any knowledge claim that references documents or data SHALL cite carriers via SCR/RSCR on first mention in the subsection.First mention expands as “Symbol-Carrier Register (SCR)”; references list carrier ids.
CC‑A7.7 (Collective vs set)If a grouping is expected to act, it MUST be modelled as a collective system (boundary + coordination Method + Work), not as a MemberOf set.Presence of boundary, Method, Work for the group.
CC‑A7.8 (Diagram legend)When domain idioms use “process”, diagrams or text MUST map them to FPF terms on first occurrence: process (domain) ≡ Method at design time or Work at run time.Legend or parenthetical present at first use.
CC‑A7.9 (Substance ⧧ Role wording)The safe formula is “System (substance) plays Role; under that Role it has Method; its execution is Work.”Sentences follow this order; “function” used only as synonym for behaviour, never for the role.
CC‑A7.10 (Quartet clarity)Any “triad” picture MAY be used only as a design‑time stand‑in (Transformer + MethodDescription + Method) and MUST be accompanied by an explicit Work lane elsewhere in the same section. “quartet of quartets” headings SHALL be avoided; use “Quartet backbone” instead.Diagram has a visible Work lane/timeline or separate box within the same section.
CC‑A7.11 (Terminology hygiene)Ban “actor” in core text. Use “system bearing TransformerRole”; bind local shorthand “Transformer” only per A.12 rules.Plain text scan: no “actor”; shorthand is locally bound.
CC‑A7.12 (Role domain guards)Behavioural roles’ domain = system. Epistemes may bear non‑behavioural roles (e.g., ReferenceRole, ConstraintSourceRole) only.Role declarations name their domain.
CC-A7.13 (EntityOfConcern-to-Description visibility)Conforming EntityOfConcern and Description-episteme use makes Describe_EoC_DescEp recoverable and does not conflate it with MVPK, TGA, specification use or refinement, or Work steps. If a flow shows only publication faces and forms, the underlying EntityOfConcern and Description episteme are recoverable.EntityOfConcern and Description episteme are visible in text and diagrams; audit shows the describing operation and its construction/reference trace.
CC-A7.14 (Describe_EoC_DescEp laws)Any implementation of Describe_EoC_DescEp MUST enforce the split DESC-1E/DESC-1N/DESC-2 law family. Episteme EoCs preserve or refine source claims under declared loss; non-episteme EoCs receive claims only through declared construction/reference/measurement/model/witness traces. Specification-use refinement is checked by the neighboring pattern governing the claim that grants the gate, not by A.7 as a third strict-distinction member.Audit shows whether the EoC is episteme-like or non-episteme, which trace introduces claims, and which relation preserves identity, near-identity, bridge, loss, or retargeting.
CC-A7.15 (Specification-use exit)If text claims that a Description episteme is a specification, formal specification, requirement, acceptance item, harnessed invariant, or measurement-criterion object, it names the exact gate: C.2.3 formality plus checkable constraint, A.21/gate or acceptance discipline, C.16 measurement-criterion discipline, A.6.2 episteme refinement, E.17 publication expression of an already admitted specification use/refinement, E.10 suffix discipline, or another neighboring pattern governing the claim. Formal notation alone is insufficient.The text shows the specification-granting gate and does not make specification a peer ontology class beside EntityOfConcern and Description.
CC-A7.16 (Γ-separation)describing morphisms (Describe_EoC_DescEp), specification-use refinements, and publication-face or publication-form projections (MVPK) carry no cost/time semantics; Γ_method, Γ_time and Γ_work belong to Method, Work, or System, not to description, specification-use refinement, or publication. Any aggregate on a card cites the Γ operator and policy.No ledger/time fields attached to Describe_EoC_DescEp, specification-use refinement, or MVPK publication steps; any “publication cost” is Work in a separate publication service.
CC‑A7.17 (Publication face and form discipline)Publication names use the current publication face, form, unit, carrier, and rendering vocabulary. PlainView, TechCard, InteropCard, and AssuranceLane are faces over epistemes or views; new ...PublicationFace or ...PublicationForm heads are not introduced as A.7 kinds in this ontology.Token scan shows no ad‑hoc ...PublicationFace or ...PublicationForm kinds.
CC‑A7.18 (Bridge+CL on crossings)Any cross‑Context or cross‑plane content on a face MUST cite Bridge id + CL and Φ policy‑ids; penalties route to R only.Presence of Bridge ids and Φ(CL) and Φ_plane on TechCard or AssuranceLane.
CC-A7.19 (UTS row reference)Public names shown on faces SHALL point to UTS rows with twin labels (Tech/Plain), edition pins, and SCR carrier ids.Face carries UTS row ids + edition pins.

Canonical rewrites (didactic library)

Instead of (ambiguous)Write (canonical)Why
“The process enforced the rule.”“The system bearing TransformerRole enforced the rule by executing the Method; the Work cites evidence carriers ⟨ids⟩.”Processes don’t act; systems do. Evidence via Work + SCR.
“The specification decided to tighten limits.”“The design‑control service (system bearing TransformerRole) updated the carriers of the spec (SCR ids), producing Work at ⟨time⟩.”Epistemes are changed via carriers by systems.
“Our role is pump; the role circulates coolant.”“The system plays Cooling‑CirculatorRole; under this role its Method circulates coolant; Work was executed ⟨when⟩.”Role = mask; behaviour = Method and Work.
“We followed the blueprint, so it’s done.”“We have a MethodDescription and a Method; if ability is claimed, name the system Capability separately; completion is evidenced by Work with ⟨timestamps, outcomes⟩.”Description, Method, and Capability are not the occurrence.
“Team = set of members; it performed repair.”“The team is a collective system (boundary + coordination Method); it executed Work ⟨…⟩.”Acting groups must be systems, not sets.
“Process cost is tracked by Γ_method.”Work cost is tracked by Γ_work; Γ_method composes the Method (order/branching).”Operator alignment.
“Holon bearing TransformerRole.”System bearing TransformerRole.”Only systems can bear behavioural roles.
“Publication is a special mechanism.”“Publication = availability of existing Description epistemes, including Description epistemes admitted for specification use, through publication units, forms, and faces (MVPK); describing is Describe_EoC_DescEp, specification use or refinement exits to the neighboring pattern governing the claiming gate, and any execution around them is separate Work by a system on carriers.”Publication is not behaviour; it is a Description-episteme-to-publication availability relation in the model.

Anti‑patterns (with fixes)

  1. Role‑as‑behaviour — calling the role “the function”. Fix: Name the role, Method, and Work explicitly.

  2. Episteme‑as‑system — “the model routed traffic”. Fix: Name the system (or Transformer as a system bearing AgentialRole) that used the model; list carriers touched.

  3. Triad everywhere — omitting Work entirely. Fix: Add the Work lane: timestamps, outcomes, Γ_time coverage.

  4. Operator blur — using one “process operator” for everything. Fix: Choose among Γ_method, Γ_time, Γ_work, Γ_sys.

  5. Set‑as‑collective — a MemberOf set “decides”. Fix: Model a collective system with coordination Method.

  6. Evidence without carrier references — citing ideas without carriers. Fix: Add SCR/RSCR ids; tie claims to carriers.

  7. Holon/system drift — “holon maintains temperature”. Fix: Say system; reserve “holon” for neutral mereology.

  8. Function and role swap in tables — columns labelled “Function” but entries are roles. Fix: Rename column to Role; add a separate Behaviour (Method and Work) column.

  9. Process‑word leakage — domain “process” used as FPF operator. Fix: Add parenthetical mapping at first use (Method and Work).

  10. Carrier and episteme swap — “we versioned the model” meaning a file was renamed. Fix: State whether the episteme content changed; if only a carrier was renamed, say so.

  11. Publication-as-mechanism — modelling “publication” as if it were a Method or Mechanism. Fix: Separate describing (Describe_EoC_DescEp), specification-use refinement, and publication (MVPK Description-episteme-to-publication face, form, unit, carrier, and rendering availability). If there is operational toil (build, render, upload), model it as Work by a system on carriers; do not change the EntityOfConcern value, the Description episteme, specification-use gate/refinement, or the publication relation being presented.

Consequences

BenefitWhy it mattersTrade‑off / Mitigation
Category safety at scalePrevents silent logic bugs across holarchies.Slight verbosity → use local shorthand per A.12.
Trustworthy evidenceWork plus SCR carrier references make claims auditable.Requires discipline → provide checklists.
Operator determinismCorrect Γ‑flavour selection preserves invariants.A bit more modelling → reusable templates.
On‑ramp for managersCanonical rewrites give immediate phrasing fixes.Team training → this pattern is the training page.

EntityOfConcern and publication-boundary consequences

BenefitsTrade‑offs / Mitigations
Category-error firewall. Clear separation of System and Episteme, EntityOfConcern and Description-episteme boundary, specification use or refinement, and publication availability removes recurring modeling defects.Authors must name publication face, form, unit, carrier, and rendering uses explicitly; mitigated by E.8 publication-face guidance.
Audit and pedagogy align. SCR/RSCR point to carriers; Normative face houses checklists; Plain face teaches; Tech face types.Slight increase in pattern length; offset by predictable navigation and machine‑checkable CC.
Cross-Context safety. Bridge+CL discipline is visible on publication faces and forms when they carry cross-context material.Authors must cite CL policy-ids; tooling can assist (GateCrossing visibility harness), but text remains notation-independent.

SoTA‑Echoing (post‑2015 practice alignment)

  • Digital Twins (ISO 23247, 2021→): separates the asset (system) from its digital representation (episteme) and prescribes governance of twins without attributing agency to the twin itself — matching A.7’s “episteme ≠ actor” and carrier discipline. Adopt.
  • Observability (OpenTelemetry, 2019-2025): codifies semantic conventions as publication-form discipline over traces, metrics, and logs; semantics are governed by descriptions, not exporters, echoing A.7 publication-face and publication-form orthogonality. Adapt (terminology).
  • Active Inference (2017→2024): separates a generative model (episteme) from actions by the agent (system), with explicit perception–action cycles — mirroring A.7’s “who can act” and stance separation. Adopt
  • Constructor Theory (2016→): frames knowledge and work as possible transformations enacted by constructors (systems), not by informational states — reinforcing “episteme ≠ actor”. Adopt
  • Quality‑Diversity (MAP‑Elites family, 2015-2024): archives are sets on typed spaces (descriptions) whose occurrences are runs; selection returns sets under admissible orders, consonant with A.7 and A.15’s set-returning discipline. Adopt and adapt.
  • Refinement‑typed specs (2016→): modern stacks (e.g., Liquid Haskell, Dafny’s post‑2017 refinements, Rust’s uom type‑level units) treat formalization as monotonic refinement with pinned units and scales. A.7 uses them only to motivate the specification-use exit; the refinement laws belong to the neighboring pattern governing the claiming specification, formality, measurement-criterion, and publication patterns. Adapt (terminology; pinning discipline).

Rationale (informal)

  • Engineering cognition: Large programmes fail less from equations than from category slips (“process vs procedure vs execution”). A.7 eliminates these slips by a small, repeatable grammar.
  • Compatible with ISO/BORO practice: Distinguishing specifications as descriptions, procedures as capabilities, and operations as occurrences mirrors established systems-engineering discipline while keeping FPF’s holonic rigor.
  • Didactic primacy: Practitioners can approve sentences by spotting the quartet in context: system bearing TransformerRole, Role, MethodDescription, Method, Capability, Work, and SCR where evidence is claimed.
  • Why name publication faces and forms in A.7? Strict Distinction already guards the EntityOfConcern value from the Description episteme that makes claims about it. In practice, misreadings happen at the publication face: cards and tables are mistaken for EntityOfConcern values; governance words leak where physics or logic should stand. Naming publication face, form, unit, carrier, and rendering uses as orthogonal closes that gap without entangling semantics with any tool or notation. Specification use or refinement is also named only to keep it orthogonal to EntityOfConcern, Description, and publication expression. This preserves C-1 universality and P-1 Cognitive Elegance, while giving E.8 a crisp governing source for multi-face presentation rules.

Relations

Builds on: A.1 (Holon), A.2 (Roles), A.3 (Transformer Quartet), A.10 (Evidence & SCR), A.12 (External Transformer), A.14 (Advanced Mereology), A.15 (Role–Method–Work Alignment).

  • Constrains: A.13 (Agency sits on systems only; epistemes non‑behavioural), Part B operators (Γ_method/Γ_time/Γ_work/Γ_sys) and their choice points; publication is not a Γ‑operator.
  • Extends: E.8 (Authoring conventions), E.10 (lexical and precision restoration), Part F and Part G (UTS and CG-Spec or CHR pinning), B.3 (Assurance routing), C-cluster (selection and archives) by enforcing EntityOfConcern and Description-episteme boundary, specification-use exit, publication availability orthogonality, System and Episteme separation, same or near-same EoC discipline across views, and typed EntityOfConcern-to-Description describing discipline (publication = Description-episteme-to-publication face, form, unit, carrier, and rendering availability in E.17).
  • Coordinates with: E.18 (E.TGA - GateCrossing and OperationalGate(profile)) for crossing visibility and publication gating, A.21 for gate checks, F.9, F.17, E.17, and E.18 for Bridge+UTS pinning discipline, E.10 for lexical SD checks, and Part F (Bridges and CL) for explicit cross-Context identity, without embedding any notation dependence.

Practitioner one-page review (copy-paste)

Approval sentence template

“The system bearing TransformerRole ⟨name⟩ plays ⟨Role⟩; it has Capability ⟨C⟩ to enact Method ⟨M⟩ (from MethodDescription ⟨S⟩) and executed Work ⟨W⟩ on ⟨time⟩, citing ⟨SCR ids⟩ as evidence carriers; resources accounted via Γ_work.”

Five binary checks

  1. Actor ban: No “actor” token; canonical phrasing present.
  2. Clear quartet: MethodDescription, Method, Capability, and Work are all named (as applicable) and not conflated.
  3. Right Γ: Γ_method composes Method; Capability states a system ability/envelope under conditions; Γ_time covers occurrences; Γ_work accounts resources; Γ_sys covers system properties.
  4. Episteme handled: Epistemes do not act; carriers listed (SCR).
  5. Group clarity: Acting group is a collective system, not a MemberOf set.

Diagram legend stub

  • “process (domain)” ⇒ Method (design‑time) / Work (run‑time).
  • Role column lists masks (e.g., Cooling‑CirculatorRole).
  • Behaviour column shows Method and Work, not the role itself.

A.7:End

Universal Core Principle (C‑1)

“A principle that works in only one world is local folklore; a first principle architects every world.”

Problem Frame

FPF aspires to be an operating system for thought that engineers, biologists, economists, and AI agents can all use without translation layers. That promise rests on the universality of its core primitives (U.Types). History is littered with “upper ontologies” that proclaimed universality yet smuggled in the biases of a single discipline; once deployed beyond their birthplace, they cracked or ballooned. Rule C‑1 turns “universal” from a marketing word into a measurable criterion: cross‑domain congruence.

Problem

PathologyManifestation
Parochial DriftA “universal” U.Resource works for ERP bills of materials but collapses for ATP in cell biology.
Alienated CommunitiesSubject‑matter experts recognise the bias and abandon the framework, fracturing knowledge silos.
Kernel BloatCompeting “almost‑universal” types are added to patch gaps, violating Ontological Parsimony (A 11).

Forces

ForceTension
Generality vs SpecificityPrimitives must stretch across physics ↔ social science yet keep actionable meaning.
Rigor vs PragmatismProof of universality must be checkable, not philosophical hand‑waving.
Inclusivity vs CoherenceWelcoming new ideas should not swamp the kernel with domain jargon.
Cognitive Load vs GroundingExamples help readers, but too many examples obscure the essence.

Solution — The Three‑Domain Falsification Test

Normative Rule (C‑1) A U.Type enters the kernel only if it is shown to play the same Role in at least three foundationally distinct domains.

Heterogeneity & QD‑triad guarantee (C‑1.QD). In addition to distinct domain‑families (choose from: Exact Sciences - Natural Sciences - Engineering & Technology - Formal Sciences - Social & Behavioural Sciences), the triad SHALL demonstrate quality diversity: (a) Hetero‑test. Each projection adds at least one non‑trivial DescriptorMap signal or Bridge path not subsumed by the other two (no aliasing by mere renaming). (b) QD evidence. Publish Creativity‑CHR / NQD‑CAL evidence for the triad: Diversity_P (set‑level) and its IlluminationSummary telemetry metric with ≥3 non‑empty cells and occupancyEntropy > 0 under the declared grid. (c) Policy disclosure. Declare the Context‑local QD_policy (binning/grid, kernel, time‑window) used to compute the telemetry metrics. (References: C.17 Diversity_P & illumination Summary as telemetry metric; C.18 U.DescriptorMap, U.IlluminationSummary.)

Implementation steps (Domain Families):

  1. source domain‑families from the active F1‑Card (taxonomyRef/embeddingRef edition). The five coarse families {Exact, Natural & Life, Engineering & Tech, Formal, Social & Behavioural} are informative only; if used for pedagogy, publish an explicit mapping to the F1‑Card taxonomy. The triad gate is measured by MinInterFamilyDistance ≥ δ_family (per F1‑Card), not by labels alone.

  2. Role‑Projection Records For each domain, author a short Role‑Projection tuple: {domain, indigenous term, Role, exemplar}. Example: {physics, "Free Energy", extremum driver, closed gas system}.

  3. Congruence Check All three exemplars must satisfy the same abstract intent; superficial analogy is rejected.

  4. Living Index Track the ratio

    $$ U\text{-Index}=\frac{\text{# kernel types lacking 3 projections}}{\text{# kernel types}} $$

    as a health signal; target ≤ 0.05 (not a bureaucratic gate).

Rule of thumb for busy managers:One idea, three worlds. If you can’t point to the trio, park it in a Extention Pattern.”

Archetypal Grounding (System / Episteme)

Universal U.TypeDomain 1 - PhysicsDomain 2 - Life Sci.Domain 3 - Tech & Soc.Congruent Role
U.ObjectiveFree Energy minimum in thermodynamicsFitness maximisation in evolutionLoss minimisation in MLExtremum driver of change
U.SystemThermodynamic control volumeBiological organism (cell membrane)Cyber‑physical system (IoT edge)Bounded interacting whole
U.ResourceJoules of energyATP moleculesBudget dollarsConserved, spendable quantity

These juxtapositions give engineer‑managers an immediate sense of why each primitive is worth learning.

Conformance Checklist

IDRequirementPurpose
CC‑UC 1A proposed U.Type SHALL include ≥ 3 Role‑Projection records, each taken from a different domain family.Enforces the Three‑Domain Test.
CC‑UC 2Each Role‑Projection MUST explain in ≤ 30 words how the domain notion fulfils the same Role as the proposed U.Type.Blocks superficial analogies.
CC‑UC 3No single exemplar may serve for more than one domain projection.Prevents contrived “triple duty” examples.
CC‑UC 4A specialised U.SubType inherits its parent’s projections and adds ≥ 1 new domain projection, never fewer.Keeps refinements as universal as their parents.
CC‑UC 5While the U‑Index > 0.05, authors SHALL prioritise supplying missing projections over adding new core concepts.Maintains kernel health without procedural bureaucracy.
CC‑UC‑2‑QD‑triad.The three Role‑Projections come from different domain‑families AND the triad PUBLISHES: {FamilyCoverage, MinInterFamilyDistance, Diversity_P, IlluminationSummary} with MinInterFamilyDistance ≥ δ_family (per F1‑Card DistanceDef & edition). + Provenance MUST cite DescriptorMapRef (incl. DistanceDef/edition), F1‑Card id+edition, and the grid/binning policy used for IlluminationSummary.quality diversity of domains

Consequences

BenefitTrade‑offMitigation
Lean, trusted kernel – every primitive earns its place by real work in three worlds.Authoring effort for projections.Patterns A 5/A 6 provide templates and exemplar libraries.
Cross‑disciplinary recognition/adoption – physicists, managers, and biologists see their own language reflected.Some novel ideas wait to gather evidence.They live safely in Extention Patterns until mature.
Resilience to domain drift – if one field’s jargon changes, the other two anchors preserve continuity.Possible oversimplification of niche nuances.Domain‑specific elaborations belong in FPF patterns.

Rationale

Deep research over the last decade shows structural homologies across domains:

  • Free‑energy minimisation ↔ negative log‑likelihood ↔ Bayesian surprise (Friston 2023).
  • Conservation laws in physics mirror budget balancing in economics (Rayo 2024).

By demanding three independent manifestations, FPF captures these convergences without privileging any single vocabulary. The principle operationalises Popperian falsifiability for universality: a concept that cannot survive a three‑domain cross‑examination is, by definition, not a first principle. This guards Pillars P‑1 (Cognitive Elegance) and P‑4 (Open‑Ended Kernel) simultaneously.

Relations

RelationLinked PatternContribution
SupportsA 11 Ontological ParsimonyFilters candidates before sunset reviews.
Prerequisite forA 9 Cross‑Scale ConsistencyOnly universal types can propagate invariants up and down holarchies.
ComplementaryA 7 Strict DistinctionTogether provide clarity (A 7) and breadth (A 8).
EnablesB 1 Universal Algebra of AggregationΓ‑operators rely on domain‑agnostic operands.

Known Uses

  • Energy ↔ Budget ↔ Attention – Engineering teams reused U.Resource to reason about battery charge, project funds, and user‑attention minutes with one algebra, cutting integration effort by half (2024 pilot).
  • Objective unification – An AI lab mapped loss functions, a bio‑lab mapped Darwinian fitness, and a factory mapped scrap‑rate all to U.Objective, enabling shared optimisation tooling.

These cases validated that the Three‑Domain Test is achievable in practice, not theoretical paperwork.

Open Questions

  1. Domain taxonomy stability – Should the five domain families be versioned as science evolves (e.g., quantum‑bio‑tech)?
  2. Automated congruence checks – Can category‑theoretic tooling semi‑automate the functional‑role equivalence test?
  3. Edge‑case hybrids – How are bio‑cyber‑physical chimera systems counted: a new domain or a composite projection?

A.8:End

Cross‑Scale Consistency (C‑3)

“The logic of a bolt must still be the logic of the bridge.”

Context

FPF models reality as a nested holarchy: parts → assemblies → systems → supra‑systems; axioms → lemmas → theorems → paradigms. Designers and analysts must zoom freely without logical whiplash. Classical mereology and modern renormalisation theory both warn: if rules mutate across scales, predictions and audits collapse. FPF therefore mandates a single, scale‑invariant Standard.

Problem

Failure ModeReal‑World Symptom
Invalid extrapolationUnit‑tested module fails once integrated.
Brittle dashboardsPortfolio KPI “green” hides a red supplier averaged away.
Compositional chaosDifferent teams’ roll‑ups yield non‑deterministic results.

These pathologies derail safety cases and budget decisions across disciplines.

Forces

ForceTension
Local autonomy vs Global coherenceFree optimisation of parts ↔ predictable behaviour of whole.
Simplicity vs FidelitySingle rule‑set ↔ non‑linear, emergent effects.
Determinism vs EmergenceStable roll‑ups ↔ need to legitimise genuine synergy jumps.
Didactic clarity vs Formal rigourManagers grasp intent quickly ↔ analysts can prove it.

Solution — Invariant Quintet + Meta‑Holon Transition

Invariant Quintet

Any aggregation operator Γ that claims FPF conformance MUST preserve these five invariants :

CodeInvariantOne‑line Intuition
IDEMIdempotenceFolding a singleton changes nothing.
COMMLocal CommutativityOrder of independent folds is irrelevant.
LOCLocalityWorker or partition choice cannot affect result.
WLNKWeakest‑Link BoundWhole never outperforms its frailest part.
MONOMonotonicityImproving a part cannot worsen the whole.

Mnemonic: S‑O‑L‑I‑D (Same - Order‑free - Location‑free - Inferior cap - Don’t‑regress).

Inter‑Layer Standard note When holons are composed as a Layered‑Control stack, each Planner ↔ Regulator pair MUST publish an inter‑layer Standard: {referenceSignal, guaranteedTrackingError, cycleTime}. Matni 2024 (https://arxiv.org/abs/2401.15185) prove such Standards satisfy COMM + LOC invariants, giving a constructive instance of the Quintet.

Meta‑Holon Transition (MHT)

If empirical data show a true violation (e.g., redundancy raises WLNK limit), the modeller declares an MHT: the collection becomes a new holon at a new scale, and the quintet applies anew at that scale.

Archetypal Grounding

InvariantU.System — Pump SkidU.Episteme — Meta‑Analysis
IDEMOne‑pump skid ≅ that pump.Single‑study review ≅ that study.
COMM / LOCPumps welded in any order / yard → same spec.Labs contribute in any order → same statistics.
WLNKPressure rating ≤ weakest pump.Reliability ≤ least‑replicated study.
MONOStronger motor never lowers flow.Larger sample size never lowers confidence.

Conformance Checklist

IDRequirementPurpose (manager‑friendly)
CC‑A9‑1Every calculus that defines an aggregation operator Γ SHALL provide a plain‑language note and a formal argument for how Γ upholds all five invariants (IDEM, COMM, LOC, WLNK, MONO).Makes the Standard both human‑readable and checkable.
CC‑A9‑2A singleton fold (card (parts) = 1) MUST return the part unaltered (IDEM).Locks the recursion base case.
CC‑A9‑3Folding two independent sub‑graphs in any order or on any compute site MUST yield equal results (COMM + LOC).Enables safe parallel work and reproducible analytics.
CC‑A9‑4No aggregate metric MAY exceed the minimum of that metric across parts unless an MHT is declared (WLNK).Prevents stealth inflation of reliability or truth.
CC‑A9‑6A declared Meta‑Holon Transition SHALL: (a) name the new supervisory holon; (b) cite the data triggering the transition; (c) restate how the quintet holds at the new scale.Ensures emergence is captured explicitly, not hand‑waved.

Consequences

BenefitWhy it mattersTrade‑off / Mitigation
Stable roll‑upsSummaries and reports remain faithful as parts evolve.Requires early agreement on Γ; offer reference libraries.
Visible risk floorWLNK blocks “averaging away” critical weaknesses.Can look overly conservative; redundancy, when real, lifts the minimum honestly.
Parallel progressCOMM + LOC allow distributed teams to integrate without re‑work.Needs explicit independence assumptions; templates guide authors.
Objective emergence flagQuintet failure becomes a measurable R&D signal.Teams must learn to document MHTs instead of ignoring anomalies.

Rationale

Post‑2015 evidence across domains

  • Physics ‑ Renormalisation coherence echoes IDEM, COMM, LOC.
  • Distributed data platforms rely on COMM + LOC for deterministic aggregations.
  • Safety engineering ‑ Fault‑tree analyses hinge on WLNK; aviation failures (2018‑24) confirm its necessity.
  • Lean improvement ‑ MONO underpins Kaizen: fix a bottleneck, never worsen the plant.

Packaging these insights as one memorisable quintet → Cognitive Elegance with formal bite.

Relations

RelationLinked PatternContribution
Builds onA 1 Holonic FoundationSupplies part/whole semantics.
ReinforcesA 7 Strict DistinctionPrevents layer‑mixing during folds.
Enabled byA 8 Universal CoreGuarantees operands share truly universal meaning.
Foundation forB 1 Universal Algebra of AggregationB‑section implements operators that satisfy this pattern.
TriggersB 2 Meta‑Holon TransitionWhen invariants fail through synergy, an MHT is invoked.

Known Uses (2018‑2025)

  • Spacecraft avionics ‑ Applying WLNK exposed a sub‑grade connector, saving a $40 M launch window.
  • Global vaccine meta‑reviews ‑ COMM + LOC let five epidemiology teams merge data independently; results converged within 0.1 % effect size.
  • Distributed ML training ‑ MONO guaranteed optimiser swaps never reduced accuracy, cutting iteration time by 20 %.

Open Questions for expert panel

  1. Order‑sensitive physics – Should quantum‑circuit folds live in a Extention Patterns with a relaxed invariant set?
  2. Synergistic redundancy – Can WLNK be reframed using an “effective minimum” when true redundancy lifts the floor?
  3. Didactic tooling – Which visual cues best alert non‑formal audiences to an approaching Meta‑Holon Transition?
  4. Layer depth — In an LCA (layered control architectures, https://arxiv.org/abs/2401.15185) stack every Planner is external to its Regulator; should FPF limit the number of nested layers, or is indefinite chaining acceptable?

A.9:End

Evidence Graph Referring (C‑4)

“A claim without a chain is only an opinion.”

Context

FPF is a holonic framework: wholes are built from parts (A.1, A.14), and reasoning travels across scales via Γ‑flavours (B.1). To keep this reasoning honest and reproducible, every published assertion must be evidenced through concrete symbol carriers and well‑typed transformations performed by an external TransformerRole (A.12, A.15). Per A.7, Describe_EoC_DescEp is the describing morphism from EntityOfConcern to Description episteme; specification use is granted only by neighboring pattern governing the claiming gates such as A.6.2, C.2.3, A.21, C.16, E.17, or E.10. Publication makes Description epistemes available through publication forms, faces, units, renderings, or carriers and is not execution. Any physical/digital release, rendering, or upload is Work by an external transformer on carriers, cited in SCR.

Practitioner shorthand:

Claim → (Proof or Test) → Confidence badge …where the proof/test is traceable to real carriers and to an external system/Transformer who executed an agreed method.

This pattern defines the Evidence Graph Referring Standard common to all Γ‑flavours (Γ_sys — formerly Γ_core, Γ_epist, Γ_method, Γ_time, Γ_work) and clarifies: (a) the difference between mereology (part‑whole; builds holarchies) and provenance (why a claim is admissible; does not build holarchies); (b) the run‑time / design‑time separation (A.4) across Role–Method–Work (A.15).

Use this when a model, report, metric, confidence badge, review note, or QL reading is starting to act like evidence but the carrier, transformer, method, time stance, or provenance edge is still implicit. The action is to turn the assertion into a small because-graph: name the claim, name the carriers, name the external transformer role, name the method or work trace, state the time/coverage condition, and attach the resulting evidence edge to the claim rather than to the holon itself.

Useful output: a claim that can answer "because of which carriers, by which transformer, using which method, and when?" without making provenance pretend to be part-whole structure.

Problem

Without a uniform evidence path, models drift into five failure modes:

  1. Weightless claims. Metrics or arguments appear in the model with no link to their symbol carriers (files, datasets, lab notebooks, figures).
  2. Collapsed scopes. Design‑time method specs are silently mixed with run‑time traces; results cannot be reproduced because “what was planned” and “what actually ran” are conflated.
  3. Self‑justifying loops. A holon attempts to evidence itself (violates A.12 externality), producing cyclic provenance and unverifiable conclusions.
  4. Source loss during aggregation. As Γ combines parts, some sources “fall out”; later audit cannot reconstruct why a compound claim was accepted.
  5. Temporal ambiguity. Time‑series are aggregated without interval coverage or dating source; gaps/overlaps invalidate comparisons and trend claims.

The business effect is predictable: confidence badges cannot be defended, cross‑scale consistency (A.9) is broken, and iteration slows because every review re‑litigates “where did this come from?”.

Forces

ForceTension
Universality vs. evidence-relation costOne Standard must fit systems and epistemes ↔ Evidence producers and maintainers need proportionate evidence records.
Externality vs. reflexivityEvidence must be produced by an external TransformerRole (A.12) ↔ Some systems adapt themselves (need reflexive modelling without self‑evidence).
Atemporal vs. temporalMany claims are state‑like ↔ Many others are histories; evidence must respect order and coverage (Γ_time).
Rigor vs. flowFormal proofs and controlled tests raise confidence ↔ Engineering cadence needs lightweight, incremental evidence relations.
Mereology vs. provenancePart‑whole edges build holarchies ↔ Evidence edges never do; the two graphs must interlock without leaking semantics.

Solution — The Evidence Graph Referring Standard

The Standard is a small set of primitives applied uniformly, with practitioner-first clarity and formal hooks for proof obligations. Its primary EntityOfConcern is the evidence/provenance path for a claim: carriers, external transformer roles, method traces, work traces, time stance, and evidence edges. Authority-looking reliance and causal-use evidence are specialized uses of that same evidence path; they do not redefine A.10 as a pattern about labels, dashboard wording, or source rhetoric.

EPV‑DAG (Evidence–Provenance DAG).

A typed, acyclic graph disjoint from mereology. Node types: SymbolCarrier (a s.System in CarrierRole, A.15), TransformerRole (external Transformer, A.12), MethodDescription (design-time blueprint of a method, A.15), Observation (a dated assertion or result record), s.Episteme (knowledge holon). Edge vocabulary is small and normative: evidences, derivedFrom, measuredBy, interpretedBy, usedCarrier, happenedBefore (temporal), etc. Practitioner view: it is the “because‑graph”: every claim answers “because of these carriers, by this Transformer, using that method, then.”

Evidence relations (two relations, two flavours)

  • verifiedBy — links a claim to formal evidence (proof obligations, static guarantees, model‑checking records).
  • validatedBy — links a claim to empirical evidence (tests, measurements, trials, observations). Both evidence relations terminate in the EPV-DAG, not in the mereology graph.

A.10:4.3 SCR / RSCR (Symbol Carrier Registers).

Every Γ_epist aggregation SHALL emit an SCR: an exhaustive register of symbol carriers substantively used in the aggregate, with id, type, version/date, checksum, source/conditions and optional PortionOf (A.14) for sub‑carriers. Every Γ_epist^compile SHALL emit an RSCR: SCR specialised to a bounded context (vocabularies, units) with publication‑grade identifiers and hashes. Why this matters: it prevents “lost sources” during composition and underwrites reproducibility without mandating any specific tool.

A.10:4.4 Scope alignment (A.4) across Role–Method–Work (A.15).

  • Design‑time: MethodDescription lives here as an episteme describing U.Method; evidence relations reference what would constitute proof or test for that method.
  • Run‑time: Work (actual execution) lives here; traces reference which U.Method they enact and cite the methodDescriptionRef used to identify or constrain it and record happenedBefore. Bridging edges are explicit (“this run trace enacts that method under this method-description source”), so scopes never silently mix.

A.10:4.5 External TransformerRole (A.12).

The system that produces or interprets evidence is external to the holon under evaluation. If true reflexivity is essential, model a meta‑holon (A.12): the self‑updating holon becomes the object of a meta-holon external transformer (the “mirror”), restoring objectivity.

A.10:4.6 Γ-flavour hooks (how each flavour evidences).

  • Γ_sys (formerly Γ_core): physical properties are evidenced by measurement models, boundary conditions, calibration carriers, and dated observations.
  • Γ_epist: always outputs SCR/RSCR; every provenance/evidence node resolves to an SCR/RSCR entry.
  • Γ_method: order‑sensitive composition; at design‑time a Method Instantiation Card (MIC) states Precedes/Choice/Join and guards; at run‑time traces record happenedBefore and point to the U.Method they enact and the methodDescriptionRef they used.
  • Γ_time: temporal claims state interval coverage; Monotone Coverage (no unexplained gaps/overlaps) is required.
  • Γ_work: resource spending and yield are evidenced by instrumented carriers (meters, logs) and their methodRef plus methodDescriptionRef; keep resource rosters separate from SCR/RSCR.

Practitioner shortcut: If you can answer what carriers, which system, which method, when, the evidence relation is likely sufficient; if any of the four is missing, it is not.

Authority-reliance use of ordinary A.10 evidence paths

Use this subsection when an authority-looking case is being used as evidence for reliance. The evidence path is claim-bound: it evidences a named claim or effect for a named work move or reliance move, not "authority" in general. This subsection does not change the A.10 evidence-path EntityOfConcern; it applies the same evidence and provenance path to source-sensitive cases where displays, credentials, copied text, generated text, dashboards, provenance labels, or attestations are being overread. If the live work occurrence, gate decision, speech act, commitment, or evidence path is already clear, recover and cite that FPF source named by value directly instead of analyzing nearby wording first.

A10-lite is enough for source-finding, orientation, learning, and bounded reversible probes:

FieldRequired content
claim or effectThe claim, effect, or source-backed reliance use the carrier is being asked to evidence for the named work move or reliance move.
carrierThe display, badge, credential, attestation, dashboard tile, copied text, generated text, log, trace, source file, report, or other external carrier.
producer, issuer, verifier, or source-maintenance role assignmentThe role assignment or system that issued, performed, attested, measured, copied, generated, verified, or displayed the carrier or source-backed content.
method execution or work eventThe work act, measurement, verification, review, build, attestation, copy, extraction, generation, dashboard query, API read, trace, log, or method instance that produced the carrier.
time windowIssue time, validity window, decay, supersession, revocation, policy or gate version, and reopen condition.

Minimum path for routine reliance:

FieldRequired content
Evidenced claim or effectApproval, permission, gate passage, role or status currentness, work occurrence, evidence relation, assurance input, or other claim named by value or effect being attempted.
CarrierThe visible or recovered carrier, with enough identity to reopen it.
Issuer, performer, trust root, status register, or source-maintenance role assignmentThe role assignment, system, or governing register accountable for producing, updating, or verifying the carrier or source-backed content in this context.
Affected entity and relying contextThe release, service, model, person, role holder, policy subject, work item, claim, audience, tenant, environment, or other entity for which reliance is attempted.
Time window and freshnessIssue time, validity window, decay, supersession, revocation, policy or gate version, and reopen condition.
Evidence-producing work event or method traceThe production, verification, query, generation, execution, or review work that made the carrier.
Evidence relation and rival explanationWhich claim the carrier evidences, how it evidences it, and the principal live rival explanation such as stale display, spoofed badge, copied wording, generated paraphrase, context shift, carrier-only provenance, or local-only transform relation.

Expanded fields are collected only insofar as they decide the live reliance question. Evidence depth follows consequence severity, reuse, contestability, cross-context movement, and the evidence relation required for the attempted claim. Do not expand a source-finding note into a full evidence dossier, and do not collect every expanded field merely because a carrier is copied, generated, credential-like, provenance-like, or cross-context.

Adversarial misuse guard. Do not let carrier authenticity, provenance, copied approval, generated summary, stale screenshot, credential status view, or dashboard export convert into claim truth or currentness. Treat each as a rival explanation to test against issuer or source-maintenance role assignment, method trace or work trace, time window, and relying context.

Data-minimization and privacy boundary. Preserve minimum sufficient evidence relation for the intended reliance use. Use redacted, hashed, scoped, or role-mediated carrier refs when raw evidence would expose personal identity, access tokens, cryptographic proof payloads, tenant identifiers, security logs, incident details, internal release metadata, audit trails, privileged reviewer names, or sensitive model/data provenance. Redaction does not create source relation; it must preserve enough recoverability for the relying context.

Expanded fieldWhen it is live
Method trace or work traceProvenance, attestation, generated source relation, copied source relation, dashboard source relation, rollback source relation, or work occurrence is being used.
Carrier integrityThe carrier may be spoofed, stale, copied, transformed, rendered, redacted, or context-shifted.
Identity or holder bindingThe claim depends on a credential holder, role holder, issuer, performer, delegate, revoker, verifier, or relying party.
Verifier context, relying-party context, and acceptance ruleThe evidence relation is valid only for a verifier, audience, tenant, environment, release line, policy subject, operational mode, or consumer-side policy or gate rule that accepts the evidence for this use.
Proof, cryptographic-signature, or status verification resultCredential, provenance, attestation, authenticity, revocation, or currentness relation is claimed.
Policy/gate version and decision sourcePermission, admissibility, gate passage, release, rollback authority, or policy authorization is attempted.
Source-chain transform notesEvidence relation passed through extraction, copy, rewrite, representation shift, explanation rendering, summary, export, redaction, or another transform step before reliance.
Source order and supersession ruleMultiple source candidates disagree or freshness or priority may defeat the visible publication face, carrier, rendering, or cue. Include the governing register or status-source order when a register entry is the source of role assignment, status assertion, permission, duty, or gate state.
Minimum disclosure boundaryRaw evidence would expose secrets, personal data, tenant identifiers, privileged logs, tokens, security-sensitive traces, or unnecessary identities.

Case repairs:

CaseEvidence repair
Stale credential badge or status displayShow issuer or trust root, governing status register when one exists, holder or subject binding, verifier and relying-party context, proof result or status result, revocation and freshness, validity window, status-source entry version, and carrier integrity. Display presence is not current role assignment, status assertion, or permission.
Verifiable credential, credential view, or register excerptTreat as an A.10 carrier with issuer or trust root, governing status register when one exists, register entry or source-record id and version, holder or subject binding, verifier, proof result, status result, currentness, relying context, validity window, revocation window, and acceptance rule. When those checks pass, it may evidence credential-currentness for that holder and relying context. It evidences permission, authorization, role assignment, status assertion, or gate passage only when the register entry or another exact source such as A.2.8, A.2.9, A.2.1, A.6.B, or A.21 creates or states that effect for the bounded context.
Copied approval or review summaryShow the original A.2.9 SpeechActRef / issuing act when approval or authorization is claimed, or the original reviewed source when only review-content currentness is claimed. Add copy relation, currentness, scope/window, evidence-producing work/event, and whether separate commitment/work relation is live. Copy evidence is not approval by itself.
Provenance, authenticity, or attestation labelShow the bounded origin, history, build, or process claim; source episteme, source episteme publication, or source carrier; method trace or work trace; source-specific proof; carrier integrity; verifier or relying policy that accepts it for this claim or effect; and rival explanation. Provenance does not show truth, safety, approval, release, gate passage, permission, or assurance unless another exact source carries that additional claim or effect.
Dashboard status tileFor gate-passage or release reliance, show dashboard query/source/time/window/currentness, source order, freshness policy, rival explanation, and the current A.21 GateDecision / DecisionLogRef with gate profile/version and release/work target; the A.10 path evidences that source chain. A status display is not gate passage or work occurrence by itself.
Rollback command-like cueShow command/authorization source, actor, affected work target or claim target, scope/window, and whether the cue is only an A.6.A action invitation. A command cue is not execution evidence.
Rollback execution resultShow A.15.1 U.Work occurrence, method trace or work trace, logs, outcome evidence, and time window. Execution evidence is not approval, assurance, or gate passage by itself.
Generated explanationUse E.17.EFP to classify the explanation relation and source-finding use. For reliance, show claim-bound attribution alignment: every operative claim relied on maps to a source passage, carrier, or exact governingPatternRef or authoritySourceRef that evidences that claim in the relying context. When that mapping is complete, A.10 may evidence those operative claims as source-backed evidence; the explanation itself still does not issue, approve, authorize, pass a gate, evidence execution, or raise assurance.
Model card or datasheet used as evidenceShow documented admissible-use statement or external intended-use field, version/window, evaluation condition, limitations, evidence carriers, and whether a B.3 assurance claim is live. Documentation does not become readiness or assurance by presence.
Extracted-source chain to gate or release claimName the source reference, the first lossy or non-commutative transform step, the FPF relation or pattern governing that transform (A.6.3.CR, A.6.3.RT, A.6.3.CSC, E.17.EFP, E.17.ID.CR, or E.18 where applicable), the admissible inference move after the step, the exact governingPatternRef or authoritySourceRef that carries the claim being made, the source reopen trigger, and the gate claim or release claim blocked until those source relations are recoverable.
Conflicting sourcesWhen display, source carrier, decision log, recency signal, freshness signal, copied summary, generated summary, credential status, provenance label, or assurance evidence disagree, name the visible source, rival source, source order, decision source, freshness policy, and supersession rule. Do not choose by color, visual salience, confidence wording, copied wording, or apparent recency; the work claim or reliance claim is contested until the source-order question is resolved.
Sensitive evidence pathUse redacted, hashed, scoped, or role-mediated carrier refs when raw carriers expose secrets, personal data, security-sensitive traces/data, privileged logs, tenant identifiers, or unnecessary identities. Redaction does not create source relation; it must preserve enough recoverability for the relying context.
Pointer or proof-status evidence pathUse a hash, proof verification result, status verification result, source ref, scoped pointer, disclosure receipt, or role-mediated view instead of copying raw sensitive carriers or payloads when that pointer preserves enough recoverability for the relied-on claim or effect. Do not copy raw secrets, tokens, privileged logs, personal identities, or tenant details merely to make the evidence path look fuller.

If the path is incomplete, A.10 returns evidence-path state and source-currentness status, not work or reliance evidence relation for the attempted claim or effect. Valid dispositions include source-finding only, reopen original carrier, request issuer or status verification, refresh dashboard query or API query, mark stale or contested, narrow the live P2W class or reliance claim, proceed only with a reversible local probe under an explicit work plan when work is live, or block the unsupported work claim or reliance claim.

Broken-source repair assignment. If the relying actor cannot recover or verify the source path, assign the repair to the accountable project-side responsibility assignment: issuer or performer, verifier or status service, evidence-producing work role assignment or system, gate-decision source, role or status source, or boundary source. The A.10 result should name the missing source and blocked use rather than making the relying actor reconstruct a source they cannot issue or verify.

Role prompts for evidence or currentness use:

Role in the situationPrompt
Relying actorWhich claim named by value or effect needs an evidence relation, and what is the minimum carrier, source, time, and relation path for that claim or effect?
Issuer, verifier, or status sourceWhich issuer, holder, verifier, proof result, status result, currentness, revocation, or acceptance-rule source must be exposed or repaired?
Auditor or reviewerWhich carrier, source-maintenance role assignment, method trace or work trace, time window, evidence relation, and rival explanation must be recoverable?
Security source or compliance sourceWhich source order, supersession, proof result, status result, revocation, and minimum-disclosure boundary decide this reliance question?
LLM/tool userWhich generated or copied operative claims map to source passages or carriers, and which claims remain only source-finding?
Model source or data sourceWhich intended-use, evaluation-condition, version, window, limitation, and evidence carriers bound the model documentation or data documentation?

Repeated missing-source indicator. If the same visible-item family repeatedly returns stale, contested, no-source, or no-currentness A.10 results, record a source-system repair item: instrument the source, expose decision-source refs, add currentness checks and status checks, preserve claim-bound source links for generated or copied outputs, require credential views to show status windows and currentness windows, require model documentation and data documentation to expose intended-use and evaluation-condition fields, or require provenance labels and attestation labels to name their bounded claim type. Repetition is an indicator that the source path or display needs repair; it is not a reason to make each acting user rebuild the path manually.

Display guidance for evidence and currentness: an evidence or status display should show the claim or effect, carrier, source-maintenance role assignment, reference or link named by value, time window, freshness, relying context, and unsupported action, claim, or effect. A display that can only show source availability should say so; it must not imply approval, permission, gate passage, work occurrence, or assurance.

Incident-learning fields for evidence and currentness overread: visible carrier or publication face, intended claim or effect, missing source-path field, exact carrier, source-maintenance role assignment, method trace, work trace, and time relation needed, rival explanation that made the overread plausible, current safe disposition, and upstream repair item for instrumentation, source refs, status, currentness, claim-bound source links, credential view, model documentation, data documentation, or provenance and attestation label.

Contestability and redress path: when an evidence path or currentness path affects person or team status, access, responsibility, a compliance relation, or a release decision, the A.10 result should name the disputed claim, carrier, source-maintenance role assignment, verifier or status source, freshness or revocation source, privacy-minimized evidence ref, safe interim disposition, and review or redress path. A disputed display remains contested until the source-order or currentness question is resolved.

Positive repaired path. When the source path is complete, return the smallest source-backed evidence-use statement: named claim or effect, carrier and source-maintenance role assignment, method trace or work trace, time window, currentness, evidence relation, and the exact action or reliance for which it is admissible. The downstream use is admissible only inside that scope, without treating evidence relation as approval, permission, gate passage, work occurrence, or assurance.

What this does not authorize: A.10 does not approve, authorize action, pass a gate, release, create permission, create a commitment, assign a role, record a work occurrence, or raise assurance. It supplies the evidence path and evidence-use classification that A.15, A.6, B.3, A.21 gate-decision sources, A.20 constraint-validity sources, A.2.9 speech-act sources, A.2.8 commitment sources, A.15.1 work-occurrence sources, or another exact governingPatternRef or authoritySourceRef may consume.

Local evidence-use classifier and RelianceDisposition for source-looking evidence uses

Use this subsection when a visible source is being treated as evidence for a claim, act, work move, gate, release, review claim, assurance use, or problem-side P2W use. The first A.10 move is to recover the evidence kind and the bounded use it can actually make admissible. Broad source words such as source, metric, confidence, conformant, safe, ready, certified, approval, or permission are only recovery prompts; they do not name the evidence relation by themselves.

This subsection uses a local reliance-use classifier, not a Core evidence-kind ontology. Its practical gain is a smaller next move: recover the evidence relation, name the admissible and non-admissible use, then stop or exit to the governing pattern. It is not a required project review step and does not ask the practitioner to inspect every source-looking item.

Section role: the first table is an A.10 recognition aid, the RelianceDisposition table is a minimum local record aid, and the worked source-overread slices are regression/review slices. They are not project checklists, a required sequence, a new evidence ontology, or a general source classifier. Use only the row that answers the live attempted evidence use, then stop when the bounded evidence relation, admissible use, non-admissible use, and reopen condition are clear. This local section returns the attempted use to A.10 evidence relation; it does not create an extra SEMIO authority or cross-pattern relation vocabulary.

Affordability card: orientation or source-finding remains a cue and stops here; bounded reliance states one admissible use, non-admissible use, window, and reopen condition; threshold reliance exits to the minimum governing pattern only when the B.3 material-reliance threshold is live: behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people/team status, operational action, or controlled-object regulation would materially change. Plain wording remains ordinary unless it changes admissible use, source relation, evidence, gate, assurance, work, decision, or neighboring-pattern exit.

Cheap stop: if a bounded claim, current carrier, evidence path, window, admissible use, non-admissible use, and reopen trigger are present, and no assurance, gate, work, control-bearing relation, release relation, or B.3 material-reliance threshold is live, stay in A.10. Do not open B.3, A.21, B.2.5, or a broad evidence pack merely because the source looks official, quantitative, generated, credentialed, or safety-related.

Common wrong first reading: a visible source is approval, permission, safety, or readiness. First honest entry: recover the A.10 evidence path for one bounded claim or use; approval, permission, safety, readiness, gate passage, and work authority stay with their governing patterns when live.

Plain move palette: RelianceDisposition=pass means proceed only inside the bounded use; RelianceDisposition=degrade means use only a narrower or reversible version; RelianceDisposition=abstain means do not decide yet; RelianceDisposition=reopen means changed or contested evidence relation defeated the previous reading; RelianceDisposition=evidence-needed means ask for the named missing evidence at the named decision point; RelianceDisposition=safety-case-required means return to B.3 because the B.3 material-reliance threshold is live; RelianceDisposition=no-admissible-current-use means block the current attempted use until the evidence path or governing source relation changes.

Source-looking evidence use or attempted useFirst A.10 moveEscalation triggerForbidden overread
Ordinary source-backed report, record, citation, observation, model card, datasheet, data card, or publication excerptName the claim, carrier, producer or method trace, evidence path, currentness window, admissible use, non-admissible use, and reopen trigger.Open B.3 only when assurance is live or the B.3 material-reliance threshold is live; open A.21 for active gate decision, A.15 or A.15.1 for work, or another governing neighboring pattern only when that relation is live; open B.2.5 only when a controlled object is regulated through a feedback channel, evidence channel, cadence, window, or supervisory/control relation.Evidence presence as approval, gate passage, assurance, release permission, work authority, control authority, or safety acceptance.
Confidence, calibration, prediction interval, abstention reason, or selective-action cueMake only the named act admissible, context, window, calibration population or exchangeability/shift basis, applicability condition, and stop condition. Use RelianceDisposition=pass or RelianceDisposition=degrade only for that bounded use, and state the unsupported attempted use beside it.Open C.27 or G.11 when timing, expiry, refresh, distribution shift, monitoring, or applicability change alters the admissible act; open B.3 when assurance is live or the B.3 material-reliance threshold is live.Confidence as global permission, trust, readiness, safety, release reliance, or engineering justification.
Generated explanation, generated summary, or didactic reconstructionKeep the rendering in E.17.EFP as explanation or source-finding unless each relied-on operative claim has an A.10 evidence path or another source relation that evidences the operative claim.Apply A.10, B.3, A.21, A.15, or another governing pattern only for the operative claim being relied on.Explanation wording as evidence, assurance, approval, gate passage, work occurrence, or permission.
Conformance label, CV.Status, benchmark result, score, semantic-fidelity marker, or CV-looking publication near releaseRecover the declared relation: measurement or marker relation, A.20 step-local CV status, A.21 gate check, E.19 pattern-quality result, C.16 characterization, or exact external-rule locus.Open A.21 only when an active OperationalGate(profile) consumes effective gate-check refs and emits a GateDecision; open B.3 only when assurance is live.Conformance or score as value, adequacy, release confidence, work occurrence, safety, trust, or gate passage outside the declared relation.
Provenance, authenticity, C2PA-like credential, SLSA-like attestation, build record, or status-register displayState the bounded origin, history, build method or production trace, holder, status, verifier rule, relying context, and currentness claim it evidences.Open the source that carries truth, permission, safety, release, gate passage, work occurrence, or assurance only when that relation named by value is live.Provenance, authenticity, or status-currentness as truth, safety, approval, permission, release, gate passage, or assurance.
Contest, redress request, challenge, appeal, or conflicting sourceName the contested claim, carrier, source order, freshness/currentness issue, affected use, accountable review role, allowed challenge evidence, possible disposition change, outcome record, and reopen trigger.Open neighboring role, status, commitment, gate, control, assurance, work, or representation loci when their effects are live.Appeal-channel presence as claim truth, safety, compliance proof, social-effect acceptance, or completed redress.

For A.10 use, RelianceDisposition is a local disposition over the evidence path and the bounded reliance use. Outside a table column already headed RelianceDisposition, write the qualified form RelianceDisposition=... and bind it to the named attempted use, currentness/window when live, admissible use, non-admissible use, and reopen or stop condition; it is not CV.Status, GateDecision, selector result, or ProblemCard@Context state.

Observed-effect or consequence evidence may be used only for what happened or is credibly recorded. If the attempted use says the source caused, prevented, would have changed, or is responsible for that effect, leave ordinary A.10 reliance and open C.28 plus any live evidence, work, or assurance relation.

If a proxy marker, benchmark, confidence value, dashboard metric, or score becomes the primary driver for action, release, resource allocation, people/team status, or P2W priority, check whether the claim being made also raises an E.13 proxy-to-objective question. Do not open E.13 for every metric; open it only when the proxy is being used as the target or decision driver.

If publication or observation of a cue changes the situation or source condition being read, recover the probe-coupled boundary before treating the cue as passive evidence. This sentence does not import quantum-like vocabulary; it only prevents passive-evidence overread for dashboards, warnings, labels, and public status displays.

RelianceDispositionA.10 readingMinimum A.10 statement
RelianceDisposition=passThe evidence relation named by value is live, the evidence kind is present, the source is current enough for the named use, and the supported use is bounded.State the supported claim, act, work move, review claim, or P2W receiving use, the unsupported attempted use, the carrier path, and the window.
RelianceDisposition=degradeThe source relations only a narrower claim, smaller audience, reversible local act, lower assurance input, or shorter window.State the narrowed admissible use, the attempted use still not admissible, and the stop condition.
RelianceDisposition=abstainEvidence is insufficient, stale, out-of-context, uncalibrated, conflicted, or not tied to the live relation, while immediate rejection is not justified.State the claim not decided and the missing evidence or relation needed before use.
RelianceDisposition=reopenA contest, changed representation, changed selected entity, stale source, expired window, changed profile, conflicting source, retargeting, or new evidence defeats the previous evidence path.State the source or relation to reopen and the previous use that is no longer supported.
RelianceDisposition=evidence-neededThe visible source may matter, but the required evidence kind or source-currentness path is absent.State the missing evidence kind, governing pattern, and decision point so delay does not become indefinite.
RelianceDisposition=safety-case-requiredThe B.3 material-reliance threshold is live: reliance on the visible source may materially change behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people/team status, operational action, or controlled-object regulation.State the threshold trigger and return to B.3 for the minimum reliance safety assurance record, with A.10 evidence paths for the source claims.
RelianceDisposition=no-admissible-current-useNo current evidence path makes the attempted act admissible, work, claim, gate, release, assurance, review, control-bearing feedback, or P2W use.State the blocked use and the neighboring pattern or project record required before a new attempt.

Minimum real contest/redress: a contest path exists only when the affected party or accountable reviewer can identify the disputed claim or source, affected use or harm, accountable review role, evidence or argument allowed in challenge, possible disposition change, outcome record, and reopen trigger. A feedback channel, complaint form, or appeal label without those recoverable items is not enough to change the disposition.

Affected-party contestable minimum: even when raw evidence stays reviewer-only, the contesting party must be able to see enough of the claim, source class, disposition, affected use, accountable role, and allowed challenge evidence to challenge the result. Privacy, security, or privilege can narrow disclosure; they cannot erase the challengeable minimum while still claiming contest or redress.

False-negative reliance guard: a blocked, abstained, or evidence-needed use is not final if admissible challenge evidence, missing affected-party evidence, changed source, changed representation, or redress can materially change the disposition. If refusal is based on missing evidence, name the missing evidence kind and decision point rather than closing the dispute by vagueness.

Sensitive evidence boundary: use scoped, hashed, redacted, or role-mediated evidence refs when raw carriers would expose personal data, secrets, tokens, privileged logs, tenant identifiers, incident details, security-sensitive traces, or unnecessary identities. A redacted path must still preserve enough recoverability for the relied-on claim, disposition, and contest path.

Worked source-overread slices:

SliceA.10 usable readingNon-admissible lift
Software supply-chain attestation is cited near a release conversation.The attestation may evidence bounded origin, build method or production trace, verifier-rule, holder, and currentness claims.Runtime safety, release approval, gate passage, or assurance unless B.3, A.21, or another relation governing the asserted use is asserted for that use.
A valid provenance credential, watermark, or authenticity mark appears on a publication face.The mark may evidence where the carrier, signature, assertion, or manifest came from under the verifier regime.Truth of the represented world-state, safety, permission, or adequacy by provenance alone.
A confidence interval or calibration result is used for one reversible act.State the act, context, calibration basis, window, admissible use, non-admissible use, and stop condition.Global readiness, trust, safety, release reliance, or engineering justification.
A generated explanation or summary says a result is reliable.Treat the rendering as source-finding or explanation until the operative claim has an A.10 evidence path or another source relation that evidences the operative claim.Evidence, approval, gate passage, work occurrence, or assurance by fluent wording.
Contest or redress is claimed after a source is challenged.State the disputed claim, affected use, accountable review role, allowed challenge evidence, possible disposition change, outcome record, and reopen trigger.Claim truth, compliance proof, completed redress, or social-effect acceptance by appeal-channel presence.
A harmed party gives admissible challenge evidence, but the accountable party answers "evidence insufficient" without naming the missing evidence kind or decision point.Treat the refusal as RelianceDisposition=reopen or invalid RelianceDisposition=evidence-needed; name the missing evidence kind, decision point, accountable role, and possible disposition change.Closed refusal, completed redress, or RelianceDisposition=no-admissible-current-use by vague insufficiency.

Causal evidence relation basis in evidence paths

Evidence graph paths used for causal-use claims must carry the C.28-governed CausalEvidenceSupportBasis without redefining causal estimands or causal-use authority.

The C.28 values that A.10 may carry in an evidence path are:

observationalAssociationSupportBasis
interventionalActionSupportBasis
realizedCounterfactualSampleSupportBasis
identifiedCounterfactualEstimateSupportBasis
simulationOnlyCounterfactualOutputBasis

[A.10](/generated/patterns/A.10) consumes this value set from [C.28](/generated/patterns/C.28); it does not add causalAssumptionOnlySupport or noCausalEvidenceSupport as evidence-basis values. Assumption-only and no-evidence-use cases are represented by causal assumptions, support verdict, admissible use, non-admissible use, or abstain in [C.28](/generated/patterns/C.28)/[B.3](/generated/patterns/B.3), not by a second evidence-basis vocabulary.

No non-admissible CausalityLadderRung climb:

observational-association evidence -> interventional-action claim requires CausalIdentificationProfile.
interventional-action evidence -> counterfactual-comparison claim requires CausalIdentificationProfile for
  identifiedCounterfactualEstimateSupportBasis, CounterfactualSamplingRealizabilityProfile for
  realizedCounterfactualSampleSupportBasis, or bounded-use treatment.
Simulation-only counterfactual output may be admissible for bounded model use when model assumptions, validation, admissible use, and non-admissible use are declared. It does not become interventional evidence or realized counterfactual sample evidence by vocabulary, validation, or evidence-role relabeling alone.

Evidence-path micro-examples:

CausalEvidenceSupportBasisEPV-style path cue
observationalAssociationSupportBasisobserved cohort table -> PathSlice to measurement work -> association-use statement; unsupported use = intervention-effect wording.
interventionalActionSupportBasisrandomized or governed action assignment record -> work trace -> declared intervention-effect admissible use inside assignment, follow-up, and outcome window.
realizedCounterfactualSampleSupportBasiscounterfactual-comparison sampling work plan -> run trace -> evidence carrier -> samples from declared target counterfactual distribution under physical, ethical, and operational constraints.
identifiedCounterfactualEstimateSupportBasiscausal assumptions, graph proof, calculus proof, available-data regime set, and bound refs -> CausalIdentificationProfile -> estimated or bounded counterfactual use with admissible use and non-admissible use.
simulationOnlyCounterfactualOutputBasissimulator output -> counterfactual model assumptions -> simulation validation ref -> bounded model-supported use; validation remains validation and does not convert the path into direct sample evidence or intervention-effect evidence.

What changes in practice: an evidence path can show that a carrier evidences a causal-use claim, but it must also show the causal evidence relation basis and the relevant [C.28](/generated/patterns/C.28) support references when the claim climbs from observation to intervention or from intervention to counterfactual comparison.

What this does not authorize: [A.10](/generated/patterns/A.10) does not identify causal effects, create an estimand, certify target-trial emulation, or decide counterfactual sampling realizability; it stores and makes recoverable the evidence graph path and causal support-basis refs needed by [C.28](/generated/patterns/C.28) and [B.3](/generated/patterns/B.3).

Archetypal Grounding

Aspects.System — Autonomous Brakes.Episteme — Meta-analysis
Claim“Stop within 50 m from 100 km/h.”“Drug A outperforms control on endpoint E.”
Evidence relationverifiedBy: static‑analysis proof of no overflow; validatedBy: instrumented track tests.verifiedBy: power‑analysis proof of sample size; validatedBy: pooled effect sizes with bias checks.
Carriers (SCR/RSCR)Scale logs, calibration certificates, test track telemetry; SCR lists all; RSCR adds context units.PDFs of studies, data tables, analysis code; SCR lists carriers; RSCR adapts vocabularies/units for the target audience.
External TransformerRoleIndependent test team / metrology lab.Independent synthesis team / statistician.
TemporalDated runs; happenedBefore between setup → test → teardown.Publication dates; dataset versions; monotone coverage of included studies.

Conformance Checklist

IDRequirementPurpose (what it prevents)
CC‑A10.1 (EPV‑DAG Presence)Every published claim MUST have a path in the Evidence–Provenance DAG (EPV‑DAG) to concrete SymbolCarrier nodes and to the external TransformerRole that produced or interpreted the evidence.Stops “weightless claims” and self‑justifying text.
CC‑A10.2 (SCR)Any Γ_epist^synth operation SHALL output an SCR listing all symbol carriers substantively used in the aggregate s.Episteme.Prevents source loss during aggregation.
CC‑A10.3 (RSCR)Any Γ_epist^compile operation SHALL output an RSCR adapted to the target bounded context (vocabularies, units) with publication‑grade identifiers/hashes; SCR→RSCR MUST preserve carrier identity/integrity.Keeps releases auditable and context‑consistent.
CC‑A10.4 (Resolution)Every provenance/evidence node in the dependency graph MUST be resolvable to an SCR/RSCR entry. Unresolved links invalidate the claim.Eliminates dangling references and unverifiable citations.
CC‑A10.5 (Scope Separation)A single EPV‑DAG instance SHALL NOT mix design‑time method-description source nodes with run-time Work traces. Bridges (“this run trace enacts that method under this method-description source”) MUST be explicit.Avoids conflating intent and execution.
CC‑A10.6 (Externality)The evidencing TransformerRole MUST be external to the holon under evaluation (A.12). Reflexive cases require modelling a meta‑holon and an external mirror.Prevents self‑creation/self‑evidence paradoxes.
CC‑A10.7 (Temporal Coverage)For Γ\_time claims, interval coverage MUST be monotone and fully specified; gaps/overlaps require explicit justification or rejection.Stops invalid time‑series aggregation.
CC‑A10.8 (Integrity & Immutability)SCR/RSCR entries MUST include version/date and checksums; published SCR/RSCR are immutable—updates create a new revision id with a pointer to the prior one.Guards against silent drift and tampering.
CC‑A10.9 (Holarchy Firewall)EPV‑DAG MUST use provenance edges only; mereological edges (ComponentOf, MemberOf, PortionOf, PhaseOf, etc.) MUST NOT appear in EPV‑DAG; conversely, provenance edges MUST NOT be used to build holarchies.Keeps part‑whole and evidence semantics disjoint.
CC‑A10.10 (Γ_sys Evidence relations)Physical claims aggregated by Γ_sys MUST reference measurement models (quantity, unit, uncertainty), boundary conditions, and calibration carriers.Ensures physical plausibility and comparability.
CC‑A10.11 (Γ_method Evidence relations)For order‑sensitive composition, design‑time MUST include a Method Instantiation Card (MIC) (Precedes/Choice/Join, guards, exceptions); run-time traces MUST record happenedBefore, reference the U.Method they enact, and cite the methodDescriptionRef used.Preserves order semantics and reproducibility.
CC‑A10.12 (Γ_work Evidence relations)Resource spending/yield claims MUST be evidenced by instrumented carriers (meters, logs) and their methodRef plus methodDescriptionRef; resource rosters MUST NOT be conflated with SCR/RSCR.Distinguishes cost accounting from knowledge carriers.
CC-A10.13 (Causal support-basis path)If an evidence path is used for a causal-use claim, it MUST carry CausalEvidenceSupportBasis from C.28 and any relevant CausalIdentificationProfile, CounterfactualSamplingRealizabilityProfile, or CausalUseEvidenceDesignRecord refs; A.10 MUST NOT identify causal effects or mint a second support-basis value set.Keeps evidence graph path recoverable without moving causal authority out of C.28.
CC-A10.14 (Authority-reliance use of ordinary evidence paths)When a carrier is used for approval, permission, gate passage, role or status currentness, work occurrence, provenance, authenticity, copied source relation, generated source relation, assurance input, or another authority-reliance claim or effect, the evidence path SHALL name the supported claim or effect, carrier, issuer, performer, source-maintenance role assignment or trust root, affected work target or claim target and relying context, time window, freshness or revocation stance, evidence-producing work event or method trace, evidence relation, and most relevant rival explanation. Expanded fields SHALL be named only when they decide the live reliance question: method trace or work trace, carrier integrity, identity or holder binding, verifier context, relying-party context, acceptance rule, proof result, cryptographic-signature result, status verification result, policy or gate version, decision source, source-chain transform notes, source order, supersession rule, and minimum disclosure boundary.Prevents badges, dashboards, copied text, generated explanations, credentials, provenance labels, and composed chains from supplying false evidence relation, without turning source-finding into a full dossier.
CC-A10.15 (Evidence-kind and reliance disposition)When a source-looking item is used for reliance, A.10 SHALL recover the evidence kind before stating evidence-use classification, then state the local RelianceDisposition, admissible use, non-admissible use, currentness/window, contest or redress path when live, and reopen trigger. RelianceDisposition SHALL NOT be read as CV.Status, GateDecision, selector outcome, problem-card state, assurance approval, or release permission.Keeps evidence relation action-guiding while preventing confidence, conformance, provenance, score, dashboard, generated explanation, or redress wording from becoming hidden authority.

Practitioner’s audit (non‑normative, quick): For any claim, ask What carriers? Which system? Which method? When? If any answer is missing, A.10 is not satisfied.

Consequences

BenefitWhy it mattersTrade‑off / Mitigation
Cross‑scale reproducibilityAny composite metric or argument can be walked back to its carriers and method.Overhead of maintaining SCR/RSCR. Mitigation: keep entries minimal but complete; use checklists from the pedagogical companion.
DesignRunTag clarityIntent (MethodDescription) is cleanly separated from execution (Work traces).Discipline needed at boundaries. Mitigation: MIC templates; explicit “instantiates” bridges.
Objective evidenceExternal TransformerRole eliminates self‑evidence loops.Reflexive systems require a mirror meta‑holon. Mitigation: provide a “reflexive modelling” appendix with examples.
Comparable numbers over timeTemporal coverage invariants prevent “trend” claims built on gaps.Extra dating work for legacy data. Mitigation: allow provisional labels until dating is completed.
Safe composition of knowledgeSCR/RSCR keep sources intact as Γ_epist composes epistemes.Initial friction in teams new to carrier thinking. Mitigation: start with “top‑10 carriers per claim” rule, expand as needed.
Feeds B.3 typed assurance claimsEvidence relations provide evidence inputs such as R and CL only for a named typed assurance claim.B.3 is not a generic trust or assurance score; cite the claim named by value and relying context.

Rationale (SoTA alignment, reader‑friendly)

  • Metrology & assurance. The requirement to name quantities, units, uncertainty, calibration carriers reflects long‑standing metrology practice and modern assurance cases: numbers are only comparable when their measurement models are stated.
  • Knowledge provenance. The EPV‑DAG and SCR/RSCR embody post‑2015 best practices in provenance for epistemes and their carriers: keep a complete, machine‑checkable trail from claims to carriers; separate provenance from part‑whole.
  • Temporal reasoning. Monotone coverage (no unexplained gaps/overlaps) aligns with temporal knowledge graph practice and avoids “impossible histories.”
  • Holonic parsimony. By drawing a firewall between mereology (A.14) and provenance, A.10 prevents semantic leakage and keeps the holarchy well‑typed.
  • Role–Method–Work clarity. Evidence relationing explicitly rides on A.15: roles act via methods specified at design‑time and produce work observed at run‑time. This keeps agency, policy, and execution disentangled yet connected.
  • Credential, provenance, attestation, status-register, and generated-source currentness. Verifiable-credential and digital-identity practice separates issuer or trust root, holder binding, proof result, status result, revocation, validity window, audience, and relying context. Some bounded contexts also treat a register entry or status-source entry as the source that creates or changes role assignment, status assertion, permission, duty, or gate state; a credential view, pass, badge, dashboard cell, API response, screenshot, or certificate excerpt is then a publication of that source, not automatically the source itself. C2PA content provenance plus SLSA and in-toto attestations separate bounded origin, history, build, and process claims from truth, approval, release, safety, gate passage, permission, or assurance; their consumer-side verifier or policy acceptance rule is part of the relying context, not implied by source-carrier presence. LLM citation and generated-explanation practice requires claim-bound attribution alignment before operative claims are relied on. A.10 adopts issuer, holder, verifier, status, and currentness recoverability, status-source recoverability, and claim-bound attribution as evidence-path invariants, adapts credential practice, provenance practice, attestation practice, model documentation, data documentation, register-backed status display, and generated-explanation practice as FPF source-role and carrier-relation inputs, and rejects visual display, copied text, generated text, provenance mark, credential display, register excerpt, or attestation form as evidence of an operative action invitation, gate, role assignment, status assertion, work-occurrence, assurance, or admissible-work effect without source relation named by value.

Action result from that cited practice basis: provenance, attestation, credential, status-register, and generated-source practice rejects the shortcut that provenance means truth, safety, release, permission, or assurance. The local A.10 result is bounded origin, history, build, holder or status currentness, generated-claim source mapping, admissible use, non-admissible use, and reopen when the verifier, trust model, status or currentness rule, source mapping, or source-order relation changes.

Relations

  • Builds on: A.1 Holonic Foundation; A.4 Temporal Duality; A.12 Transformer Externalization; A.14 Advanced Mereology; A.15 Role–Method–Work Alignment.
  • Constrains / used by: B.1 (all Γ‑flavours: Γ_sys, Γ_epist, Γ_method, Γ\_time, Γ_work); B.1.1 (Dependency Graph & Proofs).
  • Enables: B.3 Trust Calculus (R/CL inputs, auditability); B.4 Canonical Evolution Loop (clean DesignRunTag bridges).
  • Coordinates with: C.28 when an evidence path is used for a causal-use relation; A.10 carries the evidence/provenance path, while C.28 governs causal-use question, support basis, identification, realizability, and admissible use and non-admissible use.
  • Coordinates with: A.15 for work or reliance disposition, A.6 for mixed boundary wording, B.3 for assurance, A.21 for OperationalGate(profile), GateDecision, and DecisionLogRef, A.20 for ConstraintValidity status or witness, A.2.9 for speech-act refs, A.2.8 for commitments, and A.15.1 for work occurrences. A.10 supplies evidence paths for those sources; it does not create their gate decision, commitment, role effect, status effect, work-occurrence, assurance, admissible work effect, or admissible reliance effect.

Migration (practical and brief)

Apply these text edits:

  1. Terminology

    • manifest“Symbol Carrier Register (SCR)”; release manifest“Release SCR (RSCR)”.
    • creator / observer (as internal evidencer) → TransformerRole (external).
    • “symbol register” (ambiguous) → “Symbol Carrier Register (SCR)”.
    • Keep resource rosters in Γ_work separate from SCR/RSCR.
  2. Boilerplate inserts

    • In A.10 (this pattern): retain definitions of EPV‑DAG, SCR/RSCR, and the flavour-specific evidence relations.
    • In B.1.3 (Γ_epist): add the Obligations — SCR/RSCR block (“Γ_epist^synth SHALL output SCR… Γ_epist^compile SHALL output RSCR…”).
    • In B.1.5 (Γ_method): ensure MIC is referenced (Precedes/Choice/Join, guards, exceptions) and run‑time traces reference the MethodDescription they instantiate.
    • In B.1.6 (Γ_work): say “resource rosters are not SCR/RSCR; cite meter/log readings via EPV-DAG.”

Evidence carriers for quantum-like readings

Use A.10 when a quantum-like statement needs evidence rather than only a local modeling note. The practical question is not "is this quantum-like source impressive?" but "which carrier evidences which minimal claim, under which time window and method?"

Action path:

  1. State the minimal state, probe, export, or viability reading being evidenced.
  2. Pin the concrete carriers: source, trace, dashboard export, report, observation, metric, work result, model output, interview, survey, or incident record.
  3. State the evidence-producing role and method: who or what produced the carrier, by which method, probe, measurement, or work act.
  4. State the time window, decay condition, and reopen condition.
  5. State what the carrier does not show, including the most relevant rival explanation still live.
  6. Choose the next pattern: stay in A.10 for carrier evidence relation, apply B.3 for assurance claims, apply C.16 for measurement legality, apply F.9 for bridge or export loss, or apply a C.26.* pattern for the remaining probe, state, or envelope question.

For probe-coupled, distributed-state, bridge-loss, measurement-frame, or viability-envelope readings, include at least:

FieldRequired content
ClaimThe minimal state, probe, export, or viability reading being evidenced
CarrierThe concrete evidence carrier or carrier class
Evidence source or carrier kindSource publication, witness statement, measurement result, report publication, trace record, dashboard display, work-result record, or human-statement carrier
Method / probeThe measurement, work act, survey, dashboard query, API read, workshop, model, or trace query that produced the carrier
Time windowWhen the evidence was produced and how long it remains fit for the intended inference
Confidence / limitsWhat the carrier does not show, and what rival explanation remains plausible
Reopen triggerWhen decision, assurance, audit, work use, or reliance use requires additional evidence

Useful outputs:

  • a local evidence note when the claim only guides discussion;
  • an EPV-DAG / SCR / RSCR entry when the claim enters a published assertion;
  • a B.3 assurance tuple when the claim will feed readiness, audit, release, compliance, or comparative assurance;
  • a neighboring-pattern note when the carrier shows only ordinary measurement, bridge loss, or work enactment.

Do not let the label quantum-like carry evidence weight by itself. The evidence graph carries the claim; the math lens only explains what representational mistake the evidence is being used to avoid.

C.29 mathematical-lens use relation

If a mathematical lens needs evidence relation, write the evidence path, source currentness, provenance, and any model-card or datasheet evidence use in A.10. A C.29 output may state only LensUseAdmissibilityValue for the mathematical-lens use claim; it is not an evidence path, currentness proof, provenance record, or evidence-carrier substitute. Assurance or release confidence goes to B.3; measurement construction or comparability goes to C.16.

A.10:End

Ontological Parsimony (C‑5)

“Add only what you cannot subtract.”

Context

The FPF kernel aspires to remain small enough to learn in a week yet broad enough to model engines, proofs and budgets alike. Unchecked growth of primitives—well‑known from earlier “enterprise ontologies”—bloats diagrams, stalls tooling and intimidates new adopters. C‑5 therefore demands minimal‑sufficiency: a new core concept enters the kernel only when all routes of composition, refinement or role‑projection fail to express it without semantic loss.

Problem

PathologyReal‑world symptom
Concept creepNear‑synonyms proliferate (U.Worker, U.Employee, U.Staff), breaking queries.
Zombie typesLegacy primitives linger unused yet block name space.
Tool churnEvery fresh primitive forces IDE, validator and dashboard updates.

Result: steep learning curves, fragile integrations, eroded trust in “first‑principles” promises.

Forces

ForceTension
Expressiveness vs SimplicityFine granularity helps static checks ↔ fewer nouns aid cognition.
Inclusivity vs PurityNew domains want vocabulary ↔ kernel must not be a dumping ground.
Evolution vs StabilityFramework grows ↔ users depend on a stable core.
Prestige vs UtilityAuthors enjoy naming things ↔ every name tcharacteristics everyone else.

Solution — Four‑Gate Minimal‑Sufficiency Protocol

A proposal to add a U.Type or core relation MUST clear all four gates before admission and survives under a Sunset Timer thereafter.

GateTest questionRationale
G‑1 CompositionCan existing primitives + roles/attributes express the concept without material loss?Follows “composition over creation.”
G‑2 Non‑RedundancyDoes the proposal overlap ≥ 80 % with anything already live?Blocks synonyms.
G‑3 Functional NamingDoes the chosen name state what the thing does, not what it is made of?Prevents vague catch‑alls; supports didactic clarity.
G‑4 Sharp BoundaryIs there a one‑sentence litmus test that unambiguously includes or excludes any candidate instance?Ensures crisp taxonomy edges.

Sunset timer — provisional-type review A cleared type enters the kernel provisionally with a timer (default = 4 quarters). If usage count remains zero at expiry, the type faces Sunset Review: delete, demote to Extention Pattern, or renew with fresh evidence.

Manager’s mnemonic: “Compose, Unique, Functional, Crisp — or sunset.”

Archetypal Grounding

GateRejected candidate (why)Accepted approach
G‑1U.CoolantPump – expressible as U.System:Pump + CoolingCirculatorRole.Composition via Role.
G‑2U.Actuator vs existing U.Transformer (90 % overlap).Retain broader U.Transformer.
G‑3U.MiscellaneousObject – name signals no function.Reject; unclear purpose.
G‑4U.SmallPart – boundary depends on subjective size.Reject; fails crisp test.
U.ProvenanceChain – required to record immutable evidence lineage; cannot be composed; functionally named; crisp membership rule (“ordered list of Evidence Graph Ref with forward integrity hash”).Accepted, timer started.

Conformance Checklist

IDRequirementDidactic aim
CC‑OP 1A Minimal‑Sufficiency Form (≤ 1 page) MUST accompany every new kernel‑type proposal, documenting answers to Gates G‑1…G‑4 and a draft Sunset‑Timer.Forces authors to think compositionally before adding nouns.
CC‑OP 2Kernel inventory tooling SHALL stamp each admitted type with sunset_due: <date> (default = +4 quarters).Schedules later pruning; no forgotten zombies.
CC‑OP 3A quarterly Usage Scan MUST flag any core type with reference‑count = 0; flagged items enter Sunset Review automatically.Turns parsimony into a living maintenance loop.
CC‑OP 4Renaming, aliasing, or splitting an existing type REQUIRES re‑passing all four gates and documenting a migration note.Prevents redundancy re‑entering via back door.
CC‑OP 5Patterns SHOULD favour Role + attributes over proposing new domain types; proposals rejected when Gate G‑1 answer is “yes.”Extends parsimony culture beyond the kernel.

Consequences

BenefitImpact for engineer‑managersTrade‑off / Mitigation
Lean kernelFewer primitives → faster onboarding & clearer mental map.Initial author effort to fill Minimal‑Sufficiency Form; template wizard auto‑fills 70 %.
Reduced tool churnStable set of nouns keeps dashboards, linters, reasoners in sync for years.Occasionally slows acceptance of niche concepts; Extention Patterns layer absorbs urgency.
Automatic house‑cleaningSunset cycle prevents accrual of deadwood.Rare risk of deleting a sleeper hit; renewal path allows appeal.
Encultured composition mindsetTeams default to roles & attributes, boosting reuse and cross‑domain dialogue.Requires role libraries and attribute taxonomies; provided in Part C.

Rationale

Cognitive science shows working memory tops out around 4 ± 1 unfamiliar chunks (Cowan 2021). Combining that with Gate discipline keeps kernel size tractable (≈ 40 primitives). Software metrics from lean DSLs (Rust traits, Kubernetes CRDs) reveal that compositional modelling reduces change propagation cost by ~30 %. The Sunset Timer borrows from Kubernetes feature gate “alpha/beta/GA” progression model — proved effective at pruning half‑baked APIs.

Relations

RelationPatternInteraction
Builds onA 8 Universal CoreA candidate must already pass the Three‑Domain Test.
SupportsA 7 Strict DistinctionPrevents near‑duplicate roles that blur layer boundaries.
FeedsB 5 Kernel Change‑LogRecords admissions, renames, sunsets.
ComplementaryA 10 Evidence Graph ReferringProposals cite evidence of irreducibility.

Illustrative Uses (2022 – 2025)

  • Robotics CAL 2023U.LiDARSensor rejected (Gate G‑1 passed via role composition), saving three schema migrations.
  • Green‑Finance CAL 2024U.CarbonCredit admitted provisionally, but Sunset Review (usage = 0) demoted it to sector pattern, avoiding kernel noise.
  • Neuro‑informatics 2025U.ProvenanceChain accepted; by Q3 its heavy reuse in three patterns lifted timer and marked it established.

Open Questions

  1. Hard size cap — should the kernel enforce an absolute limit (e.g., 64 live types) beyond which any new entry-selection effects retirement of an old one?
  2. Semantic similarity tooling — can embedding models automate Gate G‑2 overlap detection reliably across domains?
  3. Gate calibration — is default Sunset Timer (4 quarters) optimal for research‑oriented patterns with slower adoption and evidence accumulation?

A.11:End

External Transformer & Reflexive Split

Intent & Context

The principle of causality is the bedrock of engineering and scientific reasoning: every change has a cause. In FPF, this translates to a strict architectural rule: no "self-magic." An action cannot happen without an actor. This pattern establishes the formal mechanism for modeling causality, ensuring that every transformation is attributed to an explicit, external agent.

This pattern operationalizes the Agent Externalization Principle (C-2). It builds directly upon:

  • A.3 (Transformer Constitution): Which defines the core quartet of action: the Agent (who acts), the MethodDescription (the recipe), the Method (the capability), and the Work (the event).
  • A.2 (Contextual Role Assignment): Which provides the universal syntax Holder#Role:Context for defining agents.

The intent of this pattern is twofold:

  1. To mandate that every transformation is modeled as an interaction between a distinct Agent (playing a TransformerRole) and a distinct Target across a defined Boundary.
  2. To provide a rigorous pattern, the Reflexive Split, for modeling systems that appear to act upon themselves (e.g., self-calibration, self-repair) without violating the principle of external causality.

Problem

Without a strict rule of agent externalization, models become ambiguous and untraceable, leading to critical failures in design and audit:

  1. Causality Collapse ("Self-Magic"): Phrases like "the system configures itself" or "the document updates itself" create a causal black hole. It becomes impossible to answer the question, "What caused this change?" This makes debugging, root cause analysis, and assigning responsibility impossible.
  2. Audit Dead-Ends: An auditor tracing a change finds that the system is its own justification. There is no external evidence, no log from an independent actor, and therefore, no way to verify the integrity of the transformation. This is a direct violation of Evidence Graph Referring (A.10).
  3. Hidden Dependencies: In a "self-healing" system, the healing mechanism (the regulator) and the operational part (the regulated) are modeled as a single monolithic block. This hides the critical internal dependency between them. A failure in the regulator might go unnoticed until the entire system collapses, because its role was never made explicit.

Forces

ForceTension
Causal Clarity vs. Modeling SimplicityThe need to explicitly model every cause-and-effect link vs. the desire to keep diagrams simple by representing self-regulating systems as single blocks.
Objectivity vs. Internal StatesThe need for an external, objective observer/actor to ground all claims vs. the reality that many systems have internal feedback loops that control their own state.
Accountability vs. AutomationIn fully automated systems, it can be tempting to say "the system did it," but for assurance and safety, we must always be able to trace an action back to a specific, responsible component.

A.12:4. Solution

The solution is a two-part architectural mandate: (1) all transformations must be modeled with an external agent, and (2) apparent self-transformation must be modeled using the Reflexive Split.

The Principle of the External Transformer

Every transformation in FPF is a U.Work event that is the result of an Agent acting upon a Target.

  • The Agent: The agent is a Contextual Role Assignment of the form System#TransformerRole:Context. This is the cause, the "doer."
  • The Target: The target is the U.Holon being changed. This can be another U.System or the symbol carrier of a U.Episteme.
  • The Boundary: The agent and the target are always separated by a U.Boundary and interact through a U.Interaction.

Crucial Rule: The holder of the Agent's U.RoleAssignment cannot be the same holon instance as the Target.

holder(Agent) ≠ Target

This simple inequality is the core of the externalization principle. It constitutionally forbids self-magic.

Reflexivity vs cross‑reference (normative note)

FPF distinguishes reflexive transformation from episteme‑level reference. Reflexive cases (e.g., “self‑calibration”) MUST be modeled by the Reflexive Split (Regulator→Regulated) and remain within the world ReferencePlane. When a claim refers to another claim/episteme, model it with epistemeAbout(x,y) and set ReferencePlane(x)=episteme. Such references do not perform transformations and MUST NOT be used to bypass the external‑agent rule. Evaluation of chains of episteme‑about relations MUST remain acyclic within a single evaluation chain; otherwise, abstain and request a split or external evidence.

The Reflexive Split Pattern

So, how do we model a system that does act on itself, like a self-calibrating sensor? We use the Reflexive Split. We recognize that the system is not a monolith; it contains at least two distinct functional parts.

The Procedure:

  1. Identify the Roles: Decompose the system's function into two distinct roles: the part that regulates and the part that is regulated.
  2. Model as Two Holons: Model these two parts as two distinct (though possibly tightly coupled) U.System holons, even if they share the same physical casing.
  3. Define the Internal Boundary: Model the interface between them as an internal U.Boundary with a defined U.Interaction (e.g., a data bus, a mechanical linkage).
  4. Assign the Transformer Role: The regulating part becomes the holder of the TransformerRole. The regulated part becomes the Target.

Now, the "self-action" is modeled as a standard, external transformation that just happens to occur inside the larger system's boundary. Causality is restored, and the model becomes auditable.

Didactic Note for Engineers & Managers: The "Two Hats" Analogy

Think of the Reflexive Split like a manager who needs to review their own work. To do it properly, they must metaphorically wear "two hats."

  • Hat 1: The Doer. They perform the task.
  • Hat 2: The Reviewer. They step back, put on their "reviewer hat," and inspect the work as if it were done by someone else.

The Reflexive Split formalizes this. The "Doer" is the Regulated subsystem. The "Reviewer" is the Regulator subsystem, which plays the TransformerRole. By modeling them as two separate entities, we make the internal quality control loop explicit and prevent the logical error of a system magically grading its own homework.

Archetypal Grounding

The principle of external causality and the Reflexive Split pattern are universal. They apply equally to physical systems, epistemes, and socio-technical organizations.

ScenarioNaive Description ("Self-Magic")FPF Model with Reflexive SplitAgent & Target
System Archetype"The robot calibrates itself."The robot is modeled as a composite holon containing two subsystems:
1. CalibrationController (U.System)
2. SensorSuite (U.System)
They interact across an internal data bus (U.Boundary).
Agent: CalibrationController#TransformerRole:RobotInternals
Target: SensorSuite
Episteme Archetype"The document automatically updates its cross-references."The "document" is a system comprising:
1. UpdateScript (a U.System that executes code)
2. DocumentFile.xml (a U.System acting as a symbol carrier)
They interact via the file system (U.Boundary).
Agent: UpdateScript#TransformerRole:DocumentSystem
Target: DocumentFile.xml (the carrier of the U.Episteme)
Socio-Technical Archetype"The team reviews its own performance."The team is modeled as a collective U.System that enacts two roles at different times:
1. ExecutionTeam (doing the sprint work)
2. ReviewTeam (conducting the retrospective)
The "boundary" is the formal separation created by the retrospective ceremony.
Agent: Team#ReviewerRole:RetrospectiveContext
Target: The U.Work logs and evidence carriers produced by the Team#ExecutionRole.

Key takeaway from grounding: These examples demonstrate that there is no such thing as self-action in a well-formed model. Every action, even an internal one, can and must be decomposed into an external interaction between a distinct agent and a distinct target. This makes the causal chain explicit and auditable in all domains.

Conformance Checklist

To enforce the principles of externalization and causal clarity, all FPF models must adhere to the following normative checks.

IDRequirement (Normative Predicate)Purpose / Rationale
CC-A12.1 (External Agent Mandate)Every transformation (U.Work) MUST be attributed to an Agent (U.RoleAssignment) whose holder is distinct from the target holon.This is the core rule that forbids self-magic. It ensures every action has an identifiable, external cause.
CC-A12.2 (Reflexive Split for Self-Action)Any narrative of "self-modification" (e.g., self-repair, self-configuration) MUST be modeled using the Reflexive Split pattern.Forces the modeler to make internal control loops explicit by identifying the distinct Regulator (Agent) and Regulated (Target) subsystems.
CC-A12.3 (Boundary Explicitness)The U.Boundary and U.Interaction between the Agent and the Target MUST be explicitly modeled.Makes interfaces a first-class citizen of the model. Prevents hidden dependencies and ensures interactions are auditable.
CC-A12.4 (Episteme Carrier as Target)When a U.Episteme is modified, the Target of the transformation MUST be its symbol carrier (U.System), not the U.Episteme itself.Reinforces Strict Distinction (A.7). Knowledge doesn't change by magic; a physical agent must act on its physical representation.
CC-A12.5 (No Self-Evidence)The Agent that performs a transformation cannot be the sole source of evidence for the success or properties of that transformation. Evidence MUST be anchored via an independent Observer.Prevents conflicts of interest in assurance. The Transformer does the work; a separate Observer (another RoleAssignment) validates it. This aligns with A.10 (Evidence Graph Referring).

Consequences

BenefitsTrade-offs / Mitigations
Causal Traceability & Auditability: Every change is linked to a specific agent and interaction, creating a complete and unambiguous audit trail. This is essential for root cause analysis and accountability.Increased Model Granularity: The Reflexive Split requires creating more model elements than a simple monolithic block. Mitigation: This is not a bug, but a feature. The "extra" elements represent real, critical parts of the system's architecture that were previously hidden. FPF tooling can help manage this via views that can "collapse" a split system for summary diagrams.
Architectural Honesty: The pattern forces designers to be explicit about internal control loops, interfaces, and dependencies, leading to more robust and well-understood system architectures.Requires a Shift in Thinking: Modelers accustomed to "self-x" narratives must learn to think in terms of external interactions. Mitigation: The "Two Hats" analogy and clear archetypes (Section 5) serve as powerful didactic tools to facilitate this shift.
Enables True Modularity: By making interfaces explicit, the pattern supports modular design. A Regulator subsystem could potentially be swapped out for a different one as long as it respects the same U.Interaction Standard.-
Unlocks Deeper Analysis: Once an internal control loop is made explicit, it can be formally analyzed for stability, performance, and failure modes using tools like the Supervisor-Subsystem Feedback Loop pattern (B.2.5).-

Rationale

The principle of externalization is not an arbitrary rule imposed by FPF; it is a distillation of foundational concepts from multiple rigorous disciplines.

  • Cybernetics & Control Theory: As Ashby's Law of Requisite Variety and modern control theory (e.g., Matni et al., 2024) demonstrate, regulation is fundamentally an interaction across a boundary between a controller and a plant. Conflating the two hides the causal structure and makes stability analysis impossible. The Reflexive Split is the FPF's implementation of this core cybernetic principle.
  • Physics (Constructor Theory): As discussed in A.3, Constructor Theory recasts physics in terms of what transformations are possible. A transformation is always performed by a "constructor" (our Transformer) on a substrate. The theory does not contain "self-constructing" substrates. FPF's externalist stance is fully aligned with this physical worldview.
  • Philosophy of Science (Objectivity): The scientific method is built on the principle of external observation and verification. A theory cannot validate itself; its predictions must be checked by an independent experiment. The No Self-Evidence rule (CC-A12.5) is the direct implementation of this principle in the FPF's assurance calculus.
  • Software Engineering (Dependency Inversion): The dependency-inversion principle says that policy modules should not depend directly on implementation modules; both depend on abstractions. This is a form of externalization. It enforces clean separation and makes systems more modular and testable. The explicit U.Boundary in our pattern serves the same architectural purpose as a well-defined interface in software.

By mandating externalization, FPF is not adding bureaucratic overhead. It is enforcing a set of first principles that are demonstrably essential for building complex systems that are understandable, auditable, and trustworthy.

Relations

  • Directly Implements: C-2 Agent Externalization Principle.
  • Builds Upon:
    • A.1 Holonic Foundation: Provides the U.System and U.Episteme holons that act as agents and targets.
    • A.2 Role Taxonomy: Provides the Contextual Role Assignment (U.RoleAssignment) mechanism to define the Agent.
    • A.3 Transformer Constitution: Defines the TransformerRole that the Agent plays.
  • Enables and Constrains:
    • A.10 Evidence Graph Referring: Provides the causal structure (who did what) that evidence must be anchored to.
    • B.2 Meta-Holon Transition (MHT): A Reflexive Split is often the first step in identifying an emergent supervisory layer that may later be promoted to a new meta-holon.
    • B.2.5 Supervisor-Subsystem Feedback Loop: This pattern provides the detailed architecture for the Regulator-Regulated interaction that the Reflexive Split reveals.

A.12:End

The Agential Role & Agency Spectrum

“Agency is not a kind of thing; it is a way some systems operate.”

Intent & Context

The concept of "agency"—the capacity of an entity to act purposefully—is central to engineering, biology, and AI, yet it remains one of the most overloaded and ambiguous terms. Without a precise, falsifiable, and substrate-neutral definition, models of autonomous systems risk descending into "self-magic," where actions have no clear cause and accountability is lost.

This pattern builds directly upon the foundations laid in the FPF Kernel to provide that definition. A.1 established that only a U.System can be the bearer (holder) of behavioral roles. A.2.1 defined the universal U.RoleAssignment (Holder#Role:Context) as the canonical way to assign roles. A.3 and A.12 defined the TransformerRole and the principle of the external agent.

The intent of this pattern is to:

  1. Formally define agency not as an intrinsic type of holon, but as a contextual Role Assignment.
  2. Introduce a measurable, multi-dimensional spectrum of agency via a dedicated Characterization (Agency-CHR), moving beyond a simple binary "agent/not-agent" switch.
  3. Provide a clear, didactic grading system that allows engineers and managers to assess and communicate the Agency Grade of any system in a consistent, evidence-backed manner.

Problem

If agency is treated as a monolithic, intrinsic property or a mere label, four critical failure modes emerge, undermining the rigor of FPF:

  1. Episteme-as-Actor: Models might incorrectly assign agency to knowledge epistemes or publications (U.Episteme), leading to nonsensical claims like "the specification decided to update the system." This is a direct violation of Strict Distinction (A.7).
  2. Type Inflation: Introducing a U.Agent as a new base type alongside U.System and U.Episteme would violate Ontological Parsimony (C-5) and create conflicts with the dynamic nature of roles. A system might act as an agent in one context and a passive component in another; a static type cannot capture this.
  3. Unfalsifiable Claims: Without a measurable basis, "agency" becomes a subjective label. A team might call their system an "agent" for marketing purposes, but this claim has no verifiable meaning and cannot be audited, violating Evidence Graph Referring (A.10).
  4. The Binary Trap: A simple "agent/not-agent" classification is too coarse. It fails to distinguish between a simple thermostat, a predictive cruise control system, and a strategic, self-learning robotic swarm, even though their cognitive capabilities differ by orders of magnitude.

Forces

ForceTension
Scientific Fidelity vs. SimplicityContemporary science (e.g., Active Inference) models agency as a continuous, scale-free spectrum. FPF needs to honor this rigor while providing a simple, teachable model for practitioners.
Role vs. TypeThe intuition is to think of an "Agent" as a type of thing. FPF's architecture demands that it be modeled as a role to preserve dynamism and ontological hygiene.
Measurement vs. LabelEngineers and managers need a quick, intuitive label (e.g., "this is a Level 3 agent"), while formal assurance requires a detailed, multi-dimensional, evidence-backed measurement.
System-only Action vs. Collective ActionHow does agency apply to groups like teams or swarms? This requires a clear link to the rule from A.1 that any acting group must be modeled as a U.System.

Solution

FPF's solution is threefold: it defines an Agent via U.RoleAssignment (A.2.1), makes agency measurable with a dedicated Characterization, and provides a didactic summary via a graded scale.

The Core Definition: Agent as a Contextual Role Assignment

An "Agent" in FPF is not a fundamental type. It is a convenience term (a Register 1 / Register 2 label) for a specific kind of Contextual Role Assignment (U.RoleAssignment):

Agent ≍ U.RoleAssignment(holder: U.System, role: U.AgentialRole, context: U.BoundedContext)

This means an Agent is simply a U.System that is currently playing an AgentialRole within a specific U.BoundedContext.

  • No U.Agent Type: To be clear, there is no U.Agent base type in the FPF Kernel. This avoids type inflation and preserves the dynamic nature of roles.
  • Epistemes Cannot Be Agents: As the holder must be a U.System, this definition constitutionally forbids U.Epistemes from being agents, preventing the "episteme-as-actor" category error.
  • Canonical Syntax: The technical notation for an agent is System#AgentialRole:Context.

The AgentialRole and its Specializations

  • U.AgentialRole: This is the abstract U.Role that grants a U.System the capacity for goal-directed action within a context. It is the "license to act."
  • Specialized Roles: More specific behavioral roles like TransformerRole and ObserverRole are considered specializations or sub-roles of AgentialRole. They describe what kind of agential action is being performed at a given moment.
    • A system playing TransformerRole is an Agent that is currently modifying another holon.
    • A system playing ObserverRole is an Agent that is currently gathering information. This creates a clean hierarchy: a Transformer is always an Agent, but an Agent is not always a Transformer (it could be observing, planning, or idle).

Measuring Agency: The Agency-CHR and the Spectrum

Agency is not a binary switch; it is a multi-dimensional spectrum of capabilities. FPF models this using a dedicated pattern, Agency-CHR (C.9), which is a Characterization that attaches a set of measurable properties to a U.RoleAssignment.

The Agency-CHR profile is grounded in contemporary research (e.g., Active Inference, Basal Cognition) and includes the following key characteristics. Each is measured for a specific agent in a specific context and must be backed by evidence (A.10).

  1. Boundary Maintenance Capacity (BMC): The ability of the system to maintain its structural and functional integrity against perturbations. (How robust is it?)
  2. Predictive Horizon (PH): The temporal or causal depth of the agent's internal model. (How far ahead can it "see"?)
  3. Model Plasticity (MP): The rate at which the agent can update its internal model (U.GenerativeModel) in response to prediction errors (U.Error). (How quickly can it learn?)
  4. Policy Enactment Reliability (PER): The probability that the agent will successfully execute its chosen U.Method under operational conditions. (How reliably does it do what it decides to do?)
  5. Objective Complexity (OC): A measure of the complexity of the U.Objective the agent can pursue, from simple set-points to abstract, multi-scale goals.
Context-bounded task-family specialization claims

When work shifts to a new TaskFamily, describe the holder as acquiring context-bounded task-family specialization rather than as becoming more generally intelligent in the abstract. The same holder may carry different task-family specializations across different task families without becoming a new kernel type. Breadth across unrelated task families is not the adaptation-signature claim here; the adaptation-signature claim is time-to-usable specialization on the declared task family and work target under a named work-measure threshold, adaptation budget, and freshness or provenance basis.

Low-human-overlap or newly discovered task families remain admissible when the task family, evidence basis, and reuse window are explicit by value.

The Agency Grade (Didactic Layer)

While the multi-dimensional Agency-CHR profile is essential for formal assurance, engineers and managers need a simpler, at-a-glance summary. The Agency Grade is a non-normative, didactic scale from 0 to 4 that synthesizes the CHR profile into an intuitive autonomy grade.

GradeLabelTypical Agency-CHR Profile (Conservative Lower Bound)Archetypal Example
0Non-AgentialBMC ≈ 0, PH ≈ 0, MP ≈ 0A rock, a document, a passive structural component.
1ReactiveBMC > 0, PH ≈ 0, MP ≈ 0A thermostat; a simple feedback controller. Follows fixed rules.
2PredictiveBMC > 0, PH > 0, MP ≈ 0A model-predictive controller with a fixed model; a chess engine that plans moves but doesn't learn new strategies.
3AdaptiveBMC > 0, PH > 0, MP > 0A self-calibrating sensor system; a machine learning agent that updates its model with new data.
4Reflective/StrategicHigh BMC, PH, MP, PER, and OC. Capable of meta-cognition (reasoning about its own reasoning) and pursuing abstract goals.An autonomous R&D system; a cohesive, self-organizing DevOps team.

Crucial Distinction: The Agency-CHR profile is the normative evidence. The Grade is a pedagogical shortcut. A holder cannot claim an Agency Grade without having a corresponding, auditable CHR profile to back it up.

Archetypal Grounding

The universal pattern of agency, defined as a Contextual Role Assignment and measured by the Agency-CHR, manifests across all domains. The following table demonstrates its application to the FPF's two primary archetypes: a U.System and a collective U.System (a team), while explicitly showing why a U.Episteme cannot be an agent.

ArchetypeHolder (U.System)Role & Context (#Role:Context)Agency-CHR Profile SketchResulting Agency Grade
Simple ControllerThermostat_Model_T800#AgentialRole:HomeHeatingSystemBMC: High (maintains temp).
PH: Zero (no prediction).
MP: Zero (fixed logic).
PER: Very High.
OC: Low (single set-point).
Grade 1 (Reactive)
Advanced ControllerPredictiveCruiseControl_v3#AgentialRole:VehicleDynamicsBMC: High.
PH: High (predicts traffic flow).
MP: Zero (fixed model).
PER: High.
OC: Medium (optimization).
Grade 2 (Predictive)
Learning SystemSelfCalibratingSensorArray#AgentialRole:IndustrialProcessBMC: High.
PH: High.
MP: Medium (learns drift).
PER: High.
OC: Medium.
Grade 3 (Adaptive)
Collective AgentDevOpsTeam_Phoenix (a collective U.System)#AgentialRole:ProjectPhoenixBMC: High (maintains velocity).
PH: High (sprint planning).
MP: High (retrospectives).
PER: Medium-High.
OC: High (abstract business goals).
Grade 4 (Reflective/Strategic)
Knowledge ArtifactISO_26262_Standard.pdf (U.Episteme)N/A (Cannot be a holder of an AgentialRole)N/AGrade 0 (Non-Agential)

Key takeaway from grounding: This table makes the abstract model concrete. It shows that the FPF agency model can precisely differentiate between simple controllers and complex learning systems. It also reinforces the Strict Distinction principle: the ISO standard (U.Episteme) is a crucial justification (justification?) for the actions of an agent (like the DevOps team), but it is never an agent itself.

Conformance Checklist

To ensure the agency model is applied rigorously and consistently, all FPF publications must adhere to the following normative checks.

IDRequirement (Normative Predicate)Purpose / Rationale
CC-A13.1 (Holder Type)The holder of a U.RoleAssignment with role: U.AgentialRole MUST be a U.System.Prevents the "episteme-as-actor" category error. Enforces Strict Distinction (A.7).
CC-A13.2 (RoleAssignment Mandate)Any claim of agency MUST be represented by a complete U.RoleAssignment instance, including an explicit holder, role, and context.Ensures that agency is always modeled as contextual and bound to a specific bearer, not as a free-floating property.
CC-A13.3 (CHR Evidence)Any claim about an Agent's Agency Grade or autonomy profile MUST be substantiated by an auditable Agency-CHR profile with Evidence Graph Ref (A.10).Makes claims of agency falsifiable and prevents "agency by marketing."
CC-A13.4 (Grade is Didactic)The Agency Grade (0-4) SHALL NOT be used as a normative input for formal reasoning. It is a didactic summary of the Agency-CHR profile.Prevents oversimplification in formal models. The detailed profile, not the summary grade, must be used for assurance cases.
CC-A13.5 (Collective as System)To claim agency for a collective (e.g., a team, a swarm), the collective MUST first be modeled as a U.System with a defined U.Boundary and a coordination U.Method.Prevents the error of assigning agency to a mere set or collection (MemberOf). Aligns with A.1 and A.14.
CC-A13.6 (MHT for Emergent Agency)If a collection of systems, previously non-agential or at a lower grade, develops a new supervisory structure and crosses a documented Agency-CHR threshold, a Meta-Holon Transition (MHT, B.2) MUST be declared.Makes the emergence of collective agency an explicit, auditable event, preventing "magic" emergence.

Consequences

BenefitsTrade-offs / Mitigations
Category Safety & Clarity: The pattern provides a clear, unambiguous definition of agency that prevents common modeling errors and is consistent across all of FPF.Increased Modeling Granularity: Requires modelers to think in terms of Role-assignments and contexts, which is slightly more complex than just labeling something an "Agent." Mitigation: The Holon#Role:Context syntax and tooling support make this manageable in practice.
Falsifiable & Measurable Agency: By grounding agency in the Agency-CHR, the framework transforms a vague philosophical concept into a set of concrete, evidence-backed engineering properties.Measurement Effort: Populating the Agency-CHR profile requires real work (testing, analysis, data gathering). Mitigation: The profile can be built iteratively. An initial estimate can be used, with the understanding that its Reliability (R) score is low until backed by evidence.
Scalable Autonomy Model: The graded scale provides a sophisticated language for describing and comparing different Agency Grades, from simple automation to strategic intelligence.Risk of Misinterpreting Grades: The simple 0-4 scale could be misused as a simplistic marketing label. Mitigation: The normative requirement (CC-A13.4) to always link a grade to its underlying CHR profile acts as a guardrail against this.
Elegant Handling of Collectives: The pattern provides a clean way to model the agency of teams, swarms, and organizations without violating ontological principles.-

Rationale

This pattern's value comes from its synthesis of contemporary, post-2015 research into a single, operational model.

  • Grounded in Science: The move away from a binary, type-based view of agency towards a graded, spectrum-based model is directly aligned with modern research in Active Inference (Friston et al.), Basal Cognition (Fields, Levin), and evolutionary cybernetics. The Agency-CHR provides a direct, practical implementation of these ideas.
  • Ontologically Sound: By defining an Agent as a Contextual Role Assignment, the pattern avoids the ontological pitfalls of creating a new base type. It fully embraces the FPF's core architectural principle of separating substance (holder) from function (role) within a context. This aligns with best practices from foundational ontologies (like UFO) and the principles of Strict Distinction (A.7).
  • Pragmatic and Actionable: The pattern is designed for engineers and managers. The Agency Grade provides a quick communication tool, while the underlying Agency-CHR provides the detailed, auditable data needed for formal assurance and risk management. This duality satisfies both Didactic Primacy (P-2) and Pragmatic Utility (P-7).

In essence, this pattern does not invent a new theory of agency. It distills and operationalizes the emerging scientific consensus, packaging it into a rigorous, falsifiable, and practical tool for the FPF ecosystem.

Relations

  • Builds on:
    • A.1 Holonic Foundation: Establishes that only U.Systems can be bearers of behavioral roles.
    • A.2 Role Taxonomy: Provides the universal Contextual Role Assignment (U.RoleAssignment) mechanism.
    • A.12 External Transformer: The actions of an Agent are modeled using the external transformer principle.
  • Coordinates with:
    • B.2 Meta-Holon Transition (MHT): A significant jump in the Agency-CHR of a collective can trigger an MHT.
    • B.3 Trust & Assurance Calculus: The Agency-CHR profile provides crucial inputs for assessing the reliability and safety of an autonomous system.
    • D.2 Multi-Scale Ethics Framework: The Agency Grade is used to determine the moral-responsibility posture and accountability assigned to a system.
  • Instantiates:
    • The Agency-CHR (C.9), which provides the formal definitions for the characteristics (BMC, PH, etc.).

A.13:End

Advanced Mereology: Components, Portions, Aspects & Phases

Context — why an advanced mereology?

FPF’s holonic modelling relies on part–whole relations to build structural and conceptual holarchies (systems and epistemes). But U.Holon is not synonymous with “mereological whole”: some holons (notably Roles and Methods) are bounded identity‑bearing objects whose primary composition is handled by other algebras (A.2 role algebra; A.15 method/description graphs), not by partOf. Early drafts distinguished structural vs. conceptual parthood (e.g., ComponentOf, ConstituentOf) but practical modelling kept hitting two recurrent gaps:

  1. Quantities vs. parts. Engineers routinely need “some of the fuel”, “the first 10 pages”, “a 30% subset of data”. This is not a component; it is a portion of a stuff‑like whole, governed by measures and conservation.

  2. Change vs. replacement. Authors need to say “the prototype before calibration”, “v2 of the spec”, “shift 1 vs. shift 2 of the same run”. That is not a new whole; it is a phase of the same carrier across time.

This section introduces two normative sub‑relations of partOf that close those gaps and lock them to the rest of the kernel:

  • PortionOf — metrical, measure‑preserving parthood of stuffs and other measurables.
  • PhaseOf — temporal parthood of the same carrier across an interval.

It also restates guard‑rails that keep Roles and Methods (as intensional masks/ways‑of‑doing) outside mereology (A.15), while allowing their describing epistemes (e.g., U.MethodDescription, U.WorkPlan) to use ordinary episteme parthood and versioning like any other U.Episteme. It also clarifies how MemberOf fits (preview: collections are grounded constructively in C.13 Compose‑CAL via Γ_m.set; collective agency/composition is handled outside A.14 via B.1.7 Γ_collective and A.15, not via partOf).

Publication note (Working‑Model first). Read A.14 together with E.14 Human‑Centric Working‑Model and B.3.5 CT2R‑LOG: publish relations on the Working‑Model surface; when assurance is sought, ground downward. For structural claims that require extensional identity, use the Constructive shoulder via Compose‑CAL Γ_m (sum | set | slice); order/time stay outside mereology (Γ_time / Γ_method).

Problem — what breaks without these distinctions?

If we only have “generic partOf” (plus Component/Constituent), four classes of errors appear:

  1. Conservation errors. Treating “20 L of fuel from Tank A” as a component leads to nonsense: adding and removing such “components” does not respect quantities; Γ_sys proofs violate Σ‑balance.

  2. Temporal smearing. Flattening “before/after”, or “v1/v2” into one timeless whole collapses history; Γ_time and Γ_method cannot justify order‑sensitive properties; audits cannot reproduce conditions.

  3. Identity confusion. Modelling “new version” as “new component” either breaks identity (it is still the same holon evolving) or hides a Meta‑Holon Transition when identity really changes.

  4. Role leakage. Functional/organisational roles sneak into part trees (“the PumpRole is part of the plant”), violating A.15 and making structural reasoning brittle.

Forces

ForceTension
Expressiveness vs. ParsimonyWe need new relations (Portion, Phase) ↔ we must keep the catalogue minimal and orthogonal.
Universality vs. Domain nuanceOne set of rules must serve physical systems and epistemes ↔ measurement and time behave differently by domain.
Identity vs. ChangePreserve “the same carrier through change” ↔ allow explicit re‑identification when invariants fail.
Static structure vs. HistoriesPart trees should be simple ↔ real work requires phased histories and measured slices.

Solution — extend the mereology catalogue, keep it clean

A.14 defines two additional sub‑relations of partOf and re‑affirms the firewall between mereology and the role/recipe layer:

  1. PortionOf — for measured parts of a whole (stuffs and other extensives).
  2. PhaseOf — for temporal parts of the same carrier.
  3. No Roles/Methods in mereology. U.Role and U.Method are never parts (A.15). A U.MethodDescription is an Episteme and may be versioned/structured; that does not make the described U.Method a part.
  4. MemberOf stays, but constructive aggregation and agency live elsewhere. MemberOf remains available to state collections and collectives; a collection‑as‑whole may be constructed via Γ_m.set (Compose‑CAL, C.13), while collective agency/composition is handled in B.1.7 Γ_collective and A.15 (not in A.14).

The classical pair ComponentOf (structural, discrete) and ConstituentOf (conceptual, logical/epistemic) remain as in the kernel; A.14 only clarifies how to tell them apart from Portion/Phase (§ 6).

Formal cores (normative semantics)

PortionOf — metrical part of a measurable whole

Intent. Capture “some of the same stuff/extent”, governed by a measure that adds up.

Applicability. Any U.Holon that carries an extensive measure μ on the chosen scope (examples: mass, volume, length‑of‑text, byte size, wall‑time budget).

Primitive. PortionOf(x, y) means: x is the same kind of stuff/content as y, but less.

Axioms (A14‑POR‑*)

  • POR‑1 (Partial order). PortionOf is reflexive, antisymmetric, transitive on its domain.
  • POR‑2 (Metrical dominance). If x ProperPortionOf y then 0 < μ(x) < μ(y) for the agreed μ.
  • POR‑3 (Additivity on disjoint portions). If x ⟂ y (no overlap) and both PortionOf y, then μ(x ⊔ y) = μ(x)+μ(y) and x ⊔ y PortionOf y.
  • POR‑4 (Kind integrity). x and y must share the same measure kind and unit (or a declared conversion).
  • POR‑5 (Boundary compatibility). For physical wholes, the whole’s boundary encloses the union of its portions; cross‑boundary “leaks” are interactions, not portions.

Didactic tests. ✔ “5 kg from a 20 kg billet” — PortionOf. ✔ “Pages 1–10 of the report” — PortionOf (μ = page or token count). ✘ “The pump module of the plant” — ComponentOf, not PortionOf. ✘ “The Methods section of the paper” — ConstituentOf, not PortionOf.

PhaseOf — temporal part of the same carrier

Intent. Capture “the same holon during a sub‑interval”, preserving identity through change.

Applicability. Any U.Holon that persists across time with a recognised carrier identity.

Primitive. PhaseOf(x, y) means: x is y restricted to a proper time interval.

Axioms (A14‑PHA‑*)

  • PHA‑1 (Partial order). PhaseOf is reflexive, antisymmetric, transitive (on the same carrier).
  • PHA‑2 (Coverage). The whole is the union of its maximal, non‑overlapping phases over its lifetime interval.
  • PHA‑3 (No paradoxical overlap). Phases of the same carrier do not overlap in time; overlapping variants require PhaseOf on aspects or different carriers.
  • PHA‑4 (Identity through change). Properties may vary between phases, but the carrier’s identity criteria hold continuously (e.g., same serial number, same legal identity, same theorem statement).
  • PHA‑5 (Escalation to MHT). If identity criteria break (e.g., metamorphosis with new objectives), declare a Meta‑Holon Transition (B.2) rather than a PhaseOf.

Didactic tests. ✔ “PumpUnit#3 before calibration” — PhaseOf(Pump#3_pre, Pump#3). ✔ “Spec v2” — PhaseOf(Spec_v2, Spec), on the MethodDescription episteme. ✔ “Shift 1 of the same batch run” — PhaseOf(Work_shift1, Work). ✘ “Prototype vs. production unit” — likely different carriers; use ComponentOf/ConstituentOf or MHT per criteria.

  • Structural claims published on the Working-Model surface SHALL be justified, when assurance is required, by a Constructive grounding narrative using Γ_m.sum | Γ_m.set | Γ_m.slice and linked with tv:groundedBy (see B.3.5; C.13).
  • PhaseOf is temporal parthood; it SHALL NOT be grounded via Γ_m. Its assurance follows identity‑through‑time criteria (CC‑PHA‑1..3) and Γ_time ordering (B.1.4).
  • MemberOf remains non‑mereological (CC‑MEM‑2). When modelling a collection‑as‑whole for assurance purposes, the constructive basis is Γ_m.set; no ComponentOf inferences follow from MemberOf.

Choosing the right relation (decision table)

You want to say…UseWhy
“This is a piece of the same stuff (lower amount/extent).”PortionOfGoverned by a measure μ and conservation (Σ‑additive).
“This is a discrete part that sits inside the whole.”ComponentOfStructural parthood; boundary‑respecting, not measured by μ.
“This is a logical part in a conceptual whole.”ConstituentOfSections, lemmas, clauses, conceptual assembly.
“This is the same entity during a sub‑interval.”PhaseOfTemporal slicing with identity continuity.
“This item belongs to that collection/collective.”MemberOfNot a building block of the whole; set‑as‑whole via C.13 (Γ_m.set), collective action via B.1.7/A.15.
“This system plays a Role or position.”playsRole (A.15)Roles are contextual masks, never parts.

Firewall reminder. If your sentence is about who does what, how it is done, or what happened when (role, method, or run), you are likely in A.15. If it is about the document or carrier (its pages/sections/versions), you may still be in A.14 (Episteme mereology).

Archetypal grounding (System / Episteme)

RelationU.System exampleU.Episteme example
PortionOf50 L from a 200 L fuel tank (μ = volume).Pages 1–10 from a 120‑page report (μ = page/token count).
ComponentOfImpeller ComponentOf PumpUnit.Figure 2 ComponentOf Poster Layout (physical poster layout).
ConstituentOfControl law ConstituentOf Controller Design.Lemma A ConstituentOf Theorem Proof.
PhaseOfPumpUnit#3 before/after calibration (same serial).Spec v1 → v2 (same document lineage).
MemberOf (for reference)“is an element of a collection/collective”; use when a grouping is explicitly treated as a whole set, without implying component integration. Not a building block of the whole; constructive aggregation is handled in C.13 Compose‑CAL (Γ_m.set).Same collection-member rule for epistemes; if the grouping is expected to act, model a collective system (A.15).

Conformance Checklist & type guards (normative)

Global firewall and scope

IDRequirementPurpose
CC‑A14‑0No U.Role or U.Method MAY occur as a node in any partOf chain.Keeps masks/ways‑of‑doing outside mereology (see A.15).
CC‑A14‑0aU.MethodDescription / U.WorkPlan and other describing epistemes MAY participate in partOf only as U.Episteme nodes (e.g., ConstituentOf, text PortionOf, version PhaseOf); they MUST NOT be asserted as ut:StructPartOf of any U.System.Allows document structure/versioning without smuggling Methods into structure.
CC‑A14‑0bMemberOf MUST NOT imply, entail, or be auto‑rewritten into any partOf sub‑relation.Separates collections/collectives from parthood.
CC‑A14‑0cSerialStepOf / ParallelFactorOf MUST NOT appear in any partOf chain or table in A.14; model order via A.15 (Γ_ctx/Γ_method).Prevents the “order‑as‑structure” category error.

PortionOf guards

IDRequirementPurpose
CC‑POR‑1 (Domain)PortionOf(x,y) is valid only if the modelling scope declares at least one extensive measure μ for y (mass, volume, token count, byte size, wall‑time budget, etc.).Prevents “portion” without a measure.
CC‑POR‑2 (Kind)x and y SHALL share the same μ‑kind and compatible units (or an explicit conversion).Prevents apples‑to‑oranges addition.
CC‑POR‑3 (Monotone additivity)For disjoint portions x ⟂ z with PortionOf(-,y): μ(x ⊔ z) = μ(x)+μ(z).Secures Σ‑reasoning and Γ_sys proofs.
CC‑POR‑4 (Boundary)For physical systems, the whole’s boundary encloses the union of portions; cross‑boundary flows are not portions.Distinguishes stock vs flow.
CC‑POR‑5 (Non‑replacement)“Replacing 20% of y by v” MUST be modelled as PortionOf removal + Component/Constituent insertion, not as a single PortionOf rewrite.Avoids silent identity change.

PhaseOf guards

IDRequirementPurpose
CC‑PHA‑1 (Carrier identity)PhaseOf(x,y) requires an explicit identity criterion for y valid over the union of phases (e.g., serial number, legal identity, theorem statement).Prevents re‑identification by stealth.
CC‑PHA‑2 (Coverage & non‑overlap)The lifetime of y equals the union of its maximal, non‑overlapping phases (on the same aspect).Enables Γ_time composition and audit.
CC‑PHA‑3 (Aspect clarity)If two temporal slices of y overlap, they MUST be phases of different aspects (e.g., mechanical‑state vs software‑state), or else be different carriers.Avoids paradoxical overlaps.
CC‑PHA‑4 (Escalation)If identity criteria fail during change, declare a Meta‑Holon Transition (B.2) instead of PhaseOf.Makes re‑identification explicit.
CC‑PHA‑5 (MethodDescription & Work)Versions of MethodDescription and generic time‑slices of Work SHALL use PhaseOf (A.15/A.15.1); Work‑specific refinements (episodes/retries/concurrency) are modelled in A.15.1. PhaseOf never applies to U.Role or U.Method.Aligns temporal slicing with DesignRunTag bindings.

Anchoring & validation (normative)

IDRequirementPurpose
CC‑ANCH‑1Every ut:StructPartOf edge MUST carry a tv:groundedBy link to a valid Γ_m constructor trace (Compose‑CAL).Makes A.10 executable; ensures extensional identity.
CC-ANCH-2For epistemic edges (ut:EpiPartOf and its sub-types), tv:groundedBy is OPTIONAL; instead supply ev:evidence and set validationMode ∈ {axiomatic, postulate, inferential}.Harmonises evidence treatment for epistemic edges.
CC‑ANCH‑3The public query Standard remains ?x ut:PartOf+ ?y; internally it is realised via CT2R‑aliases grounded by Γ_m traces.Preserves the “one query” UX while tightening semantics.

Note. Property names and trace semantics are defined in the CT2R‑LOG / Compose‑CAL.

CT2R‑LOG handshake (Working‑Model → Assurance)

IDRequirementPurpose
CC-A14-10For structural edges on the Working-Model surface, authors SHALL set validationMode=axiomatic and attach **`tv:groundedBy → Γ_m.sumset
CC‑A14‑11PhaseOf edges SHALL NOT use Γ_m for grounding. Authors SHALL provide identity criteria and non‑overlap per CC‑PHA‑1..3 and reference Γ_time when ordering matters.Keeps temporal parthood distinct from construction; preserves the plane firewall.

CT2R‑LOG handshake (Working‑Model → Assurance)

IDRequirementPurpose
CC-A14-10For structural edges on the Working-Model surface, authors SHALL set validationMode=axiomatic and attach **`tv:groundedBy → Γ_m.sumset
CC‑A14‑11PhaseOf edges SHALL NOT use Γ_m for grounding. Authors SHALL provide identity criteria and non‑overlap per CC‑PHA‑1..3 and reference Γ_time when ordering matters.Keeps temporal parthood distinct from construction; preserves the plane firewall.

Validation patterns (author’s decision procedure)

Step 0 — Firewall check. If your sentence is about who does what, how it is done (role or method), or what happened when (run or work occurrence), you are not in mereology; go to A.15 (Role–Method–Work). If it is about the carrier episteme (pages/sections/versions of an SOP/algorithm/spec), you may still be in A.14.

Step 1 — Is it measured stuff? If yes, pick PortionOf. Confirm μ is declared (CC‑POR‑1/2). Test additivity on a toy split (CC‑POR‑3). If flows cross a boundary, remodel as interactions, not portions (CC‑POR‑4).

Step 2 — Is it a discrete inside part? If yes, pick ComponentOf (physical) or ConstituentOf (conceptual). Do not use PortionOf here.

Step 3 — Is it the same carrier at a time slice? If yes, pick PhaseOf. Verify identity criteria and non‑overlap (CC‑PHA‑1/2/3). If criteria break, escalate to B.2 (CC‑PHA‑4).

Step 4 — Is it a membership statement? Use MemberOf only; avoid any part‑inferences (CC‑MEM‑2). If you need a collection as a whole, use C.13 (Γ_m.set) for constructive grounding. If you need collective action, apply A.15.

Quick spot‑tests (repair kit).

SmellLikely errorFix
“20% of the chassis”Treating structure as stuffUse ComponentOf; if truly laminar material, PortionOf applies to material stock, not the assembled chassis.
“Chapter 2 is 15% of the book”Mixing measures and constituentsUse ConstituentOf; the 15% is length‑of‑text as a separate statement.
“Spec v2 overlaps v1”Overlapping phases on same aspectUse PhaseOf(Spec_v2, Spec) with non‑overlap; represent drafting as Work episodes (A.15) rather than overlapping specs.
“Team is part of the project”Member vs part confusionUse MemberOf(Team, ProjectCollective), not partOf.

Interplay with Γ‑flavours (how these relations behave under aggregation)

Γ‑flavourMereological hooks (what A.14 supplies)Key effect
Γ_sys (B.1.2)Treat PortionOf as Σ‑additive stocks; ComponentOf must respect boundary integration; PhaseOf is not aggregated here.Conserves extensive measures and keeps structural WLNK (weakest‑link) on components.
Γ_epist (B.1.3)PortionOf of texts/data uses μ = token/byte count; ConstituentOf composes arguments/sections; PhaseOf versions MethodDescriptions/documents.Preserves provenance and avoids trust inflation by keeping constituents vs portions distinct.
Γ_ctx / Γ_time (B.1.4)PhaseOf provides the legal slicing for time; order/dependencies live in Γ_ctx and method graphs (A.15/B.1.5). PortionOf is orthogonal (quantities inside steps/runs).Ensures chronological consistency and monotone coverage.
Γ_method (B.1.5)Recipes are MethodDescription graphs (not parthood). When a recipe refers to stuff‑like inputs, those are PortionOf statements on resources.Separates recipe composition from structure.
Γ_work (B.1.6)Only Work carries resource deltas; when logging “consumed 5 kg from Tank A”, model it as PortionOf relation to the stock prior to consumption.Makes Σ‑balance explicit; aligns with CC‑POR‑3/4.

Consequences

Benefits

  • Predictable composition. Σ‑additivity for portions and identity‑through‑time for phases make Γ‑proofs straightforward.
  • History without confusion. Temporal slicing is explicit and audit‑ready; no paradoxical overlaps.
  • Cleaner integration with roles and recipes. The firewall prevents “functional object” creep into structure.
  • Compatibility with engineering practice. Mirrors product breakdown (components) vs functional breakdown (roles) vs material stocks (portions) vs versioning (phases).

Trade‑offs / mitigations

  • Modelling energy. Authors must pick μ and declare units; provide a short μ‑catalog per project.
  • More relation names. Two extra sub‑relations increase vocabulary; mitigated by the decision table (§ 6) and spot‑tests (§ 9).
  • Escalation discipline. Deciding PhaseOf vs MHT requires judgement; A.14 provides criteria, and B.2 captures true re‑identification.

Pedagogy aids (non‑normative)

Two‑minute checklist for reviewers

  1. Do I see “process/workflow/policy/script” used to mean enactment? — then A.15. If it names a carrier episteme whose structure/version is being discussed, A.14 may apply.
  2. Does every PortionOf have a declared μ and unit?
  3. Do phases cover a lifetime without overlap for the same aspect?
  4. Are any roles/recipes appearing as parts? If yes, stop and refactor.

Patch map (where to touch in the working file)

  1. Kernel - Holonic Mereology (§ A.1A.14) Add sub‑sections “PortionOf” and “PhaseOf” with axioms (POR‑1..5, PHA‑1..5). Move MemberOf note to a minimal semantics paragraph (no composition here).

  2. A.15 (Role–Method–Work) Cross‑link firewall (CC‑A14‑0/0b) and reinforce that versioning uses PhaseOf only on MethodDescription/Work.

  3. B.1.2 Γ_sys, B.1.3 Γ_epist, B.1.4 Γ_ctx and Γ_time, B.1.5 Γ_method, and B.1.6 Γ_work Insert a one‑line “A.14 compliance” note: which A.14 sub‑relations each flavour relies on, as in § 10.

  4. Examples & Annexes Refactor any “percentage as part” examples into PortionOf with declared μ; Split any overlapping histories into PhaseOf sequences.

Each edited heading should carry the badge “► decided‑by: A.14 Advanced Mereology”.

Rationale (state‑of‑the‑art alignment, post‑2015)

  • Metrical mereology advances (e.g., recent work on quantity‑based parthood and additivity) motivate PortionOf with explicit μ and Σ‑laws, preventing the classic “stuff as components” fallacy.
  • Temporal parts & identity through change (renewed treatments in analytic metaphysics and formal ontology) motivate PhaseOf with coverage/non‑overlap and escalation when identity criteria fail.
  • Engineering ontologies (BORO lineage, Core Constructional practice, ISO 15926 family) keep a strict separation between functional breakdowns (our Roles) and product breakdowns (our Components), with stock/consumable modelling (our Portions) handled by quantities, not by component trees.
  • Knowledge-episteme edition histories in contemporary MBSE and open-science workflows use explicit versioning (our PhaseOf) and provenance-preserving composition (our ConstituentOf).
  • The net effect is a minimal‑sufficient catalogue: two added sub‑relations close real modelling gaps while preserving parsimony, didactic clarity, and Γ‑compatibility across domains.

A.14:End

Role–Method–Work Alignment (Contextual Enactment)

Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative

At a glance. This pattern is the action-guiding alignment pattern for engineer-managers when the real confusion is not "what component is this" but who is responsible, how the work is supposed to happen, when the plan lives, and what actually happened.

Use this when. Use this pattern when the real job is to separate role, method, plan, capability, and actual work before a team treats one cue, one schedule, one display, one copied or generated statement, or one document as if it already counted as the role assignment, the method, the work plan, execution evidence, or the work itself.

Start here when. The dominant ambiguity is role vs method vs schedule vs actual run, and the team keeps arguing over a source-side "process" cue without separating recipe, plan, capability, and executed work.

First output. One explicit separation of U.Role, U.Method, U.MethodDescription, U.WorkPlan, and U.Work, plus the shortest traceable chain that already exists from U.RoleAssignment through the governing U.Method and its method-description source to the intended U.WorkPlan or actual U.Work occurrence, or an explicit source gap that blocks the unsupported claim.

Working action spine. Role, method, plan, and work confusion -> separate role, holder, context, method description, intended U.WorkPlan, and actual U.Work -> choose proceed, plan, bounded probe, narrow, hand off, or stop -> output the smallest alignment frame needed for the next project move -> use A.15.4 only when an encountered episteme publication, display, credential view, explanation, copied statement, provenance mark, dashboard tile, schema wording, API wording, or composed source chain begins to carry or justify a work claim or reliance claim.

Working action path.

  1. Name the role, holder, and context distinction that is live.
  2. Name the method or method description that is meant to govern the work.
  3. Name the intended U.WorkPlan or actual U.Work occurrence being claimed.
  4. Choose the next move: proceed inside the recovered relation, plan, run a bounded reversible probe, narrow scope, apply the governing FPF pattern and project-side FPF kind and reference named by value for the claim being made or effect, or stop.
  5. If a visible item is being used by appearance for a work claim, reliance claim, or source-restoration claim, move to A.15.4 Work-Relevant Source Restoration and return here only for the U.Role, U.Method, U.MethodDescription, U.WorkPlan, and U.Work separation.

Action-pattern protection. This pattern is not about classifying encountered publications, displays, or cues. It keeps role, method, plan, capability, and actual work distinct so the acting engineer-manager can choose the next admissible project move. Work-relevant source restoration is handled by the related A.15.4 cluster member.

Minimum sufficient next move. Choose the minimum sufficient next move, recover only the project-side FPF kind and reference named by value needed for that move, and do not raise the claim beyond that recovered relation, source, or admissible-use boundary.

Recovered-source green path. If the required project-side FPF kind and reference named by value is present and its scope and window match the live role, method, plan, or work move, proceed inside that recovered scope and window. If not, narrow scope, run a bounded reversible probe, source-find, or create only the smallest source-restoration request, decision-request record, prospective work-plan entry, source-gap note, or unsupported-claim block needed for the next move.

Ordinary use. If the team only needs to separate role, method, plan, capability, and actual work for orientation or planning, one separation sentence or small working card is enough.

Reliance-bearing use. Open the fuller alignment frame when the item is about to guide planned work, actual work, role attribution, status attribution, release reliance, disputed responsibility, or cross-context use. Use A.15.4 when the issue under repair is whether a visible item has the project-side FPF kind and reference named by value needed for that work claim or reliance claim.

Stop condition. Stop once the separation changes no next admissible work move or reliance move and blocks no concrete overclaim about role, method, plan, work, status, approval, evidence, or release.

Admissible-use examples.

Admissible project useSource-finding or reversible probeNon-admissible use
A maintenance team names PumpInspectorRole, the inspection method description, the current U.WorkPlan, and the dated U.Work record that will be created after the inspection. The team may plan and perform the inspection under those distinct records.A short briefing says the inspection is ready, but the method description or work plan is missing; use the briefing only to find or repair the missing source before planned work proceeds.A dashboard tile, copied approval, generated explanation, or briefing is used as the source for a work or reliance claim by appearance. Use A.15.4 for that source-restoration question.

Alignment frame in plain terms. One alignment frame linking U.Role, U.Method, U.MethodDescription, U.WorkPlan, and U.Work through U.RoleAssignment; not a single work occurrence, not a checklist, not a language-style repair pattern, and not a mere cue note.

First admissible project move in plain terms. Keep design-time role, method, and work plan distinct from run-time work while making the chain between them inspectable enough for enactment, audit, and source restoration.

What goes wrong if missed. Teams collapse role, recipe, plan, capability, and actual run into one fuzzy source-side "process" label, then mistake documentation for execution, capability for evidence, schedule for occurrence, or a narrower briefing for the source that makes work admissible.

What this buys. One inspectable enactment frame that lets a team ask who held what role, which method governed, what plan existed, and what work actually occurred before treating follow-on work, blame, or approval as if those distinctions were the same.

Not this pattern when. Not this pattern when the honest need is only one dated work occurrence (A.15.1), only planning or schedule baseline (A.15.2), only a cue note that has not yet become an enactment-alignment question (A.16 or A.16.1), only boundary wording or policy wording without a live role-method-work question (A.6 or A.6.B), or work-relevant source restoration for a visible item (A.15.4).

Related project records and governing patterns. A.15.1 governs dated execution records, A.15.2 schedule or baseline planning records, A.15.3 slot-filling plan items, A.15.4 work-relevant source restoration, B.5.1 Explore -> Shape -> Evidence -> Operate for project progression, F.11 method and work vocabulary alignment across contexts, and F.17 the human-facing work sheet.

Causal-use work boundary. Realized counterfactual-sampling work, counterfactual randomization, intervention assignment, target-trial emulation work, and causal evidence collection remain U.MethodDescription, U.WorkPlan, and U.Work structures here. A.15 can say who performs which sampling or intervention work under which method and role; it does not make the resulting causal use admissible. C.28 governs the causal-use question, CausalityLadderRung, causal estimand, CausalEvidenceSupportBasis, counterfactual sampling realizability, and supported use and unsupported use.

Related-record mistakes. If the first honest encountered item is still only a cue, keep it under A.16 or A.16.1; if the question under repair is boundary wording, promise, agreement-like service, or policy wording, recover the corresponding A.6 boundary-claim record; if you only need one executed occurrence rather than the alignment frame, recover the A.15.1 dated work-occurrence record; if a visible item is being used for a work relation or reliance relation, use A.15.4.

Boundary to coarsened renderings. A lighter briefing, summary, redacted note, or coarsened rendering may orient work or cue attention. It becomes sufficient for work execution, plan use, approval, gate decision, or execution evidence only when the required method, plan, approval, gate, or evidence source remains explicit and reopenable. Treat the coarsened-rendering relation through A.6.3.CSC Controlled Semantic Coarsening when the rendering itself changes what can be relied on.

Recognition block vs assurance block. Read At a glance, Use this when, Start here when, First output, Working action path, Admissible-use examples, Alignment frame, First admissible project move, What goes wrong if missed, What this buys, and Not this pattern when as the primary recognition block. Read the entity distinctions, canonical relations, checklist, and relations below as assurance blocks that tighten the same alignment-frame claim; they do not widen the pattern into one single work occurrence, one cue note, one wording pattern, one source-restoration pattern, or one source-side "process" label treated as an FPF object.

Problem frame

In any complex system, from a software project to a biological cell, there is a fundamental distinction between what something is (its structure), what it is supposed to do (its role and specified capability), and what it actually does (its work). Confusing these distinctions is a primary source of design flaws, budget overruns, and failed projects. Teams argue over a source-side "process" cue without clarifying whether the live FPF object is a U.Method, a U.MethodDescription, a U.Capability, a U.WorkPlan, or a specific U.Work occurrence that happened last Tuesday.

This pattern provides the canonical alignment for modeling contextual enactment in FPF, serving as the ultimate implementation of the Strict Distinction Principle (A.7). It weaves together several foundational concepts into a single, coherent model of how intended work becomes planned and actual U.Work:

  • A.2 (Contextual Role Assignment): Provides the Holder#Role:Context structure for assigning roles.
  • A.4 (Temporal Duality): Provides the strict separation between design-time and run-time.
  • A.12 (External Transformer): Ensures that performed U.Work is attributed to a transformer-bearing system acting under a U.RoleAssignment.

The intent of this pattern is to establish a normative, unambiguous vocabulary and set of relations for describing the passage from role and method capability to planned and actual, resource-consuming U.Work.

To keep plan-run separation explicit, this pattern references A.15.2 U.WorkPlan for schedules and calendars and A.15.1 U.Work for dated execution. Ambiguous source terms like "process", "workflow", and "schedule" are constrained by L-PROC, L-FUNC, and L-SCHED (E-cluster): a workflow cue normally resolves to U.MethodDescription unless the abstract way-of-doing itself is live as U.Method; a schedule cue resolves to U.WorkPlan; what happened resolves to U.Work.

Terminology note (L-ACT). The words action and activity are not normative in the kernel. When a generic "doing" is needed, we use the didactic term enactment (not a type). Normative references must be to U.Method, U.MethodDescription, U.Work, or U.WorkPlan. See lexical rules L-PROC, L-FUNC, L-SCHED, and L-ACT.

Problem

Without this formal framework, models suffer from a cascade of category errors:

  1. Role-as-Part: A Role (e.g., AuditorRole) is incorrectly placed inside a structural parts list (ComponentOf), making the system's architecture brittle and nonsensical.
  2. Specification-as-Execution: A MethodDescription (the "recipe") is treated as evidence that the work was done. This leads to "paper compliance," where a system is considered complete simply because its documentation exists.
  3. Capability-as-Work: A team's ability to perform a task (Capability) is conflated with the actual performance of that task (Work). This obscures the reality of resource consumption and actual outcomes.
  4. Work-without-Context: An instance of work is logged without a clear link back to the role, capability, and specification that governed it, making the work unauditable and its results impossible to reproduce.
  5. Ambiguous source-side "process" or "activity" cue: The overloaded term "process" is used indiscriminately to refer to all of the above, creating a fog of miscommunication that paralyzes decision-making. Generic doing or activity terms must be resolved via L-ACT to U.Method, U.MethodDescription (recipe), U.WorkPlan (schedule), or U.Work (run).

Forces

ForceTension
Structure vs. FunctionThe need to model the stable, physical structure of a system (mereology) vs. the need to model its dynamic, functional behavior (roles, methods, plans, and work occurrences).
Design vs. RunThe need for a timeless, reusable description of a capability (design-time) vs. the need for a specific, dated record of its execution (run-time).
Clarity vs. JargonThe need for a precise, formal vocabulary to prevent ambiguity vs. the reality that teams use informal, domain-specific source cues like "process" or "workflow."
Accountability vs. ComplexityThe need for a complete, end-to-end audit trail for every decision-relevant work occurrence vs. the desire to keep models simple and avoid excessive documentation.

Solution

The solution is a stratified alignment that cleanly separates the design-time and run-time for contextual enactment. The bridge between these worlds is the U.RoleAssignment.

The Core Entities: A Strict Distinction

FPF mandates the use of the following distinct, non-overlapping entities to model method, plan, and work enactment. Using them interchangeably is a conformance violation.

A) Design-Time Entities (The World of Potential):

  • U.Role: A contextual "mask" or "job title" (e.g., TesterRole). It specifies a function but is not the function itself.
  • U.Method: The abstract way-of-doing inside a context (paradigm-agnostic; may be imperative, functional, logical, or hybrid).
  • U.MethodDescription: A U.Episteme describing a U.Method; it may be expressed in an SOP, algorithm, proof, recipe, or other method-description publication.
  • U.Capability: An attribute of a U.System that represents its ability to enact the declared U.Method under stated conditions. A MethodDescription may describe that method; the capability is not the description and not the work occurrence.
  • U.WorkPlan: An U.Episteme declaring intended U.Work occurrences (windows, dependencies, intended performers as role kinds, budgets) - see A.15.2.

B) The Bridge Entity:

  • U.RoleAssignment: The formal assertion Holder#Role:Context that links a specific U.Holon to a U.Role within a U.BoundedContext. This holder-to-role assignment link is what "activates" the requirements associated with a role.

C) Run-Time Entity (The World of Actuality):

  • U.Work: An occurrence or event. It is the concrete, dated, resource-consuming enactment or execution of a U.Method by a Holder acting under a U.RoleAssignment; capability checks are evaluated at run time against the holder, and methodDescriptionRef names the source episteme used to identify or constrain the method when that source is live. This is the only entity that has a start and end time and consumes resources.

Kinds of Work and the primary target

Well-formedness constraint A15-WF-1 (work target and kind). A U.Work occurrence has primaryTarget: U.Holon with cardinality 1..1 (total) and kind with cardinality 1..1 (total).

Local kind values used here:

  • Operational - transforms a U.System or its environment.
  • Communicative (SpeechAct) - transforms a deontic or organizational frame (e.g., commitments, authority effects, approvals).
  • Epistemic - transforms a U.Episteme (e.g., curating a dataset). The primaryTarget disambiguates enactment: what is being acted upon. Example: an approval is kind=Communicative, primaryTarget = Commitment(change=4711). A deployment is kind=Operational, primaryTarget = ServiceInstance(prod-us-eu-1).

Didactic Note for Managers: The "Chef" Analogy

This model can be easily understood using the analogy of a chef in a restaurant.

  • ChefRole is the Role. It's a job title with certain expectations.
  • A Cookbook (U.MethodDescription) contains the recipe for a Souffle. It's a piece of knowledge.
  • The chef's skill in making souffles is their U.Capability. They have this skill even when they are not cooking.
  • The restaurant's rulebook (U.BoundedContext) states that anyone in the ChefRole must have the Capability to follow the recipes in the cookbook.
  • The actual act of making a souffle on Tuesday evening - using eggs and butter, taking 25 minutes, and consuming gas - is the U.Work.

Confusing these is like mistaking the cookbook for the souffle. FPF's framework simply makes these common-sense distinctions formal and mandatory.

The Canonical Relations: Connecting the Layers

The entities are connected by a set of precise, normative relations that form an unbreakable causal chain. The following diagram illustrates this flow from the abstract context down to the concrete execution.

graph TD
    subgraph Design-Time Scope (Tᴰ)
        A[U.BoundedContext] -- defines --> B(U.Role)
        M[U.Method] -- isDescribedBy --> D[U.MethodDescription]
        Cap[U.Capability] -- is capability for --> M
        H(U.System as Holder) --> RB(U.RoleAssignment)
        B -- is the role in --> RB
        A -- is the context for --> RB
        A -- bindsCapability(Role,Capability) --> Cap
    end

    subgraph Run-Time Scope (Tᴿ)
        W[U.Work]
    end

    RB -- performedBy --> W
    W  -- enactsMethod --> M

    style A fill:#e6f3ff,stroke:#36c,stroke-width:2px
    style B fill:#fff2cc,stroke:#d6b656,stroke-width:2px
    style Cap fill:#d5e8d4,stroke:#82b366,stroke-width:2px
    style M fill:#d5e8d4,stroke:#82b366,stroke-width:2px
    style D fill:#f8cecc,stroke:#b85450,stroke-width:2px
    style H fill:#e1d5e7,stroke:#9673a6,stroke-width:2px
    style RB fill:#dae8fc,stroke:#6c8ebf,stroke-width:3px,stroke-dasharray: 5 5
    style W fill:#ffe6cc,stroke:#d79b00,stroke-width:2px,font-weight:bold
  • bindsCapability(Role, Capability): A U.BoundedContext asserts that a given Role requires a specific Capability. This is a design-time rule.
  • isDescribedBy(Method, MethodDescription): A U.Method is formally described by one or more MethodDescriptions. This links the abstract way-of-doing to the method-description episteme and to the publication used when the source is live.
  • enactsMethod(Work, Method): A specific U.Work is a run-time enactment of a U.Method under a U.RoleAssignment. Capability checks are evaluated against the holder at run time; the MethodDescription remains the source episteme or method-description reference used to identify, constrain, or justify the method when live.
  • performedBy(Work, RoleAssignment): A U.Work is performed by the holder named through a specific U.RoleAssignment. This links the work occurrence to the holder-in-role-in-context.

At run time, capability thresholds declared by the context or specification are checked against the holder; U.Work outcomes provide evidence for capability conformance.

This chain provides complete traceability: a specific instance of U.Work can be traced back to the U.Method it enacts, the MethodDescription or source publication used to identify or constrain that method, and the U.RoleAssignment (Holder + Role + Context) under which the holder was authorized and responsible for its execution.

Bounded specialization scouting and CheckpointReturn

When one human-plus-AI pair faces a new task family or candidate solution corridor, the governed work system may temporarily compose four distinct local roles inside the same dyad: a human-held OutcomeCriterionHolderRole, an AIScoutRole, an AISpecialistProbeRole, and a human-held CommitAuthorityRole. The payoff of the dyad is faster admissible specialization of the next move, not disappearance of the human decision step.

For this bounded dyadic work question, the pair should declare one outcome criterion first, enumerate heterogeneous candidate approaches that may satisfy that target, spend a bounded scouting budget or probing budget before any committed approach is chosen, and return one CheckpointReturn that compares the tested approaches rather than silently treating one successful probe as a committed rollout. A.15 governs this dyadic move and local role split only; it does not restate the checkpoint-record semantics of C.24 or the budget and guard enforcement of E.16.

Every CheckpointReturn should carry:

  • the declared outcome criterion and current TaskFamily
  • the candidate approaches actually tested
  • the evidence observed on each tested approach, including progress toward the named work-measure threshold and important failure signals
  • the budget already burned and the residual budget still available
  • the recommended next work move or reliance move: continue probing, commit to planned work, narrow the method or claim, hand off, or stop
  • the commit trigger named by value that would justify leaving the bounded probe

The return is candidate-approach evidence, burned and residual budget amounts, observed result, and commit-trigger condition. It is not the selected method, U.WorkPlan, performed U.Work, execution-evidence path, or rollout decision. Those claims need the project-side FPF kind and reference named by value before committed rollout.

Low-human-overlap approaches remain admissible here only while they stay tied to the declared outcome criterion, budget guard rails, and evidence path by value.

Boundary to A.15.4 Work-Relevant Source Restoration

Use A.15.4 when an encountered episteme, episteme publication, display, credential view, generated explanation, copied statement, provenance mark, dashboard tile, schema wording, API wording, or composed source chain is being used by appearance for a work claim, reliance claim, role/status currentness claim, approval, permission, gate passage, evidence, engineering justification, release reliance, or performed U.Work.

A.15 itself keeps the kernel separation: U.Role, holder, context, U.Method, U.MethodDescription, U.WorkPlan, actual U.Work, and the U.RoleAssignment chain between them. The source-restoration question asks which project-side FPF kind and reference named by value must be recovered before the encountered item can carry the live work claim, reliance claim, or effect; that question belongs to A.15.4 or to the source-restoration pattern governing that reliance named there.

A principle scheme, functional diagram, scenario, screen, or explanation that makes a P2W chain recoverable may help the team plan work or find the needed source. It does not replace the selected method, U.WorkPlan, performed U.Work, evidence path, gate or decision record, engineering-justification record, or release-reliance source.

Archetypal Grounding

The role-method-work alignment applies whenever the question under repair is holder-in-role, method description, intended plan, or performed work. Physical engineering, knowledge work, and socio-technical cases can all use the same distinction without turning A.15 into a universal process ontology.

ArchetypeU.System Archetype (Manufacturing)U.Episteme Archetype (Scientific Peer Review)
BoundedContextFactoryFloor:ProductionLine_BJournal:PhysicsLetters_A
RoleWeldingRobotRoleReviewerRole
HolderABB_Robot_Model_IRB_6700 (U.System)Dr_Alice_Smith (modeled as a U.System)
U.RoleAssignmentABB_Robot#WeldingRobotRole:Line_BDr_Smith#ReviewerRole:PhysicsLetters_A
MethodDescription (U.Episteme)Welding_Procedure_WP-28A.pdf (SOP)Peer_Review_Guidelines_v3.docx
Capability (Attribute of Holder)executeWeldingSeam(Type: 3F)evaluateManuscript(Field: QuantumOptics)
Work (Occurrence)Manufacturing Work: Weld_Job_#78345 (15:32-15:34 UTC, consumed 1.2 kWh, 5g Argon) - enactsMethod WeldingMethod, with methodDescriptionRef = Welding_Procedure_WP-28A.pdfPeer-review Work: Review_of_Manuscript_#PL-2025-018 (Completed 2025-08-15, took 4 hours) - enactsMethod PeerReviewMethod, with methodDescriptionRef = Peer_Review_Guidelines_v3.docx

Key takeaway from grounding: This side-by-side comparison reveals the power of the framework. A seemingly different activity like welding a car chassis and reviewing a scientific paper are shown to have the same underlying enactment structure. Both involve a Holder (a system) acting in a Role within a Context, using a Capability to enact a U.Method, citing a MethodDescription when a recipe or source is live, and producing a specific, auditable instance of Work. This universality is what allows FPF to compare and align disparate domains without collapsing their local structure.

Briefing guides orientation, not execution

Source set. A release team has one deployment method description, one current work plan, one approval or decision record when required, and the evidence records and evidence paths used to decide whether the rollout may proceed. A short rollout briefing is prepared for the daily stand-up.

Briefing slice. Status briefing only: rollback path appears verified in the current source bundle. Execution remains tied to the deployment method, work plan, required approval or decision record, and evidence path.

This briefing may orient the team and cue attention. If the team wants to execute from the briefing alone, use A.15.4 or the evidence, gate, decision, or assurance pattern governing the claim to recover the missing project-side kind and reference. Inside A.15, keep only the role, method, plan, and work-occurrence separation.

P2W principle-scheme publication guides planning, not occurrence

Source set. A team has a principle scheme that shows the P2W principles-to-work transduction chain for a fabrication task: signature or principle episteme, method-family selection, selected method, U.WorkPlan, performed U.Work, work-result record, and result measurement.

Published slice. For this batch family, method M-2 is selected from the declared method family; prepare work plan WP-17 before any run is recorded.

This publication may guide method inspection and work-planning preparation under A.15. A conforming use keeps selected method, U.WorkPlan, actual U.Work, work-result record, and result measurement distinct. If the publication is used for evidence, provenance, engineering justification, gate or constraint decision, material carrier, screen, export, OCR behavior, or publication-use, apply the governing pattern for that claim being made. If no project-side kind and reference named by value exists, create only a source-restoration request, decision-request record for the next decision, prospective work-plan entry, or explicit source-gap note.

Scenario guides method selection, not performed work

Source set. A method-selection scenario says that material X is below threshold T, resource window W is available, and the fabrication cell is under setup condition S. The scenario is the source episteme or source publication for choosing between method families.

Published slice. Under scenario S, method family MF-2 is admissible for planning; choose the selected method and prepare the work plan before execution.

The scenario can guide method-family selection and work-planning preparation. Once the team selects a method or prepares a plan, record that project choice or plan as the selected A.15 selected-method, work-plan, or work-occurrence record named by value. If the scenario is used for evidence, gate, or engineering-justification reliance, first recover the project evidence path, gate or constraint decision, or engineering-justification record named by value under A.10, A.20, A.21, or B.3; otherwise record only a source-restoration request, decision-request record, prospective work-plan entry, or source-gap note.

Bias-Annotation

Lenses tested: Gov, Arch, Onto and Epist, Prag, Did. Scope: Universal for contextual enactment across engineering, operational, and knowledge-work settings.

Bias risks and mitigations:

  • Governance bias (Gov): teams may over-treat role labels or approval displays as enough evidence that work happened. Mitigation: keep U.RoleAssignment, U.MethodDescription, U.WorkPlan, and U.Work distinct, and let only U.Work carry actuals and resource use.
  • Architectural bias (Arch): modelers may pull roles or capabilities into structural part hierarchies because those diagrams are already present. Mitigation: preserve role and capability as contextual-functional entities, not parts.
  • Epistemic bias (Onto and Epist): a documented recipe or schedule can be mistaken for proof of execution. Mitigation: require the traceability chain from U.RoleAssignment and U.MethodDescription to dated U.Work.
  • Pragmatic bias (Prag): teams may keep using one overloaded source-side "process" word because it feels faster. Mitigation: resolve "workflow", "schedule", and "what happened" source cues through U.Method, U.MethodDescription, U.WorkPlan, and U.Work.
  • Didactic bias (Did): the chef analogy can make the pattern seem intuitive while hiding the need for explicit model links. Mitigation: pair the analogy with the canonical relations and checklist.

Conformance Checklist

To preserve role-method-work modeling, a conforming model or use SHALL satisfy the following checks.

IDRequirement (Normative Predicate)Purpose and Rationale
CC-A15-1 (Entity Distinction)A conforming model SHALL keep U.Role, U.Method, U.MethodDescription, U.Capability, U.WorkPlan, and U.Work as distinct, non-overlapping types.This is the core enforcement of Strict Distinction (A.7). It prevents the category errors outlined in the "Problem" section.
CC-A15-1a (Work target and kind predicate)A conforming U.Work record SHALL satisfy A15-WF-1; validators SHOULD report missing primaryTarget or missing kind as an invalid work record.Keeps target and work kind enforceable as work-record validity without stating modeled-world admissibility through a free RFC sentence.
CC-A15-2 (Temporal Scope)U.Method, U.MethodDescription, and U.WorkPlan exist in design-time; U.Work exists in run-time. Design-time method descriptions and work plans are not mutated by operational events.Enforces Temporal Duality (A.4). Blueprints cannot be mutated by operational events.
CC-A15-3 (RoleAssignment Mandate)A conforming U.Work record SHALL link via performedBy to a valid U.RoleAssignment.Guarantees that every work occurrence has a clearly identified, context-bound actor, ensuring accountability.
CC-A15-4 (Traceability Chain)A conforming model SHALL provide an unbroken chain for every U.Work: Work -performedBy-> RoleAssignment, Work -enactsMethod-> Method, and, when a description or source is live, Method -isDescribedBy-> MethodDescription or methodDescriptionRef. Capability checks are evaluated against the holder at run time.Ensures end-to-end auditability from a specific work occurrence back to the enacted method and the recipe or source used to identify or constrain it.
CC-A15-5 (No Roles in Mereology)A conforming model SHALL NOT place U.Role or U.Capability in a mereological (partOf) hierarchy.The "Role-as-Part" anti-pattern is a violation. Roles and capabilities are functional, not structural. Enforces A.14.
CC-A15-6 (Resource Honesty)A conforming model SHALL associate resource consumption (U.Resource) only with U.Work, never with U.MethodDescription or U.Capability.Enforces that costs are tied to actual events, not to plans or potential. Aligns with Resrc-CAL (C.5).
CC-A15-7 (Plan and Run Split)A conforming model SHALL represent schedules and calendars as U.WorkPlan (A.15.2). A U.WorkPlan SHALL NOT be used as evidence of execution; only U.Work carries actuals.Preserves plan and run separation and prevents schedule-as-actual drift.
CC-A15-8 (Lexical Sanity)A conforming use SHALL interpret unqualified "process", "workflow", or "schedule" source cues per L-PROC, L-FUNC, and L-SCHED: workflow -> U.MethodDescription unless the abstract way-of-doing is live as U.Method; schedule -> U.WorkPlan; what happened -> U.Work.Keeps source vocabulary auditable and reduces lexical ambiguity without creating a new process object.
CC-A15-9 (Enactment)A valid U.Work enacts a U.Method under a U.RoleAssignment; a MethodDescription is the source episteme or method-description reference when the method must be identified, constrained, or justified. Spontaneous physical evolution without a role-method-work alignment is modeled as U.Dynamics, not as U.Work.Prevents background dynamics and recipe documents from being miscast as governed work.
CC-A15-10 (GateSplit)A conforming model SHALL represent a SpeechAct that institutes a role, authorization, or gate-relevant effect (e.g., "Approve", "Authorize") as a distinct U.Work step (kind=Communicative). It may open the Green-Gate for a subsequent operational step, but it SHALL NOT be conflated with that step.Preserves communicative effects as distinct acts.
CC-A15-11 (KindFit)A conforming performedBy assignment SHALL use a U.Role appropriate for the U.Work kind (e.g., ApproverRole for communicative approvals; DeployerRole for operational deployments).Prevents kind-mismatched role attribution.
CC-A15-12 (Causal-use Work Boundary)A conforming causal-use model MAY represent intervention assignment, counterfactual randomization, target-trial emulation, causal evidence collection, and realized counterfactual-sampling work here only as U.Method, U.MethodDescription, U.WorkPlan, U.Work, and role-assigned execution structure. Any claim that the resulting causal use is admissible SHALL cite C.28 for causal-use question, CausalityLadderRung, causal estimand, CausalEvidenceSupportBasis, CausalUseSupportVerdict, and supported use and unsupported use.Prevents method, work-plan, or work-occurrence structure from being mistaken for causal-use support.
CC-A15-13 (A.15.4 Boundary)If a visible item is being used for a work relation or reliance relation by appearance, a conforming A.15 use SHALL use A.15.4 for the source-restoration question and keep only the U.Role, U.Method, U.MethodDescription, U.WorkPlan, and U.Work separation here.Prevents the A.15 kernel from absorbing source-restoration claims.
CC-A15-14 (P2W Publication Boundary)A conforming use SHALL NOT treat a principle scheme, functional diagram, scenario, screen, or explanation that makes a P2W chain recoverable as the selected method, U.WorkPlan, performed U.Work, work-result record, result measurement, or non-A.15 claim by publication alone.The project use names the selected A.15 object named by value; any non-A.15 claim uses its governing pattern or A.15.4 source restoration.

Common Anti-Patterns and How to Avoid Them

  • Role-as-part. Do not place U.Role or U.Capability inside structural partOf decomposition; keep them contextual and functional.
  • Recipe-as-evidence. A U.MethodDescription or SOP may identify or constrain a method; dated U.Work records carry the occurrence claim.
  • Plan-as-actual. Do not let schedules, calendars, or intended assignments stand in for actual execution; use U.WorkPlan for intent and U.Work for actuals.
  • Capability-as-work. Do not treat possession of a capability as if the task has already been performed; capability enables execution under conditions but is not execution.
  • Approval collapse. Keep approval or authorization speech acts distinct from the operational step they open; model them as communicative U.Work when they institute a role, gate, or commitment effect.
  • Process soup. Do not leave "process", "workflow", or "activity" uninterpreted in FPF-governed passages; resolve the source cue to U.Method, U.MethodDescription, U.WorkPlan, or U.Work.
  • Briefing-as-execution-cue. A lighter review note, rollout summary, or redacted operations note may orient work; use A.15.4 or the source-restoration pattern governing that reliance before relying on it for execution, approval, gate, evidence, or plan claims.
  • P2W publication as work occurrence. A principle scheme, functional diagram, scenario, screen, or explanation may guide selected method or work-planning moves named by value; recover the project-side FPF kind and reference named by value for any selected-method, work-plan, work-occurrence, result, evidence, gate, or engineering-justification claim.
  • Visible item as work source. A dashboard tile, credential display, copied approval, generated explanation, provenance label, command-like cue, or composed source chain is only a source candidate until A.15.4 recovers the project-side kind and reference named by value needed for the live work or reliance claim.

Consequences

BenefitsTrade-offs and Mitigations
Unambiguous Communication: Provides a shared, precise vocabulary for teams to discuss roles, methods, work plans, work occurrences, and results, eliminating the ambiguity of source terms like "process."Initial Learning Curve: Requires teams to learn and internalize the distinctions between the core entities. Mitigation: The "Chef" analogy and clear archetypes serve as powerful didactic tools. FPF tooling should guide users with templates.
End-to-End Auditability: The framework creates a "digital thread" that links every operational event (Work) back to its authorizing role, context, and specification. This is critical for regulated industries and for root cause analysis.Increased Formality: Requires more explicit modeling than informal approaches. Mitigation: This is a strategic investment. The upfront cost of formal modeling is offset by downstream savings in debugging, re-work, and compliance efforts.
Enables True Modularity: By separating capability from execution, the framework allows for easier substitution. A MethodDescription can be updated without invalidating past Work records. A Holder can be replaced with another, as long as it possesses the same Capability.-
Foundation for role-source accountability: The model makes it possible to state role-bound work rules without making the role or publication act. For example: "Only a holder acting under AuditorRole in a valid U.RoleAssignment can perform the U.Work that instantiates the ApproveRelease capability."-

Rationale

This pattern solves a problem that has plagued systems modeling for decades: the conflation of what a system is with what it does. Its rigor is not arbitrary but is grounded in several key intellectual traditions.

  • Ontology Engineering: The pattern is a direct application of best practices from foundational ontologies (like UFO), which have long insisted on the distinction between endurants (objects like a U.System) and perdurants (events and performed occurrences such as U.Work), and between intrinsic properties and relational roles. FPF makes these powerful distinctions accessible to practicing engineers.
  • Process-theory source tradition: Formalisms like the Pi-calculus or Petri Nets model dynamic interactions under terms often translated as processes. A.15 does not import process as a new FPF object; it maps the useful local use to U.Method, U.MethodDescription, U.WorkPlan, and dated U.Work. The U.Work entity can be seen as an occurrence recognized by such a source tradition, but FPF adds the crucial context of the Role, Capability, enacted U.Method, and MethodDescription source that make the occurrence inspectable.
  • Pragmatism and Practice: The framework is deeply pragmatic. The distinctions it makes (e.g., between a MethodDescription and U.Work) are precisely the ones that matter in the real world of project management, compliance, and debugging. When a failure occurs, a manager needs to know: was the recipe wrong (MethodDescription), did the chef lack the skill (Capability), or did they just make a mistake this one time (U.Work)? This framework provides the vocabulary to ask and answer that question precisely.

By creating this clean, stratified alignment for enactment, FPF provides a stable and scalable foundation for all of its more advanced patterns, from resource management (Resrc-CAL) and decision theory (Decsn-CAL) to ethics (Norm-CAL).

SoTA Alignment: Adopted and Adapted Invariants and Rejected Shortcuts

SoTA alignment rule. Read each row here as source idea -> local FPF invariant -> practical local test -> popular shortcut rejected. A source citation governs nothing by reputation; it counts only when the cited idea is translated into the Solution, conformance checks, boundary rules, worked slices, and Relations of this pattern.

Claim 1. Best-known current workflow, digital-thread, and service-operations source traditions keep recipe, plan, and execution separate.

Practice source, local alignment, and adoption decision. Contemporary process-modeling source traditions, service operations, and auditability practice after 2015 separate procedure, schedule, and executed occurrence because otherwise paper compliance becomes indistinguishable from completed work. In the manufacturing and peer-review slices above, this means a procedure or calendar never counts as the weld or the review itself. This pattern adopts that separation, adapts it through U.Method, U.MethodDescription, U.WorkPlan, and U.Work, and rejects the shortcut where one undifferentiated "process" label carries all three meanings.

Claim 2. Best-known current accountability practice keeps actor-in-context explicit rather than attributing work to a role label or a document.

Practice source, local alignment, and adoption decision. Contemporary service delivery, incident practice, and role-accountability practice distinguish accountable assignee, governing procedure, and actual run record because after-the-fact review depends on knowing who acted, under what role, and under which method. In the slices above, that is why the robot or reviewer acts under U.RoleAssignment rather than the role or guideline acting on its own. This pattern adopts explicit actor-in-context attribution through U.RoleAssignment, adapts it to bounded-context semantics, and rejects anonymous work logs and role-as-part modeling.

Claim 3. Best-known current approval and execution practice treats communicative gate acts and operational acts as distinct kinds of work.

Practice source, local alignment, and adoption decision. Contemporary release, compliance, and safety-critical practice separates approval, authorization, and review acts from the operational steps they permit because authority change and world change are not the same event. In the examples above, that means an approval is not the same work as a deployment or a weld. This pattern adopts that split, adapts it through communicative versus operational U.Work kinds, and rejects the collapse of approval into the thing being approved.

Local claim. The FPF-governed SoTA claim for this pattern is practical and narrow: contextual enactment remains reviewable only when role, method, plan, and work stay distinct enough that audits can tell whether the problem was in the assignment, the recipe, the schedule, the capability, or the run itself.

Claim 4. Best-known current agentic work practice treats fast bounded specialization as a checkpointed scout and probe discipline rather than as a naked winner claim.

Practice source, local alignment, and adoption decision. Contemporary agentic tool-use, adaptive method-selection, and human-in-the-loop work-control practice separates bounded exploration from committed rollout because a successful probe is not yet an admissible committed approach. In the working moment above, that is why the pair returns one CheckpointReturn with candidate approaches, evidence, burned and residual budget, and a commit trigger rather than only a winner label. This pattern adopts checkpointed scout and probe discipline, adapts it through the dyad-local roles and CheckpointReturn, and rejects the shortcut where an early probe silently becomes a committed rollout.

Claim needSource idea and current sourceCurrent source referenceLocal FPF invariant and practical local testAdopted invariant, adapted invariant, and rejected shortcut
Recipe, plan, case, decision, and executed occurrence must stay separable.Case-management, decision-modeling, and service-change practice distinguish discretionary case work, decision logic, planned change source material, and the realized service or product change.OMG CMMN 1.1 (2016); OMG DMN 1.5 (2024); ITIL 4 Practitioner: Change Enablement (2023); source maturity = mature modeling standards plus current practitioner guidance.The manufacturing, peer-review, and rollout slices keep U.MethodDescription, U.WorkPlan, approval work, and U.Work separate so a calendar or procedure never counts as the weld, review, deployment, or actual run.Adopt and adapt. Adopt the separation of case, decision, plan, and occurrence; adapt it to FPF's U.Method, U.MethodDescription, U.WorkPlan, and U.Work; reject an undifferentiated "process" label as an FPF object.
Architecture and digital-thread practice need traceable views without confusing description, authority, and occurrence.Architecture-description and model-based systems practice treat descriptions, viewpoints, requirements, behavior, verification, and traceability as explicit review targets.ISO/IEC/IEEE 42010:2022; OMG SysML v2.0 Language Specification (2025); source maturity = mature standard plus current technical specification.A.15 uses actor-in-context, role assignment, method description, and work occurrence so after-the-fact review can ask whether the problem was assignment, capability, recipe, plan, approval, or run.Adopt and adapt. Adopt explicit trace and viewpoint discipline; adapt it to role, method, work-plan, and work-occurrence alignment; reject attributing work to a role label or document alone.
Approval and execution are distinct practical acts.Change-enablement and decision-modeling practice separates risk assessment, authorization, scheduling, decision logic, and the work that realizes change.ITIL 4 Practitioner: Change Enablement (2023); OMG DMN 1.5 (2024); source maturity = current practitioner guidance plus mature modeling standard.In the release and gate examples, an approval or authorization institutes an authorization or gate-relevant effect; it is not the same work as deployment, welding, or other operational occurrence.Adopt. Adopt the communicative/operational split and reject collapse of approval into the thing approved.
Fast bounded exploration must not become committed rollout by convenience.Contemporary agentic tool-use and adaptive-work practice, including ReAct, Toolformer, and Reflexion-style tool-use and self-correction lines, supports bounded probing while preserving explicit transition from option exploration to committed change.Current agentic tool-use and self-correction practice; ITIL 4 Practitioner: Change Enablement (2023); ISO/IEC/IEEE 42010:2022; OMG SysML v2.0 Language Specification (2025); source maturity = current technical and practitioner guidance plus mature and current modeling standards.The scout and probe moment returns candidate-approach evidence, observed result, burned and residual budget amounts, and a commit trigger rather than a selected method, U.WorkPlan, performed U.Work, or rollout decision.Adapt and reject. Adapt bounded scout and probe discipline to FPF role, method, work-plan, and work-occurrence splits; reject the shortcut where an early probe silently becomes a committed method choice, work plan, or rollout.

For visible credential, provenance, dashboard, explanation, or composed-source cases that need project-side FPF kind and reference named by value before work or reliance, use A.15.4. The A.15 family carries only the returned role, method, plan, and work part of the case.

The nearest recovery loci are the manufacturing, peer-review, rollout briefing, CC-A15-7, CC-A15-10, CC-A15-12, and the boundary to A.15.4. If a SoTA row cannot be recovered through those local checks, do not let the source citation stand in for the local A.15 rule.

Relations

  • Directly Implements: A.7 Strict Distinction.
  • Builds Upon: A.2 (U.Role), A.2.1 (U.RoleAssignment), A.4 (Temporal Duality), A.12 (External Transformer).
  • Is Used By and Provides Foundation For:
    • C.4 Method-CAL: Provides the formal definition of U.MethodDescription and the Gamma_method operator for composing them.
    • C.5 Resrc-CAL: Provides the U.Work entity to which resource consumption is attached.
    • B.1.6 Gamma_work: The aggregation operator for U.Work.
    • B.4 Canonical Evolution Loop: The entire loop is a sequence of U.Work instances that modify MethodDescriptions.
    • A.15.2 U.WorkPlan: plan-run split, baselines and variance against U.Work.
    • C.28 CausalUse-CAL: causal-use admissibility for intervention, counterfactual sampling, target-trial emulation, and causal evidence work; A.15 keeps the role, method, work-plan, and work-occurrence chain.
  • Constrains: Any FPF pattern that models method, plan, work occurrence, or overloaded source language around process terms must use this framework to be conformant. It serves as the canonical alignment for contextual enactment in the FPF ecosystem.
  • Coordinates with: L-PROC, L-FUNC, and L-SCHED (E-cluster) for lexical disambiguation of source cues such as process, workflow, and schedule.
  • Coordinates with: A.15.4 for work-relevant source restoration; A.6, A.6.B, and A.6.C for mixed boundary, policy, API, or schema wording; A.10 for evidence, currentness, and provenance; B.3 for assurance claims; A.21 for OperationalGate(profile), GateDecision, and DecisionLogRef; A.20 for ConstraintValidity status or witness; A.15.1 for release or deployment work occurrence; and E.17.EFP for generated-explanation faithfulness or source-finding.

Coordinated-work evidence and distributed-state relation note

Use A.15 first when the claim is about who acts, by which method, under which role, under which work plan, producing which work result. Coordinated work, routine skill, team alignment, tacit knowledge, and role-method fit are not quantum-like by default.

Action path:

  1. Name the role, method, and work result before naming any distributed state.
  2. State which work traces, records, events, observations, reports, metrics, or role enactments make the coordination visible.
  3. Ask whether role-method-work alignment alone explains the case. If yes, stay in A.15.
  4. If no participant statement, local component report, single evidence record, dashboard, or exported representation carries the inferred state faithfully enough for the intended state use, add a C.26.2 low-recoverability distributed-state reading.
  5. State the weakest evidence-bound state-reading claim, time window, rival explanations, and export loss.
  6. Carry evidence use through A.10 and assurance claims through B.3 when the reading will guide work, reliance, audit, readiness, release, or compliance.

Add a C.26.2 low-recoverability distributed-state reading only when coordinated work is being used as evidence for a state that no participant statement, local component report, single evidence record, dashboard, or exported representation carries faithfully enough for the intended state use. In C.26.2 terms, the reading is a minimal evidence-bound U.Episteme claim under carriers, window, rivals, and export limits; it is not a group mind, not performed work, not evidence sufficiency, and not assurance by itself. That evidence-bound reading states:

FieldRequired content
Evidence sourceWork trace, record, event, observation, report, metric, or role enactment that bears the evidence
Time windowWhen the distributed-state reading holds and when it decays or must be refreshed
Probe or occasionWhat question, task, workshop, incident, handover, dashboard, or coordination situation made the state inferable
Weakest claimThe minimal distributed-state reading carried by the evidence sources
Rival explanationsRoutine compliance, policy, command, coincidence, incentive, documentation record, or local skill that could explain the same work
Export lossWhat is lost when the state is summarized into one report, score, or statement

Useful outputs:

  • an A.15 work-alignment claim when work roles explain the case;
  • a C.26.2 low-recoverability distributed-state reading when coordination evidence survives ordinary rivals;
  • an A.10 evidence path or B.3 assurance claim path when the distributed-state reading will be used as evidence or assurance for a work claim or reliance claim;
  • no distributed-state reading when evidence sources, rivals, or time window cannot be named.

C.29 mathematical-lens use relation

If a mathematical lens helps select a method, compare method families, shape a work plan, or diagnose work, use C.29 only for the fit of that mathematical diagnostic or method-selection reason. The next concrete object remains under the A.15 family: ChoiceResult or local choice record when a choice is made, selected method or method-family selection when method governance is live, U.WorkPlan for a plan, performed U.Work and work-result record for execution, and an A.15.4 source-restoration reference when the issue is work-relevant source restoration. A mathematical lens may explain why a diagnostic distinction is useful; it does not make a plan into performed work or a method explanation into execution evidence.

P2W Work-Family Split

When E.18.1 reaches WorkPlanning, this family carries the split among selected method, U.WorkPlan, SlotFillingsPlanItem, performed U.Work, and result-related records. A P2W principle scheme, functional diagram, or scenario may guide method inspection and work-planning preparation only after the current work-family object is named.

WorkPlanning may place evidence-reference hooks and source-currentness requests for the governing pattern that carries the live relation. If the live relation is evidence, gate passage, launch-value finalization, performed work, result measurement, assurance, or refresh, name that relation before relying on the work-planning record.

P2W Performed-Work Relation

When E.18.1 reaches performed work, this family keeps the current kind as U.Work. WorkEnactment wording is explanatory only: it points to dated performed work, not to a second work kind.

A performed-work record may cite a U.WorkPlan and planned baseline, while recording launch values, actuals, substitutions, variance, telemetry, outputs, outcome, and result-related records in the performed-work occurrence. Comparator, transport, PrincipleFrame, U.Signature(profile=FormalSubstrate), evidence, assurance, and gate relations are named separately when live.

P2W Integration As Role Enactability

When E.18.1 uses integration wording to mean role enactability under interface constraints, this family carries the role, method, plan, and performed-work part of the claim. Name the selected role, U.RoleAssignment when live, method or method description, relevant U.WorkPlan or performed U.Work, and the interface constraints governed by the architecture or module-interface pattern.

If the same phrase also raises connected artifacts, telemetry, acceptance records, diagrams, module-interface claims, selected-structure claims, checks, gates, evidence, or provenance, split those relations before relying on the integration wording.

Lowering, Repair, and Refresh Conditions

Lower an A.15 claim when the role, holder, bounded context, method, method description, work plan, performed work occurrence, or capability check cannot be named at the granularity required by the next work move. A weaker but admissible result is a separation note, source-gap note, source-restoration request, decision-request record for the next decision, or prospective work-plan entry.

Repair the local alignment frame when a subsequent source shows that the role assignment, method description, work-plan baseline, performed-work occurrence, capability threshold, status-currentness record, or source-currentness window was wrong for the claimed move. Repair only the changed relation: do not rewrite the method when only the work plan changed, do not rewrite the work occurrence when only the evidence path changed, and do not treat a source-restoration request as carrying a non-A.15 claim.

Refresh the A.15 use before relying on it across a new context, new role assignment, new method family, new work plan, new execution window, new result measurement, or new live evidence, assurance, gate, source-restoration, or mathematical-lens relation. If the issue under repair after refresh is no longer role-method-work alignment, use the governing pattern for that relation and keep only the returned A.15 separation here.

A.15:End

U.Work

Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative

At a glance. Use U.Work when the question under repair is what actually happened: a dated, resource-consuming occurrence enacted by a holder under U.RoleAssignment, inside a U.BoundedContext, with method, time window, parameters, resources, affected referent, result, and evidence kept inspectable.

Use this when. Use this pattern when a plan, method description, schedule, log, telemetry stream, dashboard, approval-looking cue, or result statement is being treated as if it were actual performed work. U.Work is the run-time occurrence; the surrounding records may identify, constrain, evidence, schedule, or judge it, but they do not become the occurrence by being published.

First output. One work-occurrence record naming performedBy -> U.RoleAssignment, enactsMethod -> U.Method, methodDescriptionRef when the source episteme is live, executedWithin, time window, concrete parameter bindings, affected referent, resource ledger, pre-state and post-state anchors or a declared delta predicate, outcome, and the governing U.BoundedContext.

Working action path.

  1. Name the candidate occurrence and the work move that depends on it.
  2. Recover the U.RoleAssignment, enacted U.Method, method-description source, time window, system or subsystem accountable for the occurrence, affected referent, parameters, resources, and outcome.
  3. Decide whether the item is actual U.Work, only a plan (A.15.2), only a method or method description (A.15), only evidence for work (A.10), or a work-relevant source-restoration case (A.15.4).
  4. For composite, repeated, interrupted, or overlapping occurrences, declare the work-part relation and aggregation policy before using totals or identity claims.
  5. If the required anchors cannot be recovered, lower the claim to a source-gap note, work-evidence note, plan note, or source-restoration request; do not backdate work.

Ordinary use. For a simple run, one compact work card with performer, method, time window, affected referent, resources, and outcome is enough.

Reliance-bearing use. Use the full record when the work occurrence carries cost, quality, audit, evidence, compliance, gate, release, result measurement, cross-context reuse, or aggregation claims.

Stop condition. Stop once the occurrence is either recoverable as U.Work at the needed granularity or lowered to a neighboring record that no longer claims performed work.

Not this pattern when. Not this pattern when the live object is only a method description, only a plan or schedule (A.15.2), only a slot-filling plan item (A.15.3), only a visible source cue that must be restored before reliance (A.15.4), only evidence or assurance (A.10 or B.3), or only publication-use or representation behavior (E.17, A.7, or the relevant representation pattern).

Problem Frame

After we have agreed who is assigned (via Role assignment), what they can do (via Capability), and how in principle it should be done (via Method or MethodDescription), we still need a precise concept for what actually happened in real time and space.

That concept is U.Work: the dated run-time occurrence of enacting a U.Method by a specific performer under a U.RoleAssignment, with concrete parameter bindings, resource consumption, and outcomes, anchored to a domain referent that actually changes (asset, product, or dataset) - not merely the manipulation of records about that referent. Managers care about Work because it is the place where actual cost, time, defects, and result evidence are booked. Architects care because Work ties plans and specifications to accountable execution.

Problem (what breaks without a clean notion of Work)

  1. Plan and run confusion. Schedules and diagrams get mistaken for "the process," so audits and KPIs become fiction.
  2. Specification and run conflation. A method description, code artifact, or SOP is reported as if it were an execution; conversely, logs are treated as recipes.
  3. Who and when leakage. People and calendars are baked into specifications; reuse and staffing agility collapse.
  4. Resource dishonesty. Energy, money, and tool wear are booked to methods or roles, not to actual runs; costing and sustainability measures drift.
  5. Mereology muddle. Teams hand-wave over sub-runs, retries, overlaps, or long-running episodes; roll-ups double-count or miss work.

Forces (what the definition must balance)

ForceTension we resolve
Universality vs. domain detailOne Work notion for surgery, welding, ETL, proofs, lab cycles—while letting each keep its vocabulary.
Granularity vs. aggregationAtomic runs vs. composite operations; we need roll‑up without double‑count.
Concurrency vs. orderParallel or overlapped activities need clear part and overlap semantics.
Identity vs. retriesA failed attempt, a retry, and a resumed episode—what is “the same” work?
Time realism vs. simplicityWe need intervals and coverage but cannot bury users in temporal logic notation.

Solution — define U.Work as the accountable, dated occurrence

Definition

U.Work is a 4D occurrence holon: a dated run-time enactment of a U.Method by a performer designated through a U.RoleAssignment, executed within a concrete U.System or U.SubSystem, inside a U.BoundedContext, that binds concrete parameters, consumes and produces resources, and leaves an auditable trace. When a method-description source is live, methodDescriptionRef names the U.MethodDescription used to identify, constrain, or justify the enacted method. Each U.Work is a morphism Δ on a declared state‑plane (StatePlaneRef), mapping ⟨pre‑state, inputs⟩ to ⟨post‑state, outputs⟩ for one or more affected referents.

Memory aid: Work = “how it went this time” (dated, resourced, accountable).

Core anchors (conceptual descriptors; not a data schema)

When you describe a Work instance in a review, answer these prompts:

  1. Window — start and end timestamps and, where relevant, location or asset.
  2. SpecisExecutionOf → U.MethodDescription (the description actually followed; edition pinned if applicable).
  3. PerformerperformedBy → U.RoleAssignment (which holder#role:context acted).
  4. Parameters — concrete values bound for this run (from the MethodDescription parameter declarations).
  5. Inputs and outputs — materials, information, or product states used or produced by the Work; service delivery is judged through the Outcome row.
  6. Resources — energy, materials, machine time, money (the only place we book them).
  7. Outcome — success and failure classes, quality measures, acceptance verdicts (map-then-compare per ComparatorSet under CG-Spec; pin editions).
  8. Links — predecessor, successor, and overlap relations to other Work, plus step or run nesting if part of a bigger operation.
  9. Context — the bounded context under which this run is judged, normally inherited from the method-description source and U.RoleAssignment; see A.15 for cross-checks.
  10. Effect (Δ)affected → {referent(s)} + pre‑state anchor and post‑state anchor (or a declared Δ‑predicate evaluated on evidence) on the declared state‑plane (StatePlaneRef).
  11. SystemexecutedWithin -> U.System or executedWithin -> U.SubSystem (the operational system or subsystem accountable for the occurrence; mandatory).
  12. Evidence and telemetry (optional) — if the run feeds G.11 refresh or QD and OEE archives, cite PathId or PathSliceId and the active policy-id used for illumination; do not elevate telemetry into dominance without CAL policy.

Clear distinctions (the four‑slot grammar in action)

You are pointing at…The right FPF conceptLitmus
The recipe, code artifact, or diagramMethodDescriptionIs it an episteme or publication describing a way of doing?
The semantic “way of doing”MethodSame Standard across notations?
The assignment ("who is being what")Role -> RoleAssignmentCan be reassigned without changing the system?
The ability (“can do within bounds”)CapabilityWould remain even if not assigned?
The dated occurrence with logs, resourcesWorkDid it happen at (t₀, t₁), consume resources, produce outcomes?
The state change caused this timeWork.ΔDid the referent move from pre→post on the declared state‑plane?

Publication-use boundary for U.Work

A U.Work publication projects an already declared work occurrence; it does not create the occurrence, add run-time facts, or make a plan, source reconstruction, dashboard, or publication face count as performed work.

Publication-use pressureWork-local rule
PlainView, TechCard, InteropCard, or AssuranceLane presents work materialProject only occurrence anchors: time window, performer, enacted method-description source, parameter-binding occurrence, resource-ledger reference, state-change anchors, outcome, and acceptance-verdict reference when live.
numeric, comparable, aggregation, or benchmark content appearsPin the comparator, aggregation policy, CG-Spec, reference plane, and transport edition needed by the claimed comparison; do not hide scalarization in the publication face.
publication cites design-time material or cross-context materialKeep the U.Work occurrence run-time; cite the design-time or cross-context material through Bridge/UTS, DesignRunTag, reference-plane, or edition relation as needed.
reconstructed records look like a runDo not synthesize surrogate U.Work; a publication may cite only work occurrences that meet the occurrence anchors in this pattern.

Crossing visibility for work publications

When a work publication crosses design/run state, context, reference plane, unit, or edition, publish the crossing relation used by the publication. Penalties and reliability changes belong to the relevant comparison, bridge, publication, or evidence relation; they do not change the identity of the U.Work occurrence.

Launch values bind only at the occurrence. Plan-time proposals remain proposals; do not back-fill plan publications with run-time bindings. Pre-state and post-state anchors bind to the occurrence: pre at start, post at completion or at declared checkpoints.

Work mereology (how runs form holarchies)

We adopt a 4D extensional stance for occurrences: a Work is identified primarily by its spatiotemporal extent and its execution anchors (spec used, performer, parameterization). This avoids double-counting and keeps aggregation sound. FPF adapts insights from BORO and constructive ontologies to Work while staying practical.

Parts and wholes of Work (design‑neutral, run‑time facts)

  • Temporal‑part (TemporalPartOf_work). A proper time‑slice of a Work (e.g., the first 10 minutes of a 2‑hour run). Useful for monitoring and SLAs.
  • Episode‑part (EpisodeOf_work). A resumption fragment after an interruption (same run identity if policy deems it one episode; see 5.5).
  • Operational-part (OperationalPartOf_work). A sub-run that enacts a factor of the Method or specification, for example, an incision run within an appendectomy run, possibly overlapping with others in time.
  • Parallel‑part (ConcurrentPartOf_work). Two sub‑runs that overlap in their windows, coordinated by the same higher‑level run.

Didactic rule: Method composition ≠ proof of Work decomposition. Sub‑runs often map to method factors, but retries, batching, pipelining, and failures make the mapping non‑isomorphic.

Key relations among Work

  • precedes or happensBefore — strict partial order on Work windows.
  • overlaps — intervals intersect but neither contains the other.
  • contains or within — one Work's window contains another's.
  • causedBy or causes — pragmatic causal links (e.g., a rework caused by a failed inspection run).
  • retryOf — a new Work instance re‑attempting the same MethodDescription with revised parameters.
  • resumptionOf — a Work episode that continues an interrupted run (policy decides identity; see 5.5).

These relations are run‑time facts, not design assumptions.

Operators for roll‑ups (Γ\time and Γ\work)

  • Temporal coverage — Γ_time(S) For a set S of Work parts, returns a coverage interval set (union of intervals) or, when required, the convex hull [min t₀, max t₁]. Use union for utilization; use hull for lead time. Properties: idempotent, commutative, monotone under set inclusion.

  • Resource aggregation — Γ_work(S) For a set S of Work parts, returns the aggregated resource ledger (materials, energy, time, money) with de-duplication rules for shared and overlapped parts (context-declared). Properties: additive on disjoint parts; requires overlap policy otherwise (e.g., attribute costs to the parent once, not to each child).

Manager’s tip: Pick the coverage operator that matches your KPI: union for machine utilization; hull for calendar elapsed; never mix silently.

Identity of a Work (extensional criterion, pragmatically framed)

Two Work records refer to the same Work iff, in the relevant context:

  • their time–space extent is the same (within declared tolerance),
  • they link to the same MethodDescription,
  • they have the same performer (U.RoleAssignment), and
  • they bind the same parameters (or declared‑equivalent values).

If any of these differ (or the context declares equivalence absent), they are distinct Work instances (e.g., a retry).

Interruptions, retries, resumptions (episode policy)

  • Retry: new Work with its own window and parameters; link via retryOf.
  • Resumption: same Work identity split into episodes if the context’s episode policy declares so (e.g., “power loss under 5 minutes keeps identity”).
  • Rework: new Work caused by a failure in earlier Work; link via causedBy.

Why it matters: plans, costs, and quality stats depend on whether you treat a disruption as one episode or a new run. Declare the policy in the bounded context.

Compositionality of effects (Δ)

For any Work with parts, the effect of the whole must be the rules-declared composition of the effects of its parts plus any declared overheads and residuals. Composition must align with the overlap rules used by Γ_work (e.g., no double-count of shared fixed costs, and consistent attribution of variable deltas).

Archetypal grounding (parallel domains)

Surgical case (overlap and episodes)

  • Top run: Appendectomy_Case#2025‑08‑10T09:05–11:42.
  • Spec: Appendectomy_v5 (MethodDescription).
  • Performer: OR_Team_A#SurgicalTeamRole:Hospital_2025 (U.RoleAssignment).
  • Operational parts: Incision (09:15–09:22), Exploration (overlaps with monitoring), Closure (11:10–11:35).
  • Episode: brief power dip 10:02–10:07 → resumptionOf same run (per hospital policy).
  • Γ_time: union for OR utilization; hull for patient lead time.
  • Γ_work: totals consumables and staff time once (no double‑count for overlapping sub‑runs).

ETL pipeline (parallelism and retries)

  • Top run: ETL_Nightly_2025‑08‑11T01:00–01:47.
  • Spec: ETL_v12.bpmn.
  • Performer: ETL_Runtime#TransformerRole:DataOps_2025.
  • Parallel parts: Extract_AExtract_B; Transform starts when either completes (overlap).
  • Retry: WarehouseWrite failed at 01:36; retried with batch size ↓ — new Work linked via retryOf.
  • Γ_time: hull for SLA, union for cluster utilization.
  • Γ_work: sum compute minutes; attribute storage input and output once at the parent.

Thermodynamic cycle (work as a path)

  • Run: Carnot_Cycle_Run#2025‑08‑09T13:00–13:06.
  • Spec: Carnot_Cycle_Spec (MethodDescription with Dynamics model).
  • Performer: LabRig_7#TransformerRole:ThermoLab.
  • Work identity: the path in state-space traced during the interval; outputs: heat and work tallies.
  • Γ_time: straightforward interval; Γ_work: integrates energy exchange; no “steps” required.

Bias‑Annotation (as in E‑cluster)

  • Lenses tested: Prag, Arch, Did, Epist.
  • Scope declaration: Universal; temporal semantics and episode policy are context‑local via U.BoundedContext.
  • Rationale: Gives FPF a clean, actionable notion of occurrence compatible with U.RoleAssignment and Role Enactment (A.2.1; A.15) and with 4D extensional thinking, so that costing, quality, and audit rest on runs, not on plans or recipes.

Conformance Checklist (normative)

CC‑A15.1‑1 (Strict distinction). U.Work is a dated run-time occurrence. It is not a U.Method (semantic way), not a U.MethodDescription (description), not a U.Role or U.RoleAssignment (assignment), and not a U.WorkPlan (plan or schedule).

CC‑A15.1‑2 (Required links). Every U.Work MUST reference: (a) enactsMethod -> U.Method (the method enacted), (b) methodDescriptionRef -> U.MethodDescription when the source episteme or editioned method description is live, (c) performedBy -> U.RoleAssignment (the assigned performer in context), and (d) executedWithin -> U.System or executedWithin -> U.SubSystem (the operational system or subsystem accountable for the occurrence).

CC‑A15.1‑3 (Time window). Every U.Work MUST carry a closed interval [t_start, t_end] (or an explicitly marked open end for in-flight work) and, where relevant, location or asset.

CC‑A15.1‑4 (Context anchoring and judgement). A U.Work MUST be judged inside a declared U.BoundedContext (the judgement context).

  • By default, the judgement context is the context of the referenced MethodDescription.
  • If performedBy references a U.RoleAssignment in a different context, there MUST exist an explicit Bridge (U.Alignment) or policy stating cross-context acceptance. Otherwise, the Work is non-conformant in that context.

CC‑A15.1‑4b (State‑plane anchoring). Each U.Work MUST declare a StatePlaneRef for its Δ‑judgement.

CC‑A15.1‑5 (RoleAssignment validity). The performedBy U.RoleAssignment timespan MUST cover the Work interval. If it does not, the Work is invalid or must be re-judged in a context that allows retroactive assignments.

CC‑A15.1‑6 (Parameter binding). Parameters declared by the MethodDescription MUST have concrete values bound at Work creation or start and recorded with the Work. Defaults in the specification do not satisfy this requirement.

CC‑A15.1‑7 (Capability check). All capability thresholds stated by the Method or MethodDescription MUST be checked against the holder in performedBy at the time of execution (or at defined checkpoints). Violations must be flagged on the Work outcome.

CC‑A15.1‑8 (Acceptance criteria). Success and failure classes and quality grades MUST be determined by the acceptance criteria declared or referenced by the MethodDescription or CG-Spec in the judgment context. The verdict is recorded on the Work.

CC‑A15.1‑9 (Resource honesty). All consumptions and costs (energy, materials, machine‑time, money, tool wear) SHALL be booked only to U.Work (not to Method, MethodDescription, Role, or Capability). Estimates may live in specs; actuals live in Work.

CC‑A15.1‑10 (Mereology declared). If a Work has parts, the chosen part relation(s) must be declared (temporal‑part, episode‑part, operational‑part, concurrent‑part). Ambiguous mixtures are forbidden.

CC‑A15.1‑11 (Γ_time selection). For any roll‑up, the judgement context MUST declare which temporal coverage operator applies: union (utilization) or convex hull (lead time). Silent mixing is prohibited.

CC‑A15.1‑12 (Γ_work aggregation). Aggregation of resource ledgers across Work parts MUST specify an overlap policy (e.g., “attribute shared machine‑time to parent only”) to prevent double‑counting.

CC‑A15.1‑13 (Identity & retries). A retry MUST be modeled as a new Work linked via retryOf. Interruptions that are treated as the same run must be modeled as episodes (resumptionOf) per a context‑declared episode policy.

CC‑A15.1‑14 (Concurrency & ordering). Overlaps and precedences among Work MUST use interval relations (overlaps, precedes, contains, or within). Implicit "step order" claims are not admissible evidence.

CC‑A15.1‑15 (Cross‑context evidence). If a Work is to be accepted in multiple contexts (e.g., regulatory + operational), either: (a) re‑judge it in each context, or (b) provide Bridges that map acceptance criteria, units, and roles; never assume cross-context identity by name.

CC‑A15.1‑16 (Spec changes during run). If the MethodDescription version changes mid‑run, the Work MUST either: (a) split into episodes bound to respective specs, or (b) record an explicit spec override event in the judgement context. Silent substitution is forbidden.

CC‑A15.1‑17 (Distributed performers). If multiple U.RoleAssignments jointly perform the same top-level Work (e.g., multi-agent orchestration), the Work MUST either: (a) designate a lead U.RoleAssignment and list others as concurrent parts, or (b) be modeled as a parent Work with child Works per U.RoleAssignment.

CC‑A15.1‑18 (Logs ≠ Work by themselves). Logs and telemetry are evidence for a Work; they do not constitute a Work unless bound to specification, performer, time window, and judgment context.

CC‑A15.1‑19 (Affected referent). Each U.Work MUST name at least one affected referent (e.g., U.Asset, product, batch, dataset, or document) via affected -> {...}.

CC‑A15.1‑20 (State‑change witness). Each U.Work MUST carry either (a) explicit pre‑state/post‑state anchors on the declared state‑plane or (b) a Δ‑predicate that can be evaluated on evidence. Trivial “no‑op” runs MUST be flagged as such.

CC‑A15.1‑21 (World anchoring vs. record handling). A run whose only effect is copying or reformatting records does not qualify as U.Work unless the judgment context declares those records to be the product referent (e.g., data-product manufacture).

CC‑A15.1‑22 (System anchoring). Each U.Work MUST declare executedWithin -> U.System or executedWithin -> U.SubSystem; if different from the asset of change, keep affected explicit.

CC‑A15.1‑23 (Compositionality of Δ). For composite Work, the parent effect MUST be the declared composition of child effects under the same overlap policy as Γ_work.

CC‑A15.1‑24 (No new claims on publication views). MVPK views for U.Work SHALL NOT add properties or claims beyond the declared work-occurrence claim; numeric or comparable content MUST include unit, scale, reference-plane, and EditionId pins; the term "signature" is banned on work-publication views.

CC‑A15.1‑25 (No Γ leakage). Publication views MUST reference Γ operators and policies by id when showing aggregates; they MUST NOT encode aggregation semantics in prose or imply defaults. Γ lives in Part B; views carry pinned references only.

CC‑A15.1‑26 (No input-output re-listing). Publication views MUST NOT restate method-description input and output lists; publish presence pins and source anchors only (per MVPK §5.4).

CC‑A15.1‑27 (Lawful orders; return sets). Any across-run comparison presented on a U.Work publication view MUST use a declared ComparatorSet (map-then-compare), return sets when order is partial, and forbid hidden scalarization or ordinal means.

CC‑A15.1‑28 (Comparator and transport pins). Any numeric or comparable acceptance or KPI on a U.Work publication view MUST pin ComparatorSet.edition, CG-Spec.edition, and, where conversions occur, TransportRegistry.edition with Φ or Φ^plane policy-ids; Bridge ids are mandatory for cross-context or cross-plane reuse; penalties affect the reliability relation only.

CC‑A15.1‑29 (Telemetry hooks, when applicable). If a Work instance feeds G.11 or QD and OEE portfolios, it SHALL cite PathId or PathSliceId and the active policy-id in its evidence; illumination remains report-only telemetry unless CAL explicitly promotes it.

Temporal & Aggregation Semantics (normative operators & invariants)

Temporal coverage Γ_time

  • Input: a finite set S of Work instances or Work parts.

  • Output: either (a) the union of their intervals, or (b) the convex hull [min t_start, max t_end]as declared by context and KPI.

  • Invariants:

    • Idempotent: Γ_time(S ∪ S) = Γ_time(S)
    • Commutative: order of elements irrelevant
    • Monotone: if S ⊆ T then coverage(S) ⊆ coverage(T) (for union) or hull(S) ⊆ hull(T) (for hull)
  • Usage guidance:

    • Use union for utilization and availability (how much of the clock time the asset was actually busy).
    • Use hull for lead time and cycle time (elapsed from first touch to last release).
    • Manager’s tip: Write the choice near the KPI; many disputes are just a hidden union‑vs‑hull mismatch.

Resource aggregation Γ_work

  • Input: a finite set S of Work instances or parts with resource ledgers.

  • Output: an aggregated ledger (materials, energy, machine‑time, money, tool wear) with explicit overlap policy.

  • Invariants:

    • Additivity on disjoint parts: if intervals and resources are disjoint by policy, totals add.
    • No double‑count: overlapping costs must follow the declared policy (e.g., count once at parent).
    • Traceability: each aggregated figure must be reconcilable to contributing Work IDs.
  • Typical policies:

    • Parent‑attribution: shared fixed costs at parent; variable costs at children.
    • Pro‑rata by wall‑time: split overlaps by relative durations.
    • Driver‑based: allocate by a declared driver (e.g., CPU share, weight, priority).

Cross-Context Checks (MethodDescription, RoleAssignment, and Work)

When a Work is recorded, perform these three quick checks:

  1. Method-description context check. Does methodDescriptionRef refer to a MethodDescription defined in the judgement context, or bridged to it, when that source is live?

    • If no, the Work is out‑of‑context; either change context or add a Bridge.
  2. RoleAssignment context check. Is performedBy's U.RoleAssignment valid in the same context, or bridged?

    • If no, the Work is unassigned for that context; remedy via a valid U.RoleAssignment or a policy exception.
  3. Standard–Outcome Check. Do the Work's inputs, outputs, and metrics satisfy the acceptance criteria from the spec as interpreted in that context?

    • If no, the Work fails or is “conditionally accepted” per context policy.

Manager’s mnemonic: Context, assignment, Standard → CAC. Fail any → the Work is not acceptable here (perhaps acceptable elsewhere).

Anti‑patterns (and the right move)

  • “The log is the process.” Dumping telemetry without binding (spec, performer, context) → Not Work. Create a Work, link the log as evidence.
  • Record-only transforms. ETL or replication of records with no declared affected referent (product or dataset as product) -> Not Work in this context; either declare the dataset as the product referent or move it to U.WorkPlan or the relevant operations pattern.
  • Silent cross‑context acceptance. “Ops accepted it, so audit accepts it.” → Add a Bridge or re‑judge in audit context.
  • Spec drift in mid‑run. Swapping SOP v5→v6 without recording → Split into episodes or record override.
  • Budget on the method. Charging costs to Method or Role → Book only to Work; keep estimates in specs.
  • Part ambiguity. Mixing retries, episodes, and operational parts with no declared relation → Choose and declare the part relation.
  • Union-hull confusion. Changing KPI coverage silently between reports -> declare Γ_time policy per KPI.
  • Double‑count in overlaps. Summing child and parent resource ledgers → Declare and apply an overlap policy.

Migration notes (quick wins)

  1. Backfill links. For existing logs, create Work records and attach isExecutionOf and performedBy.
  2. Name the context. Pick the judgement context explicitly; add Bridges if multiple contexts must accept.
  3. Record the episode policy. Decide when an interruption keeps identity or forces a new run.
  4. Choose Γ_time per KPI. Put “union” or “hull” in the KPI definition; stop arguing in meetings.
  5. Set an overlap policy. Write one sentence on how shared costs are allocated; apply consistently.
  6. Pull plans out. Move calendars to U.WorkPlan; let Work record actuals.
  7. Parameter blocks. Make parameters explicit and bind them at start; root-cause analyses become easier.

Consequences

BenefitsTrade-offs and mitigations
Auditable reality. Costs, time, and quality attach to concrete runs; root‑cause analysis and accountability improve.More records. You create Work instances; mitigate with templates and automation.
Sound roll-ups. Γ_time and Γ_work turn roll-ups from hand-waving into declared policy; KPIs become comparable.Policy discipline. You must choose union or hull and an overlap policy; write it once.
Cross‑context clarity. CAC checks prevent silent model drift; bridges make acceptance explicit.Bridge upkeep. Keep mappings short and focused; review at releases.
4D extensional coherence. Parts, overlaps, and retries stop double-counting and identity confusion.Learning curve. Teach episode vs retry; include examples in onboarding.

SoTA Alignment

SoTA alignment rule. A source tradition counts here only when it preserves the local U.Work distinction: dated occurrence, role-assigned performer, enacted method, method-description source when live, time window, affected referent, resources, outcome, and evidence path.

Source traditionLocal invariant adoptedShortcut rejected
4D extensional and BORO-style occurrence modelingWork identity is tied to occurrence extent plus execution anchors; parts, retries, resumptions, and overlaps are explicit.Treating a method factor, diagram, or log entry as proof of a work occurrence.
Process mining, audit, and operations-management practiceLogs, telemetry, and event records evidence work only after they are bound to performer, method, time window, context, and affected referent.Treating telemetry alone as U.Work.
Temporal-interval and aggregation practiceRoll-ups require declared Γ_time, Γ_work, and overlap policy; partial order and overlap are not hidden in step labels.Mixing union, hull, parent cost, and child cost without a declared policy.
Provenance, observability, and quality-measurement practiceWork records carry evidence paths and currentness hooks without letting evidence, assurance, or gate claims replace the occurrence.Using an evidence path, assurance statement, or gate result as if it were the performed work.

Relations

  • Builds on: A.1 Holonic Foundation; A.1.1 U.BoundedContext; U.System; A.2 U.Role; A.2.1 U.RoleAssignment; A.2.2 U.Capability; A.3.1 U.Method; A.3.2 U.MethodDescription.
  • Coordinates with: A.15 Role-Method-Work Alignment (the "four-slot grammar"); B.1 Γ (aggregation) for resource and time operators; E-cluster lexical rules (L-PROC and L-FUNC).
  • Informs: reporting and KPI patterns; assurance and evidence patterns (Work as the anchor for audits); scheduling patterns (U.WorkPlan -> U.Work deltas).

Didactic quick cards

  • What is Work? How it went this time → dated, resourced, accountable.
  • Four-slot grammar: Who? RoleAssignment. Can? Capability. How? Method or MethodDescription. Did? Work.
  • CAC checks: Context (judgement), assignment (valid U.RoleAssignment), Standard (acceptance criteria).
  • Roll‑ups: Γ_time = union (utilization) or hull (lead time); Γ_work with a declared overlap policy.
  • Episodes vs retries: same run split vs new run; write the policy.
  • Resource honesty: actuals booked only to Work; estimates live in specs.

P2W Performed-Work Use Relation

When E.18.1 reaches performed work, U.Work carries the dated occurrence: performer, method-description source, parameters, resources, time window, pre-state, post-state, outputs, outcome, and audit trace.

A U.Work occurrence may cite a U.WorkPlan or SlotFillingsPlanItem as planned baseline. The performed-work record carries launch values, actuals, substitutions, variance, telemetry, and result-related records; comparator, transport, PrincipleFrame, evidence, assurance, and gate claims are separate live relations when the carry-through record names them.

Lowering, Repair, and Refresh Conditions

Lower a candidate U.Work claim when performer, enacted method, method-description source when live, time window, executedWithin, affected referent, parameter bindings, resources, outcome, or state-change witness cannot be named at the granularity required by the next work move. The admissible lowered record is a plan note, evidence note, source-gap note, source-restoration request, or method-description reference, not a backdated work occurrence.

Repair the work record when a subsequent source changes the work interval, performer, role assignment, enacted method, method-description edition, parameter binding, resource ledger, outcome, affected referent, state-plane anchor, pre-state or post-state anchor, overlap policy, or aggregation policy. Repair only the changed relation: do not rewrite the method when only evidence changed, do not rewrite evidence when only work time changed, and do not convert a plan or source-restoration request into work.

Refresh before cross-context acceptance, aggregation, comparison, result measurement, release reliance, gate use, evidence use, assurance use, QD or OEE archive use, or P2W carry-through use. If the claim being made after refresh is no longer performed work, use the governing pattern for that relation and keep only the returned U.Work reference here.

A.15.1:End

U.WorkPlan

Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative

At a glance. Use U.WorkPlan when the question under repair is intended work: planned windows, intended role requirements, planned constraints, resource budgets, dependencies, acceptance targets, and baselines for subsequent variance against performed U.Work.

Use this when. Use this pattern when a schedule, calendar, rota, Kanban ticket, Gantt bar, shift plan, rollout plan, or planned reservation is being treated as a method, actual work, evidence, approval, or gate result. U.WorkPlan is an episteme for intended U.Work; it can coordinate action, but it does not make execution happen.

First output. One plan record or plan item naming horizon, cadence, target U.Method, method-description source when live, planned window, intended role requirements or proposed U.RoleAssignment, planned constraints, resource budgets, dependencies, acceptance targets, planned baseline, and the variance relation expected when U.Work occurs.

Working action path.

  1. Name the intended work occurrence or work family that needs planning.
  2. Recover target method, method-description source when live, planned window, role requirements, planned resources, dependencies, acceptance targets, and context.
  3. Decide whether the encountered item is a U.WorkPlan, a method description, performed U.Work, a slot-filling plan item, evidence, gate claim, or source-restoration case.
  4. Declare plan-item decomposition, dependency relation, and planned-baseline policy before using the plan for coordination or variance.
  5. When actual work occurs, connect the U.Work record back to the plan item and record variance rather than rewriting the plan as if it had executed.

Ordinary use. For simple coordination, a compact plan item with intended method, window, role requirement, resource budget, and acceptance target is enough.

Reliance-bearing use. Use the fuller WorkPlan record when the plan carries cross-role coordination, budget reservation, delivery commitment, gate preparation, audit expectation, cross-context acceptance, or P2W carry-through.

Stop condition. Stop once the intended work is coordinated at the needed granularity or the encountered item is lowered to method, work, evidence, gate, or source-restoration use without claiming to be a plan.

Not this pattern when. Not this pattern when the live object is a dated performed work occurrence (A.15.1), a plan-item filler (A.15.3), a visible source cue needing work-relevant restoration (A.15.4), a method or method description (A.15), evidence or assurance (A.10 or B.3), a gate decision (A.20 or A.21), or publication-use behavior (E.17).

Context (plain‑language motivation)

Operations live on time. Even with perfect roles, abilities, and methods, nothing ships unless we decide when and by whom concrete runs should happen, under what constraints and budgets. Teams need a first‑class concept for plans and schedules that does not get confused with:

  • the semantic “way of doing” (that is U.Method),
  • the written recipe (that is U.MethodDescription),
  • the actual execution (that is U.Work), or
  • the state laws (that is U.Dynamics).

U.WorkPlan is that missing anchor.

Problem (what breaks without WorkPlan)

  1. “Workflow = schedule” conflation. Flowcharts or code are used as calendars; resource clashes and SLA misses follow.
  2. Plan and run blur. Gantt bars or Kanban tickets are reported as if the work already happened; audits and costing degrade.
  3. Specification and time leakage. People and calendars creep into MethodDescriptions; reuse and staffing agility collapse.
  4. No variance model. Without planned baselines, deviations in time, cost, and quality cannot be explained or improved.
  5. Structure entanglement. BoM and org charts get baked into “process” views; plans become brittle and unmaintainable.

Forces (what we must balance)

ForceTension we resolve
Universality vs. domain idiomsOne plan concept that fits hospitals, fabs, data centers, and research labs—while honoring local terms.
Commitment vs. flexibilityPlans must be firm enough to coordinate, yet easy to update as reality changes.
Intended performer vs. actual performerPlans may name intended performers; the actual assignment must still be checked at run time.
Budgets vs. actualsPlans carry targets and reservations; only Work carries actual spend.
Decomposition vs. mappingPlan tasks decompose conveniently; they do not force a shape on actual Work runs.

Solution — the U.WorkPlan as the time‑bound intention to execute Work

Definition

U.WorkPlan is an U.Episteme that declares intended U.Work occurrences over a horizon, with planned windows, dependencies, intended performers as role kinds or proposed U.RoleAssignments, resource budgets and reservations, and acceptance targets within a U.BoundedContext.

Strict distinction (memory aid): Method = how in principle. MethodDescription = how it is written. WorkPlan = when, by whom in intent, under which constraints. Work = how it went this time.

Plan Items (what a WorkPlan is made of)

A U.WorkPlan contains Plan Items (think: scheduled tasks or operations), each of which typically states:

  1. Target Method and specification — the Method to be enacted and the MethodDescription intended for enactment.
  2. Planned window — e.g., earliest start and latest finish, timebox, recurrence (cron-like), blackout periods.
  3. Role requirementsrole kinds required (not people), optional proposed U.RoleAssignments if pre-assignment is allowed in the context.
  4. Capability thresholds — minimal abilities required of the performer (checked at run time).
  5. Resource budgets and reservations — planned energy, materials, machine slots, money, and reservations on assets.
  6. Dependencies — precedence, overlap permissions, gates, and approvals.
  7. Acceptance targets — quality windows and SLA targets to be judged when Work completes.
  8. Location and asset constraints — where the run is expected to take place.
  9. Links to Service promises (if any) — external commitments that this plan aims to satisfy.

Didactic guardrail: No logs or actuals belong in a WorkPlan; no step logic or solver internals either - that is the Method or MethodDescription.

Clear distinctions (lexical sanity for schedule, process, and workflow)

If you say…In FPF it is…Why
"The schedule for tomorrow's surgeries"U.WorkPlanCalendar of intended runs with who and when constraints.
"The workflow for appendectomy"U.MethodDescription and U.MethodRecipe and semantic way, not a calendar.
"The process already ran at 10:00"U.WorkA dated run with resources and outcomes.
"The thermodynamic process path"U.Work occurrence plus U.Dynamics modelA realized trajectory plus its model, not a plan.
"The plan assigns Dr. Lee"WorkPlan naming an intended U.RoleAssignmentAssignment is still validated at run time.
"The budget for Shift-B"WorkPlan (planned ledger)Actual costs land on Work, not on the plan.

L‑SCHED (lexical rule). In this document, words like schedule, calendar, rota, Gantt, plan point to U.WorkPlan unless explicitly redefined by a bounded context glossary.

Plan mereology (composition of plans ≠ composition of methods or runs)

Keep three separations crystal‑clear:

  • Method composition (design-time semantics) -> produces new Methods.
  • Work composition (run-time occurrences) -> produces parent and child runs with overlaps and episodes.
  • Plan mereology (epistemic structure) -> organizes Plan Items for coordination (phases, sprints, shifts), with precedence and resource reservations.

Common relations among Plan Items:

  • Precedes_pl or DependsOn_pl — start and finish constraints and gates.
  • MayOverlap_pl or MutuallyExclusive_pl — allowed overlaps versus exclusive windows.
  • Refines_pl — a child plan item tightens windows and budgets of a parent.
  • Alternative_pl — planned alternatives (e.g., backup rig, backup team).

Didactic rule: A Plan Item does not force an identical Work shape; mapping is via fulfilment and variance (see §6).

How WorkPlan Meets Work (Fulfilment and Variance)

When reality happens, each U.Work may:

  • Fulfil a Plan Item — link plannedAs → PlanItem.
  • Partially fulfil — multiple Work instances share one Plan Item (e.g., split run), or one Work fulfils several Plan Items (e.g., consolidated batch).
  • Deviate — execute with method or specification substitution, different window, different performer (still valid or policy exception).
  • Be unplanned — Work with no Plan Item (emergency or ad hoc); must be labeled as such.

Variance dimensions the plan expects to report on:

  • Schedule variance (Δt): early or late versus planned window.
  • Cost variance (Δc): actual resource spend vs budget.
  • Scope variance: different Method or MethodDescription than planned (with justification).
  • Quality variance: acceptance verdict vs target.
  • Assignment variance: intended versus actual U.RoleAssignment.

Manager’s view: A plan that cannot report variance is a calendar picture, not a management tool.

What a good WorkPlan states (review checklist)

Use this as a human-facing checklist (not a rigid schema):

  1. Horizon & cadence (e.g., “W36 surgeries, daily ETL”).
  2. Plan Items with: target Method and MethodDescription, planned windows, dependencies.
  3. Role requirements (kinds) and intended assignments (optional, context‑lawful).
  4. Capability thresholds and safety envelopes.
  5. Resource budgets and reservations on assets.
  6. Acceptance targets (SLA and quality windows).
  7. Bridges if plan spans multiple contexts (operations, audit, or regulatory).
  8. Baseline and version plus change notes (so variance is attributable).
  9. Policy pointers (episode policy, overlap policy for Work roll‑ups if needed for KPIs).
  10. Exceptions path (how ad hoc or emergency work is planned after the fact).

Archetypal grounding (parallel domains)

Hospital OR day plan (shift rota + cases)

  • WorkPlan: OR_DayPlan_2025‑08‑12.
  • Plan Items: Case#1 Appendectomy, Case#2 Hernia, with windows, context assignments, and surgeon role kinds; anesthetist intended U.RoleAssignment provided.
  • Budgets: OR time blocks, consumables envelopes.
  • Fulfilment: Each surgery Work links to its Plan Item; variances computed (over‑run time, substitutions).

Fab maintenance weekend (asset reservations)

  • WorkPlan: Fab_Maintenance_W36.
  • Plan Items: Tool_42 chamber clean, Tool_13 calibration; MutuallyExclusive_pl with production slots.
  • Reservations: nitrogen, DI water, metrology window.
  • Fulfilment: Actual clean Work happens earlier; variance logged as early with cost underrun.

Data‑center rollout (multi‑context plan)

  • WorkPlan: DC_Rollout_Phase‑2.
  • Bridges: Ops context ↔ Security Audit context (different acceptance targets).
  • Plan Items: Deploy Service A, Pen‑test A; dependencies across contexts.
  • Fulfilment: Deployment Work passes ops targets; audit Work passes after the deployment work, with variance reported per context.

Bias‑Annotation (as in E‑cluster)

  • Lenses tested: Did, Prag, Arch, Epist.
  • Scope declaration: Universal; meanings of windows, budgets, and permissions are context-local via U.BoundedContext.
  • Rationale: Elevates planning and scheduling to a first-class episteme that coordinates Methods, U.RoleAssignments, and Work without conflation.

Conformance Checklist

IDRequirementPractical test
CC-A15.2-1A conforming U.WorkPlan names intended U.Work, not performed work.The record can state planned windows and baselines without claiming actuals.
CC-A15.2-2Each reliance-bearing plan item names target U.Method, method-description source when live, planned window, role requirement, planned resource budget, dependencies, and acceptance target.A performer can prepare the intended work without treating the plan as execution.
CC-A15.2-3Proposed U.RoleAssignments remain intended assignments until checked at run time by A.15 and A.15.1.The plan does not make the role assignment valid for the work interval by publication alone.
CC-A15.2-4Actual cost, resource use, launch values, substitutions, telemetry, and outcomes belong to performed U.Work.The plan points to the work record for actuals and variance.
CC-A15.2-5Plan-item decomposition does not force the same shape on performed work.Fulfilment and variance relations explain split, consolidated, emergency, or substituted work.
CC-A15.2-6Cross-context planning names bridges before reusing planned windows, budgets, or acceptance targets across contexts.Audit, regulatory, operations, and delivery contexts can judge the plan without hidden equivalence.
CC-A15.2-7Evidence, assurance, gate, launch-value, and result-measurement claims stay in the patterns that govern those relations.The WorkPlan may carry hooks or requests, but it does not become evidence, assurance, gate passage, or result measurement.

Common Anti-Patterns and How to Avoid Them

  • Plan-as-actual. Do not treat a Gantt bar, Kanban ticket, shift rota, or calendar booking as performed work; create or cite the U.Work occurrence when work happens.
  • Workflow-as-schedule. Do not treat a method description or flowchart as a plan; make a U.WorkPlan only when intended windows, constraints, role requirements, and baselines are live.
  • Assignment-by-plan. Do not treat an intended performer in the plan as a valid U.RoleAssignment for execution; validate assignment at run time.
  • Budget-as-cost. Do not book planned budgets as actual resource use; actuals belong to U.Work.
  • Plan-shape overreach. Do not force performed work to match plan decomposition; use fulfilment and variance relations.
  • Hook-as-claim. Do not treat evidence-reference hooks, gate-preparation notes, or source-currentness requests as evidence, gate passage, assurance, or release permission.

Consequences

BenefitTrade-off and mitigation
Plans become inspectable without being confused with execution.More explicit records; mitigate by using compact plan items for ordinary coordination.
Variance becomes meaningful because planned baseline and performed work stay separate.Requires discipline around baselines; keep baseline and version visible on the plan.
Cross-role and cross-context coordination becomes safer.Requires bridge checks when contexts differ; name only the bridge needed for the planned use.
P2W carry-through can prepare work without pretending work already happened.Use A.15.1, A.15.3, A.15.4, A.10, B.3, A.20, or A.21 only when the performed-work, planned-baseline, source-restoration, evidence, assurance, gate, or constraint relation becomes live.

SoTA Alignment

Source traditionLocal invariant adoptedShortcut rejected
Operations planning, scheduling, and project-control practicePlanned windows, dependencies, budgets, and baselines are declared before execution and compared against actuals after work occurs.Treating schedule presence as execution evidence.
Lean, maintenance, and service-management planning practicePlans coordinate role requirements, assets, constraints, and reservations while leaving actual work and variance to run-time records.Treating a plan as a method, a gate, or a result.
Case-management and adaptive-work practiceEmergency and ad hoc work can be related back to planning through exception, fulfilment, and variance relations.Forcing every actual work occurrence into the original plan shape.
Audit and quality-management practiceBaseline, version, acceptance target, and change note remain explicit so deviations can be explained.Changing the plan after the fact to make variance disappear.

Relations

  • Builds on: A.15 Role-Method-Work Alignment, A.15.1 U.Work, A.2.1 U.RoleAssignment, U.Method, and U.MethodDescription.
  • Coordinates with: A.15.3 for slot-filling plan items, A.15.4 for work-relevant source restoration, A.10 for evidence paths, B.3 for assurance, A.20 and A.21 for gates and constraint decisions, and E.17 for publication-use questions.
  • Used by: P2W carry-through when principle-to-work reasoning reaches WorkPlanning and must keep plan, performed work, evidence, gate, and result-measurement relations separate.

P2W WorkPlanning Use Relation

When E.18.1 reaches WorkPlanning, U.WorkPlan carries intended work occurrences, planned windows, intended role requirements, planned constraints, resource budgets, acceptance targets, evidence-reference hooks, source-currentness requests, and plan items.

If the same P2W source phrase also carries execution, launch-value, evidence, gate, result, measurement, or refresh meaning, write that meaning as a separate live relation before using the plan.

Launch-Value Boundary For P2W

For P2W use, U.WorkPlan may state planned values, planned fillers, constraints, reservations, intended performers, and evidence-reference hooks. Launch values are finalized only at performed-work entry under the current gate relation and performed-work pattern and are recorded with the performed U.Work and related gate and provenance records when live.

Lowering, Repair, and Refresh Conditions

Lower a candidate U.WorkPlan claim when horizon, planned window, target method, method-description source when live, role requirement, planned constraint, resource budget, dependency, acceptance target, or baseline cannot be named at the granularity required by the next planning move. The admissible lowered result is a planning cue, method-description note, source-gap note, source-restoration request, or evidence-reference hook, not a conforming WorkPlan.

Repair the WorkPlan when a subsequent source changes the intended method, planned window, role requirement, planned resource budget, dependency, acceptance target, baseline, version, bridge, or exception policy. Repair the plan; do not rewrite performed U.Work unless the work record itself changed, and do not make the repaired plan into evidence that the work occurred.

Refresh before relying on a WorkPlan for cross-context coordination, budget reservation, release preparation, gate preparation, evidence-reference use, performed-work entry, result measurement, or P2W carry-through. If the claim being made after refresh is actual work, evidence, assurance, gate passage, or source restoration, use the governing pattern for that relation and keep only the returned WorkPlan relation here.

A.15.2:End

SlotFillingsPlanItem

Tech-name: SlotFillingsPlanItem Plain-name: planned slot-fillings baseline item (planned baseline) Type: Architectural (A) Status: Stable Normativity: Normative (unless explicitly marked informative) Placement: Part A → A.15 (Work & WorkPlanning) Builds on: U.WorkPlan (A.15.2), performed-work occurrence discipline (A.15.1 and E.TGA), Context discipline (E.10.D1), MechSuiteDescription (A.6.7), and publication/view discipline (E.17; views are projections, not places of meaning) Used by: planned-baseline requirements from suites or kits; P2W (selection -> WorkPlanning -> WorkEnactment); Part G universalization Purpose (one line): provide a universal, context-explicit planned baseline that maps a slot-bearing description's SlotKinds to planned fillers, to be consumed by Work enactment where launch values are finalized.

At a glance. Use SlotFillingsPlanItem when a U.WorkPlan needs a planned baseline saying which planned fillers will occupy which SlotKinds of one slot-bearing description before work is enacted.

Use this when. Use this pattern when planned references, policies, spec pins, method-description references, evidence pin refs, or crossing-policy pins must be fixed for a P2W work-planning slice, and the plan must stay distinct from launch values, gate decisions, evidence, and performed work.

First output. One SlotFillingsPlanItem with exactly one target_slot_bearing_description_ref, explicit bounded_context_ref, EntityOfConcern ref, time selector or time rule, authoritative planned-filling rows, and any expected guard, evidence, edition, or crossing pins needed before work enactment.

Working action path.

  1. Name the slot-bearing description whose SlotKind set is being filled.
  2. Name the EntityOfConcern and grounding holon or reference plane when needed.
  3. Name context, time selector or time rule, and any P2W slice or publication scope needed for reproducibility.
  4. Fill the authoritative rows by SlotKind, using ByValue or ByRef with concrete RefKinds and edition pins when needed.
  5. Keep derived indices, views, guard pins, evidence pins, and crossing pins as projections or expectations; do not turn them into execution, gate, evidence, or launch-value claims.

Ordinary use. For a minimal baseline, context, time selector, target slot-bearing description, EntityOfConcern ref, and planned-filling rows are enough.

Reliance-bearing use. Use the fuller record when reproducibility, launch guard preparation, crossing expectations, suite or kit reuse, Part G universalization, or P2W carry-through depends on the baseline.

Stop condition. Stop once planned fillers are explicit enough for the intended WorkPlanning move, or lower the claim to a plan cue, source-gap note, relation governed by another FPF pattern, or blocked kind-definition gap without claiming a conforming planned baseline.

Not this pattern when. Not this pattern when the live object is the slot-bearing description itself, a mechanism definition, a performed-work occurrence, a gate decision, a launch-value witness, evidence, assurance, or a publication view. Use the corresponding governing pattern and return here only for the planned slot-filling baseline.

Name and reference discipline (informative)

  • Kind reuse: This pattern uses the kind name SlotFillingsPlanItem. It reuses existing Core terms and disciplines (e.g., U.WorkPlan.PlanItem, SlotKind, ValueKind, RefKind, and refMode discipline, edition pinning, U.BoundedContext, and the P2W split between WorkPlanning and WorkEnactment).
  • SlotFillingsPlanItem (kind name): keep the suffix PlanItem to preserve the WorkPlanning placement. Do not mint aliases like SlotBinding… (conflicts with the A.6.5 binding discipline) or SlotValue… (ambiguous slot-bearing description or context).
  • Anchor names: if a §4.2 anchor is materialized as a formal field name, keep …_ref only for fields whose values are concrete RefKind handles, and keep …_id only for identifiers. Avoid introducing generic placeholders such as SpecRef, PolicyRef, or GateRef inside this pattern; use existing concrete ref kinds. When no concrete ref kind exists, the planned-baseline claim is blocked until a governing FPF pattern defines the kind.
  • Row vocabulary: treat SlotFillingRow and PlannedFiller as internal names of this pattern. Do not treat them as shared tokens outside this pattern unless a governing FPF pattern defines them.

Problem frame

FPF frequently needs to make reproducible, reviewable choices about what fills which conceptual slot (specification references, policy references, mechanism-instance references, time selectors, evidence hooks, etc.) before any Work is enacted. These choices must be visible as a planned baseline for a concrete P2W slice (CG-frame, path slice, or publication scope), and must remain distinct from run-time “actuals” and gate decisions.

However, absent a universal WorkPlanning plan item for architecture-by-planned-slot-filling, practitioners tend to hide these choices inside mechanism prose, CG-Spec and CN-Spec descriptions, local cards, or informal checklists—making Part G patterns difficult to universalize and making Work audit trails ambiguous.

SlotFillingsPlanItem addresses this by defining a WorkPlan PlanItem kind whose job is to state, in one place and with explicit context, a mapping:

(Target slot-bearing description, slot kind) → planned filler (ByValue | ByRef(), with edition pins when needed)

and to do so in a form that can be cited by Work enactment and by suite or kit spec pins, without collapsing into “execution” or “decision logging”.

Problem (what breaks without it)

Without an explicit SlotFillingsPlanItem baseline, at least six failure modes recur:

  1. Hidden slot-bearing-description reference and meaning drift: a planned filler is stated without making explicit whose slot set is being filled, allowing silent reinterpretation of SlotKinds across kits or suites.

  2. Planning and enactment collapse: plan documents get “backfilled” with run-time values, so there is no stable planned baseline and no clean variance trail. WorkPlan explicitly warns against this.

  3. Implicit time (“latest”) and implicit recency: planned claims about comparability or launch readiness omit an explicit Γ_time, which violates the time discipline (“no implicit recency”).

  4. Edition ambiguity: references to method, policy, and specification references are not edition-pinned where reproducibility requires it, or the plan mutates the edition vector instead of citing pinned editions (edition changes are crossings, not “plan edits”). A particularly harmful subtype is edition-key backfill: retroactively editing a previously used baseline so that an edition-key change looks like an innocent PlanItem edit (hiding the required GateCrossing witness and breaking audit traceability).

  5. Crossing invisibility: cross-context or cross-plane expectations (Bridge + policy ids) are not stated at plan time, so downstream gate crossings appear as “magic” rather than traceable expected constraints.

  6. G-pattern fragmentation: each Part G pattern invents its own place to stash planned refs (method pick, comparator pick, QD archive config, etc.), blocking a clean “G.Core” universal layer and making modular reuse brittle.

Forces (what we must balance)

  • Strict distinction: planned baseline is not a run-time witness; launch values are finalized only in Work enactment.
  • Context must be explicit: every normative claim or rule is context-bound; the PlanItem must carry its context rather than relying on file location or prose.
  • Time must be explicit: no implicit “latest”; any plan that will be cited by comparability or launch-readiness checks needs an explicit Γ_time selector or rule.
  • SlotKind meaning is stable: the plan may choose fillers, but must not reinterpret SlotKinds or smuggle new semantics into indices.
  • Derived indices must not become “places of meaning”: projections like “planned spec refs” are useful, but must remain derivable from the authoritative rows.
  • Conceptual, not procedural: no solver steps, no lints, no “data governance”; this is an epistemic object used by humans in review.
  • Supports universalization: one PlanItem pattern must be usable across the whole of Part G, not just G.5.
  • Integrates with suites or kits: suites may require a planned-baseline ref and may act as slot-bearing descriptions.
ForceTension
Planning and enactment splitPlan must be citeable without containing run-time values.
Slot meaning stabilitySlotKinds must not drift by implicit slot-bearing-description changes.
Edition honestyBaselines must pin editions where meaning changes; avoid “latest”.
Suite and kit modularitySuite descriptions define slot interfaces and obligations; baselines choose fillers for a plan instance.
AuditabilityA practitioner or auditor must reconstruct “what was planned” without chasing hidden defaults.
ExtensibilityAllow suite-specialized variants without breaking universal core.

Solution

A.15.3:4.1 Definition

A SlotFillingsPlanItem is a kind of U.WorkPlan.PlanItem whose content is a planned slot-fillings ledger for a single slot-bearing description, within an explicit P2W context.

It is a WorkPlanning baseline, intended to be:

  • produced and accepted in WorkPlanning,
  • cited by downstream Work enactment (as planned baseline),
  • compared against actual fillings (variance recorded in Work, not by rewriting the plan).

Normative note (EntityOfConcern, Description episteme, specification use, and views): A SlotFillingsPlanItem is a Description episteme for planning (a PlanItem). It MAY be projected into U.View (e.g., TechCard(SlotFillingsPlanItemRef)), but any view is strictly a projection and MUST NOT introduce additional claims or “shadow defaults”.

A.15.3:4.2 Core conceptual descriptors (not a data schema)

A conformant SlotFillingsPlanItem SHALL provide the following description (names are indicative; the semantics are normative):

  1. PlanItem core (from A.15.2) The PlanItem MUST remain a WorkPlanning plan item: it may include assumptions, dependencies, constraints, expected publications or records, and notes; it MUST NOT contain run-time logs or actual fillings.

  2. Target slot-bearing description

    • target_slot_bearing_description_ref : <concrete …DescriptionRef> (required) Identifies the Description episteme whose SlotKind set is being filled (e.g., a kit description or a suite description). The slot-bearing description MUST be referenced as an edition-addressable Description episteme (a concrete …DescriptionRef such as MechSuiteDescriptionRef, …KitDescriptionRef, etc.), and MUST NOT target a MechanismDefinitionRef. If a standalone mechanism baseline is needed, introduce an explicit Description-scoped slot-bearing description wrapper, such as a mech kit or suite-of-one, and target that. A MechSuiteDescription MAY serve as a slot-bearing description for this purpose. If the slot-bearing description’s SlotKind interface is edition-sensitive (or expected to evolve), the reference MUST be edition-pinned (e.g., target_slot_bearing_description_ref.edition) whenever the PlanItem is used as a reproducibility baseline.
  3. EntityOfConcern and grounding (for the measurement or selected filler under planning)

    • described_entity_ref : <concrete RefKind> (required) The referent is the EntityOfConcern (C.2.3 role): the thing the planned baseline is about. It MUST NOT be silently conflated with a holon. (Example: a baseline can be about a width measurement while the grounding holon is a stool with that width.) Use a concrete RefKind of the EntityOfConcern (e.g., U.HolonRef, U.MeasureRef, …). Do not mint a new generic EntityRef token inside this pattern.
    • grounding_holon_ref? : U.HolonRef (optional; required when the EntityOfConcern is not itself a holon and a grounding holon is needed for reference-plane anchoring)
    • reference_plane? : ReferencePlane (optional; required when not unambiguously derivable from cited context publications or records such as CG-frame and specification pins)
  4. Explicit planning context (no hidden context)

    • bounded_context_ref : U.BoundedContextRef (required)
    • cg_frame_ref? : CGFrameRef (recommended when the fillings feed CG legality and selection)
    • path_slice_id? : PathSliceId (recommended for P2W reproducibility)
    • publication_scope_id? : PublicationScopeId (recommended if the plan will be surfaced in publication-facing views) These anchors exist because FPF claim discipline requires explicit context for claims or rules.
  5. Explicit time selector (no implicit recency)

    • exactly one of:

      • Γ_time_selector : Γ_timeSelector (ByValue), or
      • Γ_time_rule_ref : Γ_timeRuleRef (RefKind) This MUST be present whenever the plan is intended to serve comparability or launch-readiness downstream checks.
  6. Expected guard pins (references and expectations only; no gate decisions)

    • expected_usm_guard_pins : [USM.CompareGuard | USM.LaunchGuard] (ByValue; subset of {USM.CompareGuard, USM.LaunchGuard}) These lexemes are reserved for USM.Guards pins (gate-level surfaces), not for mechanism operator names. If USM.LaunchGuard is expected, the plan MUST include enough pins and references to make that guard executable downstream (explicit Γ_time_selector or Γ_time_rule_ref, pinned editions where needed, and evidence pin anchors). The PlanItem MUST NOT include outcomes for these guards and MUST NOT emulate gate decisions; it only records expectations and required anchors.

    • guard_owner_gate_ref? : <concrete OperationalGateRefKind> (refs only; required when expected_usm_guard_pins is non-empty unless unambiguously derivable) Identifies the gate that aggregates GuardFail outcomes (via the GuardOwnerGateSlot discipline). This remains an expectation pin, not a decision log. (Use the concrete RefKind that addresses OperationalGate(profile) in A.21. If such a RefKind does not exist, do not claim a conforming guard-owner gate reference.)

  7. Planned evidence anchors (pin refs only)

    • planned_evidence_pin_refs? : [<concrete …PinRef>…] These are anchors to where evidence will be placed or cited (typically SCR pins or RSCR pins; optionally other pin kinds explicitly allowed by the downstream guard regime), not the evidence itself.
  8. The planned slot-fillings ledger (authoritative rows)

    • planned_fillings : [SlotFillingRow+] where:

      SlotFillingRow := ⟨ slot_kind, planned_filler, edition_pin? ⟩

      • slot_kind : SlotKind A SlotKind provided by the target_slot_bearing_description_ref (the PlanItem MUST NOT reinterpret SlotKind meaning). Unless the slot-bearing description explicitly declares the slot as multi-valued, each slot_kind SHALL appear at most once in planned_fillings.
      • planned_filler : PlannedFiller where: PlannedFiller := ByValue(value) | ByRef(ref : <concrete RefKind>) In ByRef(…), the ref MUST be of a concrete RefKind (e.g., …SpecRef, …PolicyRef, …MethodDescriptionRef); the PlanItem MUST NOT use an untyped generic Ref or RefKind placeholder. The chosen filler MUST conform to the SlotSpec discipline of the slot-bearing description (A.6.5-style: refMode ∈ {ByValue | <concrete RefKind>}). Changes to planned fillers are described using the A.6.5 verb discipline: ByValue content change uses fill, assign, or update; ref retargeting uses retarget; ref resolution uses resolve; never describe the change by “renaming the slot”.
      • edition_pin? : EditionId Required only when reproducibility depends on an edition and the planned filler cannot carry an edition pin directly (preferred: …DescriptionRef.edition on the ref itself). If both the planned filler ref and the row provide edition pinning, they MUST agree (mismatch ⇒ nonconformant). ByValue rows SHOULD NOT carry edition pins unless the pinned edition is explicitly tied to a cited external publication or record (e.g., a referenced rule, policy, or method description).
  9. Derived indices (optional; never a second canonical source)

    • planned_spec_ref_index? : [<concrete …SpecRef>…]
    • planned_policy_ref_index? : [<concrete …PolicyRef>…]
    • planned_mechanism_instance_ref_index? : [<concrete …MechanismInstanceRef>…] If any of these are present, they MUST be derivable projections of planned_fillings; any mismatch is nonconformant. (These are categories of refs extracted from the authoritative rows, not an invitation to introduce new generic SpecRef or PolicyRef token-kinds.)
  10. Expected crossing policy pins (refs only; no crossing witnesses)

  • expected_crossing_policy_refs? : [⟨bridge_card_ref, phi_policy_id, psi_policy_id?, phi_plane_policy_id?, reference_plane(src,tgt)⟩ …] These communicate what the plan expects will be needed for crossings, without claiming that a crossing has occurred. bridge_card_ref is expected to pin a Bridge identity and channel (BridgeId + channel) and to be auditable via downstream CrossingBundle and UTS rows. This section states Bridge-only expectations; it MUST NOT introduce non-Bridge crossing mechanisms, and it MUST NOT embed CL, Φ, Ψ, or Φ_plane tables (references, policy identifiers, and pins only).

  • expected_crossing_bundle_refs? : [CrossingBundleRef…] (optional) Permitted only when the plan is explicitly citing already-published CrossingBundle baselines (e.g., “fixed context constants”); otherwise, the PlanItem SHALL state only expected policy pins and allow the crossing witness to appear at the gate-level or work-level.

  1. Notes (didactic, non-normative)
  • planned_filling_notes? Helpful narrative for practitioners or auditors; must not embed new claims that contradict the rows.

A.15.3:4.2.1 Canonical skeleton (Show)

The following compact pseudo-record illustrates the intended canonical minimum: explicit context + explicit time + a few authoritative rows.

SlotFillingsPlanItem := ⟨
  kind = SlotFillingsPlanItem,
  target_slot_bearing_description_ref = CHRMechanismSuiteDescriptionRef@edition(E_suite),
  described_entity_ref = U.HolonRef(H:EntityOfConcern), // or another concrete RefKind per C.2.3
  grounding_holon_ref = U.HolonRef(H:grounding-holon)?,  // when the EntityOfConcern is not itself a holon
  bounded_context_ref = U.BoundedContextRef(BC:context),
  cg_frame_ref = CGFrameRef(CG:frame),              // optional but typical for G.* legality and selection
  path_slice_id = PathSliceId(P2W:slice),           // optional but typical for reproducibility
  Γ_time_selector = point(t0),                      // no implicit “latest”
  expected_usm_guard_pins = {USM.CompareGuard, USM.LaunchGuard},
  planned_evidence_pin_refs = [RSCR.PinRef(RSCR:evidence-anchor)],
  planned_fillings = [
    ⟨ slot_kind = CNSpecSlot, planned_filler = ByRef(CNSpecRef(CN:…@edition(E_cn))) ⟩,
    ⟨ slot_kind = CGSpecSlot, planned_filler = ByRef(CGSpecRef(CG:…@edition(E_cg))) ⟩,
    ⟨ slot_kind = ScoringMethodDescriptionSlot,
      planned_filler = ByRef(ScoringMethodDescriptionRef(M:…@edition(E_m))) ⟩
  ]

A.15.3:4.3 Relation to Work enactment (planned baseline vs actuals)

  • A SlotFillingsPlanItem is not a witness of FinalizeLaunchValues. Launch values (actuals) occur only in Work enactment, and their witness belongs in Work and audit surfaces, not in this PlanItem.

  • Deviation at execution time is allowed, but it must be recorded as variance in Work, and the plan must not be rewritten to match the execution. When a Work enactment claims to follow a planned baseline, the Work MUST cite the SlotFillingsPlanItem in its Audit as the planned baseline reference, and MUST record any variance against it (rather than “backfilling” the plan). The baseline citation SHOULD be edition-addressable (i.e., the Work cites a stable PlanItem edition), so that subsequent PlanItem revisions cannot erase what was actually planned. If the baseline needs to change (including any edition-pinned ref changes), create a new PlanItem edition (or a new PlanItem) and treat the difference as a planning change—not as a retroactive edit of the previously cited baseline.

A.15.3:4.4 Relation to suites or kits

  • Any suite or kit that requires a “planned baseline” may require and cite a reference to a SlotFillingsPlanItem via its spec pins; MechSuiteDescription explicitly provides a place for such a requirement.

Variants

  1. Suite-specialized PlanItem (Refinement) A suite may define XSuiteSlotFillingsPlanItem ⊑ SlotFillingsPlanItem with:

    • fixed target_slot_bearing_description_ref = XSuiteDescriptionRef,
    • additional required rows (e.g., mandatory pinned CGSpecRef, CNSpecRef, suite-required mechanism instance refs),
    • additional required expected pins (guards, crossing policies).
  2. Minimal vs crossing-aware variants

    • Minimal: includes only context + planned rows + time selector.
    • Crossing-aware: adds expected_crossing_policy_ref[] and explicit reference_plane.
  3. Evidence-gated variant For workflows where USM.LaunchGuard is expected, require planned_evidence_pin_refs[] and explicitly pin the relevant edition set needed for the downstream guard.

Local boundaries

SlotFillingsPlanItem is a planned-baseline item. It records planned fillers for one slot-bearing description before work enactment. Keep these nearby boundaries local:

Source pressureLocal boundary
mechanism or operator wordingDo not use this item as a mechanism or operator signature; cite the mechanism or signature pattern when that relation is live.
spec, suite, kit, or acceptance-harness wordingThe item may cite a slot-bearing description, but it does not replace CN-Spec, CG-Spec, suite description, kit description, policy, or acceptance record.
threshold-like or eligibility wordingPin the acceptance, policy, comparator, or guard relation explicitly; do not hide it as an anonymous ByValue filler.
gate, decision, or crossing wordingThe item may state expected policy refs; it does not contain GateDecision, DecisionLog, or a claim that a crossing occurred.
actuals or launch valuesThe item is not a run-time witness and does not contain FinalizeLaunchValues actuals.
publication viewA view may project the item, but the view introduces no new planned rows, defaults, or semantics beyond the item.

When to use

Use SlotFillingsPlanItem whenever:

  • a P2W-selected work-planning slice needs a planned baseline for what fills a suite or kit slot set before work is enacted;
  • you must pin edition and time policies explicitly (e.g., legality gates, comparator sets, transport registries);
  • you are using or revising Part G patterns and want a uniform place to record selected references, policies, and mechanism instances;
  • you expect a LaunchGate or any guard-based eligibility check to be meaningful and traceable.

Implementation notes

Informative use guidance (conceptual):

  1. Choose one target_slot_bearing_description_ref per PlanItem. If multiple slot-bearing descriptions are involved, create multiple SlotFillingsPlanItems (one per slot-bearing description) to keep slot meaning unambiguous.
  2. Fill rows by SlotKind, not by positional arguments or “index numbers”.
  3. If any downstream reasoning may hinge on “now vs then”, supply Γ_time_selector or Γ_time_rule_ref explicitly.
  4. Prefer edition-pinned references when the downstream step is intended to be reproducible across review cycles.
  5. Use derived indices only as projections for practitioner navigation; never maintain them independently.
  6. If a PlanItem has been cited as a baseline by a Work, do not “edit it in place” to match reality. Create a new PlanItem edition and let Work record variance and, when needed, the required crossing witnesses.

Archetypal Grounding (Tell–Show–Show; System / Episteme)

Archetype 1: CHR suite planned baseline for lawful characterization

Tell. A team plans a characterization workflow over a CG-frame that uses a CHR mechanism suite. The suite requires an explicit planned baseline reference.

Show (failure without SlotFillingsPlanItem). The “plan” is implicit: it says “use the latest CG-Spec and the current best comparator; compute scores and launch” without an explicit Γ_time, without edition pins, and without a stable mapping from SlotKinds to chosen fillers. Subsequent review cannot distinguish: (i) what was planned, (ii) what was executed, and (iii) what changed via a crossing or edition-key shift.

Show (repair with SlotFillingsPlanItem). A conformant SlotFillingsPlanItem:

  • targets CHRMechanismSuiteDescriptionRef as the slot-bearing description (and pins its edition if used as a reproducibility baseline),
  • pins CNSpecRef and CGSpecRef (editions pinned where reproducibility requires),
  • pins a ScoringMethodDescriptionRef.edition (e.g., a monotone scoring family) and, when needed, a set-valued method family (e.g., conformal-style set predictions),
  • declares Γ_time_selector = point(t0) (no implicit “latest”),
  • declares expected_usm_guard_pins = {USM.CompareGuard, USM.LaunchGuard},
  • includes evidence pin refs that will be populated or used in Work enactment.

The resulting Work enactment cites this PlanItem as the planned baseline; any substitution (e.g., retargeting a method description ref) appears as Work variance (and, when relevant, as a crossing witness), not as a retroactive plan rewrite.

Archetype 2: Archive and QD selection with edition-sensitive descriptors

Tell. A workflow plans to return an archive (quality-diversity style) rather than a single winner. The selection pipeline depends on descriptor maps and distance definitions that are edition-sensitive.

Show (failure without SlotFillingsPlanItem). Descriptor-map and distance-definition drift is discovered only after the fact: an "archive" is produced, but practitioners or auditors cannot reconstruct which descriptor edition and distance definition were assumed at planning time, and the published view or card becomes the de facto mutable canonical source.

Show (repair with SlotFillingsPlanItem). A conformant SlotFillingsPlanItem:

  • targets an archive-selection kit or suite as target_slot_bearing_description_ref,
  • pins DescriptorMapDescriptionRef.edition and DistanceDefDescriptionRef.edition (or their kit equivalents),
  • states expected_usm_guard_pins = {USM.CompareGuard} (if no LaunchGate is expected yet),
  • records expected crossing policy pins if descriptors are reused cross-context.

This prevents “silent” descriptor drift across iterations and makes Part G’s archive-related extensions composable rather than embedded in selector prose.

Bias-Annotation

Lenses tested: Gov, Arch, Ontology and episteme, Prag, Did. Scope: Universal.

LensBias / limitation introduced by the patternMitigation
GovBaseline immutability and variance recording can be misread as bureaucracy rather than epistemic hygiene.Keep the baseline minimal; use suite-specialized refinements only when a suite description truly requires them.
ArchEnforces a clean P2W seam and discourages “configuration hidden in mechanisms”. This can expose underspecified slot-maintenance assignments earlier.Treat that friction as an architectural signal; refine the slot-maintenance interface rather than hiding choices in prose.
Ontology and epistemeBiases toward explicit context, time, and edition pinning; exploratory reasoning may feel constrained.Use minimal variants (context + rows + time selector) for exploration; graduate to pinned editions only when reproducibility is required.
PragIncreases upfront explicit-writing cost (explicit context, time, edition pins).Use derived indices as projections for practitioner navigation; avoid duplicating content on views or cards.
DidBiases against “one true card” habits by treating views as projections; may clash with existing documentation culture.Provide a TechCard and PlainView projection explicitly, but keep the PlanItem as the governing work-plan record.

Conformance Checklist

IDCheck (normative)
CC-A15.3-01The object is a U.WorkPlan.PlanItem with kind = SlotFillingsPlanItem, and obeys WorkPlan guardrails (no logs or actual fillings, no step logic).
CC-A15.3-02target_slot_bearing_description_ref is present and identifies a real slot-bearing description (kit or suite); SlotKinds in rows are interpreted only within that slot-bearing description.
CC-A15.3-02aIf the PlanItem is used as a reproducibility baseline and the slot-bearing description is edition-addressable, target_slot_bearing_description_ref is edition-pinned (e.g., …DescriptionRef.edition).
CC-A15.3-02btarget_slot_bearing_description_ref is a Description-scoped ref (e.g., MechSuiteDescriptionRef, …KitDescriptionRef) and MUST NOT target MechanismDefinitionRef.
CC‑A15.3‑02c (single slot-bearing description)A SlotFillingsPlanItem targets exactly one slot-bearing description via target_slot_bearing_description_ref. If multiple slot-bearing descriptions are involved, they MUST be represented by multiple PlanItems (one per slot-bearing description).
CC-A15.3-03described_entity_ref is present. If grounding_holon_ref or reference_plane is omitted, the omission must be unambiguously derivable from cited context publications or records (e.g., the pinned CG-frame and specification context).
CC-A15.3-03adescribed_entity_ref is a concrete RefKind (no generic “EntityRef” placeholder is introduced by this pattern).
CC-A15.3-04Context anchors are explicit at least to bounded_context_ref; if the fillings serve legality or selection, then CG-frame and path-slice anchors are present.
CC-A15.3-05Time is explicit: the item includes Γ_time_selector or Γ_time_rule_ref; “latest” or “current” without explicit Γ_time is nonconformant.
CC-A15.3-05aExactly one of Γ_time_selector and Γ_time_rule_ref is present (XOR); both-present or both-absent is nonconformant.
CC-A15.3-06planned_fillings is the authoritative source: each row is ⟨slot_kind, planned_filler, edition_pin?⟩; each planned filler is explicit ByValue vs ByRef(ref-of-concrete-RefKind) and conforms to the slot-bearing description’s SlotSpec discipline (no silent slot-meaning changes).
CC-A15.3-06aUnless the slot-bearing description declares a slot as multi-valued, planned_fillings contains no duplicate slot_kind rows (duplicate keys ⇒ nonconformant).
CC-A15.3-06bIf both a row and its ByRef(…) filler carry edition pinning, they MUST agree; mismatch ⇒ nonconformant.
CC-A15.3-07Any present “indices” (planned_*_ref_index) are derivable projections of planned_fillings and are not independently maintained; mismatch ⇒ nonconformant.
CC-A15.3-08The PlanItem contains no GateDecision or DecisionLog, and makes no claim that a crossing occurred; only expected policy pins may be stated.
CC-A15.3-09The PlanItem contains no FinalizeLaunchValues witness and no launch-time actuals; launch values are finalized only in Work enactment.
CC-A15.3-10If expected_usm_guard_pins includes USM.LaunchGuard, the PlanItem contains sufficient pins and references (explicit Γ_time_selector or Γ_time_rule_ref, pinned editions, evidence pin anchors, and guard_owner_gate_ref or an unambiguous derivation) to make downstream guard execution possible.
CC-A15.3-10aIn this pattern, “evidence anchors” are expressed as pin refs (e.g., SCR pins or RSCR pins). Do not introduce a generic EvidenceHookRef token here; use concrete pin refs.
CC-A15.3-11The PlanItem does not claim to set or mutate the edition vector (editions{…} or edition_key). It may pin editions and may state expected edition-sensitive crossings, but edition changes themselves are crossings (gate-level or work-level witnesses).
CC-A15.3-12When used as a baseline for enactment, execution-time deviations are recorded as Work variance and the baseline PlanItem is not rewritten (“no backfill”); the Work Audit cites the PlanItem (preferably by edition-addressable ref) as the planned baseline reference.
CC-A15.3-12aAny change to edition-pinned refs that would alter the effective edition-key for legality or selection MUST NOT be retroactively applied to the already-cited baseline PlanItem. Treat it as (i) a new PlanItem edition for subsequent enactments and (ii) variance or required crossing witnesses for the enactment that deviated.
CC-A15.3-13If expected_crossing_policy_refs is present, it contains references and policy identifiers only (BridgeCardRef + policy-id refs + plane ids); it MUST NOT embed CL, Φ, Ψ, or Φ_plane tables or introduce non-Bridge transport edges.
CC‑A15.3‑13a (crossing bundles are not witnesses)expected_crossing_bundle_refs (if present) is used only to cite already‑published, context‑constant CrossingBundle baselines; it MUST NOT be used to claim that a crossing occurred for this enactment, nor to substitute for gate-level or work-level crossing witnesses.
CC‑A15.3‑14 (view projection discipline)Any U.View projection of a SlotFillingsPlanItem (e.g., TechCard(PlanItemRef), PlainView(PlanItemRef)) MUST be an explicit projection that introduces no additional claims, defaults, or rows beyond the PlanItem; any additional semantics on the view is nonconformant.
CC-A15.3-15Lower, repair, and refresh conditions are explicit: missing target description, SlotKind interface, EntityOfConcern, context, time, concrete RefKind, edition pin, guard pin, evidence pin, crossing policy, or cited-baseline variance lowers or reopens the planned-baseline claim rather than widening it.

Common Anti‑Patterns and How to Avoid Them

Plan-as-execution

A plan document says: “Use the latest CG-Spec and the current best comparator; compute scores and launch.” This is nonconformant because it omits explicit Γ_time, omits edition pins, collapses planning into execution, and provides no stable baseline for variance and audit.

Anti-example: Edition-key change disguised as a plan edit (backfill)

A team executes Work while actually using CGSpecRef@edition(E2) (or ComparatorSetRef@edition(E2)), but the previously approved baseline PlanItem had pinned @edition(E1). Later, instead of recording variance and the required GateCrossing witness for the edition-key change, someone edits the baseline PlanItem “in place” to replace E1 → E2, and then claims “no variance; we followed the plan”.

This is nonconformant because it:

  • collapses planning into execution (retroactive baseline editing),
  • hides an edition-key change that is crossing-relevant,
  • destroys reproducibility and breaks Work and audit traceability.

Correct handling: keep the old baseline intact; record variance in Work and, where applicable, require the gate-level or work-level crossing witness (UTS and CrossingBundle with policy-id pins), or produce a new PlanItem edition as the new planned baseline for subsequent enactments.

Consequences

BenefitTrade-off and costNotes and mitigation
Improved modularityRequires an explicit baseline plan itemKeep baselines minimal; specialise only when a suite truly needs it.
Audit clarityMore up-front specification workThe explicit-writing workload is intentional: it buys attributable variance and prevents “mystery defaults”.
Edition honestyForces practitioners to declare editions and timeUse editioned refs and time selectors by ref; keep actual Γ_time in Work evidence.
Controlled specialisationMultiple PlanItem kinds may exist (core + suite‑specialised)Create a suite-specific refinement only when the suite description requires it; keep the universal core stable.

Rationale

This pattern exists to give WorkPlanning an explicit, citeable place to commit to “which planned values or references will fill which slots” without collapsing into run-time state.

Keeping the baseline bound to exactly one slot-bearing description makes SlotKind semantics checkable and prevents accidental cross-slot-bearing-description drift.

Treating indices as derived projections preserves the canonical row source while still enabling human-friendly navigation or tooling acceleration.

Finally, by disallowing run-time witnesses (launch values, observed values, concrete Γ_time) the pattern enforces the planning and enactment split and keeps audit variance attributable to an explicit baseline rather than to shifting defaults.

SoTA‑Echoing (informative)

This pattern aligns with post‑2015 practice in multiple traditions while deliberately staying notationally and tool independent.

  • ISO/IEC/IEEE 12207:2017Adopt the separation between planning documents, execution records, and baseline and change-control concepts; Adapt them into a lightweight, citeable PlanItem kind; Reject treating one process-tooling arrangement as normative inside FPF.
  • ISO 26262:2018Adopt the emphasis on traceability, change impact visibility, and preventing retroactive “paper compliance”; Adapt it into baseline immutability + variance reporting; Reject treating safety certification structure as a required envelope for all contexts.
  • NIST SP 800-128 Rev.1 (2020)Adopt baseline management and deviation recording as an audit primitive; Adapt by expressing baselines as epistemic, context-bound references rather than machine configuration states; Reject security-tooling prescriptions as a dependency of the conceptual model.
  • Forsgren, Humble, Kim (2018), AccelerateAdopt the empirical lesson that explicit change tracking and small, attributable deltas improve reliability; Adapt by making the baseline the anchor for fulfilment and variance; Reject any “one true pipeline” or vendor-specific operational recipe.
  • Morris (2021), Infrastructure as Code (2nd ed.)Adopt the desired-state vs observed-state distinction and the discipline of explicit declarations; Adapt by keeping declarations as plan-level epistemes rather than deployment manifests; Reject binding the model to any specific IaC syntax or platform.

Relations

  • Builds on and is governed by:
    • A.15.2 U.WorkPlan — container + PlanItem discipline; baseline citeability.
    • A.6.5 slot discipline — SlotKind and RefKind hygiene and binding-time separation.
    • E.10.D1 Context discipline — explicit context and edition; no implicit “latest”.
    • E.18 and TGA — keeps FinalizeLaunchValues strictly in WorkEnactment; pin and guard discipline.
  • E.17 publication discipline — views are projections; no new semantics on cards.
  • Interacts with and complements:
    • A.6.7 MechSuiteDescription — suites may require the presence of a planned-baseline reference or pin without embedding planned fillers or launch values.
    • A.15.1 Work and WorkEnactment discipline — fulfilment and variance are recorded downstream against this baseline.
    • C3.2-S-02 Time discipline — time selection policy may be pinned by ref; run-time Γ_time stays in Work evidence.

P2W Planned-Baseline Use Relation

When E.18.1 reaches a planned-baseline question, SlotFillingsPlanItem records the planned mapping from a slot-bearing description and SlotKinds to planned fillers. It may include evidence-reference hooks, edition pins, assumptions, dependencies, and freshness requests needed before work is enacted.

If the same phrase also carries launch-value, run-time actual, evidence, gate, or result meaning, the carry-through record names that separate relation before the PlanItem is used downstream.

Planned-Baseline To Performed-Work Boundary

A performed U.Work occurrence may cite a SlotFillingsPlanItem as the planned baseline for slot fillers. The performed-work record states variance, substitution, and launch-value finalization under the current gate relation and work-governing patterns.

This preserves the P2W split: WorkPlanning places the baseline, while performed work records what happened.

Lowering, Repair, and Refresh Conditions

Lower a SlotFillingsPlanItem claim when the item cannot name exactly one Description-scoped slot-bearing description, concrete SlotKinds from that description, described_entity_ref, bounded_context_ref, time selector or time rule, authoritative planned-filling rows, concrete RefKinds for ByRef fillers, or required edition pins. Do not repair the missing detail by widening the planned-baseline claim; lower it to a plan cue, source-gap note, relation governed by another FPF pattern, or blocked kind-definition gap.

Repair the PlanItem when a source-currentness change alters the slot-bearing description edition, SlotKind interface, planned filler, concrete RefKind, edition pin, context anchor, time rule, evidence pin, guard pin, crossing-policy reference, or expected gate relation. If a performed U.Work occurrence already cited the PlanItem as a baseline, preserve the cited baseline and record variance or crossing witnesses in the work-governed relation rather than rewriting the cited baseline to match what happened.

Refresh before the PlanItem is used for work enactment, launch guard preparation, cross-context comparison, suite or kit reuse, Part G universalization, publication-view projection, evidence-reference use, or P2W carry-through. Stop the refresh at the smallest changed object: the plan item, its target slot-bearing description, a concrete RefKind, the cited source edition, the performed-work variance record, or the related gate, evidence, bridge, or publication relation.

A.15.3:End

Work-Relevant Source Restoration

Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative

At a glance. This A.15 cluster member tells an engineer-manager which project-side FPF kind, relation, and reference must be recovered before an encountered episteme, episteme publication, display, credential view, generated explanation, copied statement, provenance mark, dashboard tile, schema wording, API wording, or composed source chain may justify a work claim or reliance claim.

Use this when. Use this pattern when a visible item is about to guide a work move, reliance move, or work-relevant P2W claim by appearance, and the acting user must recover the project-side FPF kind and reference named by value before proceeding.

First output. One compact restoration note: encountered item; live work claim, reliance claim, work-relevant P2W claim, or P2W chain position; pattern that governs the claim being made or effect; project-side FPF kind and reference named by value needed; admissible next project move now; and blocked overread.

What goes wrong if missed. Teams let a dashboard, credential view, copied approval, generated explanation, provenance mark, schema wording, API wording, publication, display, or cue carry a work or reliance source relation by appearance. Work then proceeds or stops while the pattern and project-side reference that actually carry the claim or effect are missing, stale, revoked, or contradicted.

Primary EntityOfConcern in plain terms. One source-restoration relation for one live work claim, reliance claim, work-relevant P2W claim, or P2W chain position: encountered item, claim being made or effect, pattern that governs that claim or effect, project-side FPF kind and reference named by value needed, admissible next project move now, and blocked overread. It does not introduce a new source kind, evidence path, gate record, engineering-justification record, work occurrence, or generic publication kind.

First admissible project move in plain terms. Recover or name the pattern that governs the claim being made or effect, project-side FPF kind and reference named by value, and live relation before allowing the encountered item to guide work or reliance. When that relation is absent or insufficient, narrow the move, reopen or refresh the source, run only a bounded reversible probe under a work plan, or block the unsupported claim or effect.

Recognition block vs assurance block. Read At a glance, Use this when, First output, What goes wrong if missed, Primary EntityOfConcern, First admissible project move, Working action path, Not this pattern when, and What this buys as the primary recognition block. Read the field tables, lookup table, lint cues, stress cases, conformance checklist, SoTA alignment, and relations below as assurance blocks and companion material that tighten the same source-restoration claim; they do not widen this pattern into an evidence, gate, engineering-justification, speech-act, commitment, boundary, or work-occurrence pattern.

Working action path.

  1. Name the encountered source kind and publication position without treating its appearance as the source relation itself.
  2. Name the live work claim, reliance claim, work-relevant P2W claim, or P2W chain position and the claim or effect that would be carried.
  3. Recover the pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that carry that claim or effect.
  4. Choose the lightest admissible project move now: proceed inside the recovered relation named by value, narrow the move, run a bounded reversible probe under U.WorkPlan, reopen or refresh the source, ask the accountable role assignment to expose or repair the missing source episteme, publication, register entry, or project record, or block only the unsupported claim or effect.
  5. Return to A.15 only when the remaining question under repair is U.Role, U.Method, U.MethodDescription, U.WorkPlan, and U.Work separation.

Not this pattern when. Stay in A.15 when the live problem is only U.Role, U.Method, U.MethodDescription, U.WorkPlan, and U.Work separation. Stay in E.17 when the live problem is only publication-face exposure or multi-view publication. Stay in A.10, B.3, A.20, A.21, A.2.8, A.2.9, A.6, or A.15.1 when evidence, currentness, engineering justification, gate validity, constraint validity, commitment, speech act, boundary claim, or work occurrence already governs the claim being made or effect directly.

What this buys. The acting engineer-manager can keep work moving at the lightest admissible level: proceed inside the recovered relation named by value, narrow the move, run a bounded reversible probe under a work plan, reopen the needed project-side FPF kind and reference named by value, ask the role assignment accountable for that source to expose or repair it, or block only the unsupported claim or effect while preserving narrower admissible use.

Problem Frame

Dashboards, credential views, generated explanations, copied approvals, provenance labels, green tiles, schema wording, API wording, and composed source chains often look ready for action before the pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that make the action or reliance admissible have been recovered. The practical problem is not to classify the item in FPF; the problem is to decide what an engineer-manager may do in the project now without turning appearance into approval, gate passage, evidence, assurance, performed work, or release permission.

Plain recognition line. Let the visible cue point to the relation named by value, source episteme, source publication, evidence path, gate decision, role record, status record, work occurrence, or assurance claim; do not let it become the relation that permits the work or reliance move. Source wording discipline. In this pattern, source is not a generic kind. When the word has FPF-governed use, recover the kind named by value before allowing work or reliance: source U.Episteme, source U.EpistemePublication, project-side FPF kind and reference named by value, evidence path, gate decision, speech act, commitment, credential record, status record, role assignment, work-occurrence record, register entry, source-finding cue, source relation, repair record, or request record. If that kind named by value cannot be named, keep the encountered item at cue-only orientation or source-finding use and do not use it as a work relation or reliance relation.

Cluster Boundary

A.15 remains the kernel for separating U.Role, holder and context, U.Method, U.MethodDescription, U.WorkPlan, and actual U.Work. A.15.4 starts only when an encountered item begins to justify a work claim or reliance claim and the team must recover the project-side FPF kind and reference named by value that carries that claim, effect, or relation. If the pattern and project-side reference that govern the claim being made or effect are already known, use them directly and keep A.15.4 as the bounded restoration step.

Work-Relevant Source Restoration

Core stress-case rule

Ordinary source-restoration note. In ordinary use, do not build a source dossier. The first useful note is:

encountered item; live work claim or reliance claim; pattern that governs the claim being made or effect; project-side FPF kind and reference named by value needed; admissible next project move now; blocked overread

The encountered item may be a tile, credential view, approval-looking memo, generated explanation, copied review, provenance mark, API wording, functional-description publication, or composed source chain. The pattern asks whether the work claim or reliance claim named by value is currently carried by a project-side FPF kind and reference named by value, not whether the item is impressive, fluent, or easy to inspect.

Conditional source-relation field set. Use the fuller fields below only when release, safety, compliance, role, status, gate, assurance, contested source, external reliance, cross-context reuse, currentness, revocation, generated source relation, or copied source relation is live. These fields are local restoration aids, not a new record kind.

FieldWorking question
subject or actorWho or what would perform the work, rely on the item, hold the status, or be affected by the claim?
roleWhich U.RoleAssignment or role-context claim is live?
guided action or work itemWhich selected method, method of work, U.WorkPlan, planned work, actual U.Work, work result, release move, reliance move, status, or effect is being guided?
affected resource or claimWhich resource, claim, gate, credential, status, evidence, approval, or source finding with authority-reference relation is supposedly affected?
contextWhich bounded context, environment, project slice, interface setting, protocol setting, or relying situation makes the claim live?
policy or gate versionWhich policy, gate profile, constraint version, method version, or register edition is supposed to govern the claim?
time windowDuring which window is the claim, effect, source relation, or admissible-use boundary claimed to hold?
currentness or revocation fieldIs the source relation current, stale, revoked, superseded, expired, contradicted, or unknown?
issuer or sourceWhich issuer, project-side FPF kind and reference named by value, register source, status source, speech act, gate decision, evidence path, or work-occurrence record carries the claim, effect, source relation, or admissible-use boundary?
verifier or relying contextWho is checking or relying on the claim, and in which context?
evidence or attestation pathWhich A.10 evidence, provenance, or attestation path, if any, justifies the claim without itself becoming approval, gate passage, assurance, or work occurrence?
sourceRelationClassWhich E.17:5.1b source-relation class or claim-admissibility class applies to the encountered item and required claim or use?
unsupported effectWhich requested work claim, reliance claim, or downstream effect remains unsupported and must be narrowed, repaired, reopened, probed, or blocked?

Start with the A.15.4 working action path above when the encountered item is about to guide a work move, reliance move, or work-relevant claim. If the issue under repair is only evidence, currentness, gate validity, constraint validity, engineering justification, commitment, speech act, boundary wording, admissibility wording, credential proof, status proof, explanation, comparison, or carrier and front-end behavior, apply the pattern that governs that issue under repair and project-side FPF kind and reference named by value directly; use A.15.4 only when that source must be restored before role, method, plan, work, work result, result measurement, or another work move or reliance move can proceed.

Authority-looking source-backed work or reliance case. Use A.15.4 when an approval-, permission-, gate-, command-, credential-, delegation-, revocation-, status-, provenance-, dashboard-, copied-review-, generated-explanation-, schema-, API-, or composed-chain case is about to be used as a work cue, reliance claim source, release-reliance claim source, execution-evidence source, approval-claim source, approval-effect source, role-claim source, status-claim source, or next work-relevant move. The recognition moment is that an encountered publication, display, credential view, wording, or explanation looks like permission, prohibition, readiness, or evidence for starting work; the question under repair is still the live work claim, reliance claim, work-relevant P2W claim, or P2W chain position plus the pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that carry that claim or effect being inferred from, or through, the wording, display, publication face, carrier, or source-finding cue. It is not the wording alone. A.15.4 does not change the primary EntityOfConcern of A.15; it guides only the source-restoration step before the encountered case can guide work or reliance.

Here "authority-looking case" is only a recognition phrase for the encountered situation; it is not a U.* kind, not an assurance tuple, not a measured value, and not a new source kind or project record. The source-backed project-side kind or record that permits, forbids, records, or carries the work-relevant claim may instead be a GateDecision, SpeechAct, U.Commitment, RoleAssignment, credential record, status record, A.6.B-claim being made, A.10 evidence path, or B.3 assurance claim. Use E.17:5.1c for the shared meanings of orientation use, reliance use, work claim, reliance claim, operative claim, unsupported downstream use, and reopen trigger; use E.17:5.1d when the primary question under repair may belong to another pattern that governs the claim being made or effect with its project-side FPF kind and reference named by value.

The central behaviour is: name the live work claim, reliance claim, work-relevant P2W claim, or P2W chain position; name the pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that carry that claim or effect; keep the U.Episteme or U.EpistemePublication distinct from publication form, MVPK face, carrier, rendering, and source-finding cue; choose the minimum sufficient next move; recover only the project-side FPF kind and reference named by value needed for that move; and do not raise the claim beyond that recovered relation, source, or admissible-use boundary. If the named project record states the governing FPF relation, use that recorded relation directly rather than inferring it from wording.

Positive repaired path. An encountered U.Episteme publication, publication form, MVPK face, carrier, rendering, or source-finding cue may guide work or reliance only to the claim or effect carried by the recovered project-side FPF kind and reference named by value, actor or role, live work claim, reliance claim, work-relevant P2W claim, or P2W chain position, affected work item, context, window, and source-recoverable claim or effect. The repaired outcome is the smallest admissible work or reliance statement plus the unsupported work claim or reliance claim still blocked.

Reliance disposition by pattern that governs the claim being made or effect and project-side FPF kind and reference named by value:

Work or reliance dispositionUse whenMinimum useful record
Orientation or source-finding noteThe encountered item is only a publication face, carrier, rendering, cue, search handle, learning aid, or reversible local probe trigger.encountered item; required claim or effect not yet carried by a recovered source; source to reopen; stop condition.
Routine reliance noteThe team needs ordinary bounded reliance without release, safety, compliance, delegated role or status claim, contested source, or cross-context reuse.Live work claim, reliance claim, work-relevant P2W claim, or P2W chain position; required claim or effect; actor or role; affected work item, context, and window; visible source ref; and reopen condition.
High-impact reliance pathThe required claim or effect is external-impact, irreversible, release-bearing, gate-bearing, compliance-bearing, safety-bearing, delegated, revoked, status-claim-bearing, generated-source-mediated, copied-source-mediated, provenance-mediated, contested, or cross-context.Exact project-side FPF kind and reference with the live A.10, A.6, B.3, A.2.9, A.2.8, A.21, A.20, or A.15.1 fields needed for that claim or effect.

A small A.15.4 restoration note is enough for the first disposition:

FieldValue
live work claim, reliance claim, work-relevant P2W claim, or P2W chain positionName the live work claim, reliance claim, work-relevant P2W claim, or P2W chain position exactly: method-family selection, selected method, method of work, work plan, planned work, actual U.Work, work result, result-measurement, release reliance decision, or non-work reliance claim. A planned baseline remains a U.WorkPlan or U.WorkPlanning plan record; actual execution becomes U.Work only after it occurs and is recorded under A.15.1; work-result measurement belongs with the evidence or result-measurement source. This row is a local restoration label unless it cites an existing FPF kind or governing FPF relation.
pattern that governs the claim being made or effect and project-side FPF kind and reference named by valueApproval, permission, gate passage, role or status currentness, work occurrence, evidence relation, assurance claim, boundary claim, or other claim named by value or effect needed before that work claim, reliance claim, or P2W chain-position claim can be treated as carried by a recovered source. The governing relation must be carried by the named FPF pattern and recovered project-side reference, not by a new A.15.4 kind.
actor or roleWho would act or rely.
affected work item, context, and windowRelease, service, person, role holder, work item, claim, tenant, environment, physical batch, construction element, machine state, or validity window affected by that class or claim.
claim-bearing episteme or episteme publicationThe claim-bearing FPF kind is U.Episteme or a species such as U.EpistemePublication; if the encountered item is only a publication form, MVPK face, carrier, rendering, PublicationUnit, dashboard tile, copied text, credential view, generated explanation, API wording, or cue, name that kind named by value separately.
project-side FPF kind and reference named by value needed or safe next moveSource U.Episteme, source U.EpistemePublication, register entry, or project-side FPF kind and reference named by value to reopen; status to refresh; reversible probe; role assignment accountable for exposing or repairing the missing source; or narrower admissible use.
stop or reopen conditionWhat blocks the work claim or reliance claim and what would reopen it.

Borrowed episteme and publication discipline. A.15.4 borrows the C.2.1, E.17, and A.16.0 distinction rather than minting a new generic U.* kind. The claim-bearing FPF kind here is U.Episteme; U.EpistemePublication is used only when that episteme is available as a published episteme with MVPK-face references. Publication forms, MVPK faces, carriers, renderings, PublicationUnit instances, and source-finding cues are separate kinds or roles in the case. A planned baseline remains a U.WorkPlan or U.WorkPlanning plan record such as SlotFillingsPlanItem; launch values and finalization values remain their own project records, decision logs remain gate or decision records, execution evidence remains evidence, and actual work occurrences remain A.15.1 or U.Work matters.

When the required project-side FPF kind and reference named by value is incomplete, choose one admissible degraded-operation move after naming the live work claim, reliance claim, work-relevant P2W claim, or P2W chain position and the pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that carry that claim or effect; pick the lightest move that preserves practical work and source recoverability:

  1. Use the encountered item only for orientation or source-finding.
  2. Reopen the required source U.Episteme, source U.EpistemePublication, register entry, or project-side FPF kind and reference named by value, or refresh status or currentness.
  3. Narrow actor or role, requested operation or work class, affected work item, affected resource, affected claim, context, and window until the recovered source really covers the move.
  4. Run a bounded reversible probe under an explicit U.WorkPlan when no external-impact reliance is being made.
  5. Ask the role assignment accountable for the issuer, gate decision, evidence path, role record, status record, or boundary claim set to expose or repair the missing source.
  6. Repair the U.WorkPlan, U.MethodDescription, dashboard label, source link, or boundary wording that made the overread plausible.
  7. Proceed only inside the recovered scope and window.
  8. Block only the work claim or reliance claim that lacks source relation.
Repair assignment rule

Broken-source repair assignment. If the required project-side FPF kind and reference named by value is unavailable to the acting user, assign only prospective repair work, request work, decision work, work-plan work, or source-gap work to the role assignment accountable for the missing source relation. The acting user records the blocked work claim or reliance claim, the missing source relation, and the safe narrowed move now.

Encountered-item kind check. First name whether the encountered item is a U.Episteme, U.EpistemePublication, publication form, MVPK face, carrier, rendering, PublicationUnit, dashboard tile, credential view, generated wording, copied wording, or source-finding cue. If the item exposes a project-side FPF kind and reference named by value, use that exposed source directly. If only the display face, carrier, wording, or cue is named, the A.15.4 disposition is orientation, source-finding, bounded reversible probe, source-repair request, or blocked unsupported reliance until the source relation named by value is recovered.

Pressure guard. Release pressure, delegated pressure, compliance pressure, color, salience, copied wording, or generated wording does not replace the source relation named by value. A dashboard tile may guide release only as a current view of the relevant GateDecision plus evidence path, currentness path, scope, and window.

Exact project-side FPF kind and reference lookup table

Exact project-side FPF kinds and references by required claim or effect kind:

  • cue-only orientation: use only for attention, learning, source-finding, or a reversible local probe trigger; stay with A.16, A.16.1, or A.6.A when those claims are being made.
  • issuing, approval, authorization, delegation, or revocation act: cite A.2.9 U.SpeechAct or SpeechActRef, including act type, actor, role, affected work item or claim, judgement context, window, carrier reference, evidence reference when currentness matters, and instituted effects if claimed. Because U.SpeechAct <: U.Work, it can evidence only that communicative act.
  • deontic permission, obligation, prohibition, or recommendation-as-duty: cite A.2.8 U.Commitment and the instituting SpeechActRef when provenance matters. If the word instead names admissibility, gate passage, authorization act, role effect, status effect, credential status, cue, or advice, use the pattern that carries that kind named by value.
  • role or status reliance: cite A.2.1, U.RoleAssignment, a status-changing U.SpeechAct, a governing context-state record, a credential proof or status result under A.10, or an A.21 GateDecision when the status is gate-governed.
  • boundary, policy, API, schema, "allowed", "authorized", "approved", "recommended", or "guaranteed" wording: split the statement through A.6 or A.6.B; use A.6.C, A.2.3, A.2.8, and A.2.9 for agreement-like guarantee, SLA, or promise wording before work use or reliance use.
  • gate decision or gate passage: cite A.21 OperationalGate(profile), GateDecision, GateDecisionRationale, DecisionLogRef, gate profile, gate version, check set, scope, window, and replay or freshness pins.
  • constraint or flow-validity witness: cite A.20 ConstraintValidity status, witness, GateCheckRef.aspect = ConstraintValidity, path, window, sentinel, and pins where live.
  • release, deployment, repair, inspection, or rollback work occurrence: cite A.15.1 dated U.Work occurrence and the A.10 evidence carrier path when reliance on occurrence is needed.
  • evidence, provenance, authenticity, currentness, copied-source, or generated-source relation: apply A.10 and name the claim-bound evidence path, currentness path, and admissible or non-admissible use.
  • assurance, readiness, safety, compliance, trust, release confidence, or R, F, G, or CL increase: apply B.3 and name the typed assurance claim plus its limitations and reopen condition.
  • generated explanation: use E.17.EFP for explanation faithfulness or source-finding relation, then require A.10 claim-bound source relation for every operative claim that will be relied on.
  • ambiguous approval, permission, or authorization wording: choose among the rows above named by value by asking what effect is claimed now: speech act, commitment, admissibility predicate, gate passage, role or status change, credential status, evidence relation, assurance claim, or work occurrence.

Return products for loop closure:

Governing source relation usedReturn product for this A.15.4 restorationA.15.4-local use
A.6 or A.6.BTyped claim IDs (L-*, A-*, D-*, and E-*) plus the pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that carry that claim or effect.Use for wording, boundary, API, schema, or admissibility recovery before work or reliance use.
A.10Claim-bound evidence path, freshness field, currentness field, and admissible or non-admissible use for the attempted claim.Use for evidence, provenance, authenticity, credential-currentness, copied-source, or generated-source recovery.
B.3Typed assurance claim, no-assurance-use disposition, or rejected or downgraded assurance claim.Use only when the live project move relies on a typed assurance claim.
A.21OperationalGate(profile), GateDecision, DecisionLogRef, gate profile, gate version, scope, window, and replay or freshness pins.Use for gate-passage reliance in the named scope and window.
A.20ConstraintValidity status, witness, path, window, sentinel, and pins where live.Use for constraint-validity or flow-validity reliance.
A.2.9SpeechActRef with act type, actor, role, affected work item or claim, judgement context, window, and instituted effects if claimed.Use for issued acts and, where needed, dated occurrence of that communicative act.
A.2.8U.Commitment deontic relation with accountable role, agent, referents, modality, scope, validity window, and instituting source when needed.Use for deontic permission, obligation, prohibition, or recommendation-as-duty.
A.15.1Dated U.Work occurrence plus evidence carrier path when relied on.Use for reliance on performed work.
E.17.EFPExplanation class, source-finding relation, and faithfulness relation over the source U.Episteme or source U.EpistemePublication.Use for generated-explanation faithfulness and source-finding before operative reliance.

High-impact work or reliance - especially external-impact, irreversible, release-bearing, role-bearing, status-claim-bearing, gate-bearing, compliance-bearing, safety-bearing, delegated, contested, or assurance-bearing claim or effect - is admissible only for the actor, role, live work claim, reliance claim, work-relevant P2W claim, P2W chain position, affected work item or claim, audience, scope, environment, version, policy context, operational mode, and time window for which the required FPF-governed project source, relation, evidence path, gate decision, or assurance claim is recoverable. Cue-only, source-finding, learning, and bounded reversible probes stay lightweight and do not require a full source dossier.

Quick dispositions:

Encountered caseFirst A.15.4 disposition
Source-backed release dashboard tileIf the tile is a current dashboard view of A.21 GateDecision or DecisionLogRef plus release scope or work item, environment, scope, window, gate profile, gate version, and A.10 evidence path, it may carry gate-passage reliance for that release and environment.
Unsourced or stale release dashboard tileDisplay or source-finding only until the current GateDecision or DecisionLogRef, release scope or work item, scope, window, gate profile, gate version, and A.10 evidence path are recoverable; use B.3 only if an assurance claim is live.
Copied review summary or copied approvalCopied wording and copied-currentness cue at most; approval, authorization, permission, commitment, or work occurrence needs the original A.2.9 SpeechActRef, A.21 decision, A.2.8 commitment, or A.15.1 work source plus A.10 evidence.
Delegation chain with forwarded approvalEach link names delegator, delegatee, delegated operation or work class, affected work item, affected resource, affected claim, scope, window, source permitting delegation, subdelegation allowance if any, revocation source, currentness source or currentness path, and evidence path. A forwarded approval is not delegated authority by copy alone.
Role, revocation, or status displayResolve to role assignment, status-changing speech act, context-state record, credential proof or status result, or gate decision with freshness field, revocation source, or revocation record; visual status cannot defeat a higher-priority revocation or supersession source.
Conflicting sourcesDo not resolve by color, visual salience, copied wording, or apparent recency. Name source order, governing decision source, freshness policy, and supersession rule; the work claim, reliance claim, or effect is contested until resolved, while source-finding and bounded reversible probes remain available.
Credential badge or register-backed status viewUse the display as a publication of a credential source or status source, not the source itself. Find the governing status register or issuer, trust anchor, holder binding or subject binding, verifier context, relying context, proof or status result, revocation, freshness, and validity window. If the governing register entry itself creates or changes role, status, permission, duty, or gate effect in the bounded context, cite that register or status-source entry named by value and the A.2.1, A.2.8, A.2.9, A.6.B, or A.21 source it depends on. Otherwise rely only on credential-currentness for that holder and context.
Rollback command-like cueTreat as cue or A.6.A-governed invitation unless exact command, authorization, work occurrence, execution result, or gate decision is recoverable.
Generated explanation says "authorized"Explanation may help find sources; it does not issue, approve, revoke, commit, authorize, pass a gate, evidence execution, or raise assurance. A citation or source mention inside the explanation guides work use or reliance use only when the cited carrier carries that relied-on claim named by value in the relying context under A.10.
Extracted source, rewrite, representation shift, explanation, then gate or release claimReopen the most directly claim-bearing project-side FPF kind and reference named by value at the first lossy or non-commutative transform step; the gate claim or release claim waits for the required transform record, evidence path, explanation relation, gate decision, or assurance claim.
Repeated green-tile failures without recoverable source relationTreat recurrence as upstream source-system repair work: expose decision refs, fix dashboard semantics, add source links and currentness, revise boundary wording, or add review cues so the acting user is not repeatedly forced to reconstruct missing source relation.
Worked dashboard and approval examples

Worked dashboard and approval slice:

A release dashboard shows a green approval-looking tile for Release-2026.05.08-prod. If the tile is a current view of the relevant GateDecisionRef plus evidence path and currentness path, it may carry bounded gate-passage reliance for that release scope and window. Execution or deployment still requires an A.15.1 work-occurrence source if the claim is that deployment happened. If the gate source is missing or stale, treat the tile as orientation and source-finding until the team can name the live release-work claim, live release-work position, pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that carry that claim or effect, and project-side FPF kind and reference named by value that carries the gate decision, evidence path, and currentness path.

StepRequired move
Required project claim or effect kindRelease reliance, gate passage, compliance proof, assurance increase, evidence relation, or currentness relation.
Gate decision sourceCite the current A.21 GateDecision or DecisionLogRef, gate profile, gate version, release scope or work item, scope, window, and replay or freshness pins. Without that source, the tile is not release permission or gate passage.
Constraint or flow-validity sourceCite A.20 ConstraintValidity status or witness only when the claim is about constraint or flow validity, not about the gate decision itself.
Evidence and currentness sourceUse A.10 for the dashboard query, carrier integrity, evidence refs, time, window, freshness field, revocation source or revocation record, verifier context, relying context, and rival explanation such as stale display or copied status.
Assurance sourceUse B.3 only if the tile is being used to raise readiness, compliance, trust, safety, release confidence, R, F, G, or CL; otherwise no assurance tuple is live.
Admissible repaired useWith the decision and evidence path recovered, rely on gate passage only for the named release scope or work item, environment, gate profile, gate version, time, and window; a claim that deployment happened still needs an A.15.1 work-occurrence source.
Blocked overreadsThe dashboard color does not create approval, permission, compliance proof, rollback success, work occurrence, or assurance by display.

Approval memo green path:

An approval memo may carry an approval claim when it exposes the A.2.9 SpeechActRef, actor, role, affected release scope or work item, judgement context, time, window, carrier refs, evidence refs, and instituted effect being claimed. That carries the bounded approval claim or effect only. It does not prove that release, deployment, rollback, or other work occurred; that execution claim still needs the dated A.15.1 work-occurrence source plus any A.10 evidence path required for the relying context.

Credential and status green path:

A credential or status response may carry holder reliance, status reliance, or currentness reliance only inside the issuer or governing status register, holder binding or subject binding, verifier context, relying context, proof result or status result, revocation source or revocation record, freshness field, and validity window that it exposes. It does not by itself carry release, work occurrence, gate passage, engineering justification, evidence for underlying operational facts, or contextual permission; those uses require the project-side FPF kind and reference named by value that governs that claim or effect.

Role prompts:

Role in the situationPrompt
Acting userWhat can I safely do next without turning the encountered episteme or episteme publication into unsupported work or reliance justification?
Release engineerWhich A.21 gate decision, decision log, release scope, work item, and A.15.1 work occurrence are separate here?
Issuer, gate, evidence, or role sourceWhat source, status, decision ref, or evidence path must be exposed or repaired?
Auditor or reviewerWhich evidence path, decision ref, speech-act ref, commitment, work occurrence, or assurance claim must be recoverable?
Boundary claimantWhich words need typed claim IDs before they can guide work or reliance?
ManagerIs repeated ambiguity a source-system repair item rather than another manual check for the acting user?
LLM user or tool userWhich project-side FPF kind and reference named by value does the explanation help find, and which operative claims still need an A.10 claim-bound source relation?
Security or compliance sourceWhich revocation, currentness, proof, status, source order, or supersession source must be exposed?
Model or data sourceWhich intended use, evaluation condition, version, window, limitation, and evidence path bound the model or data documentation?
Assurance reviewerWhich named claim actually has a B.3 assurance claim, with what assurance tuple, evidence path, limitations, and reopen condition?
Search aliases for A.15.4 include: approval, approval-looking display, authorization, authorization-looking display, permission, permission display, allowed wording, green dashboard, release tile, release readiness, model card, datasheet, data card, provenance, provenance mark, attestation, attestation label, credential, credential badge, generated explanation, copied review, copied approval, review summary, compliance-looking mark, delegation, delegation display, revocation, revocation status, gate passed, gate passage, rollback successful, rollback cue, and assurance label. These are search handles only; decide the carrying project-side FPF kind and reference named by value and pattern or source relation that governs the claim being made or effect from the live work question or reliance question, not from the displayed word or carrier name or source name.

Work and reliance disposition table for authority-looking cases:

Live questionStart inFirst useful output
Can this encountered episteme publication, publication face, carrier, rendering, or cue guide work or reliance?A.15.4Candidate next U.WorkPlanning, U.Work, or reliance move, pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that carry that claim or effect, minimum admissible next move, and project-side FPF kind and reference named by value needed.
Is the problem boundary, policy, API, schema, or connector wording?A.6 or A.6.BTyped L-*, A-*, D-*, and E-* claims before the work claim or reliance claim is used.
Is the problem evidence, currentness, provenance, credential status, generated-source relation, copied-source relation, or source-chain recovery?A.10Claim-bound evidence path, currentness path, and admissible or non-admissible use.
Is the problem assurance, readiness, safety, compliance, trust, release confidence, or change in R, F, G, or CL?B.3Typed assurance claim, no-assurance-use disposition, or downgraded or rejected assurance use.

Display guidance for bounded status: a visible status meant to guide work should expose source type, reference or link named by value, freshness, window, scope, unsupported work claim, unsupported reliance claim, and unsupported effect. For example, prefer Gate check passed; GateDecisionRef; release scope; environment; window; not compliance proof, rollback success, or assurance increase over a bare approval-looking label.

Incident-learning fields for authority-looking overread: encountered episteme or episteme publication, live work claim, reliance claim, work-relevant P2W claim, or P2W chain position, pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that carry that claim or effect, actor, role, affected work item or claim, context, window, missing or stale source U.Episteme, source U.EpistemePublication, register entry, or project-side FPF kind and reference named by value; governing FPF relation or role assignment accountable for exposing or repairing that missing source, plausible overread, safe disposition used now, and upstream repair item for the source, dashboard, explanation, credential view, boundary wording, publication face, or carrier.

Contestability and redress path: when an authority-looking case affects person or team status, access, assignment, responsibility, release blockage, compliance claim, or safety-impacting work, name the review path or redress path before the work claim or reliance claim hardens. The path should name the disputed source or claim, the role assignment accountable for refreshing or correcting that source, the evidence path or status path to reopen, the safe interim disposition, and the time and window for review.

Lintable overread cues:

| Lint signal | Governing relation named by value |

| --- | --- | | approved, authorized, allowed, recommended, or guaranteed in boundary, API, schema, or policy wording | Split through A.6 or A.6.B into L-*, A-*, D-*, and E-*; use A.6.C, A.2.8, and A.2.9 for agreement-like wording where live. | | Dashboard tile, status color, or release tile used as release evidence or gate passage | Require A.21 GateDecision or DecisionLogRef plus A.10 evidence path and currentness path. | | Credential screenshot or badge used as permission, authorization, role relation, or status relation | Require A.10 issuer, holder, verifier, status, currentness, and relying-context fields, then exact A.2.8, A.2.9, A.2.1, A.6.B, or A.21 source for the required permission, authorization, role, status, gate claim, or gate effect. | | Generated explanation uses authorized, approved, or similar wording | Use E.17.EFP for explanation relation and source-finding relation and A.10 claim-bound source relation; issue, approval, gate, and commitment claims still need A.2.9, A.21, or A.2.8. | | Model card, datasheet, label, or note cited as readiness, safety, compliance, or release confidence | Require a typed B.3 assurance claim, intended-use match, evaluation condition, limitations, and A.10 evidence path. | | Provenance or attestation label cited as truth, safety, release, or permission | Require A.10 bounded provenance claim or process claim plus separate evidence for truth, safety, release, permission, or assurance. | | Evidence, assurance, gate, or work-occurrence words without the project-side FPF kind and reference named by value that carries that claim or effect | Recover the A.10 evidence relation, B.3 assurance claim, A.21 gate decision, or A.15.1 work-occurrence record respectively before the work claim or reliance claim is used. |

Stress cases for practice:

CaseExpected A.15.4 disposition
Green release dashboard tile with no GateDecisionRef.Source-finding only; recover A.21 decision or decision log plus A.10 evidence before gate-passage reliance.
Copied approval from last month.Recover original A.2.9 SpeechActRef, currentness, freshness, and any live A.2.8 commitment or A.21 gate source.
Credential badge screenshot after revocation.Treat as contested credential-currentness; use A.10 issuer, holder, verifier, status, and revocation path and do not infer permission.
Generated explanation says authorized by policy.Use E.17.EFP for explanation and source-finding and A.10 claim-bound source relation; issuing, gate, and commitment claims still need their own sources.
Boundary wording says guaranteed approved for production.Split through A.6 or A.6.B; if agreement-like or promise-bearing, unpack through A.6.C, A.2.8, and A.2.9.
Dashboard says green while decision log says blocked.Treat as conflicting sources; name source order, governing decision source, freshness policy, and supersession rule before the work claim or reliance claim is used.

Conformance Checklist

IDRequirement (Normative Predicate)Purpose and Rationale
CC-A15.4-1 (Work-relevant source restoration)Before an authority-looking case guides work or reliance, a conforming A.15.4 use SHALL produce the ordinary source-restoration note: encountered item, live work claim, reliance claim, work-relevant P2W claim, or P2W chain position, pattern that governs the claim being made or effect, project-side FPF kind and reference named by value needed, admissible next project move now, and blocked overread. It SHALL name the pattern and project-side reference that carry the requested claim or effect; if that source is absent or stale, it SHALL lower only the unsupported reliance to orientation, source-finding, contested use, source repair, bounded reversible probe, or blocked unsupported claim.Prevents appearance-based reliance while keeping ordinary use cheap.
CC-A15.4-2 (P2W publication use boundary)A principle scheme, functional diagram, scenario, screen, or explanation that exposes a P2W chain may guide only the exact A.15 work or planning kind named by the project use: method-family selection, selected method, U.WorkPlan, performed U.Work, work-result record, or result measurement. Claims outside that named use require their own project-side FPF kinds and references named by value.Keeps P2W publication use tied to the live work move instead of turning publication form into project authority.
CC-A15.4-3 (Lowering and refresh)When the pattern that governs the claim being made or effect, project-side FPF kind and reference named by value, source-currentness relation, revocation relation, affected work item, relying context, or time window cannot be recovered, the work or reliance claim SHALL be lowered to orientation, source-finding, contested use, bounded reversible probe, source-repair request, or blocked unsupported claim. Refresh is required when source currentness, revocation, governing decision, evidence path, status register, copied-source relation, generated-source relation, or publication relation changes.Keeps A.15.4 useful without admitting a new source kind.

Common Anti-Patterns and How to Avoid Them

  • Appearance as source relation. A dashboard tile, credential display, copied approval, generated explanation, provenance label, command-like cue, or composed source chain is used as if presentation itself carried the work-relevant source relation. First name the live work claim, reliance claim, work-relevant P2W claim, or P2W chain position, then recover the pattern that governs the claim being made or effect and project-side FPF kind and reference named by value that carry the requested claim or effect. If that source is missing, lower only the unsupported reliance.

Consequences

ConsequenceTrade-off and costMitigation
Work can continue at the lightest admissible level instead of stopping on every suspicious display.The practitioner must name the claim being made and project-side FPF reference before relying on the source.Use the ordinary six-field source-restoration note first; open fuller fields only for high-impact or contested reliance.
Appearance-based approval, evidence, assurance, gate, and work-occurrence overreads are blocked.Some convenient dashboard or copied-text shortcuts become unusable until source currentness is recovered.Keep orientation, source-finding, and bounded reversible probes available when no external-impact reliance is being made.
Repeated ambiguity becomes source-system repair work rather than repeated manual heroics.The repair may reveal missing register entries, stale source publications, or underspecified gate and evidence paths.Assign only prospective repair work or source-gap work; do not backdate evidence, gate passage, work occurrence, or assurance.

Rationale

A.15.4 exists because work often meets sources through displays, publication faces, generated explanations, copied statements, credential views, dashboard tiles, schema wording, API wording, or composed source chains before the project-side FPF kind and reference that actually carries the claim is visible. The pattern protects work momentum and source recoverability together: it lets the practitioner use the encountered item for orientation or bounded source-finding, while preventing the item from becoming approval, evidence, assurance, gate passage, performed work, release permission, role currentness, or status currentness by appearance.

The pattern is deliberately a restoration relation, not a new authority source. Once the evidence, gate, assurance, speech-act, commitment, role, status, work-occurrence, publication, or boundary claim named by value is recovered, the pattern that governs that claim carries it directly.

SoTA Alignment

SoTA alignment rule. Read the row here as source idea -> local FPF invariant -> practical local test -> popular shortcut rejected. A source citation governs nothing by reputation; it counts only when the cited idea is translated into the Solution, conformance checks, boundary rules, worked slices, and relations of this pattern.

Claim needSource idea and current sourceCurrent source referenceLocal FPF invariant and practical local testAdopted invariant, adapted invariant, and rejected shortcut
Dynamic authorization or policy-response displays need requested operation named by value, affected resource or work item, context, and window relation.Dynamic authorization practice separates subject, requested operation, affected resource or work item, context, and window before a relying move is allowed.NIST Zero Trust and dynamic authorization practice; Cedar policy language; Zanzibar-style relation authorization; source maturity = current standards, specifications, and widely used technical practice.The restoration note names the live work claim, reliance claim, work-relevant P2W claim, or P2W chain position, the affected resource or work item, affected claim when live, policy version, context, and time window before treating a visible allow response, deny response, or policy response as an admissible work or reliance source.Adopt, adapt, reject. Adopt bounded currentness, source-relation, and admissible-use invariants; adapt them through FPF project records named by value; reject treating policy-looking output as permission or work-relevant source relation by display.
Credential or register-backed status needs issuer, holder, verifier, status, currentness, and relying-context fields.Credential and status practice separates issuer, holder binding or subject binding, verifier context, relying context, proof result or status result, governing register entry, revocation, freshness, and validity window.W3C Verifiable Credentials and digital identity or register-backed status practice; source maturity = current specifications and technical practice.A credential view or status tile can carry only the holder claim, status claim, or currentness claim whose issuer, register, proof result or status result, revocation, freshness, and relying context are recoverable.Adopt, adapt, reject. Adopt status-currentness separation; reject treating a badge, screenshot, or register excerpt as role, status, permission, gate passage, or work reliance without the pattern that governs the claim being made or effect and project-side FPF kind and reference named by value.
Provenance and attestation marks need source relation and process-trace relation without becoming truth, release, or work evidence.Provenance and attestation practice separates origin relation, process traceability relation, build claim, supply-chain claim, and verification metadata from truth of downstream claims or release permission.C2PA content provenance; SLSA and in-toto attestations; source maturity = current standards, specifications, and widely used practice.A provenance or attestation mark remains source relation or process-trace relation until A.10, B.3, A.20, A.21, A.15.1, or another source relation named by value carries the downstream claim.Adopt, adapt, reject. Adopt source traceability and process traceability; reject provenance-mark-as-truth, release permission, gate passage, assurance, or work occurrence.
Change, gate, release, and approval displays need decision, schedule, and executed-work separation.Release and change practice separates approval acts, authorization acts, gate decisions, planned schedules, and executed work.ITIL 4 Change Enablement and current release or change practice; source maturity = current practitioner guidance plus mature service practice.A dashboard or approval-looking display must expose the GateDecision, SpeechAct, Commitment, U.WorkPlan, or A.15.1 work-occurrence source that carries the claim named by value or effect.Adopt, adapt, reject. Adopt decision, schedule, and executed-work separation; reject a green tile, copied approval, or generated explanation as rollout, release, or work reliance by appearance.

Digital-identity and provenance boundary. The W3C Verifiable Credentials, C2PA, SLSA, in-toto, Cedar-style, Zanzibar-style, NIST, and ITIL sources are used for currentness, status, provenance, authorization-source fields, and change-practice fields. They do not turn a visible credential, provenance label, attestation, policy response, register excerpt, or dashboard display into work occurrence, gate passage, permission, assurance, release, or project claim relation without the project-side FPF kind and reference named by value required by A.15.4, A.15, A.10, B.3, A.20, or A.21.

The nearest recovery references are the worked dashboard and approval examples, CC-A15.4-1, CC-A15.4-2, A.10, B.3, A.20, A.21, A.2.8, A.2.9, and A.15.1. If a SoTA row cannot be recovered through those local checks, do not let the source citation stand in for the local A.15.4 rule.

Relations

  • Cluster relation: A.15.4 is a cluster member under A.15 for work-relevant source restoration; it does not replace the A.15 role, method, plan, and work kernel.
  • Uses: E.17:5.1b and E.17:5.1c source-relation and admissible-use vocabulary, E.17.EFP for generated-explanation faithfulness and source-finding, A.6, A.6.B, and A.6.C for boundary, policy, API, and schema wording, A.10 for evidence, currentness, provenance, and credential status, B.3 for engineering justification claims, A.20 for constraint validity, A.21 for gate decisions, A.2.8 for commitments, A.2.9 for speech acts, and A.15.1 for dated U.Work occurrences.
  • E.10.ARCH relation-selection rule: When E.10 encounters source-relation, authority, permission, approval, status, green-tile, generated-explanation, copied-review, credential, provenance, or dashboard wording that is about to guide work or reliance, E.10.ARCH selects A.15.4 only after excluding or assigning direct evidence (A.10), assurance (B.3), gate (A.21), constraint (A.20), boundary or admissibility wording (A.6 and A.6.B), speech act (A.2.9), commitment (A.2.8), work occurrence (A.15.1), and publication-face or explanation questions (E.17 and E.17.EFP). A.15.4 returns the work-relevant source-restoration relation named by value; it does not replace those governing patterns.
  • Returns to: A.15 when the remaining question under repair is role, method, plan, and work alignment rather than source restoration.

C.29 mathematical-lens use relation

If a mathematical lens appears in work-relevant source restoration, use C.29 only to state why the lens helps expose or bound an encountered item such as a visible item, generated wording, dashboard cue, copied phrase, publication form, MVPK face, carrier, rendering, PublicationUnit, or source-finding cue. A.15.4 still governs the exact source item, visible item, restoration or reopen condition, reliance relation, and whether that item can be admissible for work. Method choice, plans, and performed work return to A.15 and A.15.1; a C.29 lens-use result does not turn a cue, rendering, or diagnostic phrase into source relation.

When E.18.1 reaches result wording, use this pattern only when a visible item, publication, dashboard, generated explanation, copied statement, provenance mark, schema wording, API wording, or composed source chain is about to justify a work-result or reliance claim by appearance. No generic WorkResult kind is admitted.

Recover the project-side FPF kind and reference named by value before relying on any result-related cue: result artifact, resource ledger, launch-values-bound record, substitution record, telemetry, acceptance record, quality-evaluation record, done-state update, feedback pin, result measurement, evidence path, assurance claim, parity relation, refresh relation, or role-enactability claim. If the governing pattern or relation is missing, use the encountered item only for orientation or source-finding and block only the unsupported result or reliance claim.

Lowering, Repair, and Refresh Conditions

Lower an A.15.4 use when the live work claim, reliance claim, work-relevant P2W claim, P2W chain position, pattern that governs the claim being made or effect, project-side FPF kind and reference named by value, relying context, time window, source-currentness relation, revocation relation, evidence path, gate decision, assurance claim, speech-act ref, commitment, role assignment, status record, or work-occurrence source cannot be named for the intended use. The lowered use is orientation, source-finding, contested use, bounded reversible probe, source-repair request, or blocked unsupported claim.

Repair the source-restoration note when source currentness, revocation, source order, governing decision source, evidence path, copied-source relation, generated-source relation, dashboard publication, credential view, status register, boundary wording, or work-result cue changes. Repair the project-side FPF kind and reference governed by the evidence, assurance, gate, constraint, speech-act, commitment, role, status, work-occurrence, publication, or boundary-wording pattern governing the recovered claim when that recovered claim belongs outside A.15.4.

Refresh before allowing the encountered item to guide release, safety, compliance, delegated role or status, contested source, cross-context reuse, work-result reliance, external-impact reliance, or irreversible work. Stop the refresh at the smallest changed object: the encountered item, source episteme, source publication, project-side FPF kind and reference named by value, source-currentness relation, status or revocation record, gate relation, evidence relation, assurance relation, copied-source relation, generated-source relation, or work-governed relation.

A.15.4:End

Language-State Transduction Coordination

Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative

Plain-name. Language-state move coordination.

Start here when. Your first honest content is a cue, not yet a claim, requirement, method, or work record, and you need to name the next admissible move without pretending that one downstream governing pattern has already taken over.

First output. A small typed move note or early preservation-to-routing note that names the source publication form, target publication form, target governing pattern, and MVPK face where that face matters.

Typical next governing patterns. A.16.1 for early preservation, B.4.1 for route publication, B.5.2.0 for cue-derived abductive prompting, endpoint governing patterns such as A.6.P, A.6.A, and C.16.Q, and A.16.2 when the right move is reopen/backoff/respecify/retire.

Common neighboring-pattern mistakes. If history itself must be published as an accountable trajectory, use A.16.0; if you are already doing slot-explicit epistemic precision repair, apply A.6.P, C.16.Q, or A.6.A; if the publication target is a graph publication in itself, use E.18.

Problem frame

Once positions in the declared language-state U.CharacteristicSpace chart from C.2.2a are explicit, teams still need admissible move kinds for how governed U.Episteme publications change, narrow, reopen, or hand off across that chart. Those moves must not collapse into a second formality-only climb, a generic one-pass process story, or an invisible sequence of governing pattern replacements.

A single local move note is often enough. Only some cases need a full trajectory account. The coordination pattern therefore has to stand independently while still remaining compatible with A.16.0 when lineage, branch structure, loss notes, or handoff history become governance-relevant.

Problem

Without a dedicated coordination pattern, authors either misuse F0-F9, force every cue into anomaly/problem language too early, let reopen and backoff happen informally with no explicit guards, or over-wrap every local move in a meta-account that should have remained optional.

Forces

ForceTension
Coordination vs duplicationCoordinate moves over the declared language-state chart without recreating A.19 or E.18.
Local sufficiency vs history visibilityLet a typed local move note stand independently, while still supporting richer history publication when that history matters.
Early capture vs endpoint disciplineAdmit low-articulation governed U.Episteme publications without losing endpoint-classification discipline.
Forward development vs admissible retreatSupport formalization and operationalization, but also reopening, sketch-backoff, respecification, and admissible retirement.

Solution

A.16 governs only admissible move kinds, their guards, and docking rules for how governed U.Episteme publications may be related across declared language-state positions. It does not govern F, does not define the trajectory-account semantics itself, and does not define a rival graph calculus beside E.18.

A conforming move may be published as a local move note without any U.LanguageStateTransductionTrajectory wrapper. A.16.0 is used only when lineage, branch structure, loss notes, supersession, retirement, bridge-sensitive history, or governing pattern handoff has governance value that should be published as an account.

Observation itself is a precursor condition typically published through B.4.1. A.16 move kinds begin once a cue is deliberately noticed, stabilized, route-published, reopened, formalized, operationalized, respecified, or retired under explicit move discipline.

Admissible transduction move family

MoveWhat it doesTypical source conditionTypical publication effect
noticemarks that a low-articulation cue is being deliberately preservedlow or unstable articulationcue preservation becomes explicit enough for early publication work
stabilizemakes the local shape steadier without forcing route or endpoint choicecue already noticedcue nucleus, anchors, or witness structure become steadier
routepublishes downstream route plurality or a selected route through an explicit route-bearing formstabilized cue existsRoutedCueSet or equivalent route-bearing publication makes route state explicit
projectionpublishes route-bounded partialization without pretending full endpoint governanceroute is explicit and one aspect is being foregroundeda typed route-bounded publication form is emitted on an existing MVPK face, with loss notes and reopen conditions
formalizeincreases explicit symbolic or normal-form structurearticulation threshold is meta publication form with higher articulation or closure is published; new evidence-generation crossings stay visible if required
operationalizeturns a selected line toward method, work, or gate usemethod, work, or gate-facing line existsoperational hooks become explicit; work crossings stay visible if new world-facing work is required
reopenrelaxes closure while preserving the current family if possibleroute or frame no longer holds cleanlyclosure drops and rivals re-open
sketchBackoffmoves to an exploratory cue-bearing publication formendpoint-bound, method-facing, work-facing, or gate-facing publication form over-commits the current publicationexploratory cue-bearing form becomes admissible again
respecifykeeps the broad family but revises framing scaffold, facet-profile reading, or route specificationcurrent framing remains plausible but is stated wronglya new framing scaffold or route specification replaces the old one while continuity stays explicit
retiredeclares that a cue, route-bearing publication, or branch is no longer current or no longer worth preservingbetter-supported successor exists, supporting grounds have collapsed, or authority has been withdrawn entirelyretirement or withdrawal becomes explicit together with successor or no-successor note

A.16 governs these move names, not the publication forms that may result from them. U.PreArticulationCuePack, RoutedCueSet, U.AbductivePrompt, and endpoint-pattern-governed U.EpistemePublication forms are governed publication forms; they are not move kinds.

Here projection remains the move name, but its reading is tightened: it is route-bounded partialization. The resulting publication must be a typed publication form rendered on an existing MVPK face. Naming only the face is insufficient; naming only an untyped placeholder is insufficient.

respecify is intentionally narrower than epistemic precision repair. In A.16, it may change framing scaffold, route specification, or facet-profile reading while preserving the broad family. Slot-explicit epistemic precision restoration and endpoint-local lexical repair remain with governing patterns such as A.6.P, C.16.Q, and A.6.A.

Guard discipline

Move guards are stated over named facets from C.2.LS, together with witnesses, scope, and GammaTime selectors where needed. In practice this means explicit reference to AE (C.2.4), CD (C.2.5), LanguageStateAnchoringMode (C.2.6), and LanguageStateRepresentationFactorBundle (C.2.7), either facetwise or through one published facet profile. No move may be justified by vague prose such as "the idea matured" without naming what changed in articulation, closure, anchoring, representation, or route state.

Docking discipline

After route, projection, formalize, or operationalize, the next admissible publication shall keep three layers distinct:

  • the publication form now being issued (for example U.PreArticulationCuePack, RoutedCueSet, U.AbductivePrompt, or a named U.EpistemePublication form governed by a endpoint governing pattern);
  • the governing pattern that governs that form (A.16.1, B.4.1, B.5.2.0, A.6.P, A.6.A, C.16.Q, B.5.2, A.15, C.25, or another named governing pattern);
  • the MVPK face, when rendering matters, that carries that publication.

Naming only the governing pattern is insufficient because governing patterns are not forms. Naming only the face is insufficient because faces are not forms. An admissible move note states the pattern-governed publication form first, then the governing pattern, then the face if the face matters.

Effect-free versus work-requiring moves

Some formalize and operationalize moves are effect-free epistemic rewrites or moves to publication forms with higher articulation or closure over already available grounds. Others require new measurements, experiments, instrumentation, execution, or other U.Work. When the latter happens, the move note shall expose the crossing or handoff explicitly; A.16 does not pretend that world-facing work occurred inside the language layer.

Move-note threshold and path publication discipline

A typed local move note is sufficient when a small move or short move chain can be kept reconstructible without publishing extra lineage machinery.

Use A.16.0 only when at least one of the following is load-bearing:

  • derivation, supersession, fork, merge, or retirement structure;
  • a multi-move history whose compression would hide governing pattern or authority changes;
  • visible loss notes or reopen conditions spanning more than one move;
  • responsibility handoff or bridge/viewpoint entry that depends on upstream history.

If the history itself must be published as a graph publication, reuse E.18. A.16 governs move admissibility; A.16.0 packages trajectory accounts; E.18 governs graph publication of paths.

Archetypal Grounding

Tell. A language-state move is not "the episteme became better". It is a typed transduction: articulation rose, closure narrowed, route plurality was published, one route was foregrounded, a framing scaffold was replaced, or a branch was admissibly retired.

Show (System). An operator alert note about a disturbance may go notice -> stabilize -> route -> operationalize, then later reopen when counter-evidence arrives, or retire one branch when a better-supported successor line takes over.

Show (Episteme). An inquiry cue pack about a felt or trace-anchored discrepancy cue may go notice -> stabilize -> route -> projection -> formalize, or reopen -> sketchBackoff -> respecify if the chosen framing over-commits.

Bias-Annotation

The pattern biases authors toward explicit move-typing and away from folk stories such as "it naturally matured". That bias is intentional.

Conformance Checklist

  • CC-A.16-1 A.16 MUST NOT redefine F or publish a second formality-only climb.
  • CC-A.16-2 A conforming move note MAY stand alone; A.16.0 SHALL NOT be treated as mandatory wrapper syntax for every move.
  • CC-A.16-3 Every move kind SHALL name its preconditions and postconditions over explicit language-state facets, route state, or authority state.
  • CC-A.16-4 Publication form, governing pattern, and MVPK face SHALL NOT be collapsed into one unnamed target.
  • CC-A.16-5 Multi-route state inside one governed member SHALL NOT be confused with lineage fork across several successor members.
  • CC-A.16-6 respecify SHALL NOT be used to hide slot-explicit epistemic precision repair that belongs to later repair governing patterns.
  • CC-A.16-7 Retreat or retirement SHALL preserve, withdraw, or discard prior witnesses and authority explicitly.
  • CC-A.16-8 Published path structures SHOULD reuse E.18 when a graph publication is needed.
  • CC-A.16-9 AuthorityState and EndpointAdmissionProfile reuse SHALL NOT be treated as new governing patterns, new route-bearing forms, or substitutes for gate or work state.
  • CC-A.16-10 A summarized multi-move publication SHALL keep intermediate governing pattern transitions reconstructible; otherwise the case must reopen or publish richer history.

Common Anti-Patterns and How to Avoid Them

  • Trajectory-wrapper inflation. Do not wrap every local move in A.16.0. Publish a local move note unless history has lineage governance value.
  • Governing-pattern-as-form collapse. Do not write as if A.6.P, B.5.2, or A.15 were publication forms. Name the pattern-governed form and the governing pattern separately.
  • Form-face collapse. Do not treat an MVPK face as if it were the publication form itself. Name both when both matter.
  • Irreversible maturity story. Reopen, sketch-backoff, respecify, and retirement are admissible moves, not failures of the trajectory discipline.
  • Silent branch retirement. Do not let one route or branch disappear without a retirement or supersession note.
  • Route/fork confusion. Several live routes in one RoutedCueSet are not yet a lineage fork.

Consequences

The benefit is a clear governing pattern for language-state transductions and an admissible place for both tightening and retreat without governing pattern blur. The trade-off is more explicit move bookkeeping.

Rationale

This separation keeps C.2.3 as the sole governing pattern of formality while C.2.2a / A.19 define position semantics, A.16.0 packages only the history that deserves publication as an account, and A.16 defines move admissibility.

SoTA-Echoing

Claim 1. Best-known current incident-response, exploratory design, and inquiry practice treats advance, backoff, reopening, and retirement as governed transitions rather than as one irreversible maturity climb.

Practice source, local alignment, and adoption decision. Contemporary incident review, exploratory design, and inquiry practice after 2015 keeps rollback, reopen, and retirement explicit because otherwise later readers over-credit earlier low-articulation forms. This pattern adopts explicit retreat and retirement, adapts them to typed publication forms, route states, and authority states, and rejects the still-popular shortcut where every change is narrated as one-way maturation.

Claim 2. Best-known current provenance, path-publication, and model-evaluation practice distinguishes a local transition note from a heavier published history account.

Practice source, local alignment, and adoption decision. Contemporary provenance and evaluation practice separates lightweight transition marking from heavier account publication when branch structure, loss notes, or handoff history become governance-relevant. This pattern adopts that separation, adapts it through the A.16 / A.16.0 / E.18 split, and rejects both extremes: wrapping every move in a mandatory trajectory wrapper and compressing a governance-relevant move history into one vague maturity sentence.

Local stance. The load-bearing SoTA claim for this pattern is narrow: admissible language-state movement needs typed move notes, explicit authority effects, and explicit retreat/retirement options, but it does not need a mandatory formality climb or a mandatory wrapper around every move.

Relations

  • Builds on: C.2.2a, C.2.LS, C.2.4, C.2.5, C.2.6, C.2.7, A.18, A.19.
  • Coordinates with: A.16.0, A.16.1, A.16.2, B.4.1, B.5.2.0, A.6.P, A.6.A, C.16.Q, E.18.
  • Constrains: language-state move publication and docking.

Admissible Move Matrix

Typical publication consequences

MoveTypical source publication stateTypical resulting publication state or formWhat must become explicit
noticeobservation trace, low-articulation cue, provisional notepreservation-worthiness of the cue becomes explicitwhy the cue counts as worth preserving
stabilizelow-articulation preserved cueU.PreArticulationCuePack or equivalent early preservation form becomes admissiblecue nucleus, anchors, witnesses, and preservation rationale
routecue pack or stabilized noteRoutedCueSet or equivalent route-bearing publication becomes admissibleroute plurality, selected route if any, route rationale, route authority state
projectionrouted cue or selected routea typed route-bounded publication form rendered on an existing MVPK facewhat is foregrounded, what is omitted, and how reopen remains admissible
formalizeexplicit but not yet formal-enough publicationa named U.EpistemePublication form with higher articulation or closure governed by a later formal pattern becomes admissiblenew symbolic or slot structure and governing-pattern entry
operationalizemethod-facing, work-facing, or gate-facing publicationa method-facing, work-facing, or gate-facing U.EpistemePublication form governed by a later method, work, or gate pattern becomes admissiblehook governing pattern, guard, authority basis, and work crossing if any
reopenroute-bearing or endpoint-bound publicationsame family with reduced closurewhich rivals reopen and what authority falls
sketchBackoffover-rigid formexploratory cue-bearing form such as U.PreArticulationCuePack or RoutedCueSetwithdrawn authority and retained witnesses
respecifyplausible family under wrong framing scaffoldsame family with revised framing scaffold or route specificationreplaced framing commitments and invariants that stay fixed
retirecue pack, route-bearing publication, or branchretired / withdrawn state with successor or no-successor notewhy continuation stopped and what now carries authority

Invariance reminder

An admissible move may change articulation, closure, representation, route, authority, or publication form, but it shall not silently rewrite governing pattern boundaries. A move is not permission to retype a cue into any convenient governing pattern.

Worked Move Notes

Incident-control move note

An operator alert note about a production disturbance may move:

notice -> stabilize -> route -> operationalize

The alert note does not need to become an anomaly statement immediately. It may first become a cue pack, then a routed cue set, and only then a typed operational form under the governing pattern.

Inquiry move note

An inquiry cue pack about a model-vs-observation discrepancy may move:

notice -> stabilize -> route -> projection -> formalize

Later, if the selected framing over-commits, the admissible continuation may be:

reopen -> sketchBackoff -> respecify

Retired branch

A routed cue set may initially keep both evaluative and abductive routes live. If later review shows the evaluative branch was unsupported, the admissible continuation is not silent disappearance but explicit retirement of that branch, while the abductive branch remains current.

False-maturity leap to reject

The following is not admissible:

notice -> gate decision

unless explicit intermediate publication and governing pattern transitions justify it. The trajectory discipline exists precisely to block such invisible leaps.

Authoring and Review Guidance

Author prompt

When naming a move, the author should say:

  • what the source publication form is,
  • what the target publication form is,
  • which governing pattern governs the target form,
  • which MVPK face matters if rendering matters,
  • which facet or route-state change justifies the move,
  • what authority effect follows,
  • and what remains invariant.

Review prompt

A reviewer should ask:

  • is the move a real transduction or just rhetorical relabeling?
  • does the move preserve witnesses and route provenance appropriately?
  • is route plurality being confused with lineage fork?
  • did a governing pattern silently absorb the publication too early?
  • if retreat or retirement occurred, was the authority drop made explicit?

Integration reminder

When path publication becomes important as a graph publication in itself, move semantics stay in A.16, the optional history package stays in A.16.0, and the path publication still belongs to E.18.

Migration and Boundary Notes

Migration from old formality-only climb talk

Older prose that narrates a cue as moving from "informal to formal" should be unpacked into the relevant A.16 move plus the relevant facet, route-state, and authority changes. A single-factor maturity story is not enough.

Boundary reminder

If authors find themselves using A.16 to justify measurement admissibility, bridge substitution, endpoint ontology, or slot-explicit epistemic precision repair, they have crossed out of this governing pattern's scope.

Move Package Discipline

Publish moves as small typed transduction notes rather than as narrative adjectives.

Minimal move note

A conforming move note should name:

  • the source publication form,
  • the target publication form,
  • the target governing pattern,
  • the move kind,
  • the facet or route-state changes that justify the move,
  • the authority effect,
  • and the witnesses or traces that preserve continuity.

If those fields already make the move reconstructible, the note does not need A.16.0.

Source and target must both be typed

"The episteme was refined" is insufficient. A.16 requires a typed source publication form and a typed target publication form so governing pattern boundaries stay visible.

Witness continuity

Keep continuity explicit when anchors, contrasts, traces, or exemplars survive. If continuity breaks, state the break directly rather than smoothing it over in maturity prose.

Authority, Route Plurality, and Fork Rules

The pattern is not just about movement; it is about admissible movement under explicit authority boundaries.

Multi-route state versus lineage fork

A multi-route state means one governed member still keeps several downstream directions live inside one publication such as RoutedCueSet.

A lineage fork means separate successor members have already been published, each with distinct authority, losses, and future handoff semantics.

The first is plurality inside one member. The second is explicit branching of lineage. Reviewers shall not treat them as the same lineage relation.

Four route / authority states

A governed publication after route work is usually in one of four states:

  • open plurality - several downstream directions remain live;
  • selected-route-before-endpoint-publication - one route is preferred, but the U.EpistemePublication is still an early or seam publication form;
  • endpoint-pattern-publication-issued - a named endpoint pattern now governs the relevant U.EpistemePublication form and responsibility handoff;
  • retired / withdrawn - the publication or branch is no longer current and survives only as historical continuity.

Confusing these states is one of the main causes of premature endpoint language.

AuthorityState extraction note

The four states above may be reused as AuthorityState, an extracted shared profile for corridor coordination and review.

That extraction does not create a new governing pattern. It reuses the state vocabulary already pattern-governed here for later cross-references in B.4.1, B.5.2.0, A.6.P, C.16.Q, A.6.A, and A.15.

AuthorityState names route authority state after route work. It does not replace routeDecision, selectedRoute, routeAuthorityState, route-bearing publication governance, gate state, or work-execution state. Any endpoint-pattern-publication-issued state still names the downstream governing pattern and governed U.EpistemePublication form explicitly.

Authority may rise, stay bounded, fall, or retire

A move may:

  • raise authority, as when a routed cue becomes an admissible U.EpistemePublication form governed by a named endpoint pattern;
  • keep authority bounded, as when a route-bearing publication clarifies one route without claiming endpoint governance;
  • lower authority, as when reopening or sketch-backoff withdraws prior closure or route force;
  • retire authority, as when a branch or publication is explicitly withdrawn from current use.

The authority effect should be named as carefully as the move kind itself.

Boundary to governing pattern replacement

A.16 never authorizes a silent governing pattern replacement. If a route crosses into A.6.P, B.5.2, A.15, C.25, or another endpoint governing pattern, that governing pattern and the pattern-governed publication form must be named explicitly. A.16 coordinates the crossing; it does not absorb the destination governing pattern's semantics.

EndpointAdmissionProfile extraction note

The corridor can reuse an EndpointAdmissionProfile as a declarative pattern-derived profile for admissible handoff from language-state publications to governing patterns.

That profile is stated over already pattern-governed conditions: declared language-state positions in C.2.2a, facet readings in C.2.LS and C.2.4-C.2.7, explicit route state in B.4.1, prompt-readiness in B.5.2.0, and witness or grounding conditions that are already visible in the publication chain.

EndpointAdmissionProfile decides whether handoff is admissible; it does not govern the downstream publication form itself. A relation-like skeleton may therefore be admitted toward A.6.P; an explicit open question with rival-set may be admitted toward B.5.2.0; evaluative or A.6.A-inviting publication content may be admitted toward C.16.Q or A.6.A; executable docking may be admitted toward A.15.

No admission result makes a governing pattern optional. Tone, style, or mere apparent explicitness is never sufficient by itself; the relevant governing pattern conditions still have to be named and met.

Worked Failure and Recovery Cases

Premature endpoint capture

A low-articulation cue is observed and quickly described as if it were already a requirement. Under A.16, this is rejected because the move history is missing: the publication should first be noticed, stabilized, and route-published. The recovery is not to defend the over-committing label, but to reopen and publish the earlier route-bearing form.

Silent route drift

A note begins as evaluative pressure but later starts driving work planning. If this shift is not published, the route drift remains invisible. A.16 requires either a new route-bearing publication, an explicit operationalization note, or an explicit handoff to a governing pattern.

admissible retreat after over-formalization

A note is formalized too early into a relation-like shape, but later review shows the anchors are still unstable. The correct continuation is not to leave the relation form in place and quietly reinterpret it. The correct continuation is reopen -> sketchBackoff, preserving what still holds and lowering the authority of what no longer does.

Silent branch disappearance

A route-bearing publication originally kept two candidate routes live. Later text talks only as if one route ever existed. Reviewers should treat that as silent branch laundering unless the abandoned route was explicitly retired, merged, or shown never to have become a distinct branch.

Form-governing pattern-face collapse

A note says only the move publishes a Tech face or the move enters A.6.P and never names the actual publication form. That wording is non-conforming because it collapses three different layers into one phrase. The repair is to name the publication form first, then the governing pattern, then the MVPK face if the face matters for rendering or review.

Multi-Move Composition and Path Publication

Compound move rule

Many published histories are short move chains such as notice -> stabilize -> route -> projection into U.AbductivePrompt, or endpoint-pattern-publication-issued -> reopen -> sketchBackoff -> route. A conforming publication may summarize such a chain only if the intermediate governing pattern transitions remain reconstructible.

Move-by-move authority reading

Read authority move by move. A later move to higher closure state, route authority state, or endpoint authority claim does not retroactively authorize earlier lower-articulation forms, and later retreat or retirement does not erase the fact that the later route or endpoint authority state once existed.

A.16.0 threshold

When a move history acquires lineage governance value, publish it through A.16.0 rather than overloading one local move note with hidden lineage structure.

E.18 threshold

When the history must be published as a path publication in a graph sense, reuse E.18. A.16 still governs move semantics.

Comparative Move Rules and Boundary Tests

Comparing move histories

Move histories may be compared across contexts only if the compared moves are typed by publication form, governing pattern, and authority effect. Comparing one context's route -> projection chain to another context's cue -> requirement leap as though they were the same "formalization speed" is a category mistake.

No maturity-climb compression

A multi-move path shall not be redescribed as one generic climb in maturity, rigor, or readiness. The admissible comparison is over move kinds, facet shifts, route states, governing pattern crossings, and authority effects.

Boundary test for silent path laundering

If a endpoint claim depends on prior move publications that are not visible anywhere in the publication chain, reviewers should assume silent path laundering until the missing move records are supplied. A.16 exists precisely to prevent such invisible transitions.

Review Matrix for Integration Integrity

A reviewer can test an A.16 move or move chain with six questions:

  1. Are the source publication form and target publication form typed? If not, the move is too vague.
  2. Are governing pattern and face kept distinct from the form? If not, the move collapses layers.
  3. Is the authority effect explicit? If not, governing pattern boundaries will drift.
  4. Is route plurality being confused with lineage fork? If yes, the history is being misread.
  5. Are intermediate move publications suppressed in a way that changes the reading? If yes, the chain is over-compressed.
  6. Has A.16 started to impersonate a governing pattern or a trajectory wrapper? If yes, the relevant governing pattern or A.16.0 threshold needs to be named explicitly.

This matrix keeps the integration layer narrow while still making its move semantics inspectable.

A.16:End

U.LanguageStateTransductionTrajectory - Optional trajectory-account normal form over the language-state U.CharacteristicSpace

Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative

Plain-name. Language-state transduction trajectory.

Builds on. C.2.2a, A.16, A.19, E.17, E.18, E.10, F.18.

Used by. A.16.1, A.16.2, B.4.1, B.5.2.0, A.6.P, C.16.Q, A.6.A, F.9.1, E.17.1.

Problem frame

In engineering, inquiry, operator, and management practice, teams sometimes need more than a local move note. When branch structure, supersession, retirement, handoff, bridge-sensitive loss, or multi-step governing pattern change matters, readers need one place where the history of successive governed U.Episteme publications is made explicit.

Cue packs, routed cue sets, abductive prompts, typed route-bounded projection publications, partial normal forms, and endpoint-bound records are publication forms that may appear in that history. They are not the raw disturbances, telemetry traces, model outputs, bodily tensions, or carrier documents that ground it.

What must remain intelligible is therefore not a myth that one unchanged U.Episteme publication literally moves. What must remain intelligible is a lineage of successive governed U.Episteme publications, together with the load-bearing links among them, when that history itself has governance value.

Problem

Without an explicit trajectory-account pattern for those heavier cases:

  1. history is mistaken for generic one-pass process story rather than for governed transduction over a declared language-state U.CharacteristicSpace;
  2. early seam publications are confused with U.EpistemePublication forms governed by endpoint patterns;
  3. forks, merges, route retirement, supersession, and route-sensitive loss become implicit and unverifiable;
  4. every local move is either over-wrapped in ad hoc history prose or under-wrapped in a way that hides handoff and authority change;
  5. bridge and viewpoint docking inherit under-described upstream history.

Forces

ForceTension
History value vs wrapper inflationPublish lineage only when it matters, without making trajectory accounts mandatory around every admissible move.
Lineage fidelity vs readable publicationTrajectory history must stay branch-aware without becoming unreadable bookkeeping.
Seam usefulness vs endpoint disciplineUpstream publications must be useful while remaining visibly upstream of endpoint governance.
Account clarity vs governing pattern boundariesThe trajectory pattern must explain heavy-history cases without taking over A.19, A.16, E.17, E.18, or endpoint semantics.
Local transduction vs bridge entryThe same trajectory may later cross viewpoint or context boundaries, but that crossing does not redefine the local trajectory governing pattern.

Solution

U.LanguageStateTransductionTrajectory is the optional trajectory-account normal form that records how successive governed U.Episteme publications are linked across position claims in the declared language-state U.CharacteristicSpace chart named in C.2.2a.

It does not define position semantics, move admissibility, or publication-face ontology by itself. Those remain with C.2.2a / A.19, A.16, and E.17 / E.18 respectively.

It answers the question: when history itself matters, which governed publication is current, which members precede or branch from it, which admissible moves relate them, which publication forms carry them, what was lost, and who now governs the next responsibility?

Ontological subject and role lanes

In this cluster, keep six roles distinct:

  • current governed member - the current U.Episteme publication under language-state governance;
  • lineage links - explicit derivedFrom, supersedes, forkedFrom, mergedFrom, and retirement / no-successor links among governed members;
  • grounds / witnesses - service disturbances, model-vs-observation discrepancies, traces, model outputs, bodily tensions, contrasts, or exemplars that justify the history;
  • publication forms - cue packs, routed cue sets, prompt forms, typed route-bounded projection publications, partial normal forms, and records governed by endpoint patterns through which lineage members are 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 outputs or carriers that hold or render those publications.

A multi-route state inside one current governed member is not yet a lineage fork. It becomes a fork only when distinct successor members are published and given distinct authority, losses, or handoff semantics.

A trajectory step may add a new lineage member, revise the current member, or relate several members through fork, merge, supersession, or retirement. It does not mean that the source phenomenon itself has moved through the language-state chart.

Position-account discipline

The position read by this pattern is the slot-explicit claim defined in C.2.2a: a partial coordinate publication in the declared language-state U.CharacteristicSpace, where each basis slot publishes a ValueSet(slot), interval, or other admissible set-valued claim.

Early seam publications may leave some slots unknown or wide. That uncertainty is admissible only if it is explicit. A trajectory account therefore records the position claims of the current lineage member and, when needed, of the predecessor or sibling members that justify the move reading.

Use threshold and core trajectory record

A single local A.16 move note is sufficient when no load-bearing branch, loss, handoff, or supersession structure needs publication.

Use U.LanguageStateTransductionTrajectory when at least one of the following is load-bearing:

  • derivation, supersession, fork, merge, or retirement structure;
  • multi-step loss notes or reopen conditions that would be hidden by a compressed move note;
  • responsibility handoff whose legitimacy depends on upstream history;
  • bridge or viewpoint entry that depends on upstream route, loss, or lineage structure.

A conforming trajectory account then keeps at least the following explicit:

  • the current governed member;
  • predecessor, sibling, or ancestor references when the current reading depends on lineage structure;
  • the lineage link kind (derivedFrom, supersedes, forkedFrom, mergedFrom, retiredWithSuccessor, retiredWithoutSuccessor, or another explicitly typed link);
  • the current position claim and any load-bearing predecessor position claims;
  • the typed move or move sequence that relates them;
  • the publication form currently carrying the governed member and, if it matters, the MVPK face carrying that form;
  • the next intended governing pattern or handoff state;
  • any loss note, reopen condition, branch-specific authority note, or bridge-sensitive note that matters.

Recorded move-family discipline

U.LanguageStateTransductionTrajectory records the governed A.16 move family: notice, stabilize, route, projection, formalize, operationalize, reopen, sketchBackoff, respecify, and retire.

The point is not that every account uses every move. The point is that forward movement, retreat, reframing, and explicit retirement belong to one governed family when that history is worth publishing.

Detailed move guards remain with A.16. A.16.0 records their use; it does not govern them.

Seam publication and face discipline

A trajectory account may refer to seam publications that remain upstream of endpoint governance. In the current cluster these include:

  • U.PreArticulationCuePack;
  • RoutedCueSet;
  • U.AbductivePrompt;
  • partial normal forms already typed elsewhere;
  • other explicitly typed upstream publications that preserve non-endpoint status.

These are not a rival publication-face sequence. They are typed publication forms rendered, when necessary, on existing MVPK faces under E.17.

Untyped placeholders such as "route-bounded publication face" are non-conformant in a trajectory account unless the text also names the actual publication form and, separately, the MVPK face if face typing matters.

Endpoint docking and responsibility handoff

A trajectory does not need to terminate in order to be useful. What matters is a visible docking milestone or responsibility handoff into a governing pattern that is allowed to take the next pattern-governed declaration.

Typical docking governing patterns include:

  • A.6.P for relation repair forms;
  • A.6.A for invitation forms;
  • C.16.Q for evaluative repair forms;
  • B.5.2 for later abductive work;
  • A.15 for method-facing or work-facing forms;
  • C.25 for endpoint bundle structures.

A trajectory account should therefore name not only the docking governing pattern but also the pattern-governed publication or record that now carries the next pattern-governed declaration. Naming only the governing pattern under-publishes the handoff.

After such a handoff, monitoring, maintenance, revisit, or later re-entry may continue through new lineage members or later trajectories. The pattern therefore distinguishes lineage continuity from current governing pattern responsibility.

Effect-free moves versus work-requiring crossings

Some formalize and operationalize steps are effect-free epistemic transformations: rewriting, slot-explicit articulation, route-bounded partialization, view retargeting, or normal-form repair over already available grounds.

Other steps require new measurements, experiments, instrumentation, execution, or other U.Work. When that happens, the trajectory account shall publish the crossing or handoff explicitly rather than pretending that world-facing work occurred inside the language layer. A.16.0 records that the crossing was required; the relevant work, gate, or endpoint governing pattern records the world step itself.

Relation to A.16 and E.18

U.LanguageStateTransductionTrajectory is not an E.18 path publication, and A.16.0 does not govern the semantics of language-state movement.

  • A.19 plus C.2.2a govern the declared characteristic-space reading of positions;
  • A.16 governs move kinds and move guards;
  • E.17 / E.18 govern publication-face discipline and graph publication of paths;
  • endpoint patterns govern endpoint-local U.EpistemePublication forms and declarations.

A.16.0 standardizes only the heavier history package for cases where that package is itself worth publication.

Bridge and viewpoint entry

A trajectory may later cross a viewpoint or context boundary. When that happens:

  • bridge substitution licence remains with F.9;
  • stance overlays remain with F.9.1;
  • viewpoint reuse remains with E.17.1;
  • endpoint-local semantics remain with their named endpoint patterns and governed publication forms.

A.16.0 only makes those entry points explicit so that later attachments do not float without an upstream history account.

Archetypal Grounding

Tell. A language-state trajectory account is not we kept refining the note. It is an optional, lineage-aware account of successive U.Episteme publications, with declared position claims, move kinds, publication forms, losses, and next governing patterns.

Show (System). A service disturbance is a system-side phenomenon, not the trajectory subject. It grounds an alerting episteme lineage. One stabilized cue pack may first keep two routes live in one RoutedCueSet; only later, if two distinct successor publications are actually issued, does the lineage fork.

Show (Episteme). A model-vs-observation discrepancy is a witness-lane tension, not the positioned episteme publication or lineage itself. Once preserved as a cue pack, the governed lineage may project into a typed prompt publication on one branch and later formalize on another, or it may reopen and retire one branch if the provisional route proves unsupported.

Bias-Annotation

The pattern biases authors toward lineage-aware history accounts rather than stage stories about one magically maturing U.Episteme publication. That bias is intentional when branch, loss, or handoff semantics matter. The counter-bias is equally intentional: do not publish a trajectory account when a local move note already suffices.

Conformance Checklist

  • CC-A.16.0-1 U.LanguageStateTransductionTrajectory SHALL NOT be treated as mandatory wrapper syntax around every A.16 move.
  • CC-A.16.0-2 A language-state trajectory account SHALL identify the current governed U.Episteme publication and SHALL NOT collapse grounds, publication forms, publication faces, carriers, and governed members into one unnamed moving thing.
  • CC-A.16.0-3 Position claims used in the trajectory SHALL be published as slot-explicit claims in the declared language-state U.CharacteristicSpace, not as folk stage labels.
  • CC-A.16.0-4 Fork, merge, supersession, derivation, and retirement SHALL be made explicit whenever the account depends on them.
  • CC-A.16.0-5 Publication form and MVPK face SHALL NOT be collapsed, and untyped seam placeholders SHALL NOT substitute for typed publication forms.
  • CC-A.16.0-6 projection SHALL be read as route-bounded partialization with visible loss notes and an admissible reopen path.
  • CC-A.16.0-7 Work-requiring formalize or operationalize steps SHALL expose the relevant crossing or handoff rather than pretending that U.Work occurred inside the language layer.
  • CC-A.16.0-8 When graph publication of paths is needed, authors SHOULD reuse E.18 rather than inventing a rival path calculus here.

Common Anti-Patterns and How to Avoid Them

  • Meta-wrapper inflation. Treat A.16.0 as obligatory around every move. Repair by publishing a local A.16 move note unless history itself has governance value.
  • One-publication myth. Treat one frozen episteme as literally moving unchanged. Repair by publishing lineage members and their links.
  • Governing-pattern/form collapse. Treat governing patterns as if they were publication forms. Repair by naming the pattern-governed form and the governing pattern separately.
  • Form/face collapse. Treat seam publications as if they minted a second MVPK face family. Repair by naming form and face separately.
  • Multi-route/fork collapse. Treat several live routes in one governed member as if they were already several successor members.
  • Hidden work crossing. Describe operationalization as purely linguistic when it actually required new world-facing work. Repair by publishing the crossing explicitly.

Consequences

The benefit is that heavy-history language-state movement becomes lineage-aware, reviewable, and dockable without premature endpoint capture or metonymic collapse. The trade-off is more explicit publication of position claims, lineage links, move kinds, loss notes, and handoffs when history is worth publishing.

Rationale

Language-state work needs one explicit trajectory-account normal form for the subset of cases where history itself matters. Without that account, readers have to reconstruct lineage, branch structure, retirement, and handoff semantics from fragments. With it overused, every local move becomes over-wrapped. The pattern exists to hold the middle line.

SoTA-Echoing

The pattern matches contemporary practice in exploratory inquiry, operator-centered incident work, model probing, and structured design iteration: admissible progress sometimes requires visible intermediate publications, branch-aware history, disciplined retreat, and explicit handoffs rather than hidden jumps from cue to endpoint.

Relations

  • Builds on: C.2.2a, A.16, A.19, E.17, E.18.
  • Coordinates with: C.2.LS, A.16.1, A.16.2, B.4.1, B.5.2.0, B.5.2, A.6.P, C.16.Q, A.6.A, F.9, F.9.1, E.17.1.
  • Constrains: trajectory-account publication, branch visibility, seam publication reading, docking visibility, and anti-pipeline language across the cluster.

Worked trajectories

Multi-route state before fork

A routed operator cue may first publish one governed member with both intervention and inquiry routes live inside one RoutedCueSet. That is still one member in a multi-route state. Only if separate successor publications are later issued for those two continuations does the lineage fork.

Inquiry trajectory with fork

An inquiry cue pack centered on a felt or trace-anchored discrepancy cue may first publish one governed member, then fork into:

  • notice -> stabilize -> route -> projection -> formalize, with a cue-derived prompt publication carrying the explanatory branch, and
  • notice -> stabilize -> route -> projection -> operationalize

if one branch supports explanatory work while another supports immediate probe or control work. The branches remain admissible only if the fork is visible and each branch keeps distinct loss notes and handoff conditions.

Operator trajectory with retirement

An operator alert note about a service disturbance may move:

notice -> stabilize -> route -> projection -> operationalize

If one route later proves unsupported, the admissible continuation may include explicit retirement of that branch rather than silent disappearance. The retirement does not erase the prior branch; it withdraws authority and preserves continuity explicitly.

Bridge-sensitive trajectory

A route-bearing comparative note may move through a seam publication and only later dock to a bridge overlay or viewpoint bundle. The bridge or viewpoint attachment does not replace the trajectory account; it annotates or re-expresses a lineage that already exists.

Trajectory publication package discipline

A publishable trajectory account should normally identify:

  • the current governed U.Episteme publication;
  • predecessor, sibling, or ancestor references when they are load-bearing;
  • the lineage link kind;
  • the current position claim and any load-bearing predecessor position claims;
  • the move or move sequence being asserted;
  • the current publication form and, if relevant, the MVPK face carrying it;
  • the grounds or witnesses that make the history necessary;
  • the next route, docking governing pattern, or retirement state;
  • the losses, open rivals, or reopen conditions that matter for continuation.

If these are missing, the publication is usually only plain sequence prose, not a conforming trajectory account.

Review guidance

A reviewer should ask:

  1. Is the author really describing history over the declared language-state U.CharacteristicSpace, or only narrating progress informally?
  2. Is the current governed member distinct from the grounds, publication form, publication face, and carrier?
  3. Is this history heavy enough to justify A.16.0, or would a local A.16 move note have sufficed?
  4. Are multi-route state and lineage fork being kept distinct?
  5. Are derivation, supersession, fork, merge, or retirement links visible where the reading depends on them?
  6. Is the current publication a seam publication or already a U.EpistemePublication form governed by a named endpoint pattern?
  7. If formalize or operationalize required world-facing work, is the crossing or handoff explicit?

Boundary notes

A.16.0 does not replace C.2.2a / A.19 position semantics, A.16 move guards, A.16.1 cue-pack semantics, A.16.2 retreat / retirement semantics, B.4.1 seam entry routing, B.5.2.0 abductive prompt species, E.17 face typing, E.18 path publication, or any endpoint-local repair logic.

Its job is narrower and architectural: to make the heavier trajectory account visible only where lineage, branch, loss, retreat, retirement, and handoff need to be published as one intelligible package.

A.16.0:End

U.PreArticulationCuePack

Type: Definitional (D) Status: Stable Normativity: Normative unless marked informative

Plain-name. Pre-articulation cue pack.

Start here when. Your first honest content is a preserve-worthy cue nucleus that should not yet be forced into a claim, route decision, method, or work record.

First output. One U.PreArticulationCuePack with an explicit cue nucleus, preservation rationale, primary witness or anchor when one is load-bearing, and any early lane candidates or route-candidate hints that are already visible.

Typical next governing patterns. B.4.1 when route plurality or route authority becomes publishable, B.5.2.0 for cue-derived abductive prompting, A.6.P, A.6.A, or C.16.Q once endpoint articulation threshold is actually met, and A.16.2 when reopening or retirement becomes the truthful move.

Common neighboring-pattern mistakes. Do not publish a cue pack as a selected-route decision, anomaly statement, evaluative ascription, A.6.A-governed invitation, or work record; if route authority is already explicit, use B.4.1; if endpoint semantics are already stable, apply the governing pattern and its named publication form; if backoff or retirement is the active problem pressure, use A.16.2.

Problem frame

Early governed U.Episteme publications can be worth preserving before route publication, prompt publication, relation repair, evaluative repair, A.6.A-governed invitation repair, method work, or endpoint governance through governing patterns. U.PreArticulationCuePack therefore exists as the earliest durable seam publication form for such pre-threshold cue content.

The cue pack is deliberately earlier than RoutedCueSet. It may carry early directional hints, but it is not yet the governing form for route selection, route authority, or route rationale.

Problem

Without an explicit cue-pack publication form, such epistemes either disappear, are prematurely forced into AnomalyStatement or Characteristic, or leak into prose as vague cue or signal language, loose evaluative talk, fit-talk, premature work-possibility pressure, or premature reliance-possibility pressure.

Forces

ForceTension
Low-articulation shape vs publishabilityPreserve early cues without pretending they are already late U.EpistemePublication forms governed by endpoint patterns.
Pre-route preservation vs later routingLet cue preservation stand independently before route publication is justified.
Carrier awareness vs stack duplicationRespect traces, bodies, and model states without creating a second carrier stack beside A.7.
Plurality vs auditabilityAllow several plausible continuations without collapsing the cue pack into a route record.

Solution

U.PreArticulationCuePack is a typed publishable episteme form that serves as the earliest durable seam publication form inside the language-state cluster. It is not a claim, not a characteristic, not a method, not work, and not a route record. When rendered, it appears on an ordinary MVPK face; cue-pack status is a property of the publication form, not a rival face kind.

A cue pack may exist before any route is selected and even before route-candidate hints can yet be named clearly. When route plurality or route authority becomes explicit enough to publish, the successor publication is governed by B.4.1 and RoutedCueSet.

Core shape

A conforming cue pack may publish:

  • cueNucleus
  • preservationRationale?
  • laneCandidates?
  • routeCandidateHints?
  • valenceProfile?
  • languageStateClosureDegreeRef?
  • languageStateFacetProfileRef?
  • detector?
  • primaryAnchor?
  • candidateAnchors?
  • primaryWitnessRef?
  • witnessRefs?
  • exemplars?
  • contrasts?
  • traceRefs?
  • embodimentRefs?
  • modelStateRefs?
  • scope?
  • GammaTime?

cueNucleus names the minimal preserved core: what exactly is being kept visible rather than lost in carrier noise or premature endpoint wording.

primaryWitnessRef and primaryAnchor provide explicit triage when one witness or anchor is load-bearing for preservation. Secondary witnesses, anchors, traces, embodiment refs, and model-state refs may enrich the pack without displacing that primary nucleus.

laneCandidates and routeCandidateHints are early directional hints only. They are not selected route, route rationale, or route authority state. Those belong to RoutedCueSet under B.4.1.

The cue pack governs none of the facets it references. primaryAnchor, candidateAnchors, contrasts, and exemplars commonly support AE under C.2.4; languageStateClosureDegreeRef docks to C.2.5; anchoring and representation-factor refs dock to C.2.6 and C.2.7; languageStateFacetProfileRef may bundle them through C.2.LS.

In this cluster, a cue is a salient epistemic nucleus extracted from witnesses, traces, felt tensions, model outputs, work-possibility hints, reliance-possibility hints, contrasts, or other grounds and made preservable as a pack. A raw signal-like trace counts as a cue only when that salience and preservability have been made explicit; otherwise it remains evidence, not yet a cue.

Governance boundary

A cue pack may preserve:

  • a cue nucleus,
  • preservation rationale,
  • primary and candidate anchors,
  • primary and secondary witnesses,
  • contrasts and exemplars,
  • early directional plurality or route-candidate hints.

A cue pack shall not silently serve as:

  • a route decision record,
  • a selected-route publication,
  • a finished anomaly statement,
  • a finished evaluative ascription,
  • a finished A.6.A-governed invitation,
  • a method step,
  • a work occurrence.

Transition discipline

A cue pack may admissibly feed:

  • B.4.1 once route plurality or route selection deserves explicit publication;
  • B.5.2.0 after a cue-derived abductive prompt is formed;
  • A.6.P only once articulation threshold and relation-like shape are met;
  • A.16.2 when prior stabilization must be reopened, backed off, respecified, or retired.

Archetypal Grounding

Tell. A cue pack says "there is a preserve-worthy cue nucleus here" without falsely claiming that a later route or endpoint form already exists.

Show (System). A console alert with traces and tension indicators may be worth preserving as a cue pack before anyone can honestly publish route selection, gate logic, or work execution.

Show (Episteme). A researcher's stabilized felt or trace-anchored discrepancy cue with exemplars and contrasts can be published as a cue pack before it becomes a routed cue set, an abductive prompt, or an anomaly statement.

Bias-Annotation

This pattern biases authors toward preserving low-articulation meaningful cues instead of discarding them or disguising them as later publication forms with higher closure state, route authority state, or endpoint authority claim. The counter-bias is deliberate as well: a cue pack must still name what is being preserved and why.

Conformance Checklist

  • CC-A.16.1-1 A cue pack SHALL NOT be presented as a claim, characteristic, method, work occurrence, or route-decision record.
  • CC-A.16.1-2 A cue pack SHALL make cueNucleus explicit.
  • CC-A.16.1-3 When preservation depends on privileged grounding, primaryWitnessRef or primaryAnchor SHALL be explicit.
  • CC-A.16.1-4 laneCandidates and routeCandidateHints MAY be published early, but selectedRoute, routeRationale, and route authority state SHALL NOT be smuggled into the cue pack.
  • CC-A.16.1-5 If route-candidate hints are not yet nameable, publication is still admissible only when preservationRationale and grounding make the preservation need explicit.
  • CC-A.16.1-6 Language-state, anchoring, and representation-factor details MAY be referenced, but their governing patterns remain C.2.LS, C.2.4, C.2.5, C.2.6, and C.2.7.
  • CC-A.16.1-7 A cue pack SHALL NOT silently inherit endpoint authority that belongs to governing patterns.

Common Anti-Patterns and How to Avoid Them

  • Cue as claim. Do not promote the pack into a proposition without a later admissible move.
  • Cue as route record. Do not let selectedRoute, route rationale, or route authority hide inside cue-pack prose.
  • Cue without nucleus. Do not publish only refs and carriers while leaving the preserved core unnamed.
  • Cue without triage. Do not pretend all witnesses or anchors are equally load-bearing when one clearly carries the preservation need.
  • Cue as carrier zoo. Do not make U.PreArticulationCuePack a replacement for A.7 carrier discipline.

Consequences

The benefit is an admissible preservation form for early cues and a cleaner seam into routing and endpoint governing patterns. The trade-off is one more explicit publication form that must be named and maintained.

Rationale

U.PreArticulationCuePack is the earliest durable seam publication in the cluster. It keeps pre-threshold cues visible before route selection and without overloading A.6.P, B.4.1, or B.5.2.

SoTA-Echoing

The pattern fits early cue capture in design, embodied cognition, incident triage, model interpretation, and focusing-like practice, where low-articulation but real cues need preservation before route or endpoint choice.

Relations

  • Builds on: C.2.2a, A.16, C.2.LS, A.7.
  • Coordinates with: A.16.0, C.2.4, C.2.5, C.2.6, C.2.7, B.4.1, B.5.2.0, A.6.A, C.16.Q, A.16.2.
  • Constrains: publication of pre-threshold cues.

Worked Examples and Invalid Publications

Operator cue pack

A valid operator-facing cue pack might preserve:

  • one cue nucleus around a disturbance/work-or-intervention possibility tension,
  • a primary witness trace,
  • candidate anchors from recent operator work step and system response,
  • lane candidates toward intervention, inquiry, and rollback,
  • but no selected route and no final gate decision.

This is admissible because it preserves early significance without pretending the cue is already a route record, a gate, method, or work record.

Inquiry cue pack

An inquiry cue pack may preserve exemplars, contrasts, a felt or trace-anchored discrepancy cue nucleus, and candidate anchor fragments. This is admissible even when the publication is still below both route publication and A.6.P threshold.

Invalid publication to reject

It is invalid to publish a cue pack and then cite it as if it were already an anomaly statement, a routed cue set, an explanatory bundle, or a control obligation. The cue pack is only the preservation form.

Authoring and Review Guidance

Author prompt

A cue pack should answer four questions:

  • what exactly is being preserved?
  • why is it worth preserving now rather than losing it?
  • which witness or anchor currently carries the primary load?
  • which downstream directions, if any, are already visible without pretending that a route has been selected?

Review prompt

A reviewer should check:

  • whether the pack has a clear cue nucleus;
  • whether primary witness or primary anchor triage is explicit when needed;
  • whether it is being abused as a shadow claim or shadow route record;
  • whether route language is still an early directional hint rather than route selection.

Carrier reminder

The cue pack may cite traces, embodiment, and model-state refs, but it should not try to replace A.7 carrier discipline.

Migration and Extension Notes

Migration from vague cue / signal language

Older prose often says merely "there is a signal" or "something suggests a work move". A conforming migration first asks whether the source is truly signal-like in the narrow telemetry or trace sense, or whether the load-bearing phenomenon is a broader cue nucleus, work-possibility hint, reliance-possibility hint, contrast, or figure-against-background shift. It then turns the passage into a cue pack with explicit cue nucleus, primary witness or anchor, and route-candidate hints only if those hints are already visible.

Local extension rule

Contexts may add local cue-pack fields only if they remain preservation aids rather than covert route-decision or endpoint semantics.

Boundary reminder

If a cue pack begins to carry route decision, stable endpoint authority, relation slots, method semantics, work semantics, or other later-pattern authority or signature conditions, the publication is ready to exit this governing pattern.

Cue-Pack Package Discipline

A cue pack is useful only if it preserves enough structure to justify route publication or prompt formation without pretending that a endpoint governing pattern already governs the publication.

Minimal preservation package

A robust cue pack should make visible:

  • the cue nucleus being preserved,
  • the preservation rationale,
  • the primary witness or primary anchor when one is load-bearing,
  • the candidate anchors / contrasts / exemplars that keep the nucleus non-arbitrary,
  • the secondary witnesses or carriers that support it,
  • and the lane candidates or route-candidate hints, if such directional hints are already visible.

This is what turns early cues into an admissible preservation form.

Route-candidate hints are optional, not forbidden

A cue pack is not an archive of low-articulation cues, but it also need not wait until route-candidate hints are fully articulate. If route-candidate hints are already visible, publish them. If they are not yet visible, publication may still be admissible when the cue nucleus, grounding, and preservation rationale make clear why the cue should not be lost.

Valence is not endpoint semantics

Valence, urgency, discomfort, promise, or attraction may explain why a cue is preserved. They do not by themselves establish A.6.A-governed invitation, evaluative, abductive, or route authority.

Cue-Pack Continuations and Non-Continuations

Admissible continuations

A cue pack may continue admissibly into:

  • a routed cue set,
  • a cue-derived abductive prompt,
  • a later lexical-repair family once articulation threshold is met,
  • or a retreat / retirement move when prior stabilization over-committed or no longer deserves current publication.

Non-continuations

A cue pack should not be used directly as:

  • a stable proposition,
  • a route decision,
  • a deontic commitment,
  • a work occurrence,
  • or a measurement-bearing quality endpoint.

Those are not just later stages of the same text. They are different governing forms with different authority/signature conditions.

Multi-direction state versus lineage fork

Several lane candidates or several low-articulation route-candidate hints may live inside one cue pack. That is still one governed publication.

A fork happens only after distinct successor publications are actually issued, each with distinct authority or handoff consequences. Reviewers should not treat pre-route plurality inside one cue pack as if it were already a forked lineage.

Split and merge cases

One cue pack may later split into several route-bearing continuations if its preserved cue nucleus actually contains several tensions. Several cue packs may also merge if later stabilization reveals that they were fragments of one more coherent cue complex. Both cases are admissible if the continuity and later route consequences are published explicitly.

Worked Cue Complexes and Review Tests

Mixed-source cue complex

A cue pack may combine trace refs, embodiment refs, model-state refs, and exemplar fragments. This is admissible provided the pack still identifies what unifies those grounds into one cue nucleus rather than using the pack as an unstructured container for unrelated fragments.

Review test for under-specified packs

A reviewer may ask: if all candidate anchors and witnesses were removed, would anything remain that justifies preserving this pack at all? If the answer is still unclear what is being preserved, the pack is under-specified and should be rewritten, retired, or not published yet.

Review test for covert endpoint capture

A reviewer should also ask whether any sentence in the pack would become false if the endpoint governing pattern and its governed publication form were denied. If yes, the cue pack is already carrying endpoint semantics and needs either an explicit move out of A.16.1 or a rewrite back into preservation language.

Cue-Pack Continuation and Comparative Preservation Rule

Continuation visibility

A cue pack should make it visible whether the preserved cue nucleus is being kept open, route-published later, split, merged, or retired.

Preservation worthiness test

Keep a cue pack only when its nucleus would likely be lost or distorted without it. If the same cue already lives stably in a receiving governing form with a more closed state, route authority state, or endpoint authority claim, the cue pack has become redundant.

Comparative preservation rule

Compare cue packs only when nuclei, primary witness choice, primary anchor choice, and any early directional hints are explicit. Emotional intensity, rhetorical urgency, or author confidence are not admissible comparison proxies.

Witness and Carrier Triage

Witness priority rule

Not all witnesses play the same role. Authors should distinguish the witness that anchors the cue nucleus from secondary witnesses that only enrich or corroborate it. Without that distinction, cue packs become hard to route because everything in the pack starts looking equally load-bearing.

Carrier overload boundary

A cue pack may cite traces, embodiment, model-state refs, or document fragments, but it should not absorb their full carrier semantics. When carrier analysis itself becomes central, A.7 or another carrier governing pattern should be cited explicitly rather than silently embedded into the pack.

Early directional plurality rule

Plural lane candidates or plural route-candidate hints are not a flaw. If the same cue nucleus pulls toward several governing patterns, the pack should keep that plurality visible until B.4.1 narrows it into explicit route publication. The error is not plurality; the error is hiding plurality under a single convenient gloss.

Review Matrix and Migration Tests

A reviewer can test a cue pack with four questions:

  1. What exactly is being preserved? If the nucleus is unclear, the pack is under-specified.
  2. Why this pack rather than a receiving governing form with a more closed state, route authority state, or endpoint authority claim? If the answer is only habit, the pack may be redundant.
  3. Which witness or anchor is primary? If none can be named where triage matters, the pack may be storage rather than preservation.
  4. Which downstream directions remain live, if any? If the publication hides them, later routing will be distorted.

Migration from legacy signal language should therefore reconstruct not just a vague "signal", but the preserved cue nucleus, its primary witness or anchor, and any directional hints that are already honestly visible.

A.16.1:End

Reopen / SketchBackoff / Respecify

Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative

Plain-name. Admissible reopen / backoff / respecification.

Problem frame

A governed history across the language-state chart must support admissible retreat as well as tightening. When a route, publication form, or framing scaffold over-commits, teams need a first-class way to reopen, back off, respecify, or retire a branch without pretending nothing changed.

Problem

Without an explicit retreat pattern, teams treat reopening as failure, hide regressions, silently mutate endpoint-bound or route-bearing forms back into exploratory cue-bearing publication forms with no audit trail, or let obsolete branches disappear without any visible withdrawal note.

Forces

ForceTension
Reversibility vs trustAllow backoff without making the trajectory discipline look arbitrary.
Explicit retreat vs clutterName retreat and retirement without drowning the model in bookkeeping.
Witness retention vs honest revisionKeep what remains valid while explicitly discarding what no longer holds.
Framing revision vs repair-pattern boundaryAllow route-specification or framing-scaffold revision without letting A.16.2 swallow slot-explicit epistemic precision repair from governing patterns.

Solution

This pattern defines the retreat, reframing, and retirement side of the A.16 move family.

Move family

MoveWhen to use itWhat remains stableWhat may change
reopenthe current family is still right, but closure was over-committedfamily and major orientationclosure, rival set, guards
sketchBackoffthe current publication form overstates articulation or stabilitywitnesses, traces, some anchorspublication form, articulation-explicitness value, route certainty
respecifythe family remains plausible, but the framing scaffold, route specification, or facet-profile reading is wrongbroad domain, witness base, and major family commitmentsframing scaffold, route specification, facet-profile reading
retirea cue, route-bearing publication, or branch is no longer current or no longer worth preservinghistorical continuity and any cited witnesses that still mattercurrentness, authority, successor/no-successor status

respecify is intentionally narrower than epistemic precision repair. Slot-explicit epistemic precision restoration, bearer repair, or endpoint-local lexical precision remains with governing patterns such as A.6.P, C.16.Q, and A.6.A.

Required publication note

Every retreat or retirement move shall name:

  • source publication form,
  • source articulation / closure / route-authority state,
  • trigger or counter-evidence,
  • target family or target publication form,
  • retained witnesses,
  • withdrawn assumptions, route claims, or authority,
  • and whether a successor now exists or the branch is retired without successor.

Authority discipline

A retreat or retirement move shall not silently preserve operational, gate, commitment, or route authority if the retreat target form no longer supports that authority.

Archetypal Grounding

Tell. Backoff is not regression; it is an admissible transduction when the current publication form over-commits. Retirement is not erasure; it is admissible withdrawal when continuation no longer deserves current authority.

Show (System). A rollback cue may reopen a prior decision path instead of pretending the original operationalization still holds, or retire one branch once a better-supported successor line has taken over.

Show (Episteme). A formalized hypothesis may sketch-backoff to a cue pack when its framing collapses under new exemplars, or it may respecify its route specification while leaving slot-explicit epistemic precision repair to governing patterns.

Bias-Annotation

The pattern pushes against false linear progress narratives. The cost is that teams must expose when closure or route authority is being relaxed, reframed, or retired.

Conformance Checklist

  • CC-A.16.2-1 Retreat or retirement moves SHALL cite the trigger or counter-evidence that justifies them.
  • CC-A.16.2-2 A retreat or retirement move SHALL NOT silently preserve endpoint authority if the target form no longer supports it.
  • CC-A.16.2-3 Reopen / backoff / respecify / retire moves SHOULD preserve witnesses and trace links whenever still valid.
  • CC-A.16.2-4 The target articulation, closure, and route-authority state SHALL be explicit when the move substantively changes any of them.
  • CC-A.16.2-5 respecify SHALL NOT be used to smuggle slot-explicit epistemic precision repair out of governing patterns.

Common Anti-Patterns and How to Avoid Them

  • Shame-driven concealment. Teams hide the retreat. Publish the move.
  • Silent downgrade. The publication loses closure state, route authority state, or endpoint authority claim but no one updates the route or authority state.
  • Retreat as erasure. Earlier witnesses disappear even though they remain valid.
  • Respecify as silent repair. respecify is used to hide a real epistemic precision restoration that belongs to later repair governing patterns.
  • Silent branch disappearance. A branch stops mattering, but no retirement or supersession note is published.

Consequences

The benefit is explicit reversibility, reframing, and retirement handling. The trade-off is more explicit transition records and more explicit governance notes.

Rationale

Language-state history is not one-way tightening. Without retreat and retirement discipline, A.6.P and endpoint forms would encode only one-way progress and would hide the real cost of over-commitment.

SoTA-Echoing

This fits iterative design, incident response, scientific reframing, embodied inquiry, and exploratory model work where recovery from over-commitment and honest branch retirement are part of competent practice.

Relations

  • Builds on: A.16, C.2.5.
  • Coordinates with: C.2.2a, A.16.0, A.16.1, B.4.1, B.5.2, A.6.P, A.6.A, C.16.Q.
  • Constrains: admissible retreat, respecification, and retirement paths.

Worked Retreat Trajectories

Reopen within the same family

A routed evaluative note may remain within the same family but move from high closure to lower closure when a rival frame reopens. This is reopen, not sketchBackoff.

Sketch-backoff to cue pack

An over-specified A.6.A-governed invitation may later prove premature. The admissible retreat is:

actionInvitation -> sketchBackoff -> U.PreArticulationCuePack

with explicit withdrawal of route authority that no longer holds.

Respecify without repair-pattern drift

A route-bearing publication may keep the same broad family but replace one framing scaffold or route specification with another. That is respecify, not silent editing, and not slot-explicit epistemic precision repair.

Retire an obsolete branch

A route-bearing branch may later become obsolete because another branch now carries the governing pattern and witness support for the current use. The admissible continuation is explicit retire, not silent disappearance.

Authoring and Review Guidance

Author prompt

A retreat or retirement note should say:

  • what proved over-committed or no longer current,
  • what remains valid,
  • what authority is withdrawn,
  • what publication form now becomes appropriate,
  • and whether any successor carries the continuity forward.

Review prompt

A reviewer should ensure that retreat does not become silent erasure. Valid witnesses should survive unless explicitly discarded with reason, and retired branches should either name a successor or say clearly that none exists.

Boundary reminder

Retreat is an admissible move, not a rhetorical excuse to avoid publishing mistakes. The value of the pattern depends on making the retreat or retirement visible.

Migration Notes

Migration from regression language

Older language often talks about "going backwards" or "regressing". The preferred migration is to name whether the change is reopen, sketch-backoff, respecify, or retire, and what boundary or authority consequence follows.

Integration reminder

When retreat affects governing patterns such as A.6.P, A.6.A, C.16.Q, or A.15, those governing patterns should be updated explicitly rather than left to drift on stale authority.

Retreat Package Discipline

A retreat is trustworthy only when it makes visible what changed, what survived, and what authority no longer holds.

Minimal retreat note

A retreat note should make explicit:

  • the source form and authority-reference relation state,
  • the triggering mismatch or counter-evidence,
  • the move kind,
  • the target form or target family,
  • the retained witnesses,
  • the withdrawn assumptions or route claims,
  • the required downstream updates for any affected governing pattern,
  • and the successor / no-successor status if a branch is retired.

Retreat is not erasure

Retreat preserves continuity: a high-closure formulation or formulation with endpoint authority claim was adopted, then shown to over-commit in stated respects, and therefore backed off or withdrawn admissibly.

Partial retreat

Some retreats withdraw only one route claim, scope assumption, framing scaffold, or operational hook. In those cases name the surviving core rather than resetting everything.

Retained vs Withdrawn Authority

Reopen

reopen usually preserves the family and much of the surrounding structure while withdrawing closure. It reintroduces rival possibilities without claiming that the entire earlier publication was inadmissible.

Sketch-backoff

sketchBackoff withdraws closure state, route authority state, or endpoint authority claim more sharply. It typically preserves witnesses, exemplars, or cue anchors while withdrawing the over-committing publication form and any authority that depended on that form.

Respecify

respecify keeps the broad family but changes framing scaffold, route specification, or facet-profile reading. It is neither pure retreat nor silent edit: it preserves enough of the prior publication to justify continuity, but it does not authorize semantic slot repair that belongs to governing patterns.

Retire

retire ends current authority for a cue, route-bearing publication, or branch while preserving historical continuity. It may point to a better-supported successor or explicitly state that no successor currently exists.

Worked Recovery Cases

Reopening a routed evaluative note

An evaluative note may have reached a high closure state under one route, but new contrasts reopen a serious rival. reopen is admissible when the bearer, family, and witness base remain largely intact but the closure claim must be relaxed.

Sketch-backoff from prompt to cue pack

An abductive prompt may later prove over-committed because its open question was formulated before the cue anchors had stabilized. The admissible recovery is to sketch-backoff to U.PreArticulationCuePack, preserving the cue carriers while withdrawing prompt authority.

Respecifying a route specification

A route-bearing publication may keep the same general direction but replace one route specification with another when later review shows that the original framing selected the wrong governing pattern family. The point of respecify is to make that replacement visible without pretending the earlier route specification never existed.

Retiring a route branch

A route-bearing branch may later be withdrawn because better-supported grounds, clearer closure, or a more adequate successor publication now carry the work. retire keeps that withdrawal visible instead of letting the branch vanish into later prose.

Review Matrix for Retreat Integrity

A reviewer can test retreat integrity with five questions:

  1. Was the trigger explicit? If not, the retreat risks becoming retrospective narrative repair.
  2. Was authority updated? If the earlier publication with named authority-reference relation, evidence-support class, or gate/admission basis no longer applies, any dependent route-bearing publication, gate decision, or endpoint authority claim must have been revised.
  3. Did valid witnesses survive? If all earlier grounding disappeared without reason, the retreat probably became erasure.
  4. Was the move kind correctly named? Reopen, sketch-backoff, respecify, and retire solve different problems; confusing them obscures what actually changed.
  5. If a branch was retired, was successor / no-successor status explicit? If not, retirement may be hiding silent laundering.

The matrix is intentionally small: A.16.2 should keep retreat legible, not surround it with decorative procedure.

Required Downstream Repairs

Stale downstream publication/work-target rule

A retreat or retirement often leaves stale downstream publications or work targets behind: prompts, A.6.A-governed invitations, evaluative notes, requirement candidates, or work hooks that were admissible only under the prior state with higher closure state, route authority state, or endpoint authority claim. A conforming retreat should therefore name which downstream publications or work targets remain valid, which must be revised, and which must be withdrawn.

Narrow retreat propagation

Retreat propagation should be as narrow as truth permits. If only one framing scaffold failed, then only the downstream publications or work targets that depend on that scaffold need revision. Over-broad rollback is wasteful; under-broad rollback leaves false authority in circulation.

Retreat timestamping and witness continuity

Where several revisions exist, the retreat note should make clear which earlier publication it revises and which witness set still carries continuity across the revision. Without that linkage, readers may not know whether two nearby texts are alternative drafts or a genuine retreat sequence.

Comparative Retreat Rule

Retreat kinds are not interchangeable

reopen, sketchBackoff, respecify, and retire solve different problems. Comparing them as if they all meant "we stepped back" erases the specific authority change each one makes.

Honest recovery over softening prose

A context may prefer softening language such as "refined further" or "adjusted slightly" even when a real retreat or retirement occurred. A.16.2 rejects that habit. If authority fell, closure dropped, framing was withdrawn, or a branch was retired, the move should be named directly.

Boundary to silent editing

If a publication is simply rewritten and no continuity or authority story is preserved, that is editing, not A.16.2. Retreat is a reviewable move only when the earlier high-closure form or form with endpoint authority claim remains part of the visible history.

Review Addendum for Retreat Integrity

Add three checks to the base retreat matrix:

  • Were downstream dependencies updated?
  • Was the propagation scope truthful?
  • Does the revised history remain legible?

These checks keep A.16.2 tied to explicit recovery and retirement rather than narrative smoothing.

A.16.2:End

Canonical “Characteristic” (A.CHR‑NORM)

Context

To have reproducibility and explainability there is a need to measure various aspects of systems or knowledge epistemes or publications. A dedicated measurement backbone (see C.MM‑CHR, Measurement & Metrics Characterization) already exists, prescribing the CSLC discipline – i.e. define a Characteristic, choose a Scale (with a Unit if applicable), record a Level/Value, and thus obtain a Coordinate on that scale, optionally mapping to a Score via a ScoringMethod (USCM). However, historically multiple near-synonyms (“axis”, “dimension”, “property”, “feature”, "metric") have been used interchangeably for “what is being measured,” and often the aspect itself gets conflated with how it is expressed (units, ranges, labels). This pattern enters the FPF Kernel lexicon to canonize a single term for the measured aspect and enforce a clear separation between what is measured and how it is measured.

Problem

When measurement concepts are not kept rigorously distinct, several issues arise:

  • Polysemy at the anchor. Teams say “dimension” or “feature” but mean slightly different things, so the very trait being measured is ambiguous.

  • Arity mistakes. A relational quality (e.g. similarity between two items) might be treated as if it were an intrinsic property of one item, or vice versa, leading to logical errors.

  • Expression conflation. The aspect being measured is often mixed up with its expression – for example, using “scale” or “axis” to mean both the quality and its unit or range. This leads to unsafe arithmetic (averaging ordinal ranks, comparing raw numbers from incompatible scales, etc.) because values get interpreted out of context.

In summary, projects lacking a canonical terminology for metrics risk miscommunication and pseudo-quantitative operations. Measurements of physical quantities, architectural attributes, or performance scores end up on incommensurate rails due to inconsistent naming and handling.

Forces

  • F1 – Single anchor of meaning. Any numeric value is meaningless unless one can ask “value of what?”. The measurement’s meaning must be anchored in a single clearly named aspect.

  • F2 – Arity clarity. Some characteristics apply to a single entity (e.g. its mass or length), while others inherently relate multiple entities (e.g. distance between two points, coupling between modules, agreement between judges). If arity isn’t explicit, claims and calculations become corrupted.

  • F3 – Scale integrity. Different kinds of scales permit different operations – e.g. you can average temperatures (ratio scale) but not ranks or grades (ordinal scale) without losing meaning. If one mixes values without regard to scale type or units, the result is nonsense (pseudo-arithmetic).

  • F4 – Composition discipline. In complex evaluations, multiple measurements may need to be combined. Without a disciplined approach, people might perform ad-hoc math on apples and oranges (adding scores from unrelated characteristics, etc.). A proper pattern must require any combination to go through a defined monotonic ScoringMethod (e.g. a weighted formula) instead of arbitrary aggregation.

  • F5 – Transdisciplinarity. The measurement framework should work for any domain. The same conceptual scaffold must serve physical science (e.g. lab temperature readings), software engineering (e.g. module cohesion ratings), and even subjective assessments (e.g. figure-skating scores) without bias. One vocabulary, many CG‑frames.

  • F6 – Open-endedness. As systems evolve, their performance or quality metrics also evolve. Rigid stage labels (“Phase 1, Phase 2…”) don’t capture iterative improvement. The pattern should favor an open-ended state-space view (revisiting states via checklists, as in an RSG – RoleStateGraph with re-entry) over any fixed stage sequence with “terminal” stages.

Solution

Establish “Characteristic” as the one canonical construct for “what is measured.” In every FPF context, the aspect or trait being measured MUST be referred to as a Characteristic. This term replaces “axis” or “dimension” in normative usage (those may appear only as explanatory aliases in Plain register). By fixing a single name and schema, we cleanly separate a Characteristic from its Scale (and Unit), and from any observed Value/Level on that scale. The solution also differentiates single-entity vs multi-entity cases and binds all measurements to the standard CSLC sequence.

To enforce this solution, the following rules apply:

  • A17-R1 (Canonical term). In all normative models and specifications, the measured aspect SHALL be referred to as a Characteristic. (Legacy terms “Axis” or “Dimension” are retired from technical vocabulary – see Part J Lexicon Update.)

  • A17-R2 (Entity vs. relation subtype). Each Characteristic MUST declare its intended arity. An Entity-Characteristic applies to exactly one bearer (e.g. Temperature of a reactor, Evolvability of a software module), whereas a Relation-Characteristic applies to an ordered tuple of two or more bearers (e.g. Distance between two sensors, Coupling between modules, Agreement among reviewers). The arity is part of the definition and must be explicit wherever it’s not obvious from naming.

  • A17-R3 (Characteristic space). Any set of defined Characteristics spans a multi-dimensional CharacteristicSpace. Movement or evolution is then described as trajectories through this space (with states revisited or refined over time), rather than as a linear stage sequence through preset phases. This ensures measurements feed into open-ended state modeling rather than locking into “end states.”

  • A17-R4 (Lexical guardrails). Normative text SHALL use only the canonical measurement terms: Characteristic, Scale, Level, Value, Coordinate, Score, Normalization, Unit. Synonyms like axis, dimension, metric, grade, property, etc., are forbidden in formal usage. (They may appear in narrative explanations or user-facing documentation only if clearly defined as aliases for the canonical terms.) Authors MUST not use deprecated terms in identifiers or formal statements, and any didactic alias should be introduced with an explicit mapping to the official term. These lexical rules uphold clarity and are further detailed in E.10 LEX‑BUNDLE.

  • A17-R5 (Symbol policy). Γ reserved for holonic composition; 𝒢 : Coordinate→Score for metric‑level ScoringMethod; MUST NOT be conflated; documents SHALL NOT reuse Γ for ScoringMethod. If an ordered Scale is declared, polarity SHALL be fixed; 𝒢 MUST be monotone w.r.t. that polarity.

  • A17-R6 (Declared polarity). Every ordered Scale SHALL declare one of: ↑‑better, ↓‑better, or non‑applicable (for purely nominal scales). For interval/ratio scales, polarity fixes the intended order of comparison.

  • A17-R7 (Monotonicity against polarity). If a template declares an ordering polarity on its Scale (↑ better / ↓ better), then 𝒢 MUST be monotone w.r.t. that polarity: higher‑is‑better (resp. lower‑is‑better) in coordinates implies ≥ (resp. ≤) in scores.

  • A17-R8 (Arity declaration). Authors SHALL mark a Characteristic as U.EntityCharacteristic (applies to exactly one bearer) or U.RelationCharacteristic (applies to a relation of cardinality ≥ 2). Examples: Cohesion → entity‑level; Coupling → relation‑level.

  • A17-R9 (Relational scale anchors). For relation‑level cases, the Scale’s admissible values SHALL be defined over the tuple domain (e.g., distances, similarities, inter‑role latencies). Ambiguity that re‑reads a relational Characteristic as unary is forbidden.

  • A17-R10 (Intension vs Description). The Characteristic remains the Characteristic EntityOfConcern; any rubric, catalogue of levels, or examples are Description epistemes. Keep the intensional Characteristic distinct from its descriptive episteme (cf. U.Episteme roles: Object–Concept–Symbol).

CharacteristicSpace & Change Reasoning (Normative/Clarifying)

R17 — CharacteristicSpace declaration. When an agent reasons about change, it SHALL name the CharacteristicSpace (the set of Characteristics, with Scales, units, and topology assumptions) in which motion is considered.

R18 — RSG framing, not lifecycle. Change narratives SHALL be framed as movement on a reachable‑states graph (RSG) with checklists that certify state acquisition; “lifecycle” staging is deprecated. (A.17 conforms to the open‑ended evolution stance of the Kernel.)

I7 — Vector interpretation. A U.Coordinate vector may collect multiple coordinates for multi‑Characteristic reasoning; composition into a single Score, if desired, is an explicit new 𝒢 on that vector.

Archetypal Grounding (System & Episteme Examples)

In a physical system (U.System): Consider a Distance Characteristic defined for a pair of physical objects. For example, two machines in a factory have a Distance of 3.5 meters between them. Here Distance is a Relation-Characteristic (applies to the pair), with an associated Scale (e.g. a ratio scale in meters), and the measured 3.5 m is a Coordinate on that scale. If we instead look at an Engine Temperature Characteristic (unary), a particular engine might have a Temperature of 350 K at some moment – Temperature (the Characteristic) is clearly separated from how it’s measured (Scale in Kelvin) and the reading (350, a Coordinate on that scale).

In an epistemic context (U.Episteme): Consider a Formality Characteristic to rate a documentation episteme's rigor. We might define an ordinal Scale with named Levels such as Informal, Semi-formal, Formal. A given specification document can then be said to have High Formality – meaning it occupies the “Formal” Level on the Formality Scale. Here Formality (Characteristic) captures what we measure about the document, while the tiered Scale (with qualitative levels) expresses how we categorize it. Because we use an ordinal scale, we can rank documents by Formality, but we would not average “Semi-formal” and “Formal” (avoiding meaningless arithmetic on an ordinal metric). In another knowledge context example, one could define a Characteristic Reliability for a knowledge source with a percentage Scale from 0 to 100%. An article’s reliability might be 85% – which is only interpretable by knowing it refers to “Reliability” on a 0–100% Scale (i.e. a specific Coordinate on that Characteristic’s scale).

Bias-Annotation

This pattern is deliberately domain-neutral and introduces no bias toward any particular discipline or measurement type. By enforcing a uniform lexicon, A.17 actually mitigates bias: it prevents disciplinary jargon from creeping into core definitions (ensuring, for instance, that a software metric isn’t given a vague custom term when it’s fundamentally a Characteristic). The Didactic lens is served: using one precise name per concept improves clarity for all audiences. There is a slight initial cost in re-labeling legacy terms (e.g. renaming “dimensions” to Characteristics), but this is offset by the long-term Cognitive Elegance (P‑1) – the framework becomes easier to learn and less prone to misinterpretation. No single domain’s terminology dominates, and the pattern explicitly supports both quantitative (physics-like) and qualitative (judgment-based) measurements, reflecting Pragmatic neutrality. The requirement of open-ended state-space thinking aligns with P‑10 (Open-Ended Evolution), ensuring we don’t bake in lifecycle biases that assume development must terminate at a final stage. In summary, A.17 imposes a disciplined vocabulary that is broad enough for all fields and free of hidden assumptions, thereby avoiding subtle ontological or cultural biases in the measurement model.

Conformance Checklist

When authoring or reviewing FPF-compliant metrics, use the following checklist to ensure Characteristic normalization is applied:

  1. Declared Characteristic: Have you explicitly named a Characteristic for each aspect being measured, instead of using generic terms? (e.g. use “Reliability” as a Characteristic name rather than saying “this dimension”).

  2. Arity Explicit: Is it clear whether the Characteristic is unary or relational? If a metric involves a relationship, are the participating entities (pair, tuple, etc.) identified in its definition?

  3. Separate Scale/Unit: For each Characteristic, have you defined the Scale (and Unit, if applicable) separately, rather than embedding units or ordinal terms in the name of the Characteristic? (e.g. “Length (m)” should be captured as Characteristic = Length, Unit = meter).

  4. Scale-appropriate operations: Are you only performing comparisons or calculations that make sense for the declared scale type? (No averaging of ranks, no mixing of units – ensure ordinal Characteristics aren’t treated like numbers, and interval/ratio values respect zero and units.)

  5. No implicit aggregation: If multiple measurement readings are combined, is there a defined ScoringMethod (with monotonic logic) that produces a Score? Avoid any ad-hoc “overall score” that simply adds or averages raw values from different Characteristics.

  6. Canonical terminology in use: Are you using the terms Characteristic, Scale, Level/Value, Coordinate, Score, ScoringMethod, Unit in all formal descriptions? Confirm that no deprecated synonyms (axis, dimension, etc.) appear in technical content or identifiers (they can appear in Plain explanations only with proper reference to the canonical term).

  7. Open-ended progression: (If applicable) When modeling progress or change using metrics, have you considered using a state-space of Characteristics rather than a fixed sequence of phases? This check is to encourage leveraging the open-ended nature of CharacteristicSpaces, especially in evolutionary or iterative processes.

(Failure to satisfy the above indicates a violation of this pattern’s intent. The LEX-BUNDLE rules in E.10 provide automated checks for term usage, and MM-CHR templates enforce explicit Characteristic/Scale definitions.)

Consequences

By instituting Characteristic as the single term and enforcing the CSLC structure, this pattern yields several positive outcomes:

  • Unambiguous metrics: Every measurement has a single, well-defined anchor of meaning – the Characteristic – eliminating guesswork about “what is this number about?”.

  • Separation of concerns: We cleanly separate what is measured from how it’s represented. The Characteristic names the quality of interest, while the Scale/Unit defines the expression. A raw value now means nothing by itself – it must be read as “X units on the Y scale of Z Characteristic,” which greatly reduces misinterpretation.

  • Unary vs. relational clarity: The explicit distinction between Entity-Characteristic and Relation-Characteristic ensures that relational properties (like “distance between A and B” or “consistency among experts”) aren’t mistakenly treated as inherent properties of a single object. This guards against logical errors and data modeling mistakes.

  • Cross-domain comparability: All measurements, regardless of domain, follow the same CSLC rails. This means a temperature in Kelvin and a reliability score in percent can each be traced through Characteristic → Scale → Coordinate. They can’t be directly compared unless designed to be, which is good: any composite scoring must be done via an explicit SCP mapping to a common Score scale. The pattern thus enables interoperability (through well-defined Score bridges) while preventing illegitimate comparisons.

  • Consistent evolution framing: By retiring the idea of a bespoke fixed stage sequence for every process and instead viewing changes as movement in a CharacteristicSpace, the pattern aligns metric thinking with state-based reasoning (e.g. as used in dynamic models). There is no artificial “final state” for improvement – a system can always evolve to a new coordinate without violating a declared state model. This open-ended view encourages continuous improvement and refinement, echoing FPF’s emphasis on evolutionary development.

There are few downsides. One consequence is that modelers must learn the canonical terms and possibly refactor existing documentation (a short-term effort). Also, enforcing scale integrity means quick-and-dirty aggregate scores are not allowed unless justified via a SCP – this introduces a healthy “pause” to ensure composite metrics are well-founded. Overall, the benefits in clarity and correctness far outweigh the overhead. Teams gain a lingua franca for metrics, and the risk of metric abuse (mixing apples and oranges) is significantly reduced.

Rationale

The Canonical Characteristic pattern is a direct response to recurring measurement pitfalls. By insisting on “one precise name per concept”, it upholds Strict Distinction (A.7), ensuring that the framework never treats two different ideas as one. For instance, earlier practice might label both a requirement category and its score as “dimension,” causing confusion; with A.17, the aspect is a Characteristic and its score is separate, so each idea has its place. This clarity is pedagogically vital (P‑2 Didactic Primacy): readers and contributors immediately know what a term means and how to interpret any value associated with it.

The solution also draws on fundamentals of measurement theory (Stevens’ levels of measurement) to prevent misuse. By encoding scale types and unit handling into our patterns, we avoid the “pseudo-quantitative” fallacies – no more averaging things like risk levels or adding up grades as if they were true numbers. In effect, A.17 puts a safeguard around P‑1 Cognitive Elegance and P‑7 Ontological Parsimony: we use a minimal, universal set of measurement constructs, and we avoid bloating the conceptual space with domain-specific or redundant terms. One canonical set of terms also makes the framework more teachable and composable across contexts, since patterns and projects aren’t inventing new synonyms that others must decipher.

Importantly, distinguishing Entity vs Relation Characteristics future-proofs the reasoning model. It enforces a modeling rigor seen in domains like physics (where properties vs. relations are carefully distinguished) and brings it to architecture and knowledge domains. This rigor supports advanced reasoning in FPF – for example, A.3.3 (Dynamics) can treat system state variables as a well-defined set of Characteristics, and assurance patterns can trace evidence metrics unambiguously to the exact aspect measured. It also means any attempt to compare or combine metrics has to be explicit (via ScoringMethods), which inherently improves transparency and auditability (a key FPF goal).

Finally, retiring fixed-stage vocabulary in favor of state-space trajectories aligns with FPF’s open-ended evolution principle. It acknowledges that improvement is not a predefined path but a navigable space. This shift in mindset (from fixed stages to checklisted state transitions) removes an implicit bias that systems ought to reach a “final” maturity stage – instead, it keeps the door open for perpetual refinement, which is philosophically aligned with continuous learning and adaptation.

In summary, A.17 is the linchpin that turns a loose collection of measurement practices into a coherent, principle-driven system. It rationalizes the language, thereby rationalizing thought: by speaking in one clear voice about measurements, FPF ensures that every number in the system can be trusted to answer “value of what, on what scale, relative to what context.” This rationale is reflected in improved model integrity and cross-domain trust in the meaning of metrics.

Relations

  • Builds on / Elaborates: FPF Core Measurement Schema (as outlined in C.16). A.17 lifts the metric template concepts from C.16 into a kernel-level rule. It also reinforces A.7 Strict Distinction, by giving each measurement concept a unique name and forbidding overloaded terms.

  • Constrains: All other patterns that define or use metrics. For example, A.3.3 U.Dynamics (system dynamics) must name its state variables as Characteristics with proper scales (it cannot refer to them loosely as “KPIs” without context). Similarly, any service-level targets / SLO clauses (A.2.3 U.PromiseContent.acceptanceSpec) or assurance calculations (B.3, D.3 patterns) that involve measurements are governed by this canonical terminology (no unwarranted synonyms or unit confusion per ISO/IEC 80000, ISO/IEC 25024, QUDT, SOSA/SSN best practices). The pattern’s lexical rules are part of the LEX-BUNDLE (E.10) – any FPF-conformant context must adhere to these naming conventions.

  • Coordinates with: A.18 (CSLC-KERNEL), which defines the minimal Characteristic/Scale/Level/Coordinate Standard in detail. A.17 provides the vocabulary and basic distinctions (what is a Characteristic, and its arity), while A.18 applies this to ensure each measurement template is well-formed. Also coordinates with C.KD-CAL and C.CHR-CAL (Knowledge Dynamics Calculus, Characterization Calculus) – those patterns use the Characteristic/Scale constructs to build domain-specific metrics (e.g. knowledge quality scores) and rely on A.17’s canon for consistency.

  • Anticipates: E.10 Lexical Discipline rules – A.17’s enforcement of a single term and controlled aliases is a concrete instance of the lexical uniformity mandated in E.10. It also paves the way for F.7 Concept-Set Bridges in Unification patterns, since external ontologies for quantities (ISO 80000, QUDT, etc.) can be mapped cleanly onto FPF Characteristics now that the term is fixed. In short, A.17 is a foundational lexicon pattern that a) ensures internal consistency and b) simplifies alignment with external standards for measurable properties.

A.17:End

Minimal CSLC in Kernel (Characteristic ⟷ Scale ⟷ Level ⟷ Coordinate) (A.CSLC‑KERNEL)

Aliases (for narrative use only): “Axis” (≈ Characteristic), “Point” (≈ Coordinate). (These colloquial aliases may be used in Plain language explanations, but never in formal identifiers or normative text.)

Problem Frame

We often need to characterize some aspect of a subject, whether the subject is one entity or a relationship between entities. Whether it’s recording a physical quantity, an architectural property, or a performance rating, the characterization must:

  • remain domain-neutral (work for engineering metrics, subjective scores, etc.),

  • ensure that two measurements are comparable if and only if they share the same defined aspect and scale, and

  • accommodate both ordered tiers (qualitative levels like Low/Medium/High) and numeric magnitudes (continuous or interval values) without mixing them up.

In FPF’s kernel, the CSLC pattern (CG‑frame–Scale–Level–Coordinate) provides the minimal vocabulary and constraints to achieve this. It defines how one Characteristic ties to one Scale, and how any measured value can be treated as a Coordinate on that scale (with an optional named Level if the scale is discrete or tiered). The context here is the need for a unified Standard so that every single measurement can be interpreted and compared on common grounds.

Problem

Uninterpretable values. A raw number or label means nothing without knowing what aspect it measures and how it is measured. The string “4”, the label “High”, or the real number 9.81 convey no insight unless we know which Characteristic they pertain to and the Scale that gives them meaning. In cross-disciplinary work this ambiguity is magnified: a “5” could be a risk rank (ordinal), a length in meters (ratio), or a satisfaction score (perhaps interval). Common failure modes include:

  • In ordinal settings (e.g. expertise levels Novice < Skilled < Expert), one can rank values but not meaningfully add or average them. Treating ordinal labels like numbers (e.g. averaging Novice=1, Expert=3) produces invalid results.

  • In cardinal settings (e.g. seconds, meters, degrees Kelvin), arithmetic operations do make sense – but only if units are respected and zero is meaningful (for ratio scales). If we strip away units or mix scales (seconds vs. minutes), we again get nonsense.

Without a strict Standard, one team might treat “High” and “Medium” as having a numeric gap, another might average 4 (on a 5-star scale) with 4 (as 4 seconds) because both are “4”. Inconsistent practices make cross-domain reasoning impossible. We need a kernel-level solution that fixes: (a) the aspect being measured, (b) the scheme by which it’s measured, and (c) the type of scale structure (ordinal vs. metric), and that ensures each reported value is bound to that scheme. At the same time, the Standard should not force artificial numeric detail where it isn’t applicable (e.g. we shouldn’t assign meaningless numbers to purely qualitative tiers just to satisfy a structure).

Forces

  • F1 – Transdisciplinarity. The pattern must uniformly handle measurements in physical domains (e.g. length, time, temperature), system attributes (e.g. a module’s coupling or reliability), and human judgments (e.g. user satisfaction scores). It needs to be neither overly quantitative (alienating softer domains) nor overly qualitative (lacking precision for hard science).

  • F2 – Comparability vs. freedom. We want to compare “like with like” – e.g. two readings of the same Characteristic on the same Scale – with absolute confidence. At the same time, the system should allow different Scales for the same Characteristic when necessary (for example, one project might measure Quality on a 0–5 star scale, another on a 0–100 percentage scale). The pattern must permit such flexibility without letting those differing scales be conflated.

  • F3 – Ordinal vs. cardinal integrity. The Standard should preserve the nature of the data: order-only vs order+distance. If something is ordinal (ranks, grades), the framework should prevent unwarranted numeric operations on it. If it’s cardinal (real-valued with units), the framework should enable arithmetic but still keep track of units and zero. In essence, it must protect ordinal data from “leaking” into interval arithmetic.

  • F4 – Named tiers vs. continuous magnitudes. In many domains, named Levels (tiers or grades) are useful – e.g. Technology Readiness Levels or bond credit ratings – whereas in others, a continuous scale is needed. The pattern should support optional Level labels (for tiered scales) without forcing every scale to have such labels. In other words, Levels are an add-on for discrete/tiered scales, not a requirement for truly continuous measures.

  • F5 – Method agnosticism. The kernel Standard should say what must be defined (Characteristic, Scale, etc.) but not prescribe how measurements are obtained. Whether a value comes from a sensor reading, a simulation, or an expert judgment is up to the respective patterns (e.g. Sys-CAL vs. KD-CAL). The pattern must not bake in any process or scoring methodology; it only ensures that once a measurement exists, it’s well-formed and comparable. This avoids locking in any particular assessment method.

Solution

Adopt a minimal “one characteristic – one scale – one coordinate (value)” Standard for all measurements. In the FPF kernel, any metric must bind exactly one Characteristic to exactly one Scale, and any observation produces one Coordinate (value) on that Scale (with an optional Level name if the scale has discrete tiers). We nickname this the CSLC clause:

Exactly one Characteristic + exactly one Scale ⇒ one Coordinate (value), with an optional Level.

Concretely, the parts of this clause are defined as follows:

  • Characteristic: the aspect or feature being measured (the “CG‑frame” along which comparison is made). It answers “What are we measuring?” – e.g. Distance, Temperature, Quality, Reliability.

  • Scale: the organized set of possible values that the Characteristic can take, including the type of scale (ordinal, interval, or ratio), the measurement Unit (if applicable), and any bounds or structure. The Scale defines “How do we measure it?” – e.g. “meters on a linear scale from 0 up to 1000” or “ratings 1 through 5 with ordering only”.

  • Coordinate: a concrete measured value that locates the subject on the chosen scale. This could be a number (for a numeric scale) or a category label (for an ordinal scale). It answers “What is the result?” – e.g. 7.4 (meters), or Expert (level).

  • Level (optional): a named tier or category on the scale, used only if the scale is tiered or discretized. For example, an ordinal scale might have Levels Low, Medium, High. A Level is essentially a human-friendly label for certain coordinates or ranges. On purely continuous scales, Level is not used.

Using this CSLC structure, every measurement is unambiguous and self-contained: the Characteristic tells us the context, the Scale tells us how to interpret the value, and the Coordinate is the outcome on that scale (with a Level label if appropriate). Notably, this pattern forbids bundling multiple characteristics into one metric – each metric template is one-characteristic-per-template to keep semantics crisp. If something needs to assess multiple factors, it should be modeled as multiple CSLC metrics or an explicit composite over several CSLC metrics (see §8 below). This one-aspect-one-scale rule is what allows unambiguous comparison and prevents hidden complexity.

Finally, the solution ensures tier optionality: If a domain uses named Levels, we include them; if not, we don’t force it. For example, one can have a Bug Severity Characteristic with Levels {Minor, Major, Critical} on an ordinal scale, whereas a Length Characteristic would have a continuous scale (no predefined levels, just units). Both fit the pattern.

Characteristic-space support must stay declared

  • When one front, archive, shortlist, or derived tradition view is discussed in one space, declare the object kind and the relevant characteristic space explicitly.
  • Use one SpaceRef only when the text truly needs to recover which space or typed feature family is carrying the comparison.
  • One declared space does not imply that every neighboring line must use the same space.
  • Different declared spaces may coexist for the same family when they answer different comparison questions, but the active one must stay recoverable.
  • If one atlas-like reading uses several declared spaces over the same palette, front, archive, or shortlist family, say which SpaceRef is active in the current reading rather than letting the atlas label hide that choice.
  • If one outcome-side declared space/ref is materially different from one representation-side or search-side declared space/ref, keep that difference explicit rather than calling both simply space.
  • OutcomeMapRef is warranted only when the text needs one declared map from the current set result into one outcome-side or effect-side declared space/ref.
  • When OutcomeMapRef is cited for one atlas-like or cross-scale reading, keep the source set result and the projected outcome-side declared space/ref visible together so the map stays support for the view rather than a replacement default.

Archetypal Grounding (System & Episteme Examples)

In a physical scenario (U.System): Consider an athlete’s long jump. We define a Characteristic Jump Distance with a Scale “meters (m)” ranging from 0 upward (ratio scale with meters as the unit). When the athlete jumps and lands at 7.45 m, we record a Coordinate of 7.45 m for the Jump Distance Characteristic. Here, Jump Distance is the Characteristic, the meter-scale is the declared Scale, and 7.45 m is the value (Coordinate). Because this is a cardinal measurement, we can meaningfully say one jump is 1.5 m longer than another, etc. Now consider another metric in the system: Battery Health of a device, which might be categorized qualitatively. We could define an ordinal Scale with Levels like Good, Fair, Poor for the Battery Health Characteristic. If a particular device is rated “Poor”, that is a Coordinate on the Battery Health scale (with Poor as the Level name). No arithmetic is done on these labels, but we can order devices by health (Good > Fair > Poor). Both examples illustrate the one-characteristic-one-scale rule: the jump’s distance is not combined with any other aspect; the battery’s health is evaluated on its own defined scale.

In a knowledge context (U.Episteme): Consider measuring an author’s expertise in a certain domain. We introduce a Characteristic Expertise Level for a person, with an ordinal Scale defining tiers such as Novice, Competent, Expert. Alice might be assessed at Expert level in software engineering – that’s a Coordinate on the Expertise Level scale for the Characteristic “Software Engineering Expertise”. Bob might be at Competent. We cannot average Alice’s and Bob’s levels, but we can say the scale is ordered (Expert > Competent > Novice). For a more quantitative episteme example, consider a Characteristic Hypothesis Confidence for a scientific claim, with a Scale 0–1 (or 0–100%) representing probability or confidence level (ratio scale). One hypothesis might have a confidence of 0.95, another 0.7; these are Coordinates on the Confidence scale. We can compare them numerically (0.95 is higher than 0.7, and 0.95 implies higher confidence), and we could even combine multiple confidence values through Bayesian formulas (if justified) – but crucially, we would only do so in a way that respects their scale (probabilities combined properly, not treated as arbitrary scores). The Expertise Level and Hypothesis Confidence examples show how the CSLC pattern accommodates both an ordinal qualitative measure and a continuous quantitative measure in the knowledge domain, each with one Characteristic and one defined Scale.

Bias-Annotation

The CSLC-Kernel pattern is designed to be maximally inclusive of different measurement types while imposing just enough structure to ensure consistency. It does not privilege any particular domain or modality of measurement: a subjective 5-star rating is treated with the same formal rigor as a physical length in meters. In terms of the FPF principle lenses, this pattern consciously balances the Architectural/Ontological needs (clear structure for data) with the Pragmatic/Didactic needs (flexibility and clarity for users). There is little risk of cross-domain bias here because the pattern explicitly supports both extremes (ordinal and ratio, qualitative and quantitative). By remaining method-agnostic, it avoids bias toward certain validation techniques – e.g. it doesn’t assume every measurement comes from an instrument (it could come from expert judgment just as well). One might argue the pattern enforces a somewhat formal approach to what could be informal measures (forcing definition of scale and characteristic), but this formalism is lightweight and is precisely what makes the metric interpretable. In summary, A.18 embodies neutrality: it’s a container that fits any content as long as that content is well-labeled. It reinforces P‑2 (Didactic Primacy) by making all metrics self-explanatory in terms of what and how, and respects P‑1 (Cognitive Elegance) by using a minimal, uniform scheme. No cultural or disciplinary assumptions are baked in – an anthropologist’s “Cultural Significance” scale can live alongside an engineer’s “Voltage” scale with equal status. The pattern’s requirement for declaring polarity (“higher is better” vs “lower is better” vs target range) further avoids bias in interpretation – it prevents the assumption that “more is always better,” which might be untrue in many contexts (e.g. for error rates, lower is better). All these considerations ensure that A.18 introduces no hidden skew; it merely provides a fair playing field for all metrics.

Conformance Checklist

When defining a new metric template or using measurements, practitioners SHALL verify the following:

  1. One characteristic, one scale: Each metric template binds exactly one Characteristic to exactly one Scale. If you find a metric trying to cover multiple things at once, split it into separate metrics.

  2. Polarity declared: For any ordered Scale (ordinal/interval/ratio), the polarity (“higher‑is‑better”, “lower‑is‑better”, “targeted optimum (symmetric or asymmetric around a declared target)”) SHALL be declared at the template that binds a Characteristic to a Scale. State whether higher values are better, lower are better, or if an optimal range/target exists. (For example: *“higher is better” for a performance score, *“lower is better” for error count, or “target 37 °C” for body temperature where deviation in either direction is worse.) This ensures that anyone comparing two values knows which way is “up.”

  3. Unit and level clarity: If the Scale is quantitative, specify the Unit (e.g. seconds, meters, %) and make sure all values include or assume that unit. If the Scale has named Levels, list them clearly and use them consistently. Do not use the same label to mean different things on different scales, and avoid using unit terms in Characteristic names (the unit belongs with the scale).

  4. Scale-appropriate operations only: Only perform those comparisons or calculations that are valid for the given scale type. For a nominal scale, you can check equality but not order. For an ordinal scale, you can order or rank values but not do math like “A minus B.” For interval scales, addition/subtraction is OK (with unit conversion if needed), but ratio comparisons (A is twice B) might not make sense without a true zero. For ratio scales, all arithmetic operations are allowed with proper attention to units. This check prevents logical errors (e.g. averaging “High” (3) and “Medium” (2) and getting 2.5 — which is meaningless).

  5. No bare numbers: Never present a raw number or value without its context of Characteristic and Scale. If someone sees “42” in your output, they should also see or know “42 of what, measured how.” A reader who is not aware of the metric’s template should not be left guessing what a given value signifies. In practice, this means labeling reports and data with the metric name or identifier so that values can be traced back to their meaning.

  6. Template bridges for cross-metric comparison: If you intend to compare or aggregate measurements from different templates (different Characteristics/Scales), ensure an explicit ScoringMethod or conversion is defined. For example, if you need to combine a “usability score” (0–5 stars) with a “security score” (0–100%), you might define a new Score that maps both onto a common 0–10 scale via monotonic functions. Without such a bridge, do not directly mix metrics – keep them separate in analysis. This guarantees that any cross-metric reading has a well-founded basis.

  7. Level optionality respected: If your Characteristic doesn’t naturally have tiers, don’t force it to have Level names (you can leave the Level concept unused). Conversely, if your Characteristic is commonly described in categories, it’s fine to define Levels for clarity. The key is to use the Level field intentionally: either not at all (for truly continuous measures) or in a fixed, non-overlapping way (for discrete categories). Do not use “Level” for something that behaves like a continuous value (it would be confusing to assign a label where a number would do, or vice versa).

  8. Comparability test: Two Coordinates are comparable iff same Characteristic+Scale (incl. unit, polarity). Otherwise — Score‑level only after a declared SCP to a bounded range.

(The above serve as normative checkpoints. Many of these are automatically supported by using the standard metric templates in software: e.g. the system will enforce one Characteristic per template, require a unit for ratio scales, etc. The Lexical rules from A.17/E.10 are assumed: use canonical names and notations for all parts of the metric.)

Consequences

Adopting the minimal CSLC Standard in the kernel yields a number of benefits:

  • Universal interpretability: Every measurement is intrinsically self-describing. One cannot have a “mystery number” floating around; by design you must know it’s X (Coordinate) on Y Scale of Z Characteristic. This dramatically reduces miscommunication in reports and data exchange. An engineer and an analyst can share a metric knowing they interpret it the same way, because the context travels with the value. Level is optional when scale is tiered or discreet.

  • Safe comparison and aggregation: Values can only be compared when they belong to the same Characteristic and Scale (or when an authorized SCP converts them). This prevents the common error of comparing apples to oranges. When cross-comparison is needed, the pattern funnels us into creating a proper normalization, which improves the soundness of composite scores. Essentially, it’s now impossible to accidentally average an uptime percentage with a user satisfaction rating, for example, without explicitly defining how to map one to the other.

  • Flexibility across domains: The pattern is transdisciplinary. It doesn’t matter if the measurement is temperature in Kelvin, length in inches, code complexity in “abstract points,” or user satisfaction on a five-level Likert scale – all are handled uniformly. This makes it easier to plug new patterns for new domains into FPF, since they don’t need special rules for their metrics; they just instantiate the CSLC template in their context.

  • Ordinal and cardinal handled with equal rigor: By explicitly classifying scales, the pattern gives ordinal data the respect it deserves (no pretending it’s numeric) and gives ratio data the formal context it needs (units, zero, etc.). This balance means both qualitative assessments and quantitative measurements live side by side, each with their constraints respected. Domains that lean heavily on categorical ratings benefit from the Level concept (with no pressure to assign fake numbers), and domains that use real measurements benefit from unit enforcement and type-aware computations.

  • Clarity in multi-factor scoring: The prohibition of implicit multi-characteristic measures means that any “overall” score or index has to be constructed out of known pieces. This tends to improve the transparency of complex scoring schemes. If an organization wants to create a single index from 5 different metrics, A.18 forces them to introduce a defined ScoringMethod function that combines those 5 Coordinates into one Score, with declared monotonicity and bounds. The consequence is that composite metrics become auditable and debatable (you can examine the weighting or formula) rather than opaque sums.

  • Methodological neutrality (and innovation): Because the kernel imposes no method for obtaining the values – only how to frame them once obtained – patterns and tool builders are free to innovate in how they measure things. The Standard just ensures that once they do, everyone else can understand and use the results correctly. This separation of concerns (what vs. how) accelerates multi-disciplinary collaboration: a social scientist’s observational scale can feed into a systems model without any confusion, as long as it’s couched in the CSLC terms.

On the downside, users must do a bit more upfront work to define their metrics. The pattern’s requirements (declare Characteristic, define Scale, etc.) mean one cannot simply say “we’ll track a risk score” without further detail. In practice, this is a desirable trade-off: the extra effort (perhaps a few minutes to set up a metric template) prevents far greater confusion down the line. Another possible trade-off is multiplicity of scales – the pattern allows the same Characteristic to have multiple scales (in different contexts or versions), which might fragment data if not managed (e.g. two teams measuring “Performance” on different scales). However, it also provides the remedy: make the difference explicit and, if needed, build a conversion ScoringMethod. This explicitness is actually beneficial, as it highlights when “Performance (0–5)” is not directly comparable to “Performance (Percentage)”. In short, any fragmentation is out in the open and can be dealt with via alignment or bridging.

Overall, A.18’s consequences are overwhelmingly positive: measurements become first-class, well-understood citizens of the model. The cost is a slight increase in definition effort and discipline, which is a small price for coherence. Once this pattern is in place, neighboring patterns in Parts B, C, and D that reason about metrics can rely on it. For example, trust calculations (Part D) can assume that any metric they consume has a known scale and meaning, and knowledge dynamics algorithms (Part B or C) can safely combine evidence knowing the comparisons are valid. The minimal CSLC Standard is thus a foundational enabler for robust, cross-domain assurance in FPF.

Rationale

The rationale behind A.18 is to enforce semantic clarity at the data level, thereby solving many downstream problems. Without this pattern, one must constantly ask, “What does this number mean? Can I combine these two values?” – questions that have led to many project errors. By building the answers into the framework (“every number knows its unit, scale, and aspect”), we front-load the work and eliminate ambiguity. The solution directly addresses each force:

  • Transdisciplinarity: We include both ordinal and cardinal mechanisms so that no discipline’s metrics are left out. This was informed by observing multi-disciplinary teams: e.g., in a single project, a human factors specialist might rate usability (ordinal) while an engineer measures throughput (ratio). A.18 gives them a common language and prevents one from misusing the other’s data. It embodies the idea that universal structure enables local freedom: everyone’s metric can plug in, as long as they specify it properly.

  • Comparability vs. freedom: The pattern strikes a balance by tying comparability to explicit commonality. If two metrics truly measure the same U.Characteristic on the same Scale by the same measurement procedure, then of course you can compare them. If they differ, the framework doesn’t stop you from defining them (freedom), but it does stop you from conflating them inadvertently. The introduction of polarity declarations is a direct response to this tension: it adds a small declaration requirement (must declare “higher is better” etc.) but yields big pay-off in avoiding mis-ordered interpretations and enabling safe composite scoring (monotonic ScoringMethods).

  • Ordinal vs. cardinal separation: The rationale here is guided by measurement theory: we want to preserve information content. Treating ordinal data with only order operations preserves all its information; doing more (like adding them) injects false information. The pattern’s strictness on scale types forces modelers to be honest about what their data can and cannot do. This not only prevents errors but also encourages best practices (e.g. if you find you desperately want to average an ordinal score, perhaps you should refine it into an interval scale in your methodology). The outcome is a framework that respects both the qualitative and quantitative realms appropriately, aligning with FPF’s Pillar of Pragmatism – use formalism where it’s justified, but not beyond its limits.

  • Optional Levels: Requiring Levels in every case would have been too rigid (not everything has named tiers), but not supporting them would fail domains that rely on them (like maturity models or grading systems). The rationale for making Level optional is to accommodate both. We saw in practice that many metrics naturally form tiers (e.g. technology readiness levels TRL 1–9) and giving them a slot in the model (instead of burying them in definitions) makes those metrics much easier to work with and integrate. Meanwhile, continuous metrics carry no baggage of unused fields. This design was checked against existing standards (like ISO 25024 for quality measures) to ensure we aren’t deviating from industry expectations: indeed, separating the concept (Characteristic) from the scheme (Scale) aligns well with standards, and including an optional categorization aligns with common practice in capability maturity models, etc.

  • Method neutrality: The decision to not include any measuring procedures in A.18 (no specific formulas, no mandated evidence type) comes from the principle of separation of concerns. The kernel should provide the what and how (structurally), while neighboring measurement or method patterns provide method-side constraints and evidence expectations. This keeps the kernel lean (P‑1 Cognitive Elegance) and allows domain experts to implement whatever method is appropriate, merely committing to wrap their results in the CSLC form. By doing so, we avoid any bias toward empirical vs analytical, or manual vs automated measurements – FPF welcomes all, as long as they conform to the schema. This was rationalized by examining case studies: e.g., some reliability metrics come from formal proofs (analysis), others from testing (empirical) – the kernel can carry both result kinds identically, requiring only that each result says what it measured and on what scale.

In essence, A.18 is the infrastructure of meaning for metrics. It may appear as a simple template, but it’s profoundly enabling. It forces clarity at creation time, so we don’t have to infer or debate meaning at usage time. The pattern’s practical payoff lies in preventing errors that don’t have to happen. It encodes lessons from both metrology (the science of measurement) and everyday data science (where unit errors and mis-comparisons are infamous issues). The rationale is backed by these lessons: fix the interpretation rules in the design, and you eliminate entire classes of confusion and mistakes. By having this in the kernel, every mechanism – from knowledge scoring to system performance – benefits immediately, and their results become interoperable to a degree that would be impossible without a common structure.

Relations

  • Extends/Uses: A.17 (CHR-NORM)A.18 explicitly builds on the canonical terminology established in A.17. It uses the term Characteristic as defined there (and no other synonyms) and carries forward the edict that “axis/dimension” be treated as mere narrative aliases. It also leverages the Entity-vs-Relation Characteristic distinction from A.17: Section 7.4 of this pattern references tests for disambiguating relational metrics. Essentially, A.17 provides the lexical and conceptual groundwork (what a Characteristic is, and the basic vocabulary), while A.18 provides the structural and normative rules for linking Characteristics to measurements.

  • Core foundation for metrics: This pattern underpins the Measurement & Metrics Characterization spec (C.MM‑CHR) – the pattern that implements metric storage and computation. In MM-CHR, every U.DHCMethodRef and U.Measure follows the CSLC format defined by A.18. By lifting CSLC rules to the kernel, we ensure all FPF patterns (like KD-CAL for knowledge dynamics, Sys-CAL for systems, or any custom CAL/CHR) share a common approach to metrics. A.18 also informs the design of CHR-CAL (Characterisation Calculus), which generalizes measurable property templates: CHR-CAL relies on the one-Characteristic-per-metric assumption and the comparability rules set here to compose composite characterizations.

  • Enables dynamic reasoning: A.18’s insistence on well-defined Scales allows patterns like A.3.3 U.Dynamics (system dynamics models) to incorporate measurement dimensions as state variables without ambiguity. For example, a stateSpace in a dynamics model can be explicitly defined as a set of Characteristics (each with units and ranges), making simulations and traces dimensionally consistent. If A.18 were not in place, one model might treat “performance” as a 1–5 score and another as a probability – combining them would be incoherent. With A.18, such differences must be reconciled via a ScoringMethod or kept separate, preserving coherence in multi-model analyses.

  • Coordinates with assurance patterns: Many patterns in Part B and D (for trust, assurance, and ethics) involve scores and metrics. For instance, B.3 (Assurance Levels) computes overall assurance from evidence scores; A.18 ensures those input scores are well-defined and comparable (e.g. all are 0–1 or all are percentages, with polarity noted). D.4 (Trust-Aware Calculus) might combine trust metrics across domains – again, A.18 provides the common ground so that a “trust score” coming from an operational metric and one coming from a social rating can be normalized and compared meaningfully. In summary, any pattern that aggregates or uses measurements is constrained (in a positive way) by A.18’s rules. They “plug into” this framework.

  • Constrained by lexical rules: This pattern’s content is part of the formal lexicon governance. It works within E.10 LEX-BUNDLE, which means the terms Characteristic, Scale, Coordinate, Level, etc., are controlled vocabulary. A.18 localizes some generic requirements from A.17 (for example, A.17 mandates polarity in principle; A.18 requires it be declared per template in practice). It also aligns with external standards: by having explicit scale types and units, it dovetails with ISO/IEC measurement terminology and allows straightforward mapping to frameworks like ISO 80000 (quantities and units) and Stevens’s scale types. This relation to standards is deliberate – it eases F.9 (Alignment Bridge) construction to external ontologies by having a clean internal schema (A.18 provides that schema). In effect, A.18 is where FPF’s internal consistency meets external compatibility, ensuring our measurement semantics can relate to those outside FPF when needed.

A.18:End


CharacteristicSpace & Dynamics Hook (A.CHR‑SPACE)

Status: Stable

Reading path for engineer-managers

Informative (navigation only). This subsection is a didactic index for human readers. It introduces no new norms and does not change governing-pattern assignment.

When to use this path. You need to review a CHR-enabled plan or audit, or coordinate engineering work across teams, without deep-diving every CHR mechanism up front.

Step 1 — Measurement vocabulary: what is measured, and what “comparable” can mean.

  • A.17 — canonizes the technical head Characteristic (and retires near-synonyms such as “axis/dimension/feature/property/metric” from normative Tech register).
  • A.18 — CSLC discipline (Characteristic / Scale / Level / Coordinate) as the metrology of interpretability, comparability, and admissible aggregation.
  • C.16 (MM‑CHR) — the measurement substrate (U.DHCMethodRef, U.Measure, U.Unit, U.EvidenceStub) and the conservative baseline of direct comparability (“same template”). C.16 makes coordinates auditable; it does not define CHR mechanisms. Use C.16.P first when the wording itself still hides whether the use under repair is a characteristic, scale, coordinate, score, metric label, quality-term repair, or application of the pattern governing the recovered claim.

Step 2 — Ontology and governing spec refs the CHR suite operates on.

  • This pattern A.19U.CharacteristicSpace and the dynamics hook: the base ontology of measurable coordinates and their spaces.
  • A.19.CN — CN‑frame / CN‑Spec: the governance card for normalization and comparability routing, indicator policy, aggregation routing, and acceptance; it explicitly points to C.16 for evidence/backing and to G.0 for legality gates.

Step 3 — Legality gates and mechanism shape (what to check when numbers appear).

  • G.0 (CG‑Spec) — the legality gate for numeric operations and comparisons (SCP, ComparatorSet, MinimalEvidence, Γ_fold, crossings/plane pins). CHR mechanisms cite CG‑Spec; they do not duplicate it.
  • A.6.1 and A.6.5 — the U.Mechanism definition form and slot discipline. Read once so the structure of each mechanism-governing pattern (slots, operators, laws, admissibility guards, audit references) is predictable.

Step 4 — The CHR suite boundary and the P2W planning-to-work boundary.

  • A.19.CHR (CHRMechanismSuite) — focus on:
    • A.19.CHR:4.1 (published objects),
    • A.19.CHR:4.2.1 (CHR SlotKind lexicon),
    • A.19.CHR:4.2.2 (canonical mechanism targets),
    • A.19.CHR:4.5 (suite protocols — order/optionality live here, not in mechanisms[]),
    • A.19.CHR:4.6–4.7.2 (P2W planned-baseline hook and the plan-item shape),
    • A.19.CHR:7 (suite conformance checklist).
  • A.15.3SlotFillingsPlanItem (planned baseline discipline: planning vs enactment).
  • E.18 (E.TGA) — how to express the actual pipeline/flow graph (including crossings) while keeping suite and plan artefacts refs‑only.

Step 5 — The six CHR mechanism-governing patterns (read one at a time).

Each mechanism-governing pattern below publishes its U.Mechanism definition card and assumes the measurement-admissibility base from A.17/A.18 and C.16.

  1. A.19.UNM — normalization (CV→NCV, ≡_UNM, TransportRegistryΦ).
  2. A.19.UINDM — indicatorization (policy-bound indicator selection; no “NCV ⇒ indicator” shortcut).
  3. A.19.USCM — scoring (SCP-first; no implicit UNM).
  4. A.19.ULSAM — admissible aggregation (explicit Γ_fold; ordinals are not averaged).
  5. A.19.CPM — comparison (set-valued outcomes; no silent scalarisation/totalisation).
  6. A.19.SelectorMechanism — selection kernel (set-returning; dominance/PortfolioMode defaults are policy-bound).

Step 6 — Specialization and reuse.

  • A.19.ECS — how to construct an object-under-improvement evaluation CharacteristicSpace for the object being improved: A.19 says how the space is structured; A.19.ECS says how to make one useful for a declared object kind under improvement, use, contrast cases, scale set, value meanings, trade-offs, and stop or reopen condition.

  • E.20 — how to use specializations of mechanisms ( / ⊑⁺) without breaking SlotKind meaning or introducing hidden inputs; consult this whenever you see project‑ or domain‑specific variants of the CHR mechanisms.

Fast review entry points.

  • If you are reviewing a plan: start from A.19.CHR:4.6–4.7.2 (planned baseline hook + plan item shape) and A.15.3 (what a planned baseline may/may not contain).
  • If you are reviewing semantic drift: start from A.19.CHR:4.2.2 (canonical targets), then use E.10 (suffix discipline) and F.18 (alias docking) to preserve public continuity while fixing terminology.
  • If you are reviewing conformance: start from A.19.CHR:7 (suite checklist), then consult the relevant A.19. checklist(s) for mechanism-level conformance; use E.19 for the review protocol.

Non‑duplication note. This pattern defines U.CharacteristicSpace and the typing hook U.Dynamics.stateSpace. It reuses the canonical measurement concepts (U.Characteristic, CSLC terms) from A.17/A.18 and remains notation‑neutral about storage/IDs. This pattern is intentionally not a second governing pattern for CHR mechanisms: it may use CHR‑mechanism terms when talking about comparability and certification, but it does so strictly by Tell + Cite to the corresponding A.19.<MechId> mechanism-governing patterns.

Governing-pattern rule (Normalization & CHR mechanisms referenced here). This pattern MUST NOT be a second governing pattern for CHR‑mechanism vocabulary.

  • Normalization vocabulary + admissibility (UNM vocabulary items: UNM, NormalizationMethod, NormalizationMethodDescription, NormalizationMethodInstance, NCV, ≡_UNM, NormalizationFix; κ-retirement; “map vs Map” lexical guard) are governed normatively by A.19.UNM.
  • Indicatorization vocabulary + admissibility (UINDM vocabulary items: IndicatorChoicePolicy, Indicator, IndicatorSet, indicatorization as a policy step; “NCV ⇒ indicator” prohibition) are governed normatively by A.19.UINDM.
  • Other CHR mechanism vocabulary referenced here (e.g., scoring, aggregation, comparison, and selection terms) is governed normatively by the corresponding mechanism-governing pattern in the A.19.<MechId> family (e.g., A.19.USCM, A.19.ULSAM, A.19.CPM, A.19.SelectorMechanism).
  • Evidence/calibration backing for normalization is governed by C.16 (MM‑CHR).
  • CN‑Spec field/ref bindings (CN_Spec.normalization, CN_Spec.comparability.*) are governed by A.19.CN (CN‑Spec).
  • Vocabulary extension rule. If this pattern needs a new term for normalization, indicatorization, scoring, aggregation, comparison, or selection, it SHALL be introduced in the corresponding mechanism-governing pattern first, then cited here (Tell + Cite). A.19 SHALL NOT mint new CHR‑mechanism vocabulary.

Terminology pointer (informative; do not duplicate). When A.19 uses normalization or indicatorization terms below, it uses them by reference to A.19.UNM and A.19.UINDM and C.16. This pattern only constrains how such normalization method instances or declarations are cited when doing state‑space comparability, embeddings, and certification.

Reader guide (informative).

  • If you need the meaning of UNM, NCV, ≡_UNM, or NormalizationFix or NormalizationFixSpec: see A.19.UNM.
  • If you need the meaning of IndicatorChoicePolicy / indicatorization: see A.19.UINDM.
  • If you need the CN‑Spec field/ref bindings (CN_Spec.normalization, CN_Spec.comparability.*): see A.19.CN.
  • If you need evidence/calibration backing for normalization or scoring legality: see C.16 (MM‑CHR).
  • If you need cross‑context alignment mechanics: see F.9 (Alignment Bridge) and the Transport discipline (A.6.1).

Intent & Scope (Normative)

Intent. Establish a kernel‑level state‑space typeU.CharacteristicSpace—so that any holon’s state changes (e.g., a system’s condition or a role’s readiness) can be formalized as trajectories in a space of declared Characteristics with chosen Scales. For epistemes, state is governed by ESG; F–G–R are assurance coordinates, not a state space. This gives every U.Dynamics model a well‑typed stateSpace and enables formal state certification (using RoleStateGraph checklists) instead of narrative stage transitions.

Scope. Pattern A.19 defines:

  • the type U.CharacteristicSpace as a finite product of slot value sets (per A.18),

  • the slot construct for each factor (a pairing of a Characteristic with a chosen Scale),

  • minimal structural overlays (optional order, topology, metric hooks) that downstream patterns may attach to a space, and

  • the hook U.Dynamics.stateSpace : CharacteristicSpace – i.e. the requirement that any dynamics model declare a CharacteristicSpace for its state space (typing only).

A.19 does not introduce any new measurement aspects, composite metrics, or normalization semantics (governed by A.19.UNM, with evidence/calibration under C.16 (MM‑CHR)), and it does not define how dynamics evolve over time or any predictive laws (see A.3.3 for dynamics semantics). The focus here is purely on the structure of state spaces and their comparability.

Space-vs-consumer boundary. Use A.19 to declare the CharacteristicSpace itself: its slots, its optional overlays, and the U.Dynamics.stateSpace typing hook. Do not use A.19 to declare consumer-side ref positions that merely point to a declared space, and do not use it to declare relation kinds between several such refs. Accordingly, one field such as ...SpaceRef is a reference to a declared CharacteristicSpace, not a second space kind, not a slot alias inside that space, and not a role claim. If a line needs search-side versus outcome-side positions over declared spaces, one explicit relation between those refs, one source-set relation, or one A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW reading over an already-declared substrate-bearing line, source set, or set result, declare that in the consumer pattern or consumer declaration that uses the space rather than in A.19 itself.

Lexical guard (“map”). Follow the normalization lexical discipline governed by A.19.UNM. In this pattern, lowercase map is used only in the mathematical sense, while capitalized Map retains its Part‑G suffix meaning (e.g., DescriptorMap). Do not mint new normalization terminology here.

Lexical guard (“carrier”). In kernel prose, Carrier (capitalized) names U.Carrier (a symbol bearer). Do not use “carrier” for set‑theoretic supports; prefer ValueSet/underlying set. A.19 therefore uses ValueSet(slot) for the set that supplies values to a slot.

Context (Informative)

FPF’s kernel already standardizes what is measured (a Characteristic, per A.17) and how it is measured (a Scale with units, via the CSLC Standard in A.18). We also have a measurement substrate (U.DHCMethodRef, U.Measure) to handle individual observations. What has been missing for modeling dynamics is a canonical “Context” in which multiple Characteristics can co-exist so that complex states (with many aspects) and their trajectories are well-typed and comparable. Without a formal CharacteristicSpace, teams either hard-code ad-hoc vectors (often with inconsistent assumptions) or fall back to informal lifecycle stories (“phases” or stages) that contradict the kernel’s open-ended, non-linear evolution paradigm. The Architectural patterns (A-cluster) expect that U.Dynamics.stateSpace will be a set of declared Characteristics each with a declared Scale. Pattern A.19 delivers exactly this capability, leveraging the CSLC measurement discipline without reinventing any arithmetic or unit-handling logic.

Problem (Informative)

  • P1 — “Feature vector” drift. In practice, teams often assemble state vectors or “feature” lists with implicit or mismatched units and scales. Without a formal space, one coordinate’s value can’t safely be compared or combined with another’s (e.g. mixing degrees Celsius with percentages). CSLC guarantees consistency per Characteristic, but a bundle of multiple “characteristics” remains under-specified if we lack a unified space definition.

  • P2 — Lifecycle bias. Absent a formal state space, system change tends to be described in terms of fixed stages or phases (design phases, maturity levels, etc.). This conflicts with FPF’s open-ended stance: in FPF a role’s state model (RSG) allows re-entry and refinement of states rather than one-way lifecycle stages with an “end.” We need a space model that treats evolution as continuous movement, not a one-directional sequence.

  • P3 — Incoherence across CN‑frames. Different modeling “CN‑frames” (architecture vs. epistemic vs. operational) often choose different sets of qualities to measure (different sets of characteristics). Later, however, we may need to compose these models or project one into another. Without a kernel notion of how one state space can be a subspace of or embedded in another, any integration of models will be ad hoc and error-prone.

  • P4 — Relational measurements. Some Characteristics are inherently relational (e.g. a Coupling between two components, or Distance between points). Naïvely forcing such traits into a single-object feature vector loses critical information (arity, symmetry). The kernel already distinguishes single-entity vs multi-entity Characteristics (A.17); we must preserve that distinction in the state space so that a relational metric isn’t treated as an intrinsic one by mistake.

  • P5 — The geometry temptation. When defining a state space, it’s tempting to assume or inject additional structure (ordering of states, topologies for continuity, metrics for distance) as if inherent. But the kernel must remain minimal and domain-neutral: it should not smuggle in analysis methods or domain-specific norms under the guise of geometry. Any such structure should be added explicitly by specialized patterns, not baked into the core definition of a space.

Forces (Informative)

  • F1 – CSLC integrity at scale. When combining multiple measurements into a state, we must uphold the CSLC discipline for each component: each coordinate has a defined Characteristic, Scale type, unit, and (if applicable) polarity. We need to do this without redefining or duplicating that single-characteristic integrity – the multi-dimensional space should simply enforce CSLC per slot.

  • F2 – Transdisciplinarity & lexical clarity. The state space framework must work for quantitative physical metrics (ratio scales, continuous units), qualitative assessments (ordinal scales, tiers), and mixtures thereof. It must not be biased toward one domain’s notion of measurement. At the same time, to avoid confusion, the lexicon must remain canonical: we use Characteristic (not “axis/dimension”) as the formal term for a measured aspect, regardless of domain, per A.17’s naming convention.

  • F3 – Arity and semantics. Lifting various Characteristics into a unified space should not obscure their nature. If a Characteristic is defined as a relation (multi-entity property), the state space must represent it appropriately (e.g. as a coordinate that is a tuple or a symmetric relation) rather than flattening it into an unrelated scalar. Entity-specific vs relational properties must remain clear in the space’s structure.

  • F4 – Minimal core, extensible further. The kernel should provide only the bare essentials: a typed state-space structure with declared Characteristics, Scales, ValueSets, and slot-value constraints. It should be possible to impose additional structure like order, topology, or metrics if and when needed by downstream theories, but these must be optional overlays. The core space definition should be minimalistic to allow broad use, yet capable of extension for advanced needs.

  • F5 – Composability of spaces. We need well-defined operations to project a state space to a subspace (dropping some Characteristics), embed one space into a larger space (mapping coordinates from one context to another), and take products of spaces (combining different state spaces into a joint space). These operations are crucial for composing sub-models, comparing alternatives, or aligning different “CN‑frames” (for example, linking an architectural model’s state space with a metrics model’s space). The approach must support such composition in a principled way.

  • F6 - Alignment with RSG (state machines). In FPF, formal state certification is done via checklists on RoleStateGraphs (A.2.5). Our state space concept must complement that: the state of a holon remains a criteria-defined state label, but those criteria are evaluated against the measurable coordinates in a CharacteristicSpace. The design must allow checklists to map observed coordinates to named states and enable re-certification as states evolve, rather than locking states into a static progression.

Solution

U.CharacteristicSpace

Type signature

Let I be a finite index set labeling a collection of slots. Each slot i (for i ∈ I) is defined as a pair:

slot_i = (Characteristic_i, Scale_i),

where:

  • Characteristic_i is a U.Characteristic (with an explicit arity, i.e. either an entity-Characteristic or a relation-Characteristic as defined in A.17), and

  • Scale_i is a chosen Scale for that Characteristic (with a specified scale type and unit, per A.18 and the MM‑CHR rules).

Then a CharacteristicSpace (CS) is formally the Cartesian product of all slot value sets:

$\mathbf{CS} = \prod_{i \in I} \mathrm{ValueSet}(\mathrm{slot}_i),.$

In other words, a point (state) in the space consists of one coordinate value for each slot. A state x in CS can be seen as a total function x(i) that picks a value from each slot’s ValueSet (for every i ∈ I, x(i) ∈ ValueSet(slot_i)). By kernel mandate, any U.Dynamics.stateSpace SHALL be bound to some instance of CharacteristicSpace, and all states or trajectories described by that dynamics model MUST lie within that space’s value set. (The actual dynamic laws and time progression are handled in A.3.3; A.19 only defines the state‑space container and its properties.)

Slot discipline (invariants)

To ensure consistency and comparability, a CharacteristicSpace must obey the following invariants:

  • A19-CS-1 (Exactly one per slot). Each slot binds exactly one Characteristic to exactly one Scale (including a specific Unit or kind, if applicable). This mirrors the CSLC clause of “one aspect – one scale”: there are no ambiguous or compound mappings in a single slot. (If a Characteristic can be measured on multiple scales, only one is chosen for a given space; others would require separate slots or a different space.)

  • A19-CS-2 (Named basis). A CharacteristicSpace SHALL publish an ordered list of its slots as its basis. Each slot in the basis has a stable identifier (or key) that can be used in technical notations, interfaces, data structures, or APIs. These basis names should be treated as stable technical tokens (identifier-like); any human-friendly alias or description for a slot should be provided only in the Plain register as a non-normative aid (per E.10). In short, the identity and order of slots in the space are explicit and stable.

  • A19-CS-3 (Immutability of meaning). Once a space is in use, the meaning of each slot is fixed. A slot’s (Characteristic, Scale) pair MUST NOT be retroactively altered. If requirements change (e.g. a different scale or a revised definition of the Characteristic), one MUST define a new version of the space (or a new slot) rather than silently changing the existing one. When a space is versioned or a slot replaced, an explicit embedding (mapping from the old space to the new space) should be published to relate historical states to the new coordinates. This ensures past data remains interpretable and prevents semantic drift.

  • A19-CS-4 (Arity preservation). If a Characteristic_i is defined as a relation (multi-entity characteristic), then slot i represents a relationship among multiple entities. The coordinate value at such a slot is a tuple (with the appropriate entity types) rather than a simple scalar. The slot’s declaration SHALL indicate the relation’s symmetry or directionality as part of its meaning (this should align with how the Characteristic was originally defined in its template). In essence, relational Characteristics retain their arity in the space, so that we don’t confuse, say, “Coupling between X and Y” with an intrinsic property of X or Y alone.

  • A19-CS-5 (No hidden normalizations or aggregations). A CharacteristicSpace itself carries no implicit normalizations or formulas for combining coordinates. It is a descriptive structure, not a scoring mechanism. Any computation that combines or transforms coordinates (e.g., normalizing, indicatorizing, scoring, Γ‑folding, comparing, or selecting) must be defined outside the core space—typically as an explicit CHR mechanism step and cited from its designated mechanism-governing pattern (A.19.UNM, A.19.UINDM, A.19.USCM, A.19.ULSAM, A.19.CPM, A.19.SelectorMechanism). Normalization semantics and admissibility are governed by A.19.UNM; evidence/calibration backing is governed by C.16 (MM‑CHR). In particular, any handling of polarity (which way “better” is), weighting, or cross-slot aggregation happens in those external mechanisms/policies, not inside the space definition. The space provides the raw coordinates; the logic to interpret or aggregate them is added by domain‑specific layers with explicit disclosure of how it’s done.

  • A19-CS-6 (Slot meta completeness). Where applicable, each slot SHALL declare admissible_domain and missingness semantics (e.g., codes for missing, censored, not-applicable), consistent with the Characteristic’s Scale and with MM‑CHR. This prevents silent domain drift and clarifies how absent values participate in predicates and comparisons.

  • A19-CS-7 (Space-vs-consumer boundary). A CharacteristicSpace publishes only its own slot basis, optional overlays, and typing hooks. Ref-typed consumer fields that point to a declared space, explicit relation kinds between such refs, source-set wiring, interpretive-view organization, and publication metadata are outside the space object and MUST be declared in the consumer pattern or consumer declaration that uses the space. This prevents CharacteristicSpace from being silently widened into ref-position semantics, selector semantics, source-set semantics, publication-form semantics, or interpretive-view semantics.

Minimal structure hooks (optional overlays)

By default, a CharacteristicSpace has no assumed ordering or metric structure – it is just a Cartesian product of value sets. However, a space MAY declare certain structural attributes as opt-in metadata (i.e. informative annotations that patterns can rely on, but not enforced by the kernel). These optional overlays include:

  • Product topology. A topology on the space, typically the product topology when slots that are quantitative (interval or ratio scales) need continuity considerations. Declaring a topology is useful if continuity or convergence arguments are relevant (e.g. to say a sequence of states approaches a limit state). By default, without declaration, no topological structure is assumed on the space.

Lexical note: Here “distance metric” strictly means a mathematical distance function (or a generalized distance such as a pseudometric or quasi‑metric) on the state space. This is not to be confused with metrics as performance measures in MM‑CHR. In the Tech register, avoid the noun metric; refer to U.DHCMethod/U.DHCMethodRef for measurement templates (see C.16). Any distance overlay on a CharacteristicSpace must not conflict with scale semantics; it is an additional analysis structure, not a redefinition of measurement meaning.

These overlays are entirely optional and have no effect on the core meaning of the space – they exist only to support particular needs (like making dominance, continuity, or distance reasoning possible) in models that require them. If needed, they should be added deliberately by an architectural theory rather than assumed. This way, any ordering or metric properties of states are made explicit instead of relying on hidden or default arithmetic. (Rationale: The CSLC and MM‑CHR rules already govern what operations are allowed on each scale; A.19’s approach is to let neighboring theories add an order, topology, or metric when appropriate, so nothing is taken for granted tacitly in multi-dimensional arithmetic.)

Dynamics hook (typing only)

Any model of change or dynamics in FPF must declare the state space it operates over. Formally, U.Dynamics.stateSpace SHALL be specified as a reference to a CharacteristicSpace. This creates a typing obligation: the dynamic model can only produce states (and trajectories of states) that lie in the given space. All predicates or predictions in such a dynamics model are understood to quantify over sequences of points in that CharacteristicSpace (with time semantics governed by A.3.3’s time base and laws). Note: A.19 defines only the structure of the state space; it deliberately does not fix any time base or dynamic law. Those remain the responsibility of the dynamics pattern (A.3.3). A.19 simply ensures there is a well-defined space in which states live, so that dynamics are decoupled from any narrative “stage” and instead treat evolution as movement through this space.

Lexical discipline (Normative)

In all normative references, definitions, and identifiers related to this pattern, the specification uses the canonical measurement terminology: Characteristic, Scale, Level, Coordinate, CharacteristicSpace, slot, basis. Legacy terms like “axis”, “dimension”, or “point” are forbidden in Technical/Formal registers of the spec (per A.17’s lexical rules). They may appear at most once in explanatory Plain language as mapped aliases to aid understanding (and if used, must be explicitly identified as equivalent to the official terms). In this pattern, we consistently use “slot” or “basis element” (never “axis”) to refer to a component of a space, and “Characteristic” (never “dimension”) to refer to the measured aspect. This lexical discipline ensures clarity and consistency across the framework (see A.17 and C.16 L-rules for the formal policy on terminology).

Quotients & NormalizationFix (Normative)

Governing-pattern note. ≡_UNM and NormalizationFix are defined in A.19.UNM. This section constrains only how they are cited when used in state‑space reasoning.

Design rule — read invariants, not labels. Any checklist, acceptance predicate, or comparability claim over a CharacteristicSpace SHALL be evaluated on quotients by ≡_UNM (or on explicitly Normalization‑fixed charts), not on raw labels. Design rule — read invariants, not labels. Any checklist, acceptance predicate, or comparability claim that depends on representation choice (chart, unit, reference plane, or normalization route) SHALL be evaluated on quotients by ≡_UNM (or on explicitly Normalization‑fixed charts), not on raw labels.

Minimal obligations:

  1. Name the quotient or fix. If a checklist predicates over a normalization‑variant property, it MUST name the NormalizationFix (including the referenced UNM and the relevant NormalizationMethodInstance(s), by reference) and thus the ≡_UNM class.
  2. Declare NormalizationMethod class. Every normalization used MUST name its method‑class token and validity window as defined in A.19.UNM (do not restate the class taxonomy here).
  3. Join/equality only on invariants. Equality checks and joins across spaces MUST target invariant forms (the ≡_UNM quotient or a declared Normalization‑fixed representation), never raw un‑fixed coordinates.
Metric discipline & calibration (Normative)

Use the weakest safe structure required by the argument (pre‑order → semi‑metric → metric).

  • If a distance overlay is declared, any acceptance predicate or KPI defined over a CharacteristicSpace SHALL be non‑expansive (Lipschitz ≤ 1) w.r.t. the published d on the declared domain (raw coordinates or NCVs, as specified), or else state an explicit margin that absorbs any expansion.
  • If only an order overlay is declared, any acceptance predicate/KPI SHALL be isotone w.r.t. the declared product order.

Minimal obligations:

  1. Publish the metric (if used). If a distance overlay is used, the space MUST publish the distance function d (including any weights/parameters) and its declared domain of applicability.
  2. Bound expansion. Any acceptance predicate/KPI that relies on d MUST be shown non‑expansive (Lipschitz ≤ 1); otherwise an explicit expansion bound and compensating margin MUST be stated.
  3. State error & commutation. If a metric is used together with NormalizationFix, the specification MUST state (a) the maximum tolerated measurement/calibration error and (b) whether d commutes with the NormalizationFix (or provide a disclaimer and additional guard if it does not).

State Spaces & Comparability

Memory hook: We compare only what lies in the same space (or is translated into a common space via a declared mapping), and we only certify a holon’s state based on observable coordinates in that space (using a defined checklist). Anything else is just storytelling.

To make state-space reasoning practical across different contexts and models, this section provides the key operators and criteria related to CharacteristicSpaces:

  1. Space operations – how to derive a Subspace, establish an Embedding, or form a Product of spaces. These enable us to restrict a space to fewer slots, to map one space into another (with unit conversions, etc.), or to combine spaces (e.g. for composite models).

  2. Comparability regimes – two allowable ways to compare states: (a) coordinatewise, which requires strict sameness of space and units; or (b) normalization-based, which uses declared transformations to reconcile differences. We define when each applies and how to apply it properly.

  3. RSG integration – how formal state certification (via checklists in a Role’s state graph) ties into the CharacteristicSpace: ensuring that whenever we declare a system “Ready” or “Degraded”, it’s based on snapshot coordinates in a space. We also outline how to push or pull state definitions along space embeddings (so different contexts can translate states).

  4. Archetypal examples – “worked mini-schemas” illustrating typical usage in complementary CN‑frames (Operational, Assurance, Alignment). These examples show minimal models mixing entity and relational slots, how data might be structured, and how cross-context alignment works in practice.

Terminology note: We often denote a CharacteristicSpace abstractly as CS. Formally, one can describe a CS as a tuple ⟨I, basis⟩ where I is the index set of slots and basis is the set (or ordered list) of slot_i pairs. When a CharacteristicSpace is attached to a specific Role in a specific Context (see A.2, A.2.5), we may call it an RCS (Role CharacteristicSpace) – essentially the state space for that role’s state machine within that bounded context. Individual states of a role live in an RSG (RoleStateGraph, A.2.5), and a StateAssertion is a certified claim that at a given time window, the holon’s RCS coordinates satisfy the checklist for a particular state.

CS Operators (notation-neutral, context-local)

To support model composition, we define operations on CharacteristicSpaces in a notation-independent way (so these can be implemented in any tooling or notation). All these operations are assumed to occur within a single context (within one U.BoundedContext) unless otherwise noted:

Subspace – Projection πS : CS → CS|S.

Given a CharacteristicSpace CS with basis I (slots) and a chosen subset of slot indices $S \subseteq I$, one can form the subspace $CS|_S$ which includes only the slots in S and omits all others. The projection map π_S takes any state x in the original space and projects it onto the coordinates indexed by S, effectively discarding the other coordinates. This operation is straightforward: if $S = {i_1, i_2, … }$, then $CS|_S$ has those slots, and any state in $CS|_S$ corresponds to a state in CS with the other coordinates ignored. Properties: Projection is idempotent (π_S ∘ π_S = π_S) and, if an order or other structure is defined solely on the subspace’s slots, π_S preserves that structure (e.g. it will reflect any order that depends only on slots in S).

A.19:5.2.1.2 Embedding – Injection ι : CS₁ ↪ CS₂.

An embedding is a structure-preserving injection from one space CS₁ into another space CS₂. It consists of two parts: (a) an injective slot correspondence from CS₁ to CS₂, and (b) (only where needed) cited normalization instances that make the correspondence semantically safe. Formally, let CS₁ have basis I₁ and CS₂ have I₂. An embedding declares an injective function m: I₁ → I₂ that identifies each slot of CS₁ with a corresponding slot in CS₂.

For each slot i ∈ I₁ where the scale/unit differs from the target slot m(i) in CS₂, the embedding MUST cite a NormalizationMethodInstanceId (per A.19.UNM) that re‑expresses values from ValueSet(slot_i) into ValueSet(slot_{m(i)}) within the declared invariants and validity window. The embedding does not define normalization semantics; it only references the required instances.

Intuitively, an embedding says: “Any coordinate tuple from CS₁ can be interpreted as a coordinate tuple in CS₂, possibly after converting units or re‑scaling, and without losing any information except what the declared NormalizationMethods intentionally coarse‑grain.” If there is no loss at all (NormalizationMethods are identity or strict conversions), the embedding is essentially an inclusion of one space into a larger one; if there is some information loss (e.g., converting a fine‑grained scale to a coarse one), that loss is explicit in the NormalizationMethodDescription. Locality:

Embeddings are defined within a single U.BoundedContext (i.e., both CS₁ and CS₂ are in the same context). Using an embedding across contexts requires an Alignment Bridge (see F.9) and MUST be declared via the relevant mechanism’s A.6.1 Transport clause (BridgeId + channel + ReferencePlane(src,tgt) + any CL^plane; no implicit crossings).

Normalization declaration duties (MUST): Each cited NormalizationMethodInstanceId MUST satisfy the declaration/admissibility obligations governed by A.19.UNM (incl. method‑class token and validity window). If such normalization method instances or declarations are used for gating or assurance, their evidence/calibration backing and waiver rules are governed by C.16 (MM‑CHR). In other words, you cannot assume one context’s space fits into another’s without an explicit Bridge; any attempt to do so must treat it as a cross‑context alignment with potential loss.

A.19:5.2.1.3 Product – Combination CS₁ ⊗ CS₂ = CS⊗.

The product of two spaces CS₁ and CS₂ is a new space CS⊗ that effectively contains all slots of CS₁ and all slots of CS₂. If CS₁ has index set I₁ and basis slots {slot₁…} and CS₂ has I₂, then $CS⊗$ has index set $I_⊗ = I₁ ⊎ I₂$ (disjoint union) with each slot’s definition carried over from its original space. In practical terms, any state in the product space is a pair (x₁, x₂) where x₁ is a state of CS₁ and x₂ is a state of CS₂ (assuming the two spaces pertain to possibly different aspects or roles). Use cases: Product spaces allow modeling multi-role scenarios or bundling an entity’s state with some environmental or contextual state. For example, one might take a space of internal capability metrics and ⊗ with a space of external conditions to form a combined space for “readiness under conditions.” Note: When combining scores or coordinates from a product space, one must be mindful of scale incommensurability. Cross‑slot aggregation SHALL proceed only via a declared Γ‑fold (B.1) and, where needed, explicitly declared NormalizationMethods; naïve arithmetic is forbidden. The product operation itself doesn’t perform any aggregation; it only sets the stage.

Comparability of States (two admissible regimes)

A state label like "Ready", "Authorized", "Degraded", etc., in an RSG is a criteria-defined category (defined by a checklist of conditions; see A.2.5). Determining whether the states of two holons are comparable (e.g. whether one is “better” or “worse” than the other in some multi-criteria sense) depends on where their state coordinates live and how we map those coordinates to a common basis. There are two admissible comparability regimes in FPF:

A.19:5.2.2.1 Coordinatewise comparability (≼_coord)

Two states can be compared coordinatewise only under strict conditions. Essentially, we require the states to be expressed in the same measurement space, with the same units and scales, and using the same state definitions. Formally, coordinatewise comparison is allowed only if all of the following hold:

  • Same space. The two holders’ state snapshots lie in the same CharacteristicSpace by value (and, if relevant, the same RCS attached to a Role in a given Context). It’s not enough that they have similarly named characteristics; they must share the actual defined space (same slots with same definitions).

  • Scale congruence. For each slot being compared, the scale type, unit, and polarity orientation are identical. For example, if comparing temperature readings, both must be on the same scale (say, °C on a ratio scale with “higher = hotter” orientation). No unit mismatches or differing interpretations can be present.

  • State-definition congruence. The states or status labels themselves must be defined in terms of the same checklist criteria applied in the same space. In other words, if we are comparing whether one system is “Ready” and another is “Ready”, both instances of “Ready” must derive from the same formal definition (same thresholds, same checklist logic) over those coordinates. If one context’s "Ready" means something different, you cannot assume they correspond.

When these conditions are met, one can define a coordinatewise preorder over states. Common patterns include:

  • Dominance: For a given set of “higher is better” slots, we say state x coord state y if and only if for every relevant slot a, the coordinate $a(x) \le a(y)$ (after orienting all slots to the declared polarity for that slot). In other words, y is as good or better on all enforced criteria. This defines a Pareto-like ordering (often partial, not total).

  • Threshold band inclusion: If states are defined by meeting certain thresholds (e.g. State Y means all metrics above specific levels), then we might say x coord y if x meets every threshold that defines y’s state. For instance, if state y = “High Performance” requires speed > 100 and accuracy > 90%, then x is “no less than y” if x also exceeds those thresholds.

By default, no comparability is assumed unless proven. If any of the above congruence conditions fails, one must not fall back to ad-hoc comparisons (like matching by name or normalizing without declaration). Either switch to a normalization-based regime or declare the states incomparable.

A.19:5.2.2.2 Normalization‑based comparability (≼_normalization)

When two state vectors do not meet the strict conditions for coordinatewise comparison (e.g. they come from different spaces, or the “same” Characteristics are measured on different scales/units), the only sanctioned way to compare them is: normalize, then compare.

Concretely: if we have state x in CS₁ and state y in CS₂, a normalization‑based comparison is permitted only if the model can cite a set of NormalizationMethodInstanceId(s) under a chosen UNM (per A.19.UNM) that lands the relevant coordinates of x into CS₂ (or lands both into a declared common target space). The result is understood as NCVs (or an ≡_UNM quotient class) per A.19.UNM.

Comparability rule (normalize‑then‑compare). We say x normalization y only if, after applying the cited normalization instances to produce a representation of x in CS₂ (or a common target), the mapped state can be compared coordinatewise under ≼_coord. In other words, we never compare raw x and y; we compare after landing in a common, well‑typed space.

If the normalization crosses context boundaries (i.e., CS₁ and CS₂ are in different bounded contexts), then by FPF policy this mapping MUST be treated as a formal Alignment Bridge (F.9) with an associated congruence‑loss (CL) level and MUST be declared via the relevant mechanism’s A.6.1 Transport (BridgeId + channel + ReferencePlane(src,tgt); no implicit crossings). In such cases, any conclusions drawn carry an assurance penalty per B.3 (Φ(CL)).

Auditability. Each cited NormalizationMethodInstanceId used for comparison SHOULD be transparent via its referenced description/edition (per A.19.UNM). Evidence/calibration backing and waiver discipline are governed by C.16 (MM‑CHR). The key here is that no comparison is magic – if values differ in scale or context, the normalization route and its limitations must be explicit.

Mnemonic: “Never compare before you land both points in the same well-typed space.” In other words, always map measurements to a common basis (same CharacteristicSpace and units) before attempting to say one state is ≥ or ≤ another. Directly comparing raw numbers from different scales or contexts is not allowed.

RSG touch-points — State certification via CS

To connect the abstract concept of a space of metrics with the operational concept of states (like “Ready” or “Degraded”) in a RoleStateGraph, we introduce a certifier function that evaluates state predicates against coordinates:

certify(Role, Context): Snapshot( RCS[Role,Context], Window ) ──→ {StateAssertion}

This is a conceptual sketch: given a snapshot of all relevant coordinates for a Role (in its RCS) over some time window, the certifier produces a set of StateAssertions that are deemed true in that window. Each StateAssertion claims that the holder is in a particular state (e.g. “Ready”) during the window, backed by evidence.

5.2.3.1 From CS snapshot to StateAssertion (design → run). Each possible state s in a Role’s RSG has an associated Checklist (s) – a design-time artifact (see A.2.5 §8.1) which is a predicate defined over the RCS’s coordinates (and possibly other contextual observables). For example, a state “Degraded” might have a checklist like “[temperature < 50 °C] AND [pressure > 5 bar] for 10 minutes”. When the system is running, we take an Observation of the current coordinates (a snapshot of the RCS at a given time or over a time window) and evaluate the checklist. A StateAssertion(holder, s, Window) is then a record that the checklist for state s has been satisfied by the observed data in that interval. In other words, it’s a certified evaluation that “state s holds true for this holon at this time.” Only observable, measurable facts go into these predicates (no subjective judgments), and each assertion is traceable to the specific evidence (observations) that support it. The Role’s Green-Gate Law (A.2.5 §8.4) then says that a Role can proceed with an enactment (e.g. performing work) if and only if there is a StateAssertion showing the holon to be in an enactable state at that time. This connects measurement to action: you can only act if you have evidence you’re in the right state to act. Evidence kind & window. Every StateAssertion SHALL record evidence_kind ∈ {observation, prediction}, the window [t_from, t_to], and, if prediction, the horizon Δt relative to the observation base. Use of prediction in enactment gates is permitted only under the DYN/TIME constraints captured in CC‑A19.17–A19.18; otherwise a fresh observation is required.

5.2.3.2 Translating state definitions across embeddings. If we have an embedding ι: RCS₁ ↪ RCS₂ (for example, RCS₁ is a subspace or a different version of RCS₂), we might want to reuse or compare state definitions between the two. There are two directions to consider:

  • Pulling a checklist (reuse state criteria from a larger space in a smaller space): Given a checklist defined on RCS₂ (the larger or target space), we can pull it back via the normalization map N of the embedding to get a predicate on RCS₁. This derived checklist (Checklist₂ ∘ N) lets us apply the RCS₂’s state definition to a holon that only has RCS₁ measurements. This is useful when a consumer context wants to evaluate whether a producer (with fewer characteristics or different units) meets the consumer’s state definitions. Essentially, the consumer asks: “If I map the producer’s metrics into my space, does it satisfy my state criteria s?”
  • Pushing an assertion (honor a producer’s certified state in a larger space): If a holon has a StateAssertion for state s’ in RCS₁, can we treat it as evidence for state s in RCS₂? This is only valid under a strict condition: the checklist for state s in the larger space, when composed with the normalization mapping N, must logically imply the checklist s’ in the smaller space (or vice versa, depending on which state corresponds to which). In practice, this often requires a proof of refinement: that meeting state s (in big space) guarantees state s’ (in small space), or that state s’ (in small) is sufficient for state s (in big space) given the normalization translations. If that condition is met (or a policy waiver is granted in lieu of proof), then an assertion in the smaller space can be pushed up to count as an assertion in the larger space. This mechanism allows, for example, a component’s certified state to satisfy a system-level state requirement, provided the relationship is formally established.

5.2.3.3 Certification interface (pointer). Operational interface examples and minimal data stubs are informative and live in A.19.CN (“Certification Interface Example”). Pattern A.19 only constrains conceptual obligations; no storage/ID scheme is mandated here.

(In summary, embeddings not only allow numeric comparability, but also allow state definitions and certifications to be systematically translated between contexts, ensuring consistency in how we interpret “Ready”, “Failed”, etc., across different models.)

Cross-context comparability & assurance hooks

When comparing states or metrics across different bounded contexts (different “context of meaning”), additional rules apply to maintain semantic integrity:

A.19:5.2.4.1 Direction & loss (Bridges).

Suppose we want to claim that “Holon X in Context B is in state Ready as defined in Context A.” This requires an explicit Alignment Bridge declaration that maps the RCS of (Role, Context B) to the RCS of (Role, Context A) (or maps State B to State A). Such a Bridge (see F.9) will specify the correspondence of Characteristics (and the necessary NormalizationMethods under UNM) and a congruence‑loss (CL) level indicating how much fidelity is lost in translation. Critically, these Bridges are one-directional mappings unless explicitly made bidirectional. Just because we can interpret B’s state as an A-state does not mean we can go the other way without another mapping. The Bridge makes the mapping and any loss explicit. Without a declared Bridge, cross-context state comparisons or substitutions are not valid – there is no implicit global state space. The statement above, for instance, would only hold if we have something like “Bridge B→A (with defined NormalizationMethods) such that X@B can be viewed in A’s terms.” The direction matters: “B satisfies A’s Ready” does not imply the converse unless another bridge (A→B) is defined.

A.19:5.2.4.2 Confidence penalties for mapped comparisons.

Whenever a normalization-based comparison crosses Contexts (via a Bridge), assurance MUST apply the penalty Φ(CL) as defined in B.3 (CL is ordinal there). For episteme‑specific compositions, B.1.3 instantiates the same policy. This pattern does not restate the scale or Φ; it uses B.3 for the scale and penalty policy. For example, a safety argument that relies on a cross-context comparison might need to downgrade its certainty or include an extra safety margin. This penalty MUST be declared as part of the assurance argument for the comparison (stating the Bridge used and its CL), so that the Φ(CL) discount can be reasoned and applied. No implementation‑level storage format or identifier is mandated by this pattern.

A.19:5.2.4.3 Declare “incomparable” when appropriate.

If for some critical Characteristic there is no valid NormalizationMethod to translate measurements between two contexts (e.g. the scale types are fundamentally different, or the measurement’s meaning doesn’t carry over), then the framework insists that we declare the states or metrics incomparable rather than attempting any fudge. No comparison should ever default to “close enough by name” or other heuristics. For instance, if one context measures “User Satisfaction” qualitatively and another quantitatively, and no monotonic mapping can be justified, one must simply say a user satisfaction state in context A cannot be compared to one in context B. Mark it incomparable and avoid any misleading conclusions. This rule guards against the natural temptation to compare things just because they have the same label or general intent, when in fact their measurement basis is different.

Certification pipeline (Minimal, Normative)

Canonical evaluation chain (notation‑neutral):

raw coords → Normalize (UNM.NormalizationMethodInstance) → Quotient / NormalizationFix → (optional) Indicatorization (via IndicatorChoicePolicy) → (optional) Order/Distance overlay → Evaluate Checklist → StateAssertion → Green‑Gate

Strict distinction. Steps may be co‑implemented, but are logically distinct and MUST be referenceable in assertions (NormalizationMethodInstance/UNM name or formula, overlay kind). A gate is invalid if any required step lacks a current, valid referent (e.g., expired NormalizationMethodInstance edition).

Operator library (notation‑neutral)

Spaces: Sub (projection), Emb (embedding), Prod (product), Quot (quotient by declared equivalence), NormalizationFix (fix to a named chart/edition).

States/criteria transport: Pull (pull checklist via embedding/NormalizationMethodInstance), Push (push assertion along embedding with proof/waiver), Indicatorize (apply IndicatorChoicePolicy to select Indicators), Align_B (cross‑context alignment via Bridge with CL), Fold_Γ (admissible aggregation/accumulation per B.1, with WLNK/MONO constraints).

OP‑1 (Normative). If Align_B is used in gating, the Bridge used and its CL MUST be declared in the assurance argument; the corresponding Φ(CL) penalty is applied per B.3. Silent cross‑context reuse is forbidden. (A.19 does not mandate any storage/ID scheme.)

Typed set views and optional neighboring transition-sensitive selection interpretation

  • TypedSetViews name declared views over already declared set results such as one palette, one front, one archive, or one shortlist.
  • A typed set view is one optional neighboring interpretive qualifier for interpretation or shipping; it does not become a new public head for the set and it does not redefine the current minimal core question by itself.
  • SelectionSlot still returns one selected set result, and Shortlist remains the public head when a selected set is emitted.
  • If one atlas-like reading uses several typed set views over the same source set, each view should keep its active source set and typed question recoverable instead of speaking as though one default view already settles the whole family.
  • In source-set and space-role interpretive prose, SearchSpaceRef and OutcomeSpaceRef are role-specific refinements of the older SpaceRef idiom. Do not let umbrella SpaceRef wording hide which space-ref role the current typed-set-view reading depends on.
  • Use one SpaceMetricRef only when a comparison, neighborhood, spread, or crowding claim truly depends on one declared space metric or comparison rule.
  • Use one TransitionRelationRef only when the text must say how transition or trajectory relations behave across one declared level shift, normalization choice, or aggregation step. One covariance-style model is one admissible subtype of TransitionRelationRef, not the only one.
  • If one typed set view also cites one such role-specific space ref or OutcomeMapRef, keep those refs as declared qualifiers for that view rather than as one new public set head.
  • If one selector or comparison reads one derived tradition view through one typed set view, keep the underlying declared source set recoverable at the same time.
  • Different typed set views may coexist for the same source set; keep that plurality visible rather than pretending one metric or transition formalism already settles every neighboring comparison.

Conformance Checklist (normative) — CC‑A19

Formality references & operational segregation (normative). A.19 aligns with C.2.3 Unified Formality Characteristic (F). The legacy tier labels T0/T1/T2 are deprecated; speak F directly and treat operations separately (see E.10 for registers). — F-Declaration baseline (recommended F ≥ F3). Obligations are declarability and arguability: the author can name the CharacteristicSpace (basis/slots as (Characteristic, Scale) pairs), state the comparability regime (coordinatewise or normalization-based), and express a state’s checklist in observable coordinates. No storage formats, IDs, or operational provenance are required. — F-Predicates (F ≥ F4 when predicate-like). As above, plus explicit slot/NormalizationMethod names and stated overlays (order/metric). When acceptance conditions are written as typed predicates over coordinates, declare F ≥ F4. Remains notation-neutral and storage-agnostic. — Operational bindings (not part of F). When automatic checking/assurance is required, use A.19.CN / C.16 / B.3 for IDs, validity windows, waivers, and logs. These raise R/TA in the trust calculus and do not change F unless the expression form changes (see C.2.3 orthogonality).

The following checklist summarizes the normative requirements introduced by Pattern A.19. An implementation or model conforms to A.19 if and only if all these conditions are met:

Spaces & mappings CC‑A19.1. Any defined Subspace, Embedding, or Product of CharacteristicSpaces MUST explicitly list the involved slots and their metadata (scale type, unit, polarity). No comparability or merging is allowed purely by matching names or assuming correspondence – it must be declared. CC‑A19.2. Every Embedding ι: CS₁ ↦ CS₂ MUST cite a well‑defined NormalizationMethodInstance (per A.19.UNM) for each slot where CS₁’s slot differs in scale/unit from CS₂’s. The cited instances MUST satisfy the admissibility/declaration obligations governed by A.19.UNM (incl. monotonicity w.r.t. polarity, validity window, and method‑class token) and, when used for gating/assurance, MUST be evidence‑backed per C.16. (Identity suffices where scales are identical.) CC‑A19.2a. Scale‑class guard (by reference). The scale‑class requirements for admissible normalizations are governed by A.19.UNM (and must remain CSLC‑consistent per A.18). This checklist item is satisfied by citing a NormalizationMethodInstance whose declared class token meets those requirements; do not restate the taxonomy here.

Comparability CC‑A19.3. Coordinatewise comparability (≼_coord) is permitted only when the states being compared share the same CharacteristicSpace, with identical scale metadata on each compared slot, and using the same state definition criteria. If these conditions aren’t fully satisfied, an implementation MUST NOT attempt direct coordinatewise comparison; it should either apply a normalization‑based method or report the items as incomparable. CC‑A19.3a. Use of Indicators in any checklist/assertion MUST cite an IndicatorChoicePolicy (edition). Treating any NCV as an Indicator without a declared policy is forbidden.

CC‑A19.4. Normalization‑based comparability (≼_normalization) MUST be done by first normalizing all relevant coordinates of the source state into the target state’s space via declared admissible NormalizationMethodInstance(s) (see A.19.UNM), and only then comparing in that common space. In other words, two states can be compared under ≼_normalization only by producing an image of one in the other’s space (N(x)) and using ≼_coord on the result. No implicit or “on the fly” conversions are permitted. CC‑A19.5. Any cross-context state comparison or substitution MUST cite a corresponding Alignment Bridge (F.9) with an explicit CL (congruence-loss) level. If such a Bridge is used in an assurance or decision-making context, the model MUST apply the appropriate confidence reduction (Φ(CL) penalty per B.3) to reflect the loss. Cross-context comparisons without a Bridge (i.e. assuming equivalence by name or convention) are forbidden.

Certification & enactment CC‑A19.6. Every StateAssertion MUST identify at least: the specific state being asserted (by name), the associated checklist or criteria set (by name), and the observation window. Furthermore, if the evaluation involved cross‑space mapping, it MUST declare which NormalizationMethod(s) or Bridge were applied. This ensures the decision can be examined in review; A.19 does not mandate any storage/ID scheme.

CC‑A19.7. The Green-Gate enactment rule (A.2.5) SHALL be enforced: a transformative action (U.Work) by a RoleAssignment is only allowed if there exists a contemporaneous StateAssertion showing the holon in a state that is marked enactable. If a StateAssertion has been translated from another context or space, it is valid for gating only if it was obtained through declared Embeddings/Bridges (no untracked inferences). This ensures no work is done under an unverified or mis-mapped state condition. CC‑A19.8. All Checklist definitions for states MUST be formulated in terms of observable predicates on the RCS (and known context events) – no hidden workflows or implicit time sequencing inside a checklist. A checklist should read like a static predicate (even if it’s about a duration of some condition). If temporal order or multi-step processes are involved in achieving a state, those must be modeled via explicit Methods/Work or via an aggregation logic (e.g., using the Γ (Gamma) patterns in B.1 for process sequencing), rather than being baked into the state’s definition. Use of Indicators in any checklist MUST cite an IndicatorChoicePolicy edition; treating any NCV as an Indicator without policy is forbidden.

Anti‑drift CC‑A19.9. If a NormalizationMethod/UNM or a state checklist is updated or calibrated differently in a new version, previous StateAssertions MUST NOT be retroactively modified. One must close out or mark the old assertions with their valid time window and start issuing new assertions under the updated definitions. In other words, historical records remain as they were (tied to the definitions at that time), and any change in criteria results in a new context or version for future assertions. This prevents retroactive truth-changing and maintains integrity of historical data. CC‑A19.10. If any critical slot in a comparison lacks an admissible NormalizationMethodInstanceId (per A.19.UNM) to translate that slot between the relevant spaces (within the declared validity window), then the comparison MUST be reported as incomparable. The model must not attempt unofficial workarounds (e.g., name‑matching, silent dropping of the slot, or ad‑hoc coercions). This rule applies even if all other slots have admissible normalization instances, unless a policy explicitly accepts the loss via a declared Bridge with stated limitations.

Quotients & Normalization‑fix (QNT) CC‑A19.11. Equality checks and joins across spaces MUST target invariant forms (on a quotient or declared NormalizationFixed chart), not raw coordinates. CC‑A19.12. If a checklist predicates on a normalization‑variant property, it MUST name the NormalizationFix (which UNM.NormalizationMethod or chart is assumed). CC‑A19.13. All used method‑class tokens for cited NormalizationMethodInstanceId(s) MUST be named in the bounded context’s glossary (per the taxonomy governed by A.19.UNM). Do not restate the class taxonomy here.

Metric discipline & calibration (MET) CC‑A19.14. If a distance overlay is used, acceptance predicates/KPIs over a CS SHALL be non‑expansive (Lipschitz ≤ 1) w.r.t. the published d on the declared domain (raw coordinates or NCVs), or declare a compensating margin; otherwise they SHALL be isotone w.r.t. the declared product order. CC‑A19.15. Any distance used in state/acceptance checks MUST carry max tolerated error and, where claimed, a Lipschitz bound for the NormalizationMethod composition in use. CC‑A19.16. Cross‑CN‑frame inputs SHALL name the normalization transform and its validity window; expired transforms are invalid for gating unless waived explicitly.

Dynamics & time (DYN/TIME) CC‑A19.17. Every temporal guard MUST specify the window [t_from, t_to] and evidence_kind ∈ {observation, prediction}; if prediction is used for gating, the conditions in § 5.2.3.1 (Evidence kind & window) MUST hold. CC‑A19.18. Any dynamics map Φ_{Δt} used in comparison/gating MUST be non‑expansive (Lipschitz ≤ 1) under the declared distance overlay and commute with NormalizationFix; otherwise observation is required.

Certification (CERT) CC‑A19.19. StateAssertions MUST state the current NormalizationMethod/UNM and overlay artifacts used (by name or formula) and the evidence_kind; assertions relying on expired NormalizationMethod/UNM are invalid for gating unless an explicit Waiver SpeechAct is declared per policy. (A.19 imposes no requirement on IDs or storage.) CC‑A19.20. The certification pipeline steps (Normalize (UNM.NormalizationMethod); Quot/Fix_normalization; overlay; evaluate; assert) are logically distinct and MUST be reconstructable in argument/review; collapsing steps without clearly stated referents violates A.19. (No specific persistence format is implied.)

Operators (OP) CC‑A19.21. Use of Align_B in gating MUST declare the Bridge used and propagate CL into assurance (B.3). Cross‑context comparison without a Bridge is forbidden. (No requirement to store an ID is imposed by A.19.)

Anti‑patterns → safe rewrites

The following are common modeling mistakes (“anti-patterns”) related to measurement spaces, and how to correct them:

  • “Same label ⇒ comparable.”Assuming Ready@contextA ≥ Ready@contextB just because both states are called "Ready".Explicitly normalize and bridge contexts: Define an Alignment Bridge (B→A) and appropriate NormalizationMethods for the underlying metrics. Then compare by first translating one state’s coordinates (compute N(x) as NCVs in the target space) and using ≼_coord on the result.

  • “Compare before landing.” ✗ Comparing values directly across different scales, e.g. Drift_A = 5°C vs Drift_B = 5°F as if they were the same. ✓ Normalize to common units first: e.g., apply the Fahrenheit‑to‑Celsius NormalizationMethod m(T_F) = (T_F − 32) × 5/9 to convert all data to °C, then compare the drift values. Always normalize into one space before comparing magnitudes.

  • “Checklist = workflow.” ✗ Defining a state’s checklist with an implied sequence: “State ‘Ready’ requires doing Step 1 then Step 2…”Keep checklists declarative: A Checklist should represent a state of the system (a condition) – essentially state evidence – not a sequence of actions. If order or process matters, model that explicitly via a MethodDescription or by using a Γ (Gamma) aggregator for process logic. In other words, state = “Ready” might require conditions A and B to be true (regardless of how you got there), whereas the procedure to get ready (do Step1 then Step2) should be a separate method or playbook.

  • “Retro-fix past assertions.” ✗ Going back to edit or reinterpret old StateAssertions after changing a threshold or NormalizationMethod (e.g. “We updated the criteria, let’s ‘fix’ last quarter’s records to match”). ✓ Never alter historical assertions: Leave history as‑is. If criteria change, issue new assertions under the new criteria going forward, and if needed, explicitly version the NormalizationMethod/UNM or checklist. Past assertions remain valid for the old version and their time; new ones apply henceforth. This ensures auditability and avoids erasing or rewriting what was true under earlier standards.

C.27 temporal-claim relation.

  • C.27 may flag: a rate/rate-change claim that needs base characteristic, scale/unit, time base or sampling window, transformation/finite-difference method, evidence, and admissible use.
  • This pattern keeps: CharacteristicSpace coordinate discipline and the measurement/coordinate relation carried with C.16.
  • Non-admissible use: derivative-like words such as velocity, acceleration, throughput, cadence, or recovery speed do not make a free characteristic, metric, or measurement template.
  • Exit: when the reading is load-bearing, cite baseCharacteristicRef, the relevant measure reference, sampling window, construction method such as DHCMethodRef, and C16RouteRef; C.27 does not define a parallel measurement system.

A.19.ECS object-under-improvement evaluation construction relation.

  • A.19 defines CharacteristicSpace as an ontological structure: slots, characteristics, scales, value sets, overlays, and comparability boundaries.
  • A.19.ECS governs the construction of one object-under-improvement evaluation CharacteristicSpace for an object being improved. It is used before E.22 and E.23 when no adequate object-under-improvement evaluation exists.
  • Existing object-under-improvement evaluation patterns such as E.21, E.9.DA, E.2.DA, and the naming vector inside F.18 are examples of this construction shape for object kinds under improvement. They keep their own coordinate, value-meaning, and stop-condition definitions.

C.29 mathematical-lens use relation

If topology, order, distance, product, subspace, embedding, or metric is only a CharacteristicSpace overlay, stay in A.19 and write the space, coordinate, normalization, and comparability declaration there. If the overlay is used as a mathematical lens to explain, predict, bridge, assure, publish, compare across contexts, or support reusable explanation beyond local declaration, add the applicable C.29 lens-use result for the stated lens use. Do not move the space declaration out of A.19; C.29 names only what the mathematical lens preserves, loses, makes visible, and cannot license.

A.19:End

Evaluation CharacteristicSpace Construction

Type: Method pattern Status: Stable Normativity: Normative

Problem frame

Use A.19.ECS when an object version is to be improved or judged, but the evaluation that says what "better" means is not yet available, not yet explicit, or not yet adequate for the object.

A.19 says how a CharacteristicSpace is structured: declared characteristics, declared scales, slots, value sets, declared coordinate groups, and no hidden normalization or aggregation. A.19.ECS says how to make such a CharacteristicSpace for the evaluated object, so that an evaluation can later evaluate that object and E.23 can run an improvement loop without inventing values.

The ordinary output is an evaluation characteristic-space specification: a grouped set of characteristics, scales, value meanings, evidence-basis rules, missingness rules, result-row shape, calibration points, coordinate-specific evidence payloads, protected trade-offs, status meanings, and stop or reopen conditions for one evaluated object kind and use scope.

Not this pattern when. If a suitable evaluation already exists, cite it and use E.22 for question framing or E.23 for repeated improvement. Use A.17, A.18, and C.16 when the live problem is one characteristic, one scale, or measurement legality. Use C.16.P first when candidate coordinate wording still hides whether the use under repair is a characteristic, scale, coordinate, score, metric label, quality-term repair, or governing-pattern relation. Use A.19 when the live problem is the structure of CharacteristicSpace itself. Use C.25 when the evaluated EntityOfConcern is a composite engineering quality family that already fits Q-Bundle form. Use F.18 when the live problem is durable naming. Use E.21, E.9.DA, or E.2.DA when the evaluated EntityOfConcern is respectively one FPF pattern version, one DRR, or one FPF-level Pillar-adequacy evaluated EntityOfConcern.

First useful move. State the sentence: "good as what kind of object, for which use, against which contrast cases?" Then name the evaluated object kind, the use scope, and at least three contrast cases: one admissible evaluated object, one below-floor evaluated object, and one outside-declared-object-kind boundary case that should return to evaluation selection before the evaluation is opened or receive an explicit object-kind-fit defect/value when that evaluation has already been invoked.

Existing-evaluation boundary. If the answer is "use this existing evaluation" and the evaluated object kind, use scope, floor, protected trade-offs, and stop meanings are already recoverable, do not construct a new CharacteristicSpace.

What goes wrong if missed. A team says "improve this" and then chooses convenient scores. A scale set appears from nowhere. Chairs, coal plants, nuclear plants, and FPF patterns all get compared on coordinates that do not distinguish the evaluated object kind. One visible value improves while the intended use gets worse. A review can say "better" but cannot say which object property changed, what trade-off was protected, or why improvement may stop.

What this buys. A.19.ECS gives improvement work a way to create the missing evaluation before the loop starts. It keeps E.23 universal and simple: E.23 changes the object and asks an evaluation to re-evaluate it; A.19.ECS helps build that evaluation when none is yet adequate.

Primary EntityOfConcern in plain terms. The primary EntityOfConcern is the construction of one evaluation CharacteristicSpace for one evaluated object kind and declared use.

Primary working reader. The first reader is the engineer, analyst, pattern author, reviewer, steward, or method designer who must define what counts as improvement for an evaluated object before running an improvement loop.

Problem

FPF already has named patterns for single characteristics, scales, coordinate values, Q-Bundles, and repeated improvement. The gap is the construction of a useful grouped scale set for an evaluated object kind.

Recurring failures:

  1. Scale set from air. An evaluation lists coordinates because they are familiar, not because they discriminate the evaluated object kind or use.
  2. Wrong-kind comparison. Objects outside the declared kind are scored as if they were weak objects under improvement, or are silently skipped, instead of being returned to evaluation selection before opening or handled by an explicit object-kind-fit defect/value after opening.
  3. One-score collapse. Several independent characteristics are averaged into one score, hiding object-kind-fit defects and trade-offs.
  4. Unstated polarity. Readers cannot tell which direction is preferred or when a value has no preferred direction.
  5. No floor or exceptional meaning. Values are recorded, but nobody can say what is viable, exceptional, or still inadmissible for the declared use.
  6. No evidence or missingness rule. A coordinate value is asserted without saying what observation, content locus, test, example, source, or judgment can justify it, or what absence means.
  7. No protected trade-off. The evaluation encourages improvement on visible coordinates while damaging safety, usability, affordability, source preservation, entry cost, neighbour fit, or another value that should constrain the change.
  8. No stop or reopen condition. Improvement continues forever or stops after a convenient checklist closure, not because the evaluation says the evaluated object has reached the declared aim.
  9. Specification underdeclaration. A new evaluation is mentioned in prose, table, rule, or local rubric, but its declared specification does not make evaluated object kind, coordinate set, value meanings, status meanings, relations, and non-use boundaries recoverable.
  10. Result-form underdeclaration. The evaluation has coordinates, but the returned result can be a prose impression, a two-column value table, or a checklist count without evidence basis, adjacent-value rationale, calibration discipline, or coordinate-specific payload.
  11. Evidence-basis leakage. Evidence needed to justify the evaluation result, corpus projection, currentness, retrieval, or parity is written as if it were the evaluated object's own method or user action.

Forces

ForceTension
evaluated-object-kind discrimination vs broad reuseThe evaluation must fit the evaluated object kind, but it should reuse existing FPF characteristic and scale discipline where possible.
Small first version vs enough coordinatesA useful first evaluation can be compact, but it needs enough coordinates to block false improvement and wrong-kind comparison.
Measurement legality vs ordinal judgmentSome coordinates are measured through C.16; others are evidence-backed ordinal content values. The evaluation must say which is which.
Improvement direction vs trade-off protectionPreferred movement must be visible without turning every coordinate into an optimization command.
Contrast cases vs overfittingContrast cases are needed to test the scale set, but the evaluation must not become a list of examples only.
Reusable specification vs local useA reusable evaluation must make the same evaluation characteristic-space elements recoverable across uses. A local project can use a smaller specification when the use is bounded and non-reusable.
Local stop vs open-ended improvementA loop may stop for the declared use while the object and the scale set remain improvable under new use, source, or comparison pressure.

Solution

Construct an evaluation CharacteristicSpace by declaring the evaluated object kind, use scope, contrast cases, characteristic slots, scale bindings, value meanings, evidence-basis and missingness rules, result-row shape, calibration points, coordinate-specific evidence payloads, protected trade-offs, status meanings, and stop or reopen conditions.

EvaluationCharacteristicSpaceSpec := <EvaluatedObjectKindRef, ObjectVersionUnderImprovementRef?, DeclaredUseScope, WorkingReaderScope, QualificationWindow, DiscriminatingCaseSet, ObjectKindFitRule, CharacteristicSlotSet, ScaleBindingSet, PolarityAndPreferredMovement, FloorAndExceptionalMeaningSet, EvaluationEvidenceBasisRule, EvidenceAndMissingnessRule, ResultRowShape, AdjacentValueRationaleRule, CalibrationPointSet, CoordinateSpecificEvidencePayloadRule?, ProtectedTradeoffSet, DominanceOrComparisonRule?, StatusValueSet, StopOrReopenCondition, NeighborPatternExitSet, E22QuestionFrameUse?, E23StartCondition>

Local names and kind settlement

Local nameRoleNon-use boundary
EvaluationCharacteristicSpaceSpecLocal specification for constructing one evaluation CharacteristicSpace.Not a score sheet, review packet, work plan, gate, evidence record, or project approval.
EvaluatedObjectKindRefExact kind of object the evaluation evaluates.Not a vague artifact, file bundle, campaign, chat, or source collection.
DeclaredUseScopeUse for which the evaluated object is being judged or improved.Not all possible uses.
DiscriminatingCaseSetPositive, below-floor, and outside-declared-object-kind boundary cases used to test whether the characteristic space distinguishes the evaluated object kind and use.Not a substitute for the coordinate set.
ObjectKindFitRuleRule for admissible evaluated object, below-floor evaluated object, and outside-declared-object-kind boundary case.Not permission to omit declared coordinates after an evaluation has been invoked.
CharacteristicSlotSetThe grouped slots, each binding one characteristic to one scale.Not an arbitrary checklist and not hidden aggregation.
ScaleBindingSetThe chosen scale and value meaning for each characteristic slot.Not a metric dashboard unless a distance or measurement claim is explicitly declared by the neighbour.
PolarityAndPreferredMovementDirection of preferred movement for each coordinate, or a statement that the coordinate has no simple preferred direction.Not permission to optimize one coordinate while damaging protected trade-offs.
FloorAndExceptionalMeaningSetViable-for-use and exceptional-for-use value meanings for declared coordinates.Not a maturity ladder and not proof that future improvement is impossible.
EvaluationEvidenceBasisRuleThe checked evidence loci required for the result: object version, corpus/projection loci when corpus-facing, source-currentness loci when currentness is valued, comparator loci when parity is valued, worked-case loci when case coverage is valued, and missing or unchecked loci when they affect values.Not a separate "not evaluated" alternative, not permission to infer values from reputation, review state, or absence of visible defects, and not the evaluated object's own method or user action.
EvidenceAndMissingnessRuleWhat justifies a value and how missing, censored, unknown, object-kind-fit, or boundary-return cases are handled.Not project evidence, assurance, or gate proof by itself.
ResultRowShapeRequired result row fields for the evaluation, including coordinate, value, and a short rationale; some evaluations may add evidence-locus or payload fields.Not a free-form review paragraph and not a two-column coordinate/value table.
AdjacentValueRationaleRuleRule that each result rationale says why the lower adjacent value would understate the evidence and why the higher adjacent value would overstate it, or for the top value what would lower or reopen the claim.Not verbosity for its own sake.
CalibrationPointSetReusable 3/4/5 or equivalent adjacent-value calibration points for common evaluator disagreements.Not a second score system and not a shortcut around the declared scale.
CoordinateSpecificEvidencePayloadRuleExtra payload that a coordinate needs when a category label can fake discharge: comparator plus selected ingredient plus current locus, source plus adopted payload plus currentness window, projection locus plus retrieval cue, or another payload named by value.Not administrative burden, not the evaluated object's method, and not live evaluated-object text unless the evaluated object itself is an evaluation result or projection carrier.
ProtectedTradeoffSetQualities or neighbour claims that must be checked when visible coordinates improve.Not a hidden veto without a declared evaluation pattern or value meaning.
PrecisionRepairKindRuleRule for checking pre-repair and post-repair evaluated object kind, characteristic kind, relation or claim kind, slot or use-position, admissible use, and scope when coordinate wording or evaluation wording is repaired, with a governing-pattern reference when another pattern governs the kind under repair, relation, claim, or position.Not a lexical substitution table and not permission to change object kind or slot/use-position by cleaner wording.
StatusValueSetLocal admissible-use result values for the evaluation.Not release state, gate status, or reviewer praise.
E23StartConditionMinimum condition for using this evaluation inside E.23.Not the improvement loop itself.

These names are local to this pattern. They do not mint kernel U.* kinds, measurement templates, gate states, evidence kinds, or release states.

Construction moves

Use these moves when constructing or repairing an evaluation. They are not a mandatory work sequence; each move is a required content question whose answer must be recoverable before the evaluation is used for improvement.

  1. Name the evaluated object kind and use. Say what object kind is being evaluated and for which declared use. If the evaluated object kind is not recoverable, stop before choosing coordinates.
  2. Build the discriminating cases. Include at least one evaluated object that should pass, one object of the same general family that should fail the floor, and one different object kind that should return to evaluation selection before opening or receive an explicit object-kind-fit defect/value if this evaluation has already been invoked.
  3. Choose candidate characteristics. Draw candidates from the object kind's real failure modes, first-principles structure, user or operator harms, domain tradition, current SoTA, existing evaluations, and FPF neighbouring patterns named by value.
  4. Bind each slot. For each candidate, state the characteristic, chosen scale, value set, admissible domain, missingness semantics, and whether the value is a measurement claim or an ordinal content evaluation.
  5. Remove false coordinates. Drop coordinates that do not change admissible action, do not discriminate the evaluated object, duplicate another coordinate without a different repair move, or belong to another exact evaluation.
  6. Split compound coordinates. If a coordinate mixes two repair moves, two object kinds, or two incompatible scales, split it or assign one part to the neighboring pattern governing the claim that governs it.
  7. State preferred movement and trade-offs. For each declared coordinate, state the preferred direction or explain why no simple direction exists. Name the protected trade-offs that must be checked when the coordinate improves.
  8. Define result form, evidence basis, and calibration. State the required result row shape, evidence basis, adjacent-value rationale rule, calibration points for common disagreements, and any coordinate-specific payload needed for high or floor-reaching values.
  9. Define floor, exceptional, status, and stop. State the viable-for-use floor, exceptional-for-use meaning, status values, and local stop or reopen condition.
  10. Record governing-neighbour relations. Name the FPF pattern that governs evidence, assurance, gate, work, decision, publication, naming, quality-bundle, measurement, OEE/NQD, or mathematical-lens claims when those become live. This is a declarative relation after the coordinate/value/evidence content, not route, receiver, owner, host, home, handoff, exit prose, "go there/not here" reference boilerplate, or architecture-placement rationale.
  11. Start E.23 only after evaluation values exist. A repeated improvement loop can start only when the evaluated object version, evidence basis, result form, and evaluation are recoverable enough for re-evaluation.

Evaluation specification minimum

A.19.ECS does not prescribe a publication or record form. It states which evaluation characteristic-space elements must be recoverable before an evaluation characteristic space is reusable for judgement or improvement. The selected publication or record form may be an FPF pattern, local engineering standard, rubric, table, review form, model card section, protocol note, or project rule, but that form is not governed here. The evaluation characteristic-space specification must make these items recoverable by value:

Specification itemRequired content
Evaluation problem frameEvaluated object kind, declared use, first useful move, existing-evaluation boundary, and what goes wrong if no evaluation exists.
Non-use boundaryBoundaries to single-characteristic, measurement, Q-Bundle, naming, evidence, assurance, gate, work, decision, publication, and loop-method patterns.
Local names and kind settlementLocal field names, role named by values, and non-use boundaries.
Evaluation record shapeThe local record or bundle shape used by the evaluation.
Object-kind fit ruleAdmissible evaluated object, below-floor evaluated object, and outside-declared-object-kind boundary handling before and after invocation.
Evaluation evidence basisLoci named by value that must be checked or named when a value depends on object version, corpus projection, source currentness, mature comparator, worked case, retrieval, or other external evidence.
Result-row shapeRequired result row fields, at minimum coordinate, value, and short rationale; any required evidence-locus or coordinate-specific payload fields are declared here.
Coordinate setCoordinate heads, properties of the evaluated object, evaluated-object properties and use conditions, scale/value meanings, evidence loci, and protected trade-offs.
Calibration and payload rulesAdjacent-value calibration points and coordinate-specific payloads that prevent impressionistic 3/4/5 assignment or category-list discharge.
Status and stop conditionAdmissible-use statuses, local stop meanings, and reopen conditions.
Worked slicesAt least one passing evaluated object, one below-floor evaluated object, and one outside-declared-object-kind boundary case.
Common anti-patternsThe false interpretations or values the evaluation must block.
Neighbouring-pattern claim assignmentNeighbouring FPF patterns named by value and the claims being made that each pattern governs.

This minimum is a content requirement, not a file-format requirement. For an FPF pattern publication form, E.8 still governs the authoring form. A.19.ECS only states what the evaluation must make recoverable so that E.22 can frame an improvement-oriented quality evaluation and E.23 can run a repeated improvement loop.

When construction or repair changes coordinate wording or evaluation wording, the evaluation characteristic-space specification records PrecisionRepairKindRule or an equivalent result-row requirement. The check compares the pre-repair and post-repair evaluated object kind, characteristic kind, relation or claim kind, slot or use-position, admissible use, and scope, and names the governing pattern when another pattern governs the kind under repair, relation, claim, or position. A cleaner phrase that changes those items, treats a coordinate position as an object kind, or loses the value's slot/use-position is a changed evaluation decision, not a wording repair.

Discriminating-case test

An evaluation is not ready if it cannot distinguish these three outcomes:

  1. Admissible evaluated object. The object is of the evaluated object kind and can meet or exceed the floor under the declared use.
  2. Below-floor evaluated object. The object is of the evaluated object kind or a declared comparable family, but fails one or more floors.
  3. Outside-declared-object-kind boundary case. Before the evaluation is opened, the object should return to evaluation selection or construction rather than be treated as the evaluated object kind. If the evaluation has already been invoked for that object, the result is an explicit object-kind-fit defect/value or repair status, not omitted coordinates.

Example: for a nuclear-plant adequacy evaluation, a nuclear plant can vary along safety, output, maintenance, regulatory, thermal, waste-handling, grid, and resilience coordinates. A coal plant may be a power-generation alternative only when the declared use explicitly compares power-generation options across plant kinds. A chair or FPF pattern is outside the nuclear-plant evaluated-object kind: before opening the evaluation it returns to a suitable evaluation; after a forced invocation, the record shows an object-kind-fit defect/value rather than pretending the chair has weak nuclear-plant quality or silently skipping coordinates.

Scale-set improvement

The evaluation characteristic space itself can be improved. In that case, the evaluated object is the current EvaluationCharacteristicSpaceSpec version, not the original evaluated object.

Use E.23 for the repeated improvement method over the scale set when the improvement aim is live. The evaluation for that meta-level improvement may be:

  • this pattern's conformance checklist for whether the scale set is constructible and usable;
  • E.21 when the evaluation characteristic-space specification is itself an FPF pattern version;
  • E.9.DA when the decision record selecting the scale set is the DRR decision-adequacy object being evaluated;
  • E.2.DA when the scale set changes FPF-level Pillar adequacy;
  • F.18 when the live problem is name choice for the scale-set heads;
  • C.16, A.17, A.18, or A.19 when the live problem is measurement or characteristic-space legality.

Do not improve an evaluated object by silently changing its evaluation. If the evaluation changes, the loop record names the changed evaluation version and states whether earlier object-version values remain comparable, need a bridge, or must be retired for the new use.

Worked slices

Show, FPF pattern quality. The evaluated object kind is one FPF pattern version. The existing evaluation is E.21, so A.19.ECS stays closed unless E.21 itself is being redesigned. E.23 may improve the pattern version under E.21.

Show, DRR adequacy. The evaluated object kind is one DRR version for a declared campaign-decision use. The existing evaluation is E.9.DA. If a campaign needs a different DRR adequacy coordinate, A.19.ECS can test whether that coordinate belongs inside E.9.DA, another evaluation, or no current FPF pattern.

Show, FPF Pillar adequacy. The evaluated object is FPF as a corpus or release candidate. E.2 gives the Pillars; E.2.DA is the evaluation. A.19.ECS explains why E.2.DA needs evaluated object, use, eligibility, coordinates, evidence loci, stop meanings, and neighbour governing relations rather than a Pillar essay.

Show, name improvement. The evaluated object is a durable term candidate. F.18 already supplies a grouped lexical quality vector: SemanticFidelity, CognitiveErgonomics, MorphologicalActionFit, and AliasRisk, plus NQD discipline over candidate names. A.19.ECS treats F.18 as an existing local evaluation for naming, not as a reason to build another one.

Show, no evaluation yet. A team says "make this onboarding method better" but cannot say better for whom, by what values, or with what stop. A.19.ECS opens before E.23: it names evaluated object kind, user, use, contrast cases, candidate characteristics, scales, floors, missingness, protected trade-offs, and neighbour governing relations. Only then can E.22 frame an improvement-oriented quality evaluation and E.23 improve the method.

Conformance checklist

CheckRequirementWhy
CC-A19ECS-1An evaluation characteristic-space specification SHALL name evaluated object kind, use scope, reader scope, and qualification window.Prevents context-free quality claims.
CC-A19ECS-2It SHALL include admissible, below-floor, and outside-declared-object-kind boundary contrast cases.Tests evaluated-object-kind discrimination.
CC-A19ECS-3Each coordinate SHALL bind one characteristic to one scale or state why it is an ordinal content evaluation rather than a measurement claim.Preserves A.17/A.18/C.16/A.19 discipline.
CC-A19ECS-4Each coordinate SHALL state value meanings, polarity or no-simple-direction value rule, evidence rule, and missingness rule.Makes values replayable.
CC-A19ECS-5The specification SHALL state floor, exceptional, status, stop, and reopen meanings for the declared use.Lets improvement stop locally without claiming final perfection.
CC-A19ECS-6Protected trade-offs SHALL be named when improving visible coordinates can harm another live value.Blocks Goodhart-style improvement.
CC-A19ECS-7The specification SHALL not average ordinal coordinates or turn undeclared coordinates into hidden pass, waiver, or failure.Preserves non-scalar comparison.
CC-A19ECS-8Wrong-kind objects SHALL return to evaluation selection before opening, or receive an explicit object-kind-fit defect/value when the evaluation has already been invoked.Keeps the declared coordinate table complete after invocation and prevents false low scores before the suitable evaluation is selected.
CC-A19ECS-9If made reusable beyond one local use, the evaluation characteristic-space specification SHALL make the minimum items in A.19.ECS:4.3 recoverable by value. If the selected publication form is an FPF pattern, E.8 also applies to that publication form.Prevents underspecified evaluations.
CC-A19ECS-10If the evaluation itself changes during improvement, the loop record SHALL name the changed evaluation version and the comparability effect on earlier object-version evaluations.Prevents silent value drift.
CC-A19ECS-11The evaluation characteristic-space specification SHALL state declarative governing-neighbour relations named by value for evidence, assurance, gate, work, decision, publication, naming, measurement, Q-Bundle, OEE/NQD, and mathematical-lens claims when those claims are being made. It SHALL NOT call neighbouring patterns receivers, owners, hosts, homes, routes, or exits, and SHALL NOT turn reference apparatus or architecture-placement reasoning into the coordinate Solution.Prevents an evaluation from becoming a second ontology or route catalogue.
CC-A19ECS-12A reusable evaluation characteristic-space specification SHALL state what would lower, reopen, or retire the evaluation: missing contrast case, changed use, changed source-use role or source-currentness status, hidden trade-off loss, or corrected neighbouring-pattern claim assignment.Makes high-value evaluation claims falsifiable instead of permanent praise.
CC-A19ECS-13A reusable evaluation characteristic-space specification SHALL define the result-row shape and require a short rationale for every coordinate value.Prevents prose impressions and two-column tables from being mistaken for evaluation results.
CC-A19ECS-14It SHALL define the evaluation evidence basis and any coordinate-specific evidence payload needed for source-currentness, comparator, corpus-projection, worked-case, retrieval, or external-currentness claims. Missing or unchecked evidence lowers the coordinate that needs it.Makes values replayable without creating an "inactive" or "not evaluated" escape route.
CC-A19ECS-15It SHALL publish calibration points for common adjacent-value disagreements whenever the evaluation is expected to be reused by different evaluators.Keeps 3, 4, and 5 from drifting into reviewer temperament.
CC-A19ECS-16It SHALL declare where result evidence, corpus-projection evidence, retrieval evidence, comparator evidence, currentness evidence, and quality-status evidence live. These payloads SHALL stay in the evaluation result, evidence basis, projection carrier, or selected publication carrier unless the evaluated object itself is that carrier. If the payload implies a user move for another evaluated object, publish that move or boundary, not the carrier proof. This is a role-based placement rule, not a lexical ban: evidence-role payloads do not enter live evaluated-object text merely because they are true or useful to developers, reviewers, or evaluators.Prevents evaluation evidence from leaking into the evaluated object's method or live text.
CC-A19ECS-17If construction or repair changes coordinate wording or evaluation wording, the specification SHALL require a pre/post kind-restoration check for evaluated object kind, characteristic kind, relation or claim kind, slot or use-position when live, admissible use, and scope, plus the governing pattern when another pattern governs the kind under repair, relation, claim, or position.Prevents coordinate cleanup from changing what the evaluation evaluates.

Common anti-patterns

Anti-patternSymptomRepair
Scale set from air.Coordinates appear because they are familiar.Rebuild from evaluated object kind, use, contrast cases, failure modes, domain tradition, first principles, and current source-use role.
Wrong-kind object forced through the table.Objects outside the declared kind are either scored as weak members of that kind or silently exempted from declared coordinates.Add an object-kind-fit rule and boundary cases: before opening, return to a suitable evaluation; after invocation, record an explicit object-kind-fit defect/value or repair status.
Checklist masquerading as characteristic space.A list of tasks is treated as coordinates.Convert each task row to an evaluated EntityOfConcern property with a characteristic, scale, value meaning, and evidence rule, or move it to work planning.
One total quality score.Several ordinal values are averaged.Use coordinates, statuses, dominance or comparison rule, and protected trade-offs; do not scalarize unless an neighboring pattern governing the claim explicitly declares the operation.
Improvement without floor.A loop continues because more change is possible.State floor, exceptional meaning, stop condition, and reopen condition.
Hidden value drift.The evaluation changes while old evaluations are compared as if nothing changed.Version the evaluation and state comparability, bridge, or retirement.
Evaluation theft.The new evaluation starts governing evidence, assurance, gate, work, decision, or publication truth.Return each claim to the neighboring pattern governing the claim and leave only the value evaluation here.
Result prose as evaluation.A reviewer returns a narrative, two-column table, checklist count, or value list without evidence basis and short rationales.Define the result-row shape, require short rationales and evidence basis, and lower any coordinate whose needed evidence is missing or unchecked.
Evidence basis as evaluated-object method.Corpus projection, retrieval, currentness, comparator, monolith-parity, quality-status evidence, or role-turn correspondence is written in the evaluated object as if it were what the evaluated-object user does.Move the evidence to the evaluation result, evidence basis, projection carrier, or selected publication carrier; keep only the user action or boundary that the evidence justifies.
Coordinate wording as ontology change.A coordinate or repair name sounds cleaner, but changes the evaluated object kind, characteristic kind, relation or claim kind, admissible use, or scope.Treat it as a changed evaluation decision, recover the pre/post kind relation, and repair or reopen the evaluation rather than accepting lexical cleanup.

Relations

PatternRelation
A.19Defines CharacteristicSpace. A.19.ECS gives the method for constructing one evaluation CharacteristicSpace for an evaluated object.
A.17, A.18, C.16Govern characteristics, scales, scale values, coordinates, measures, units, and measurement legality. A.19.ECS uses them by reference for each slot.
C.25Governs Q-Bundle normal form for composite engineering quality families. A.19.ECS may select or repair the characteristic-space part before a Q-Bundle endpoint is used.
E.22Frames one improvement-oriented quality-evaluation question after an evaluation is declared. A.19.ECS constructs the missing or inadequate evaluation.
E.23Governs repeated improvement after evaluated object version and evaluation are declared. A.19.ECS provides the evaluation when it is missing or underdesigned.
E.21Existing evaluation for one FPF pattern version. A.19.ECS explains the construction shape but does not replace E.21.
E.9.DAExisting evaluation for one DRR decision-adequacy claim. A.19.ECS does not replace it.
E.2.DAExisting evaluation for FPF-level Pillar adequacy. A.19.ECS explains why it must publish evaluated object, coordinates, values, evidence loci, status, and stop meanings.
F.18Existing naming discipline with a grouped lexical quality vector. Use F.18 for durable term and name improvement.
C.16.P, C.16.Q, E.10, A.6.P, C.2.PRepair overloaded characteristic/scale/score, quality, lexical, relation, and source-use wording before it becomes a coordinate or status value.
C.18, C.19, G.5, G.9, G.11Govern OEE/NQD novelty, diversity, archive, pool, selected-set, parity, and refresh semantics. An evaluation may supply Q values, but it does not govern the rest of OEE/NQD.
C.29Governs mathematical-lens use when a mathematical structure is used to define or justify coordinates.
A.10, B.3, A.20, A.21, A.15Govern evidence, assurance, local CV, gates, and work when an evaluation result is reused for those claims.

Consequences

A conforming A.19.ECS result lets E.22 ask a useful improvement-oriented quality-evaluation question and lets E.23 run a repeated improvement loop without inventing values during the loop. It also gives object-specific evaluation patterns such as E.21, E.9.DA, E.2.DA, and F.18 a common construction shape: evaluated object kind, use, contrast cases, coordinates, value meanings, evidence basis, result-row shape, calibration points, coordinate-specific payloads, protected trade-offs, status meanings, and local stop or reopen condition.

The cost is intentional. A reusable evaluation is heavier than a local checklist, because it must prevent wrong-kind use, hidden value drift, proxy-for-value substitution, neighbour theft, and false stop claims. When a local rubric is enough, keep the rubric local. When reuse is needed, carry the evaluation by value.

SoTA-Echoing

ClaimCurrent practice lineAdoption in A.19.ECSBoundary
Evaluation artifacts must declare intended use, object, criteria, and missingness before their values are useful.Current reporting anchors: BenchmarkCards/EvalCards practice for evaluation-card structure, model-card lineage for intended-use and performance-characteristic reporting, and HELM/VHELM/AHELM-style evaluation suites for scenario, metric, raw-result, and modality-extension transparency.A.19.ECS starts from evaluated object kind, use scope, contrast cases, coordinate meanings, evidence rule, and missingness rule.It is not a benchmark harness, automated judge, or publication format by itself.
Multicriteria evaluation needs preserved dimensions and protected trade-offs.Current QD overview: A survey on Quality-Diversity optimization: Approaches, applications, and challenges, Swarm and Evolutionary Computation 100:102240 (2026); retained design lineage: MCDA and value-focused thinking for criterion separation and trade-off visibility.The pattern requires coordinate values, polarity or no-simple-direction value rule, protected trade-offs, status meanings, and stop or reopen conditions.Scalarization belongs only to an neighboring pattern governing the claim or explicitly declared local method.
Improvement pressure can damage the intended value when the evaluation is a weak proxy.Current proxy-risk anchors: Goodhart's Law in Reinforcement Learning (ICLR 2024) and current catastrophic-Goodhart reward-misspecification work (NeurIPS 2024); retained lineage: Goodhart taxonomy.A.19.ECS requires evidence rules, missingness rules, protected trade-offs, and lowering/reopen conditions before a loop can treat a value as improved.It is not an anti-measurement rule; it makes the measurement or ordinal evaluation explicit enough to be challenged.
OEE/NQD separates the quality side from novelty, diversity, archive, pool, and selected-set semantics.Current QD and OEE/NQD neighbour basis: QD uses quality pressure with novelty/diversity and archive/front practice, while current FPF C.17, C.18, C.19, G.5, G.9, and G.11 keep archive, pool, selected-set, parity, and refresh semantics named by value.The evaluation may supply Q values, while novelty, diversity, archive, front, pool, selected-set publication, parity, and refresh remain with neighboring pattern governing the claims.A.19.ECS does not govern OEE/NQD generation, selection, archive, parity, or refresh.

Rationale

Improvement cannot be better than its evaluation. A loop that changes an object version without a declared characteristic space can only produce activity, persuasion, or reviewer preference. An evaluation that lists scales without evaluated-object-kind discrimination, floor, evidence, missingness, trade-offs, and stop meanings cannot guide improvement safely.

Placing this method under A.19 keeps the ontology clean. A.19 governs the structure of CharacteristicSpace; A.19.ECS governs the construction method for evaluations of declared EntityOfConcern kinds and uses. A.19.ECS governs the selected characteristics, scales, coordinate construction, and evaluation-use boundaries of the evaluation characteristic space, not its publication or record form. An FPF pattern is only one possible publication form when the evaluation belongs in FPF; a local rubric, standard, table, or project rule is enough when the use is local. E.23 stays a universal loop method because it does not need to know how every domain chooses its scales. Domain and FPF-specific evaluations such as E.21, E.9.DA, E.2.DA, and F.18 keep coordinate choices inside those evaluations.

A.19.ECS:End

State-Family Precision Restoration

Type: State-family precision-restoration pattern Status: Stable Normativity: Normative unless explicitly marked informative

Plain-name. State-wording repair.

Intent. Recover state, status, posture, readiness, and close state-family wording whose bearer, state frame, value set, admissible use, or receiving FPF pattern is hidden.

This pattern does not define a general Posture kind. It repairs wording that acts like a state-like claim before a reader treats the word as evidence, assurance, gate passage, release permission, source authority, maturity, or work completion.

Builds on. E.10, E.10.ARCH, A.19, A.3.3, C.2.2a, A.16.*, A.10, B.3, A.20, A.21, C.27, C.29, E.17, E.9.DA, E.21, F.18, and project-side administrative, review, dispatch, release or admission, or source-control records when the state-like claim is administrative rather than FPF-content-bearing.

Coordinates with. A.17, A.18, C.16, C.16.P, C.16.Q, A.6.P, C.2.P, C.30.P, E.8, E.19, and E.11.

E.10.ARCH governing-pattern relation. When E.10 encounters state-family wording such as state, status, posture, readiness, stance, currentness, validity, stable, ready, accepted, blocked, candidate, or close compounds whose bearer, state frame, value set, admissible use, validity window, reopen condition, or governing pattern is hidden, E.10.ARCH assigns the repair to A.19.SPR only until those values are recovered or the claim being made belongs to C.2.P, A.10, B.3, A.20, A.21, C.27, C.29, E.9.DA, E.21, A.6.P, A.15, or the project-side administrative, review, dispatch, release or admission, or source-control record.

Use this when

Use A.19.SPR when state-family wording has FPF-governed use but does not yet say what is in which state, according to which state frame or governing pattern, with which value or classification, for which admissible use.

Typical triggers:

  • state, status, posture, readiness, stance, currentness, validity, degraded, accepted, admissible, blocked, candidate, stable, ready, or close compounds;
  • local fields such as source posture, evidence posture, assurance posture, publication posture, release posture, validation posture, readiness posture, or support posture;
  • precision-looking local fields such as LensUseAdmissibilityValue, dynClaimPosture, or a specification-use label when their bearer, value set, governing pattern, use boundary, or reopen condition is not recoverable.

What goes wrong if missed. A broad state word becomes a miniature hidden ontology. A source gets called "current", "supporting", or "accepted" without a source-use role. Evidence becomes assurance. A publication face becomes gate passage. A lens-use label becomes empirical truth. An external administrative status leaks into pattern prose. A readiness word implies work may proceed without the threshold, evidence path, gate, or decision record that would carry that claim.

What this buys. The reader can recover the state-like claim named by value, the governing pattern, the allowed use, and the blocked adjacent overread before acting on the word.

First useful move. Ask: what bearer has which state-like value under which state frame or governing pattern? If that cannot be answered, demote the wording to ordinary prose, quote-only source wording, a reduced-use cue, or a blocker.

Not this pattern when.

  • If the pattern governing the recovered claim and state-like field are already recoverable by value, use that pattern directly.
  • If the wording is ordinary prose and carries no FPF-governed use, keep it ordinary.
  • If the state-like claim concerns one Characteristic, Scale, coordinate, score, or metric, use C.16.P before state-family repair.
  • If the state-like claim concerns source-expression, publication, carrier, or source-use wording, use C.2.P first; return to A.19.SPR only if a state-like claim remains.
  • If the claim being made is relation construction, architecture or structure wording, quality-term or evaluative characterization, function-like wording, or naming, use A.6.P, C.30.P, C.16.Q, A.6.F, or F.18 as selected by E.10.

Problem frame

FPF needs state-like wording. Engineers say that a system is ready, a source is current, an evidence path is incomplete, an assurance claim has decayed, a lens use is admissible, or a pattern is stable. Those compact words are useful when the state frame is declared.

The defect appears when the word substitutes for the frame. Posture is the current visible symptom, but the same failure appears with state, status, readiness, stance, currentness, and similar words. The repair question is:

What state-like predicate is being asserted over which bearer, under which FPF pattern, for which use, and with which blocked overread?

The state-like bearer under repair may be a holon in a CharacteristicSpace, a role-state assertion, a language-state position, a source-use relation, an evidence path, an assurance claim, a publication use, a gate or constraint record, a temporal claim, a mathematical-lens use, a DRR decision-adequacy result, a pattern-quality result, or a project-side administrative, review, dispatch, release or admission, or source-control record. Those are not one kind. They only share the need for a state-like predicate named by value.

Problem

How can FPF repair state-family wording without:

  • defining a general Posture kind;
  • replacing one broad word with another broad word such as basis, support, state, or status;
  • treating every state-like word as a CharacteristicSpace position;
  • treating publication, source, evidence, assurance, gate, decision, work, release or admission, and administrative states as one source, publication, or language-state case;
  • duplicating the state-family recovery algorithm inside every governing pattern;
  • demoting finite local fields such as LensUseAdmissibilityValue or dynClaimPosture when they are already well-formed, or erasing a real specification use or refinement gate that names its neighboring pattern governing the claim and value set.

Forces

ForceTension
Compact state words vs bearer named by valueWorking prose needs short state words, but FPF claims need the bearer named.
Local finite fields vs hidden ontologySome pattern-local state fields are useful; others hide source, evidence, assurance, gate, release or admission, or administrative claims.
A.19 state-space core vs many governing patternsA.19 gives CharacteristicSpace, but many state-like claims belong to evidence, assurance, publication, temporal, lens-use, or project-side administrative records.
Semio precision vs semio-biasSource or publication state wording may need semio repair, but not every state-like claim is a source, publication, or language-state case.
Cheap repair vs reusable disciplineMany cases need one local rewrite; recurring state-family failures need one reusable realization pattern.

Solution

Repair state-family wording by producing a StateFamilyPrecisionRepair or an equivalent local rewrite.

Minimum shape:

StateFamilyPrecisionRepair:
  triggerSpan:
  boundedTextSpan:
  bearerRef:
  stateFrameOrGoverningPatternRef:
  stateValueOrClassification:
  criteriaOrEvidenceRef?:
  admissibleUse:
  nonAdmissibleOverread:
  validityWindowOrReopenCondition?:
  finalWordingOrBlocker:
  remainingReaderMove:

Use the full shape only when the repair must remain inspectable. A direct rewrite is enough when one sentence names the bearer, state frame, value, use boundary, and governing pattern.

Recovery sequence

  1. Capture trigger and bounded text. Copy the encountered state-family word and the sentence, row, card, or field that uses it.
  2. Recover the bearer. Name the item whose state-like value is being claimed: holon, role, source, evidence path, assurance claim, publication face, PublicationUnit, gate record, temporal claim, lens-use card, DRR, pattern version, project-side administrative record, review record, dispatch record, release or admission record, source-control record, or another FPF kind named by value.
  3. Recover the state frame or governing pattern. Decide whether the frame is A.19 CharacteristicSpace, A.3.3 dynamics, role-state assertion, C.2.2a language-state chart, A.10 evidence path, B.3 assurance, A.20 constraint or adjudication state, A.21 gate decision, E.17 publication use, C.27 temporal-claim state, C.29 lens-use admissibility, E.9.DA DRR-decision adequacy, E.21 pattern quality, or a project-side administrative, review, dispatch, release or admission, or source-control record.
  4. Recover the value set or classification. If a local field remains, list its possible values or the neighboring pattern governing that claim that defines them. If no value set is recoverable, do not keep the state-family head as a field.
  5. Recover criteria or evidence only when that claim is being made. Name threshold rule, observation, source currentness, evidence path, assurance tuple, validation regime, gate record, or witness only when the governing pattern for that claim is selected.
  6. State admissible and non-admissible use. Say what the reader may do with this value and what adjacent claim remains blocked.
  7. State validity window or reopen condition. If currentness, readiness, release or admission, validation, assurance, or administrative state can decay, name what changes the value.
  8. Rewrite or demote. Replace broad wording with the state-like field or governing-pattern phrase named by value; otherwise mark quote-only, reduced-use cue, blocked transfer, or incomplete rewrite.
  9. Return to the subject pattern. Do not let the repair become the subject Solution unless the pattern is itself about state-family precision restoration.

Direct governing-pattern assignments

Recovered state-like claimFirst governing pattern or locus
position in a declared CharacteristicSpaceA.19, with A.17, A.18, C.16, and C.16.P when construction is hidden
reusable transition law, trajectory, or dynamics modelA.3.3
role-state assertion, role assignment, or enactable staterole-state pattern named by value and A.15 or work pattern governing the claim when work is being claimed
language-state position for episteme or publication wordingC.2.2a and A.16.* after C.2.P when source-publication recovery is needed
source use, source currentness, source publication, or source-use dispositionC.2.P, E.17, E.9.DA, or source-use field named by value
evidence path state, evidence relation, or reliance dispositionA.10
assurance result, assurance claim, assurance input, or engineering-justification useB.3
constraint, local CV, gate, or release readinessA.20, A.21, or release or gate pattern governing the claim
publication use, publication face, form, or unit value, source-finding useE.17, E.17.0, E.17.AUD, or publication pattern governing the claim
Description episteme admitted for specification use or specification refinementA.7, plus the specification-granting neighbouring pattern named by value: A.6.2, C.2.3, A.21, C.16, E.17, E.10, or another named pattern
temporal claim status or temporal-use classificationC.27, retaining dynClaimPosture only as a declared C.27 field
mathematical-lens use admissibilityC.29, retaining LensUseAdmissibilityValue only as a declared C.29 field
DRR decision-adequacy result or source-use classificationE.9.DA
pattern-quality result or pattern-quality review statusE.21, with E.19 only as review or admission profile
administrative, review, dispatch, release or admission, or source-control statethe project-side administrative, review, dispatch, release or admission, or source-control record; not pattern prose unless the pattern's own EntityOfConcern is that record

Retained local field rule

A local ...Posture, ...Status, ...Readiness, or ...State field is admissible only when the text declares:

  • field name;
  • bearer kind;
  • governing pattern;
  • value set or declared classification source;
  • admissible use;
  • non-admissible overread;
  • validity window, decay rule, or reopen condition when applicable.

If any of those are missing, either complete them now or rename the field to the phrase or record required by the governing pattern. A narrowing adjective does not count as kind recovery.

Worked slices

Show, source currentness. "The source posture is good" is not admissible. Repair to: "The source has SourceUseRole = acceptedDecisionSource and SourceCurrentnessStatus = localAcceptedDecision for this DRR use; it does not become evidence, assurance, gate passage, or FPF doctrine by citation."

Show, evidence path. "Evidence posture is incomplete" repairs to an A.10 result: evidence kind, claim and effect, carrier or source path, currentness window, RelianceDisposition, admissible reliance, blocked reliance, and reopen trigger.

Show, publication use. "Publication posture allows decision input" repairs to an E.17 publication use note plus the decision or evidence pattern governing the claim being made. The publication face may orient, expose a source, compare, or carry a candidate input; it does not decide or assure by itself.

Show, mathematical lens. LensUseAdmissibilityValue may stay in C.29 because it names a local finite field for a mathematical-lens use. The field still cannot mean evidence, assurance, release, benchmark superiority, or source authority.

Show, temporal claim. dynClaimPosture may stay in C.27 when its value set and non-overread boundary are present. The value says what kind of temporal claim use is being made; it does not upgrade evidence, authority, assurance, or promise claim.

Show, administrative state. "The release or admission record is ready for release action" belongs in the project-side release or admission, review, dispatch, administrative, or source-control record that carries that state. A pattern body may mention it only as an informative boundary; it must not use that external administrative state as pattern-subject guidance.

Conformance checklist

CheckRequirement
CC-A19SPR-1Every FPF-governed state-family word SHALL name a bearer or be demoted to ordinary prose, quote-only wording, reduced-use cue, or blocker.
CC-A19SPR-2Every retained state-family field SHALL name the state frame or governing pattern that defines its value.
CC-A19SPR-3Every retained state-family field SHALL have a value set, classification source, or neighboring-pattern result named by value.
CC-A19SPR-4The repair SHALL state admissible use and non-admissible overread.
CC-A19SPR-5Currentness, readiness, validation, assurance, release or admission, or administrative state claims SHALL state a validity window, decay rule, or reopen condition when the value can change.
CC-A19SPR-6Source, evidence, assurance, publication, gate, work, decision, release or admission, and administrative uses SHALL be assigned to patterns governing the recovered claims or project-side records rather than hidden under state-family wording.
CC-A19SPR-7Semio patterns govern only language-state and source or publication cases. They SHALL NOT become the general home for evidence, assurance, gate, work, temporal, mathematical-lens, or administrative states.
CC-A19SPR-8Local fields named by value, such as LensUseAdmissibilityValue and dynClaimPosture, may stay only with declared governing pattern, value set, boundary, and reopen condition; specification wording SHALL recover a Description episteme admitted for specification use or refinement plus the specification-granting neighbouring pattern named by value.
CC-A19SPR-9The repair SHALL preserve one remaining reader move. Type-correct but inert wording is incomplete.
CC-A19SPR-10Whole-corpus cleanup SHALL be classified. Blind global replacement of posture, state, status, or readiness is nonconforming.

Common anti-patterns

Anti-patternSymptomRepair
Posture as cover.A sentence uses posture to avoid saying source relation, evidence path, assurance result, gate decision, or release state.Recover the bearer and governing pattern; rewrite to the FPF field or block named by value.
Support-to-state laundering.Old support wording becomes support posture, basis posture, or source posture.Apply A.6.P, A.6.6, C.2.P, A.10, B.3, C.16.P, C.29, or the pattern governing the recovered claim.
Finite field without value set.A ...Status or ...Posture field appears with no values or non-overread boundary.Complete the field or replace it with the phrase or record required by the governing pattern.
External administrative state in pattern prose.A project-side administrative, review, dispatch, release or admission, or source-control state appears as if it were user-facing pattern guidance.Move the state claim to the project-side record; keep only an informative boundary if useful.
Semio sink.Every state-like word is sent to source-publication or language-state repair.Use semio only for source, publication, or language-state cases; assign evidence, assurance, gate, work, temporal, lens-use, and administrative cases to governing patterns or project-side records.

Relations

PatternRelation
E.10Catches state-family trigger wording and selects local repair, A.19.SPR, direct governing-pattern assignment, controlled precision reduction, F.18, or fail-closed non-use.
E.10.ARCHProvides the shared wording-use restoration architecture. A.19.SPR is the realization pattern for recurring state-family hidden-field cases.
A.19Governs CharacteristicSpace and state-space typing. A.19.SPR uses A.19 only when the state-like claim is a characteristic-space position or comparable state.
A.3.3Governs dynamics and state-transition laws when reusable change semantics are being claimed.
C.2.P, C.2.2a, A.16.*, E.17Govern source-use and publication-use assignments, language-state positions, and admissible moves.
A.10Governs evidence path state and reliance disposition.
B.3Governs assurance result, assurance claim, and assurance-input use.
A.20, A.21Govern constraint or adjudication state and gate decisions.
C.27Governs temporal-claim state and retains dynClaimPosture when declared.
C.29Governs mathematical-lens use and retains LensUseAdmissibilityValue when declared.
E.9.DA, E.21, E.19Govern DRR adequacy status, pattern-quality status, and pattern review or admission profiles.
F.18Governs durable naming when a state-family field becomes reusable vocabulary.
E.11Places practical entry questions for hidden state-family wording in README scenarios, ToC query cues, local Problem frames, or expanded I.2 entry-disambiguation cases instead of a duplicate index row.

Rationale

The repeated problem is not a bad word. The repeated problem is an untyped state-like claim. FPF needs finite state-like fields, but each field must be over a bearer and a state frame. Placing this pattern under the A.19 neighborhood keeps the general repair near state-space and state-comparability discipline without making semio the home for every status word and without turning E.10 into an omnibus ontology.

The pattern also protects local fields named by value. LensUseAdmissibilityValue and dynClaimPosture are acceptable when their governing patterns declare value sets and boundaries. Specification wording is acceptable only as a Description episteme admitted for specification use or refinement under a specification-granting neighbouring pattern named by value; it is not a reusable posture field. Broad source posture, evidence posture, assurance posture, publication posture, release posture, and administrative forms are not acceptable unless they are repaired into FPF kinds named by value or moved to the project-side administrative, review, dispatch, release or admission, or source-control record that actually governs them.

A.19.SPR:End

A.19.SOURCE-SET-SPACE-SUBSTRATE - Source-Set and Search/Outcome-Space Substrate

Type: Architectural (A) Status: Stable Normativity: Normative

Plain-name. Source-set / search-outcome-space substrate.

Declared relation-and-ref-position stack. The declared relation-and-ref-position stack that links one recoverable source set to search-side and outcome-side references over A.19 CharacteristicSpace, states how those two refs relate, and makes the source-to-outcome relation plus its distortion, uncertainty, or error posture explicit enough to guide use.

A.19.SOURCE-SET-SPACE-SUBSTRATE:0 - Use this when

Use this pattern when one working line depends on all of the following at once:

  • one declared source set still matters and must stay recoverable by name;
  • one search-side space reference and one outcome-side space reference must both be explicit;
  • the line must say whether those refs resolve to one declared CharacteristicSpace or to two distinct declared CharacteristicSpace declarations;
  • the source-to-outcome relation is load-bearing enough that the reader must know what is being related, in which direction, and through which declared carrier, declared map ref, or qualifier ref;
  • and distortion, uncertainty, or error cannot be left as vague atmosphere.

This is the right pattern for QD, OEE, archive/front, or adjacent synthesis lines when the problem is no longer only "what space exists?" and not yet "what shortlist or shipped result do we publish?".

Not this pattern when:

  • you only need to declare or compare CharacteristicSpace itself, with no source-set or source-to-outcome requirement; use A.19;
  • you are publishing selector or shipping metadata such as SelectorOutcomeKind, SetResultFamily, HandoffKind, or public shortlist identity; use G.5 or G.10;
  • you are building one interpretive view over an already-declared substrate; use A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW or a local specialization such as G.2;
  • you are deciding live pool policy, frontier retention, or next-move planning; use C.19 or C.24.

A.19.SOURCE-SET-SPACE-SUBSTRATE:0.1 - What goes wrong if missed

If this pattern is missed, authors usually collapse several different things into one vague "space" or one vague "projection":

  • the declared source set disappears behind bare words such as front, archive, palette, or portfolio;
  • SearchSpaceRef and OutcomeSpaceRef never become explicit, or SpaceRefRelationKind never becomes explicit, so one line silently hides whether search and outcome use one declared space twice or two different declared spaces;
  • DescriptorMapRef or DistanceDefRef gets mistaken for the space itself rather than one representation or metric qualifier;
  • publication metadata in G.5 or G.10 starts standing in for substrate semantics;
  • and distortion, uncertainty, or error is either hidden or treated as if every non-trivial case were only one bridge-loss story.

The result looks tidy, but the reader cannot tell what is being searched, what is being evaluated, what is only being published, and where uncertainty actually enters.

A.19.SOURCE-SET-SPACE-SUBSTRATE:0.2 - What this buys

This pattern buys one conservative but expressive substrate declaration:

  • the active source set stays visible;
  • the search-side and outcome-side references over A.19 spaces stay distinct;
  • the relation between those refs becomes inspectable instead of being hidden in one overloaded noun or verb;
  • heavier qualifier refs remain available without being forced into every case;
  • and interpretive-view or publication neighbors can reuse the substrate without changing what it means.

The practical payoff is simple: readers can tell what the line is acting on, what relation between the two space refs it assumes, what kind of qualification they must keep in view, and which neighboring pattern governs the next move if that requirement grows.

A.19.SOURCE-SET-SPACE-SUBSTRATE:0.a - TERM/LEX token-status guard (local-first)

Keep this token-status split explicit:

  • CharacteristicSpace is the reused A.19 kind. This pattern does not mint a second space kind.
  • SearchSpaceRef and OutcomeSpaceRef are role-named local fields whose slot content is typed by the existing CharacteristicSpaceRef / SpaceRef idiom. They are not new heads, not slot aliases inside the space, and not U.Role claims. In source-set/space-substrate or typed-set-view passages, read them as role-specific refinements of that older SpaceRef idiom rather than collapsing the roles back into one umbrella SpaceRef.
  • SpaceRefRelationKind is a local relation-kind field over those two refs. In this slice, sameDeclaredSpaceAs and distinctDeclaredSpaceFrom are controlled token values for that field, not free prose.
  • SourceToOutcomeRelation and DistortionPosture are local declaration fields. Their field names do not by themselves create one new generic ontology; the declaration requirement is satisfied only when their payload is explicit enough to audit.
  • SourceSetFamily, SourceSetComposition, and DerivedViewKind are local fields in this SourceSetSpaceSubstrate declaration. Whether any value later becomes a broader stable head is outside this pattern.
  • BasePaletteRef, OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, BridgeDistortionNote, DescriptorMapRef, and DistanceDefRef are guarded neighboring refs or interpretive qualifiers reused here. This pattern may cite them, but it does not redefine them.
  • carrier inside SourceToOutcomeRelation names the declared line, declared object, or neighboring declared map ref / qualifier ref through which the relation is being realized in this local record. It is not a claim that the thing is U.Carrier.

A.19.SOURCE-SET-SPACE-SUBSTRATE:0.b - First-minute operator cue and confusion guide

If you are about to write one line that says what is being searched, what is being judged, and whether those two relations sit in one declared space or in two declared spaces, stop and fill this pattern before you write any more umbrella prose such as space, projection, portfolio, or front.

Do this in the first minute:

  1. Name the active source set.
  2. Point SearchSpaceRef and OutcomeSpaceRef to declared CharacteristicSpace.
  3. Choose sameDeclaredSpaceAs or distinctDeclaredSpaceFrom.
  4. State the source-to-outcome relation in direction, mode, and carrier.
  5. State the governing posture token.

If one of those five cells cannot yet be filled honestly, do not improvise around it. Either you are still in A.19, or you have really moved into interpretive-view work, publication, or policy, or the current line is still missing one declared basis.

If the question under repair sounds like...Use nowWhy
"Which space are we searching in and which space are we judging in?"A.19.SOURCE-SET-SPACE-SUBSTRATEThis pattern governs the dual-ref substrate stack.
"How should I help the reader inspect that already-declared line?"A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEWThat is one interpretive reading over the substrate, not the substrate declaration itself.
"What do we publish, ship, keep live, or plan next?"G.5, G.10, C.19, or C.24Those are downstream output or policy questions.
"I only need one space declaration."A.19No source-to-outcome substrate stack is in play yet.

Common confusion to kill early: DescriptorMapRef, distance definitions, and OutcomeMapRef values may discipline the line, but they do not answer the first-minute substrate question unless the five cells above are already filled.

A.19.SOURCE-SET-SPACE-SUBSTRATE:1 - Problem frame

In many search, synthesis, and source-set/space-substrate lines, the live substrate-bearing line is not just one CharacteristicSpace and not just one published shortlist or archive either. The line actually depends on a stack such as:

  • one declared source set, for example one front, archive, palette, or another declared source-set family;
  • one search-side reference to an A.19 CharacteristicSpace;
  • one outcome-side reference to an A.19 CharacteristicSpace;
  • one explicit SpaceRefRelationKind over those two references, stating whether they resolve to the same declared space or to two different declared spaces;
  • one relation from the source-side line into the outcome-side line;
  • and one declared posture about whether that relation is transparent, approximate, learned, lossy, uncertain, or otherwise qualified.

Without an explicit substrate declaration for that stack, nearby declarations start carrying loads they are not meant to carry. A.19 gets stretched from space typing into source-set governance. C.18 descriptor maps start masquerading as the whole search space. G.5 and G.10 publication fields start reading like ontology. Interpretive views or atlas views drift into default meaning instead of staying optional derived help.

A.19.SOURCE-SET-SPACE-SUBSTRATE:2 - Problem

How should one declare a source-set and search/outcome-space line so that:

  1. the declared source set remains explicit and recoverable;
  2. SearchSpaceRef and OutcomeSpaceRef stay guarded refs to declared A.19 CharacteristicSpace, not new free-floating space kinds;
  3. the text states whether those refs point to one declared space or to two distinct declared spaces;
  4. the source-to-outcome relation is explicit enough for the reader to know which source-to-outcome relation mode is being claimed: mapped, projected, translated, scored, or otherwise connected;
  5. distortion, uncertainty, and error are stated honestly rather than hidden in prose;
  6. SourceSetComposition and DerivedViewKind remain conditional fields rather than fabricated mandatory baggage;
  7. qualifier refs such as OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, and BridgeDistortionNote remain available but substrate-side only;
  8. and neighboring declarations such as A.19, C.18, G.5, G.10, and A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW can dock to the substrate without redefining it?

A.19.SOURCE-SET-SPACE-SUBSTRATE:3 - Forces

ForceTension
A.19 typing vs adjacent substrate requirementA.19 already declares CharacteristicSpace, but source-set and publication-form semantics still need a separate substrate declaration.
Precision vs over-typingThe line needs explicit ref positions, an explicit ref-to-ref relation kind, and explicit relation posture, but it should not fabricate composition, derivation, metrics, or transition qualifier when the case does not need them.
Reuse vs semantic collapseDescriptorMapRef, DistanceDefRef, OutcomeMapRef, or BridgeDistortionNote are useful qualifiers, but they must not silently become the whole substrate.
User readability vs architectural honestyCold readers need a first-minute explanation, while specialist readers still need exact boundaries and docking rules.
Interpretive views vs substrate coreAtlas or interpretive-view lines can be valuable, but they should remain optional derived help rather than the default meaning of the substrate.
Uncertainty honesty vs fake closureMany current lines use learned, adaptive, unstructured, or distribution-valued spaces or relations; the pattern must expose that posture without pretending the heaviest qualification posture is already settled.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4 - Solution

Declare the source-set or search/outcome-space line through one explicit substrate stack, keep only the load-bearing core mandatory, and place every heavier requirement in conditional fields, interpretive qualifiers, or companion declarations.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.1 - Declared relation-and-ref-position stack and outside work

Use this pattern to declare only the substrate stack below:

  • the declared source set that the line is acting on;
  • the recoverable concrete source-set identity when the family name alone would be ambiguous;
  • the search-side reference to one declared A.19 CharacteristicSpace;
  • the outcome-side reference to one declared A.19 CharacteristicSpace;
  • the explicit SpaceRefRelationKind over those two ref positions;
  • the explicit source-to-outcome relation;
  • and the explicit distortion, uncertainty, or error posture for that relation.

Do not use this pattern to declare:

  • A.19 space typing itself;
  • selector outcome publication, shortlist identity, or shipping closure;
  • live pool policy or enactment planning;
  • or optional interpretive-view families that interpret or reorganize an already-declared substrate.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.2 - Minimal declaration stack

Use the following notation-independent stack:

SourceSetSpaceSubstrate := <
  SourceSetFamily,
  SourceSetRef?,
  SearchSpaceRef,
  OutcomeSpaceRef,
  SpaceRefRelationKind,
  SourceToOutcomeRelation,
  DistortionPosture,
  SourceSetComposition?,
  DerivedViewKind?,
  BasePaletteRef?,
  OutcomeMapRef?,
  SpaceMetricRef?,
  TransitionRelationRef?,
  BridgeDistortionNote?
>

Interpret the fields as follows:

  • SourceSetFamily names the primary declared source-set family that the line is anchored on.
  • SourceSetRef? names the concrete declared source set or declared set result when several same-family source sets or set results are live or when one neighboring governing pattern must be cited to keep that identity unique. It may be omitted only when the concrete source set is unambiguous from the declared line.
  • SearchSpaceRef points to one declared [A.19](/generated/patterns/A.19) CharacteristicSpace in the search-side position.
  • OutcomeSpaceRef points to one declared [A.19](/generated/patterns/A.19) CharacteristicSpace in the outcome-side position.
  • SpaceRefRelationKind states how those two refs relate. In ordinary use, the token is either sameDeclaredSpaceAs or distinctDeclaredSpaceFrom.
  • SourceToOutcomeRelation is one controlled declaration slot. State at least direction, mode, and carrier.
  • DistortionPosture is one controlled declaration slot with one primary posture token plus optional clarifying note. In this slice, lawful posture tokens include transparent-for-current-use, lossy-bridge, metric/model-dependent, transition-dependent, uncertainty-bearing, learned/adaptive, and unstable-under-refresh.
  • SourceSetComposition, DerivedViewKind, and related ...Kind values remain declaration fields or controlled field values unless some governing pattern explicitly promotes them; they are not automatically independent heads merely because their names end with Kind.

This is an [A.6.5](/generated/patterns/A.6.5) / [A.6.P](/generated/patterns/A.6.P) move: SearchSpaceRef and OutcomeSpaceRef are ref-typed slot contents, while SpaceRefRelationKind is the explicit RelationKind token that governs how those two ref positions are read together.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.3 - Substrate declaration laws (SS-0..SS-7)

SS-0 - One substrate line, one explicit stack. Treat a line as declared substrate only if one recoverable source-set basis, two recoverable space refs, one explicit ref-to-ref relation kind, one explicit source-to-outcome relation, and one explicit posture are present together.

SS-1 - Ref typing is preserved. SearchSpaceRef and OutcomeSpaceRef must resolve to declared A.19 CharacteristicSpace. They do not become parallel space kinds, slot aliases, or role claims.

SS-2 - Source-set recoverability is mandatory. The reader must be able to recover not only the source-set family but, when several same-family source sets or set results are simultaneously live, the concrete declared source set or set result through SourceSetRef? or one cited neighboring governing pattern that uniquely identifies it.

SS-3 - Relation requirement must be explicit. SourceToOutcomeRelation is conforming only when direction, mode, and carrier are explicit enough to tell what is related to what, through which carrier/relation mode, and through which declared interpretive qualifier.

SS-4 - Posture honesty is mandatory. DistortionPosture must say whether the line is transparent for current use or qualified by loss, metric/model dependence, transition dependence, uncertainty, learning/adaptation, or instability under refresh. The line may not hide qualification in atmospheric prose.

SS-5 - Conditional and qualifier fields stay subordinate. SourceSetComposition, DerivedViewKind, BasePaletteRef, OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, and BridgeDistortionNote may clarify the substrate, but they do not replace the core stack and do not become mandatory everywhere.

SS-6 - Publication and policy stay outside. Publication metadata, shortlist identity, live-pool policy, and enactment policy remain neighboring decisions. A substrate line may feed them, but it does not decide them.

SS-7 - Admission is fail-closed. If the source set cannot be recovered, either space ref is unresolved, SpaceRefRelationKind cannot be chosen honestly, relation direction, mode, or carrier remains vague, or posture remains unclassified, then the line is not yet a declared substrate. Keep it as a working gloss or move it to the governing pattern that can close the missing requirement.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.4 - Profiles

Use one of these ordinary profiles:

  • Shared-space profile. SearchSpaceRef and OutcomeSpaceRef both resolve to the same declared CharacteristicSpace, and SpaceRefRelationKind = sameDeclaredSpaceAs.
  • Cross-space profile. SearchSpaceRef and OutcomeSpaceRef resolve to two distinct declared CharacteristicSpace declarations, and SpaceRefRelationKind = distinctDeclaredSpaceFrom.
  • Derived-source supplement. If the visible source set is one derived tradition, front, or palette view, keep DerivedViewKind and BasePaletteRef explicit so the derived view does not silently become the default meaning of the base palette or source set.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.5 - Operational declaration sequence (fail-closed)

When declaring one substrate-bearing line, proceed in this order:

  1. Entry test. Confirm that the line really needs source-set plus search/outcome-space plus relation/posture discipline. If it only needs CharacteristicSpace typing, use A.19. If it only needs publication or policy, apply the governing pattern that carries that publication or policy question.
  2. Recover the active source set. State SourceSetFamily. If several same-family source sets or set results are simultaneously live, fill SourceSetRef? or cite the neighboring governing pattern that makes that identity unique.
  3. Recover the space refs. Point SearchSpaceRef and OutcomeSpaceRef to already-declared CharacteristicSpace.
  4. Choose the ref-to-ref relation kind. Declare sameDeclaredSpaceAs only when both refs truly resolve to one declared space. Declare distinctDeclaredSpaceFrom only when they truly resolve to two distinct declared spaces. Do not leave this to reader inference.
  5. State the source-to-outcome relation. Give direction, mode, and carrier explicitly. If one named OutcomeMapRef or another declared interpretive qualifier carries the relation, cite that qualifier explicitly. If not, state the carrier directly in prose.
  6. State the posture. Declare whether the line is transparent for current use or qualified by loss, metric/model dependence, transition dependence, uncertainty, learning/adaptation, or instability under refresh.
  7. Add only the fields that are really doing work. Add composition, derived-view, base-palette, metric, transition, or bridge qualifiers only when the current case actually depends on them.
  8. Run the boundary check. If the line starts deciding publication metadata, shortlist identity, live candidate policy, enactment policy, or interpretive-view organization, stop and apply the pattern that governs that question.

Fail-closed rule. Do not treat the line as declared substrate if any of steps 1-5 remains unresolved. Incomplete recovery is a real defect here, not one stylistic omission.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.6 - Canonical rewrite forms

When the line is ready, it should be possible to rewrite it into one of these minimal forms.

Shared-space form

SourceSetFamily      = ...
SourceSetRef?       = ...
SearchSpaceRef         = DeclaredCharacteristicSpace@...
OutcomeSpaceRef        = DeclaredCharacteristicSpace@...
SpaceRefRelationKind   = sameDeclaredSpaceAs
SourceToOutcomeRelation= <direction, mode, carrier>
DistortionPosture      = <posture token; optional note>

Cross-space form

SourceSetFamily      = ...
SourceSetRef?       = ...
SearchSpaceRef         = SearchCharacteristicSpace@...
OutcomeSpaceRef        = OutcomeCharacteristicSpace@...
SpaceRefRelationKind   = distinctDeclaredSpaceFrom
SourceToOutcomeRelation= <direction, mode, carrier>
DistortionPosture      = <posture token; optional note>

If neither rewrite form can be completed honestly, the line is not yet publishable as substrate-bearing text.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.7 - Conditional fields stay conditional

Use SourceSetComposition only when the line genuinely consumes several declared source sets.

When composition is active:

  • SourceSetFamily still names the primary family the line is anchored on;
  • SourceSetComposition names the additional declared source-set families or the explicit composed-source posture that widens that primary family;
  • the composition field does not replace the primary family, and it does not silently retitle the whole line as one different source kind.

Use DerivedViewKind only when one derived view is materially active and the reader must be able to recover that derivation.

Use BasePaletteRef only when a derived tradition or palette view would otherwise hide the recoverable base palette.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.8 - Qualifier refs stay substrate-side

OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, and BridgeDistortionNote are admitted as substrate-side qualifier refs.

Use them when:

  • one OutcomeMapRef or named declared map ref really disciplines the source-to-outcome relation;
  • one metric really disciplines spread, neighborhood, or comparison claims;
  • one TransitionRelationRef really disciplines dynamic coupling or transfer;
  • or one bridge-loss note is the relevant reason the relation is qualified.

Do not make those interpretive qualifiers the semantic center of the substrate. They help explain the relation; they do not replace the line made explicit by SourceSetFamily, SourceSetRef?, SearchSpaceRef, OutcomeSpaceRef, and the declared relation/posture pair.

Qualifier semantics are first declared on the substrate side. Later interpretive views may reuse those qualifiers, but they do not become the place where the qualifier is first invented or materially changed.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.9 - Descriptor maps and distance definitions dock here, but do not replace the space refs

When a neighboring line already uses DescriptorMapRef or DistanceDefRef, dock it explicitly:

  • DescriptorMapRef may realize or qualify the search-side or outcome-side representation requirement, as the current line requires;
  • DistanceDefRef may realize or qualify the metric requirement over that representation on either side, as the current line requires;
  • but neither one replaces SearchSpaceRef or OutcomeSpaceRef;
  • and CharacteristicSpace remains a different kind from DescriptorMap.

Use this docking rule whenever a reader could otherwise mistake one local representation layer for the whole search-side or outcome-side space reference.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.10 - Publication and shipping remain downstream consumers

G.5 and G.10 may carry metadata such as SelectorOutcomeKind, SetResultFamily, SourceSetFamily, SourceSetComposition, DerivedViewKind, and BasePaletteRef when one selected or shipped result is being published.

That does not mean G.5 or G.10 defines the substrate.

Read the boundary this way:

  • this pattern defines the substrate that later publication must preserve;
  • G.5 publishes selector-facing outcome metadata;
  • G.10 ships publication metadata and pins;
  • neither one redefines the search-side reference, the outcome-side reference, or the source-to-outcome relation.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.11 - Ordinary and heavier use

For ordinary use, one short declaration block is enough:

  • one SourceSetFamily;
  • SourceSetRef? when family-level naming alone would be ambiguous;
  • one SearchSpaceRef;
  • one OutcomeSpaceRef;
  • one explicit SpaceRefRelationKind;
  • one explicit relation line;
  • one explicit posture line.

Use the heavier stack only when one of these is true:

  • several declared source sets are genuinely composed;
  • one derived view must stay recoverable;
  • one interpretive qualifier is materially active;
  • one descriptor-map or distance-definition docking clause is needed to prevent collapse;
  • or the reader would otherwise mistake publication metadata for substrate semantics.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.12 - Operator kit: choose, declare, self-check, apply governing neighbor

Use this compact kit whenever the task is practical declaration rather than one more explanatory paragraph.

Decision pointWhat to do nowAdmissible resultStop or apply another pattern when...
1. What is the line acting on?Name SourceSetFamily, and when several same-family source sets or set results are live also make the concrete source set recoverable.The reader can tell which source set or set result the line is about.The source set still floats behind one vague family word.
2. Are search and outcome in one declared space or in two?Point SearchSpaceRef and OutcomeSpaceRef to declared CharacteristicSpace, then choose sameDeclaredSpaceAs or distinctDeclaredSpaceFrom.The space-role split is explicit.The same-space versus cross-space question is still being guessed from context.
3. What relation is actually being claimed?Write one explicit SourceToOutcomeRelation with direction, mode, and carrier.The reader can inspect what is related to what, through which carrier and relation mode.You are still leaning on one umbrella word such as projection, portfolio, or maps into.
4. What qualification is honest?Choose the governing DistortionPosture token and add one note only when it really sharpens the case.The line is honest about loss, uncertainty, learning/adaptation, or other qualification.Qualification remains atmospheric prose or one fake default of transparency.
5. Which heavier qualifiers are truly active?Add only the qualifier fields that the current case actually uses.Qualifiers stay subordinate to the substrate.The next question is really interpretive-view work, publication, or policy.

Use this minimal worksheet when drafting or repairing one substrate line:

SourceSetFamily       = ...
SourceSetRef?        = ...
SearchSpaceRef          = ...
OutcomeSpaceRef         = ...
SpaceRefRelationKind    = sameDeclaredSpaceAs | distinctDeclaredSpaceFrom
SourceToOutcomeRelation = <direction, mode, carrier>
DistortionPosture       = <token; optional note>
Optional qualifiers       = <only those actually active>

Run this self-check before you leave the line:

  • if the worksheet cannot be filled without one hidden assumption, the declaration is not ready yet;
  • if the next needed prose is mainly "how should the reader inspect this substrate?", continue in A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW;
  • if the next needed prose is "what gets published, shipped, retained, or enacted?", apply [G.5](/generated/patterns/G.5), [G.10](/generated/patterns/G.10), [C.19](/generated/patterns/C.19), or [C.24](/generated/patterns/C.24);
  • if the current line changes because one neighbor wants different naming, glossing, or repair vocabulary, keep the substrate declaration here and let [F.18](/generated/patterns/F.18), [A.0](/generated/patterns/A.0), or [A.6.P](/generated/patterns/A.6.P) handle that neighboring requirement explicitly.

A.19.SOURCE-SET-SPACE-SUBSTRATE:4.13 - Using the substrate with neighboring patterns

Once one substrate line is declared, use neighboring patterns in this order:

  • Use A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW when the next requirement is interpretive help over the same substrate. The interpretive view may foreground the line, but it does not become the ontology.
  • Use G.2 when that interpretation becomes palette-first, tradition-facing atlas work. Keep the base palette and the cited substrate recoverable while doing it.
  • Use A.6.P when one passage collapses source set, space ref, interpretive view, atlas view, or map/ref wording into one umbrella word. Repair the wording back to the substrate declaration before adding more theory.
  • Use F.18 when the problem is label choice or naming-side comparison around this stack. Naming notes may explain why one head is better named; they do not settle the substrate relation.
  • Use A.0 when the task is cold-reader glossing of these tokens. Glosses help recognition; they do not replace the declaration block.

If a neighboring passage would change the source-to-outcome relation or the distortion posture, reopen this pattern first. Neighboring text may reuse the substrate, but it may not silently rewrite it.

A.19.SOURCE-SET-SPACE-SUBSTRATE:5 - Archetypal Grounding

A.19.SOURCE-SET-SPACE-SUBSTRATE:5.1 - System

Tell. One QD line keeps saying that one archive is both the search-side role and the evaluation basis. Downstream readers need to see that the same declared CharacteristicSpace can still occupy two different role positions without turning the archive or the descriptor layer into the space itself.

Show.

SourceSetFamily       = Archive
SearchSpaceRef          = BehaviorCharacteristicSpace@ed=12
OutcomeSpaceRef         = BehaviorCharacteristicSpace@ed=12
SpaceRefRelationKind    = sameDeclaredSpaceAs
SourceToOutcomeRelation = archive-retained candidates are navigated and judged
                          for local coverage gain in the same declared behavior
                          space
DistortionPosture       = metric/model-dependent; descriptor realization and
                          neighborhood metric qualifier are active
DescriptorMapRef        = QDDescriptorMap@ed=9
DistanceDefRef          = ArchiveNeighborhoodDistance@ed=4
SpaceMetricRef          = ArchiveNeighborhoodMetric@ed=4

Cash-out. This line now says three distinct things cleanly: the active source set is one archive, both role-refs resolve to the same declared CharacteristicSpace, and the DescriptorMapRef plus DistanceDefRef are only interpretive layers over that shared space reference. A downstream selection or archive-maintenance discussion can reuse this line without pretending the archive itself is the space.

A.19.SOURCE-SET-SPACE-SUBSTRATE:5.2 - Episteme

Tell. One synthesis line presents one derived tradition front and then starts speaking as if the visible front were the default meaning of the whole palette.

Show.

SourceSetFamily       = Front
DerivedViewKind         = TraditionFront
BasePaletteRef          = SoTAPaletteDescriptionId
SearchSpaceRef          = TraditionComparisonSpace@ed=3
OutcomeSpaceRef         = AdoptionOutcomeSpace@ed=2
SpaceRefRelationKind    = distinctDeclaredSpaceFrom
SourceToOutcomeRelation = the visible tradition front is one derived reading
                          over the base palette and is compared against the
                          declared adoption outcome space through one explicit
                          cross-tradition outcome-bearing line
DistortionPosture       = lossy-bridge; derived-view selection and bridge-loss
                          notes must stay visible
BridgeDistortionNote    = CrossTraditionComparisonLossNote@ed=1

Cash-out. The visible front stays a derived view over the palette, the base palette stays recoverable, and the outcome-side evaluation line stays explicit. A later interpretive view or atlas view may reorganize this story, but it may not silently change the declared source-to-outcome relation or erase the bridge-loss warning.

A.19.SOURCE-SET-SPACE-SUBSTRATE:5.3 - Boundary anti-case

Tell. One note says only that "the shortlist front is the published result for the current selector result" and names no source-to-outcome relation, no search-side space, no outcome-side space, and no posture.

Show. This is not a substrate declaration. It is publication metadata over one already-selected set.

Cash-out. Apply G.5 or G.10 to that note. Do not pad it with pseudo-substrate words just to make it look deeper than it is.

A.19.SOURCE-SET-SPACE-SUBSTRATE:5.4 - Use-situation spread

Use the pattern this way across different working situations:

Working situationWhat to do with this patternWhat must stay explicitCommon miss avoided
Archive-side QD line where navigation and evaluation stay in one declared behavior spaceUse the shared-space profile. Fill the six core fields, then add descriptor/metric qualifier only if active.Archive as source set, both role-refs, sameDeclaredSpaceAs, and the active posture.Treating the archive or descriptor layer as if it were the space itself.
Derived tradition/front line that is judged against one different outcome spaceUse the cross-space profile and keep DerivedViewKind plus BasePaletteRef visible.The derived view stays derived, the base palette stays recoverable, and the cross-space relation stays explicit.Letting the visible front replace the base palette or hiding the bridge-loss posture.
Learned, adaptive, or uncertainty-bearing line where the space declaration is real but heavier qualification is still case-boundKeep the substrate core explicit and choose the honest posture token such as uncertainty-bearing, learned/adaptive, or unstable-under-refresh.The reader can see that the substrate is real without being promised fake geometric closure.Pretending every serious case is either fully transparent or fully described by one metric stack.
Shortlist or publication note that only says what set result or publication form is shown or shippedDo not use this pattern. Apply G.5 or G.10 directly.The note stays publication-facing instead of imitating substrate depth.Padding publication metadata with pseudo-substrate language.

A.19.SOURCE-SET-SPACE-SUBSTRATE:6 - Bias-Annotation

  • Gov bias. The pattern prefers explicit declaration over convenient shorthand.
  • Arch bias. The pattern keeps substrate, interpretive view, and publication consumers separated even when one merged story would read more smoothly.
  • Prag bias. The pattern prefers a short explicit substrate declaration that can be reused across search, synthesis, and publication-adjacent lines.
  • SoTA bias. The pattern assumes current QD and OEE work often uses learned, adaptive, unstructured, or uncertainty-bearing spaces and therefore resists premature geometric closure.

A.19.SOURCE-SET-SPACE-SUBSTRATE:7 - Conformance Checklist

Treat a line as conforming only if every gate below passes.

IDGate questionFail whenRepair or governing pattern
CC-A19SS-1Is the line really declaring one substrate-bearing relation rather than only CharacteristicSpace, publication metadata, or policy?The line only names a space object, or only publishes, ships, or retains something, with no explicit source, ref, relation, or posture stack.Move to A.19, G.5, G.10, C.19, or C.24 as appropriate.
CC-A19SS-2Is the active source set recoverable enough for the current case?Only a vague family word such as front or archive remains, and several same-family source sets or set results are live with no way to tell which one is meant.Add the concrete declared source set or set result id or cite the neighboring governing pattern that makes the source/set-result unique.
CC-A19SS-3Do SearchSpaceRef and OutcomeSpaceRef both resolve to declared A.19 CharacteristicSpace, and is SpaceRefRelationKind explicit?One or both refs are vague, or the line leaves the same-space versus cross-space question to inference.Restore the two refs and declare sameDeclaredSpaceAs or distinctDeclaredSpaceFrom explicitly.
CC-A19SS-4Is the source-to-outcome relation explicit in direction, mode, and carrier?The line hides the relation in one umbrella phrase such as projection, portfolio, or maps into, with no explicit carrier.Rewrite into the canonical substrate form and state direction, mode, and carrier.
CC-A19SS-5Is the active qualification posture explicit and honest?The line is qualified in effect, but the posture is unstated or all non-transparent cases are blurred into one generic loss story.Declare the governing posture token and any needed note; if that cannot be done honestly, keep the line informative only.
CC-A19SS-6Are conditional and qualifier fields used only when they really do work?Composition, derivation, base-palette, declared map ref, metric, transition, or bridge qualifiers are fabricated everywhere or silently become core.Remove unused qualifiers; keep only the fields the current case actually depends on.
CC-A19SS-7If DescriptorMapRef or DistanceDefRef is active, does the text say they realize or qualify the relation rather than replace the space ref?The representation or metric layer is treated as if it were the declared search-side or outcome-side space.Re-state the docking rule and keep the two space refs visible.
CC-A19SS-8Does the line stay out of publication and policy work?The prose starts deciding shortlist identity, selector outcome, shipping closure, or live-pool/enactment policy.Split the line and move those downstream decisions to their governing patterns.
CC-A19SS-9Can the line be rewritten into one canonical substrate form without invention?The line still depends on hidden assumptions or unresolved candidates.Keep it as a working gloss or repair the missing recovery before reuse.
CC-A19SS-10Could a cold reader take the next lawful declaration step from this line without surrounding memo help?The line still speaks only in umbrella words such as space, projection, or portfolio, and the reader cannot tell what to fill next.Use the substrate worksheet from 4.12 or rewrite into one canonical substrate form before reuse.
CC-A19SS-11When the next question is interpretive-view, publication, or policy, is the next governing pattern explicit?The text keeps talking as if substrate, interpretation, publication, and policy were one layer, so the reader cannot tell where to continue.Split the line and cite A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW, G.5, G.10, C.19, or C.24 as the next governing pattern.
CC-A19SS-12Does the current use claim only the breadth its declared posture and qualifiers actually license?The prose implies universal geometric closure or one universal heavy-qualification story, but the declared posture or qualifiers stay narrower, uncertain, learned/adaptive, or case-bound.Narrow the claim explicitly or add the missing posture/interpretive qualifiers that make the broader claim honest.

A.19.SOURCE-SET-SPACE-SUBSTRATE:8 - Common Anti-Patterns and How to Avoid Them

Anti-patternWhy it failsRepair
Treating one archive or front as the search space itselfA source set is not the same kind as one declared CharacteristicSpace.Keep SourceSetFamily and SearchSpaceRef separate.
Leaving SpaceRefRelationKind implicitThe reader then has to guess whether search and outcome share one declared space or use two distinct declared spaces.Declare sameDeclaredSpaceAs or distinctDeclaredSpaceFrom next to the two refs.
Letting DescriptorMapRef stand in for the whole substrateA representation layer is not identical to the position-typed space declaration.State the docking rule explicitly and keep the space refs visible.
Making SourceSetComposition or DerivedViewKind mandatory in every lineThe line fabricates composition or derivation where none exists.Keep them conditional.
Publishing with bare portfolio languageportfolio blurs retained-set, selected-set, and posture talk.Use declared source-set and outcome metadata instead.
Treating all distortion as one bridge storyNot every qualified relation is bridge-mediated.State the active posture directly.
Letting G.5 or G.10 sound like the substrate itselfPublication metadata then silently replaces substrate semantics.Keep publication as downstream use of the substrate.

A.19.SOURCE-SET-SPACE-SUBSTRATE:9 - Consequences

Benefits

  • Readers can see what the line is acting on, what spaces it distinguishes, what relation is declared between the two space refs, and what outcome load it claims.
  • A.19, C.18, G.5, and G.10 stay coordinated without collapsing into one layer.
  • Heavier qualifiers such as declared map refs, metrics, transitions, and bridge-loss notes remain usable without being forced into every first slice.

Trade-offs

  • The line must expose one explicit relation and one explicit posture instead of hiding them in umbrella prose.
  • Some cases that used to look "simple" will expose real uncertainty or loss that now needs to be declared.
  • Neighboring interpretive-view or publication patterns may need to be read as companions rather than assumed from local shorthand.

A.19.SOURCE-SET-SPACE-SUBSTRATE:10 - Rationale

The pattern chooses a narrow but sturdy center of gravity.

A.19 already declares CharacteristicSpace. The missing load is not another free-floating space kind. It is the ref-position and relation stack that tells the reader:

  • which declared source set is active;
  • which declared space is named in the search-side position;
  • which declared space is named in the outcome-side position;
  • what SpaceRefRelationKind says about those two refs;
  • and how much transparency, distortion, uncertainty, or error the line is honestly claiming.

That is why this pattern stops before interpretive views and before publication metadata. If it tried to say less, the load would collapse back into vague space or projection talk. If it tried to say more, it would start absorbing views, fronts, archives, shortlists, or shipping semantics that belong elsewhere.

A.19.SOURCE-SET-SPACE-SUBSTRATE:11 - SoTA-Echoing

SoTA practicePrimary source(s)Practice demand disciplined herePractical safeguard boughtAdoption stance
Modern multilevel evolutionary theory looks for one common substrate across several levels rather than forcing one tradition-local carrier to tell the whole story.Vanchurin (2026) on generally covariant evolutionary dynamics; Warrell et al. (2024) on unified multilevel evolutionary frameworks.SS-0, SS-2, CC-A19SS-1, CC-A19SS-2.Keeps one neutral substrate beside A.19, so one archive, front, or publication face cannot silently stand in for the whole substrate declaration load.Adapt. Keep one neutral substrate, but bind it to FPF declaration discipline.
Contemporary QD practice distinguishes feature/behavior space, quality/objective side, archive/repertoire set results, and local competition rather than treating one vague "space" as enough.2026 QD review; IJCAI 2024 stepping-stone results; MOUR-QD (2025).SS-1, SS-3, CC-A19SS-3, CC-A19SS-4, worked slices 5.1 and 5.2.Forces search-side ref, outcome-side ref, and source-to-outcome relation to stay explicit, so downstream search/evaluation claims remain auditable.Adopt/Adapt. Adopt the split; adapt it to FPF declared-source-set discipline.
Frontier QD and adjacent work increasingly use learned, adaptive, unstructured, and uncertainty-bearing spaces and qualifiers, so one heavy metric or transition stack should not be assumed everywhere.Uncertain Quality-Diversity (2023); Extract-QD (2025); later adaptive-space and meta-competition lines.SS-4, SS-5, CC-A19SS-5, CC-A19SS-6.Makes uncertainty posture explicit while keeping declared map ref, metric, transition, and bridge-loss pins optional unless the case truly depends on them.Adopt/Adapt. Adopt uncertainty honesty and optional heavier qualifiers; reject mandatory geometric monoculture.
Atlas and manifold-qualifier lines are useful in some cases, but they are not the default meaning of every source-set/space-substrate line.UMAP 2024 review; 2024-2025 atlas and manifold-optimization lines.SS-5, SS-6, boundary anti-case 5.3, CC-A19SS-8.Preserves substrate semantics so later interpretive or atlas views can help interpretation without quietly becoming the ontology.Adapt. Keep atlas-form interpretation as a later specialization, not the substrate's ordinary center.

A.19.SOURCE-SET-SPACE-SUBSTRATE:12 - Relations

  • Builds on: A.19, A.17, A.18.
  • Coordinates with: C.18, C.19, G.5, G.10, A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW, A.6.P, A.0.
  • Specialized by: A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW and later interpretive-view or atlas specializations when one line needs derived interpretation over an already-declared substrate.
  • Does not replace: selector outcome publication, shipping metadata, live pool policy, or enactment planning.

A.19.SOURCE-SET-SPACE-SUBSTRATE:End


A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW - Declared-Substrate Interpretive View

Type: Architectural (A) Status: Stable Normativity: Normative

Plain-name. Declared-substrate interpretive view.

Declared-substrate interpretive-view record. One declared substrate-side only view over one already-declared source-set and search/outcome-space substrate-bearing basis, written as a domain-specific use-site under existing U.EpistemicViewing and U.MultiViewDescribing law, so the reader can inspect one substrate through thinner or fuller interpretive views without changing the substrate, the publication face, or the EntityOfConcern. In this slice, the admissible basis is either the explicit substrate line itself or one declared source-set entry point or set-result entry point through which that substrate remains recoverable.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:0 - Use this when

Use this pattern when one already-declared substrate from A.19.SOURCE-SET-SPACE-SUBSTRATE is already in force, and the current passage either cites that substrate directly or works through one declared source-set entry point or set-result entry point that keeps the substrate recoverable, but the reader still needs one interpretive view to see how the line should be read in practice.

Typical indicators are:

  • the substrate is already declared, but one thinner interpretive view is still needed so the active source set, search-side space, outcome-side space, or distortion posture stays understandable;
  • one fuller atlas-form reading may help collect several typed set views, active set results, cited spaces, declared map refs, or interpretive qualifiers without changing the underlying substrate;
  • one derived tradition or palette view must stay recoverable as a view over a base palette rather than silently becoming the palette's default meaning;
  • or one line needs optional qualifier refs such as OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, or BridgeDistortionNote, but those pins must stay qualifiers rather than the semantic center.

This is the right pattern when the working need is no longer "what substrate is declared?" and not yet "what shortlist, publication form, or shipped result do we emit?".

Not this pattern when:

  • you still need to declare the substrate itself, including source-set and search/outcome-space roles; use A.19.SOURCE-SET-SPACE-SUBSTRATE;
  • you only need CharacteristicSpace, its slots, or its typing hooks; use A.19;
  • you are publishing selector outcomes, shortlist identity, or shipping metadata; use G.5 or G.10;
  • you are setting live pool policy, retained-set policy, or enactment/planning posture; use C.19 or C.24;
  • you are defining a new generic view law, viewpoint bundle, or publication-view family rather than one domain-specific interpretive reading; use A.6.3, E.17.0, E.17, or E.17.1;
  • the line would change the EntityOfConcern rather than preserve it; use A.6.4 or the appropriate retargeting pattern.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:0.1 - What goes wrong if missed

If this pattern is missed, interpretive-view work usually fails in one of four ways:

  • the substrate is forced to carry every inspection question itself, so A.19.SOURCE-SET-SPACE-SUBSTRATE starts reading as if it also governed interpretive views, atlas readings, or palette interpretation;
  • the word view appears as one fresh local theory, detached from existing U.EpistemicViewing and U.MultiViewDescribing, so viewpoint, view, and publication face start collapsing again;
  • one atlas-form reading quietly becomes the default meaning of the whole family, so a fuller interpretive form starts redefining the base palette or base source set;
  • or qualifier refs such as OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, and BridgeDistortionNote either disappear into vague prose or are promoted into mandatory core everywhere.

The reader then cannot tell whether a visible interpretation is one optional interpretive view, one fuller atlas reading, one publication face, or one new semantic head.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:0.2 - What this buys

This pattern buys one disciplined middle layer:

  • the substrate remains the semantic center;
  • thinner interpretive views remain admissible when a full atlas form is unnecessary;
  • DeclaredSubstrateAtlasView remains available as one fuller reusable specialization, but not as the default head;
  • derived palette or tradition views keep their base palette and base source sets recoverable;
  • active set results, cited spaces, declared map refs, and qualifiers stay recoverable when the current reading uses them;
  • and publication, shipping, and pool-policy questions stay outside the view.

The practical payoff is simple: the reader can use one interpretive view to understand the declared line better without mistaking that interpretive view for the line's ontology, output, or policy.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:0.a - TERM/LEX token-status guard (local-first)

Keep this token-status split explicit:

  • DeclaredSubstrateInterpretiveView is the ordinary/common interpretive-view head introduced here for domain-specific reuse over one already-declared substrate-bearing basis: either the substrate line itself or one declared source set or declared set result that keeps the substrate recoverable.
  • DeclaredSubstrateAtlasView is the fuller specialization of that same family. It is not the common head and it is not automatically required.
  • TypedSetViews is one local plural field over already-declared set-view heads or ids. It is not a new generic set-result ontology.
  • TraditionAtlasView is one local G.2 specialization of DeclaredSubstrateAtlasView, not the family head for all interpretive-view use.
  • OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, and BridgeDistortionNote are guarded neighboring refs or interpretive qualifiers reused here. This pattern may foreground them, but it does not mint them.
  • inspection question is one local declaration field naming the interpretive load the current reading helps with. It is not a replacement for U.Viewpoint.
  • DerivedViewKind and BasePaletteRef stay local recoverability aids here; they do not silently turn the derived reading into the base ontology.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:0.b - First-minute operator cue and confusion guide

Use this pattern only after one substrate is already declared, either cited directly or kept recoverable through one declared source set or declared set result. The first-minute move here is not "write more about the same space". It is "decide what inspection question the reader needs answered without changing the EntityOfConcern".

Do this in the first minute:

  1. Cite the base substrate or the source-set entry point or set-result entry point that stays recoverable with it.
  2. State the inspection question in one sentence.
  3. Choose thin interpretation or atlas interpretation.
  4. Keep the active source set and any active set result recoverable.
  5. Add only the qualifiers that truly discipline the reading.

If you cannot name the base substrate or the recoverable source-set entry point or set-result entry point that carries it, or if the current prose would change the source-to-outcome relation or its posture, stop. You are either repairing the substrate, retargeting the object, or drifting into publication/policy.

If the question under repair sounds like...Use nowWhy
"How do I help the reader inspect the declared substrate?"A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEWThis pattern governs substrate-side only reading.
"What is the substrate itself?"A.19.SOURCE-SET-SPACE-SUBSTRATEThe base line has to exist first.
"Which palette-first or tradition-facing atlas reading should I use?"G.2 over this familyThat is one local specialization of atlas interpretation.
"What do we publish, ship, keep live, or plan next?"G.5, G.10, C.19, or C.24Those publication, shipping, live-pool, and planning questions stay outside interpretive views.

Common confusion to kill early: one visible atlas or metric note does not make atlas form automatically necessary. Thin interpretation is already a complete admissible answer.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:1 - Problem frame

Once one source-set and search/outcome-space substrate has been declared, many lines still need one second-order interpretive view for ordinary work.

Examples include:

  • one archive-centered reading that needs optional metric or transition qualifier to explain why certain regions stay promising;
  • one derived tradition or palette reading that must remain visibly derived from a base palette;
  • one atlas-form reading that collects several typed set views, active set results, spaces, declared map refs, metrics, or distortion notes so that cross-scale structure stays readable;
  • one interpretive rendering that helps the reader inspect the declared substrate without turning that rendering into the substrate's default meaning.

Current FPF already points in that direction. A.6.3 and E.17.0 already give the general law that views are entityOfConcern-preserving and do not mint autonomous new semantics. G.2 already keeps TraditionAtlasView as optional neighboring interpretation over one palette and declared set results rather than making atlas semantics the meaning of Tradition itself. What is still missing is one common interpretive-view pattern that:

  • stays explicitly under existing view law;
  • keeps thinner interpretive views admissible;
  • keeps atlas form reusable but non-default;
  • and keeps interpretive qualifiers optional and recoverable.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:2 - Problem

How should one declare a interpretive view so that:

  1. it is explicitly one domain-specific use-site of existing U.EpistemicViewing and U.MultiViewDescribing law, not one fresh autonomous theory of views;
  2. it keeps the already-declared substrate recoverable instead of replacing it;
  3. it allows both ordinary thinner interpretive views and one fuller atlas-form interpretive view;
  4. it keeps OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, and BridgeDistortionNote optional and substrate-side only;
  5. it keeps derived palette or tradition views recoverable through DerivedViewKind and BasePaletteRef when those are active;
  6. it does not mint new set-result family heads, selector policy, publication policy, or shipping semantics;
  7. it lets G.2 keep TraditionAtlasView as one local specialization rather than as the generic head of the whole family;
  8. and it fails closed when the line would really be retargeting, new view-law work, substrate repair, publication, or policy?

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:3 - Forces

ForceTension
Existing view law vs local usefulnessThe interpretive view must be useful in local substrate work, but it cannot invent a second view ontology beside A.6.3 and E.17.0.
Substrate stability vs interpretive helpReaders need one interpretive layer, but that interpretive layer must not redefine the substrate.
Thin interpretation vs atlas-form readingSome cases need only one light interpretive view; others genuinely need one fuller atlas-form reading. The pattern must admit both without making the fuller form default.
Recoverability vs convenienceDerived tradition or palette views help reading, but they must not hide the base palette, base source set, or active declared spaces.
Qualifier richness vs semantic inflationDeclared map refs, metrics, transition qualifiers, and distortion notes are often useful, but they must stay optional interpretive qualifiers rather than new mandatory core.
Readability vs downstream boundary disciplineThe pattern should help cold readers immediately, while still keeping G.5, G.10, C.19, and C.24 outside the interpretive view.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4 - Solution

Declare interpretive views as substrate-side only readings over one already-declared substrate-bearing basis, keep them explicitly under existing view law, and reserve atlas form for the cases that truly need it.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.1 - Declared-substrate interpretive-view record and outside work

Use this pattern to declare:

  • one DeclaredSubstrateInterpretiveView, the ordinary/common head of this interpretive-view family;
  • one substrate-side only reading over one already-declared substrate-bearing basis: either one explicit A.19.SOURCE-SET-SPACE-SUBSTRATE line or one already-declared source set or declared set result whose declared spaces, declared map refs, and qualifiers remain recoverable through such a line;
  • the inspection question that makes this view worth showing;
  • the recoverable source set or source sets that the interpretive view is reading;
  • any active set result, derived view, or base palette that the current reading keeps in play;
  • any cited spaces or declared map refs that the current reading depends on, provided those remain recoverable through declared refs or the cited substrate-bearing line;
  • and any optional qualifiers that the current view genuinely needs.

DeclaredSubstrateAtlasView is one fuller specialization inside that same family. It is not the common head.

Do not use this pattern to declare:

  • CharacteristicSpace itself;
  • the substrate role/relation stack from A.19.SOURCE-SET-SPACE-SUBSTRATE;
  • selector outcomes, shortlist heads, or shipping outputs;
  • live pool policy or enactment policy;
  • or a new generic law for views, viewpoints, or publication faces.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.2 - Minimal interpretive view declaration

A conforming interpretive view makes the following explicit:

  • which interpretive-family head is active: ordinary DeclaredSubstrateInterpretiveView or fuller DeclaredSubstrateAtlasView;
  • which already-declared substrate-bearing basis it is reading: either the explicit substrate line or the declared source-set entry point or set-result entry point that keeps that substrate recoverable;
  • which inspection question the view is answering;
  • which source set or source sets must stay recoverable while the view is active;
  • which active set result, if any, the current reading is using over that source set;
  • which cited spaces and declared map refs, if any, the current reading depends on, and how they remain recoverable;
  • which optional qualifiers are genuinely doing work in the current case;
  • and which neighboring publication, policy, naming, or inspection questions stay outside this view.

The minimum ordinary interpretive view declaration is therefore:

  1. one declared substrate-bearing basis from A.19.SOURCE-SET-SPACE-SUBSTRATE: either the explicit base substrate line or one declared source set or declared set result whose substrate remains recoverable with it;
  2. one explicit inspection question;
  3. one recoverable active source-set basis, plus any active set result drawn from it when the reading uses one;
  4. any cited spaces, declared map refs, and qualifying uncertainty/distortion refs remain recoverable whenever the reading cites them;
  5. one explicit statement that this is substrate-side only and does not redefine substrate or publication semantics.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.3 - Interpretive-view declaration laws (IV-0..IV-8)

IV-0 - View-law docking is explicit. Every conforming interpretive view is one domain-specific use-site under existing A.6.3 / E.17.0 law. It does not introduce one autonomous new theory of views.

IV-1 - The EntityOfConcern is preserved. The interpretive view preserves the EntityOfConcern already carried by the base line. If the current prose would change that EntityOfConcern, the line is no longer one interpretive view over the same substrate.

IV-2 - The base substrate remains the semantic center. The interpretive view may foreground aspects of the base line, but it does not replace or repair the base substrate declaration. Substrate repair belongs back in A.19.SOURCE-SET-SPACE-SUBSTRATE.

IV-3 - Source, set-result, and palette recoverability are mandatory. The current source set, any active set result drawn from it, and any active derived view or base palette must remain recoverable while the interpretive view is active.

IV-4 - Interpretive qualifiers remain foregrounding devices only. OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, and BridgeDistortionNote may be foregrounded, but they do not become the interpretive view's ontology and they do not silently change the base relation or posture.

IV-5 - Thin interpretation and atlas interpretation are different profiles. Ordinary DeclaredSubstrateInterpretiveView is a complete admissible profile, not a placeholder. DeclaredSubstrateAtlasView is used only when the fuller composite inspection question is real.

IV-6 - Atlas form requires a complete composite record. If atlas form is active, the view must keep the base substrate, the active source or set result, the relevant TypedSetViews, any cited spaces, any cited declared map refs, and any qualifiers explicit enough that the reader can recover why thin interpretation was not enough.

IV-7 - Local specialization stays local. If TraditionAtlasView is used, it remains one G.2 specialization of DeclaredSubstrateAtlasView; it does not become the common head of the family.

IV-8 - Admission is fail-closed. If the current line would change the EntityOfConcern, add new generic view law, repair the substrate, decide publication, or decide policy, it is not a conforming interpretive view here. Apply the pattern that governs that question instead of stretching the family.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.4 - Profiles

Use one of these profiles explicitly:

  • Thin-interpretation profile. Use ordinary DeclaredSubstrateInterpretiveView when one source basis plus one inspection question is enough, and the current reading does not need several typed set views or several interpretive qualifiers held together at once.
  • Atlas-interpretation profile. Use DeclaredSubstrateAtlasView when the reader must hold several declared views, spaces, declared map refs, or qualifiers together to understand the same base substrate-bearing line.

If neither profile can be chosen honestly, the line is not ready as interpretive-view text.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.5 - Operational declaration sequence (fail-closed)

When declaring one interpretive view, proceed in this order:

  1. Entry test. Confirm that one already-declared substrate exists and that the current inspection question can cite it either directly or through one declared source-set entry point or set-result entry point that keeps it recoverable, rather than drifting into substrate repair, publication, or policy.
  2. Name the active interpretive head. Use ordinary DeclaredSubstrateInterpretiveView unless the current reading genuinely needs the fuller atlas form.
  3. Cite the base line. Name the already-declared substrate the view is reading, or cite the source-set entry point or set-result entry point together with the recoverable substrate it depends on.
  4. State the inspection question directly. Say what the view helps the reader see that the substrate alone leaves hard to inspect.
  5. Keep the base source/result recoverable. Name the active source set, and if the view is over one declared front, archive, shortlist, palette, or other set result drawn from that source, keep that active set result recoverable too.
  6. Recover derived-view and palette structure when it matters. If the view depends on one derived tradition or palette reading, state DerivedViewKind and BasePaletteRef.
  7. Add the actual qualifiers. Add TypedSetViews, cited spaces, declared map refs, metrics, transition qualifiers, or distortion notes only when the current reading truly depends on them.
  8. Run the preservation check. If the interpretive prose would materially change the base source-to-outcome relation or the base distortion/uncertainty/error posture, stop and reopen the substrate declaration.
  9. Run the boundary check. If the prose starts changing the EntityOfConcern, minting new generic view law, publishing selected sets, shipping outputs, or deciding policy, apply the pattern that governs that question.

Fail-closed rule. Do not treat the line as a interpretive view if steps 2-7 cannot be completed honestly. Missing base-line recovery or hidden posture change is a real defect here.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.6 - Thin interpretation remains a complete admissible form

Many cases need one interpretive view but not one atlas-form interpretation package.

Stay with one thinner interpretive view when:

  • the current reading needs only one declared source set or one derived view over it;
  • the current question does not need several typed set views assembled at once;
  • one explicit interpretive sentence is enough to keep the current line readable;
  • or the case does not genuinely depend on metrics, transitions, or bridge-loss notes.

This matters because the interpretive layer should stay proportionate to the inspection question. If a thin interpretive view already solves the reader's problem, forcing atlas form would over-type the line and create fake necessity.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.7 - Atlas form is fuller interpretation and needs a complete record

Use DeclaredSubstrateAtlasView for the fuller interpretive cases:

  • when several typed set views over one declared source set or one active derived set result must be read together;
  • when one atlas-form reading helps the reader inspect cross-scale structure, cross-space structure, qualifier plurality, or declared-map-ref plurality;
  • when the current interpretation genuinely depends on one declared map ref, metric, transition qualifier, or distortion note and those qualifiers must stay visible together with the active source sets or active set results they qualify.

The minimal admissible atlas-form interpretation declaration therefore contains:

  • the cited base substrate or source-set entry point or set-result entry point;
  • the active source set and any active set result drawn from it;
  • TypedSetViews when several declared set views are being held together;
  • any cited SearchSpaceRef, OutcomeSpaceRef, or other declared space refs that the atlas reading depends on;
  • any cited OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, or BridgeDistortionNote that materially disciplines the reading;
  • DerivedViewKind and BasePaletteRef whenever the atlas reading is over one derived palette or tradition view;
  • one explicit reason thin interpretation is insufficient.

If atlas form cannot state that composite interpretation view without invention, stay with thin interpretation or apply the pattern that governs the missing question.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.8 - No autonomous local view law is introduced here

Read the docking to A.6.3 / E.17.0 strictly:

  • the interpretive view preserves the EntityOfConcern already carried by the base line;
  • it does not silently mint new intensional commitments about that same EntityOfConcern;
  • it does not replace one viewpoint bundle or one publication-view family with one new local invention;
  • and it does not collapse viewpoint, view, and publication face into one word.

If a case would need a different EntityOfConcern, a different generic view law, or one new viewpoint family, this pattern is no longer the governing pattern.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.9 - Qualifier refs stay substrate-side

OutcomeMapRef, SpaceMetricRef, TransitionRelationRef, and BridgeDistortionNote are admitted here only as interpretive qualifiers.

They are declared first on the substrate side. This pattern may foreground or organize them for the reader, but it may not silently widen, narrow, or otherwise change the base substrate posture.

Use them when the current interpretive view genuinely needs them:

  • OutcomeMapRef when the current reading must show how one declared source or set result bears on one outcome-side declared space/ref;
  • SpaceMetricRef when neighborhood, spread, reachability, or crowding claims are load-bearing in the current reading;
  • TransitionRelationRef when the current reading depends on explicit transition or cross-scale state-change qualifier;
  • BridgeDistortionNote when the reader must keep one declared loss or distortion visible near the current reading.

If the interpretive view would newly introduce lossy-bridge, uncertainty-bearing, transition-dependent, learned/adaptive, or another materially different posture that the substrate did not already declare, reopen the substrate declaration instead of treating that posture change as view-only convenience.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.10 - Publication, set-result, and pool-policy boundaries

This pattern does not publish selected sets, declare shortlist heads, or decide which candidate lines stay live.

Keep the split explicit:

  • A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW helps the reader inspect one already-declared substrate;
  • G.5 publishes selector outcomes and their source/publication metadata;
  • G.10 ships publication faces and pins;
  • C.19 governs live candidate-pool and frontier policy;
  • C.24 governs enactment/planning posture.

If the prose starts deciding who survives, what is published, or what is shipped, it has already left this pattern.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.11 - G.2 keeps the tradition-facing atlas specialization

When the current interpretive view is tradition-facing and palette-first recoverability matters, use the local specialization governed by G.2.

Read the relation this way:

  • A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW states the generic interpretive-view family and the generic fuller atlas form DeclaredSubstrateAtlasView;
  • G.2 keeps the palette-first, tradition-facing specialization TraditionAtlasView;
  • TraditionAtlasView is therefore one local specialization of the fuller atlas form, not the common head of the whole interpretive family.

This keeps the family honest in both directions:

  • the common interpretive-view family does not force Tradition or Atlas into every case;
  • and the G.2 specialization does not lose its palette-first recoverability.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.12 - Operator kit: choose, record, preserve, apply governing neighbor

Use this compact kit whenever you need one interpretive view that can actually be used, checked, and bounded against neighboring patterns in practice.

Decision pointWhat to do nowAdmissible resultStop or apply another pattern when...
1. Which base line am I reading?Cite the base substrate or recoverable source-set entry point or set-result entry point.The interpretive view is anchored on one visible base line.The view still floats free of the line it is supposed to help read.
2. What inspection question is this view answering?State the question directly in one sentence.The reader can tell what this view helps inspect.The view mostly repeats theory without naming the practical inspection load.
3. Do I need thin interpretation or atlas interpretation?Choose ordinary DeclaredSubstrateInterpretiveView unless several views, spaces, declared map refs, or qualifiers must be held together at once.The interpretive head is chosen honestly.Atlas language appears by reflex, or thin interpretation would already solve the reading problem.
4. Which source/result refs and qualifiers must stay recoverable?Keep the active source set, active set result, derived view, base palette, and cited qualifiers visible only when they truly do work.Recoverability stays proportional to the inspection question.The base palette or base source/result disappears behind the fullest visible overlay.
5. Is the line still substrate-side only?Check whether the prose preserves the base substrate and its EntityOfConcern.The view remains one reading, not one rewrite of the underlying line.The prose is really changing the substrate, publishing outputs, or deciding policy.

Use this compact interpretive view declaration when drafting or repairing the line:

InterpretiveViewHead               = DeclaredSubstrateInterpretiveView | DeclaredSubstrateAtlasView
BaseSubstrateRef          = ...
InspectionQuestion           = ...
ActiveSourceSet       = ...
ActiveSetResult?         = ...
DerivedViewKind?          = ...
BasePaletteRef?           = ...
TypedSetViews?            = ...
CitedSpaceRefs?           = ...
InterpretiveQualifiers?        = ...
WhyThinIsEnough? /
WhyAtlasIsNeeded?         = ...

Run this self-check before you leave the passage:

  • if the interpretive view would change the base relation or posture, reopen A.19.SOURCE-SET-SPACE-SUBSTRATE;
  • if the atlas-necessity line is empty, stay with thin interpretation;
  • if the next question under repair is naming repair, terminology precision, publication, or policy, apply [F.18](/generated/patterns/F.18), [A.6.P](/generated/patterns/A.6.P), [G.5](/generated/patterns/G.5), [G.10](/generated/patterns/G.10), [C.19](/generated/patterns/C.19), or [C.24](/generated/patterns/C.24) instead of stretching interpretive-view prose across those boundaries.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:4.13 - Using the interpretive view with neighboring patterns

Read neighboring patterns in this order once the interpretive view declaration is in place:

  • Use G.2 when the interpretive view becomes palette-first, tradition-facing atlas work. That is one local specialization of atlas interpretation, not the common family head.
  • Use F.18 when the question under repair is label choice around interpretive-view, atlas, palette, or declared-map-ref language. Naming notes may explain the labels, but they do not change the base substrate or the inspection question.
  • Use A.6.P when one passage collapses view, surface, space, map, or palette into one umbrella word. Repair the layer split first, then continue.
  • Use A.0 when cold-reader glossing is what the current line lacks. Glosses help recognition; they do not replace the base interpretive view declaration.
  • Use G.5, G.10, C.19, or C.24 when the passage starts deciding outputs, survivor sets, or planning posture.

If a neighboring passage would change the EntityOfConcern or the base substrate posture, this pattern is no longer the governing pattern for that sentence. Reopen the base line or apply the pattern that governs the new question.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:5 - Archetypal Grounding

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:5.1 - System

Tell. One QD line already has one declared archive-side substrate. Readers still need one ordinary interpretive reading that keeps local archive neighborhoods readable, but no shortlist, atlas bundle, or shipping result exists yet.

Show. The active interpretive head is ordinary DeclaredSubstrateInterpretiveView. It reads one declared archive-side substrate line whose active source set remains Archive and whose active space question remains recoverable through BehaviorCharacteristicSpace@ed=12. The only extra qualifier kept visible here is ArchiveNeighborhoodMetric@ed=4, because the current question is simply how local archive neighborhoods shape the reader's interpretation of the already-declared line.

Cash-out. This is one thinner interpretive view over one already-declared substrate. It keeps one source set and one inspection question in view without introducing several TypedSetViews, one OutcomeMapRef, one TransitionRelationRef, or one bridge-loss note. Downstream interpretation gets the extra legibility without accidentally turning the metric note into ontology.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:5.2 - Episteme

Tell. One synthesis line already keeps a base SoTA palette and one derived tradition-facing reading. The reader now needs one fuller atlas-form interpretive view that keeps the base palette recoverable while showing how several tradition-facing views and cross-scale notes sit together.

Show. The active interpretive head is DeclaredSubstrateAtlasView. It reads one declared palette-facing substrate line whose source-set family remains TraditionPalette, whose active derived view remains TraditionFront, and whose base palette remains recoverable through SoTAPaletteDescriptionId. The cited spaces stay explicit as TraditionComparisonSpace@ed=3 and AdoptionOutcomeSpace@ed=2. The atlas reading keeps together the declared set views TraditionFront and TraditionArchive, the OutcomeMapRef value PaletteToAdoptionOutcomeMap@ed=1, the distortion note CrossTraditionComparisonLossNote@ed=1, and the local G.2 specialization TraditionAtlasView.

Cash-out. Here the fuller atlas form is honest because several declared views, spaces, and qualifiers really must stay visible together. Even so, it still does not redefine the base palette. The reader can recover the palette, the active derived set result, the cited spaces, the OutcomeMapRef, the qualifier note, and the local specialization together.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:5.3 - Boundary anti-case

Tell. One note starts from "atlas view" language, then quietly changes the base outcome posture and argues that only one shortlisted tradition should remain live.

Show. This is not a interpretive view anymore. It is mixing substrate repair with candidate-pool or publication policy.

Cash-out. Reopen the substrate if the base relation or posture changed. Apply C.19, C.24, G.5, or G.10 to retention or shipping decisions instead of using interpretive-view prose to smuggle them in.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:5.4 - Use-situation spread

Use the interpretive-view family this way across different working situations:

Working situationChooseWhat must stay explicitCommon miss avoided
Archive-side QD line that only needs one metric cue so the reader can see local neighborhoodsThin interpretationOne base substrate, one inspection question, one active source set, and the specific metric qualifier doing work.Forcing atlas form into a case that only needs one simple reading aid.
Palette-first synthesis line that really needs several declared views, spaces, declared map refs, and loss notes held togetherAtlas interpretation, with G.2 when the case is tradition-facingThe base palette, derived view, cited spaces, qualifying map-ref/distortion refs, and the reason thin interpretation is insufficient.Letting the most salient visible atlas overlay replace the palette-first base line.
Derived tradition/front note that only needs to remind the reader how to read one already-declared substrateThin interpretationThe inspection question, derived-view recoverability, and the base palette when it would otherwise disappear.Treating every derived tradition reading as if it were already full atlas work.
Passage that starts changing the outcome posture, survivor set, or publication resultDo not use this patternThe boundary out to substrate repair, publication, or policy stays explicit.Smuggling retargeting or policy decisions into interpretive-view prose.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:6 - Bias-Annotation

  • Gov bias. The pattern prefers explicit reuse of existing view law over local convenience talk about one view.
  • Arch bias. The pattern keeps substrate, interpretive reading, publication, and policy separated even when one merged story would sound simpler.
  • Prag bias. The pattern prefers thinner interpretive views by default and treats atlas form as one fuller option rather than a universal baseline.
  • Did bias. The pattern insists on recoverability of the base palette or base source set because readers otherwise over-trust the most salient visible interpretive form.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:7 - Conformance Checklist

Treat a line as conforming only if every gate below passes.

IDGate questionFail whenRepair or governing pattern
CC-A19IV-1Is one already-declared base substrate or source-set entry point or set-result entry point named explicitly?The interpretive view floats free of the line it is supposed to help read.Cite the base substrate or the recoverable source-set entry point or set-result entry point.
CC-A19IV-2Is the interpretive view explicitly docked to existing A.6.3 / E.17.0 law?The text presents itself as one autonomous local theory of views.State the docking explicitly or apply the pattern that really defines the missing view law.
CC-A19IV-3Does the line preserve the same EntityOfConcern and keep the base substrate as semantic center?The interpretive prose retargets the EntityOfConcern or repairs the substrate in place.Reopen under A.19.SOURCE-SET-SPACE-SUBSTRATE, A.6.4, or the appropriate neighboring pattern.
CC-A19IV-4Are the current source set, any active set result, and any active derived view or base palette recoverable?The interpretive reading hides the base palette, base source/result, or active derived set result behind one fuller visible overlay.Restore the missing recoverability fields.
CC-A19IV-5Is the active profile chosen honestly: thin interpretation or atlas interpretation?Atlas language is used by reflex, or the line needs atlas interpretation but never says so.State the profile explicitly and justify why thin interpretation is or is not sufficient.
CC-A19IV-6If atlas form is active, is the composite atlas-form interpretation declaration complete?Several views, spaces, declared map refs, or qualifiers are being used, but TypedSetViews, cited spaces, declared map refs, qualifiers, or the reason thin interpretation is insufficient remain hidden.Publish the missing atlas-form interpretation declaration or step back to thin interpretation.
CC-A19IV-7Are interpretive qualifiers really substrate-side only and reused from the substrate side?Metrics, transitions, declared map refs, or distortion notes silently change the base relation or posture, or become mandatory core everywhere.Keep them as foregrounded qualifiers only, or reopen the substrate declaration.
CC-A19IV-8If TraditionAtlasView is used, is it kept as one G.2 specialization rather than the common family head?The local specialization is treated as if every interpretive case were already palette-first atlas work.Restore the split between DeclaredSubstrateAtlasView and TraditionAtlasView.
CC-A19IV-9Does the line stay out of publication and policy work?The prose starts deciding who survives, what is published, or what is shipped.Split the line and apply G.5, G.10, C.19, or C.24 to those questions.
CC-A19IV-10Could a cold reader choose thin interpretation versus atlas interpretation and fill one interpretive view declaration without hidden invention?The reader still needs surrounding memo knowledge to know which head to use, what fields matter, or why atlas is or is not needed.Fill the compact interpretive view declaration from 4.12 and state why thin interpretation is enough or why atlas interpretation is necessary.
CC-A19IV-11Is the inspection question explicit enough to tell the reader what this view helps inspect now?The view mostly restates the base theory, but the practical inspection load stays unnamed.State the inspection question directly and keep the base line recoverable beside it.
CC-A19IV-12When specialization, naming repair, publication, or policy becomes the next question, is the governing neighbor explicit?The interpretive prose silently drifts into G.2, F.18, A.6.P, G.5, G.10, C.19, or C.24 without naming the boundary.Split the line and cite the governing neighbor instead of stretching interpretive-view prose across that boundary.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:8 - Common Anti-Patterns and How to Avoid Them

Anti-patternWhy it failsRepair
Writing as if A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW were a fresh autonomous theory of viewsIt duplicates existing A.6.3 and E.17.0 law and collapses U.Viewpoint, U.View, and publication-face discipline.State the docking to existing view law explicitly.
Letting atlas language become the default meaning of every interpretive caseThe fullest visible interpretive form silently becomes the family head.Keep ordinary thinner interpretive views admissible and say when atlas form is actually needed.
Treating qualifier refs as the view's semantic centerMetrics, transitions, or distortion notes then replace the base substrate.Keep the base substrate and inspection question explicit, and keep qualifier refs optional.
Letting a derived tradition view replace its base paletteThe reader loses palette-first recoverability and mistakes one local interpretation for the default ontology.Keep DerivedViewKind and BasePaletteRef visible together.
Turning the interpretive view into publication or pool policyThe reader can no longer tell whether the text is helping interpret the line or deciding what survives and gets published.Keep G.5, G.10, C.19, and C.24 outside this pattern.
Forcing atlas form into every first readingSimple cases become over-typed and harder to use.Start with the thinner interpretive-view form and widen only when the current need genuinely requires it.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:9 - Consequences

Benefits

  • Readers get one explicit interpretive layer without losing the declared substrate.
  • FPF keeps one common interpretive-view family without forcing G.2 or another local specialization to carry the whole interpretive requirement.
  • Atlas-form interpretation remains available where it helps, but thinner interpretive views stay lawful.

Trade-offs

  • The declaration must keep more boundaries explicit: view law, substrate, publication, and policy no longer collapse into one comfortable narrative.
  • Some cases that once looked like "just a view" must now say whether they are thin interpretation, atlas interpretation, publication, or policy.
  • The pattern requires the base palette or source set to stay recoverable, which can make local prose slightly less terse.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:10 - Rationale

The family needs one common interpretive-view pattern because neither of the earlier extremes is good enough.

If everything stays in the substrate, the substrate starts carrying interpretive and atlas-form requirements that are not part of its semantic center.

If everything stays inside one local specialization such as G.2, the common interpretive requirement gets trapped inside one tradition-facing case and starts looking like a local accident rather than a reusable family.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW is the middle answer:

  • it keeps the interpretive layer generic and reusable;
  • it keeps the layer explicitly under existing view law;
  • it lets ordinary thinner interpretive views remain first-class;
  • and it reserves atlas-form reading for the cases that truly need it.

That is why DeclaredSubstrateAtlasView appears here as one richer interpretive specialization, while TraditionAtlasView remains one G.2 specialization of it rather than the common head.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:11 - SoTA-Echoing

Practice linePrimary accepted basisPractice demand disciplined herePractical safeguard boughtAdoption stance
Interpretive readings should remain entityOfConcern-preserving views rather than becoming fresh semantic centers.A.6.3 and E.17.0 already require views to preserve the EntityOfConcern and not silently add new intensional commitments.IV-0, IV-1, IV-8, CC-A19IV-2, CC-A19IV-3.Keeps interpretive prose from quietly turning into retargeting or new view-law invention.Adopt. Reuse the existing view law directly rather than minting one local alternative.
Palette-first SoTA synthesis already treats atlas interpretation as optional neighboring interpretation rather than the default meaning of Tradition or SoTAPaletteDescription.G.2:4.7 already keeps TraditionAtlasView as optional neighboring interpretation and preserves palette-first recoverability.IV-5, IV-6, IV-7, CC-A19IV-5, CC-A19IV-8, worked slice 5.2.Keeps atlas form available without letting the most salient visible interpretive layer replace the base palette or family head.Adopt/Adapt. Adopt palette-first recoverability and adapt it into one reusable common interpretive family.
Contemporary QD, manifold, and atlas practice uses both projection-style interpretation and richer atlas or geometry qualifiers, while heavier metrics and transition models remain case-dependent rather than universally mandatory.Current atlas, manifold, and QD practice treats richer declared map ref, metric, and transition apparatus as optional discipline tied to the case rather than as mandatory baseline machinery.IV-4, IV-5, IV-6, CC-A19IV-5, CC-A19IV-6, CC-A19IV-7.Keeps thinner interpretation admissible, keeps atlas interpretation reusable but non-default, and prevents rich formal qualifier from being smuggled in by default.Adapt. Keep richer formal qualifier available without pretending it is the baseline for every interpretive reading.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:12 - Relations

  • Builds on: A.19.SOURCE-SET-SPACE-SUBSTRATE, A.19, A.6.3, E.17.0, E.17.
  • Coordinates with: G.2, G.5, G.10, C.19, C.24, A.6.P, A.0.
  • Specialized locally by: DeclaredSubstrateAtlasView, and in palette-first tradition work TraditionAtlasView under G.2.
  • Does not replace: substrate declaration, selector outcome publication, shipping metadata, or live candidate-pool / enactment policy.

A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:End


CN‑frame (comparability & normalization)

Scope. This CN‑frame Algebra & Normalization Discipline extends A.19 by fixing the governance Standard for CN‑frames, defining a conformance checklist and regression harness, and providing didactic one‑pagers and anti‑patterns so teams can introduce CN‑frames without tool lock‑in. The mandatory pattern structure and authoring discipline from Part E (Style Guide, Tell‑Show‑Show, checklists, DRR, guard‑rails) are applied throughout.

Governing-pattern boundary (cite, don’t duplicate). A.19.CN governs the CN-frame governance card, registry, bridges, and checklist/harness (CN-Spec, registry, bridges, checklist/harness). It does not govern any CHR-mechanism intensions, term cards, or method taxonomies. Those are governed by the corresponding mechanism-governing patterns: A.19.UNM, A.19.UINDM, A.19.USCM, A.19.ULSAM, A.19.CPM, and A.19.SelectorMechanism. Evidence/backing is governed by C.16; legality gates are governed by G.0. Therefore A.19.CN specifies where the references live, what must be citeable for audit, and how governance changes trigger regression — not mechanism semantics.

Reader guide (fast navigation).

  • “What does NormalizationMethodId/…InstanceId/≡_UNM/NormalizationFix mean?” → A.19.UNM.
  • “What is an Indicator / IndicatorChoicePolicy and why NCV ≠ Indicator?” → A.19.UINDM.
  • “Why can we trust a normalization / where does calibration or evidence live?” → C.16 (MM‑CHR).
  • “What is admissible to compare or aggregate, and what is MinimalEvidence?” -> G.0 (CG-Spec).

Context

A.19 established a substrate‑neutral picture:

  • a CN‑frame = (Context‑local) CharacteristicSpace (CS) + chart (coordinate patch + units) + a referenced Normalization mechanism (UNM) pinned from CN‑Spec.normalization. Any semantics of admissibility, invariants, and ≡_UNM is governed by the A.19.UNM governing pattern (see A.19.UNM);
  • operators (subspace, product, pullback/pushforward) and comparability (coordinatewise vs normalization‑based (normalize‑then‑compare));
  • RSG touch‑points: role readiness (RSG states) are certified against CS via checklists over observable characteristics;
  • entity/relational mixtures across CN‑frames via minimal schemas and bridges.

Terminology guard. CN‑frame is the lens (I); CN‑Spec is the governance card (S) that fixes admissible charts/normalization references/comparability/Γ‑fold for that lens in one U.BoundedContext; CN‑Description is the didactic surface (D) with worked examples and anti‑patterns. Mechanism‑level term cards (e.g., NormalizationMethod, NormalizationMethodInstance, NCV, ≡_UNM, IndicatorChoicePolicy) are governed by the corresponding A.19. patterns and are only cited here.

Lexical guard (map/Map, by reference). Follow the lexical discipline governed by A.19.UNM: avoid introducing new normalization tokens that use “map/Map/mapping” (because …Map is a Part‑G method‑type kind). In normalization contexts prefer normalize / transform / re‑parameterize. Legacy tokens (including retired κ‑notation) are handled via alias docking (F.18); A.19.CN applies this rule and does not redefine it.

A.19.CN makes this operational and auditable.

Problem

Absent a governance layer, four failure modes recur:

  1. Chartless numbers. Measures move between teams without units, reference states, or declared normalization → illusory comparability.
  2. Hidden normalization flips. Re‑parameterisations (e.g., normalising by batch size) silently alter meaning; trend lines lie.
  3. CN‑frame sprawl. Every initiative mints a new “dashboard dimension”; semantics diverge; assurance collapses.
  4. Un‑bridgeable reports. Cross‑team roll‑ups average incongruent CN‑frames, violating the weakest‑link (WLNK) discipline from Γ and B.3.

Forces

ForceTension we must balance
Universality vs nuanceOne Standard for robotics, safety, finance — yet leave each context’s idioms intact.
Speed vs auditLight ceremony for on‑ramp; hard guarantees for assurance and SoD.
Local truth vs federationKeep CN‑frames meaning‑local; still enable explicit bridging across Contexts.
Minimalism vs safetyFew mandatory slots; enough structure to forbid silent normalization drift.

Solution — The CN‑Spec (CN‑Spec) + Registry + Bridges

The CN‑Spec (comparability & normalization specification per CN‑frame, in one U.BoundedContext)

A CN‑frame is governed by a compact, notation‑free card:

CN‑Spec {
  name              : CN‑frameName                  // local to Context
  context           : U.BoundedContext              // edition/version included
  cs_basis          : [{
    slot_id         : <tech-token>,                 // stable slot id (basis name)
    characteristic  : <U.Characteristic>,          // per A.17 / A.18
    scale           : { type: nominal|ordinal|interval|ratio, unit?: <U.Unit>, bounds?: <… > },
    polarity        : up|down|target-range,        // comparison orientation
    // if needed: missingness?, admissible_domain? (MM‑CHR‑consistent metadata)
  }]
  chart             : { reference_state, coordinate_patch, measurement_protocol_ref }
  normalization     : {
   UNM_id?,                                      // reference to the UNM mechanism; canonical Intension: A.19.UNM
   methods: [NormalizationMethodId],              // A.19.UNM-governed tokens; semantics are governed by A.19.UNM
   instances?: [NormalizationMethodInstanceId],   // A.19.UNM-governed tokens; evidence/backing lives in C.16
   method_descriptions: [NormalizationMethodDescriptionRef], // refs only; semantics and corpus live with A.19.UNM
   admissible_reparameterizations,                // A.19.UNM-governed declarations (opaque here; see A.19.UNM)
   invariants,                                    // A.19.UNM-governed invariant tokens (opaque here; see A.19.UNM)
   fix?: <NormalizationFixSpec>                   // A.19.UNM-governed fix spec (opaque here; see A.19.UNM)
   }
  comparability     : { mode ∈ {coordinatewise, normalization-based}, minimal_evidence }  // `minimal_evidence` is a gate reference (default: CG‑Spec.MinimalEvidence; see G.0 and C.16)
  indicator_policy? : { IndicatorChoicePolicyRef, scope, edition }  // policy ref only; semantics governed by A.19.UINDM
  acceptance        : { checklist_for_admission, window, evidence_anchors } // gates RSG state checks
  aggregation       : { Γ_fold, WLNK/COMM/LOC/MONO choices, time_policy }   // fold tokens only; semantics governed by B.3 and G.0 (and the folding mechanism card, if cited)
  alignment?        : { bridges_to_other_contexts, CL_levels, loss_notes }  // optional
  maintenance       : { source_maintenance_role_assignment, DRR_links, deprecation_plan }
}

Reading: A CN‑frame is a context‑local lens with declared characteristics and a chart to read them. CN‑Spec pins the references and governance choices needed to make admission, comparability, and safe roll‑ups auditable: the UNM reference for normalization‑based comparability, an optional IndicatorChoicePolicyRef, an explicit Γ_fold, and the admission checklist. Any mechanism semantics, such as what ≡_UNM means or what counts as an Indicator, is governed by the corresponding mechanism-governing pattern and is only cited from here.

Governing-pattern assignment note. CN-Spec stores only the governance references and declarations. The semantics and term cards for NormalizationMethod*, ≡_UNM, NCV, IndicatorChoicePolicy, and any other CHR-mechanism vocabulary are governed by the corresponding mechanism-governing patterns such as A.19.UNM and A.19.UINDM; evidence backing lives in C.16. (Kernel reminder: per A19‑CS‑5, U.CharacteristicSpace carries no hidden normalizations or aggregations.) In A.6.1 terms, UNM_id points to a canonical U.Mechanism.Intension card; the CN‑Spec references that mechanism and does not introduce implicit Transport.

L‑CN‑Spec‑NORM‑IDs (by reference). When CN‑Spec (or its audit trail) needs stable normalization tokens, use NormalizationMethodId/NormalizationMethodInstanceId as specified by A.19.UNM. Avoid generic “map” nouns and retired κ‑notation (see the A.19.UNM lexical guard); preserve retired tokens only via F.18 alias docking. If you introduce reference‑typed fields, obey A.6.5 (*Ref reserved for reference fields; *Slot reserved for SlotKinds).

CN‑frame Registry (per Context)

Each U.BoundedContext keeps a CN‑frame Registry (VR):

  • canonical names and editions;
  • SoD hooks (who can edit CN‑Spec, who can certify admission);
  • deprecation map (what replaces what, when).

Bridges (across contexts)

Cross‑context reuse occurs only via explicit Alignment Bridges (F.9) between CN‑Specs:

Bridge CN‑frameA@Context1  →  CN‑frameB@Context2
  channel: {Scope|Kind}                 // F.9 (and A.6.1 Transport)
  planes: ReferencePlane(src,tgt)       // C.2.1 (must be recorded)
  CL: {3|2|1|0}
  CL_plane?: {3|2|1|0}                  // only when planes differ
  kept_characteristics: [… ]
  lost_characteristics: [… ]
  transform: {pullback | pushforward | re-scaling | re-binning | … }  // illustrative; use the operator vocabulary governed by A.19 and F.9
  extra_guards: {additional evidence, review role, or waiver speech act}

CL policy (reference). CL levels and the penalty Φ(CL) are defined in B.3 (CL is ordinal; do not average). In A.6.1 terms, any cross‑context (or cross‑plane) reuse is declared only via a mechanism’s Transport clause: name the BridgeId and channel (Scope|Kind) and record ReferencePlane(src,tgt); if planes differ, declare the CL^plane regime. Transport is declarative (it does not introduce a U.Transfer edge and does not restate CL ladders or Φ tables). When both scope and entityOfConcern change, apply the two‑bridge rule (Scope bridge + KindBridge (CL^k)). Penalties from scope/kind/plane route to R/R_eff only (never to F/G). This CN‑Spec may add operational guards per level (e.g., “extra reviewer at CL=1”, “waiver at CL=2”), but it does not redefine the scale or Φ. For episteme‑specific frames, see also B.1.3.

Conformance Checklist (normative)

Pass these and your CN‑frames are fit for assurance and cross‑team composition.

CC‑A19.D1‑1 (Local scope). Every CN‑frame MUST live inside a declared U.BoundedContext (with edition). Names are local; same label in another Context ≠ same CN‑frame.

CC‑A19.D1‑2 (Units & polarity). Each characteristic in cs_basis MUST declare unit and scale and polarity (↑ better, ↓ better, or target range). No unlabeled magnitudes.

CC‑A19.D1‑3 (Chart). chart MUST name the reference state, coordinate patch and measurement protocol (U.MethodDescription) to make numbers reproducible.

CC‑A19.D1‑4 (Normalization references, not redefinition). normalization MUST (i) cite the UNM mechanism (UNM_id?) and (ii) provide the normalization references required by the A.19.UNM governing pattern (methods / invariants / fix, and instances when used) so that any normalization‑based comparison is auditable. This pattern does not define what a “NormalizationMethod” is — it requires that CN‑Spec can point to the governing pattern that does.

CC‑A19.D1‑5 (Comparability mode). comparability.mode MUST be either coordinatewise (same chart & units) or normalization‑based (“normalize‑then‑compare” via the declared UNM). Mixed/implicit modes are prohibited. The semantics of ≡_UNM and what counts as “same class” is governed by A.19.UNM; CN-Spec only pins the references needed to audit the choice.

CC‑A19.D1‑6 (Admission checklist). acceptance.checklist_for_admission MUST be observable and time‑bounded; each datum admitted to the CN‑frame SHALL cite a StateAssertion or equivalent U.Evaluation.

CC‑A19.D1‑7 (Aggregation discipline). aggregation.Γ_fold MUST specify WLNK/COMM/LOC/MONO choices and the time policy (e.g., average of rates vs integral of counts). No free‑hand averages. The legality/semantics of folding is governed by B.3 and G.0 (and, when a folding mechanism is cited, by its mechanism-governing pattern); CN‑Spec only stores the governance pins.

CC‑A19.D1‑8 (Bridge‑only reuse). Cross‑context consumption MUST cite a Bridge with: (i) channel ∈ {Scope|Kind}, (ii) recorded ReferencePlane(src,tgt), (iii) CL (and CL^plane when planes differ), and (iv) loss notes; coordinate‑by‑name without a Bridge fails. If the data participate in gating/assurance, apply Φ(CL) per B.3; this CN‑Spec does not restate Φ.

CC‑A19.D1‑9 (SoD & roles). Editing CN‑Spec and admitting data MUST be performed by different roles (⊥ enforced): CN‑frameStewardRole ⊥ CN‑frameCertifierRole inside the same context.

CC‑A19.D1‑10 (Maintenance, deprecation, and DRR). Every CN-Spec MUST carry a source-maintenance role assignment, a deprecation plan, and links to DRR entries for rationale and changes (Part E.9).

CC‑A19.D1‑11 (Anchors & lanes for comparability). Any admission into a CN‑frame that is later used for comparison/aggregation SHALL cite the corresponding A.10 EvidenceRole anchors for each characteristic, with assuranceUse lane tags {TA, VA, LA} and validity windows (where applicable), so that the SCR can report lane‑separated contributions and freshness (B.3). Absence of anchors for a required characteristic renders items incomparable.

CC‑A19.D1‑12 (Notation independence). CN‑Spec content MUST NOT depend on a tool or file format; semantics precede notation (E.5.2 Notational Independence).

CC‑A19.D1‑13 (Lexical guard‑rails). characteristic names and role labels MUST follow the Part E lexical discipline (registers, twin labels; no overloaded “process/service/function”).

Consequences (informative)

BenefitWhy it matters
Auditable comparabilityChart + declared normalization (UNM + NormalizationMethods) make “same number” meaningful; silent re‑basings become explicit, reviewable choices.
Safe roll‑upsΓ‑folds with WLNK/COMM/LOC/MONO stop optimistic averaging and preserve invariants.
Pluralism without incoherenceBridges with CL and loss notes allow federation without pretending to global sameness.
RSG‑readyAdmission checklists let RSG states reference CN‑frame‑backed facts (e.g., Ready requires characteristics within bounds).

Rationale (informative)

The CN‑Spec aligns A.19.CN with Part E: it packages Tell‑Show‑Show, Conformance Checklists, and DRR‑backed change, while honouring DevOps Lexical Firewall, Unidirectional Dependency, and Notational Independence so that semantics never depend on tooling. It also operationalises B.3 Trust & Assurance by making CL penalties and WLNK folds first‑class.

Archetypal Grounding (Tell‑Show‑Show)

Same slots, three arenas; no tooling implied. The examples below use plain-language normalization descriptions as placeholders; any normative use must cite A.19.UNM-governed ids/refs (A.19.UNM) and evidence pins (C.16), not invent new terminology here.

Industrial line — Weld‑quality CN‑frame (AssemblyLine_2026)

  • cs_basis: BeadWidth[mm] (target 6.0±0.2), Porosity[ppm] (↓), SeamRate[1/min] (↑ until limit)
  • chart: reference jig, fixture ID, torch type; MethodDescription#Weld_MIG_v3
  • normalization: affine rescale on gray‑level calibration → invariant = physical porosity
  • comparability: normalization‑based (UNM) (calibration tables applied)
  • aggregation: WLNK on quality (min‑bound), COMM on counts, time = per‑shift histograms
  • RSG hook: WelderRole.Ready requires Porosity ≤ 500 ppm & BeadWidth within ±0.2 mm admitted by this CN‑frame.

Software/SRE line — Latency CN‑frame (SREProdClusterEU2026)

  • cs_basis: P50Latency[ms] (↓), P99Latency[ms] (↓), Load[req/s]
  • chart: client vantage, trace sampler v4; MethodDescription#HTTP_probe_v4
  • normalization: monotone time‑warp compensation for collector skew; invariant = percentile order
  • comparability: normalization‑based (UNM) with declared normalization
  • aggregation: MONO on latency (max of mins), WLNK across services
  • RSG hook: DeployerRole.Active gated if P99 < declared SLO over the admission window.

Clinical/episteme line — Trial‑outcome CN‑frame (Cardio_2026)

  • cs_basis:
    • slot_id: ΔBP characteristic: BloodPressureChange scale: { type: ratio, unit: mmHg } polarity: down
    • slot_id: AdverseRate characteristic: AdverseEventRate scale: { type: ratio, unit: "%" } polarity: down
    • slot_id: Age characteristic: Age scale: { type: ratio, unit: years } polarity: neutral
  • chart: cohort definition; MethodDescription#TrialProtocol_v5
  • normalization: case‑mix adjustment (propensity score); invariant = adjusted ΔBP
  • comparability: normalization‑based (UNM) (post‑adjustment)
  • aggregation: LOC on subcohorts; WLNK on safety outcomes
  • RSG hook: EvidenceRole.Validated admission requires CN‑frame acceptance; Assurance pulls CL from any Bridge used.

Worked mini-schemas (entity/relational mixtures across CN‑frames, informative)

To illustrate how CharacteristicSpace is used in practice, below are simplified schema snippets for three typical CN‑frames: an Operations view (run-time state and action gating), an Assurance view (evidence and cross-context comparison), and an Alignment view (design-time consistency across contexts). These examples mix entity-based and relational Characteristics and demonstrate how normalization and bridge references may appear in a model.

Didactic-only note (no data governance). The “schema/table” shapes below are purely explanatory: they show which references must be cite-able for audit and reproducibility. They are not storage requirements, do not prescribe file formats, and do not define the semantics of NormalizationMethod* tokens (see A.19.UNM / C.16).

Operations CN‑frame — Run-time gating & enactment

Entity graph view:

Holder (System) ── playsRoleOf ──> Role@Context ── has ──> RCS (slots…) RSG (Role@Context) ── lists ──> State (◉ status) Checklist (of State) ── testedBy ──> Evaluation ── yields ──> StateAssertion Work ── performedBy ──> RoleAssignment Work ── isExecutionOf ──> MethodDescription

In the above, a Holder (a system instance) plays a Role in some Context, which has an attached RCS (a set of slots defining its characteristic space). That Role’s RSG lists various possible State entries (each state could be, e.g., Ready, Waiting, Degraded, etc.). Each State has a Checklist which is tested by an Evaluation process, resulting in a StateAssertion (pass/fail) at runtime. Meanwhile, Work instances (concrete operations) are performed by the RoleAssignment and correspond to some MethodDescription (procedure). The “gate” for Work is that a StateAssertion for an enactable state must exist.

Relational stub: (illustrating how information might be recorded)

TableKey Columns (essential)
ROLE_ASSIGNMENTRA_ID (PK); HOLDER_ID; ROLE_ID; CONTEXT_ID; WINDOW_FROM, WINDOW_TO
RCS_SNAPSHOTSNAP_ID (PK); RA_ID (FK to ROLE_ASSIGNMENT); WINDOW_FROM, WINDOW_TO; CHAR_ID; VALUE; UNIT; SCALE_TYPE
RSG_STATESTATE_ID (PK); ROLE_ID; CONTEXT_ID; NAME; ENACTABLE (bool)
CHECKLISTCHK_ID (PK); STATE_ID (FK to RSG_STATE); PREDICATE_TYPE; PREDICATE_SPEC
STATE_ASSERTIONSA_ID (PK); RA_ID (FK); STATE_ID (FK); CHK_ID (FK); WINDOW_FROM, WINDOW_TO; VERDICT (pass/fail); NORMALIZATION_INSTANCE_ID?; BRIDGE_ID?
WORKWORK_ID (PK); RA_ID (FK); METHODDESC_ID (FK to MethodDescription); WINDOW_FROM, WINDOW_TO; (other fields like results or references)

In this schema: an RCS snapshot table might log individual coordinate values (VALUE) for each Characteristic (CHAR_ID) in a given RoleAssignment, with their units and scale type noted (to ensure we know what the number means). The StateAssertion ties a RoleAssignment to a state checklist and says whether it passed, including references to any NormalizationMethodInstance or Bridge if cross-context or cross-scale comparisons were involved. The gate logic for enactment can then be a query like: “Is Work W admissible now?” – which joins through ROLE_ASSIGNMENT to find the latest StateAssertion for that RA where ENACTABLE=true and VERDICT=pass.

Assurance CN‑frame — Evidence freshness & mapped comparisons

Entity graph view:

NormalizationMethodInstance ── appliesTo ──> Characteristic (each instance is a scale‑appropriate, monotone transform within UNM) Bridge (ContextB → ContextA) (Alignment Bridge between contexts, with CL and loss notes) StateAssertion ── uses ──> {NormalizationMethodInstance, Bridge} (if a state comparison crossed contexts)

This view highlights that in the assurance context, we keep track of how we mapped or compared states:

  • A NormalizationMethodInstance reference records that an admitted comparison/assertion relied on a declared normalization instance. The admissibility conditions, monotonicity constraints and evidence semantics are governed by A.19.UNM and C.16.
  • A Bridge between Context B and Context A (for corresponding roles or states) carries a CL rating and possibly notes on what is “lost in translation.”
  • A StateAssertion may use a NormalizationMethodInstance or a Bridge, meaning that assertion was reached by translating data via that instance or comparing across that bridge.

Relational stub:

TableKey Columns (essential)
NORMALIZATION_METHODNORMALIZATION_METHOD_ID (PK); KIND (token; see A.19.UNM); DESCRIPTION_REF
NORMALIZATION_INSTANCENORMALIZATION_INSTANCE_ID (PK); NORMALIZATION_METHOD_ID (FK); SRC_CHAR_ID; TGT_CHAR_ID; `FORMULA_SPEC
BRIDGEBRIDGE_ID (PK); FROM_ROLE@CTX; TO_ROLE@CTX; CL (congruence-loss level, e.g. 0–3); NOTES (description of losses/adjustments)
ASSURANCE_EVENTAE_ID (PK); SA_ID (FK to StateAssertion); EFFECT (enum: penalty_applied, evidence_refreshed, etc.); DETAILS

In this stub, NORMALIZATION_INSTANCE records a mapping instance that has to be accounted for when reconstructing an assertion or comparison. The exact meaning of FORMULA_SPEC/VALIDITY_WINDOW/evidence pins is governed by the UNM and evidence patterns (A.19.UNM / C.16); the point here is that the instance is referenceable so audits can follow it. The Bridge table enumerates official Bridges between contexts (for example, bridging a “Ready” state in an engineering context to “Ready” in an operations context, with CL indicating how fully comparable they are). An ASSURANCE_EVENT log could record when a penalty was applied due to a low-CL Bridge or when an assertion was refreshed or invalidated due to new evidence or time lapse.

A.19.CN:8.4.3 Alignment CN‑frame — Design-time reuse of states across Contexts

Entity graph view:

Checklist(ContextA.State) ← pull(N) — Checklist’(ContextB.State’) (pull a checklist via NormalizationMethodInstance N) Refinement π : RSG(Role' ≤ Role) (RSG refinement mapping, e.g. Role' is a subtype of Role)

This view covers how design-time alignment happens:

  • A Checklist’ for a state in Context B can be pulled via a NormalizationMethodInstance into Context A to become a derived Checklist for a state in Context A. This is effectively what we described in the pull operation: using another context’s criteria in your own space.

  • A Refinement π is shown between RSGs indicating Role’ is a specialized role of Role (e.g. a sub-role or a scenario-specific role) and how their states relate (Role’ might have extra states or more granular distinctions). This refinement should maintain that for each state in Role’ that maps to a state in Role, the entails/implication relation holds for enactability.

Relational stub: (illustrating how information might be recorded)

TableKey Columns
RSG_REFINEMENTMAP_ID (PK); ROLEPRIME_ID (FK to Role' in Context B); ROLE_ID (FK to Role in Context A); STATEPRIME_ID (FK to state in Role' RSG); STATE_ID (FK to state in Role RSG); ENTAILS (bool)
CHECKLIST_PULLPULL_ID (PK); SRC_STATE_ID; TGT_STATE_ID; NORMALIZATION_INSTANCE_ID (FK to NormalizationMethodInstance used); VERSION? /* and perhaps timestamp */

In this stub, RSG_REFINEMENT maps states of a sub-role to states of a super-role, with an ENTAILS flag indicating if being in the sub-state guarantees being in the super-state. Every refinement mapping should ensure at least one enactable state in the sub-role corresponds to an enactable state in the super-role (or else the sub-role would allow something the super-role doesn’t – that’s an alignment lint check). The CHECKLIST_PULL table records that a state from one context has had its checklist pulled into another context via a NormalizationMethodInstance (identified by NORMALIZATION_INSTANCE_ID). This is a design-time description saying “State X in context A is defined by applying normalization instance N to State Y in context B’s criteria.” A version or validity field might ensure we know which edition of the checklist or normalization instance was used.

Anti‑patterns (and the fix)

Anti‑patternSymptomWhy it hurtsFix (CN‑Spec slot)
Chartless number“Latency = 120”No unit/vantage → untestableFill cs_basis + chart
Normalization smugglingQuiet “per‑unit” normalisation mid‑streamTrend reversalDeclare UNM normalization references (NormalizationMethodId / NormalizationMethodInstanceId) + named invariants (see A.19.UNM)
Bridge‑by‑nameReusing labels across ContextsFalse comparabilityAuthor Bridge with CL + loss
Free‑hand averagingArithmetic mean on bounded risksViolates WLNKDeclare Γ_fold with WLNK
CN‑frame sprawlTen nearly‑identical CN‑framesCognitive debtUse Registry + DRR; prefer reuse
Role conflationSame person edits CN‑Spec & certifies dataSoD breachEnforce CN‑frameSteward ⊥ CN‑frameCertifier

Didactic quick cards (one‑liners teams reuse)

  1. Numbers travel with their Context. Always cite Context@Edition.
  2. If the normalization is not declared, the trend is fiction.
  3. WLNK beats wishful means. Use weakest‑link folds for safety.
  4. Admit → Assert → Act. (CN‑frame admission → RSG StateAssertion → Method step).
  5. Bridge or bust. Cross‑context = Bridge with CL and loss notes.
  6. Steward writes, Certifier admits. (SoD by design.)
  7. Charts are recipes. Name the MethodDescription that made the number.
  8. Deprecate in the open. CN‑frame cards carry DRR & retirement plans.
  9. Keep characteristics few, meanings sharp. Prefer ≤ 7 characteristics per CN‑frame.
  10. No tooling names in Core. Semantics first; notation later.
  11. Use method/instance IDs; avoid generic “map” nouns. Prefer NormalizationMethodId/NormalizationMethodInstanceId (see the A.19.UNM lexical guard).

SCR / RSCR Harness (acceptance & regression)

These are concept‑level checks; notation‑agnostic.

SCR — Acceptance (first introduction)

  • SCR‑A19.4‑S01 (Completeness). **CN‑Spec has all mandatory slots; cs_basis include unit, scale, and polarity; chart references a MethodDescription.
  • SCR‑A19.4‑S02 (Normalization clarity). normalization cites the UNM mechanism (UNM_id?) and provides the normalization references required by the A.19.UNM governing pattern (methods / invariants / fix, and instances when used). If instances are referenced in assurance logs, their evidence/backing and validity constraints are handled by the governing evidence pattern (C.16), not by A.19.CN.
  • SCR‑A19.4‑S03 (Comparability test). Provide one worked example showing coordinatewise or normalization‑based comparison end‑to‑end (with Evidence Graph Ref).
  • SCR‑A19.4‑S04 (Γ‑fold audit). Aggregation rule spells out WLNK/COMM/LOC/MONO choices; reviewer reconstructs result on a toy set.
  • SCR‑A19.4‑S05 (SoD). Distinct RoleAssignments for CN‑frameStewardRole and CN‑frameCertifierRole exist; windows do not overlap.
  • SCR‑A19.4‑S06 (entityOfConcern & anchors surfaced). For each CN‑Spec characteristic used in the worked example, cite the corresponding CHR Characteristic name and the evidence anchor(s) (A.10) that make the reading observable in this Context.

RSCR — Regression (on change)

  • RSCR‑A19.4‑R01 (UNM edit). On changing normalization (UNM/NormalizationMethod), flag all downstream Bridges for CL re‑assessment; re‑run example comparisons.
  • RSCR‑A19.4‑R02 (Slot surgery/Basis surgery). Adding/removing/renaming slot/basis requires a new edition; old data remain valid for their edition.
  • RSCR‑A19.4‑R03 (Chart drift). Updating measurement protocol bumps edition; historic Work keeps old edition link.
  • RSCR‑A19.4‑R04 (Fold change). Any change to Γ_fold invalidates cached roll‑ups; re‑compute or mark as superseded.
  • RSCR‑A19.4‑R05 (Bridge health). After either side’s edition change, re‑validate Bridge CL and loss notes before accepting Cross‑context data.
  • RSCR‑A19.4‑R06 (Deprecation rule). On deprecating a CN‑frame, Registry lists its successor; bridges re‑targeted or retired.

Interaction summary (wiring to the rest of the kernel)

  • A.2 / A.2.5 (Roles / RSG). RSG checklists quote CN‑Spec.acceptance; enactment gates rely on admitted CN‑frame data.
  • B.1 (Γ‑algebra). CN‑Spec’s Γ_fold instantiates Γ_ctx/Γ_time/WLNK/MONO choices explicitly.
  • B.3 (Assurance). Bridge CL enters the R term; WLNK protects safety roll‑ups.
  • C.6 / C.7 (LOG‑CAL / CHR‑CAL). Units, scales, and measurement templates come from CHR; proofs about folds live in LOG‑CAL.

Minimal CN‑Spec template (copy/paste, informational)

Template note (refs-only). This template shows slot placement for governance. Token semantics for normalization belong to the A.19.UNM governing pattern (A.19.UNM); indicatorization semantics belong to the indicatorization governing pattern (e.g., A.19.UINDM); evidence/backing semantics belong to C.16; legality/evidence gates belong to G.0.

CN‑frame: <Name>      Context: <Context/Edition>
characteristics:
  - <CharacteristicName> : <Unit/Scale>  [Polarity: up|down|target-range]
Chart:
  reference_state: <text>
  coordinate_patch: <domain/subset>
  measurement_protocol_ref: <MethodDescriptionId>
Normalization:
  UNM: <UNMId?>
  methods: [<NormalizationMethodId>… ]
  method_descriptions: [<NormalizationMethodDescriptionRef>… ]
  invariants: [<property>… ]           # what ≡_UNM preserves (token semantics: see A.19.UNM)
  fix?: <NormalizationFixSpec>          # canonical representative of the ≡_UNM class (token semantics: see A.19.UNM)
Indicators (optional):
  policy_ref: <IndicatorChoicePolicyRef>
  resulting_indicators: [<IndicatorId>… ] // selection is policy‑defined; NCVs alone do not make an Indicator (see A.19.UINDM)
Comparability:
  mode: coordinatewise | normalization-based
  minimal_evidence: <what must be observed to compare>  # legality/evidence gate surface (see G.0 and C.16)
Aggregation:
  fold: <Γ_fold expr>   time_policy: <window, statistic>
  WLNK/COMM/LOC/MONO: <declared choices>
Acceptance:
  checklist: [<observable criterion>… ]
  window: <ISO 8601 interval>
  evidence_anchors: [<Observation/Evaluation ids>… ]
Alignment (optional):
  bridges: [<BridgeId, CL, kept/lost characteristics, extra guards>… ]
MaintenanceAndDeprecation:
  source_maintenance_role_assignment: <RoleAssignmentRef>
  DRR_links: [<DRR ids>… ]
  deprecation_plan: <short note>

Implementation note (non‑normative): conceptual audit fields. (For implementation completeness only; not part of the CN‑Spec normative surface.) The goal is auditability: any implementation should be able to cite the relevant refs (CN‑Spec edition, evidence anchors, UNM instance refs, Bridge ids) when producing a StateAssertion. The normative semantics of normalization and evidence/backing are governed by the corresponding mechanism and evidence patterns (e.g., A.19.UNM and C.16). A.19.CN does not prescribe storage formats.

A.19.CN:Close

A.19.CN gives A.19 some teeth: a CN‑Spec you can put on one page, a Registry that stops sprawl, Bridges that carry explicit loss, and a checklist + harness that make comparability auditable. It obeys the mandatory pattern structure of Part E (style, checklists, DRR, guard‑rails) while remaining tool‑agnostic and context‑local.

A.19.CN:End

CHRMechanismSuite

Type: Architectural (A) Status: Stable

PatternId: A.19.CHR Name: CHRMechanismSuite Pattern class: specialization of A.6.7 (MechSuiteDescription) for the CHR (characterization) core.

Introduces / fixes canonical objects and kinds

  • CHRMechanismSuiteDescription (object; kind: MechSuiteDescription): the canonical CHR suite description instance (cited downstream via MechSuiteDescriptionRef, edition-addressable when used as a reproducibility baseline).
  • CHRMechanismSuiteSlotFillingsPlanItem (kind; ⊑ SlotFillingsPlanItem): a suite-specialized plan item kind used as the planned baseline for P2W integration of the CHR suite (selection → WorkPlanning → WorkEnactment).

Depends on

  • A.6.7 MechSuiteDescription (Kernel)
  • A.15.3 SlotFillingsPlanItem (WorkPlanning)
  • A.6.1 U.Mechanism.Intension (mechanism norm-form)
  • A.6.5 slot discipline (SlotSpec := ⟨SlotKind, ValueKind, refMode⟩; SlotIndex is a projection)
  • A.19 CN‑Spec (governance card)
  • G.0 CG‑Spec (legality gate for numeric operations)
  • E.TGA / E.18 (P2W + crossings + UTS/Path pins)
  • E.10 lexical/ontological rules (strict distinction, suffix discipline, minimal specificity)
  • E.19 conformance style (checklist obligations)

Non-goals

  • No “data governance”, no implementation tooling, no “machine readability” requirements.
  • Not a packaging/bundling mechanism (that remains G.10).
  • Not a replacement for MechFamilyDescription (that remains “many implementations of one mechanism intension”).

Problem frame

Part G (and adjacent patterns that operate on measurable slot coordinates, e.g. Q-bundles) repeatedly needs the same lawful characterization core: normalization, indicatorization, scoring, lawful aggregation, comparison, and selection under explicit legality constraints.

In the current corpus, many G patterns interleave:

  • universal CHR legality mechanics (CN‑Spec/CG‑Spec citation, set-return semantics, tri-state uncertainty handling, penalties routing),
  • CG-frame and crossing obligations (ReferencePlane, Bridge-only transport visibility, edition-sensitive pins), and
  • discipline/method/generator specifics (method families, candidate/criteria emitters, packaging concerns),

inside one construct. This mixing makes it hard to universalize Part G, causes drift in defaults and guard semantics, and encourages “hidden tails” (implicit UNM/UINDM/ULSAM or implicit slot filling outside WorkPlanning).

At the same time, the P2W split requires a uniform planned baseline object: selection can choose refs/policies, WorkPlanning can record planned slot fillings, and WorkEnactment can witness FinalizeLaunchValues. Without a canonical planned-baseline WorkPlanning plan item, teams tend to “smuggle” launch values into planning prose or into mechanism descriptions, which breaks auditability and makes crossings and edition sensitivity non-obvious.

Problem

This pattern applies when a workflow (especially in Part G) needs lawful characterization over measurable slots/coordinates (e.g., in Q‑bundles), including normalization, indicatorization, scoring, aggregation, comparison, and selection.

Forces

  • No implicit crossings. Any cross‑context / cross‑plane reuse must be expressed via Bridge-only Transport and visible crossing bundles (UTS/Path pins).
  • CN‑Spec and CG‑Spec must remain the governing spec refs. Mechanisms cite them; mechanisms do not duplicate them.
  • Strict separation of layers. Universal CHR core vs discipline/method specializations vs generators vs packaging.
  • SlotKind invariance. Specialisation chains must preserve SlotKind meaning and only refine ValueKind / strengthen guards/laws.
  • No silent scalarization / totalization. Partial orders must remain set‑valued; any numeric summary is report‑only unless explicitly declared as a lawful comparator/policy.
  • P2W split. Planned slot filling belongs to WorkPlanning; launch values belong to WorkEnactment.

Solution

This pattern defines a single, canonical CHR mechanism suite as a description object (not a mechanism, not a pack), so that:

  1. the CHR core is reusable across all Part‑G patterns (not only G.5),
  2. legality is centralized via spec pins (CN‑Spec, CG‑Spec) and Transport discipline,
  3. P2W integration is made explicit by requiring a standard planned slot fillings plan item in WorkPlanning, while keeping FinalizeLaunchValues exclusively in WorkEnactment.

Core idea: CHRMechanismSuiteDescription := {UNM, UINDM, USCM, ULSAM, CPM, SelectorMechanism} + SuiteObligations + SuiteSpecPins + SuiteProtocols (+ audit obligations).

Pattern-definition map and implementability guard

Tell. CHR mechanisms are implementable only when each described CHR mechanism, suite obligation, protocol, extension block, or decision record names the FPF pattern, section, extension block, or DRR that governs it. The governing definition is citable and patchable by its PatternId, PatternId:SectionPath, PatternScopeId = G.x:Ext.*, or DRRId (E.9).

Where each defined CHR pattern-definition locus is defined (cite, don’t duplicate):

  • see A.19.CHR:4.2.2 for canonical targets.
  • CHR suite boundary (membership + obligations + protocols): A.19.CHR (mechanisms[] declares …IntensionRef; suite_protocols declares order/optionality).
  • Planned baseline binding (instances/editions/policy pins): A.15.3 + A.19.CHR:4.7.2 (refs/pins only; no launch values).
  • SoTA harvesting and method claims: G.2 (pack pattern) and downstream authoring kits (G.3, G.4) — not this suite.
  • Wiring modules for method/discipline/generator specifics: G.*:Extensions as GPatternExtension blocks (PatternScopeId = G.x:Ext.<…>), with explicit GoverningPatternId.
  • RSCR trigger catalogue and trigger alias maps: G.Core (catalogue defined there).
  • Lexical alias docking (token drift without breaking public references): F.18.
  • Project‑level specialization and transduction graphs: project patterns (P.*) for ⊑/⊑⁺ specializations; E.18 (E.TGA) for flow graphs citing planned baseline instance refs.

Objects published by this pattern

CHRMechanismSuiteDescription

A concrete MechSuiteDescription instance whose role is to:

  • enumerate the canonical CHR mechanisms (as U.Mechanism.IntensionRefs),
  • declare suite‑level obligations/invariants,
  • declare suite‑level spec pins (refs only),
  • declare admissible suite protocols (Uses pipelines),
  • require a standard planned baseline plan item (CHRMechanismSuiteSlotFillingsPlanItem) on P2W paths.

Note (non-normative, disambiguation). Kernel A.6.7 already uses CHRMechanismSuiteDescription as an illustrative example of a MechSuiteDescription. This pattern fixes the same-named object as the canonical CHR suite instance and supplies its P2W hook plus conformance envelope.

CHRMechanismSuiteSlotFillingsPlanItem

A SlotFillingsPlanItem specialization used in WorkPlanning to fix the planned baseline of:

  • pinned CN‑Spec / CG‑Spec refs (and editions where required),
  • chosen mechanism instances / method descriptions / comparator specs (refs only),
  • time selector / time rule pins for “no implicit latest”,
  • expected guards (Launch/Compare pins) and expected crossing policy pins,
  • and context identifiers needed for audit traceability (CG‑frame, path slice, publication scope).

It is explicitly not a mechanism, not an admissibility gate, and not a witness of execution.

Canonical mechanism membership

Tell. CHRMechanismSuiteDescription.mechanisms MUST contain the following six mechanism intensions (each published as U.Mechanism.Intension per their governing patterns) and MUST treat them as distinct mechanisms (not “implementations of one”):

  1. UNM — Unified Normalization Mechanism
  2. UINDM — Unified Indicatorization Mechanism
  3. USCM — Unified Scoring Mechanism
  4. ULSAM — Unified Lawful Scale Aggregation Mechanism
  5. CPM — Unified Comparison Mechanism
  6. SelectorMechanism — universal set‑returning selection kernel

Show.

CHRMechanismSuiteDescription.mechanisms :=
  [ UNM.IntensionRef,
    UINDM.IntensionRef,
    USCM.IntensionRef,
    ULSAM.IntensionRef,
    CPM.IntensionRef,
    SelectorMechanism.IntensionRef ]

Membership semantics note (normative). mechanisms denotes a duplicates-free set; order carries no semantics. Any intended ordering is expressed only in suite_protocols.

Rationale. This suite is unified by governance card, legality gate, and Transport discipline (CN‑Spec + CG‑Spec + Transport), not by a single BaseType.

CHR SlotKind Lexicon (suite‑wide minimum)

Tell. To prevent SlotKind drift across the CHR mechanism chain and across SoTA wiring modules, CHR mechanism intensions SHOULD use the SlotKind tokens from this lexicon whenever they refer to the corresponding semantic roles. New SlotKinds MAY be introduced, but only by first extending this lexicon (suite‑governed), then citing the new SlotKind from the affected mechanism card.

Lexicon (minimum). Tokens below are SlotKind names (not types). Concrete ValueKind / RefKind constraints are defined by the governing mechanism card and by A.6.5, A.19, G.0.

  • Core suite SlotKinds

    • CharacteristicSpaceSlot
    • CNSpecSlot
    • CGSpecSlot
    • ContextSlot
  • Indicatorization

    • IndicatorChoicePolicySlot
    • IndicatorSetSlot
    • JustificationSlot
  • Scoring

    • InputProfileSlot
    • ScoreProfileSlot
  • Aggregation

    • MeasureSetSlot
    • GammaFoldSlot
    • GammaTimeRuleSlot (optional)
    • AggregatedMeasureSlot
    • ContributorSetSlot (optional)
  • Comparison

    • LeftProfileSlot
    • RightProfileSlot
    • ComparatorSpecSlot
    • ComparisonResultSlot
  • Selection

    • CandidateSetSlot
    • CriteriaSlot
    • TaskSignatureSlot (optional)
    • SelectionSlot
  • Evidence / legality (optional, policy‑bound)

    • MinimalEvidenceSlot (optional)

Note. This lexicon is intentionally small and role‑based: it constrains naming, not method semantics. Method/discipline specifics belong in SoTA packs (G.2) and wiring‑only GPatternExtension modules, not in the suite core.

Canonical Intension targets (no dangling refs)

Tell. Each …IntensionRef enumerated in CHRMechanismSuiteDescription.mechanisms SHALL resolve to a canonical U.Mechanism.Intension publication under the mechanism’s designated governing pattern (for CHR: the corresponding A.19.<MechId> mechanism-profile pattern). Draft stubs are allowed; dangling refs are not.

Canonical targets (normative anchors).

  • UNM.IntensionRefA.19.UNM
  • UINDM.IntensionRefA.19.UINDM
  • USCM.IntensionRefA.19.USCM
  • ULSAM.IntensionRefA.19.ULSAM
  • CPM.IntensionRefA.19.CPM
  • SelectorMechanism.IntensionRefA.19.SelectorMechanism

Suite obligations

CHRMechanismSuiteDescription.suite_obligations MUST be written using the canonical obligation vocabulary from A.6.7:4.2 and MUST include the following clauses (duplicates-free set semantics; order carries no meaning):

{ bridge_only_crossings, two_bridge_rule_for_described_entity_change, transport_declarative_only, penalties_route_to_r_eff_only, guard_decision_tristate(pass|degrade|abstain), unknown_never_coerces_to_pass, gate_decision_separation, guard_lexeme_reservations, cg_spec_cite_required_for_numeric_ops, no_silent_scalarisation_of_partial_orders, no_silent_totalisation, no_thresholds_in_suite_core, crossing_visibility_required, planned_slot_filling_in_work_planning_only, finalize_launch_values_in_work_enactment_only, implementation_export_discipline_when_cited }.

Crossings, visibility, and penalties
  • bridge_only_crossings: all cross-context and cross-plane reuse is Bridge-only (no implicit crossings).
  • two_bridge_rule_for_described_entity_change: any EntityOfConcern (kind/identity) change (CL^k) is explicit and satisfies the two-bridge rule.
  • transport_declarative_only: the suite does not embed CL/Φ/Ψ/Φ_plane tables and does not introduce any additional graph edge kind beyond E.TGA U.Transfer; it requires only refs/pins/anchors whose realization is mediated by E.TGA / gate surfaces.
  • penalties_route_to_r_eff_only: CL/Φ/Ψ/Φ_plane penalties route to R/R_eff only; F/G are invariant under penalty routing.
  • crossing_visibility_required: any GateCrossing relevant to suite use publishes a CrossingBundle (E.18) and can be cited as an audit anchor (including LaunchGate and edition_key changes of pinned editions{…} vectors).
Guards and gate separation
  • Guard decision tristate: mechanism‑level guards return GuardDecision := {pass | degrade | abstain}.
  • Unknown never coerces to pass: unknown/insufficient evidence MUST map to degrade or abstain, not to pass.
  • Gate decision separation: mechanisms and suite objects MUST NOT publish GateDecision nor DecisionLog. block is gate‑only (OperationalGate(profile)).
  • Guard lexeme reservations: USM.CompareGuard / USM.LaunchGuard are gate‑level pins; mechanism predicates use suffixes …Admissibility / …Eligibility.
Numeric legality and order semantics
  • CG‑Spec citation required: any numeric scoring/aggregation/comparison MUST cite CG‑Spec (SCP + ComparatorSet + MinimalEvidence + Γ_fold + Φ/CL pins), and MUST NOT embed a “shadow CG‑Spec” inside mechanisms/suite.
  • No silent scalarisation of partial orders: partial order comparisons remain set‑valued; any scalar summary is report‑only unless explicitly declared as a lawful comparator/policy.
  • No silent totalisation: absence of totality MUST NOT be hidden by “tie‑breakers” or implicit weights.
P2W discipline
  • Planned slot filling in WorkPlanning only.
  • FinalizeLaunchValues in WorkEnactment only.
  • Suite and plan objects MUST NOT contain launch‑value witnesses.
Thresholds and defaults
  • no_thresholds_in_suite_core: acceptance thresholds live in AcceptanceClauses / TaskSignature / GateProfile, not in CHR suite core.
  • Default discipline (no competing defaults): the suite MUST NOT introduce competing defaults. If a default is used (e.g., PortfolioMode), it MUST be cited from its single declared source (typically a TaskSignature or an explicit policy-id), and all other mentions are citations.
Implementation export discipline (when cited)
  • Suite MAY cite implementations (CAL/LOG/CHR) as refs, but:

    • LOG/CHR do not export Γ,
    • CAL exports exactly one Γ,
    • imports are acyclic.
Routed claim mini-register (A.6.B)

Intent. CHRMechanismSuite is a suite-obligation boundary with a P2W hook. To avoid “contract soup”, the load-bearing statements below are routed as atomic claims per A.6.B and can be cited by IDs instead of being paraphrased across downstream patterns and MVPK faces.

IDQuadrantStatement (atomic; verbatim)Canonical location
L-A67CHR-01LCHRMechanismSuiteDescription.mechanisms denotes a duplicates-free set; order carries no semantics.A.19.CHR:4.2 (Membership semantics note)
L-A67CHR-02LA “planned baseline” is a CHRMechanismSuiteSlotFillingsPlanItem in WorkPlanning that records planned fillers and pins for a P2W path slice.A.19.CHR:4.1.2 / 4.6
L-A67CHR-03LA planned baseline is not an execution witness and contains no launch values.A.19.CHR:4.1.2 / 4.6
A-A67CHR-01AA suite protocol is suite-closed iff every ProtocolStep.mechanism is a member of CHRMechanismSuiteDescription.mechanisms.A.19.CHR:4.5 (WF‑MS‑2)
A-A67CHR-02AA P2W path slice is CHR-suite-ready for enactment iff a planned baseline of kind CHRMechanismSuiteSlotFillingsPlanItem exists for that slice, sets target_slot_bearing_description_ref to an edition-addressable MechSuiteDescriptionRef whose referent is CHRMechanismSuiteDescription, and pins CNSpecRef and CGSpecRef.A.19.CHR:4.6
D-A67CHR-01DSuite authors SHALL publish CHRMechanismSuiteDescription as a MechSuiteDescription instance.A.19.CHR:7.1 (CC‑A67CHR‑1)
D-A67CHR-02DSuite authors SHALL NOT encode CHRMechanismSuiteDescription as a MechFamilyDescription.A.19.CHR:7.1 (CC‑A67CHR‑1)
D-A67CHR-03DSuite authors SHALL enumerate exactly {UNM, UINDM, USCM, ULSAM, CPM, SelectorMechanism} as U.Mechanism.IntensionRefs in CHRMechanismSuiteDescription.mechanisms.A.19.CHR:4.2 / 7.1 (CC‑A67CHR‑2)
D-A67CHR-04DSuite authors SHALL keep CHRMechanismSuiteDescription.suite_spec_pins refs-only.A.19.CHR:4.4 / 7.1 (CC‑A67CHR‑3)
D-A67CHR-05DSuite authors SHALL NOT embed CL/Φ/Ψ/Φ_plane tables or introduce transport edges in CHRMechanismSuiteDescription or CHRMechanismSuiteSlotFillingsPlanItem.A.19.CHR:4.3.1 / 4.4 / 7.2 (CC‑A67CHR‑13)
D-A67CHR-06DWorkPlanning authors SHALL publish one CHRMechanismSuiteSlotFillingsPlanItem per P2W path slice that uses the CHR suite.A.19.CHR:4.6 / 7.2 (CC‑A67CHR‑10)
D-A67CHR-07DWorkPlanning authors SHALL ensure a CHRMechanismSuiteSlotFillingsPlanItem contains planned pins/fillers only.A.19.CHR:7.2 (CC‑A67CHR‑11)
D-A67CHR-08DWorkPlanning authors SHALL NOT include launch values, execution witnesses, gate decisions, or decision logs in a CHRMechanismSuiteSlotFillingsPlanItem.A.19.CHR:7.2 (CC‑A67CHR‑11)
D-A67CHR-09DMVPK face authors SHALL ensure any claimful face that publishes edition pins or comparability/launch claims also publishes the required BridgeCard + UTS row anchors and the applicable USM guard pin with GuardOwnerGateSlot.A.19.CHR:7.3 (CC‑A67CHR‑16)
E-A67CHR-01EEvidence carrier for the planned baseline is the CHRMechanismSuiteSlotFillingsPlanItem instance and its citation from downstream U.Work.Audit as the baseline for the path slice.A.19.CHR:7.2 (CC‑A67CHR‑14)
E-A67CHR-02EEvidence carrier for launch values and FinalizeLaunchValues is U.WorkEnactment (and its audit and evidence carriers), not the planned baseline plan item.A.19.CHR:4.6 / 7.2

Suite spec pins

CHRMechanismSuiteDescription.suite_spec_pins MUST be refs‑only and MUST include:

  1. Required spec refs: {CNSpecRef, CGSpecRef} (as required pins, not copied content).

  2. Required planned baseline: required_planned_baseline_ref := CHRMechanismSuiteSlotFillingsPlanItem (kind‑level requirement: “P2W path MUST publish a planned baseline plan item of this kind”).

  3. Required edition pins / policy pins (when applicable):

    • editions{CG‑Spec, ComparatorSet, UNM.TransportRegistryΦ, …} when the chosen protocol path is edition‑sensitive,
    • policy‑id pins for Φ/Ψ/Φ_plane when crossings are expected.

Tell (discipline). Spec pins are anchors; they do not embed tables (CL ladders, Φ registries) and do not introduce transport edges.

Suite protocols

CHRMechanismSuiteDescription.suite_protocols (if present) MUST follow the A.6.7 SuiteProtocol structure and MUST be closed over suite membership (WF‑MS‑2): every ProtocolStep.mechanism is a member of CHRMechanismSuiteDescription.mechanisms.

If suite_protocols is present, it SHALL include at least one protocol that is equivalent to the canonical suite-closed pipeline below (with fold_Γ explicitly optional).

Show (canonical suite-closed protocol).

normalize (UNM) →
indicatorize (UINDM) →
score (USCM) →
fold_Γ? (ULSAM) →
compare (CPM) →
select (SelectorMechanism)

Tell.

  • The fold_Γ step is optional (explicitly optional, not implicit inside score/compare/select).
  • suite_protocols encodes a pipeline/Uses contour between mechanisms; it does not define a specialisation relation (⊑/⊑⁺). Specialisations live in A.6.1:4.2.1 (and in project P.* extensions).
  • Any publish/telemetry step is outside suite_protocols (to preserve WF‑MS‑2 closure) and is governed by established publication patterns (G.10 and/or PTM), not as “hidden tails” inside CHR mechanisms.

P2W hook: mandatory planned baseline

Tell. Any P2W path that uses CHRMechanismSuiteDescription MUST include a WorkPlanning plan item:

an instance of kind CHRMechanismSuiteSlotFillingsPlanItem (where CHRMechanismSuiteSlotFillingsPlanItem ⊑ SlotFillingsPlanItem)

that acts as the planned baseline for all suite‑level pinned refs/editions/policies used downstream.

This is the mandatory bridge between:

  • selection (G.* set‑return choice of candidates/policies), and
  • WorkEnactment (FinalizeLaunchValues witness + gate execution + logs).

Canonical concept card fragments

CHRMechanismSuiteDescription as a concrete MechSuiteDescription

Show (canonical skeleton; refs only).

CHRMechanismSuiteDescription := ⟨
  mech_suite_id        : MechSuiteId,
  mechanisms           : [UNM.IntensionRef, UINDM.IntensionRef, USCM.IntensionRef,
                          ULSAM.IntensionRef, CPM.IntensionRef, SelectorMechanism.IntensionRef],

  suite_obligations    : SuiteObligations {
                          bridge_only_crossings,
                          two_bridge_rule_for_described_entity_change,
                          transport_declarative_only,
                          penalties_route_to_r_eff_only,
                          guard_decision_tristate(pass|degrade|abstain),
                          unknown_never_coerces_to_pass,
                          gate_decision_separation,
                          guard_lexeme_reservations,
                          no_thresholds_in_suite_core,
                          cg_spec_cite_required_for_numeric_ops,
                          no_silent_scalarisation_of_partial_orders,
                          no_silent_totalisation,
                          crossing_visibility_required,
                          planned_slot_filling_in_work_planning_only,
                          finalize_launch_values_in_work_enactment_only,
                          implementation_export_discipline_when_cited
                        },

  suite_spec_pins  : SuiteSpecPins {
                          required_spec_refs := {CNSpecRef, CGSpecRef},
                          required_planned_baseline_ref := CHRMechanismSuiteSlotFillingsPlanItem,
                          required_edition_pins? := …,
                          required_policy_id_pins? := …
                        },

  suite_protocols?     : SuiteProtocol[*],            // includes the canonical pipeline
  suite_notes?         : …,                            // didactic boundaries + anti-patterns
  suite_audit_obligations? : …                         // UTS+Path pins, crossings visibility, guard governing-pattern assignment
CHRMechanismSuiteSlotFillingsPlanItem as a SlotFillingsPlanItem

Tell. This plan item fixes the planned baseline for suite spec pins and for chosen mechanism/policy refs, within an explicit P2W context.

Required fields (minimum; aligns with A.15.3 naming)

  • target_slot_bearing_description_ref MUST be edition-addressable and MUST reference the CHRMechanismSuiteDescription instance (kind: MechSuiteDescription) via a MechSuiteDescriptionRef@edition(…) (the suite description is the slot-bearing description for this planned baseline).
  • MUST include explicit context anchors:
    • described_entity_ref (a concrete RefKind per C.2.3),
    • bounded_context_ref,
    • cg_frame_ref,
    • reference_plane (unless unambiguously derivable from the cited bounded-context reference and related context records; see A.15.3 context-derivability rule),
    • path_slice_id,
    • publication_scope_id,
    • Γ_time_selector (ByValue) or Γ_time_rule_ref (ByRef) — no implicit “latest”.
  • MAY include expected_usm_guard_pins ⊆ {USM.CompareGuard, USM.LaunchGuard} (planned expectation only; not execution). If expected_usm_guard_pins is present and non-empty, the PlanItem MUST also pin (or make unambiguously derivable) guard_owner_gate_ref required for later aggregation of GuardFail events (A.15.3 guard-governing pattern rule).
  • MUST include planned fillings for (at least) the suite spec pins, expressed as planned_fillings rows keyed by the corresponding SlotKind tokens:
    • CNSpecSlot filled by ByRef(CNSpecRef@edition(…)) (edition‑pinned where required),
    • CGSpecSlot filled by ByRef(CGSpecRef@edition(…)) (edition‑pinned where required), and (when applicable) the chosen method/comparator/mechanism refs as planned fillers (e.g., ScoringMethodDescriptionSlot, ComparatorSpecSlot, …).
  • When crossings are expected, MUST include expected_crossing_policy_refs (refs only): ⟨bridge_card_ref, phi_policy_id, psi_policy_id?, phi_plane_policy_id?, reference_plane(src,tgt)⟩ …, and SHOULD include the corresponding expected_crossing_bundle_refs (refs only) so crossing visibility has an explicit anchor.

Prohibitions

  • MUST NOT contain GateDecision / DecisionLog.
  • MUST NOT contain FinalizeLaunchValues witnesses or launch values.
  • MUST NOT embed CL/Φ/Φ_plane tables; only refs/pins.

Examples

Example — normalization-based comparability with explicit Uses chain

Show.

  • CHRMechanismSuiteDescription is referenced by a G‑pattern (e.g., method selection, parity selection, or lawful publish pipeline).

  • WorkPlanning publishes CHRMechanismSuiteSlotFillingsPlanItem with:

    • pinned CNSpecRef(ed=…), CGSpecRef(ed=…),
    • pinned ComparatorSpecRef(ed=…) (from CG‑Spec.ComparatorSet),
    • pinned ScoringMethodDescriptionRef(ed=…) (e.g., a monotone scoring method),
    • explicit Γ_timeSelector (“point at …”, no implicit “latest”),
    • ExpectedUSMGuards = {USM.CompareGuard, USM.LaunchGuard},
    • expected crossing policy pins for any cross‑context step.

The executed protocol (by E.TGA/P2W) is: Suite-closed protocol: UNM → UINDM → USCM → CPM → SelectorMechanism. Downstream continuation (outside suite_protocols): publication/telemetry via G.10 and/or PTM.

SoTA note (illustrative, non-normative). A ScoringMethodDescription here can represent a post‑2015 monotone model family (e.g., monotone lattice / constrained monotone learning) or a set‑valued scoring family (e.g., conformalized score intervals), as long as legality remains SCP‑bound and uncertainty is handled via tri‑state guards rather than being suppressed into a scalar.

Example — archive PortfolioMode with report-only illumination

Show.

  • The same CHR suite is used, but the selected SelectorMechanism specialization (via G.* extension) returns an Archive retained set.

  • WorkPlanning plan item additionally pins:

    • DescriptorMapRef@edition(…) and DistanceDefRef@edition(…) (QD/illumination configuration),
    • an explicit policy ref that states illumination is report‑only by default,
    • a separate CAL policy‑id if illumination is ever promoted into dominance (never implicit).

SoTA note (illustrative, non-normative). Archive semantics align naturally with quality‑diversity families that matured after 2015 (MAP‑Elites‑class extensions, CMA‑ME‑class, etc.), while the pattern’s “promotion only via policy‑id” prevents an implicit collapse of diversity telemetry into dominance.

Evolution rules

  • Kernel-first stability. This suite is intentionally minimal. Adding a new core CHR mechanism to this kernel suite is a suite-version change and MUST be accompanied by alias docking (F.18) so existing references remain citeable. For exploratory or domain‑specific extra stages, prefer a suite variant (e.g., A.19.CHR+ / A.19.CHR.Extended) or project‑level specializations (patterns P.*) instead of mutating the kernel.
  • Mechanism specializations are not wiring. Domain/project variants are expressed via A.6.1 (⊑/⊑⁺) under their governing pattern (typically a project pattern P.*), not by editing suite membership. The suite binds to …IntensionRef; the planned baseline (A.19.CHR:4.7.2 under A.15.3) chooses concrete instances/specializations.
  • Protocols evolve within the suite boundary. Adding/changing suite protocols (A.19.CHR:4.5) is allowed as long as each protocol remains suite‑closed and does not import publish/telemetry as a mandatory step. If a protocol introduces a new required stage not present in membership, treat it as a suite variant rather than a protocol edit.
  • SoTA harvesting updates methods, not the kernel. Updates from SoTA harvesting/synthesis (G.2) are carried via edition‑pinned MethodDescriptionRef / ComparatorSpecRef selections and wiring modules (G.x:Ext.*), keeping the kernel Intension set stable. If a SoTA update requires changing a mechanism’s signature/laws, the change happens in the governing A.6.1 mechanism card and MUST emit RSCR triggers from G.Core.
  • New mechanism families (outside CHR). Introduce new mechanism kinds as new family-specific patterns under the appropriate mechanism family. If they require suite-level composition and P2W binding, add a corresponding suite pattern A.6.7.<FamilyKey> plus a suite-specific planned baseline specialization of A.15.3, mirroring the governing-pattern assignment routing of this pattern.

U.System vignette (Tell–Show–Show)

Tell. A system-level decision must select a declared set of options when measurable evidence comes from multiple slices (test rigs, simulations, field trials). Measurements are multi-scale and not always comparable without explicit normalization, and some evidence is missing or stale. The team needs lawful comparison and selection without forcing a single scalar “fitness”.

Show. The system’s P2W path cites CHRMechanismSuiteDescription and publishes CHRMechanismSuiteSlotFillingsPlanItem as the planned baseline: CNSpecRef(ed=…), CGSpecRef(ed=…), chosen ComparatorSpecRef(ed=…), chosen ScoringMethodDescriptionRef(ed=…), explicit Γ_timeSelector (point or window), and expected guard pins. WorkEnactment witnesses FinalizeLaunchValues and runs UNM → UINDM → USCM → CPM → SelectorMechanism, returning a selected set under Pareto or Archive mode, while any cross-context reuse is surfaced by Bridge-only crossings and audit pins.

Show. If the team instead embeds normalization inside scoring (“we always normalize to [0,1]”) or collapses a partial order into a single weighted sum, the suite protocol explicitness and “no silent scalarization/totalization” obligations make the violation legible at review time, and the planned baseline cannot honestly pin the missing UNM/ULSAM steps.

U.Episteme vignette (Tell–Show–Show)

Tell. A research episteme compares methodological claims across traditions where some evaluation scales are ordinal (rank-based) and others are interval or ratio. The group wants to select a method family for a task while keeping uncertainty explicit and avoiding illicit aggregation (e.g., averaging ranks).

Show. The episteme’s planned baseline pins CNSpecRef (comparability mode and indicator policy) and CGSpecRef (SCP, ComparatorSet, MinimalEvidence, Γ_fold). The suite runs UINDM to select indicators, USCM to compute lawful score measures under SCP, ULSAM only when Γ_fold is explicitly selected, and CPM to compare without scalarizing partial orders. The selector returns a selected set rather than forcing a single winner.

Show. If a draft evaluation writes “take the mean rank and pick the minimum”, the pattern’s legality discipline forces the author either to (a) re-express the step as a lawful comparator declared in CG‑Spec, or (b) keep the result as report-only telemetry, not a dominance driver.

Bias-Annotation

Lenses tested: Gov, Arch, Onto/Epist, Prag, Did. Scope: Universal for any Part‑G (and adjacent) use of the CHR characterization core via CHRMechanismSuiteDescription and the corresponding P2W planned-baseline WorkPlanning plan item.

  • Gov. Bias toward fail-closed legality and explicit auditability (Bridge-only crossings, pinned spec refs, guard–gate separation). Mitigation: the tri-state GuardDecision allows uncertainty to degrade or abstain without forcing gate-level blocking; exploration can still proceed via explicit SoS‑LOG policy branches.
  • Arch. Bias toward explicit node-level composition (E.TGA) and explicit P2W plan items (SlotFillingsPlanItem). Mitigation: the suite fixes only the universal core; discipline-specific generators and extensions remain separate mechanisms connected by Uses, keeping the suite compact.
  • Onto/Epist. Bias toward a strict separation of CN‑Spec and CG‑Spec spec refs, mechanisms (A.6.1), and planning epistemes (A.15.3). Mitigation: specialization is explicitly supported (⊑/⊑⁺) and does not require inventing new kernel constructs; method diversity is expressed via MethodDescription refs and ComparatorSpec refs.
  • Prag. Bias toward conservative uncertainty handling (unknown does not coerce to pass) may reduce decisiveness. Mitigation: “probe-only” and “sandbox” behaviors are permitted as explicit, audited degrade modes (policy-id + branch-id), not as silent coercions.
  • Did. Bias toward explicit terminology and pins increases authoring surface area. Mitigation: this pattern provides a canonical protocol and a single planned-baseline kind so authors can reuse a stable template rather than re-inventing local prose conventions.

Conformance Checklist

A CHR mechanism-suite publication set is conformant to A.19.CHR iff all applicable items below hold. Where useful, checklist items cite L/A/D/E claim IDs from A.19.CHR:4.3.7 to reduce paraphrase drift.

Suite object checks

CC‑A67CHR‑1 (Correct kind and level). A conforming CHRMechanismSuiteDescription SHALL be a MechSuiteDescription instance and SHALL NOT be encoded as a MechFamilyDescription.

CC‑A67CHR‑1a (Stable citation handle). A conforming CHRMechanismSuiteDescription SHALL include a stable mech_suite_id suitable for downstream planning and U.Work.Audit citation.

CC‑A67CHR‑2 (Canonical membership). A conforming CHRMechanismSuiteDescription SHALL enumerate exactly the six CHR mechanisms (UNM, UINDM, USCM, ULSAM, CPM, SelectorMechanism) as U.Mechanism.IntensionRefs.

CC‑A67CHR‑2a (Membership set semantics). A conforming CHRMechanismSuiteDescription.mechanisms SHALL be duplicates-free and SHALL NOT treat order as semantic (WF‑MS‑1).

CC‑A67CHR‑2b (No dangling IntensionRefs). Each U.Mechanism.IntensionRef enumerated in CHRMechanismSuiteDescription.mechanisms SHALL resolve to a canonical U.Mechanism.Intension publication under the designated governing pattern (draft stubs allowed; dangling refs are not). See A.19.CHR:4.2.2.

CC‑A67CHR‑3 (Governing spec refs are pins, not copies). A conforming CHRMechanismSuiteDescription SHALL cite CN‑Spec and CG‑Spec as required spec refs and SHALL NOT duplicate them as “shadow specs”.

CC‑A67CHR‑3a (Planned-baseline requirement is pinned). A conforming CHRMechanismSuiteDescription SHALL set suite_spec_pins.required_planned_baseline_ref = CHRMechanismSuiteSlotFillingsPlanItem so the P2W seam is enforced by the suite governing spec ref (not by ad hoc prose).

CC‑A67CHR‑4 (Crossing discipline is complete). A conforming CHRMechanismSuiteDescription.suite_obligations SHALL include, at minimum: bridge_only_crossings, two_bridge_rule_for_described_entity_change, transport_declarative_only, penalties_route_to_r_eff_only, guard_decision_tristate(pass|degrade|abstain), unknown_never_coerces_to_pass, gate_decision_separation, guard_lexeme_reservations, cg_spec_cite_required_for_numeric_ops, no_silent_scalarisation_of_partial_orders, no_silent_totalisation, no_thresholds_in_suite_core, crossing_visibility_required, planned_slot_filling_in_work_planning_only, finalize_launch_values_in_work_enactment_only, implementation_export_discipline_when_cited.

CC‑A67CHR‑5 (Guard/gate separation). A conforming CHRMechanismSuiteDescription.suite_obligations SHALL:

  1. enforce tri‑state guard decisions (pass|degrade|abstain),
  2. enforce unknown_never_coerces_to_pass,
  3. enforce guard–gate separation (no GateDecision / DecisionLog at mechanism/suite level; block remains gate‑only), and
  4. enforce guard lexeme reservations (USM.CompareGuard / USM.LaunchGuard are gate-level pins; mechanism predicates use …Admissibility/…Eligibility).

CC‑A67CHR‑6 (No hidden scalarization/totalization). A conforming CHRMechanismSuiteDescription.suite_obligations SHALL include explicit bans on silent scalarization of partial orders and silent totalization.

CC‑A67CHR‑7 (No thresholds in core + single-source defaults). A conforming CHRMechanismSuiteDescription.suite_obligations SHALL include no_thresholds_in_suite_core. If any suite protocol relies on defaults (e.g., PortfolioMode), the suite description and plan items SHALL cite those defaults from their single declared source (typically a TaskSignature or explicit policy-id), and SHALL NOT introduce competing defaults in the suite.

CC‑A67CHR‑8 (Protocol explicitness + closure). If suite_protocols is present, a conforming CHRMechanismSuiteDescription SHALL:

  1. express any dependence as an explicit protocol step (no hidden invocation of UNM/UINDM/ULSAM inside score/compare/select), and
  2. satisfy WF‑MS‑2 (protocol closure): every protocol step cites a mechanism that is a member of the suite.

CC‑A67CHR‑8a (Canonical protocol is available when protocols are published). If suite_protocols is present, a conforming CHRMechanismSuiteDescription SHALL include at least one protocol equivalent to: normalize (UNM) → indicatorize (UINDM) → score (USCM) → fold_Γ? (ULSAM) → compare (CPM) → select (SelectorMechanism), where fold_Γ is explicitly optional. Any publish/telemetry continuation is governed externally (e.g., by G.10 and/or PTM) and MUST NOT be encoded as a ProtocolStep inside suite_protocols (to preserve WF‑MS‑2 closure).

CC‑A67CHR‑9 (Packaging separation). If protocols include publish/telemetry, it is governed by G.10 and/or PTM; the suite does not act as a pack or shipping publication.

Planned baseline checks

CC‑A67CHR‑10 (Planned baseline exists on P2W paths). For each P2W path slice that uses the suite, Authors SHALL provide a CHRMechanismSuiteSlotFillingsPlanItem in WorkPlanning.

CC‑A67CHR‑10a (Correct slot-bearing description). A conforming CHRMechanismSuiteSlotFillingsPlanItem SHALL set target_slot_bearing_description_ref = CHRMechanismSuiteDescriptionRef (edition-addressable when used as a reproducibility baseline).

CC‑A67CHR‑11 (Plan item is baseline, not execution). The plan item contains planned fillers and pins only; it does not contain launch values, execution witnesses, gate decisions, or logs.

CC‑A67CHR‑11a (Minimum P2W context anchors). A conforming CHRMechanismSuiteSlotFillingsPlanItem SHALL include, at minimum: described_entity_ref, bounded_context_ref, cg_frame_ref, path_slice_id, publication_scope_id, and an explicit time selector (Γ_time_selector ByValue or Γ_time_rule_ref ByRef), and SHALL either include reference_plane or make it unambiguously derivable from the cited bounded-context reference and related context records.

CC‑A67CHR‑11b (Planned guard pins and guard governing-pattern assignment). If expected_usm_guard_pins is present in a CHRMechanismSuiteSlotFillingsPlanItem, it SHALL satisfy expected_usm_guard_pins ⊆ {USM.CompareGuard, USM.LaunchGuard}. If expected_usm_guard_pins is present and non-empty, the plan item SHALL also pin (or make unambiguously derivable) guard_owner_gate_ref required for later aggregation of GuardFail events (per the A.15.3 guard-governing pattern rule).

CC‑A67CHR‑11c (Planned spec pins are present). A conforming CHRMechanismSuiteSlotFillingsPlanItem SHALL include planned fillings (refs/pins; no copied content) for, at minimum, SlotKinds CNSpecSlot and CGSpecSlot (filled by edition‑pinned CNSpecRef / CGSpecRef where required by the chosen protocol).

CC‑A67CHR‑12 (Edition/time explicitness). The plan item includes explicit time selector/rule (no implicit “latest”) and includes edition pins where the protocol is edition‑sensitive. Edition pins MAY be carried via edition-addressable refs in planned_fillings and/or via per-row SlotFillingRow.edition_pin (A.15.3 edition-pin rule); they MUST remain pins and anchors, not copied content.

CC‑A67CHR‑13 (Crossing pins are refs-only). Expected crossings are expressed via Bridge/policy refs and ReferencePlane pins; no embedded CL/Φ tables. If expected crossings are listed, expected_crossing_bundle_refs SHOULD be provided (or be unambiguously derivable) so crossing visibility has an explicit audit anchor.

CC‑A67CHR‑14 (Audit traceability). The plan item is citeable from downstream U.Work.Audit as the planned baseline, and deviations (retarget/substitute/assign/update) require a variance trace.

MVPK face checks (when projected)

CC‑A67CHR‑15 (Views do not add meaning). Any TechCard(…) / PlainView(…) projection of the plan item does not introduce new assertions beyond the plan item.

CC‑A67CHR‑16 (Fail-closed pins on claimful faces). If a face publishes edition pins or claims comparability/launch, it MUST also publish the required BridgeCard + UTS row anchors and the appropriate USM guard pin with GuardOwnerGateSlot; otherwise, it is nonconformant (fail‑closed).

Common Anti-Patterns and How to Avoid Them

Anti-patternWhy it failsAvoid / repair
Using MechFamilyDescription as a suite containerCollapses “many implementations of one mechanism” into “many mechanisms”, mixing levels and breaking reuse constraintsUse MechSuiteDescription for multi-mechanism sets; use MechFamilyDescription only for multiple implementations of a single U.Mechanism.Intension
Embedding a second CG‑Spec or CL/Φ/Φ_plane tables inside the suite or plan itemDuplicates the governing spec refs and creates drift between planning, gates, and auditPublish refs and pins only (CGSpecRef, BridgeCardRef, policy-id pins); keep tables in their canonical registries and cite them
Implicit UNM/UINDM/ULSAM “inside” score/compare/selectBreaks auditability and violates the suite protocol explicitness obligationMake dependencies explicit as protocol steps (Uses) and cite the chosen mechanism instances in the planned baseline and audit pins
Hidden thresholds or weights in CHR coreMoves acceptance criteria into the wrong layer, defeating the declared defaults source and traceabilityKeep thresholds in AcceptanceClauses, TaskSignature, or GateProfile; if a policy is needed, mint a policy-id and cite it explicitly
Scalarizing partial orders “for convenience”Violates set-return semantics and hides incomparabilityKeep comparisons set-valued via CPM and selectors set-returning; any scalar summary must be declared as report-only telemetry or as an explicit lawful comparator
Treating planned baseline as a launch witnessSmuggles execution facts into planning and blurs P2W separationRecord planned slot fillings in WorkPlanning; witness FinalizeLaunchValues only in WorkEnactment and cite the plan item as baseline with variance traces
Using CompareGuard / LaunchGuard as mechanism lexemesCollides with reserved gate-level pins and blurs guard vs gate responsibilitiesIn mechanisms use …Eligibility / …Admissibility; reserve USM.CompareGuard and USM.LaunchGuard for gate-visible pins

Consequences

ConsequenceUpsideCost / riskMitigation
One canonical CHR core anchor for Part GUniversalization becomes structurally simpler: G patterns cite one suite and specialize via ⊑/⊑⁺ or UsesUp-front refactoring effortUse the suite as a non-invasive anchor: keep existing method/generator constructs but route them through stable SlotKinds and planned baselines
Explicit P2W planned baselineEliminates hidden slot filling and improves auditability of editions, time selectors, and crossingsAdds a planning plan item per path sliceKeep the plan item minimal (refs and pins only) and project it to views for readability when needed
Tri-state guard semanticsAvoids false precision and prevents unknown from silently passingMore conservative behavior can yield larger selected sets or more abstentionsUse explicit SoS‑LOG degrade branches for probe-only exploration while preserving traceability
Spec pins, not copied spec contentReduces drift and keeps CN‑Spec/CG‑Spec as real centers of gravityRequires discipline in authoring and reviewEnforce “refs-only” at suite/plan level and use conformance items CC‑A67CHR‑3 and CC‑A67CHR‑13 to keep the surface clean

Rationale

This pattern deliberately fixes the CHR core as a description object rather than a new “meta-mechanism” so that:

  1. Level separation stays clean. The suite is a D-episteme that enumerates mechanisms and obligations; the mechanisms remain U.Mechanism.Intension nodes with their own SlotSpecs, laws, guards, transport and audit. This prevents a “god object” that re-implements A.6.1 inside a new container.

  2. Spec refs remain centralized. CN‑Spec and CG‑Spec already define the governance card and legality gate that own comparability, normalization, indicatorization policy, and numeric legality. The suite requires those specs as pins and forbids duplicating them, making “one center of gravity” operational rather than rhetorical.

  3. P2W integration becomes explicit without turning planning into execution. A planned-baseline SlotFillingsPlanItem is the minimal, reusable way to record “what will fill which slots under which CG-frame and path slice” while preserving the rule that only WorkEnactment witnesses launch values.

  4. Uncertainty handling is made safe by construction. Tri-state guard decisions are a minimal guard-decision form that supports admissible abstention and degradation while keeping gate decisions and decision logs in their proper place (OperationalGate(profile)).

In short: governing specs are cited, not copied; plans are declared, not executed; and legality is a first-class surface, not a hidden tail.

SoTA-Echoing

This pattern aligns with several post‑2015 practice lines while adapting them to FPF’s concept-first, spec-ref-pinned discipline.

Practice line (post‑2015)Primary sourceWhat is adopted hereAdoption status
Architecture description standards emphasize explicit viewpoints, explicit views, and view consistency rules.ISO/IEC/IEEE 42010:2022“Views are projections of existing content” is mirrored by MVPK faces that do not add meaning beyond the underlying episteme.Adopt/Adapt: adopt the viewpoint discipline; adapt terminology to FPF’s U.View projections.
Selective classification work formalizes abstention/deferral under uncertainty as a first-class outcome.Geifman & El‑Yaniv (SelectiveNet, 2019)A first-class “abstain/defer” outcome is mirrored by tri-state GuardDecision where unknown does not coerce to pass.Adapt: integrate abstention into guard outputs while keeping gate decisions/logs gate-only (SoS‑LOG for degrade branches).
Quality-diversity research treats diverse retained sets/archives as first-class outputs rather than forcing a single optimum.Pugh, Soros, Stanley (Quality Diversity, 2016)Treating retained sets/archives as primary outputs aligns with set-return selection and Archive mode, with illumination treated as report-only unless promoted by policy-id.Adapt: preserve legality pins and forbid hidden scalarization/totalization; allow promotion only via explicit policy-id.
Open-endedness research emphasizes continual retained-set maintenance and explicit task/environment generation separate from the selector kernel.Wang et al. (POET, 2019)The separation “universal core vs generators via Uses” mirrors the need to keep method/task generation separate from the selector kernel.Adapt: add explicit edition pins and crossing visibility pins so maintenance remains auditable across contexts or planes.

Terminology drift and deltas. Many contemporary sources speak in terms of “pipelines” and “provenance”. FPF’s delta is the explicit separation of (a) planned baseline in WorkPlanning, (b) execution witnesses in WorkEnactment, and (c) audit pins that remain conceptual anchors rather than tooling formats. Where external practice sometimes relies on implicit transfer assumptions, FPF requires cross-context reuse to be explicit as Bridge-only transport with visible pins (BridgeId, CL or CL^k, and the relevant Φ/Ψ/Φ_plane policy-ids), with penalties routed to R_eff only.

Relations

Builds on

  • A.6.7 MechSuiteDescription (the base suite description kind and obligations surface)
  • A.15.3 SlotFillingsPlanItem (planned baseline in WorkPlanning)
  • A.6.1 U.Mechanism.Intension and A.6.5 slot discipline (SlotSpecs in signatures; SlotIndex as projection)
  • A.19 CN‑Spec and G.0 CG‑Spec (governance card and legality gate)
  • E.TGA / E.18 (P2W, crossings, UTS and Path pins)
  • E.10 (lexical and ontological discipline) and E.19 (conformance style)

Coordinates with

  • G.5 (selector semantics, set-return defaults, archive semantics and report-only illumination discipline)
  • G.10 and PTM (publication and telemetry as external steps, not suite internals)
  • A.21 OperationalGate(profile) and USM.Guards (gate-level decisions and reserved guard pins)
  • C.23 SoS‑LOG (explicit degrade branches such as probe-only and sandbox)

Constrains and informs

  • Constrains Part G universalization: G patterns should reference this suite for the universal CHR node set and express method and generator specifics only as (a) explicit specializations (⊑/⊑⁺) or (b) separate provider mechanisms connected via Uses.
  • Informs other kits and suites: any kit or suite that materially participates in selection should provide an analogous …SlotFillingsPlanItem planned baseline, so that the P2W seam remains uniform and auditable.

Notes for Part‑G

Tell. This pattern is intended as a universal core anchor for the Part‑G:

  • G patterns not mixing universal CHR legality mechanics with CG-frame specifics, discipline-specific method content, and packaging concerns in one construct.
  • Instead, they cite CHRMechanismSuiteDescription (universal node set and obligations) and keep specifics in explicit specializations or separate Uses providers.
  • P2W integration is performed uniformly via CHRMechanismSuiteSlotFillingsPlanItem planned baselines, preserving the rule that only WorkEnactment witnesses launch values.

A.19.CHR:End

Unified Normalization Mechanism (UNM)

Type: Architectural (A) Status: Stable Normativity: Normative (unless explicitly marked informative) Placement: Part A / CN‑Spec cluster (A.19) / CHR mechanism-governing patterns Governing-pattern note (Phase‑3 canonicalization): This pattern governs the meaning of UNM.IntensionRef (per E.20). The canonical publication anchor for UNM.IntensionRef remains A.19.UNM, while A.6.1 governs the U.Mechanism.Intension template. Boundary note: The CN_Spec surface itself (incl. CN_Spec.normalization and CN_Spec.comparability) remains governed by A.19.CN; this pattern specifies only UNM’s stable semantic surface and how UNM consumes/interprets the CN‑frame routing fields (no shadow CN‑spec). ID‑continuity: legacy UNM mentions remain valid via Tell + Cite stubs (e.g., cite A.19.UNM:4.1). Canonicalization hook (Phase‑3): Any other location that mentions UNM (including legacy “card fragments”) SHALL be reduced to Tell + Cite and SHALL NOT restate SlotIndex / OperationAlgebra / LawSet / AdmissibilityConditions / Applicability / Transport, Γ_timePolicy, PlaneRegime, and Audit. This is the usability+didactic guard against “scattered semantics”. If someone says “we normalized”, ask (in this order):

  1. Which UNM_id (if applicable) and which NormalizationMethodInstanceId (and its validity window) was used?
  2. Which NormalizationInvariant[*] were declared (i.e., what is preserved)?
  3. Where are the evidence pins and any transport / plane pins (Bridge/CL/ReferencePlane + UNM.TransportRegistryΦ/Phi if invoked)?

Mental model. UNM re‑parameterizes a raw coordinate value (CV) into an NCV under declared invariants and exposes ≡_UNM so downstream steps can be stated as “compare on invariants” explicitly (and audited).

At a glance — didactic, informative

Intent. Provide a single, explicit normalization mechanism for coordinate values in a U.CharacteristicSpace, so that comparability and downstream characterization steps can be stated as “normalize-then-compare” (governance), rather than as hidden arithmetic inside scoring/selection.

Where it sits.

  • CN-frame governance card: CN_Spec.normalization + CN_Spec.comparability.mode route whether comparison is coordinatewise or normalization-based.
  • CHR suite role: stage normalize (first-stage, when enabled by the suite protocol / comparability routing).

Key outputs.

  • NCV (NormalizedCharacteristicValue) values for coordinates.
  • A declared congruence ≡_UNM (equivalence) induced by a chosen normalization method instance.
  • Optionally, an explicit representative selection policy (NormalizationFixSpec, aka “NormalizationFix” in prose) when quotient objects must be presented as concrete chart items.

Two IDs (do not conflate).

  • UNM_id? selects the UNM mechanism instance used by this CN‑frame (a U.Mechanism instance of type UNM; routing/governance level).
  • NormalizationMethodInstanceId selects the normalization method instance applied to specific coordinate(s), with its validity window and evidence pins (method/application level).

Minimum declaration set (didactic).

  • In CN_Spec.comparability: set mode, and (when UNM participates in acceptance/comparison) set minimal_evidence.
  • In CN_Spec.normalization: declare UNM_id?, methods, instances, method_descriptions, invariants, and (if representatives are required) fix.
  • In Audit: cite the chosen NormalizationMethodInstanceId, NormalizationMethodDescriptionRef.edition, declared invariants, validity window, evidence pins, and any Bridge/CL/ReferencePlane pins (plus the edition pin UNM.TransportRegistryΦ/Phi when transport is invoked).

Non-goals.

  • Not indicator selection (that is UINDM).
  • Not scoring, aggregation, comparison, selection (USCM / ULSAM / CPM / SelectorMechanism).
  • Not a data governance system: UNM is a concept-level mechanism with an explicit governing pattern and auditability.

Governing-pattern note (Phase‑3 canonicalization). This pattern is the governing pattern for the canonical U.Mechanism.Intension for UNM.IntensionRef. Other locations that currently carry UNM “card fragments” should be reduced to Tell + Cite stubs pointing here, preserving public IDs/anchors.

Problem frame

FPF needs a disciplined way to talk about measurable slots (coordinates/scales) such that engineers can reason about:

  • What it means to compare values across charts/slices/contexts, and
  • Where the “meaning-preserving” transformations live, so comparisons are lawful and explainable.

In practice, teams routinely face a mismatch between:

  • values that look comparable (“they’re numbers”), and
  • values that are not comparable without normalization (different units, scale types, reference planes, context semantics, or validity windows).

FPF’s CHR family explicitly separates stages (normalize → indicatorize → score → fold → compare → select). UNM is the normalization stage, and its job is to make “compare-on-invariants” explicit and auditable.

Problem

Without an explicit UNM governing pattern:

  1. Normalization drifts into hidden places. It gets embedded inside scoring, comparison, or selection, making legality and governance non-local.

  2. Comparability becomes rhetorical. People say “we normalize” but cannot answer: Which method? Which invariants? Which validity window? Which evidence? Which transport/plane regime?

  3. Cross-context and cross-plane slips become invisible. Teams “reuse” normalizations across contexts without explicit Bridge/CL/ReferencePlane discipline.

  4. Engineers cannot reconstruct the mechanism. When UNM semantics are scattered, the pattern structure (problem/forces/solution) is lost, hurting didactic use by engineering managers.

Forces

ForceTension
Evolvability vs UsabilityStable mechanism surface ↔ method families evolve; single place to read ↔ modular wiring.
Semantic precision vs Cognitive loadFormal invariants/quotients ↔ a mechanism description that engineers can act on.
Governing-pattern discipline vs Cross-cutting realityUNM touches CN, CG, transport, and plane claims ↔ avoid “shadow specs” and duplicate centers of gravity.
Trustworthiness vs Overreach“Normalization is legitimate” must be evidence-backed ↔ UNM must not pretend to define measurement meaning itself.
Locality vs ReuseNormalization is context-local ↔ reuse requires explicit transport declarations (Bridge-only).
Fail-closed safety vs ConvenienceUnknown/insufficient evidence must not coerce ↔ teams want “a number anyway”.

Solution

UNM is a U.Mechanism that normalizes coordinate values using declared method classes, producing:

  • normalized values (NCV),
  • an induced congruence ≡_UNM,
  • and (when needed) a representative policy (NormalizationFix) for quotient objects.

UNM is not a bag of algorithms. It is a canonical semantic surface:

  • Routing lives in CN_Spec.normalization and CN_Spec.comparability.mode.
  • Evidence/calibration legitimacy lives in C.16 (MM‑CHR).
  • Method families can be supplied by SoTA packs and wired via extensions, without mutating UNM’s surface.

Vocabulary (normative)

NormalizationMethodId. A stable token naming a normalization method kind, used in CN_Spec.normalization.methods.

NormalizationMethod. The method kind (class) that defines:

  1. the invariants it preserves (NormalizationInvariant[*]),
  2. its closure rules (composition, and inverses where defined), and
  3. its validity rules (scope / context / time window constraints).

NormalizationMethodDescription. An editioned epistemic description of a normalization method (bounds, validity region/window, scope constraints, and evidence links governed by C.16). NormalizationMethodDescriptionRef. A ref to an editioned NormalizationMethodDescription, used in CN_Spec.normalization.method_descriptions.

NormalizationMethodInstanceId. A stable token naming a concrete, declared application of a normalization method to specific coordinate(s)/slot(s) in a base U.CharacteristicSpace, with a named validity window and (when required) evidence pins. Used in CN_Spec.normalization.instances.

NormalizationMethodInstance. The instance binding itself (conceptual); referenced in specs/logs/gates by NormalizationMethodInstanceId.

CV (CoordinateValue). A raw coordinate value for a named measurable slot in a chart: conceptually ⟨slot_id, raw_value⟩ (plus any chart/slice scoping needed by the chart). UNM re‑parameterizes CV → NCV under declared invariants and validity constraints.

NCV (NormalizedCharacteristicValue). A normalized value for a coordinate (UNM does not “normalize characteristics”; it normalizes coordinate values under declared invariants).

≡_UNM (UNM‑congruence). A context‑local equivalence relation induced by a chosen NormalizationMethodInstance. Two charts (or chart items/views) are ≡_UNM iff they are related by a finite chain of admissible transformations that preserve the declared invariants.

NormalizationInvariant. A named invariant (e.g., unit alignment, polarity, reference plane) declared in CN_Spec.normalization.invariants and/or the selected NormalizationMethodDescription. Preserving the declared NormalizationInvariant[*] is the core admissibility claim for a normalization method instance.

NormalizationFixSpec. A declared policy selecting a canonical representative of a ≡_UNM equivalence class when downstream consumers require a concrete chart item/view. Bound via CN_Spec.normalization.fix (otherwise keep quotient objects abstract). UNM_id. An optional identifier in CN_Spec.normalization.UNM_id? selecting the UNM mechanism instance used by this CN‑frame. This is routing/governance; it is distinct from NormalizationMethodInstanceId (method/application). ValidityWindow. A named validity window attached to a NormalizationMethodInstanceId, bounding where/when the instance is admissible (no implicit “latest”).

UNM.TransportRegistryΦ. An editioned anchor (single‑writer under UNM authoring) that enumerates the declared transport/plane pins and Φ‑penalties used when normalizations are reused across contexts or planes. Referenced via edition pins in suite and flow spec refs; never re‑authored downstream. Alias: UNM.TransportRegistryPhi is an ASCII‑safe alias token (dock via F.18); it is not a competing head.

Lexical guard (strict distinction). Avoid the word map / mapping for UNM transforms (especially Map), because Map is a specialized FPF term and creates ontology drift. Prefer “normalization”, “re‑parameterization”, “transform under invariants”. Legacy κ‑notation for normalization is retired; do not re‑introduce it.

UNM as a U.Mechanism.Intension (normative)

Scope note. This Mechanism.Intension is authored to the U.Mechanism.Intension shape governed by A.6.1. It defines only UNM’s stable semantic surface. It does not bind project pins (editions/policy‑ids), which belong to the P2W seam (A.15.3 + A.19.CHR), and it does not emit GateDecision/GateLog. It may emit tri‑state GuardDecision and Audit pins.

IntensionHeader

  • IntensionId: UNM
  • IntensionRef: UNM.IntensionRef
  • Name: Unified Normalization Mechanism
  • Status: Stable
  • Version: v1.0
  • SuiteRole: CHR.normalize (when enabled by CN/CHR routing)

Imports (cite, don’t duplicate)

  • A.6.1 (shape: U.Mechanism.Intension, specialization discipline)
  • A.6.5 (slot discipline; SlotIndex is a projection)
  • A.19.CHR:4.2 (CHR suite boundary / membership)
  • A.19.CHR:4.2.1 (CHR SlotKind Lexicon)
  • A.19.CHR:4.5 (suite protocols: ordering/optionality; suite closure)
  • A.19.CN (CN-frame routing: normalization, comparability.mode)
  • G.0 (CG-frame legality gates where required downstream)
  • C.16 (evidence carriers; calibration/validity for normalization legitimacy)
  • A.17/A.18 (measurement meaning & scale lawfulness; not redefined here)

SubjectBlock

  • SubjectKind: NormalizationMethod classes (with induced ≡_UNM over charts/views)
  • BaseType: chart/U.CharacteristicSpace family in a CN‑frame (one U.BoundedContext), where normalization acts on coordinate values (CV) for measurable slots (UNM normalizes values, not characteristics)
  • SliceSet: U.ContextSliceSet (context is explicit; no implicit “global normalization”)
  • ExtentRule: “coordinate values admitted for normalization within the declared context and the method instance validity window”
  • ResultKinds:
    • NormalizedCharacteristicValue (NCV)
    • UNM‑congruence (≡_UNM)
    • optional quotient objects and/or Normalization‑fixed representatives (via NormalizationFixSpec)

SlotIndex (derived projection; minimum)

  • CharacteristicSpaceSlot : ⟨ValueKind = U.CharacteristicSpace, refMode = U.CharacteristicSpaceRef⟩
  • CNSpecSlot : ⟨ValueKind = CN‑Spec, refMode = CNSpecRef⟩
  • ContextSlot : ⟨ValueKind = U.BoundedContext, refMode = U.BoundedContextRef⟩

UNM‑specific slots (must be alias‑docked into the CHR SlotKind lexicon if used across the suite):

  • NormalizationMethodInstanceSlot : ⟨ValueKind = NormalizationMethodInstanceId, refMode = ByValue⟩
  • NormalizationMethodDescriptionSlot? : ⟨ValueKind = NormalizationMethodDescription, refMode = NormalizationMethodDescriptionRef⟩
  • NormalizationInvariantSetSlot? : ⟨ValueKind = NormalizationInvariant[*], refMode = ByValue⟩
  • NormalizationMethodInstancePairSlot? : ⟨ValueKind = NormalizationMethodInstanceId[2], refMode = ByValue⟩ (used only by compose; roles = {inner, outer})
  • CoordinateValueSlot : ⟨ValueKind = CV, refMode = ByValue⟩
  • NCVSlot : ⟨ValueKind = NCV, refMode = ByValue⟩
  • UNMCongruenceSlot : ⟨ValueKind = UNM‑congruence (≡_UNM), refMode = ByValue⟩
  • NormalizationFixSlot? : ⟨ValueKind = NormalizationFixSpec, refMode = ByValue⟩

Authoring note (didactic). NormalizationMethodDescriptionSlot, NormalizationInvariantSetSlot, and NormalizationFixSlot are typically resolved/derived from CN_Spec.normalization.{method_descriptions,invariants,fix} plus the selected NormalizationMethodInstanceId. They are listed here because they participate in eligibility/audit semantics — not because every operation takes them as explicit inputs.

Note (transport anchor, not a SlotKind). When transport/plane reuse is invoked, Audit MUST cite the edition pin key UNM.TransportRegistryΦ (aka UNM.TransportRegistryPhi) in the editions vector (see Transport/Audit), rather than introducing an ad‑hoc …Ref kind.

OperationAlgebra (conceptual)

  1. apply
  • Preconditions: UNM_Eligibility(…) ∈ {pass, degrade} (fail‑closed; abstain ⇒ no NCV output).
  • Inputs: NormalizationMethodInstanceSlot, CoordinateValueSlot, CharacteristicSpaceSlot, CNSpecSlot, ContextSlot
  • Outputs: NCVSlot (+ availability of UNMCongruenceSlot for the same method instance)
  1. compose
  • Purpose: build a composed method (only when explicitly declared lawful).
  • Inputs: NormalizationMethodInstancePairSlot (roles = {inner, outer}), ContextSlot
  • Output: NormalizationMethodInstanceSlot (new composed NormalizationMethodInstanceId), with an explicit validity window and evidence pins.
  1. quotient(≡_UNM)
  • Inputs: CharacteristicSpaceSlot (or chart view), NormalizationMethodInstanceSlot
  • Output: quotient object under UNMCongruenceSlot (When a concrete representative is required, NormalizationFixSlot (NormalizationFixSpec) must be declared and used.)

LawSet (UNM laws; identifiers are stable)

  • UNM‑L0 (Values, not characteristics). UNM produces NCV as a value under declared invariants; it does not redefine the underlying characteristic meaning (measurement meaning remains governed by A.17/A.18 and evidence by C.16).
  • UNM‑L1 (Declared method class gate). A normalization method instance is admissible only if its method is declared in the allowed method class set: {ratio:scale, interval:affine, ordinal:monotone, nominal:categorical, tabular:LUT(+uncertainty)}.
  • UNM‑L1a (Method semantics are governed by the method). NormalizationMethod defines invariants, closure (composition / inverses where defined), and validity rules. UNM consumes these declarations; it does not invent “extra” legality.
  • UNM‑L2 (Congruence is first-class). Each chosen method instance induces ≡_UNM over charts/views; equality/comparability decisions that rely on normalization are defined on the quotient (or on a declared fix), not on raw labels.
  • UNM‑L2a (Context-local by default). ≡_UNM is context‑local; cross‑context reuse requires explicit transport declarations (Bridge-only).
  • UNM‑L3 (Fail‑closed). If admissibility/evidence is insufficient (or required inputs are missing/stale), UNM does not silently coerce; it yields abstain or degrade (tri‑state guard discipline) and may surface an explicit freshness/work request (see A.19.UNM:4.5). Didactic reading: abstain ⇒ no lawful NCV/comparability for this slice; degrade ⇒ NCV may be produced but must be treated as policy‑gated and auditable (never “quietly good enough”).
  • UNM‑L4 (No implicit indicatorization). NCV does not imply “indicator”; indicator status is a separate policy step (UINDM).
  • UNM‑L5 (Bridge‑only transport). Cross‑context reuse of normalization requires explicit Bridge-only transport declarations (Bridge id + channel + ReferencePlane(src,tgt)); entityOfConcern changes require a KindBridge (CL^k) and the two‑bridge rule. Penalties route to the R‑lane only (never to F/G; if scalarized, into R_eff).
  • UNM‑L6 (Time explicitness). Validity windows are named; no implicit “latest”.
  • UNM‑L7 (Auditability). The applied method instance, invariants, validity window, evidence pins, and any transport/plane declarations must be auditable as refs/pins.
  • UNM‑L8 (No shadow writers). When UNM publishes/updates editioned anchors used downstream (e.g., UNM.TransportRegistryΦ), other patterns and faces treat them as ref‑only (single‑writer discipline; no competing centers of gravity).
  • UNM‑L9 (No publish/telemetry ops). UNM defines no publish/telemetry step. Any publication/telemetry is out of suite closure and does not mutate UNM semantics (NCV, ≡_UNM, quotient/fix); only Audit pins are produced here.

AdmissibilityConditions Definition (UNM‑Eligibility): UNM_Eligibility(NormalizationMethodInstanceSlot, CoordinateValueSlot, CharacteristicSpaceSlot, CNSpecSlot, ContextSlot) → GuardDecision where GuardDecision ∈ {pass | degrade | abstain} and follows this predicate semantics:

  • pass iff all of the following hold:
    • (CN‑frame binding) the selected NormalizationMethodInstanceId is declared in CN_Spec.normalization.instances (or an equivalent declared surface), its method kind is included in CN_Spec.normalization.methods, and (if present) it satisfies normalization.admissible_reparameterizations;
    • (Target coordinate binding) the input CV’s slot_id belongs to the method instance’s declared bound coordinate set;
    • (Scale‑regime compatibility) the method kind is compatible with the coordinate’s regime (ratio:scale | interval:affine | ordinal:monotone | nominal:categorical | tabular:LUT(+uncertainty)) and preserves the declared NormalizationInvariant[*] (from CN_Spec.normalization.invariants and/or the method description);
    • (Validity window) the method instance’s validity window covers the active slice/time policy (no implicit “latest”);
    • (Evidence sufficiency when routed into governance) when comparability.mode = normalization-based (or downstream uses NCV in gated decisions), the method instance’s evidence pins satisfy CN_Spec.comparability.minimal_evidence (structure typically gated by G.0; evidence semantics governed by C.16).
  • degrade iff all non‑evidence conditions above hold, but the evidence check does not pass and the declared failure behavior permits producing a policy‑gated degraded NCV rather than abstaining.
  • abstain otherwise (including missing binding, coordinate mismatch, out‑of‑window validity, or evidence failure when the declared failure behavior is abstain).

Applicability UNM is applicable when:

  • CN_Spec.comparability.mode = normalization-based, or
  • a declared downstream step requires “compare-on-invariants” and thus requires explicit normalization. UNM is typically skipped when comparability.mode = coordinatewise (unless an explicit downstream step requires a declared quotient/fix anyway).

Transport

  • Bridge-only. Any cross-context use must be expressed via explicit Bridge pins and recorded in Audit.
  • If the entityOfConcern changes, a KindBridge (CL^k) must be declared (two‑bridge rule).
  • If transport/plane reuse is invoked, the edition pin key UNM.TransportRegistryΦ (aka UNM.TransportRegistryPhi) MUST be cited explicitly (in addition to Bridge/CL/ReferencePlane pins); penalties remain R‑lane only.

Γ_timePolicy

  • Default: point (no implicit “latest”).
  • If normalization relies on time windows, the validity window is part of the method instance and must be declared.

PlaneRegime

  • Normalized values live on the episteme ReferencePlane by default.
  • Plane crossings require explicit CL^plane and are audited; penalties route to R_eff only.

Audit Audit records MUST include:

  • CNSpecRef.edition + comparability.mode
  • (when present) CN_Spec.normalization.UNM_id (the selected UNM mechanism instance id for this CN‑frame)
  • chosen NormalizationMethodInstanceId, its validity window, and any NormalizationMethodDescriptionRef.edition
  • declared NormalizationInvariant[*] and NormalizationFixSpec (if used)
  • any declared admissible re‑parameterizations (if present in CN‑Spec.normalization)
  • all evidence pins (as declared by the instance) and their scope ids
  • any Bridge/CL/ReferencePlane pins if transport or plane crossings are invoked, plus the edition pin key UNM.TransportRegistryΦ/Phi
  • any emitted FreshnessRequest / work request identifiers (when applicable; see A.19.UNM:4.5)

CN-frame wiring: normalization and comparability routing (normative-by-reference)

Tell. CN-frame does not “do normalization”; it routes normalization.

  • comparability.mode ∈ {coordinatewise, normalization-based} governs whether comparisons are done directly or “normalize-then-compare”.
  • normalization.UNM_id? selects the UNM mechanism instance used by this CN-frame.
  • normalization.methods / instances / method_descriptions / invariants / fix provide the declared surface that UNM consumes. (If present) normalization.admissible_reparameterizations constrain which re‑parameterizations count as “admissible” under the declared invariants. (See CN-frame definition in A.19.CN; A.19.CN remains the governing pattern of the CN-frame surface. This section only states the UNM consumption/interpretation constraints and does not introduce a shadow spec.)

Evidence and calibration are governed by MM‑CHR (normative-by-reference)

UNM does not claim “this normalization is legitimate” by decree. Instead, the legitimacy claim is supported by evidence carriers, calibration records, and validity records governed by C.16 (MM‑CHR) and referenced from the chosen NormalizationMethodInstance.

Didactic rule: quotients or fixes, never “labels” (normative)

When UNM is used to support comparability/acceptance:

  • Think in invariants and equivalence classes (quotients), not in labels.
  • If a concrete representative is needed, declare a NormalizationFix explicitly. Do not silently treat an arbitrary representative as canonical.

P2W / TGA integration note (normative-by-reference)

When UNM is used inside transduction flows/graphs (e.g., E.18 (E.TGA)):

  • UNM occurs before selection/decision steps.
  • If required measurements are missing or stale, UNM does not “guess a number”; it surfaces an explicit freshness/work request that must be planned in U.WorkPlanning and executed in U.WorkEnactment.
  • In TGA terms, transport/plane reuse is surfaced as explicit calibration records and transport-policy records pinned to TransportRegistry^Φ (editioned as UNM.TransportRegistryΦ; penalties stay R‑lane only).
  • Editioned anchors referenced by faces downstream (e.g., UNM.TransportRegistryΦ, and legality anchors when applicable) remain single‑writer: downstream consumers cite them as refs and do not re‑author them.

Archetypal Grounding (Tell–Show–Show)

Tell. UNM is the conceptual “front gate” that turns “raw coordinate values” into “values comparable under declared invariants”, by:

  1. choosing an admissible normalization method instance (with evidence and validity window),
  2. applying it to produce NCVs,
  3. exposing ≡_UNM and (optionally) quotient/fix structure so downstream mechanisms can remain lawful and explicit.

Show (System). A team compares alternatives using normalization-based comparability:

  • CN-Spec declares:
    • comparability.mode = normalization-based
    • normalization.invariants = {unit-alignment, polarity}
    • a method instance M_unitScale with validity window VW_2026Q1 and evidence pins.
  • UNM applies M_unitScale to each coordinate value, producing NCVs.
  • CPM compares the NCV-profiles (not raw profiles).
  • If evidence pins are missing for a slice, UNM returns GuardDecision = abstain, preventing “fake comparability”.

Show (Episteme). Quotient thinking:

  • Two chart items x and y are different raw values (different units or reference planes).
  • Under a chosen normalization method instance, x ≡_UNM y holds.
  • Comparability claims are made over [x]_{≡_UNM} and [y]_{≡_UNM} (equivalence classes).
  • If reporting needs a single representative, a declared NormalizationFix selects it; otherwise, do not pretend a representative is canonical.

Show (P2W / TGA). Missing/stale inputs:

  • A selector (or comparator) requires comparability under normalization-based mode.
  • UNM finds that a required coordinate value is missing/stale for the current slice and the instance validity window.
  • UNM returns GuardDecision = abstain (fail‑closed) and emits a FreshnessRequest that must be handled via planned baseline + enactment (UNM does not silently proceed).

Bias‑Annotation

Common cognitive traps around normalization:

  • Normalization-as-truth bias: treating NCVs as “objective” instead of “objective under declared invariants and validity window”.
  • Hidden-steps bias: assuming normalization “happened somewhere” and skipping explicit routing/pins.
  • Unit-blindness: treating numeric sameness as semantic sameness.
  • Proxy legitimacy: assuming a popular method is legitimate without evidence pins or validity region.

Mitigation: enforce explicit NormalizationMethodInstance + validity window + evidence pins; and keep ≡_UNM/quotient semantics explicit.

Conformance Checklist

  • Template compliance: canonical E.8 sections 1–13 present in order; pattern ends with ### A.19.UNM:End.
  • Terminology: uses NormalizationMethodId, NormalizationMethodInstanceId, NormalizationMethodDescription(Ref), CV, NCV, ≡_UNM, NormalizationInvariant[*], NormalizationFixSpec; avoids “map” wording (esp. Map); κ‑notation is retired.
  • CN routing: uses CN_Spec.comparability.mode and the CN_Spec.normalization surface; does not embed “shadow CN-spec”.
  • Fail-closed: eligibility is tri-state and never coerces unknown to pass.
  • Legality classes declared: method class is one of {ratio:scale, interval:affine, ordinal:monotone, nominal:categorical, tabular:LUT(+uncertainty)} and the instance’s validity window is named.
  • No indicator conflation: does not treat NCV as automatically implying indicator status.
  • Transport discipline: cross-context or cross-plane reuse is Bridge-only, explicit, audited; penalties route to R/R_eff only.
  • Quotient/fix discipline: if a representative is required, NormalizationFix is declared; otherwise quotient semantics remain abstract.
  • Auditability: method instance, validity window, evidence pins, and transport/plane policies are recorded as refs/pins.
  • No shadow writers: if editioned transport/calibration anchors are used (e.g., UNM.TransportRegistryΦ), downstream consumers treat them as ref‑only (single‑writer discipline).
  • P2W awareness (when used in flows): missing/stale inputs lead to explicit FreshnessRequest emissions (planned via P2W), not silent coercion.
  • SlotKind discipline: SlotKind tokens reuse the CHR SlotKind lexicon where applicable; UNM‑specific SlotKinds are docked into the suite lexicon before use (no ad‑hoc drift).
  • TransportRegistry key discipline: UNM.TransportRegistryΦ (alias UNM.TransportRegistryPhi) is referenced as an edition pin key (and audited) / TransportRegistry^Φ in TGA terms, not introduced as a new …Ref kind.

Common Anti‑Patterns and How to Avoid Them

  1. Hidden normalization inside scoring or selection Avoid by using CN_Spec.comparability.mode and explicit UNM use.

  2. “NCV ⇒ indicator” shortcut Avoid by treating indicatorization as UINDM policy, not a byproduct of normalization.

  3. “We normalized” without declaring invariants Avoid by naming NormalizationInvariant[*] and exposing ≡_UNM.

  4. Cross-context reuse without transport declaration Avoid by Bridge-only transport and auditing Bridge/CL/ReferencePlane pins.

  5. Choosing a representative implicitly Avoid by either keeping quotient objects abstract or declaring NormalizationFix.

  6. Using “map/mapping/Map” language as if it were harmless Avoid by using “normalization / re‑parameterization under invariants” and by keeping Map for its specialized FPF meaning.

  7. Treating UNM outputs as globally comparable across contexts or planes Avoid by Bridge-only transport declarations + audited ReferencePlane/CL pins; otherwise stay context-local and fail‑closed.

  8. Re‑authoring editioned transport/calibration anchors downstream Avoid by treating UNM.TransportRegistryΦ (and similar anchors) as single-writer editioned anchors: downstream is ref‑only.

Consequences

Benefits

  • Makes “normalize-then-compare” a first-class governance choice.
  • Centralizes governing-pattern assignment, improving usability and reducing drift.
  • Supports evolvability: method families can evolve via packs/extensions without mutating the mechanism surface.
  • Prevents silent illegality (unit, scale, and plane errors) by fail-closed guards.

Costs

  • Requires explicit declarations (method instance, invariants, validity window, evidence pins).
  • Some workflows must learn quotient/fix thinking (a conceptual overhead).

Rationale

UNM is designed as a minimal canonical semantic surface:

  • Enough structure to prevent illegal comparisons and hidden transformations.
  • Explicit routing in CN-frame so normalization is governance, not an algorithmic trick.
  • Evidence/calibration are delegated to MM‑CHR to avoid redefining measurement meaning.
  • Bridge-only transport prevents accidental “global normalization” across contexts.

This balances evolvability (methods evolve) with didactic usability (one place to read what UNM is).

SoTA‑Echoing (post‑2015 practice alignment)

UNM does not prescribe algorithms, but it is designed to wire in SoTA normalization families via NormalizationMethodDescriptionRef + evidence pins (typically shipped as G.2 SoTA packs and wired via GPatternExtension modules, not as mutations of UNM’s surface). Examples of post‑2015 method families that often appear as evidence-backed normalization candidates (domain-dependent):

  • SoTA ≠ popular. Method families enter UNM through G.2 claim structures + edition pins + evidence pins; “widely used” is not a validity claim by itself.
  • Calibration of probabilistic coordinates (e.g., temperature scaling; multiclass calibration families such as Dirichlet calibration). Typical citations: Guo et al., 2017; Kull et al., 2019.
  • Shift-/validity-region-aware normalization where “validity window/region” is explicit and shift detection enters as evidence, not as hidden branching. Typical citations: Lipton et al., 2018 (shift estimation); Ovadia et al., 2019 (uncertainty under shift) — as evidence motifs.
  • Order-preserving transforms for ordinal regimes (normalization constrained to monotone transforms; legality forbids arithmetic). Typical citations: modern monotonic modeling toolkits (post‑2017) used as method families, not as silent arithmetic.
  • Set-valued / uncertainty-aware normalization outputs where uncertainty is preserved as a first-class outcome (tri‑state guards + set-valued uncertainty carriers, rather than coerced point values). Typical citations: conformal-style families (post‑2018+) used as evidence/uncertainty carriers.

SoTA is connected as wiring (packs/extensions) while UNM’s surface remains stable.

Relations

Builds on / cites

  • E.8 (pattern template)
  • E.20 (governing-pattern discipline for mechanism‑intension content)
  • A.15.3 (P2W planned baseline seam, when UNM is used in flows)
  • F.18 (alias docking / token continuity, when renaming or retiring legacy UNM tokens)
  • A.6.1 (U.Mechanism.Intension shape; specialization discipline)
  • A.19.CHR (CHR suite boundary; slot lexicon; suite protocols)
  • A.19.CN (CN_Spec normalization + comparability routing)
  • C.16 (MM‑CHR evidence/calibration carriers)
  • G.0 (CG-frame legality gates used downstream)
  • G.2 (SoTA synthesis packs as the method‑family ingress; wiring‑only integration)
  • E.18 (E.TGA) (when UNM is used in transduction flows/graphs; P2W freshness/work routing)
  • B.3 (congruence/quotient intuition, when referenced)

Used by

  • CHR suite protocols (normalize stage), when comparability.mode requires normalization-based comparability.

A.19.UNM:End

Unified Indicatorization Mechanism (UINDM)

Type: Architectural (A) Status: Stable Normativity: Normative (unless explicitly marked informative) Placement: Part A / CN‑Spec cluster (A.19) / CHR mechanism-governing patterns (Phase‑3) Source: FPF / CHR Phase‑3 mechanism-governing patterns Modified: 2026‑01‑19

Governing-pattern note (Phase‑3 canonicalization): this pattern governs the canonical U.Mechanism.Intension for UINDM.IntensionRef (CHR suite stage indicatorize). Mechanism-intension semantics are governed by A.19.<MechId>. A.6.1 governs the template of U.Mechanism.Intension.

Canonicalization hook (ID‑continuity‑safe): any other appearances of the UINDM intension (e.g., a legacy grounding stub in A.6.1 or suite prose in A.19.CHR) SHALL be reduced to a Tell + Cite stub pointing to A.19.UINDM:4.1, while preserving the original section headings and their public PatternId:SectionPath IDs for continuity (alias‑dock legacy tokens rather than deleting them). Such stubs MUST NOT restate SlotIndex / LawSet / Admissibility content (no “second center of gravity” via near‑duplicate prose).

At a glance (didactic, informative)

  • Suite stage: indicatorize (ordering lives only in A.19.CHR:suite_protocols).
  • Inputs (conceptual): base U.CharacteristicSpaceRef + CNSpecRef + IndicatorChoicePolicyRef + U.BoundedContextRef, with optional CGSpecRef (+ optional MinimalEvidenceRef override) when the chosen policy is evidence‑gated.
  • Output: IndicatorSetSlot = a set of U.CharacteristicRef (chosen coordinates), not measurements.
  • Non‑goals: does not normalize, score, compare, aggregate, threshold, publish, or emit telemetry; it only selects a subset under explicit policy.
  • P2W seam: concrete edition/policy pins are bound in planned baseline plan items (A.15.3 + A.19.CHR:4.7.2); executions only record effective refs/pins in Audit.
  • Failure mode: tri‑state guard (pass|degrade|abstain); unknown never coerces to pass.
  • Quick rule of thumb: if CN‑Spec.indicator_policy is absent → IndicatorizeEligibility = abstain (fail‑closed); if the selected policy is evidence‑gated → CGSpecRef MUST be available and the effective MinimalEvidence MUST be explicit (override or CG‑Spec.MinimalEvidence).

Problem frame

FPF’s Characterization (CHR) suite treats indicatorization as a distinct mechanism boundary within the CHR suite (authoritative membership: A.19.CHR:4.2). Suite membership is a set (order has no semantics); any intended ordering is expressed only via suite_protocols (A.19.CHR:4.5), under the suite obligations (A.19.CHR:4.3).

Within the canonical suite‑closed protocol, UINDM appears as the indicatorize stage (after normalize, before score/compare/select; optional stages remain explicitly optional per suite_protocols).

UINDM’s job is concept‑level and governed by CN‑Spec and CG‑Spec: it selects an indicator subset over an existing U.CharacteristicSpace under CN‑Spec.indicator_policy, using the suite-wide SlotKind lexicon to prevent SlotKind drift across the CHR mechanism chain and across SoTA wiring modules. A “subspace view” (if needed) is treated as a derived support view over the chosen set (see A.19.UINDM:4.2), not as an extra mandatory output of the kernel signature.

Problem

Engineering teams routinely need to decide “which characteristics count as indicators” for a CN‑frame—before they can score, compare, aggregate, or select. If indicatorization is not given a first‑class mechanism boundary, several failure modes emerge:

  • Hidden indicatorization: downstream mechanisms (scoring/comparison/selection) implicitly decide which characteristics matter, making the CHR pipeline opaque and hard to audit.
  • NCV conflation: measurability (or “having an NCV”) is treated as sufficient to be an indicator, collapsing the crucial distinction between “measurable characteristic” and “indicator chosen under policy.”
  • Drift and non‑determinism: indicator sets vary between teams and contexts without stable edition pins, making comparisons and decisions irreproducible.
  • Silent evidence coercion: missing/unknown evidence is implicitly treated as acceptable (“pass”) or collapsed to an empty set, degrading decision quality without visibility.

Forces

  1. Policy primacy vs method freedom. Indicatorization must be governed by explicit IndicatorChoicePolicy, while still allowing multiple method families (e.g., theory‑first, invariance‑driven, evidence‑gated) to be wired later without mutating the mechanism’s signature.

  2. Selection‑only vs “semantic alchemy.” UINDM must not smuggle normalization, scaling, polarity flips, aggregation, or scoring inside “indicator choice.” It is a selection mechanism over the declared characteristic-space basis, not a transformation mechanism.

  3. Context locality vs cross‑context reuse. Indicatorization is slice‑bound; cross‑context indicatorization is permitted only when an explicit Transport clause (Bridge+CL/ReferencePlane) is present—otherwise implicit crossings destroy semantic precision.

  4. Auditability vs authoring overhead. Engineer‑managers need to see why an indicator set was chosen and which editions/policies were in effect, but FPF stays conceptual (no data governance, no tool‑enforced metadata). Audit obligations must therefore be minimal yet decisive.

  5. Evolvability vs didactic usability. CHR mechanisms must remain evolvable (stable slot lexicon; method specifics in SoTA packs / wiring), while the spec must remain teachable: a reader should find UINDM’s purpose, boundary, laws, guard behavior, and audit obligations in one place.

  6. Fail‑closed discipline. Unknown/insufficient evidence must never be coerced into “pass”; tri‑state guards (pass|degrade|abstain) are required to preserve correctness under uncertainty.

  7. P2W separation and gate/guard separation. UINDM must expose eligibility and audit pins without turning into (i) a WorkPlanning baseline binder or (ii) a legality gate: planned slot fillings belong to WorkPlanning plan items, while GateDecision/GateLog live in gate patterns / WorkEnactment (suite protocols remain mechanism‑steps only).

Solution

UINDM is the canonical indicatorization mechanism in the CHR suite. It defines:

  • a stable mechanism boundary (“indicatorize” is a stage with its own operation and eligibility predicate),
  • a stable SlotKind surface (via the suite lexicon),
  • a strict selection‑only law set (no implicit UNM; no unit, scale, or polarity changes),
  • a tri‑state admissibility guard (fail‑closed on missing policy, legality, or evidence), and
  • an audit minimum (edition pins + crossing policy ids when transport occurs).

UINDM also preserves the CHR suite obligations by construction: it does not embed GateDecision/GateLog, it does not perform publish/telemetry steps, and it keeps Transport declarative (refs/pins only).

Method semantics (“how to pick indicators”) remain out of suite core: they belong in SoTA packs (G.2) and wiring‑only extension modules (GPatternExtension blocks), while UINDM remains the stable mechanism boundary.

Mechanism.Intension (normative)

This is the canonical U.Mechanism.Intension for UINDM.IntensionRef and is intended to be cited by CHR suite publications and by any wiring layers.

  • Scope note: this intension is an instance authored to the U.Mechanism.Intension shape governed by A.6.1. It defines only the mechanism’s semantic surface (slots/ops/laws/guards/audit). It does not bind project‑specific pins (P2W), and it does not emit GateDecision/GateLog; it emits Audit pins and a tri‑state guard only.

  • IntensionHeader: id = UINDM, version = 1.0.0, status = stable.

  • IntensionRef: UINDM.IntensionRef (canonical target for the suite member named in A.19.CHR:4.2).

  • Tell. Policy‑bound indicatorization: select an indicator subset over an existing U.CharacteristicSpace under CN‑Spec.indicator_policy.

  • Purpose: freeze a policy‑bound indicator subset early so downstream CHR mechanisms can assume a declared indicator profile (or explicitly degrade/abstain) rather than silently “choosing indicators” inside scoring/comparison/selection.

  • Imports: A.19.CN (CN‑Spec.indicator_policy), A.6.5 (slot discipline), A.19.CHR:4.2.1 (CHR SlotKind Lexicon), and (when evidence‑gated) G.0 (CG‑Spec.MinimalEvidence).

  • SubjectBlock:

    • SubjectKind: Indicatorization.
    • BaseType: U.CharacteristicSpace.
    • SliceSet: U.ContextSliceSet.
    • ExtentRule: indicatorization ranges over the declared characteristic-space basis CNSpecSlot.cs_basis (within CNSpecSlot.chart) for the active Context slice; it never enlarges the declared characteristic-space basis.
    • ResultKind?: U.Set.
  • SlotIndex (derived projection from SlotSpecs / guard SlotSpecs; uses A.19.CHR:4.2.1 SlotKind tokens; no independent semantics):

    • CharacteristicSpaceSlot : ⟨ValueKind = U.CharacteristicSpace, refMode = CharacteristicSpaceRef⟩,
    • CNSpecSlot : ⟨ValueKind = CN‑Spec, refMode = CNSpecRef⟩,
    • IndicatorChoicePolicySlot : ⟨ValueKind = IndicatorChoicePolicy, refMode = IndicatorChoicePolicyRef⟩,
    • ContextSlot : ⟨ValueKind = U.BoundedContext, refMode = U.BoundedContextRef⟩,
    • CGSpecSlot? : ⟨ValueKind = CG‑Spec, refMode = CGSpecRef⟩ (optional; REQUIRED iff the chosen IndicatorChoicePolicy is evidence‑gated),
    • MinimalEvidenceSlot? : ⟨ValueKind = MinimalEvidence, refMode = MinimalEvidenceRef⟩ (optional override; if evidence‑gated and omitted, the effective MinimalEvidence is CGSpecSlot.MinimalEvidence),
    • IndicatorSetSlot : ⟨ValueKind = U.Set (of U.CharacteristicRef), refMode = ByValue⟩.
  • OperationAlgebra (suite stage = indicatorize, per A.19.CHR:4.5; canonical stage‑op = Indicatorize):

    • Indicatorize(CharacteristicSpaceSlot, CNSpecSlot, IndicatorChoicePolicySlot, ContextSlot, CGSpecSlot?, MinimalEvidenceSlot?) → IndicatorSetSlot.
  • LawSet (CHR‑lawful indicatorization):

    1. Selection‑only: Indicatorize MUST NOT alter units, scales, and polarities; it only selects a subset (no implicit UNM).
    2. Declared-basis restriction: the resulting set MUST be a subset of the declared characteristic-space basis (as constrained by CNSpecSlot.cs_basis and CNSpecSlot.chart).
    3. No implicit NCV⇒indicator: measurability/NCV is not sufficient; indicators exist only via IndicatorChoicePolicySlot (cites A.19.CN indicator_policy).
    4. Edition‑determinism (with slice locality): for fixed editions of all ByRef inputs (CharacteristicSpaceRef, CNSpecRef, IndicatorChoicePolicyRef, and—when evidence‑gated—CGSpecRef plus optional MinimalEvidenceRef) and a fixed active Context slice, the IndicatorSetSlot result is stable.
    5. No silent evidence coercion: if evidence is insufficient/unknown under the chosen policy, the result MUST NOT be “silently emptied” nor silently treated as “pass”; use tri‑state guards.
  • AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality/evidence):

    • IndicatorizeEligibility(CharacteristicSpaceSlot, CNSpecSlot, IndicatorChoicePolicySlot, ContextSlot, CGSpecSlot?, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.
    • pass requires: (i) CNSpecSlot.indicator_policy is present, (ii) IndicatorChoicePolicySlot is consistent with that policy reference (same …PolicyRef + edition pins), and (iii) CharacteristicSpaceSlot matches the declared characteristic-space basis implied by CNSpecSlot (within the active chart and Context slice).
    • If the chosen IndicatorChoicePolicy is evidence‑gated: (i) CGSpecSlot MUST be present, (ii) define EffectiveMinimalEvidence := (MinimalEvidenceSlot if present, else CGSpecSlot.MinimalEvidence), and (iii) insufficient/unknown evidence MUST yield degrade or abstain per the effective failure‑behavior policy (never a silent pass).
    • If the chosen IndicatorChoicePolicy is not evidence‑gated, absence of MinimalEvidenceSlot MUST NOT affect eligibility; no accidental “always‑evidence‑gated” behavior is permitted.
  • Applicability:

    • Intended to be used before any scoring/comparison/selection that assumes an indicator profile, while remaining a distinct step (no hidden indicatorization inside downstream mechanisms).
    • Cross‑context indicatorization is allowed only via an explicit Transport clause.
    • Pin‑binding note: choosing concrete policy editions/pins is a planned baseline concern (P2W); UINDM only consumes those refs and records the effective ones in Audit.
  • Transport: declarative Bridge+CL/ReferencePlane only (refs/pins; do not restate CL ladders or Φ tables here); penalties route to R_eff only.

  • Γ_timePolicy: point by default (no implicit “latest”).

  • PlaneRegime: values live on the episteme ReferencePlane (the IndicatorSetSlot is a set of references into the declared characteristic-space basis); UINDM does not introduce plane shifts. When the indicatorization outcome is used across planes, apply CL^plane by explicit policy and route penalties → R_eff only.

  • Audit:

    • MUST record: CharacteristicSpaceRef.edition, CNSpecRef.edition, IndicatorChoicePolicyRef.edition.
    • When evidence‑gated, MUST record: CGSpecRef.edition and effective MinimalEvidence (MinimalEvidenceRef when provided; otherwise CGSpecSlot.MinimalEvidence).
    • SHOULD record: the realized GuardDecision (pass|degrade|abstain) and, when non‑pass, the policy‑bound failure behavior reference that justified it.
    • SHOULD record: a stable description of IndicatorSetSlot (or an id reference to a citable indicator‑set publication unit), and any Bridge/CL/ReferencePlane ids when Transport was invoked.

Interpretation notes (informative)

  • IndicatorSet is a set of references, not values. IndicatorSetSlot contains U.CharacteristicRef tokens; it does not compute measurements. The move from “chosen indicators” to “measured indicator profile” is performed downstream (e.g., via scoring/comparison), not by UINDM.

  • Subspace views are derived, not mandatory. If a project needs an explicit subspace view, treat it as a derived support view CS|_S where S = IndicatorSetSlot over the base CS = CharacteristicSpaceSlot. Do not add a new mandatory output to the kernel signature; model a first-class subspace support view via ⊑⁺ only when it is genuinely needed.

  • Justification is optional and externalized. The CHR SlotKind lexicon includes JustificationSlot, but the canonical UINDM intension does not require it. If a project needs a first‑class justification output, treat it as an extension (⊑⁺) rather than by mutating the base Indicatorize signature, and model the justification as a justification U.Episteme (e.g., JustificationSlot : ⟨ValueKind = U.Episteme, refMode = U.EpistemeRef⟩).

  • Evidence‑gated indicatorization is explicit. Evidence gating is not default: it is activated only when the chosen IndicatorChoicePolicy is evidence‑gated, in which case CGSpecSlot and MinimalEvidenceSlot become required inputs to avoid “silent passes.”

Archetypal Grounding (informative)

Tell

Think of UINDM as a policy‑bound projection:

  • Input: “the whole declared characteristic basis of a CN‑frame (in this context slice) + an explicit indicator choice policy”
  • Output: “the subset of characteristic references that are allowed to count as indicators for downstream CHR steps”

The key didactic boundary is: UINDM chooses coordinates; it does not alter coordinates.

Show (U.System) — cross‑unit engineering dashboard

A program manager maintains a U.CharacteristicSpace for manufacturing sites, including ~30 characteristics (quality, safety, cost, throughput, sustainability).

  • The CN‑Spec’s indicator_policy for the “weekly executive dashboard” selects a subset: {DefectRate, IncidentRate, UnitCost, LeadTime, EnergyPerUnit, OnTimeDelivery}.
  • UINDM runs Indicatorize(...) and outputs IndicatorSetSlot = those references.
  • One site lacks reliable incident reporting for the last week. The indicator policy is evidence‑gated; IndicatorizeEligibility returns degrade (not pass), and the audit records the effective MinimalEvidence and the edition pins used.

Downstream mechanisms can now be held to the invariant: they may only score/compare/select using the declared indicator profile (or explicitly abstain/degrade). This avoids “dashboard drift” where different teams silently score on different subsets.

Show (U.Episteme) — robust evaluation across environments

A research lead wants indicators for model robustness under distribution shift (different hospitals, sensors, geographies).

  • The declared characteristic-space basis includes many candidate metrics (accuracy slices, calibration, subgroup error, OOD detection quality).
  • The indicator choice policy is “invariance‑driven”: prefer indicators whose semantics remain stable under environment changes; deprioritize proxy metrics known to be environment‑sensitive.
  • UINDM returns an indicator set used by the scoring and comparison stages; uncertain indicators are handled via tri‑state guarding rather than coerced to zero or silently dropped.

Bias-Annotation (informative)

  • Gov (governance). Bias toward explicit policy surfaces (IndicatorChoicePolicyRef, edition pins, auditable outcomes) rather than tacit “expert choice.” Risk: perceived extra work. Mitigation: keep the mechanism minimal (selection‑only) and push method detail into wiring modules.

  • Arch (architecture). Bias toward stable interfaces: SlotKind tokens come from the suite lexicon and evidence gates are explicit inputs. Risk: reduced “quick hacks.” Mitigation: allow ⊑⁺ extensions for richer outputs (e.g., justification) without mutating the kernel signature.

  • Onto/Epist. Bias toward a strict distinction between “measurable characteristic” and “indicator under policy.” Risk: teams accustomed to “everything measurable is an indicator” may resist. Mitigation: embed this as an explicit LawSet clause (“No implicit NCV⇒indicator”).

  • Prag (pragmatics). Bias toward fail‑closed guards and traceability under uncertainty. Risk: more abstain/degrade outcomes early. Mitigation: couple degrade with explicit downstream behaviors (policy‑bound) rather than silent coercions.

  • Did (didactics). Bias toward “one place to learn the mechanism”: the problem/forces/solution narrative is co‑located with the canonical Mechanism.Intension.

Conformance Checklist

A UINDM publication or use is conformant if it satisfies:

  1. Mechanism.Intension completeness. The mechanism publication includes the full intension shape (header/imports/subject/slot index/op algebra/laws/admissibility/applicability/transport/time/plane/audit), and uses the tri‑state guard form. SlotIndex is treated as a derived projection. (See CC‑UM.0/CC‑UM.1/CC‑UM.9.)

  2. SlotKind discipline. SlotKind tokens match the CHR SlotKind lexicon for the roles used (CharacteristicSpaceSlot, CNSpecSlot, IndicatorChoicePolicySlot, ContextSlot, etc.). New SlotKinds, if any, are introduced by first extending the suite lexicon, not ad‑hoc in the mechanism.

  3. Selection‑only behavior. Indicatorize does not alter units, scales, and polarities, does not perform implicit normalization, and does not enlarge the declared characteristic-space basis.

  4. No NCV shortcut. “Measurable/NCV” is not treated as sufficient for indicatorhood; indicatorhood arises only via IndicatorChoicePolicySlot consistent with CN‑Spec.indicator_policy.

  5. Evidence gating is explicit. When the chosen IndicatorChoicePolicy is evidence‑gated, CGSpecSlot is present and the effective MinimalEvidence is explicit and auditable (MinimalEvidenceSlot when provided; otherwise CGSpecSlot.MinimalEvidence); insufficient/unknown evidence must yield degrade/abstain per the effective failure‑behavior policy, never a silent pass.

  6. Cross‑context indicatorization is explicit. Any cross‑context use names the relevant Bridge/CL/ReferencePlane and routes penalties to R_eff only (Bridge‑only transport + R‑only routing). (See CC‑UM.3/CC‑UM.4.)

  7. Gate/guard separation + lexeme discipline. UINDM uses …Eligibility returning GuardDecision ∈ {pass|degrade|abstain} and does not embed GateDecision/GateLog in suite steps. Reserved gate‑lexemes (e.g., …Guard) are not used for mechanism‑level predicates; the mechanism stays at the guard/admissibility layer.

  8. P2W seam is preserved. Planned slot fillings and edition pin‑bindings are not authored inside this mechanism intension; they are bound as WorkPlanning plan items under P2W and surfaced at run‑time only via Audit refs and pins.

  9. Specialization discipline (if extended). Any specialization of UINDM (⊑/⊑⁺) MUST follow the multi‑level specialization discipline (A.6.1:4.2.1, CC‑UM.8): SlotKind invariance for inherited ops, no new mandatory inputs to the inherited Indicatorize op, and any extra outputs (e.g., justification outputs or subspace support views) expressed only via ⊑⁺.

Common Anti‑Patterns and How to Avoid Them

  • “NCV ⇒ indicator.” Treating all measurable characteristics as indicators. Violates “No implicit NCV⇒indicator.”

  • Indicatorization hidden in scoring. A scoring method silently ignores some characteristics or introduces an implicit “feature selection” without an explicit indicator set.

  • Silent emptying. When evidence is insufficient, returning an empty indicator set (or treating missing evidence as “pass”) without a tri‑state guard decision.

  • Cross‑context reuse without Transport. Reusing an indicator set across contexts without naming Bridge/CL/ReferencePlane, thereby hiding penalties and violating crossing visibility.

  • Smuggling plan‑binding into the mechanism. Binding concrete edition pins / planned slot fillings (“launch values”) inside the UINDM description instead of using the P2W seam (WorkPlanning) and recording only effective refs/pins in Audit.

  • GateDecision leakage. Emitting or implying GateDecision/GateLog as part of the indicatorize step (gate decisions are separated from suite steps; keep UINDM at guard+audit level).

Consequences

Benefits

  • Makes “which characteristics count as indicators” explicit, auditable, and policy‑bound.
  • Prevents downstream semantic drift by freezing an indicator subset early in the CHR pipeline.
  • Improves reproducibility via edition‑determinism (fixed editions ⇒ stable result).
  • Preserves evolvability: new indicator selection method families can be added via wiring (packs/extensions) without changing the mechanism’s intension.

Costs / trade‑offs

  • Adds an explicit step (and explicit policy work) before scoring/comparison.
  • Strict fail‑closed behavior can increase early degrade/abstain outcomes until evidence and policies are properly specified.

Rationale

Indicatorization is separated because it is a different kind of commitment than scoring or comparison:

  • Indicatorization commits to which coordinates are allowed to matter under policy.
  • Scoring/aggregation/comparison commit to how allowed coordinates are transformed, folded, or ordered under legality gates.

By making indicatorization selection‑only, UINDM avoids “semantic alchemy” (changing meanings while claiming to merely “pick indicators”) and supports the CHR suite’s broader discipline: explicit spec refs, explicit crossings, and explicit handling of uncertainty via tri‑state guards.

SoTA-Echoing

SoTA vs popular note. This section records alignment to post‑2015 evidence‑backed practice. It is not a mandate to use fashionable methods; method semantics stay in SoTA packs (G.2) and wiring modules, while this pattern fixes the stable mechanism boundary.

Pack note (Phase‑3): this pattern does not currently cite a UINDM‑specific G.2 SoTA pack/ClaimSheet. If/when such a pack is introduced, replace the bibliographic pointers below with the pack’s ClaimSheetId citations, keeping the mechanism semantics unchanged.

SoTA alignment map (normative)

SoTA practice pointer (post‑2015+)Primary source (post‑2015+)Where it connects to UINDMAdoption status
Prefer indicators stable under environment shift (avoid spurious proxies)IRM / invariant prediction line (arXiv)Expressed as policy freedom (IndicatorChoicePolicySlot) + explicit Transport + fail‑closed eligibility; method details stay out of the kernelAdapt
Treat “why these indicators” as a first-class justification episteme, not tribal knowledgeModel Cards documentation discipline (ACM Digital Library)Expressed as minimal but decisive Audit + optional ⊑⁺ justification output (without mutating the kernel signature)Adapt
Keep architectural commitments traceable to one governing pattern (avoid “second centers of gravity”)ISO/IEC/IEEE 42010:2022 “Systems and software engineering — Architecture description”Expressed as the explicit governing-pattern hook + “Tell + Cite” stubs elsewhere (no competing semantics)Adopt

Notes per row (SoTA‑Echoing; not method mandates).

  1. Invariance under shift. UINDM does not “implement IRM”; it merely makes room for invariance‑driven indicator policies to be wired while keeping the kernel selection‑only.
  2. Justification discipline. UINDM keeps justification optional at the kernel level; if a justification publication or record is required, add it via ⊑⁺ so the base signature stays stable.
  3. Governing-pattern traceability. The ISO architecture‑description discipline is used here only to motivate “one governing pattern + Tell + Cite stubs”; it does not add new Part‑A governing spec refs.

Relations

  • Builds on

    • A.19.CN (CN‑Spec, specifically indicator_policy).
    • A.6.1 / CC‑UM.* (mechanism intension shape and authoring checks).
    • A.19.CHR:4.2.1 (CHR SlotKind lexicon).
  • Used by

    • A.19.CHR (suite membership and suite protocols; UINDM is the indicatorize stage).
  • Coordinates with

A.19.UINDM:End

Unified Scoring Mechanism, USCM

Type: Architectural (A) Status: Stable Normativity: Normative (unless explicitly marked informative) Placement: Part A / CN‑Spec cluster (A.19) / CHR mechanism-governing patterns (Phase‑3) Source: FPF / CHR Phase‑3 mechanism-governing patterns Modified: 2026‑01‑20

Governing-pattern note, Phase‑3 canonicalization: this pattern governs the canonical U.Mechanism.Intension for USCM.IntensionRef (CHR suite stage score). Mechanism-intension semantics of characterisation mechanisms live in explicitly designated governing patterns (E.20). A.6.1 governs the template of U.Mechanism.Intension; this pattern governs the USCM-specific slots, operations, laws, admissibility, applicability, transport, plane, and audit obligations for that template.

Canonicalization hook, ID‑continuity‑safe: any other appearances of the USCM intension (e.g., a legacy grounding stub in A.6.1 or suite prose in A.19.CHR) SHALL be reduced to a Tell + Cite stub pointing to A.19.USCM:4.1, while preserving the original section headings and their public PatternId:SectionPath IDs for continuity (alias‑dock legacy tokens rather than deleting them). Such stubs MUST NOT restate SlotIndex, OperationAlgebra, LawSet, Admissibility, or Audit content (no “second center of gravity” via near‑duplicate prose).

At a glance — didactic, informative

  • Suite stage: score (ordering lives only in A.19.CHR:4.5 / suite_protocols; suite membership is a set in A.19.CHR:4.2).
  • Inputs, conceptual: an admitted measure profile (InputProfileSlot) + CNSpecRef + CGSpecRef + ScoringMethodDescriptionRef + active U.BoundedContextRef, with optional MinimalEvidenceRef override.
  • Output: ScoreProfileSlot = a set of score measures (vector scores are first‑class; a scalar score is allowed only if explicitly declared).
  • Non‑goals: does not normalize (UNM), aggregate (ULSAM), compare (CPM), select (SelectorMechanism), threshold, publish, or emit telemetry; it is a scoring step with explicit legality and evidence surfaces.
  • P2W seam: concrete edition/policy pin bindings (including ScoringMethodDescriptionRef@edition(…) when USCM is used) are chosen in planned baseline plan items (A.15.3 + A.19.CHR:4.7.2); executions only record effective refs/pins in Audit.
  • Failure mode: tri‑state guard (pass|degrade|abstain); unknown never coerces to pass, and MUST NOT be coerced to 0/false.
  • Quick rule of thumb: if CGSpecSlot.SCP is missing → ScoreEligibility = abstain (fail‑closed); if ScoringMethodDescriptionSlot is missing → ScoreEligibility = abstain (no implicit scoring method); if CN‑Spec.comparability requires normalization‑based comparability → normalization MUST be explicit in choreography (Uses/pins), never hidden inside Score.

Problem frame

FPF’s Characterization (CHR) suite treats scoring as a distinct mechanism boundary within the CHR suite (authoritative membership: A.19.CHR:4.2). Suite membership is a set (order has no semantics); any intended ordering is expressed only via suite_protocols (A.19.CHR:4.5), under the suite obligations (A.19.CHR:4.3).

Within the canonical suite‑closed protocol, USCM appears as the score stage (after normalize and indicatorize, before comparison and selection). USCM’s surface is legality‑first: it produces score measures from admitted profiles while remaining constrained by the legality gate (CG‑Spec.SCP) and by scale‑lawfulness (CSLC).

USCM exists to keep a strict distinction between:

  • normalization (UNM),
  • indicatorization (UINDM),
  • scoring (USCM),
  • aggregation/folding (ULSAM), and
  • comparison/ordering/selection (CPM + SelectorMechanism),

so that each commitment has a single place to live, can be audited, and can evolve without smuggling extra semantics into adjacent steps.

Problem

Engineering teams often need to convert an admitted (indicator or NCV) profile into one or more score measures for downstream comparison and selection. If scoring is not given a first‑class mechanism boundary with explicit legality and evidence surfaces, the following failure modes are common:

  • Illicit arithmetic by convenience: teams apply weighted sums, averages, or nonlinear transforms across mixed scale kinds without an explicit legality profile, creating scores that are not CSLC‑lawful.
  • Hidden normalization: scoring implementations silently normalize, align, or flip polarities, collapsing the distinction between “normalize” and “score” and making downstream reasoning non‑reproducible.
  • Silent scalarization: multi‑criteria realities (vector scores, partial‑order comparability) are reduced to a single scalar via hidden tie‑breakers, producing an apparent total order that is not justified.
  • Unknown coercion: missing or insufficient evidence is coerced into 0/false or treated as “good enough,” yielding scores that look precise while being epistemically unsafe.
  • Drift and non‑auditability: different teams score the same admitted scoring target differently because legality constraints and effective policies (editions, evidence rules, crossings) are not explicit and not recorded.

Forces

  1. Legality discipline vs operational pressure. Scoring is where “just compute a number” pressure is strongest, but legality must remain explicit and checkable: SCP and CSLC constraints must bound permissible transforms.

  2. Method diversity vs stable mechanism boundary. Scoring methods evolve rapidly; USCM’s signature must remain stable so method families can be wired through SoTA packs and extensions without mutating the mechanism boundary.

  3. Vector reality vs scalar simplicity. Many situations require multiple score dimensions. A single scalar score may be convenient but must be an explicit, declared commitment, not a hidden reduction.

  4. Uncertainty vs decisiveness. Teams need decisions under uncertainty; the framework must prevent epistemic overconfidence. Tri‑state admissibility guards preserve correctness without forcing silent coercions.

  5. Strict distinction across CHR steps. USCM must not absorb UNM, ULSAM, or CPM semantics “for convenience,” or the suite becomes opaque and non‑teachable.

  6. Evolvability vs didactic usability. Interfaces must remain evolvable (stable SlotKind surface; method semantics externalized), while the spec remains teachable: a reader must find USCM’s purpose, boundary, laws, guard behavior, and audit minimum in one place.

  7. P2W separation and gate/guard separation. Planned baseline binding, including editions and policy ids, belongs to WorkPlanning plan items; gate decisions belong under gate patterns and work‑enactment logs belong with WorkEnactment. USCM must expose eligibility and audit pins without turning into a gate or a planner.

Solution

USCM is the canonical scoring mechanism in the CHR suite. It defines:

  • a stable mechanism boundary (score is its own stage with a canonical Score operation and a tri‑state eligibility predicate),
  • a stable SlotKind surface (via the suite lexicon),
  • a legality‑first LawSet anchored in CG‑Spec.SCP and CSLC,
  • an explicit anti‑smuggling rule (no implicit normalization), and
  • an audit minimum (edition pins and effective evidence policy, plus crossings when transport occurs).

USCM preserves the suite obligations by construction: it does not embed GateDecision/GateLog, it does not perform publish/telemetry steps, and it keeps Transport declarative (refs/pins only) with penalties routed to R_eff only.

Method semantics (“how to score”) remain out of suite core: they belong in SoTA packs (G.2) and wiring‑only extension modules (GPatternExtension blocks), while USCM remains the stable conceptual mechanism boundary.

Mechanism.Intension

This is the canonical U.Mechanism.Intension for USCM.IntensionRef and is intended to be cited by CHR suite publications and by any wiring layers.

  • Scope note: this intension is an instance authored to the U.Mechanism.Intension shape governed by A.6.1. It defines only the mechanism’s semantic surface (slots/ops/laws/guards/audit). It does not bind project‑specific pins (P2W), and it does not emit GateDecision/GateLog; it emits Audit pins and a tri‑state guard only.

  • IntensionHeader: id = USCM, version = 1.0.0, status = stable.

  • IntensionRef: USCM.IntensionRef (canonical target for the suite member named in A.19.CHR:4.2).

  • SignatureManifest (optional; importability): if a USCM publication is intended to be imported/reused, it SHOULD publish a SignatureManifest (A.6.0 / A.6.1; CC‑A.6.0‑18, CC‑UM.1) consistent with IntensionHeader/Imports, explicitly exposing the stable SlotKind surface (including ScoringMethodDescriptionSlot) and any declared scalarization commitment.

  • Tell. SCP‑first scoring: produce score measures from admitted profiles without violating CSLC / scale legality.

  • Purpose: SCP‑first scoring: produce score measures from admitted profiles without violating CSLC / scale legality.

  • Imports: G.0 (CG‑Spec.SCP, CG‑Spec.MinimalEvidence), A.18 (CSLC), C.16 (ScoringMethod disclosure + polarity/monotonicity discipline), A.19.CN (comparability.mode + normalization routing), A.19.CHR:4.2.1 (CHR SlotKind Lexicon).

  • SubjectBlock:

    • SubjectKind: Scoring.
    • BaseType: U.Measure.
    • SliceSet: U.ContextSliceSet.
    • ExtentRule: scoring ranges over admitted (indicator/NCV) profiles in the active context slice, routed by CN‑Spec.comparability and legality‑gated by CG‑Spec.SCP.
    • ResultKind?: U.Set (of U.Measure).
  • SlotIndex (derived projection from SlotSpecs / guard SlotSpecs; uses A.19.CHR:4.2.1 SlotKind tokens where applicable; any new SlotKind tokens introduced here MUST be suite‑docked into the lexicon by the suite-governing pattern to avoid drift):

    • InputProfileSlot : ⟨ValueKind = U.Set (of U.Measure), refMode = ByValue⟩,
    • CNSpecSlot : ⟨ValueKind = CN‑Spec, refMode = CNSpecRef⟩,
    • CGSpecSlot : ⟨ValueKind = CG‑Spec, refMode = CGSpecRef⟩,
    • ScoringMethodDescriptionSlot : ⟨ValueKind = ScoringMethodDescription, refMode = ScoringMethodDescriptionRef⟩ (SlotKind token; when reproducibility matters it is edition‑pinned via the P2W baseline; if the suite lexicon does not yet contain this token, it SHALL be docked into the lexicon by the suite-governing pattern rather than introduced ad‑hoc),
    • ContextSlot : ⟨ValueKind = U.BoundedContext, refMode = U.BoundedContextRef⟩,
    • MinimalEvidenceSlot? : ⟨ValueKind = MinimalEvidence, refMode = MinimalEvidenceRef⟩ (optional override; otherwise cite CGSpecSlot.MinimalEvidence),
    • ScoreProfileSlot : ⟨ValueKind = U.Set (of U.Measure), refMode = ByValue⟩.
  • OperationAlgebra (suite stage = score, per A.19.CHR:4.5; canonical stage‑op = Score):

    • Score(InputProfileSlot, CNSpecSlot, CGSpecSlot, ScoringMethodDescriptionSlot, ContextSlot, MinimalEvidenceSlot?) → ScoreProfileSlot.
  • LawSet (minimum; legality‑first, no hidden scalarization):

    1. SCP+CSLC legality: any numeric transform used to produce ScoreProfileSlot MUST be admissible under CGSpecSlot.SCP and CSLC‑lawful (cites G.0 + A.18).
    2. ScoringMethod is explicit (no hidden defaults): Score MUST cite ScoringMethodDescriptionSlot (edition‑pinned via P2W when reproducibility matters; see A.19.CHR:4.7.2). If a score is issued, the scoring method 𝒢 (Coordinate→Score) MUST be disclosed as required by C.16 (bounded codomain; monotonicity consistent with template polarity). USCM MUST NOT rely on an implicit “default scoring method”.
    3. No implicit normalization: Score MUST NOT silently perform UNM; if CNSpecSlot.comparability requires normalization‑based comparability, the normalization step MUST be explicit in choreography (Uses/pins), not hidden in Score.
    4. Vector scores allowed; scalarization must be explicit: producing a single scalar score is allowed only if explicitly declared (e.g., by fixing ScoreProfileSlot cardinality to 1 and citing the lawful transform); partial‑order semantics MUST NOT be silently reduced to a scalar “tie‑breaker”.
    5. Unknown is not coerced: unknown / insufficient evidence MUST NOT be mapped to 0/false; use tri‑state guards and explicit failure behavior.
  • AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality/evidence):

    • ScoreEligibility(InputProfileSlot, CNSpecSlot, CGSpecSlot, ScoringMethodDescriptionSlot, ContextSlot, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.
    • pass requires: (i) CGSpecSlot.SCP is present, (ii) ScoringMethodDescriptionSlot is present (no implicit scoring method), (iii) evidence passes MinimalEvidenceSlot? or CGSpecSlot.MinimalEvidence, and (iv) CN‑Spec.comparability routing is satisfied (incl. explicit UNM when needed).
    • If MinimalEvidenceSlot is absent, the guard MUST evaluate evidence against CGSpecSlot.MinimalEvidence (by explicit rule), and MUST NOT return pass when evidence is missing/unknown.
    • If ScoringMethodDescriptionSlot is missing or unpinned/ambiguous under the active planned baseline, the guard MUST return abstain (fail‑closed), not “assume a default”.
  • Applicability:

    • Intended to be used after indicatorization (when indicator profiles are used) and before comparison/selection.
    • Applicable only when legality/evidence surfaces are present via CGSpecSlot (fail‑closed otherwise).
    • Applicable only when a scoring method is explicitly declared via ScoringMethodDescriptionSlot (edition‑pinned when reproducibility matters). A “do nothing / identity scoring” intent (if ever needed) MUST still be declared as an explicit scoring method description, not as an implicit default.
  • Transport: Bridge+CL/ReferencePlane only; penalties route to R_eff only.

  • Γ_timePolicy: point by default (no implicit “latest”).

  • PlaneRegime: values live on episteme ReferencePlane; on plane crossings apply CL^plane policy; penalties → R_eff only.

  • Audit:

    • MUST record: CNSpecRef.edition, CGSpecRef.edition, ScoringMethodDescriptionRef.edition.
    • MUST record the effective evidence policy:
      • if MinimalEvidenceSlot? is present → record MinimalEvidenceRef as effective;
      • otherwise → cite CGSpecSlot.MinimalEvidence as effective.
    • SHOULD record the realized GuardDecision for ScoreEligibility, and (when degrade/abstain) the referenced failure behavior / downstream handling policy id (e.g., SoS‑LOG branch id) when such a policy is in scope.
    • SHOULD record: a stable description of ScoreProfileSlot, any Bridge/CL/ReferencePlane ids when Transport was invoked, and (when normalization‑based comparability was required) an explicit ref/pin that the upstream UNM step was applied (no provenance gaps for “normalized input” claims).

Interpretation notes — informative

  • A score profile is a set of measures. ScoreProfileSlot is a U.Set (of U.Measure). Treat this as “vector scoring by default.” If a project truly needs a single scalar score, declare that explicitly (per LawSet item 3), rather than assuming scalarity.

  • A score profile is a set of measures. ScoreProfileSlot is a U.Set (of U.Measure). Treat this as “vector scoring by default.” If a project truly needs a single scalar score, declare that explicitly (per LawSet item 4), rather than assuming scalarity.

  • USCM does not order; it scores. USCM produces score measures. Any ordering, dominance, or set‑valued comparison is performed by CPM and SelectorMechanism (and any optional aggregation is made explicit via ULSAM). Treating the score as “the decision” is a category error in CHR terms.

  • ScoringMethod is explicit (no hidden defaults). USCM requires ScoringMethodDescriptionSlot: the scoring method is a first‑class, auditable choice (typically pinned in planned baseline). This keeps “how we score” evolvable (wired via method packs) without making it implicit or accidental.

  • No implicit UNM is a boundary guard. This discourages convenience implementations that “just normalize inside scoring.” USCM forbids that: if comparability requires normalization‑based routing, the UNM step is explicit in choreography (Uses/pins) and visible in audit surfaces.

  • Evidence policy is explicit and auditable. MinimalEvidenceSlot? is an optional override; otherwise the effective policy is CGSpecSlot.MinimalEvidence. Failures do not disappear; they must show up as degrade/abstain and be traceable.

  • Crossings are declarative and penalize R_eff only. When scoring spans contexts or planes, USCM names Bridge+CL/ReferencePlane policies and routes penalties to R_eff only, keeping correctness separate from convenience.

Archetypal Grounding — informative

Tell

Think of USCM as legality‑gated scoring:

  • Input: “an admitted profile of measures, in this context slice, plus CN-Spec governance card and CG-Spec legality gate”
  • Output: “a set of score measures that downstream steps may compare/select on”

The key didactic boundary is: USCM is allowed to transform measures only within the legality surface (SCP+CSLC), and it must not hide normalization, aggregation, or ordering.

Show — U.System

A program manager evaluates competing rollout plans for a product launch.

  • The admitted profile includes measures like {Cost, LeadTime, Reliability, RiskExposure, CarbonPerUnit}.
  • The CG‑Spec’s SCP admits only scale‑lawful transforms (e.g., monotone transforms on ratio/interval measures, explicit unit alignment rules, and prohibited operations on ordinal measures).
  • USCM runs Score(...) and outputs a score profile such as {UtilityScore, RiskScore} rather than forcing a single number.
  • A plan lacks sufficient evidence for RiskExposure in this context slice; ScoreEligibility returns degrade, and the audit records the effective MinimalEvidence policy and the editions of CNSpecRef and CGSpecRef.

Downstream steps can now compare and select with an explicit audit trail, instead of pretending that “the score was objective.”

Show — U.Episteme

A research lead compares several model families for deployment across heterogeneous environments.

  • Indicators include calibration and robustness metrics; scoring is done using a calibrated probabilistic score plus uncertainty‑aware score dimensions.
  • A post‑2015 practice example is to keep monotonicity and interpretability constraints explicit (e.g., monotone additive models or monotone deep lattice style models) and to treat uncertainty as first‑class (e.g., conformal set‑valued scoring that yields intervals rather than point scores).
  • USCM produces a score profile that can remain vector‑valued and uncertainty‑aware, and it refuses to coerce “unknown” into a point score. Comparisons and selections occur downstream using set‑valued semantics where appropriate.

Bias-Annotation — informative

  • Gov (governance). Bias toward explicit legality and evidence surfaces (CGSpecRef, SCP, MinimalEvidence) rather than “standard practice” arithmetic. Risk: perceived overhead. Mitigation: keep the kernel signature small and push method specifics into SoTA packs and wiring modules.

  • Arch (architecture). Bias toward stable interfaces and strict step boundaries (no implicit UNM; no hidden scalarization). Risk: reduced room for ad‑hoc shortcuts. Mitigation: allow richer scoring method families via wiring, without mutating the USCM intension.

  • Onto/Epist. Bias toward treating scores as measures with declared semantics, not as “the truth.” Risk: teams accustomed to one‑number rankings may resist. Mitigation: treat scalarization as an explicit, auditable commitment, not as the default.

  • Prag (pragmatics). Bias toward fail‑closed guards and traceability under uncertainty. Risk: more degrade/abstain outcomes early. Mitigation: couple degrade with explicit downstream behavior policies, rather than silent coercion.

  • Did (didactics). Bias toward “one place to learn the mechanism”: the problem/forces/solution narrative is co‑located with the canonical Mechanism.Intension.

Conformance Checklist

A USCM publication or use is conformant if it satisfies:

  1. Mechanism.Intension completeness. The publication includes the full intension shape (header/imports/subject/slot index/op algebra/laws/admissibility/applicability/transport/time/plane/audit), and uses the tri‑state guard form. SlotIndex is treated as a derived projection. (See CC‑UM.*.)

  2. SlotKind discipline. SlotKind tokens match the CHR SlotKind lexicon for the roles used (InputProfileSlot, CNSpecSlot, CGSpecSlot, ContextSlot, MinimalEvidenceSlot, ScoringMethodDescriptionSlot, ScoreProfileSlot). If ScoringMethodDescriptionSlot (or any other required token) is missing from the suite lexicon, it SHALL be suite‑docked there (alias docking acceptable) rather than introduced ad‑hoc in the mechanism.

  3. SCP+CSLC legality is enforced. Any numeric transform used to produce score measures is admissible under CGSpecSlot.SCP and CSLC‑lawful; illicit operations (especially “convenient arithmetic” over non‑lawful scales) are excluded.

  4. ScoringMethod is explicit and auditable. Score cites ScoringMethodDescriptionSlot (edition‑pinned when reproducibility matters). No implicit “default scoring method” is assumed. The disclosed method respects polarity/monotonicity discipline (cf. C.16).

  5. No implicit normalization. Score does not silently perform UNM. If CN‑Spec.comparability requires normalization‑based routing, the normalization step is explicit in choreography (Uses/pins) and auditable.

  6. No hidden scalarization. Vector scores are permitted. A scalar score is produced only when explicitly declared, and partial‑order semantics are not reduced to a scalar tie‑breaker.

  7. Unknown and evidence handling is explicit. Unknown / insufficient evidence is not coerced to 0/false. Eligibility uses GuardDecision ∈ {pass|degrade|abstain} and evaluates evidence against the effective policy (MinimalEvidenceSlot override or CGSpecSlot.MinimalEvidence).

  8. P2W seam is preserved. Planned slot fillings and edition pin bindings are not authored inside the mechanism intension; they are bound as WorkPlanning plan items under P2W and surfaced at run‑time only via Audit refs and pins.

  9. Transport and plane discipline. Cross‑context and cross‑plane use is declarative (Bridge+CL/ReferencePlane; CL^plane for plane crossings) and routes penalties to R_eff only. Audit records crossings when invoked.

  10. Specialization discipline, if extended. Any specialization of USCM (⊑/⊑⁺) follows the multi‑level specialization discipline (A.6.1:4.2.1, CC‑UM.8): SlotKind invariance for inherited ops, no new mandatory inputs to the inherited Score op, and any extra outputs or ops expressed only via ⊑⁺.

Common Anti‑Patterns and How to Avoid Them

  • Hidden normalization inside scoring. Scoring silently normalizes or aligns measures. Avoid by making UNM explicit in choreography and keeping USCM’s Score legality‑only.

  • Weighted sum across mixed or non-admissible scales. Treating “weights + sum” as universal. Avoid by requiring SCP+CSLC admissibility; if the scale operation is not scale-admissible, it is not admissible.

  • Silent scalarization. Collapsing vector scores or partial orders into a single “overall score” via an untracked tie‑breaker. Avoid by leaving vector scores intact, and making scalarization an explicit declared commitment.

  • Implicit scoring method (“we just use the standard formula”). The scoring method is assumed rather than declared and pinned. Avoid by requiring ScoringMethodDescriptionSlot and edition pinning in planned baseline; treat “identity scoring” (if ever needed) as an explicit method description, not a hidden default.

  • Unknown → 0 coercion. Treating missing evidence as zero, false, or “good enough.” Avoid by tri‑state guards and explicit failure behavior, with auditable effective evidence policy.

  • Shadow CG‑Spec. Hard‑coding legality rules inside a scoring method description instead of citing CGSpecSlot.SCP. Avoid by keeping legality in CG‑Spec and treating method details as wiring.

  • Telemetry or publish leakage. Treating scoring as a reporting step. Avoid by keeping publish/telemetry outside suite closure and using the appropriate post-suite mechanisms.

  • SlotKind drift. Renaming or re‑purposing slots across specializations or across mechanisms. Avoid by using the suite SlotKind lexicon and the ⊑/⊑⁺ discipline.

Consequences

Benefits

  • Makes scoring a first‑class, legality‑gated CHR step, reducing illicit arithmetic and silent assumptions.
  • Improves auditability and reproducibility via explicit edition pins and explicit evidence policy selection (override vs default).
  • Preserves evolvability: scoring method families can change via SoTA wiring without changing the USCM intension.
  • Supports correctness under uncertainty via tri‑state guards and explicit unknown handling.

Costs / trade‑offs

  • Requires explicit CG‑Spec legality surfaces (SCP) and explicit evidence policies to achieve pass; this can feel slower than “just compute a score.”
  • Vector scores can be less immediately comfortable than a single number; downstream comparison/selection must be explicit about how vector scores are used.

Rationale

Scoring is a frequent source of semantic precision loss: it is easy to smuggle normalization, illegal arithmetic, implicit thresholds, and uncertainty coercion into “a simple scoring function.” USCM prevents that by forcing a clean boundary:

  • Legality first: all transforms are justified by CG‑Spec.SCP and CSLC.
  • No hidden steps: normalization is explicit (UNM), aggregation is explicit (ULSAM), ordering is explicit (CPM/SelectorMechanism).
  • Uncertainty is visible: admissibility is tri‑state; unknown is not coerced.
  • Audit is minimal yet decisive: effective editions and effective evidence policy are always traceable.

This increases both evolvability (stable interface, externalized method semantics) and didactic usability (a single place to learn USCM’s boundary and obligations).

SoTA-Echoing

SoTA vs popular note. This section records alignment to post‑2015 evidence‑backed practice. It is not a mandate to use fashionable methods; method semantics stay in SoTA packs (G.2) and wiring modules, while this pattern fixes the stable mechanism boundary.

Pack note, Phase‑3: this pattern does not currently cite a USCM-specific G.2 SoTA pack or ClaimSheet. If such a pack is introduced, ScoringMethodDescriptionSlot SHOULD be wired to ScoringMethodDescriptionRef(ed=...) entries defined in that pack’s ClaimSheets, keeping the USCM mechanism semantics unchanged.

SoTA alignment map

SoTA practice pointer, post‑2015+Primary source examples, post‑2015+Where it connects to USCMAdoption status
Prefer monotone and interpretable scoring surfaces where appropriateExplainable additive and monotone model lines, e.g., Lou et al. 2016; Nori et al. 2019; monotone deep lattice style models, e.g., You et al. 2017Expressed as legality‑bounded transform freedom via CGSpecSlot.SCP and explicit scalarization rules; method details stay out of the kernelAdapt
Treat probabilistic scores as measures requiring calibration, not raw outputsCalibration practice, e.g., temperature scaling (Guo et al. 2017) and successorsExpressed as “score is a measure on an explicit scale,” bounded by SCP+CSLC and evidence gating; calibration itself is wired as method semantics, not kernel lawAdapt
Keep uncertainty explicit and allow set‑valued scoring when appropriateModern conformal prediction practice, e.g., Romano et al. 2019; Barber et al. 2021Expressed as “vector scores allowed; unknown not coerced; no hidden scalarization,” enabling downstream set‑valued comparison/selectionAdapt
Keep architectural commitments traceable to one governing patternISO/IEC/IEEE 42010:2022 architecture description disciplineExpressed as explicit governing-pattern assignment and Tell+Cite stubs elsewhere (no competing semantics)Adopt

Notes per row

  1. USCM does not “implement a particular scoring model”; it preserves a stable, legality‑gated surface on which such models can be wired.
  2. Calibration is treated as a lawful transform family that must live within SCP+CSLC; the kernel does not mandate a specific calibration method.
  3. Set‑valued scoring aligns with USCM’s “vector first, scalar by declaration” law, and is naturally consumed by CPM/SelectorMechanism without forcing a spurious total order.
  4. Governing-pattern traceability is used here to keep the spec teachable and non‑duplicative; it does not add new governance cards or legality gates.

Relations

  • Builds on

    • A.6.1 / CC‑UM.* (mechanism intension shape and authoring checks).
    • A.19.CHR:4.2.1 (CHR SlotKind lexicon).
    • G.0 (CG‑Spec, specifically SCP and MinimalEvidence).
    • A.18 (CSLC legality discipline).
    • C.16 (ScoringMethod disclosure; polarity/monotonicity discipline for score mappings).
    • A.15.3 + A.19.CHR:4.7.2 (P2W planned baseline seam for edition/policy pin bindings; cited as seam, not duplicated in Intension).
    • A.19.CN (CN‑Spec, specifically comparability routing and normalization‑based comparability expectations).
  • Used by

    • A.19.CHR (suite membership and suite protocols; USCM is the score stage).
    • Downstream CHR stages that require score measures as inputs (e.g., CPM, SelectorMechanism).
    • E.18 (E.TGA) when USCM instances are used as transduction nodes; the selected ScoringMethodDescriptionRef@edition(…) and other pins live in planned baselines (P2W), while executions surface effective refs/pins via Audit.
  • Coordinates with

    • UNM when CN‑Spec.comparability requires normalization‑based comparability (explicit choreography, no hidden UNM).
    • ULSAM when folding/aggregation is needed as a distinct, explicit step.
    • G.2 and GPatternExtension wiring modules for post‑2015 method families, without mutating the USCM kernel.
    • E.20 (governing-pattern discipline) and F.18 (alias docking) for Phase‑3 canonicalization and ID continuity.

A.19.USCM:End

Unified Lawful Scale Aggregation Mechanism (ULSAM)

Type: Architectural (A) Status: Stable Normativity: Normative (unless explicitly marked informative) Placement: Part A / CN‑Spec cluster (A.19) / CHR mechanism-governing patterns (Phase‑3) Source: FPF / CHR Phase‑3 mechanism-governing patterns Modified: 2026-01-20

Governing-pattern note (Phase‑3 canonicalization): this pattern governs the canonical U.Mechanism.Intension for ULSAM.IntensionRef (CHR suite stage fold_Γ?). Mechanism-intension semantics are governed by explicitly designated governing patterns (E.20). A.6.1 governs the template of U.Mechanism.Intension and the U.MechAuthoring discipline; this pattern governs the ULSAM-specific slots, operations, laws, admissibility, and audit obligations for that template.

ID continuity note. When migrating away from any legacy “card location”, preserve public anchors: keep the legacy section heading/ID as a Tell + Cite stub (or dock aliases via F.18) rather than deleting or silently renaming it.

Canonicalization hook (ID‑continuity‑safe): any other appearances of ULSAM intension content (e.g., a legacy grounding stub in A.6.1 or suite prose in A.19.CHR) SHALL be reduced to a Tell + Cite stub pointing to A.19.ULSAM:4.1, while preserving the original section headings and their public PatternId:SectionPath IDs for continuity (alias‑dock legacy tokens rather than deleting them). Such stubs MUST NOT restate SlotIndex / OperationAlgebra / LawSet / Admissibility content (no “second center of gravity” via near‑duplicate prose).

  • ID‑continuity‑safe: if content is moved from an earlier location, preserve the earlier heading and its IDs as a stub that cites A.19.ULSAM:4.1.
  • Alias‑dock, don’t break: if any legacy tokens exist, dock them via F.18 + E.10 rules; do not silently replace tokens “by смысл”.
  • No shadow semantics: derived summaries MAY be informative, but MUST NOT restate SlotIndex / OperationAlgebra / LawSet / Admissibility; they may only summarise and cite.

At a glance (didactic, informative)

  • Suite stage: fold_Γ? (ordering lives only in A.19.CHR:suite_protocols; mechanisms[] membership is a set, not an order).
  • Input surface: MeasureSetSlot + {CNSpecSlot, CGSpecSlot} + GammaFoldSlot + ContextSlot (+ optional MinimalEvidenceSlot? override).
  • Output surface: AggregatedMeasureSlot (+ optional ContributorSetSlot? as an explanation surface).
  • Non‑goals: no scoring, no comparison, no selection, no “method catalog”, no hidden defaults, no hidden thresholds.
  • P2W seam: edition/policy binding for ΓFoldRef / MinimalEvidenceRef is selected in planned baseline (A.15.3 + CHR P2W hook), not invented at run time.
  • Failure mode: tri‑state guard GuardDecision := {pass|degrade|abstain}; unknown/insufficient evidence never coerces to “pass”.
  • Rule of thumb: if you are about to “average/sum/roll up”, you probably need an explicit ULSAM Fold_Γ stage (or a justified decision to not fold).

What this mechanism is. ULSAM is the CHR mechanism that makes aggregation explicit: it performs an explicit Γ‑fold over a set of admitted measures, producing an aggregated measure (and optionally a contributor surface) under declared legality.

What this mechanism is not.

  • It is not a scoring method (that is USCM).
  • It is not a comparison mechanism (that is CPM).
  • It is not a selection mechanism (that is SelectorMechanism).
  • It is not a “method catalog”: method specifics belong to SoTA packs and wiring (G.*:Ext.*), not here.
  • It is not a place to hide defaults (“implementation default fold”) or hidden thresholds.

When you need ULSAM.

  • You want to “roll up” multiple measures into one measure (e.g., an overall reliability/assurance coordinate, a single aggregated risk measure, an aggregate score coordinate).
  • You need the fold to be auditable (what contributed; what was excluded by evidence/legality).
  • You need the fold to be scale-lawful (no ordinal arithmetic; no illegal mixing of units).
  • You need the fold to be policy-bound and edition-stable (replayability and pin traceability).

Where it sits in CHR.

  • In the CHR suite protocol, ULSAM corresponds to the optional stage fold_Γ? (i.e., explicitly optional and never hidden inside score/compare/select).

60‑second script for engineer-managers.

“If you’re about to average, sum, or otherwise compress multiple measures into one, stop. Ask: (i) do we have a declared Γ‑fold policy and SCP legality, (ii) are the measures admissible and scale-compatible, (iii) what do we do if evidence is missing? If you cannot answer with explicit pins/refs, you are not folding — you are smuggling an assumption. Use ULSAM’s Fold_Γ, record the effective Γ‑fold and contributor set, and keep the fold as an explicit step.”

Problem frame (normative)

Within CHR, teams frequently need an explicit aggregation step (Γ‑fold) to produce an aggregated measure that is later consumed by comparison and/or selection. Without a dedicated mechanism boundary, aggregation tends to:

  • leak into scoring (“the score function also averages everything”),
  • leak into selection (“the selector silently computes a scalar”),
  • become an “implementation default” rather than a declared policy,
  • violate scale legality (especially via ordinal arithmetic or unit-mixing),
  • become unauditable (“what exactly got folded, and under what evidence posture?”).

Problem (normative)

How do we define an aggregation step that:

  1. is explicit (separate from scoring/comparison/selection),
  2. is scale-lawful and legality-gated (CSLC + CG‑Spec.SCP),
  3. is Γ‑fold-policy-bound (CG‑Spec.Γ_fold or explicit override),
  4. is evidence-gated with tri‑state guards (no unknown → 0/false coercions),
  5. is auditable (editions, effective fold, contributor surface),
  6. preserves kernel stability while allowing SoTA evolution via wiring,
  7. remains didactically readable (one governing pattern; no scavenger hunt).

Forces (normative)

  • Lawfulness vs convenience. The most “convenient” aggregation (e.g., weighted sums) is often illegal across scales/units; lawful folds require explicit constraints.
  • Explicitness vs brevity. A single scalar is short to discuss, but expensive in hidden assumptions.
  • Kernel stability vs method evolution. Aggregation methods evolve; the kernel must not.
  • Evidence gating vs “always return a number.” The mechanism must support abstain/degrade rather than coercion.
  • Optional stage vs pipeline clarity. fold_Γ? is optional in CHR protocols; optionality must be explicit (not implicit “sometimes scoring folds”).
  • Auditability vs minimal overhead. Recording contributor sets and effective pins adds overhead but prevents semantic drift.
  • Cross-context reuse vs locality. Cross-context folds must respect Transport discipline (Bridge+CL/ReferencePlane) and penalty routing to R_eff.
  • P2W separation and gate/guard separation. ULSAM must expose eligibility and audit pins without turning into (i) a WorkPlanning baseline binder or (ii) a legality gate: planned slot fillings belong to WorkPlanning plan items, while GateDecision/GateLog live in gate patterns / WorkEnactment (suite protocols remain mechanism‑steps only).

Solution (normative)

ULSAM is the canonical scale‑aggregation mechanism in the CHR suite. It defines:

  • a stable mechanism boundary (fold_Γ? is a stage with its own operation and eligibility predicate),
  • a stable SlotKind surface (via the suite lexicon),
  • a tri‑state admissibility guard (fail‑closed on missing legality/evidence),
  • and an audit minimum (edition pins + effective Γ‑fold identity + crossing policy ids when transport occurs).

Method semantics (“which aggregation family to use”) remain out of suite core: they belong in SoTA packs (G.2) and wiring‑only extension modules (GPatternExtension blocks), while ULSAM remains the stable mechanism boundary.

Mechanism.Intension (canonical; normative)

Archetypal Grounding — Mechanism.Intension (normative).

This is the canonical U.Mechanism.Intension for ULSAM.IntensionRef and is intended to be cited by CHR suite publications and by any wiring layers.

  • Scope note: this intension is an instance authored to the U.Mechanism.Intension shape governed by A.6.1. It defines only the mechanism’s semantic surface (slots/ops/laws/guards/audit). It does not bind project‑specific pins (P2W), and it does not emit GateDecision/GateLog or publish/telemetry steps; it emits Audit pins and a tri‑state guard only.

  • IntensionHeader: id = ULSAM, version = 1.0.0, status = stable.

  • IntensionRef: ULSAM.IntensionRef (canonical target for the suite member named in A.19.CHR:4.2).

  • Tell. Explicit Γ‑fold over admitted measures — no hidden aggregation inside scoring/comparison/selection.

  • Purpose: explicit Γ‑fold (and, when declared, time‑fold) over admitted measures — no hidden aggregation inside scoring/selection.

  • Imports: G.0 (CG‑Spec.Γ_fold, CG‑Spec.SCP, CG‑Spec.MinimalEvidence), A.18 (CSLC), A.19.CN (CN‑Spec.acceptance + aggregation routing), A.6.5 (slot discipline), B.3 (Γ‑fold defaults for R_eff, incl. WLNK), A.19.CHR:4.2.1 (CHR SlotKind Lexicon).

  • SubjectBlock:

    • SubjectKind: ScaleAggregation (Γ‑fold).
    • BaseType: U.Measure.
    • SliceSet: U.ContextSliceSet.
    • ExtentRule: aggregation ranges over admitted measure sets in the active context slice (admission routed by CNSpecSlot.acceptance); legality is delegated to CG‑Spec.Γ_fold and CG‑Spec.SCP.
    • ResultKind?: U.Measure.
  • SlotIndex (derived projection from SlotSpecs / guard SlotSpecs; uses A.19.CHR:4.2.1 SlotKind tokens; no independent semantics):

    • MeasureSetSlot : ⟨ValueKind = U.Set (of U.Measure), refMode = ByValue⟩,
    • CNSpecSlot : ⟨ValueKind = CN‑Spec, refMode = CNSpecRef⟩,
    • CGSpecSlot : ⟨ValueKind = CG‑Spec, refMode = CGSpecRef⟩,
    • GammaFoldSlot : ⟨ValueKind = ΓFold, refMode = ΓFoldRef⟩,
    • ContextSlot : ⟨ValueKind = U.BoundedContext, refMode = U.BoundedContextRef⟩,
    • MinimalEvidenceSlot? : ⟨ValueKind = MinimalEvidence, refMode = MinimalEvidenceRef⟩ (optional override; otherwise cite CGSpecSlot.MinimalEvidence),
    • AggregatedMeasureSlot : ⟨ValueKind = U.Measure, refMode = ByValue⟩,
    • ContributorSetSlot? : ⟨ValueKind = U.Set (of U.Measure), refMode = ByValue⟩ (optional but recommended for auditability).
  • OperationAlgebra (suite stage = fold_Γ?, per A.19.CHR:4.5; canonical stage‑op = Fold_Γ):

    • Fold_Γ(MeasureSetSlot, CNSpecSlot, CGSpecSlot, GammaFoldSlot, ContextSlot, MinimalEvidenceSlot?) → (AggregatedMeasureSlot, ContributorSetSlot?).
  • LawSet (minimum; explicit, scale‑lawful folding only):

    1. No hidden aggregation: any Γ‑fold MUST be explicit as Fold_Γ (no folding hidden inside Score/Compare/Select).
    2. Scale‑lawfulness: aggregation MUST be CSLC‑lawful and admissible under CGSpecSlot.SCP; ordinal arithmetic (e.g., means on ordinal ranks) is forbidden unless explicitly allowed by the relevant CSLC fragment.
    3. Γ‑fold legality: GammaFoldSlot MUST resolve to either CGSpecSlot.Γ_fold or an explicitly pinned override (CAL policy) — never an implicit “implementation default”.
    4. Evidence‑gated folding: if evidence is insufficient/unknown, folding MUST follow tri‑state guard behavior and MUST NOT silently coerce.
    5. Contributor accountability (when produced): when ContributorSetSlot? is produced, it MUST be a subset of the admitted portion of MeasureSetSlot, and AggregatedMeasureSlot MUST be the result of applying the effective Γ‑fold to that contributor subset (no “hidden contributors”).
    6. No implicit UNM: ULSAM MUST NOT silently normalize/rescale to “force comparability.” If establishing a compare‑on‑invariants surface requires UNM for the measures being folded, UNM MUST appear as an explicit stage (Uses + pins) upstream; ULSAM itself remains folding‑only.
  • AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality/evidence):

    • FoldEligibility_Γ(MeasureSetSlot, CNSpecSlot, CGSpecSlot, GammaFoldSlot, ContextSlot, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.
    • pass requires: (i) CGSpecSlot provides the legality surface (SCP and Γ_fold), (ii) GammaFoldSlot is admissible under CGSpecSlot.Γ_fold routing (or explicit override), and (iii) the measure set is admitted (per CNSpecSlot.acceptance) and scale‑compatible for the intended fold.
    • Define EffectiveMinimalEvidence := (MinimalEvidenceSlot if present, else CGSpecSlot.MinimalEvidence); the guard MUST evaluate evidence against EffectiveMinimalEvidence.
    • If evidence is missing/unknown under EffectiveMinimalEvidence, the guard MUST NOT return pass (return degrade or abstain per the effective failure behavior; record the basis in Audit).
  • Applicability:

    • Intended to be used only when a fold is explicitly required (and never as a hidden sub‑step of scoring/comparison/selection).
    • Applicable only when CGSpecSlot provides the legality surface (Γ_fold and SCP) (fail‑closed otherwise).
    • If comparability routing for the measures being folded is UNM‑based, applicability presumes an explicit upstream UNM stage; ULSAM does not “make measures comparable” by itself.
  • Transport: Bridge+CL/ReferencePlane only; penalties route to R_eff only.

  • Γ_timePolicy: point by default; time‑fold requires explicit windowing policy (if an explicit operator is needed, introduce FoldTime_Γ as an ⊑⁺ extension using GammaTimeRuleSlot from the CHR SlotKind Lexicon).

  • PlaneRegime: values live on episteme ReferencePlane; on plane crossings apply CL^plane policy; penalties → R_eff only.

  • Audit:

    • MUST record: CNSpecRef.edition, CGSpecRef.edition, and the effective Γ‑fold (ΓFoldRef).
    • If GammaFoldSlot resolves via an explicit override, SHOULD record the override’s policy-id (or its stable ref) alongside ΓFoldRef.
    • When MinimalEvidenceSlot? is present, MUST record MinimalEvidenceRef; otherwise MUST cite CGSpecSlot.MinimalEvidence as the effective evidence policy.
    • When ContributorSetSlot? is produced, SHOULD record it (or an id reference) as an auditable explanation surface.
    • SHOULD record: any explicit UNM invocation ids/pins when folding presumes a compare‑on‑invariants surface established by UNM.
    • SHOULD record: any Bridge/CL/ReferencePlane ids when Transport was invoked.
    • SHOULD record: the evaluated GuardDecision (especially when not pass) and, when applicable, the effective evidence policy / failure behavior reference used to justify degrade|abstain.

Interpretation notes (didactic, informative)

  • Γ‑fold is a declared governing spec ref, not an implementation choice. In FPF terms, “how we fold” is a policy-level commitment: GammaFoldSlot MUST be resolvable to CGSpecSlot.Γ_fold routing or an explicit pinned override. If you cannot cite it, you do not have a fold — you have a hidden default.
  • ULSAM is not normalization. ULSAM does not establish comparability by itself: it does not normalize, rescale, or “align units” as a hidden convenience. If a compare‑on‑invariants surface is required, invoke UNM explicitly upstream and cite the effective pins in Audit.
  • Prefer vector semantics when possible. If you do not strictly need one aggregated measure, keep measures separate and let CPM + SelectorMechanism operate on a partial order (set-return semantics). A fold is a lossy compression; treat it as such.
  • Contributor surfaces are not “nice-to-have” in practice. ContributorSetSlot? is optional in the signature, but operationally it is the simplest way to prevent “mystery rollups” and to preserve an explanation surface.
  • Time-fold is a specialization, not a loophole. The base ULSAM declares Γ_timePolicy and allows time-fold only via explicit windowing policy. If a project needs an explicit FoldTime_Γ operator, introduce it as an ⊑⁺ extension consistent with A.6.1:4.2.1 (no mutation of inherited ops; no SlotKind drift).
    • Use the suite lexicon token GammaTimeRuleSlot for the additional windowing rule input; do not overload ContextSlot or GammaFoldSlot to smuggle time semantics.

Archetypal grounding (didactic, informative)

Tell

  • In CHR, ULSAM exists to keep the stage fold_Γ? explicit: if a pipeline wants folding, it invokes ULSAM.Fold_Γ; otherwise it skips the stage. Folding MUST NOT be smuggled into USCM.Score, CPM.Compare, or SelectorMechanism.Select.
  • In U.System decision contexts: ULSAM is where you explicitly fold multiple admitted measures (e.g., multiple risk coordinates) into an aggregated measure only when the CG‑Spec declares that fold.
  • In U.Episteme contexts: ULSAM is where you explicitly fold an evidential or measurement set into an aggregated coordinate (e.g., an assurance measure), typically using a conservative Γ‑fold (e.g., weakest-link) when folding reliability-like quantities.

Show

Scenario A (manager-facing): “roll up” a multi-metric readiness into one reliability-like coordinate.

  1. A CHR pipeline produces a set of admitted measures (post-USCM or directly from characteristic measures): MeasureSetSlot = {m₁, m₂, …, m_k}.
  2. The team wants a single “readiness” measure m_ready to be used as an input to later comparison/selection. The temptation is to “just average” or “just do weighted sum”.
  3. ULSAM forces three explicit questions before folding:
    • Legality: Is the fold admissible under CGSpecSlot.SCP (units/scale) and CGSpecSlot.Γ_fold (declared fold kinds)?
    • Evidence: Is the evidence posture sufficient under MinimalEvidence? If not, do we degrade or abstain?
    • Policy identity: What is the identity of the fold (which ΓFoldRef, which edition)?
  4. Only then, the pipeline performs: Fold_Γ(MeasureSetSlot, CNSpecSlot, CGSpecSlot, GammaFoldSlot, ContextSlot, MinimalEvidenceSlot?) → (AggregatedMeasureSlot, ContributorSetSlot?). The audit records ΓFoldRef and (optionally) the contributor surface.

Scenario B (engineer-facing): cross-context aggregation with explicit Transport discipline.

  • A project tries to fold measures that originate from different contexts. ULSAM does not “make it fine”; it requires Transport to be explicit (Bridge+CL/ReferencePlane) and routes penalties to R_eff only. If the project cannot cite Bridge ids and the effective congruence policy, folding is non-admissible (fail-closed by guard).

Bias-Annotation (informative)

This pattern intentionally biases CHR authoring toward explicit aggregation boundaries and against “scalarization by convenience”.

  • Gov (governance). Bias toward auditable folds (editions, effective ΓFoldRef, contributor surfaces). Risk: perceived overhead. Mitigation: keep the signature stable and move method specifics to SoTA wiring.
  • Arch (architecture). Bias toward keeping fold_Γ a distinct stage (no leakage into score/compare/select). Risk: longer pipelines. Mitigation: the stage is explicitly optional (fold_Γ?) and can be omitted when not required.
  • Onto/Epist (ontology/epistemology). Bias toward scale-lawful aggregation (no illegal ordinal arithmetic; SCP-bound). Risk: forbids many informal “single-number” habits. Mitigation: use partial orders and set-return selection unless a lawful fold is truly needed.
  • Prag (practice). Bias toward policy-bound defaults (no “implementation default Γ‑fold”). Risk: teams must name policies. Mitigation: provide conservative defaults in CG‑Spec.Γ_fold and keep overrides explicit.
  • Did (didactic). Bias toward one-governing pattern readability (this pattern is the governing pattern; no scavenger hunt). Risk: duplication temptation elsewhere. Mitigation: enforce Tell+Cite canonicalization.

Conformance Checklist (normative)

IDRequirement
CC‑A19ULSAM‑0MechAuthoring discipline: the canonical ULSAM Mechanism.Intension in A.19.ULSAM:4.1 MUST satisfy A.6.1 U.MechAuthoring and the relevant CC‑UM.* checks; this pattern does not override the U.Mechanism.Intension shape.
CC‑A19ULSAM‑1Single governing pattern: the canonical ULSAM U.Mechanism.Intension MUST be governed by A.19.ULSAM:4.1. Any other ULSAM “card” text MUST be reduced to Tell+Cite referencing this governing pattern section.
CC‑A19ULSAM‑2No hidden aggregation: any Γ‑fold MUST be explicit as ULSAM.Fold_Γ (no folding hidden inside Score/Compare/Select, including inside USCM/CPM/SelectorMechanism).
CC‑A19ULSAM‑3Scale-lawfulness: a conformant ULSAM fold MUST be CSLC-lawful and admissible under CGSpecSlot.SCP. Ordinal arithmetic is forbidden unless explicitly allowed by the relevant CSLC fragment.
CC‑A19ULSAM‑4Γ‑fold legality: a conformant ULSAM publication MUST ensure GammaFoldSlot resolves to CGSpecSlot.Γ_fold or an explicitly pinned override (CAL policy). “Implementation default fold” is non-conformant.
CC‑A19ULSAM‑5Evidence gating: a conformant ULSAM publication MUST guard folding via FoldEligibility_Γ with `GuardDecision ∈ {pass
CC‑A19ULSAM‑6SlotKind discipline: SlotKind tokens used in the ULSAM intension MUST come from the CHR SlotKind Lexicon (A.19.CHR:4.2.1). New SlotKinds require lexicon extension first.
CC‑A19ULSAM‑7Audit surface: Audit MUST record CNSpecRef.edition, CGSpecRef.edition, and the effective ΓFoldRef; and MUST record MinimalEvidenceRef when overridden (else cite CGSpecSlot.MinimalEvidence).
CC‑A19ULSAM‑8Contributor accountability: when ContributorSetSlot? is produced, it SHOULD be recorded (or referenced by stable id) as an explanation surface for what contributed after legality/evidence gating.
CC‑A19ULSAM‑9P2W separation: planned baseline plan items MUST bind ΓFoldRef/MinimalEvidenceRef/editions (A.15.3 + CHR P2W hook); these bindings MUST NOT be invented as run-time decisions inside the suite protocol.
CC‑A19ULSAM‑10Gate/guard separation: ULSAM MUST NOT embed GateDecision/GateLog or publish/telemetry operations in the fold_Γ? stage; admissibility is via FoldEligibility_Γ (tri‑state) and run‑time observability via Audit pins only.
CC‑A19ULSAM‑11No implicit UNM: ULSAM MUST NOT silently normalize/rescale to force comparability. When a compare‑on‑invariants surface is required, UNM MUST be invoked explicitly upstream and SHOULD be cited via stable ids/pins in Audit.

Common anti-patterns (didactic, informative)

Anti-patternSymptomWhy it fails in FPFHow to avoid
Hidden rollup inside scoring“Our score already averages everything.”Violates the “no hidden aggregation” law and hides Γ‑fold identity.Keep USCM.Score scoring-only; use ULSAM.Fold_Γ as an explicit stage.
Averaging ordinalsMeans on ranks/levels, or unitless mixingIllegal under CSLC/SCP unless explicitly allowed.Keep ordinal outputs as ordinal; compare via CPM; if folding is required, use an ordinal-legal fold explicitly declared by Γ_fold policy.
Implementation default Γ‑fold“If not specified, we use X.”Breaks replayability and violates Γ‑fold legality.Require GammaFoldSlot to resolve to CGSpecSlot.Γ_fold or pinned override.
Coercing unknown to a number“Missing metric becomes 0.”Violates tri-state guard discipline; silently changes meaning.Use FoldEligibility_Γ with `{pass
Cross-context folding without TransportFolding measures from different contexts “as-is”Violates Bridge-only discipline and penalty routing to R_eff.Make Transport explicit (Bridge+CL/ReferencePlane) and record ids in Audit.
Treating fold_Γ as mandatoryAlways folding even when not neededUnnecessary lossy compression; reduces set-return semantics.Keep fold_Γ? explicitly optional in protocols; prefer vector+CPM+Selector when possible.

Consequences (didactic, informative)

BenefitsCosts / trade-offs
Clear separation of concerns: folding is explicit and auditable.Adds an explicit step; authors must name Γ‑fold policies.
Prevents illegal “single-number” shortcuts (ordinal means, unit mixing).Some familiar heuristics become non-conformant.
Improves evolvability: folding methods evolve via wiring, while the kernel signature stays stable.Requires discipline to keep method specifics out of kernel prose.
Supports evidence-aware aggregation via tri-state guards.Guard + Audit expectations may feel heavier than ad-hoc aggregation.

Rationale (didactic, informative)

Aggregation is a semantic commitment: it changes a set/vector of measures into a single measure, and therefore changes what later comparison/selection can legitimately claim. In CHR, that commitment must be explicit, legality-gated, and auditable.

Keeping ULSAM as its own mechanism preserves:

  • the strict boundary between method choice (SoTA packs) and kernel signature (Mechanism.Intension),
  • the strict boundary between planned baseline (pins chosen in WorkPlanning) and run-time audit (what actually executed),
  • and the engineer-facing clarity that “we folded here, not everywhere”.

Known uses (didactic, informative)

  • CHR suite optional stage fold_Γ? (explicitly optional; never hidden).
  • Folding trust/assurance-like quantities (conservative Γ‑folds such as WLNK as declared defaults under trust policy).
  • Any project that requires an auditable “roll-up” measure prior to lawful comparison/selection.
  • In transduction graphs (E.18 / TGA): ULSAM appears as a mechanism instance node whose ΓFoldRef / MinimalEvidenceRef are bound in planned baseline (P2W), while Audit records the effective pins used at run time.

Builds on / Relates to

Builds on (cite, don’t duplicate).

  • A.6.1 (U.Mechanism.Intension shape; U.MechAuthoring; CC‑UM discipline).
  • A.6.5 (slot discipline; SlotIndex as a projection).
  • A.19.CHR (CHR suite boundary; stage fold_Γ?; CHR SlotKind Lexicon).
  • G.0 (CG‑Spec.Γ_fold, CG‑Spec.SCP, CG‑Spec.MinimalEvidence; legality gate).
  • A.18 (CSLC).
  • B.3 (Γ‑fold defaults for R_eff, including WLNK; trust skeleton).

Relates to (coordination, not governing-pattern assignment).

  • A.19.CN (CN‑Spec), via CNSpecSlot.acceptance gating in admissibility.
  • A.19.UINDM, A.19.USCM, A.19.CPM, and A.19.SelectorMechanism as adjacent CHR stages (Uses contour; no governing-pattern assignment transfer).
  • Part G SoTA packs and wiring (G.2 + G.*:Ext.*) for method family selection and edition/policy binding.

SoTA-Echoing (informative; not a center of gravity)

SoTA here is treated as method-family source publications and G.2 claim sheets to be wired through G.*:Ext.* wiring, not as kernel semantics. ULSAM’s contribution is the stable boundary: explicit, admissible, auditable folding.

SoTA vs popular note. This section records alignment to post‑2015 evidence‑backed practice. It is not a mandate to use fashionable methods; method semantics stay in SoTA packs (G.2) and wiring modules, while this pattern fixes the stable mechanism boundary.

Pack note (Phase‑3): this pattern does not currently cite a ULSAM‑specific G.2 SoTA pack/ClaimSheet. If/when such a pack is introduced, replace the bibliographic pointers below with the pack’s ClaimSheetId citations, keeping the mechanism semantics unchanged.

SoTA practice pointer (post‑2015+)Primary sourceWhere it connectsAdoption status
Permutation‑invariant set aggregation as a method family (set → summary)Zaheer et al., “Deep Sets” (2017) 1Candidate ΓFold families can include permutation‑invariant folds; ULSAM keeps them legality‑gated and policy‑pinned.Adapt (keep legality/pins explicit; do not treat learned folds as implicit defaults).
Attention-based permutation‑invariant set aggregation as a method familyLee et al., “Set Transformer” (2019) 4Alternative learnable set folds (pooling by attention); still requires explicit policy binding and legality gating.Adapt (publish as method family in SoTA pack; pin editions/policies; keep kernel unchanged).
Robust aggregation under uncertainty/outliers as a policy-selectable fold familyRahimian & Mehrotra, “Distributionally Robust Optimization: A Review” (2019) 2Treat “worst‑case / risk‑aware” folds as explicit Γ‑fold options (policy-bound), not as hidden safety margins.Adapt (policy‑bound and SCP/CSLC‑gated).
Governing-pattern discipline for architectural statementsISO/IEC/IEEE 42010:2022 3Supports the “one governing pattern” rule: ULSAM intension content lives here; other places cite.Adopt (principle-level; applied to FPF pattern governing-pattern assignment).

Reminder. “SoTA” means best known methods; it is not a synonym for “popular right now”. SoTA material should be curated and versioned in SoTA packs and connected via wiring modules, not embedded into kernel mechanism signatures.

A.19.ULSAM:End

Unified Comparison Mechanism (CPM)

Type: Architectural (A) Status: Stable Normativity: Normative (unless explicitly marked informative) Placement: Part A / CN‑Spec cluster (A.19) / CHR mechanism-governing patterns (Phase‑3) Source: FPF / CHR Phase‑3 mechanism-governing patterns Modified: 2026‑01‑20

Governing-pattern note, Phase‑3 canonicalization: this pattern governs the canonical U.Mechanism.Intension for CPM.IntensionRef (CHR suite stage compare). Mechanism-intension semantics are governed by explicitly designated governing patterns (E.20). A.6.1 governs the template of U.Mechanism.Intension; this pattern governs the CPM-specific constraints over the SlotKind surface supplied by the suite: operations, laws, admissibility, applicability, transport, plane, and audit obligations for that template. It is not a second schema and does not govern the CHR SlotKind lexicon.

Canonicalization hook, ID‑continuity‑safe: any other appearances of the CPM intension (e.g., suite prose in A.19.CHR) SHALL be reduced to a Tell + Cite stub pointing to A.19.CPM:4.1, while preserving the original section headings and their public PatternId:SectionPath IDs for continuity (alias‑dock legacy tokens rather than deleting them). Such stubs MUST NOT restate SlotIndex, OperationAlgebra, LawSet, AdmissibilityConditions, Applicability, Transport, Γ_timePolicy, PlaneRegime, or Audit content (no “second center of gravity” via near‑duplicate prose).

At a glance (didactic, informative)

CPM is the CHR comparison kernel: it compares two admitted profiles under an explicit, legality‑gated comparator and returns a set‑valued comparison outcome.

One-screen purpose (manager-first). CPM answers: “Given two admitted profiles and an explicit comparator, what relation holds under the declared legality frame?” It does not answer: “Which one should we pick?” (selection) nor “What is the score?” (scoring).

Manager quick checklist (before you trust a comparison):

  • Comparator is explicit: do we have a ComparatorSpecRef, and is it admitted by CG‑Spec.ComparatorSet?

  • Legality is declared: do we cite CG‑Spec (and SCP when numeric ops exist) and treat violations as degrade|abstain?

  • Evidence is not faked: are missing/unknown inputs routed to degrade|abstain under the effective MinimalEvidence policy (never to pass)?

  • Partiality is preserved: are we willing to accept incomparability/ties as first‑class outcomes (set‑valued result), rather than forcing a winner?

  • Suite stage: compare (pipeline order lives in A.19.CHR:4.5, not in the mechanisms[] enumeration).

  • Input (conceptual): left profile, right profile, CN‑Spec, CG‑Spec, an explicit ComparatorSpec, context slice; optional explicit MinimalEvidence override.

  • Output (conceptual): ComparisonResultSlot as a set of relation/poset tokens (not a single scalar, and not an embedded selection decision).

  • P2W seam: concrete ComparatorSpecRef.edition and any policy ids are bound only in planned baseline plan items (A.15.3 + A.19.CHR:4.7.2). CPM’s kernel does not bind project‑specific pins; executions record the effective refs/pins in Audit.

  • Reproducible comparisons: for parity/benchmark style runs that require a stable run package + report surface (editions, windows, parity pins), route packaging through G.9 (Parity / Benchmark Harness). CPM stays kernel‑only.

  • What CPM does not do (strict distinction):

    • does not normalize (UNM);
    • does not choose indicators (UINDM);
    • does not score (USCM);
    • does not fold/aggregate (ULSAM);
    • does not select (“pick best”) — that is SelectorMechanism.
  • Core safety commitments: legality gate via CG‑Spec.ComparatorSet + CG‑Spec.SCP + CSLC; tri‑state admissibility (pass|degrade|abstain); unknown never coerces to “pass” or to a fabricated outcome; no silent scalarization/totalization.

  • Where method details live: in editions of ComparatorSpec and their SoTA wiring (Part G packs/extensions), not inside CPM’s kernel semantics.

  • Quick rule of thumb: if you need numbers, that’s USCM; if you need a selection / selected-set result, that’s SelectorMechanism. CPM’s job is only: compare → relation tokens.

Problem frame

FPF’s Characterization (CHR) suite treats comparison as a distinct mechanism stage (compare) with suite‑wide obligations that forbid hidden scalarization/totalization, require tri‑state guards, and enforce legality surfaces for numeric operations. Comparison must therefore be described as:

  • a mechanism (in the U.Mechanism.Intension sense, per A.6.1 / slot discipline A.6.5),
  • that is suite‑conformant (per CHR obligations and protocol closure in A.19.CHR),
  • and governing-spec-ref-respecting (comparability and admission are governed by CN‑Spec and legality is gated by CG‑Spec rather than re-invented locally).

Within suite protocols, CPM appears as the explicit compare stage: it consumes admitted left/right profiles (scores and/or folded measures when those upstream stages are present) and produces a lawful, auditable comparison relation that downstream selection can consume without CPM smuggling selection or scoring semantics into “comparison”.

Problem

Engineering teams frequently need to compare two options (designs, methods, vendors, trajectories, hypotheses, etc.) across multiple measures and under incomplete evidence. Without a canonical comparison mechanism, teams predictably fall into one or more of these failure modes:

  • Hidden scalarization: forcing a single number (or a single winner) from multi‑criteria reality, erasing incomparability and ties.
  • Silent totalization: inventing an implied total order by convenience tie‑breakers or implicit thresholds, even when only a partial order is warranted.
  • Illegal arithmetic: comparing across measures using operations that are not scale‑lawful (CSLC‑violating) or not admitted by the declared legality frame.
  • Comparator drift: “the comparator” exists only as prose or code intuition; different teams compare the same option set and measure set differently because the comparator spec is not explicit and edition‑pinned.
  • Unknown coercion: missing/unknown evidence is coerced into an outcome (e.g., “treat missing as equal”, “treat unknown as worse”), producing comparisons that look decisive but are epistemically unsafe.
  • Cross‑context leakage: comparing across contexts or planes without explicit bridges, CL routing, or penalties discipline, producing misleading outcomes that ignore transport costs and reference plane constraints.

CPM exists to make the comparison act explicit, legality‑gated, set‑valued, and auditable—so downstream selection can remain a separate, policy‑bound step.

Forces

  1. Usability vs correctness: engineers want a “simple compare” function; correctness demands explicit legality, explicit comparator choice, and explicit handling of incomparability/unknown.
  2. Total order convenience vs partial order truth: total orders simplify downstream selection; partial orders are often the faithful representation (especially in multi‑criteria settings).
  3. Evolvability vs stability: comparator methods evolve (SoTA churn); kernel semantics and slot surfaces must remain stable and wiring‑friendly.
  4. Auditability vs speed-of-discussion: teams want fast decisions; FPF requires audit pins and explicit edition/policy references for reproducibility.
  5. Cross‑context reasoning vs transport discipline: comparisons across contexts are valuable, but they require bridge‑only crossings and explicit penalty routing, not implicit “normalization by hand”.
  6. Avoiding “second centers of gravity”: mechanism semantics must have a governing pattern; otherwise the suite, A.6.1 archetypes, and Part‑G wiring drift apart.

Solution

CPM is specified as a canonical U.Mechanism.Intension whose core commitments are:

  • Comparator legality is declared and gated (CG‑Spec.ComparatorSet, and CG‑Spec.SCP when numeric operations are involved; scale lawfulness via CSLC).
  • Results are set‑valued relation/poset tokens; partial orders remain partial; no silent scalarization or totalization.
  • Admissibility is tri‑state and fail‑closed on missing legality/evidence; unknown never coerces into a fabricated outcome.
  • Comparison remains distinct from selection; CPM produces relation outcomes; SelectorMechanism consumes them.

This pattern defines (governing-pattern, wiring‑friendly):

  1. a stable mechanism boundary for lawful comparison: Compare(...) → ComparisonResultSlot plus a tri‑state CompareEligibility guard;
  2. a stable SlotKind surface (by suite lexicon tokens) that downstream selection and Part‑G wiring can rely on without SlotKind drift;
  3. a legality/evidence responsibility split: legality is gated by CG‑Spec (and CSLC), while admission/comparability routing is cited from CN‑Spec;
  4. a minimal audit-pin requirement: what pins/editions MUST be recorded to make a comparison replay‑grade;
  5. explicit P2W separation: planned baseline binds editions/policies; CPM records effective bindings in Audit.

Mechanism.Intension (canonical; normative)

This is the canonical U.Mechanism.Intension for CPM.IntensionRef. It is intended to be cited by CHR suite publications and by any wiring layers.

  • Scope note: this intension is an instance authored to the U.Mechanism.Intension shape (A.6.1). It does not publish/telemetry, does not publish GateDecision nor DecisionLog surfaces (gate‑only), and does not embed selection. It emits Audit pins and a tri‑state guard only (per suite obligations).

    • P2W separation: this intension does not bind project‑specific pins (editions, policy‑ids, bridge ids, etc.). Binding lives in planned baseline plan items (A.15.3 + A.19.CHR:4.7.2); executions record effective refs/pins in Audit.
  • IntensionHeader: id = CPM, version = 1.0.0, status = stable.

  • IntensionRef: CPM.IntensionRef (canonical target for the suite member named in A.19.CHR:4.2).

  • SignatureManifest (optional; importability): if a CPM publication is intended for reuse beyond the CHR suite, author SHOULD publish a SignatureManifest that records (i) the declared Compare stage‑op signature, (ii) the SlotKind surface (by lexicon tokens), and (iii) the explicit set‑valued output commitment (no silent scalarization/totalization).

  • Tell. Lawful comparison producing set‑valued parity / poset outcomes (not a single scalar).

  • Purpose: lawful comparison producing set‑valued parity / poset outcomes (not a single scalar).

  • Imports: G.0 (CG‑Spec.ComparatorSet, CG‑Spec.SCP, CG‑Spec.MinimalEvidence), A.18 (CSLC), A.19.CN (comparability routing), A.19.CHR:4.2.1 (CHR SlotKind Lexicon).

  • SubjectBlock:

    • SubjectKind: Comparison.
    • BaseType: CHR‑typed measures in a CG‑Frame (see CG‑Spec.ComparatorSet).
    • SliceSet: U.ContextSliceSet.
    • ExtentRule: comparison ranges over admitted left/right profiles under the active context slice, using a declared comparator from CG‑Spec.ComparatorSet.
    • ResultKind?: U.Set (relation/poset token set; set‑valued by default).
  • SlotIndex (derived projection from SlotSpecs / guard SlotSpecs; uses A.19.CHR:4.2.1 SlotKind tokens; no independent semantics):

    • LeftProfileSlot : ⟨ValueKind = U.Set (of U.Measure), refMode = ByValue⟩,
    • RightProfileSlot : ⟨ValueKind = U.Set (of U.Measure), refMode = ByValue⟩,
    • CNSpecSlot : ⟨ValueKind = CN‑Spec, refMode = CNSpecRef⟩,
    • CGSpecSlot : ⟨ValueKind = CG‑Spec, refMode = CGSpecRef⟩,
    • ComparatorSpecSlot : ⟨ValueKind = ComparatorSpec, refMode = ComparatorSpecRef⟩,
    • ContextSlot : ⟨ValueKind = U.BoundedContext, refMode = U.BoundedContextRef⟩,
    • MinimalEvidenceSlot? : ⟨ValueKind = MinimalEvidence, refMode = MinimalEvidenceRef⟩ (optional override; otherwise cite CGSpecSlot.MinimalEvidence),
    • ComparisonResultSlot : ⟨ValueKind = U.Set (relation/poset tokens), refMode = ByValue⟩.
  • OperationAlgebra (suite stage = compare, per A.19.CHR:4.5; canonical stage‑op = Compare):

    • Compare(LeftProfileSlot, RightProfileSlot, CNSpecSlot, CGSpecSlot, ComparatorSpecSlot, ContextSlot, MinimalEvidenceSlot?) → ComparisonResultSlot.
  • LawSet (minimum; set‑valued comparison, no hidden scalarization):

    1. ComparatorSet gate: ComparatorSpecSlot MUST be an element of CGSpecSlot.ComparatorSet (legality gate; cite G.0).
    2. Set‑valued semantics: ComparisonResultSlot is set‑valued (parity/poset tokens); partial orders remain partial — no silent totalization/scalarization.
    3. CSLC+SCP legality: any numeric ops implied by the comparator MUST be admissible under CGSpecSlot.SCP and CSLC‑lawful (cite G.0 + A.18).
    4. Unknown is not coerced: missing/unknown evidence MUST NOT be mapped to a comparison outcome; use tri‑state guards.
    5. No hidden thresholds/tie‑breakers: any thresholds, epsilons, priority orders, or tie‑break logic MUST live in the declared ComparatorSpecSlot (or in CNSpecSlot.acceptance as explicit acceptance clauses), edition‑pinned and auditable; CPM MUST NOT smuggle constants.
    6. No implicit UNM: CPM MUST NOT perform normalization/alignment internally. If CNSpecSlot.comparability routes comparison through normalization‑based invariants, CompareEligibility MUST treat “inputs are already normalized to the declared invariants” as a precondition for pass (otherwise degrade|abstain per policy). Any UNM dependence MUST be explicit upstream and auditable.
  • AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality/evidence):

    • CompareEligibility(LeftProfileSlot, RightProfileSlot, CNSpecSlot, CGSpecSlot, ComparatorSpecSlot, ContextSlot, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.
    • pass requires: (i) ComparatorSpecSlot ∈ CGSpecSlot.ComparatorSet, (ii) any comparator‑implied numeric ops are admissible under CGSpecSlot.SCP and CSLC‑lawful for the effective measure scales, (iii) both profiles are admitted/comparable under CNSpecSlot.comparability and CNSpecSlot.acceptance for the given ContextSlot, and (iv) evidence satisfies the effective MinimalEvidence policy (explicit override via MinimalEvidenceSlot?, otherwise CGSpecSlot.MinimalEvidence).
    • If CNSpecSlot.comparability is normalization‑based (compare‑on‑invariants), pass additionally requires that the inputs are already in the required invariants/normalization regime; CPM MUST NOT “make them comparable” by silent normalization.
    • If MinimalEvidenceSlot is absent, the guard MUST evaluate evidence against CGSpecSlot.MinimalEvidence (by explicit rule), and MUST NOT return pass when evidence is missing/unknown or fails the effective MinimalEvidence gate.
  • Applicability:

    • Intended to be used as the CHR stage compare: it may follow indicatorization/scoring and optional folding when those stages are present, and it precedes selection wherever selection occurs; MUST remain distinct from selection (no embedded “pick best”).
    • Applicable only when legality/evidence surfaces are present via CGSpecSlot (fail‑closed otherwise).
    • When used inside the CHR suite, stage ordering/optionality is determined only by A.19.CHR:4.5 (suite_protocols); CPM does not infer order from mechanisms[].
  • Transport: Bridge+CL/ReferencePlane only; penalties route to R_eff only.

  • Γ_timePolicy: point by default (no implicit “latest”).

  • PlaneRegime: values live on episteme ReferencePlane; on plane crossings apply CL^plane policy; penalties → R_eff only.

  • Audit:

    • MUST record: CNSpecRef.edition, CGSpecRef.edition, and the effective comparator (ComparatorSpecRef).
    • When MinimalEvidenceSlot? is present, MUST record MinimalEvidenceRef; otherwise MUST cite CGSpecSlot.MinimalEvidence as the effective evidence policy.
    • SHOULD record: the realized GuardDecision for CompareEligibility, and (when degrade/abstain) any referenced failure‑behavior / downstream‑handling policy ids (e.g., a SoS‑LOG branch id) when such policies are in scope.
    • If CNSpecSlot.comparability routes comparison through normalization‑based invariants, Audit MUST record the effective upstream normalization dependency (e.g., the relevant UNM intension/edition or other explicit normalization witness), or explicitly record that the comparison abstained/degraded due to missing normalization admissibility.
    • SHOULD record: a stable description of ComparisonResultSlot and any Bridge/CL/ReferencePlane ids when Transport was invoked.

Interpretation notes — informative

  • Set‑valued output is the default, not a loophole. “Set‑valued” means CPM preserves incomparability/ties/partiality as first‑class outcomes; it does not authorize silent post‑processing into a scalar or a single winner.
  • Total orders are allowed only if declared by the comparator. If a ComparatorSpec defines a total order, CPM still outputs a (singleton) set of relation tokens; the totalization is a property of the declared comparator, not an implicit kernel default.
  • Normalization is not smuggled into comparison. If CN‑Spec.comparability routes comparison through normalization‑based invariants, that dependence must be represented explicitly via the suite protocol and/or explicit Uses contours (CPM consumes admitted profiles; it does not silently normalize them).
  • Thresholds and tie‑breakers are never “kernel constants.” If thresholds exist, they belong to explicit policies/specs (e.g., ComparatorSpec, AcceptanceClauses), edition‑pinned and auditable; not to hidden constants inside CPM.

Archetypal Grounding — informative

Tell

Think of CPM as an auditable relation‑builder:

  • Input: “two admitted profiles + an explicit comparator spec + declared legality/evidence surfaces”
  • Output: “a set‑valued relation outcome that preserves incomparability and uncertainty”

The key didactic boundary is: CPM compares; it does not decide.

Show (U.System) — comparing two supplier options without faking a total order

A program manager compares Supplier‑A vs Supplier‑B for a safety‑critical component. The team tracks a profile of measures (cost, lead time, defect rate, assurance, sustainability), but not all measures are strictly comparable across regions (different reporting regimes, different units).

  • The project has a declared CN‑Spec (admission + comparability routing) and a declared CG‑Spec that lists lawful comparators in ComparatorSet and evidence rules in MinimalEvidence.

  • The comparator chosen is explicit: ComparatorSpecSlot = ParetoDominanceComparatorSpecRef@edition (declared in CG‑Spec.ComparatorSet).

  • CPM runs Compare(...).

    • If Supplier‑A is better in cost but worse in defect rate and incomparable on assurance due to missing evidence, CPM does not invent “A wins” or “A loses”.
    • The guard returns degrade or abstain (per evidence policy), and the ComparisonResultSlot preserves the partial nature of the relation.
  • The downstream SelectorMechanism can then return a selected set (e.g., keep both suppliers in the candidate set) rather than forcing a single winner by hidden tie‑break rules.

Show (U.Episteme) — uncertainty‑aware comparison with set‑valued outcomes

A research lead compares two proposed methods for a system component. Both methods have performance estimates with uncertainty bounds (e.g., distributions or prediction intervals). The team uses a SoTA uncertainty quantification package (post‑2015 conformal families are a common example) to avoid overstating confidence.

  • USCM produces score profiles that are interval‑valued (or otherwise uncertainty‑annotated) rather than point estimates.
  • The chosen comparator is uncertainty‑aware and declared as a ComparatorSpec (edition‑pinned) in CG‑Spec.ComparatorSet.
  • CPM compares the two profiles and returns a set of relation tokens (e.g., “not worse”, “incomparable under evidence”, “abstain”), rather than forcing a numeric margin.
  • The audit records the effective comparator edition and evidence policy, so later readers can reproduce why a comparison abstained or degraded (instead of mistaking “missing evidence” for “equality”).

Bias-Annotation — informative

CPM is a comparison kernel; it does not remove bias by itself, but it prevents the most common bias‑amplifying failure modes (hidden thresholds, hidden tie‑breakers, unknown coercion).

Typical bias risks and mitigations:

  • Comparator choice encodes value judgments. Weights, priority orders, thresholds, and “tie‑break” conventions can encode organizational bias. CPM forces these to live in explicit, edition‑pinned ComparatorSpec records or policy records rather than in invisible code or informal reasoning.
  • Missing evidence is rarely random. If evidence is systematically missing for certain contexts/groups, naive “unknown → worse” is a bias amplifier. CPM’s tri‑state guard avoids coercion; but teams must still define policy‑bound failure behavior and be explicit when abstention is acceptable.
  • Cross‑context comparisons can embed structural unfairness. CPM enforces bridge‑only transport and penalty routing (R_eff only), making “comparisons across worlds” explicit instead of silently assuming commensurability.
  • Overconfidence via scalarization. Collapsing partial orders into scalars often overstates certainty and hides tradeoffs. CPM makes set‑valued outcomes first‑class, so the human/managerial decision can remain honest about tradeoffs.

Conformance Checklist

A CPM publication or use is conformant if it satisfies the checks below (these complement CC‑UM.* and the CHR suite obligations in A.19.CHR:4.3):

Check IdRequirement (normative)Notes (didactic / evidence)
CC‑A19CPM‑0Mechanism.Intension completeness. The publication includes the full intension shape (header/imports/subject/slot index/op algebra/laws/admissibility/applicability/transport/time/plane/audit) and uses tri‑state guards.SlotIndex is derived; see A.6.5 + CC‑UM.*.
CC‑A19CPM‑1Single governing pattern. The canonical CPM intension is governed here (A.19.CPM:4.1); other mentions are Tell + Cite stubs only.Prevents “two near‑identical cards” drift.
CC‑A19CPM‑2Suite stage alignment. Compare is the canonical stage‑op for CHR stage compare; ordering/optionality is taken only from A.19.CHR:4.5.Never infer order from mechanisms[].
CC‑A19CPM‑3SlotKind discipline. SlotKind tokens follow the suite lexicon (A.19.CHR:4.2.1).No SlotKind drift across specializations/wiring.
CC‑A19CPM‑4Comparator legality gate. ComparatorSpecSlot ∈ CGSpecSlot.ComparatorSet is enforced (fail‑closed otherwise).Legality is declared, not improvised.
CC‑A19CPM‑5Scale legality. Any numeric operations implied by the comparator are admissible under CGSpecSlot.SCP and CSLC‑lawful.“Weighted sum” etc must be explicitly lawful.
CC‑A19CPM‑6Set‑valued semantics. Outputs remain set‑valued; no silent scalarization or totalization is introduced.Incomparability/ties are first‑class outcomes.
CC‑A19CPM‑7Tri‑state admissibility (fail‑closed). `CompareEligibility(...) → {passdegrade
CC‑A19CPM‑8MinimalEvidence defaulting is explicit. If MinimalEvidenceSlot? is absent, the effective evidence policy is CGSpecSlot.MinimalEvidence by explicit rule.Avoid “implicit evidence policy.”
CC‑A19CPM‑9Gate/guard separation + lexeme discipline. CPM does not publish GateDecision nor DecisionLog; mechanism predicates use …Eligibility (not reserved gate …Guard).Aligns with suite obligations (gate_decision_separation, guard_lexeme_reservations).
CC‑A19CPM‑10Transport / plane discipline. Crossings are Bridge+CL/ReferencePlane only; penalties route to R_eff only; plane crossings use CL^plane when needed.Keep cross‑world comparisons explicit.
CC‑A19CPM‑11Audit completeness. Audit records CNSpecRef.edition, CGSpecRef.edition, effective ComparatorSpecRef@edition, and the effective evidence policy (override or cited default).SHOULD record GuardDecision + crossing ids.
CC‑A19CPM‑12P2W separation. Editions/policy‑ids are bound only in planned baseline plan items; CPM records effective refs/pins in Audit and does not bind them.Planned baseline = A.15.3 + suite PlanItem.
CC‑A19CPM‑13No implicit UNM. CPM never performs silent normalization; normalization‑based comparability requires explicit upstream UNM witness (or abstain/degrade).Keeps “compare‑on‑invariants” explicit.

Common Anti‑Patterns and How to Avoid Them

  • Anti‑pattern: “Comparison returns a score.” Symptom: Compare(x,y) returns a numeric margin or a single rank position. Avoid: keep numeric scoring in USCM; CPM returns relation tokens (set‑valued). If a numeric comparator is desired, it must be an explicit ComparatorSpec and still yields relation tokens as the kernel output.

  • Anti‑pattern: “CPM picks the winner.” Symptom: comparison logic embeds winner selection or selected-set truncation. Avoid: CPM only compares; selection is SelectorMechanism, which consumes comparison outcomes and remains policy‑bound.

  • Anti‑pattern: “Comparator by prose / by code default.” Symptom: comparator choice is implicit (e.g., “we usually do lexicographic by safety then cost”), not edition‑pinned. Avoid: require an explicit ComparatorSpecRef from CG‑Spec.ComparatorSet and record it in Audit.

  • Anti‑pattern: “GateDecision leakage.” Symptom: the compare step emits/assumes GateDecision, GateLog, or DecisionLog records as part of suite closure, or uses reserved gate‑lexemes (…Guard) for mechanism‑level predicates. Avoid: keep CPM at guard+audit level (…Eligibility → GuardDecision ∈ {pass|degrade|abstain}); assign gate decisions to their proper governing patterns or gate records and keep publish/telemetry outside suite closure.

  • Anti‑pattern: “SlotKind drift.” Symptom: renaming/re‑purposing LeftProfileSlot/RightProfileSlot/ComparatorSpecSlot/ComparisonResultSlot across specializations or across CHR layers. Avoid: use the suite SlotKind lexicon (A.19.CHR:4.2.1) and keep SlotIndex as a derived projection.

  • Anti‑pattern: “Smuggling plan‑binding into CPM.” Symptom: hard‑coding comparator editions, policy ids, or “launch values” inside the CPM intension/pattern prose. Avoid: bind editions/policies only in P2W planned baseline plan items; keep CPM refs‑only and record effective bindings in Audit.

  • Anti‑pattern: “Tie‑breakers as hidden constants.” Symptom: forced total order via untracked thresholds, epsilons, or “if equal then compare cost” logic. Avoid: make tie‑break policy part of explicit comparator/acceptance policies; pin editions; audit.

  • Anti‑pattern: “Unknown coerces to outcome.” Symptom: missing evidence treated as equal/zero/worse, producing decisive comparisons from absent information. Avoid: tri‑state guard; fail‑closed on missing evidence; explicit failure behavior via evidence policy.

  • Anti‑pattern: “Cross‑context compare without transport.” Symptom: comparing profiles across contexts or planes without Bridge+CL/ReferencePlane discipline. Avoid: use transport mechanisms and crossing pins; penalties route to R_eff only; audit crossing ids.

Consequences

  • Improved usability (didactic): CPM gives a single, engineer‑readable place to learn “what admissible comparison means” and what it does not mean.
  • Higher auditability: comparison outcomes can be traced to comparator edition, legality surfaces, and evidence policies.
  • Reduced semantic drift: teams cannot silently shift from Pareto to lexicographic to “weighted sum” without changing explicit comparator specs and pins.
  • Explicit tradeoffs: set‑valued outcomes force downstream reasoning to acknowledge incomparability and uncertainty rather than hiding them.
  • Cost: downstream consumers (notably selection) must handle sets, abstentions, and partial orders explicitly. This is intentional: it moves complexity from hidden heuristics into explicit policy‑bound mechanisms.

Rationale

  1. Set‑valued by design: partial orders are common in multi‑criteria settings; pretending they are total creates false certainty and brittle decisions.
  2. ComparatorSet gating: declaring what comparisons are legal (and under what scale/evidence rules) prevents “algorithm by convenience”.
  3. Tri‑state guards: explicit pass|degrade|abstain preserves epistemic honesty: unknown is not silently converted into an outcome.
  4. Strict distinction: separating compare from score and select prevents hidden semantic coupling and improves evolvability (methods change via wiring; kernel stays stable).
  5. Governing-pattern canonicalization: keeping one governing pattern eliminates “multiple near‑identical cards” that drift apart and destroy usability.

SoTA-Echoing

SoTA vs popular note. This section records alignment to post‑2015 evidence‑backed practice. It is not a mandate to use fashionable methods; method semantics stay in SoTA packs (G.2) and wiring modules, while this pattern fixes the stable CPM mechanism boundary.

Pack note (Phase‑3). If/when a CPM‑specific G.2 SoTA pack/ClaimSheet is introduced, prefer citing the pack’s ClaimSheetId(s) over raw bibliographic pointers below, keeping CPM’s kernel semantics unchanged.

SoTA practice pointer (post‑2015)How it connects to CPMAdoption status in FPF
Fair ranking / constrained ranking (e.g., Zehlike et al., 2017; Biega et al., 2018)Reinforces the “no hidden tie‑breaks/thresholds” stance: fairness constraints belong in explicit comparator/acceptance policies, not as silent kernel constants.Integrate via ComparatorSpec editions in CG‑Spec.ComparatorSet + policy pins; CPM remains unchanged.
Uncertainty‑aware / set‑valued inference (e.g., Romano et al., 2019; Barber et al., 2021)Supports “comparison may abstain” and “set‑valued outcomes are honest”: uncertain profiles should not be coerced into point‑comparisons.Model as comparator families (or supporting method families) packaged in G.2; wired into declared ComparatorSpec.
Differentiable sorting / learned comparators (e.g., Grover et al., 2019; Blondel et al., 2020)When comparators are learned, explicit comparator specs and edition pins become even more critical for auditability and drift control.Treated as method implementations behind ComparatorSpec (wiring‑only in Part G); CPM kernel stays stable.
Robust multi‑criteria decision support under partial orders (modern robust outranking / preference‑learning variants post‑2015)Emphasizes preserving incomparability and explicitly encoding thresholds/preferences as declared artifacts.Packaged as comparator families; legality and evidence remain gated by CG‑Spec.

Relations

Builds on / cites (non‑exhaustive):

  • A.6.1 (shape of U.Mechanism.Intension; specialization discipline)
  • A.6.5 (slot discipline; SlotIndex as derived projection)
  • A.19.CHR (suite membership + obligations + suite_protocols; CHR SlotKind lexicon)
  • A.15.3 + A.19.CHR:4.7.2 (P2W planned baseline binding; CPM remains refs‑only w.r.t. pin binding)
  • A.19.CN (CN‑Spec comparability routing + acceptance/admission surfaces)
  • G.0 (CG‑Spec: ComparatorSet, SCP, MinimalEvidence, CL/ReferencePlane framing)
  • A.18 (CSLC scale lawfulness)
  • E.10 (lexical/ontological authoring rules; kind suffix discipline)
  • E.19 (checks; authoring discipline)
  • E.20 (governing-pattern discipline)
  • F.18 (alias docking; ID continuity)
  • E.18 (E.TGA) (project transduction graphs consume CPM instances; CPM does not create a parallel “card deck”)

Relates to (typical neighbors in CHR Uses contour):

  • UNM.IntensionRef, UINDM.IntensionRef, USCM.IntensionRef, ULSAM.IntensionRef, and SelectorMechanism.IntensionRef (downstream consumer of CPM results).
  • G.5 (selection conformance), G.9 (parity / benchmark harness), G.10/PTM (publish/telemetry outside suite closure).

A.19.CPM:End

Unified Selection Kernel, SelectorMechanism

Type: Architectural (A) Status: Stable Normativity: Normative (unless explicitly marked informative) Placement: Part A / CN‑Spec cluster (A.19) / CHR mechanism-governing patterns (Phase‑3) Source: FPF / CHR Phase‑3 mechanism-governing patterns Modified: 2026‑01‑20

Governing-pattern note (Phase‑3 canonicalization): this pattern governs the canonical U.Mechanism.Intension for SelectorMechanism.IntensionRef (CHR suite stage select). Mechanism-intension semantics are governed by explicitly designated governing patterns (E.20:4.2). A.6.1 governs the template of U.Mechanism.Intension and the U.MechAuthoring discipline; this pattern governs the SelectorMechanism-specific slots, operations, laws, admissibility, applicability, transport, plane, time, and audit obligations for that template.

ID continuity note. When migrating away from any legacy “card location”, preserve public anchors: keep the legacy section heading/ID as a Tell + Cite stub (or dock aliases via F.18) rather than deleting or silently renaming it.

Canonicalization hook (ID‑continuity‑safe): any other appearances of the SelectorMechanism intension content (e.g., a legacy grounding stub in A.6.1 or suite prose in A.19.CHR) SHALL be reduced to a Tell + Cite stub pointing to A.19.SelectorMechanism:4.1, while preserving the original section headings and their public PatternId:SectionPath IDs for continuity (alias‑dock legacy tokens rather than deleting them). Such stubs MUST NOT restate SlotIndex / OperationAlgebra / LawSet / Admissibility / Audit content (no “second center of gravity” via near‑duplicate prose).

  • ID‑continuity‑safe: if content is moved from an earlier location, preserve the earlier heading and its IDs as a stub that cites A.19.SelectorMechanism:4.1.
  • Alias‑dock, don’t break: if any legacy tokens exist (e.g., a historical UNSELM name token), dock them via F.18 + E.10 rules; do not mint a competing head.
  • No shadow semantics: derived summaries MAY be informative, but MUST NOT restate SlotIndex / OperationAlgebra / LawSet / Admissibility / Audit; they may only summarise and cite.

At a glance — didactic, informative

  • What it is: a universal set‑returning selection kernel: it takes candidates, lawful comparison outcomes, and explicit criteria, and returns a selected set, not a forced single winner.
  • What it is not: it is not a hidden scoring model, not a comparator, not a gate, and not a telemetry or publishing step.
  • Why it exists: to prevent three recurring failure modes: hidden thresholds, silent scalarization, and winner‑take‑all defaults under partial orders and uncertain evidence.
  • How it evolves: method semantics and SoTA algorithm families connect via G.2 packs and wiring modules; the kernel signature stays stable and teachable.
  • Suite stage: select (ordering lives only in A.19.CHR:4.5 / suite_protocols; suite membership is a set in A.19.CHR:4.2).
  • Inputs (conceptual): CandidateSetSlot + ComparisonResultSlot (lawful relation/poset tokens, typically produced by CPM) + CriteriaSlot + CNSpecSlot + CGSpecSlot + ContextSlot (+ TaskSignatureSlot?, + MinimalEvidenceSlot? override).
  • Output (conceptual): SelectionSlot = selected set (a singleton is allowed only when explicitly demanded by criteria or by an explicitly declared upstream total order).
  • Non‑goals: does not normalize (UNM), indicatorize (UINDM), score (USCM), fold (ULSAM), compare (CPM), define acceptance thresholds, publish, or emit telemetry; it is a selection step over already‑lawful inputs.
  • P2W seam: concrete edition/policy pin bindings (e.g., TaskSignatureRef@edition(…), CGSpecRef@edition(…), evidence overrides) are chosen in planned baseline plan items (A.15.3 + A.19.CHR:4.7.2); executions only record effective refs/pins in Audit.
  • TGA use: when used as a node type in E.18 (E.TGA), selector instances are chosen in planned baseline plan items (P2W); this pattern governs the intension that those instances cite.
  • Failure mode: tri‑state guard (pass|degrade|abstain); missing/unknown evidence never coerces to pass.
  • Mental model: SelectEligibility gates the step; Select applies explicit criteria to set‑valued comparison outcomes; the result is a selected set whose “single winner” behavior must be explicit.

Problem frame

FPF’s Characterization (CHR) suite treats selection as a distinct mechanism boundary within the suite (authoritative membership: A.19.CHR:4.2). Suite membership is a set; order has no semantics. Any intended ordering is expressed only via suite_protocols (A.19.CHR:4.5), under suite obligations (A.19.CHR:4.3).

Within the suite‑closed protocol, SelectorMechanism appears as the select stage (after lawful comparison; optional stages remain explicitly optional per suite_protocols). The kernel’s role is concept‑level and governed by CN‑Spec and CG‑Spec:

  • consume lawful comparison outcomes without collapsing them into a hidden scalar,
  • apply explicit criteria and policy routing, and
  • return a selected-set result whose defaults are policy‑bound and auditable.

The kernel uses the CHR suite SlotKind lexicon (A.19.CHR:4.2.1) to prevent SlotKind drift across specializations and across SoTA wiring layers.


Problem

Engineering teams regularly need to make “a selection decision” under conditions that are normal in real projects:

  • comparisons are partial, multi‑criteria, or set‑valued,
  • evidence is incomplete or policy‑gated, and
  • different stakeholders ask for different “best” notions.

If selection is not a first‑class mechanism boundary with stable semantics, the same high‑risk drift happens repeatedly:

  • Silent winner forcing: partial orders get collapsed to a single winner by ad‑hoc tie‑breakers or hidden weights.
  • Hidden thresholds and constants: thresholds, weights, dominance regimes, and default PortfolioMode fields get smuggled into implementations and become invisible in discussion and audit.
  • Scalarization by convenience: set‑valued comparison outcomes get replaced by a scalar “score summary” that is treated as decision‑relevant without being declared as such.
  • Evidence coercion: missing or unknown evidence gets treated as “good enough” (implicit pass) rather than routing to explicit degrade or abstain.
  • Boundary erosion: selection quietly performs comparison, scoring, aggregation, or publishing, making the CHR pipeline opaque and hard to reason about.

Forces

  1. Set‑valued reality vs single‑winner convenience. Many lawful comparisons are partial orders. The kernel must preserve set‑valued semantics while still allowing single‑winner outcomes when explicitly requested by criteria.

  2. Policy primacy vs method freedom. Criteria and defaults must be explicit and policy‑bound, while multiple method families and decision styles must remain add‑able without mutating the kernel.

  3. No hidden thresholds vs usability pressure. Engineers often want “just pick one.” If the spec does not constrain this, hidden thresholds and tie‑breakers become de facto policy.

  4. Evidence discipline vs delivery pressure. Under uncertainty, teams default to coercion (unknown → pass). The kernel must enforce tri‑state eligibility and fail‑closed discipline.

  5. Auditability vs conceptual minimalism. FPF stays conceptual. Audit obligations must be minimal yet decisive: editions and effective policy routing must be visible without introducing tool‑level governance.

  6. Evolvability vs didactic usability. The kernel must be stable enough to support SoTA wiring and specialisation chains, but also teachable: one place to learn the boundary, laws, guard behavior, and audit minimum.

  7. P2W separation and gate/guard separation. Planned binding of fillers and pins lives in WorkPlanning (P2W). Selection must not mutate into a gate pattern: no GateDecision or decision logs inside the mechanism boundary.

  8. No competing defaults. If defaults exist (for PortfolioMode, dominance regime, archive policies), they must be cited from their declared defaults sources, not replicated or re-declared inside the kernel (A.19.CHR:4.3.5).


Solution

SelectorMechanism is the canonical selection kernel for CHR and for selector specializations. It provides:

  • a stable mechanism boundary for select,
  • a stable SlotKind surface (via the CHR lexicon),
  • a minimum law set that preserves set‑valued semantics and forbids hidden thresholds and hidden scalarization,
  • a tri‑state admissibility guard that is fail‑closed under missing legality or evidence,
  • an audit minimum that records effective editions and policy routing.

Method semantics and SoTA algorithm families do not live inside the kernel: they connect via G.2 SoTA packs and wiring modules, and via lawful specializations ⊑/⊑⁺ that obey the specialisation-chain discipline (A.6.1:4.2.1).

Mechanism.Intension — normative core

Archetypal Grounding — Mechanism.Intension (normative).

  • Scope note: this intension is an instance authored to the U.Mechanism.Intension shape governed by A.6.1. It defines only the mechanism’s semantic surface (slots/ops/laws/guards/audit). It does not bind project‑specific pins (P2W), and it does not emit GateDecision/GateLog; it emits Audit pins and a tri‑state guard only.

  • Canonicality note: this is the canonical U.Mechanism.Intension for SelectorMechanism.IntensionRef and is intended to be cited by CHR suite publications and by any wiring layers; other mentions are Tell + Cite only.

  • IntensionHeader: id = SelectorMechanism, version = 1.0.0, status = stable.

  • IntensionRef: SelectorMechanism.IntensionRef (canonical target for the suite member named in A.19.CHR:4.2).

  • Tell. Universal set‑returning selection kernel over candidates and criteria; defaults remain policy‑bound; no hidden thresholds.

  • Purpose: universal set‑returning selection kernel over candidates and criteria; defaults remain policy‑bound; no hidden thresholds.

  • Imports: A.6.1:4.2.1 (specialisation relation chains), A.6.5 (slot discipline; SlotIndex as projection), A.19.CN (CN‑Spec governance card), C.22 (TaskSignature as a policy-routing artifact when used), G.5 (selector conformance and default routing), G.0 (CG‑Spec legality and evidence gates), A.19.CHR:4.2.1 (CHR SlotKind Lexicon).

  • SubjectBlock:

    • SubjectKind: Selection.
    • BaseType: U.Set (candidates) + U.RelationTokenSet (lawful comparison outcomes).
    • SliceSet: U.ContextSliceSet.
    • ExtentRule: selection ranges over admitted candidates in the active context slice, constrained by explicit criteria/policies and by lawful comparison outcomes.
    • ResultKind?: U.Set.
  • SlotIndex: derived projection from SlotSpecs (and any guard‑only SlotSpecs) per slot discipline; uses A.19.CHR:4.2.1 SlotKind tokens; has no independent semantics.

    • CandidateSetSlot : ⟨ValueKind = U.Set (candidates), refMode = ByValue⟩.
    • ComparisonResultSlot : ⟨ValueKind = U.Set (relation/poset tokens), refMode = ByValue⟩.
    • CriteriaSlot : ⟨ValueKind = U.Set (selection criteria / clauses, incl. explicit tie‑breakers; **acceptance thresholds are not criteria** and remain governed by the cited acceptance surfaces and applied only via SelectEligibility), refMode = ByValue⟩.
    • TaskSignatureSlot? : ⟨ValueKind = TaskSignature, refMode = TaskSignatureRef⟩ optional; when present, SHOULD be the single routing slot/ref for selector defaults (e.g., PortfolioMode / dominance regime), but it does not replace CNSpecSlot / CGSpecSlot governing spec refs.
    • CNSpecSlot : ⟨ValueKind = CN‑Spec, refMode = CNSpecRef⟩.
    • CGSpecSlot : ⟨ValueKind = CG‑Spec, refMode = CGSpecRef⟩.
    • ContextSlot : ⟨ValueKind = U.BoundedContext, refMode = U.BoundedContextRef⟩.
    • MinimalEvidenceSlot? : ⟨ValueKind = MinimalEvidence, refMode = MinimalEvidenceRef⟩ optional override; otherwise the effective evidence policy is CGSpecSlot.MinimalEvidence.
    • SelectionSlot : ⟨ValueKind = U.Set (selected set), refMode = ByValue⟩.
  • OperationAlgebra suite stage = select, per A.19.CHR:4.5; canonical stage op = Select

    • Select(CandidateSetSlot, ComparisonResultSlot, CriteriaSlot, CNSpecSlot, CGSpecSlot, ContextSlot, TaskSignatureSlot?, MinimalEvidenceSlot?) → SelectionSlot.
  • LawSet (minimum): the selection kernel is set‑returning and policy‑bound

    1. Set‑returning by default: a conformant Select MUST return a declared selected set by default. It MUST NOT silently collapse partial orders or incomparabilities to a single winner; if a singleton outcome is required, it MUST be an explicit criterion (or a declared upstream total order).
    2. No hidden thresholds/constants: a conformant publication MUST NOT smuggle thresholds, weights, dominance rules, or tie‑breakers. Selection‑level commitments MUST be explicit in CriteriaSlot and/or in explicit policy routing exposed through TaskSignatureSlot. Admissibility/acceptance thresholds are applied only via SelectEligibility using CNSpecSlot.acceptance and the effective evidence policy (MinimalEvidenceSlot? or CGSpecSlot.MinimalEvidence).
    3. No hidden scalarization: a conformant publication MUST consume ComparisonResultSlot as set‑valued/partial when it is set‑valued/partial. Scalar summaries (if produced at all) are report‑only unless explicitly promoted by policy outside suite closure.
    4. Evidence gating is explicit: when selection depends on evidence, it MUST cite either MinimalEvidenceSlot (override) or the effective policy CGSpecSlot.MinimalEvidence, and it MUST route the operation through tri‑state guards (no unknown coercion). Any candidate‑level ineligibility handling MUST be explicit (criteria and/or upstream outputs) and auditable (no silent dropping); the kernel MUST NOT invent new evidence thresholds.
    5. No competing defaults: PortfolioMode/dominance defaults (when relevant) MUST be sourced from their declared governing patterns (typically via TaskSignatureSlot routing and/or the selector conformance/default rules in G.5), and MUST NOT be re‑declared inside the kernel.
  • AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality or evidence)

    • SelectEligibility(CandidateSetSlot, ComparisonResultSlot, CriteriaSlot, CNSpecSlot, CGSpecSlot, ContextSlot, TaskSignatureSlot?, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.
    • pass requires at minimum: (i) ComparisonResultSlot is compatible with CandidateSetSlot (same candidate universe), (ii) all selection criteria and any tie‑breakers are explicit (via CriteriaSlot and/or TaskSignatureSlot), (iii) admissibility/acceptance gates (CNSpecSlot.acceptance, evidence) do not fail, and (iv) CNSpecSlot and CGSpecSlot are coherent for the comparison tokens being consumed (no mixed CN-Spec/CG-Spec pairings).
    • If MinimalEvidenceSlot is absent, SelectEligibility MUST evaluate evidence against CGSpecSlot.MinimalEvidence by explicit rule, and missing/unknown evidence MUST NOT yield pass.
    • degrade is permitted only when an explicit, auditable failure behavior exists (policy‑bound), e.g., “exclude ineligible candidates” or “sandbox/probe‑only”; abstain is used when selection cannot proceed admissibly under the declared criteria/policies.
  • Applicability:

    • Intended as the last stage of CHR selection after lawful comparison, producing a selected-set-valued result.
    • Cross‑context selection is allowed only via explicit Transport (Bridge+CL/ReferencePlane) and cannot bypass CG‑Spec legality.
  • Transport: declarative‑only: no embedded CL/Φ/Ψ tables and no new transport edges; crossings are via cited Bridge+CL/ReferencePlane surfaces; penalties route to R_eff only.

  • Γ_timePolicy: point by default, no implicit latest.

  • PlaneRegime: declarative‑only; does not introduce plane crossings. If selection spans planes, it MUST cite the applicable ReferencePlane and CL^plane policy; penalties route to R_eff only.

  • Audit:

    • Must record: CNSpecRef.edition, CGSpecRef.edition.
    • If TaskSignatureSlot? is present, must record TaskSignatureRef.edition.
    • If MinimalEvidenceSlot? is present, must record MinimalEvidenceRef; otherwise must cite CGSpecSlot.MinimalEvidence as the effective evidence policy.
    • SHOULD record: the realized GuardDecision (pass|degrade|abstain) and, when non‑pass, the policy‑bound failure behavior reference that justified it.
    • SHOULD record: a stable identity for CandidateSetSlot and ComparisonResultSlot or a citable upstream Audit anchor that already fixes these identities; the goal is traceability without duplicating upstream semantics.
    • MUST record: a stable identity for SelectionSlot.
    • SHOULD record: a stable description (or citable reference) for the effective selection criteria record or reference (e.g., criteria record ids when criteria are reference‑backed; TaskSignatureRef when used).
    • SHOULD record: the realized routing‑relevant selector defaults (e.g., PortfolioMode / dominance regime) when they are not fully determined by a referenced TaskSignatureRef or an explicit CAL policy surface; the point is auditability, not re‑declaring defaults.
    • SHOULD record: any Bridge/CL/ReferencePlane ids when Transport was invoked.

Boundary and layering rules

  1. Selection consumes upstream CHR products, it does not invent them. ComparisonResultSlot is an input: the kernel MUST NOT perform normalization (UNM), indicatorization (UINDM), scoring (USCM), folding (ULSAM), or comparison (CPM) inside Select. If a scalar “overall score” is desired, it must be declared upstream as a lawful scoring and/or comparator choice, not invented inside selection.

  2. Threshold discipline (acceptance ≠ selection). Acceptance/admission thresholds are not selection criteria: they live in AcceptanceClauses / TaskSignature / GateProfile records per A.19.CHR:4.3.5 and are applied only via SelectEligibility. Selection‑level tie‑breakers, PortfolioMode, or selected-set constraints MAY exist, but MUST be explicit and auditable (typically as criteria records or explicit policy routing), never as unnamed constants.

  3. Report‑only summaries inside suite closure. Any scalar summaries, illumination metrics, or auxiliary “why not chosen” telemetry are report‑only unless explicitly promoted by policy, and MUST NOT be used as hidden dominance rules (A.19.CHR:4.3.3). Publishing and telemetry remain outside suite closure and are handled by established publication forms such as G.10 or PTM, not as hidden tails inside selection.

  4. Specializations are explicit and disciplined. Any refinement or extension of SelectorMechanism must follow A.6.1:4.2.1:

    • SlotKind invariance for inherited operations,
    • no new mandatory inputs to inherited Select,
    • added capabilities appear as new operations or as ⊑⁺ extensions.
  5. P2W seam is preserved. Planned bindings for TaskSignatureRef@edition, CGSpecRef@edition, evidence policy overrides, and other pins live in WorkPlanning (P2W). Execution visibility is via Audit, not by mutating plan objects at run time.


Archetypal Grounding — informative

Tell

When comparisons are partial or set‑valued, selection must not pretend there is a single “best” by default. SelectorMechanism makes selection explicit, policy‑bound, and auditable: it returns a set unless criteria explicitly demand otherwise.

Show, U.System example

Scenario. A platform team must pick a set of deployment options for a subsystem under multiple criteria: latency, cost, and regulatory risk. Comparisons are multi‑criteria and do not induce a total order.

  • CandidateSetSlot = {OptionA, OptionB, OptionC}

  • ComparisonResultSlot includes tokens such as:

    • OptionA ≼ OptionB on latency,
    • OptionB ≼ OptionA on cost,
    • OptionC incomparable with both on risk evidence (missing attestations).
  • CriteriaSlot contains explicit clauses:

    • “return all non‑dominated candidates under ParetoOnly,”
    • “candidates missing required evidence must not pass.”
  • MinimalEvidenceSlot? is absent, so evidence is evaluated against CGSpecSlot.MinimalEvidence.

Outcome.

  • SelectEligibility returns degrade (or abstain, depending on the declared failure behavior) because OptionC fails evidence gating; selection excludes OptionC under an explicit policy route rather than coercing unknowns.
  • SelectionSlot returns {OptionA, OptionB} as a selected set, rather than forcing a single winner.
  • Audit records CGSpecRef.edition, the effective evidence policy, and the stable identity of the selected set result.

Show, U.Episteme example

Scenario. A methods group selects a declared set of analysis methods for a task. Candidates are method family refs. The group wants diversity in the selected set, but does not want diversity metrics to silently become dominance criteria.

  • CandidateSetSlot = {Family1, Family2, Family3, Family4}

  • ComparisonResultSlot is produced by lawful comparison on declared indicators and evidence gates.

  • TaskSignatureSlot is present and is the single routing slot/ref for policy defaults:

    • PortfolioMode and dominance regime,
    • budgeting/telemetry hooks (when used).
  • CriteriaSlot declares that diversity signals are telemetry unless explicitly promoted by policy.

Outcome.

  • SelectionSlot returns a selected set; any archive‑style behavior is a specialization and policy choice, not a hidden kernel default.
  • Audit records TaskSignatureRef.edition, enabling reproducibility and post‑hoc explanation without embedding tool tokens into the kernel.

Bias-Annotation — informative

This pattern intentionally biases selection authoring toward explicitness and legality.

  • Governance bias. Bias toward explicit criteria and policy-routing records rather than implicit constants. Risk: perceived overhead. Mitigation: keep criteria records minimal, and centralize defaults via TaskSignatureSlot when used.
  • Architecture bias. Bias toward set‑return semantics and against forced total orders. Risk: consumers may expect a single winner. Mitigation: make single‑winner selection an explicit criterion or a declared comparator outcome, not an implicit kernel behavior.
  • Epistemic bias. Bias toward fail‑closed evidence handling and against unknown coercion. Risk: more degrade/abstain early. Mitigation: improve evidence pins and policy clarity; do not relax the kernel.
  • Practice bias. Bias against embedding telemetry and publishing into selection. Risk: teams want a one‑stop “select and report.” Mitigation: keep reporting in post‑suite routing patterns and record only minimal audit pins here.
  • Didactic bias. Bias toward one governing pattern and “Tell + Cite” elsewhere. Risk: refactoring work. Mitigation: the result is a spec that can be read and taught without scavenger hunts.

Conformance Checklist

IDRequirement
CC‑A19SelectorMechanism‑0MechAuthoring discipline: the canonical SelectorMechanism Mechanism.Intension in A.19.SelectorMechanism:4.1 MUST satisfy A.6.1 U.MechAuthoring and the relevant CC‑UM.* checks; this pattern does not override the U.Mechanism.Intension shape.
CC‑A19SelectorMechanism‑1Single governing pattern: the canonical SelectorMechanism U.Mechanism.Intension MUST be governed by A.19.SelectorMechanism:4.1. Any other SelectorMechanism “card” text MUST be reduced to Tell+Cite referencing this governing pattern section.
CC‑A19SelectorMechanism‑2Set‑return default: a conformant Select MUST be set‑returning by default; it MUST NOT silently collapse partial orders or incomparabilities to a single winner.
CC‑A19SelectorMechanism‑3No hidden thresholds/constants: a conformant SelectorMechanism publication MUST NOT smuggle thresholds, weights, dominance rules, tie‑breakers, or default PortfolioMode fields. Selection‑level commitments MUST be explicit in CriteriaSlot and/or explicit policy routing (e.g., via TaskSignatureSlot). Acceptance thresholds remain governed by AcceptanceClauses / TaskSignature / GateProfile records and MUST be applied only via SelectEligibility.
CC‑A19SelectorMechanism‑4No hidden scalarization: if ComparisonResultSlot is set‑valued or partial, a conformant publication MUST consume it as such; scalar summaries are report‑only unless explicitly promoted by policy outside suite closure.
CC‑A19SelectorMechanism‑5Evidence gating: a conformant publication MUST guard selection via SelectEligibility with `GuardDecision ∈ {pass
CC‑A19SelectorMechanism‑6SlotKind discipline: SlotKind tokens used in the SelectorMechanism intension MUST come from the CHR SlotKind lexicon (A.19.CHR:4.2.1). New SlotKinds require lexicon extension first.
CC‑A19SelectorMechanism‑7Transport discipline: cross‑context and cross‑plane selection MUST be explicit via Bridge+CL/ReferencePlane; penalties route to R_eff only, and crossings MUST be auditable.
CC‑A19SelectorMechanism‑8Audit surface: Audit MUST record CNSpecRef.edition, CGSpecRef.edition, and the effective evidence policy (record MinimalEvidenceRef when overridden; else cite CGSpecSlot.MinimalEvidence); MUST record TaskSignatureRef.edition when TaskSignatureSlot? is used; and MUST record a stable identity for the resulting SelectionSlot.
CC‑A19SelectorMechanism‑9P2W separation: planned baseline plan items MUST bind editions and policy pins (A.15.3 + CHR P2W hook); these bindings MUST NOT be invented as run-time decisions inside the suite protocol.
CC‑A19SelectorMechanism‑10Specialisation-chain discipline: any ⊑/⊑⁺ specialization of SelectorMechanism MUST satisfy A.6.1:4.2.1, especially SlotKind invariance and “no new mandatory inputs” to inherited Select.
CC‑A19SelectorMechanism‑11Guard + gate separation: SelectorMechanism MUST NOT publish GateDecision/DecisionLog; the mechanism‑level guard is SelectEligibility returning `GuardDecision := {pass

Common Anti-Patterns and How to Avoid Them — informative

Anti-patternWhat it looks likeRemedy
GateDecision leakageSelect emits GateDecision or writes a decision logKeep gate decisions in gate patterns; selection uses SelectEligibility + Audit pins only
Forced single winnerSelect always returns exactly one candidate even under incomparabilityReturn a declared selected set by default; if single winner is required, make it explicit in CriteriaSlot and ensure the induced order is lawful and declared
Hidden tie-breakers“If incomparable, pick lower cost” without declaring that as policyMove tie-breakers into explicit criteria or into declared comparator policies; never embed inside the kernel
Scalarization by convenienceReplace set-valued comparison with a scalar “summary score” treated as decisiveKeep summaries report-only unless explicitly declared as lawful comparator outputs
Unknown coerced to passMissing evidence treated as acceptableUse tri-state SelectEligibility; unknown maps to degrade or abstain
Selection does comparisonSelection stage recomputes scoring or comparison internallyKeep comparisons upstream; SelectorMechanism consumes ComparisonResultSlot
Publish inside selectionSelection stage emits publish/telemetry as part of the suite stepKeep publishing and telemetry outside suite closure; record minimal pins in Audit

Consequences

Benefits

  • Preserves correctness under partial orders by making set‑valued outcomes first‑class.
  • Eliminates a major source of decision drift: hidden thresholds, hidden weights, and silent scalarization.
  • Improves auditability and teachability: one governing pattern location for selection semantics and its guards.
  • Supports evolvability: new method families and selection styles can be wired without changing the kernel signature.

Costs / trade-offs

  • Selected-set results can require explicit downstream handling when a single decision is needed.
  • Strict evidence discipline increases early degrade/abstain until criteria and evidence policies are explicit.
  • Teams must invest in explicit criteria records instead of relying on implicit conventions.

Rationale

Selection is where many systems accidentally convert lawful but nuanced information into an unjustified scalar decision. Making selection a separate, explicit mechanism boundary achieves two things that matter for engineering management:

  1. Technical integrity: it enforces legality and evidence discipline at the decision boundary without smuggling heuristics.
  2. Organizational clarity: it makes defaults and thresholds discussable, reviewable, and maintainable as explicit policy surfaces.

The set‑returning default is not a preference for large retained sets; it is a correctness safeguard when the order is not total. Single‑winner outcomes remain possible, but only by explicit criteria or declared lawful comparators.


SoTA-Echoing

SoTA vs popular note. This section records alignment to post‑2015 evidence‑backed practice. It is not a mandate to use fashionable methods; method semantics stay in SoTA packs (G.2) and wiring modules, while this pattern fixes the stable selection boundary.

Pack note, Phase‑3: this pattern does not currently cite a SelectorMechanism‑specific G.2 pack or ClaimSheet. If and when such packs are introduced, they should connect via CriteriaSlot and TaskSignatureSlot routing, keeping kernel semantics unchanged.

SoTA alignment map (normative)

SoTA practice pointer, post‑2015+Primary source examples, post‑2015+Where it connects to SelectorMechanismAdoption status
Treat the Pareto set or declared selected set as a first-class output under multi-criteria partial ordersQuality Diversity as a decision framing, e.g., Pugh et al. 2016; Vassiliades et al. 2018Expressed as set‑return default and explicit set-return criteria; method details live in specializations and wiringAdapt
Use archive-based retained sets where diversity is part of the result, but do not silently promote it to dominanceModern QD and archive practices post‑2015, including map-elites descendants and archive insertion policiesExpressed as policy‑bound criteria and report‑only telemetry unless explicitly promotedAdapt
Pair environments and methods in open-ended or co-evolutionary settings without breaking kernel semanticsOpen-ended environment-method pairing, e.g., Wang et al. 2019 and successorsExpressed as candidate and criteria structuring plus lawful specializations; kernel unchangedAdapt
Include an explicit abstain or reject option under uncertainty rather than forcing a decisionSelective prediction and rejection-option practice, e.g., Geifman and El‑Yaniv 2017; follow-on selective netsExpressed as tri-state SelectEligibility with fail-closed disciplineAdopt
Keep architecture commitments traceable to one governing patternISO/IEC/IEEE 42010:2022 architecture description disciplineExpressed as explicit governing-pattern assignment and Tell+Cite stubs elsewhereAdopt

Notes per row (1–2 sentences; why adopt/adapt/reject):

  • Selected-set-as-output (QD framing): adopt the decision framing (declared selected set as a first-class result) while keeping concrete QD/retained-set algorithms out of the kernel; they belong in G.2 packs and wiring modules, preserving evolvability.
  • Archive retained sets (diversity as result): adapt archive thinking by keeping diversity/illumination signals report‑only unless an explicit CAL/policy promotes them to dominance; this prevents silent scalarization and preserves governing-pattern defaults (typically G.5 and CAL).
  • Open‑ended environment–method pairing: keep the kernel unchanged; open‑ended pairing is expressed by shaping candidates/criteria (and, when needed, lawful specializations ⊑/⊑⁺) with explicit edition pins and transfer/validity rules in planned baseline, not by mutating Select.
  • Reject/abstain under uncertainty: adopt the rejection‑option stance as a tri‑state guard with fail‑closed semantics; explicit abstain is preferable to forced choice under missing legality/evidence.
  • Governing-pattern architecture discipline: adopt governing-pattern + Tell‑and‑Cite to keep the spec teachable and reviewable; this directly reduces drift and “second centers of gravity”.

Relations

  • Builds on

    • A.6.1 and CC‑UM.* for the mechanism intension shape and specialisation-chain discipline.
    • A.19.CHR for suite membership, suite protocol closure, SlotKind lexicon, and threshold and default discipline.
    • G.0 for CG‑Spec legality and evidence surfaces.
    • A.19.CN for CN‑Spec governance card used as an explicit input.
    • C.22 for TaskSignature as a policy-routing artifact when used.
    • A.6.5 for slot discipline (SlotIndex as projection; SlotKind invariance).
    • A.15.3 + A.19.CHR:4.7.2 for the P2W planned baseline seam for edition/policy pin bindings (cited as seam, not duplicated in Intension).
  • Used by

    • A.19.CHR as the canonical select stage in CHR pipelines.
    • G.5 as the primary conformance and specialization context for selector-based method dispatch and PortfolioMode policies.
    • E.18 (E.TGA) when selector instances are used as transduction graph nodes; planned pins live in P2W, effective pins surface via Audit.
  • Coordinates with

    • CPM and other lawful comparison stages as producers of ComparisonResultSlot.
    • ULSAM and other lawful aggregation stages that must remain explicit rather than hidden inside selection.
    • E.20 governing-pattern discipline and F.18 alias docking for Phase‑3 canonicalization and ID continuity.

A.19.SelectorMechanism:End

U.Flow.ConstraintValidity — Eulerian

Tech‑name. U.Flow.ConstraintValidity (U.Flow genus) Plain‑name. Flow constraint validity (Eulerian interpretation) Type / Status. Architectural pattern — normative for flows governed by E.TGA (E.18) under the Eulerian operational interpretation

Intention

One‑liner Defines cross‑cutting ConstraintValidity rules for all U.Flow instances. U.TransductionFlow inherits these rules and may refine CV class specializations for transduction‑specific semantics (species‑binding only; genus rules remain unchanged). The CV core is kind‑agnostic and assumes an open‑world catalogue of node species; the enumeration of node kinds in E.TGA is a minimal kind baseline. Operational interpretation. Eulerian stance: flow = valuation over U.Transfer; CV is attached to transformations (steps) and evaluated before any GateFit; edges carry assurance‑only operations; no token‑passing semantics are assumed.

Use this when. Use A.20 when the question under repair is whether one transformation step internally satisfies its declared constraints before any gate-profile fit is evaluated.

First useful move. Name the step, the CV class being checked, the CV.Status, and the witness or missing witness. Stop there unless a gate, comparator, bridge, freshness, or work-boundary question is actually being made.

Smallest sufficient CV guidance. Use the lightest CV guidance that preserves the next admissible reader move. Add publication lexemes, witnesses, DecisionLog detail, CrossingBundle, PQG/RSCR, or MIP-run material only when the live CV claim would otherwise become false, unsafe, non-replayable, or lack a named governing-definition locus.

Minimum sufficient next move. For ordinary CV, step + CV class + CV.Status + witness or refusal is enough. Per-check publication lexemes are needed only when the CV result is carried into a publication face, gate relation, or assurance material.

Do not escalate when. Do not create GateDecision, GateDecisionExplanation, GateFit narrative, comparator law, bridge law, freshness claim, release-confidence claim, or work-boundary authority from CV.Status. Open those neighboring pattern relations only when their own claim being made is present.

Conformance-marker overread note. Use this note when a conformance label, CV.Status=pass, release-screen status, dashboard cue, or CV-looking publication is being read as gate passage, release confidence, safety acceptance, assurance, work occurrence, work authorization, or performed work. The first A.20 move is to return to the local step, CV class, CV.Status, witness or refusal, and window governed here; then state the unsupported attempted use and open the receiving relation only if its claim being made is present: A.21 for gate decision, B.3 for assurance, A.10 for evidence/currentness, A.15 for work, or the neighboring pattern governing that claim that carries the claim being made. Write CV.Status=pass when CV is meant; do not write plain pass near gate, release, safety, or work use. Plain wording remains ordinary unless it changes admissible use, source relation, evidence, gate, assurance, work, decision, or neighboring-pattern exit.

Common wrong first reading. CV.Status=pass means release, safety acceptance, or gate passage. First honest entry: CV.Status is local step constraint validity with witness or refusal; release, safety, gate, assurance, or work use exits to the governing pattern only when that claim being made is present.

Repaired anti-case: a manufacturing conformance label near release may carry only the local CV or conformance relation it actually records. If release permission, safety acceptance, or work authorization is attempted, state that unsupported use and open the receiving relation rather than treating the label as release authority.

Same problem, different question under repair. For a TGA-looking problem, use E.18 for graph/flow/crossing, A.20 for internal step validity, A.21 for gate-decision publication, and E.20 for mechanism-meaning placement; do not open the other three until their own claim is live.

Semantic repair return. When A.20 blocks a misleading word, face, alias, or source label, the repair must return to the enabled CV action: name CV.Status, the applicable CV class, and the witness or refusal that remains admissible. Do not stop at a classification of vocabulary or publication faces.

Locus and relation separation. Keep the graph object and path or crossing relation (E.18), MVPK publication faces (E.17), internal CV status and witness (A.20), gate decision and DecisionLog (A.21), evidence or provenance relation (A.10/G.6), work plan or work occurrence (A.15), and mechanism-governing definition assignment (E.20) distinct. An MVPK face, DecisionLog, evidence carrier, MIP manifest, or work witness does not carry another pattern's project-side value unless that governing pattern consumes it for that relation.

Smallest affected locus. Localize the change to the smallest live locus: PathSlice or crossing in E.18, CV step in A.20, GateDecision equivalence class in A.21, or mechanism-governing definition in E.20. Do not widen to a whole flow or unrelated flow, path-slice, CV, gate, or mechanism-definition locus when the smaller locus is enough.

Ordinary success. For ordinary A.20 use, success is that the live CV class, CV.Status, and witness or refusal are placed for the step without implying gate passage, comparator admissibility, freshness, or launch readiness. A full conformance review is needed only when the downstream claim consumes expanded assurance or conformance material.

Locality asymmetry. E.18 is graph-local, A.20 is step-local, A.21 is gate-local, and E.20 is trigger-local. Do not normalize the four patterns into one assurance regime.

Do not merge these pairs. Keep CV.Status distinct from GateDecision, TGA Check distinct from GateCheckKind, MIP manifest distinct from DecisionLog, ViewpointMap distinct from graph semantics, PathSlice distinct from a work run, and GateProfile=Lite distinct from PublishMode=Lite.

Field liveness. Always core for A.20: step, applicable CV class, CV.Status, and witness or refusal. Conditional-live: GateCheckRef(aspect=ConstraintValidity), MVPK face pins, bridge/UTS refs, comparator/set-return refs, refresh refs, and SquareLaw or retargeting witnesses; open them only when the corresponding publication, gate, bridge, comparator, refresh, or StructuralReinterpretation claim is live.

Retrieval trap guard. When excerpted alone, A.20 must not be read as requiring every CV class or a Lipschitz certificate for every step. CV classes are applicability-triggered, and CV.Status does not create gate passage, launch readiness, comparator admissibility, or a reusable GateDecision.

Anti-Goodhart guard. CV completeness is not a substitute for the governed step result: the step must still satisfy the applicable internal constraint, and CV conformance does not create gate fit, freshness, comparator admissibility, or launch readiness.

Generative side. A.20 preserves open-ended action by letting internally valid steps, set publications, and archives remain usable without premature gate, ranking, or launch claims; CV supplies a local admissibility relation for future moves, not only an assurance stop.

What goes wrong if missed. Readers may treat internal constraint satisfaction as gate passage, launch readiness, freshness, comparator admissibility, or decision reuse. That collapses CV into GateFit and hides the A.21 gate decision relation.

What this buys. A.20 lets a reader keep mechanism constraint status local to the step and move to A.21 only when gate fit or gate decision aggregation is really the question under repair.

Not this pattern when. If the question is profile fit, gate decision, gate-decision reuse, gate explanation, or pass/fail gate publication, use A.21. If the question is graph crossing or flow valuation, use E.18. If the question is comparator admissibility, set-return, archive, or refresh policy, use the current neighboring loci named in Relations.

Problem frame

In E.TGA, nodes = morphisms and the graph uses a single edge kind (U.Transfer). GateFit checks aggregate only in OperationalGate(profile) with the activation predicate CV => GF: until aggregated CV.Status=pass, all GateFit checks return abstain. Equivalently, while CV.Status != pass, any GateFit-oriented explanation does not apply. To keep flows comparable and auditable, this pattern delimits internal step constraints (CV) from external gate fit (GF), preventing any second process order beside the graph.

Problem

Without a clear CV core:

  • internal step laws (domains/ranges, invariants, units coherence, Lipschitz/stability) bleed into gate profile;
  • plane or comparator declarations sneak into mechanisms;
  • freshness and DesignRunTag concerns appear inside mechanisms;
  • reproducibility suffers because transfers start carrying hidden semantics beyond ⟨L,P,E⃗,D⟩.

Under this pattern, CV is evaluated inside transformations. If a check declares planes/units/comparators or depends on an active GateProfile, then it is treated as GateFit at gates and the CV explanation does not apply.

Forces

  • Separation of concerns. Internal mechanism laws vs. external profile fit.
  • Auditability. MVPK faces include pins/references only; no new numeric claims; editions and Γ are pinned where applicable.
  • Graph discipline. One edge kind; all crossings mediated by gates; SquareLaw on every crossing.
  • Reproducible valuation. Flow = valuation over U.Transfer, with slice‑local refresh bounded by sentinels.
  • LEX hygiene. ASCII Tech labels, twin Tech/Plain registers, registered tokens.

Solution

Intent & Scope

Intent. Establish the ConstraintValidity core for the U.Flow genus: the normative set of internal step constraints and how their status and witnesses are carried and aggregated, independent of GateFit profiles (publication follows MVPK without adding new numeric claims). Where CV speaks about admissibility, phrase criteria counterfactually: “If the admissibility conditions hold, then the CV explanation applies; otherwise this explanation does not apply.” Avoid duty verbs unless stating the normative CC minima.

Scope (genus). CV covers intra‑step properties checkable from the transformation’s own signature/mechanism. The canonical CV classes are genus-scoped and non-exhaustive: MechanismUnitsCoherence, LawSetInvariants, AdmissibilityConditionsSatisfaction, LipschitzBounds, TypeDomainRange, and—only for StructuralReinterpretationReinterpretationEquivalence (correspondence/reversibility witness).

Species binding (U.TransductionFlow). The above classes bind to U.Transduction(kind in {Signature, Mechanism, Work, Check, StructuralReinterpretation}) with OperationalGate = kind=Check; no additional CV classes are introduced here. Species-specific examples and broader flow specializations stay outside this CV core; StructuralReinterpretation semantics are received through E.18, A.6.4, and this pattern where CV is live.

Out‑of‑scope (CV): declaring/translating ReferencePlane/Units/ComparatorSet; CSLC comparability beyond internal step preservation; Freshness; Role/Channel; Regulated-X; DesignRunTagConsistency. These leave CV and use E.18/A.21 or the named comparator, selector, archive, refresh, evidence, work, safety, or temporal locus when that relation is live.

Primary EntityOfConcern and CV classes

Genus. U.Flow leaves step‑kinds abstract; CV/GF separation applies to any admissible instantiation. Species (U.TransductionFlow). U.Transduction(kind) ∈ {Signature, Mechanism, Work, Check, StructuralReinterpretation}; this set of kinds is a minimum kind baseline defined in E.TGA. The species space (e.g., UNM declaration and use, SelectionAndTuning, WorkPlanning, EvaluatingAndRefreshing, …) is open‑world and non‑exhaustive. OperationalGate = U.Transduction(kind=Check). StructuralReinterpretation is projection-preserving (no mutation of ⟨L,P,E⃗,D⟩) and may retarget EntityOfConcernRef under CC-TGA-06-EX; see E.18 and A.6.4.

AdmissibilityConditionsSatisfactionIf the declared admissibility conditions hold on the step’s inputs and context, then the CV explanation applies; otherwise this explanation does not apply. LipschitzBoundsIf inputs vary within the stated domain (X) and perturbations/noise (≤ ε), then the step’s estimate remains within δ of the reference; otherwise this explanation does not apply. MechanismUnitsCoherence / TypeDomainRangeIf units/types/domains match the mechanism’s signature and closed‑world assumptions for the step, then the CV explanation applies; otherwise this explanation does not apply.

Terminology & bindings (normative)

  • Status/witness lexicon (E.10 discipline). In CV scope, publications use Status/Witness terminology; GateDecision… lexemes belong to GateFit (A.21) and do not apply to CV.
  • EntityOfConcernRef = KindBridge. Any CV mention of selected-entity retargeting is read via KindBridge (CL^k) on UTS under F.9, F.17, E.17, E.18, and C.3.3 where live. CV does not declare or translate planes/units/comparators.
  • retargeting/witness binding. For U.Transduction(kind=StructuralReinterpretation), the CV class ReinterpretationEquivalence SHALL carry CV.WitnessRef := ReinterpWitness over the addressed PathSliceId; the UTS SquareLaw‑retargeting witness is referenced from MVPK/UTS and linked from the CV witness without duplication.
  • ReinterpWitness record shape. The record shape is defined once in A.20:4.7.

MVPK Faces (PlainView - TechCard - InteropCard - AssuranceLane)

Minimum pins on faces that carry CV outcomes (Lean publication allowed by profile but without weakening checks):

  • CtxState pins. ⟨L,P,E⃗,D⟩ on ports/tokens; raw U.Transfer preserves them.
  • Path pins. PathId and PathSliceId appear where slice-local refresh or reinterpretation witnesses are relevant; valuation semantics are carried by E.18 plus A.20, with G.11 when refresh wiring is live.
  • CV pins. CV.Status ∈ {abstain, pass, degrade, block}, CV.WitnessRef? (refs only).
  • Edition pins. If a face cites CG-Spec, ComparatorSet, or UNM.TransportRegistryPhi, the face includes the compatibility reference (BridgeCard + UTS row, with CL/CL^plane) under F.9, F.17, E.17, and E.18 for downstream consumption. A.20 references this requirement; it does not introduce or modify Bridge/UTS formats.
  • Face scope. Each face includes PublicationScopeId with an MVPK profile (Min/Lite/SetReady/Max) — no new publication-face kinds.
  • Register discipline. Tech names ASCII; twin labels; required LEX tokens follow E.10 (e.g., SentinelId, PathSliceId, SliceRefresh).

No new numeric claims. MVPK faces carry refs, CV.Status, and witness or refusal references only; they do not introduce fresh computed scalars beyond what the mechanism already entails (MVPK functoriality).

CV reference names. In ordinary A.20 prose, an unpublished CV record may be called CVRef or CVCheckRef as a plain local convenience. When the record is carried on an A.21 or E.18 publication face, use the publication lexeme: GateCheckRef := { aspect=ConstraintValidity, kind, edition, scope } with scope ∈ {lane|locus|subflow|profile}. This adds no execution steps and introduces no numeric claims on faces; it records what CV classes were considered and under which editions. GateCheckRef(aspect=ConstraintValidity) is a publication lexeme only; it does not make CV a gate. A.20 retains CV class meaning; A.21 consumes only referenced CV results when a gate relation is live.

GateChecks (table) — CV only

Activation predicate (in E.TGA). Until aggregated CV.Status=pass, all GateFit checks return abstain (CV=>GF). Role/Channel Fit guard (GateFit scope). GateFit checks that involve roles SHALL use Kernel U.Role tokens (domain = U.System) and SHALL NOT consume TypicalEnactorRoleName strings from alias tables.

CV classApplies whenPublication minimum
TypeDomainRangeThe step has a typed signature, declared domain/range, or SlotKind boundary.CV.Status + witness/refusal for the typed relation.
AdmissibilityConditionsSatisfactionThe mechanism declares admissibility conditions.CV.Status + condition ref + witness/refusal.
LawSetInvariantsThe mechanism has a law or invariant set.CV.Status + invariant ref + witness/refusal.
MechanismUnitsCoherenceQuantities, scales, units, or reference planes are actually used.CV.Status + quantity/unit/plane refs; CV may check coherence against already-governed unit/plane refs, but may not author, translate, bridge, or change units or planes.
LipschitzBounds / stabilityA perturbation, sensitivity, robustness, continuity, safety-envelope, or stability claim changes the CV use.Bound or certificate ref under declared assumptions; no universal Lipschitz certificate demand.
ReinterpretationEquivalenceThe step is StructuralReinterpretation.CV.Status + ReinterpWitness scoped to the addressed PathSliceId.
ReferencePlaneCrossing, CSLC, Freshness, Role/Channel, Regulated-X, DesignRunTagConsistencyA gate, crossing, comparator, freshness, role/work, safety, or design/run relation is live.Not CV-only; use GateFit/A.21 or the named neighboring locus.
CV SHALL NOT declare or translate Units, ReferencePlane, or ComparatorSet. Gate-mediated crossings and gate-consumed CSLC checks use E.18/A.21 with UNM declaration and bridge discipline. Comparator admissibility, ranking, selection, set-return, archive semantics, and refresh remain with A.19.SelectorMechanism, C.18, C.19, G.5, G.11, or A.21 only where those claims being made are actually present.

SWP matrix (declaration-locus discipline)

  • Writes (faces). CV.Status (and optional CV.WitnessRef) only.
  • Reads (ref‑only). Any CG‑Spec/ComparatorSet/TransportRegistryΦ editions (when referenced); their declarations remain governed by the UNM declaration locus per CC‑TGA‑24.

CtxState & GateCrossing

  • Crossings only at OperationalGate(profile) (plane/unit/context) with a strict exception for StructuralReinterpretation: a projection‑only retargeting MAY occur without a gate iff ⟨L,P,E⃗,D⟩ is preserved, KindBridge (CL^k) and a SquareLaw‑retargeting witness are present on MVPK/UTS, and the action is PathSlice‑local (PathSliceId pinned).
  • Projection and EntityOfConcernRef retargeting loci. For StructuralReinterpretation, A.20 may state the CV witness needed for the step, but it does not define a second semantics of projection, published view, EntityOfConcernRef, or retargeting. Read those terms through A.6.4, C.2.1, C.2.P, and the relevant UTS KindBridge (CL^k) rows under F.9, F.17, E.17, E.18, and C.3.3 where live.
  • Projection/EntityOfConcernRef normalization (CV use only). In that imported reading, projection is a change of published view coordinates only, and EntityOfConcernRef is a Kind-channel change under CL^k. A “no unit/plane change” test SHALL verify that ReferencePlane(src)=ReferencePlane(tgt) and CL^plane is absent (or = ⊤), otherwise the step is a gated crossing.
  • Assurance operations on edges. ConstrainTo/CalibrateTo/CiteEvidence/AttributeTo reside on U.Transfer and do not alter ⟨L,P,E⃗,D⟩; plane/unit changes occur only at gates; Φ/CL^plane penalties appear in R-lane. EntityOfConcernRef/kind retargeting are recorded as KindBridge (CL^k) on UTS under F.9, F.17, E.17, E.18, and C.3.3; under CC-TGA-06-EX this may appear without a gate only when it is projection-preserving and PathSlice-local.

Terminology for this crossing slice is defined in A.20:4.2, and ReinterpWitness shape is defined in A.20:4.7; A.20:4.6 only applies those bindings to CtxState and GateCrossing.

SquareLaw

For any gate‑mediated crossing adjacent to CV‑checked steps: gate_out ∘ transfer = transfer' ∘ gate_in. For projection retargetings under StructuralReinterpretation, a SquareLaw‑retargeting witness shows that the view retargeting commutes with transfers on the PathSlice. Inconsistencies lead to degrade/block per active profile (GateFit decision).

retargeting witness shape (normative, UTS-scoped). A SquareLaw‑retargeting witness is a witness record that demonstrates commutativity of a published‑projection retargeting over the addressed PathSliceId:

  1. identifies PathSliceId and PublicationScopeId;
  2. presents a bidirectional view mapping between projections either as an iso or as a profunctor optic (get : A→B, put : (B×A)→A) satisfying Put‑Get / Get‑Put laws;
  3. enumerates the commuting squares for the cut‑set edges considered (ids of transfers before/after the retargeting);
  4. declares properties (invertible?, idempotent?) and the definedness area;
  5. cites the UTS.RowId and links the DecisionLog entries that rely on this witness. Realizations via profunctor optics (post‑2017) are permitted; the optic/lens laws serve as the proof template of commutativity.

CV witness for reinterpretation (normative, CV-scoped). CV.ReinterpretationEquivalence SHALL carry a ReinterpretationEquivalenceWitness distinct from the UTS retargeting witness and scoped to the mechanism state over the same PathSliceId: — PathSliceId, PublicationScopeId, and definedness region (domain constraints); — a pair of internal transformations (or an optic) with Put‑Get / Get‑Put obligations over mechanism state (not faces); — a list of commuting squares for the adjacent raw transfers (before/after reinterpretation) showing SquareLaw at CV boundary; — an explicit NoHiddenScalarization assertion (see §4.9) for any comparable return shape; — edition neutrality: no new editions are declared; only refs/pins appear. This CV witness links to the UTS SquareLaw‑retargeting witness when present, but does not duplicate UTS fields.

CV witness binding (normative). For the CV class ReinterpretationEquivalence, the witness SHALL be a ReinterpWitness record: ReinterpWitness := { PathSliceId, PublicationScopeId, mapping: {kind: iso|optic, laws: PutGet/GetPut}, commutingSquares: [TransferId], definedOn: PathSliceId, properties: {invertible?: bool, idempotent?: bool}, UTS.RowId, NoHiddenScalarization: true }. The record is PathSlice‑local and does not declare or translate planes/units or comparators.

Sentinel & PathSlice (path‑local refresh)

  • Flows are valuations over U.Transfer, re-emitting slice-locally under explicit refresh rules or edition bumps carried through E.18, A.20, and G.11 where refresh wiring is live. CV contributes to the prepare/refresh conditions but does not expand scope beyond the addressed PathSliceId.

  • Delimitation & planning (normative). A PathSlice closes on: (i) any pinned edition change, (ii) Γ‑window boundary relevant to the face, (iii) GateProfile change along the path, or (iv) an explicit sentinel rule. Concurrency: at most one active recompute per {PathSliceId}; parallel recomputes are permitted across distinct PathSliceIds.

  • CV‑triggered refresh (minimum list). Re‑emit the addressed PathSliceId when any holds: (a) CV.Status changes across the lattice; (b) ReinterpWitness is added/updated/withdrawn; (c) AdmissibilityDecl.edition or LipschitzBoundRef.edition changes; (d) updates arrive from F.9, F.17, E.17, or E.18 bridge and UTS loci, or from A.19.SelectorMechanism, C.18, C.19, G.5, or G.11 comparator and refresh loci; (e) error/timeout transitions to CV.Status=pass for a previously abstain|degrade CV class.

  • CV‑to‑refresh triggers (normative). A SliceRefresh(PathSliceId) SHALL be scheduled when any of the following occurs: (CVRefreshTrigger.StatusFlip) a CV status flip on the slice (pass↔degrade, pass↔block, or error/timeout→{degrade|block} under profile rules); (CVRefreshTrigger.ReinterpretationWitness) arrival of a new ReinterpretationEquivalenceWitness or a change in its definedness region; (CVRefreshTrigger.AdjacentFactUpdate) updates to adjacent UTS or Bridge facts for the slice (e.g., CL^k, BridgeId, Φ/Ψ policy-ids) under F.9, F.17, E.17, or E.18; (CVRefreshTrigger.ReferencedEditionChange) edition changes referenced by comparator or selection loci on the slice (A.19.SelectorMechanism, C.18, C.19, G.5, or G.11 when live) (ComparatorSetRef.edition, DescriptorMapRef.edition, DistanceDefRef.edition, …); (CVRefreshTrigger.FreshnessTicketChange) FreshnessTicket or freshness/currentness relation changes that alter the slice window under A.21, B.3, or G.11 when live;

    (CVRefreshTrigger.SentinelRule) sentinel rules explicitly attached to the PathSliceId. Scheduling is slice‑local; recompute does not fan‑out beyond the addressed PathSliceId.

    Id‑scheme: PathSliceId := PathId × Γ_time selector × ReferencePlane × SentinelFingerprint × IterationCounter. Locking for replay: within a recompute, the effective E⃗ is frozen; outputs carry a replay fingerprint resolvable via DecisionLog.

ReturnShape & CSLC (comparability discipline)

When a declared comparable, set-valued, archive, or partially ordered return shape is live, CV checks that the step did not internally destroy that return shape; no hidden scalarization. If no declared return shape is live, do not open a ReturnShape or NoHiddenScalarization check. Any comparator citation is ref-only and, if editions are cited, SHALL include Bridge+UTS through the current bridge and terminology loci (F.9, F.17, E.17, E.18). Comparator admissibility, ranking, selection, archive semantics, and refresh remain with A.19.SelectorMechanism, C.18, C.19, G.5, G.11, or GateFit (A.21) where live. CV only checks preservation of the already-declared return shape inside the current step.

Under StructuralReinterpretation, projection changes MUST NOT introduce hidden scalarization; set‑return semantics remain intact; comparator cites stay ref‑only with UTS discipline.

Detectable indicators of hidden scalarization (normative checklist). A face SHALL be flagged when any holds: (H1) introduction of a new scalar not entailed by the mechanism, or any cardinality‑reducing fold of a set return (e.g., argmax/best‑of) without a cited ComparatorSetRef; (H2) omission of a required ComparatorSetRef or its edition pins where comparison is implied; (H3) presence of an order-imposing coordinate without a CoordinatePolicy and admissibility annotations (scale, units, or inadmissible operations); (H4) cross‑plane/units numeric combination without a Bridge+UTS row; (H5) for StructuralReinterpretation, any change of return plane/units (violates “projection‑only”). Failing (H1–H5) degrades or blocks per GateProfile (§4.4/CC‑TGA‑21a).

Γ‑windows / Freshness

  • No implicit latest. Any face expected to be consumed at compare or launch pins Γ_time; freshness checks occur at gates; CV neither issues Freshness tickets nor evaluates staleness. Use A.21, B.3, C.27, or G.11 when a live freshness, temporal-claim, or refresh relation is present.
  • Granularity of Γ (normative). Γ SHALL be one of: snapshot (effective_at=t) or interval ([t₀,t₁) with a named folding policy). Faces SHALL carry the selector used.
  • CV time‑stamping. Each CV computation records t_cv and the Γ selector it assumed; replay binds t_cv to PathSliceId.
  • Temporal policy types (binding). Γ‑pins refer to the canonical selectors of §22 (effective_at, latest_effective_before, windowed(W, policy)) and to folding policies that are IDEM/MONO/WLNK‑safe. Units/time scales SHALL be explicit. Overrides of the default weakest‑link fold SHALL cite CAL proofs of monotonicity and boundary behavior.

Unknown/Timeout/Error policy

Each CV class yields one CV.Status value: abstain | pass | degrade | block. Errors/timeouts at CV stage imply CV.Status != pass; therefore GateFit abstains by the global activation predicate and any GateFit‑oriented explanation does not apply. The aggregated CV.Status uses the join on abstain <= pass <= degrade <= block (neutral = abstain; absorbing = block). Minimal default (profile‑bound, normative): Lean/Core ⇒ error|timeout → degrade, SafetyCritical/RegulatedX ⇒ error|timeout → block; unknown folds per GateCheck policy (safety‑default: degrade). (Consistent with CC‑TGA‑22.)

Idempotency / congruence discipline

Any publication consumed by an A.21 gate decision uses the A.21 decision-stability witness for input equivalence and idempotency; use G.6 or G.11 where evidence-path visibility or refresh implications are live. A.20 does not introduce keys, hashes, or cache policies.

Minimal lexeme set for CV‑adjacent equivalence (normative). Where an A.21 gate decision consumes CV outcomes, the equivalence witness SHALL identify at least: {PathSliceId, GateProfileId, Γ selector (+window bounds if interval), E⃗ editions vector for cited registries, ReturnShape kind (if comparable), CV class/kind set considered}. Changing any of these breaks equivalence and triggers re-aggregation.

Archetypal Grounding (Tell–Show–Show) ✱

Tell (internal step, not gate passage). CV answers whether a transformation step satisfies its own declared constraints: units, laws, admissibility conditions, stability bounds, type/domain/range, and, for StructuralReinterpretation, reinterpretation equivalence. If CV.Status != pass, GateFit does not get to rescue the step; if CV.Status=pass, ranking, acceptance, launch, and profile-fit still belong outside CV.

Show‑0 (CV.Status=pass, no gate opened). A normalization step has declared units, domain/range, and invariant refs; the CV check returns CV.Status=pass with a CV.WitnessRef. No comparison, launch, crossing, freshness, or profile-fit claim is live, so no GateDecision, GateFit narrative, or DecisionLog is opened. The admissible result is only: this step is internally valid under its declared constraints.

Show‑1 (compiler build → run).

A typed module M exposes f : State_d → BuildOutput_d under a declared LawSet (e.g., determinism under fixed toolchain) and TypeDomainRange. CV checks: (i) MechanismUnitsCoherence (toolchain/flags units coherent), (ii) LawSetInvariants (reproducible outputs under same E⃗), (iii) Admissibility (inputs well-typed), and (iv) optional Lipschitz/stability surrogate (bounded perturbation in sandbox). CtxState is preserved along raw transfers. Entering U.Work(run) uses LaunchGate with FreshnessUpToDate and DesignRunTagConsistency - GateFit, not CV.

Show‑2 (selection archive in QD/AutoML). A mechanism emits a set (Front, Archive, or another declared set publication). CV checks only: valid descriptor ranges, declared continuity bounds over named metric spaces, and archive invariants (idempotent insert). No ranking or acceptance thresholds are introduced at CV; comparators and acceptance policies bind at gates via A.21 plus the current comparator and set-publication loci (A.19.SelectorMechanism, C.18, C.19, G.5, or G.11) where live. Edition-aware pins on faces carry DescriptorMapRef.edition only with Bridge+UTS.

Practice references. Algebraic effects & handlers separate signatures from handlers (Koka/Effekt, 2015+); reproducible pipelines isolate mechanism constraints from deployment profiles (Bazel/Nix); optics/profunctors and open/hypergraph categories motivate composition on open graphs without adding facts on faces; QD/MAP-Elites/CMA-ME/DQD motivate set-return and declared order relations (2015-2022).

Bias‑Annotation

The pattern constrains how CV status and witnesses are carried; it does not encode profile‑bound thresholds or Role/Channel fit — those sit in GateFit. This separation keeps profile concerns out of mechanism semantics.

Conformance Checklist ✱

Conformance use. This checklist is evidence for the internal-step CV guidance already stated in the Solution. It is not the first entry text for ordinary use and not a full audit regime by default; an item is applied only when its corresponding CV class, witness, publication face, or neighboring relation is live. Before applying any item, name the Solution move it tests; if no such reader move is live, treat the item as orientation-only or not applicable rather than expanding the applied assurance or conformance material.

Conformance groups. Ordinary CV use starts with step, applicable CV class, CV.Status, and witness or refusal. Crossing/launch items apply only when a CV-checked step is adjacent to a live gate, crossing, or launch boundary. Publication/assurance items apply only when the CV result is carried on MVPK faces or consumed by downstream replay/audit. Extension/change items apply only when species binding, valuation/refresh, or neighboring selector/comparator loci are being changed or consumed.

Static lint (graph and faces)

  • CC‑TGA‑01: only U.Transfer edges; crossings appear only on gates.
  • CC‑TGA‑05: ⟨L,P,E⃗,D⟩ unchanged across raw transfers.
  • CC‑TGA‑09: MVPK faces present; edition & Γ pins where expected; no new numeric claims on faces (E.17).

CV discipline

  • CV classes present exactly as {UnitsCoherence, LawSetInvariants, Admissibility, LipschitzBounds, TypeDomainRange}; plus ReinterpretationEquivalence when the node kind is StructuralReinterpretation. None declare/translate planes/comparators.
  • Open‑world species. Any node species binds to one of the minimal kinds; adding a new kind is out of scope for A.20 and belongs in an E.TGA update.
  • Aggregated CV.Status computed; errors/timeouts imply CV.Status != pass.
  • Any wider use beyond the local step names the receiving relation. CV.Status is not gate passage, release confidence, assurance, safety acceptance, work occurrence, or work authorization.

Gate coupling

  • CC‑TGA‑07: when CV.Status != pass, all GateFit checks report abstain.
  • CC‑TGA‑23: SquareLaw witnesses present on crossings adjacent to CV‑checked steps.
  • Any edition citation on faces includes Bridge+UTS through F.9, F.17, E.17, and E.18; comparator or set-return implications use A.19.SelectorMechanism, C.18, C.19, G.5, or G.11 when live.

UNM declaration locus

  • CC‑TGA‑24: CG‑Spec, ComparatorSet, and TransportRegistryΦ declarations are governed by UNM; CV is ref‑only.

Valuation & refresh

  • CC‑TGA‑18/19: Flow publishes valuation with PublicationScopeId/PathSliceId; Γ pinned at compare and launch faces; sentinel triggers slice‑local refresh.

Consequences

Benefits. Clarity & composability. Mechanism descriptions remain limited to internal laws; gates are the sole policy junction.

Replayability. With valuation plus MVPK pins, re-runs under fixed E⃗ are comparable and slice-scoped through E.18, A.20, and G.11 when refresh wiring is live. Didactic hygiene. Readers can see what is internal mechanism constraint status vs. gate policy.

Trade‑offs.

  • Two places to look (CV vs. GF) impose placement discipline; mitigated by the activation predicate and MVPK links.

Rationale

E.TGA coordinates A.20 and A.21 as orthogonal cores: CV inside transformations; GF at gates with join‑aggregation and DecisionLog. This mirrors effects/handlers (signature vs. handler), and reproducible build vs. deployment‑profile separation.

SoTA-Echoing (post-2015)

SoTA source ideaFPF invariantReader moveRejected shortcut
Algebraic effects, refinement, and certified-computation practice separate local constraint satisfaction from handler or deployment policy.CV is internal step validity with CV.Status plus witness or refusal; GateFit (A.21) may consume the CV result only when a gate relation is live.Name the step, the applicable CV class, and the witness or refusal before making any gate claim.Treating CV.Status=pass as gate passage, launch readiness, comparator admissibility, or a release-confidence claim.
Reproducible-pipeline practice keeps mechanism constraints distinct from release or deployment profiles.A.20 records assumption-bound status and witnesses; it does not define build tooling, cache keys, storage formats, or release policy.Keep release and profile questions outside CV unless the neighboring pattern is live.Treating a validation checklist as release readiness.
Optics, profunctors, and open or hypergraph categories give a formal basis for disciplined reinterpretation without adding new face facts.ReinterpretationEquivalence uses imported retargeting semantics and a CV-scoped witness over the addressed PathSliceId; projection and EntityOfConcernRef retargeting semantics stay with their governing loci.Require the relevant witness before allowing StructuralReinterpretation CV.Status=pass.Letting A.20 define a second semantics of projection, view, EntityOfConcernRef, or retargeting.
Quality-Diversity, MAP-Elites, CMA-ME, and DQD practice preserve set-return and archive visibility.CV may check that the step did not internally destroy a declared set, archive, or partially ordered return shape; comparator, ranking, archive, and refresh decisions remain outside CV.Preserve no-hidden-scalarization inside the step and return comparator or archive use to the neighboring loci named in Relations.Letting CV select, rank, accept, or refresh set-return outputs.

Action result from the local-constraint and reproducible-pipeline practice basis: CV.Status, conformance labels, validation checklists, and CV-looking publications do not become gate passage, launch readiness, release confidence, safety acceptance, assurance, work occurrence, work authorization, comparator admissibility, or refresh authority. The local A.20 result is step, CV class, CV.Status, witness or refusal, unsupported attempted use, and the named receiving relation when a gate, release, assurance, work, comparator, or refresh claim is live. Reopen the local result when the CV status, witness, governing definition, assumption, edition, window, path slice, or consuming neighboring relation changes.

Relations

  • Governed by E.TGA. Nodes are morphisms; only U.Transfer edges; open‑world species over a minimal kind set; CV⇒GF activation; MVPK faces; SquareLaw on crossings; CC‑TGA‑06‑EX for StructuralReinterpretation.
  • A.21 (GateProfilization). Sole point for GateFit checks and profile‑bound folds.
  • E.18 (flow valuation and PathSlice currentness). Declares the graph and valuation semantics used by this flow family.
  • F.9 / F.17 / E.17 / E.18 (Bridge+UTS loci). Boundary-publication requirement whenever faces cite editions.
  • A.19.SelectorMechanism / C.18 / C.19 / G.5 / G.11. Comparability, set-return, archive, and refresh discipline; CV does not compare; it only checks internal readiness for declared comparison.
  • A.21 / G.6 / G.11. Gate decision stability, equivalence witness references, evidence-path visibility, and refresh implications when gate decisions consume CV-adjacent publications.
  • E.10 (LEX). Token classes and ASCII Tech names; twin labels and aliasing for Γ/CL/Φ as per LEX‑BUNDLE.

A.20:Appendix A — CV Class Gloss (normative)

  • MechanismUnitsCoherence. Internal unit and scale coherence within the step when quantities, scales, units, or reference planes are actually used; no declarations or translations of units/planes occur in CV.
  • LawSetInvariants. Mechanism-declared invariants hold (e.g., mass/energy balance in a model, determinism under fixed editions).
  • AdmissibilityConditionsSatisfaction. Inputs lie within admissible windows/guards declared by the mechanism's AdmissibilityConditions; failure yields degrade or abstain per class policy. Minimum declaration (normative): AdmissibilityDecl := { domains: {name: set/poset}+, guards: [predicate_id]*, windows: {Γ_time: snapshot|interval|policy}, observables: [signal_id]*, edition: EditionId }. The declaration is published on MVPK as references only; it introduces no arithmetic on faces. Minimal declaration template (normative): AdmissibilityConditions := { Domains[]{var, type, range, units, plane}, Guards[]{predicate, editionRefs}, ObservationWindows[]{Γ selector, freshness window}, ObservableSigns[]{name, detection rule}, Editions{...} }No unit/plane declaration or translation here; only references. Γ selectors SHALL be explicit.
  • LipschitzBounds / stability. Bounded sensitivity under a declared metric, used only when a perturbation, sensitivity, robustness, continuity, safety-envelope, or stability claim changes the CV use. Publication ref shape (normative): LipschitzBoundRef := { method ∈ {spectral_norm|CROWN|IBP|rand_smoothing|other}, metric_space: {X: norm_id, Y: norm_id}, bound: value_or_interval, units/plane: P, validity_window: Γ_time(basis), edition: EditionId, certificateRef?: LipschitzCertificateId }. Referenced evidence/certificate object (normative): LipschitzCertificate := { metricId (with units and plane), bound L, methodId, methodRef (e.g., spectral estimate or certified robustness bound), validity region (inputs and state), proof sketch or reference }. The method MUST be cited; units/plane of the metric MUST be explicit; proofs and witness records are referenced; bounds are ref-only at CV; any acceptance action remains GateFit.
  • TypeDomainRange. Well-typedness and type, domain, and range consistency for the transformation signature; refs point to the governing definitions.
  • ReinterpretationEquivalence (StructuralReinterpretation only). Existence of a correspondence/reversibility witness between source and retarget projections; preservation of ⟨L,P,E⃗,D⟩; no comparator/plane/unit declaration or translation at CV. Witness (normative): ReinterpWitness / ReinterpretationEquivalenceWitness (see §4.7) with: (i) PathSliceId, PublicationScopeId, (ii) bidirectional mapping (iso/optic) with Put-Get/Get-Put obligations, (iii) commuting squares for adjacent raw transfers, (iv) NoHiddenScalarization assertion when comparable, and (v) definedness region. The witness is PathSlice-local and is admissible only for idempotence and reversibility within the addressed slice. Any EntityOfConcernRef change SHALL have KindBridge (CL^k) on UTS.

A.20:Appendix B — LEX discipline (summary)

Register token classes (Tech) include: U.TransductionFlow, U.TransductionGraph, OperationalGate, GateProfile, GateCheckKind, GateCheckRef, DecisionLog, FreshnessTicket, FinalizeLaunchValues, SubflowRef, FlowEmbed, SentinelId, PathSliceId, SliceRefresh, VALATA; discriminators use Base__P2W, Base__EvaluatingAndRefreshing; Tech names are ASCII; aliases GammaTimeRule/Plane, CLPlane, Phi follow E.10. A.20 references these tokens; it does not introduce additional LEX classes. For each published CV check, GateCheckRef.aspect is fixed to ConstraintValidity. MVPK minima for CV faces also include PathId/PathSliceId where slice-local refresh applies through E.18, A.20, and G.11 when live.

A.20:End

A.21 — GateProfilization: OperationalGate(profile) (GateFit core)

ID: A.21 Type: Architectural pattern

One-liner. A single microkernel-style gate aggregates GateChecks (CV + GF) into an order-independent GateDecision via the GateDecision join-semilattice abstain <= pass <= degrade <= block, uses the CV=>GF activation predicate (and the LaunchGate pre-run barrier), applies profile-bound folds for error|timeout|unknown, and publishes replay-grade traces (MVPK + DecisionLog + EquivalenceWitnessRef).

Use this when. Use A.21 when the question under repair is whether a gate may publish a profile-bound GateDecision from declared GateChecks, folds, pins, and rationale.

First useful move. Name the OperationalGate(profile), the active GateProfile, the effective GateCheckRef set, the aggregated CV status, and the DecisionLogRef that will carry the decision rationale.

Smallest sufficient gate-publication guidance. Use the lightest gate-publication guidance that preserves the next admissible reader move. Add crossing fields, launch fields, regulated fields, safety-critical fields, replay witnesses, CrossingBundle, PQG/RSCR, or MIP-run material only when the live gate-decision claim would otherwise become false, unsafe, non-replayable, or lack a named governing-definition locus.

Minimum sufficient next move. If there is only a guard, dashboard cue, explanation, or readiness-looking label and no A.21 gate-decision relation, no gate is opened here. Once a gate is live, the low-risk publication minimum is GateId + GateProfile + GateCheckRef set + CV aggregate + GateDecision + DecisionLogRef; crossing, launch, regulated, and safety-critical fields appear only when those claims are being made.

Do not escalate when. Do not turn cues, guards, narrative explanations, dashboard states, CV results, or readiness-looking labels into a GateDecision. Open A.21 only when a live gate-decision relation consumes check refs under an active GateProfile.

Gate-looking display and conformance-label disposition. A green tile, readiness badge, release screen, conformance label, CV.Status, safety-envelope note, or regulated-conformance phrase is not gate passage by resemblance. If the attempted use is gate passage, recover the active OperationalGate(profile), GateProfile, effective GateCheckRef set, CV aggregate, GateDecision, DecisionLogRef, scope, and currentness/window. If those fields are not recoverable, keep the item as a display cue, source pointer, CV result, or evidence question and return to A.10, A.20, B.3, E.19, or the pattern governing the recovered claim that carries the claim being made. Safety envelope and assurance claims do not live in A.21 unless they are declared gate checks consumed under the active profile; their evidence and assurance support remain with A.10 and B.3. Plain wording remains ordinary unless it changes admissible use, source relation, evidence, gate, assurance, work, decision, or neighboring-pattern exit.

Common wrong first reading. A green tile, readiness display, or release screen means GateDecision=pass exists. First honest entry: A.21 is live only when an active OperationalGate(profile) consumes declared checks and publishes a GateDecision with DecisionLogRef; otherwise the item remains a cue or source question.

Repaired anti-case: a release screen says all checks are green but no active OperationalGate(profile), effective GateCheckRef set, GateDecision, or DecisionLogRef is recoverable. The display remains a cue or evidence question; the attempted gate-passage use has no admissible current use until the A.21 gate-decision relation is recoverable.

Same problem, different question under repair. For a TGA-looking problem, use E.18 for graph/flow/crossing, A.20 for internal step validity, A.21 for gate-decision publication, and E.20 for mechanism-meaning placement; do not open the other three until their own claim is live.

Semantic repair return. When A.21 blocks a misleading word, face, alias, or source label, the repair must return to the enabled gate action: name the live gate-decision relation, active GateProfile, consumed GateCheckRef set, aggregate, GateDecision, and DecisionLogRef that remain admissible. Do not stop at a classification of vocabulary or publication faces.

EntityOfConcern and relation separation. Keep the graph object and path or crossing relation (E.18), MVPK publication faces (E.17), internal CV status and witness (A.20), gate decision and DecisionLog (A.21), evidence or provenance relation (A.10/G.6), work plan or work occurrence (A.15), and mechanism-governing definition assignment (E.20) distinct. An MVPK face, DecisionLog, evidence carrier, MIP manifest, or work witness does not carry another pattern's project-side value unless that governing pattern consumes it for that relation.

Smallest affected locus. Localize the change to the smallest live locus: PathSlice or crossing in E.18, CV step in A.20, GateDecision equivalence class in A.21, or mechanism-governing definition in E.20. Do not widen to a whole flow or unrelated EntityOfConcern when that locus is enough.

Ordinary success. For ordinary A.21 use, success is that the live gate-decision relation, active profile, check set, aggregated decision, and DecisionLogRef are placed without implying performed work or mechanism-definition truth. A full conformance review is needed only when crossing, launch, regulated, safety-critical, or replay claims consume expanded assurance or conformance material.

Locality asymmetry. E.18 is graph-local, A.20 is step-local, A.21 is gate-local, and E.20 is trigger-local. Do not normalize the four patterns into one assurance regime.

Do not merge these pairs. Keep CV.Status distinct from GateDecision, TGA Check distinct from GateCheckKind, MIP manifest distinct from DecisionLog, ViewpointMap distinct from graph semantics, PathSlice distinct from a work run, and GateProfile=Lite distinct from PublishMode=Lite.

Field liveness. Always core for A.21 once a gate is live: GateId, GateProfile, effective GateCheckRef set, CV aggregate, GateDecision, and DecisionLogRef. Conditional-live: crossing pins, LaunchGate pre-run barrier fields, regulated or safety-critical evidence refs, equivalence witnesses, and replay/currentness fields; open them only when the corresponding crossing, launch, regulated, safety-critical, replay, or reuse claim is live.

Retrieval trap guard. When excerpted alone, A.21 DecisionLog fields must not be read as requiring a full regulated log for every cue, guard, or low-risk gate. The DecisionLog content follows the live GateDecision, active profile, and conditional field-liveness rules.

Anti-Goodhart guard. A complete gate record is not a substitute for the governed gate result: the gate must still publish the correct GateDecision under the active profile, and that decision does not prove performed work or mechanism-definition truth. DecisionLog completeness does not make an invalid check true; check truth remains with the governing patterns.

Generative side. A.21 preserves open-ended action by publishing explicit GateDecision=pass, GateDecision=degrade, GateDecision=block, or GateDecision=abstain decisions with rationale, so downstream work can continue, narrow, retry, or stop under declared conditions instead of being hidden behind an unreviewable cue.

What goes wrong if missed. A guard can be mistaken for a GateCheck, a human-readable explanation can be mistaken for the decision or decision record, and a dashboard-like pass/fail cue can be treated as gate passage without the A.21 decision relation.

What this buys. A.21 gives the reader one place to separate profile fit, decision aggregation, rationale, optional explanation, and decision-record reuse while keeping gate logic out of CV and planning.

Not this pattern when. If the question is internal step constraint satisfaction, use A.20. If the question is graph crossing or valuation, use E.18. If the question is performed work or work planning, use the work/enactment or planning loci. If the text only contains a guard, cue, explanation, dashboard state, lexical pseudo-gate, or readiness-looking label without an A.21 gate-decision relation, do not infer gate passage.

Problem frame

Intent & scope

This pattern is the governing locus for canonical gate-decision publication content for OperationalGate(profile): GateCheckRef as the GateFit check-catalog boundary, gate aggregation, GateDecision terminology, GateDecisionRationale, GateDecisionExplanation, DecisionLog minima, profile-bound folds, and A.21 decision equivalence. A.20 governs CV class meaning; an A.21 gate-decision relation may consume referenced CV results but does not define CV class semantics. Receiving patterns govern the domain truth conditions of their checks.

Within that boundary, A.21:

  • aggregates per-check outcomes into a single published GateDecision using the join lattice,
  • states the CV⇒GF activation boundary: GateFit checks are inactive until CV.Status=pass,
  • defines the minimal publication faces and DecisionLog content required to make gate outcomes auditable and replayable,
  • applies SWP at the gate: OperationalGate(profile) and its GateChecks are ref-only with respect to editions, registries, and domain publications or records; A.21 publishes only GateDecision + DecisionLog pins and refs, and MUST NOT declare or mutate edition families. This pattern is about the semantics of what is published (and how it composes), not about procedural execution.

Primary EntityOfConcern and gate-profile object family

  • OperationalGate(profile) — a gate node (U.Transduction(kind=Check)) that mediates any GateCrossing: any change in CtxState = ⟨L,P,E⃗,D⟩ or entry to U.WorkEnactment (via LaunchGate).
  • GateProfile — the profile-bound constraint of the partial function CtxState_from -> CtxState_to; this pattern carries the current binding and minimum profile semantics. Fuller project-local profile matrices are auxiliary material unless a current governing pattern explicitly admits them.
  • GateCheckRef — the publication lexeme that binds a check to (aspect, kind, edition, scope).
  • GateDecision / GateDecisionRationale / GateDecisionExplanation — decision value, structured rationale, and optional narrative (non-decision).
  • DecisionLog — append-only audit record linking decisions to check refs, rule references, and (where applicable) SquareLaw mismatches.

CV vs GF boundary (what “activation” means)

  • ConstraintValidity (CV) evaluates internal step validity;

  • GateFit (GF) is an aspect label on GateCheckRef for checks that evaluate external admissibility vs GateProfile (planes/crossings, freshness, evidence, roles/channels, regulator conformance, etc.). It is not a U.Type, node, record family, module, queue, or stage in the flow.

  • Ordering & activation. CV is evaluated before GateFit; while CV.Status != pass, all GateFit checks return abstain.

Failure cases (diagnostic lens)

  • CV ✔ / GF ✖: internally valid transformation, but wrong gate/profile/role/timing/evidence.
  • CV ✖ / GF ?: fix mechanism validity first; GF is inactive.
  • CV ✔ / GF ✔: the gate may publish admissibility for the declared crossing; for LaunchGate, this is admissibility of crossing into U.WorkEnactment, not actual work occurrence.

Non-goals

  • No procedural semantics (no scheduling, no API formats, no automation narratives).
  • No “second process order” outside the graph: every check-point is an OperationalGate(profile) node in the same transduction graph; its pluggable GateChecks are declared on the node (no floating checks), and only the declared check set + reaction rules vary across gates.
  • No key/hash/cache formats: A.21 constrains equivalence + invalidation conditions, but not key materialization.
  • No lexical “pseudo-gating”: a lexical alias view is non-decisional and MUST NOT be modeled as a GateCheckKind.

Problem

Without a unified GateFit core:

  • Gate admissibility becomes ad-hoc, order-dependent, and hard to audit (especially with multiple independent checks).
  • Gate logic enters CV (planes/comparators/freshness/roles appear “inside steps”), collapsing the CV/GF separation.
  • “Unknown / timeout / error” behavior becomes implicit and inconsistent across cases, undermining reproducibility and safety.
  • Publication faces drift into “extra semantics” (computed scalars / tool encodings) rather than pins + refs, breaking MVPK discipline.

Forces

  • Separation vs convenience. Keeping CV internal and GF profile-bound keeps the boundary explicit, but demands a crisp activation boundary.
  • Determinism vs incompleteness. Gate decisions stay deterministic even when evidence is missing or partial (unknown).
  • Safety vs throughput. Some profiles treat ambiguity as block, others as degrade.
  • Human comprehension vs formal minimality. Optional narratives help readers, but SHALL NOT be used as decisions.
  • Reuse vs freshness. Decisions may be reusable only under explicit equivalence; otherwise re-aggregation is mandatory.
  • Scope granularity vs complexity. Checks are declared with scopes (lane|locus|subflow|profile) and merged; duplicates preserve evidence rather than overwrite it.

Solution

Gate = microkernel of checks

Note (guards are not GateChecks). USM.CompareGuard and USM.LaunchGuard are not GateCheckKinds; they may emit GuardFail events which are aggregated by the gate referenced by the existing aggregation-assignment field GuardOwnerGateId under the active profile (degrade|block) and recorded in DecisionLog. Guard vocabulary is received through A.2.6; gate aggregation remains here. OperationalGate(profile) is treated as a microkernel: checks are pluggable GateChecks; the gate core aggregates their outputs conceptually, without procedural semantics and without mutating the transduction graph.

Publication lexemes and register discipline

Per-check reference lexeme. GateCheckRef := { aspect, kind, edition, scope }, where:

  • aspect ∈ {ConstraintValidity, GateFit},
  • scope ∈ {lane|locus|subflow|profile}.

Short-form shorthand (not publication-valid). If a local short form { kind, edition, scope } appears in prose, it is interpreted only as a projection of the normative record with aspect supplied explicitly at the point of publication. Any published face or DecisionLog entry MUST use the full GateCheckRef with aspect.

Decision terminology separation.

  • GateDecision is the published lattice value.
  • GateDecisionRationale is the minimal structured support of that decision (check outcomes, folds, witness refs).
  • GateDecisionExplanation is optional, human-readable, derived from the rationale; it does not carry decision status and MUST NOT be used as one.

Register discipline. Tech labels are ASCII and twin-labeled where the plain form uses symbolic notation. (Example: use CLPlane / “CL^plane”, CLKind / “CL^k”, UNM.TransportRegistryPhi / “UNM.TransportRegistryΦ”, GammaTimeRule / “Γ_timeRule”.)

CV⇒GF activation predicate (counterfactual boundary)

GateFit checks are defined as inactive unless CV.Status=pass:

  • Let CV.Status be the join-aggregate of all GateCheckRef with aspect=ConstraintValidity.
  • For any GateCheckRef with aspect=GateFit: If CV.Status ≠ pass, the GateFit check outcome is abstain.
  • While CV.Status ≠ pass (or the active profile suppresses narratives), any GateFit-oriented GateDecisionExplanation does not apply.

This keeps the boundary crisp: CV explains internal validity; GF explains profile-fit only in the counterfactual world where CV.Status=pass holds.

LaunchGate pre‑run barrier (work‑boundary special case).

For the unique LaunchGate at the entry of each U.Work/U.WorkEnactment, let Prev.CV.Status denote the aggregate over the declared ingress predecessor set or ingress cut-set for the addressed PathSlice. In a linear path this may be one predecessor; where graph or fan-in semantics are live, it is not reduced to one immediately preceding step.

  • If Prev.CV.Status ≠ pass, then (i) all GateFit-scoped LaunchGate checks return abstain by activation, and (ii) the overall LaunchGate decision is forced to block (pre‑run barrier). The rationale MUST record the predecessor CV status and the forced-block rule in DecisionLog.

This is a publication-safety invariant: it constrains what may be admitted at the work boundary without specifying evaluation order or execution scheduling. Actual launch values and work occurrences remain governed by A.15.

Decision algebra: join-semilattice (“worst wins”)

A.21 adopts order-independent aggregation, not a universal policy language or a one-size-fits-all safety rule. The gate core does not define the domain truth of checks; it aggregates declared check outcomes under the active profile.

Decision domain. GateDecision ∈ {abstain, pass, degrade, block}.

Aggregation rule. Aggregation over all applicable checks is the idempotent, commutative, associative join on GateDecision values abstain <= pass <= degrade <= block, with neutral = abstain and absorbing = block.

Publications carry only:

  1. the aggregated GateDecision, and
  2. its GateDecisionRationale recorded in the DecisionLog.

Profile-bound folds for error|timeout|unknown

A check may encounter error, timeout, or evidence-scoped unknown. These do not become new decision values; they are folded into the decision lattice by profile and check policy. Normative minimum folds (tri-state).

Naming note. Some conformance tables use Lean as a label for the GateProfile=Lite GateProfile value. Treat this as an alias only, and do not confuse it with PublishMode=Lite (a publication-face reduction mode).

Active GateProfileerror foldtimeout foldunknown fold (evidence-scoped)
Litedegradedegradeper GateCheck policy (abstain or degrade)
Coredegradedegradeper GateCheck policy (abstain or degrade)
SafetyCriticalblockblockper GateCheck policy (safety-default: degrade)
RegulatedXblockblockper GateCheck policy (safety-default: degrade); X identity and edition are recorded in DecisionLog

Where a GateCheck declares an evidence-scoped unknown strategy, that strategy is part of the check's criteria definition; the fold applied and its justification are recorded in DecisionLog.

GateProfiles: current binding and minimum profile semantics

A.21 binds the following functional role of GateProfile:

Terminology (avoid Lite/Lean confusion). GateProfile=Lite|Core|SafetyCritical|RegulatedX is the GateProfile value that determines the effective GateCheck set and fold policies. PublishMode=Lite is a publication-face reduction mode (AssuranceLane‑Lite / TechCard‑Lite) and MUST NOT be interpreted as a reduced-obligation GateProfile.

  • A GateProfile is an attribute of a branch or PathSlice; the default is Core.
  • Local overrides may change the active profile for the current GateCrossing and its subordinate scope but cannot reduce the already-effective set of GateCheckKinds; only additions are allowed. Weakening SHALL use a new PathSlice via sentinel.
  • PublishMode=Lite changes face reduction only and does not weaken the check set or aggregation rule.

Scope and merge semantics (lane|locus|subflow|profile)

  • Each GateCheckRef declares its scope; subflow scope is bounded by a sentinel bridge (restart / refresh boundary).
  • The effective check set is formed by union across all declared scopes; duplicates by kind merge by the same join rule (“worst wins”), and all rationales are preserved in DecisionLog.
    • For RegulatedConformance(X), the identity of X and its rule/edition reference are part of the rationale record; multiple RegulatedConformance(X{…}) may coexist in one gate.
  • A check outside its scope reports abstain.

Publication repeatability, caching, and re-aggregation triggers

Repeatability (publication). Gate decisions MUST be replayable from declared pins/refs: no implicit “latest/now”. Any time basis is made explicit via Γ_time (or a Γ_timeRule that resolves to a concrete basis), and the resolved basis is recorded in DecisionLog.

Caching constraint (publication). A gate decision may be cached only per {PathSliceId, GateProfile, GateChecks.editions, editions{…}}, where GateChecks.editions denotes the canonicalized, order-independent listing of the effective GateCheckRef{aspect,kind,edition,scope} (including their editions) for this gate instance. Cache reuse is valid only while the declared freshness/evidence window remains valid under the active profile.

Re-aggregation triggers (non-exhaustive, normative). Re-aggregation is required if any of the following changes (slice-local; no execution method implied):

  • any component of editions{…} changes (any edition_key ↦ EditionId bump),

  • any GateCheckRef.edition changes (including regulator X editions for RegulatedConformance(X)),

  • the declared Γ_time basis changes or resolves differently,

  • a relevant FreshnessTicket expires/changes or TOCTOU window constraints change,

  • a sentinel-bounded subflow refresh adds an SCR/RSCR carrier to the DecisionLog rationale-reference set,

  • any input breaks the declared A.21 equivalence witness.

Decision stability is under the A.21 equivalence relation; a witness is recorded on the DecisionLog (see §4.10). A.21 constrains equivalence + invalidation conditions but does not fix key formats.

MVPK faces for OperationalGate(profile) (minimum pins)

The gate publishes faces to record what is declared, not “how it executes”. Faces remain pins + refs (no new numeric claims; no I/O re-listing).

Minimum pins (PlainView / TechCard / AssuranceLane where applicable).

  • View scope: PublicationScopeId (with MVPK profile: Min|Lite|SetReady|Max)

  • Identity: GateId, BridgeId, PathId, PathSliceId

  • Temporal: DesignRunTagFrom, DesignRunTagTo

  • Profile: GateProfile (PublishMode changes only face reduction)

  • Checks: list of GateCheckRef (aspect, kind, edition, scope)

  • CV: aggregated ConstraintValidityStatus and optional ConstraintValidityWitnessRef (refs only)

  • Editions: editions{…} vector + EditionPins{CGSpec, ComparatorSet, UNM.TransportRegistryPhi}

    • Gate-requirement on edition refs. Any face that cites CGSpec, ComparatorSet, or UNM.TransportRegistryPhi editions also includes BridgeCard + UTS row through F.9, F.17, E.17, and E.18; otherwise downstream consumption is non-conformant.
  • ReferencePlane and CL: source ReferencePlane pins and target ReferencePlane pins; CLPlane / “CL^plane” (for non-crossings CL^plane = none is allowed, but pins are still explicit); any Φ penalties are published as rule refs and appear in the R-channel only

  • Freshness: declared GammaTime / “Γ_time” pin and presence/absence of FreshnessTicket (refs)

  • Evidence: SCR/RSCR carrier references (refs) + VALATA (VA/LA/TA) presence on AssuranceLane

  • Guards: USM.CompareGuard / USM.LaunchGuard applicability pins (presence-only; GuardFail uses the A.2.6 guard vocabulary and is aggregated here by the gate referenced by the existing aggregation-assignment field GuardOwnerGateId)

  • Decision: aggregated GateDecision and DecisionLogRef

Lean face (PublishMode=Lite). It MAY fold to GateProfile / GateChecks / EditionPins / GateDecision + DecisionLogRef, but:

  • it MUST keep GateProfile and DecisionLogRef,
  • it MUST not weaken GateChecks or the aggregation algebra, and
  • if EditionPins are present, it still includes BridgeCard + UTS row through F.9, F.17, E.17, and E.18 and preserves the crossing boundaries (explicit ReferencePlane, CLPlane, and Φ -> R-channel only).

DecisionLog (minimum composition)

DecisionLog is an append-only record of reasons and references:

  • gate identity + PathSliceId (+ PublicationScopeId when the log is published via a face bundle)

  • each GateCheckKind, its GateCheckRef.edition, and its folded outcome (pass|degrade|block|abstain) including the applied error|timeout|unknown fold

  • rule references / evidence references (SCR/RSCR carriers + VALATA bindings); SquareLaw mismatched pins appear only when the crossing check is live

  • policy-id dependencies used by checks (as PolicyIdRef bundles per F.8:8.1); Φ(CL), Φ_plane, and Ψ(CL^k) appear only when bridge or crossing is live, while gate-local policy ids appear only when consulted by the active profile

  • GuardFail events only when guard events exist; if present, they are received from USM.Guards and aggregated by the gate referenced by the existing aggregation-assignment field GuardOwnerGateId with the applied profile rule (degrade|block)

  • EquivalenceWitness (or EquivalenceWitnessRef) as an A.21 publication item, minimally: { keys, E⃗, Γ_time(basis), PathSliceId?, ReturnShapeClass, ComparatorSetRef?, profile }; use G.6 or G.11 where evidence-path visibility or refresh implications are live

  • the declared publish reaction for degrade|block only when that outcome has a declared publication consequence, including any local “degrade mode” notes when permitted by profile

  • for RegulatedConformance(X), only when RegulatedConformance(X) is active: the identity of X and the rule/edition references used

GateChecks admissibility (GateFit-only catalog boundary)

Mandatory on LaunchGate. FreshnessUpToDate, DesignRunTagConsistency. Allowed GateFit checks (non-exhaustive, normative minima).

  • DesignRunTagConsistency (mandatory on LaunchGate; may appear elsewhere)
  • FreshnessUpToDate (mandatory on LaunchGate; may appear elsewhere)
  • ReferencePlaneCrossing
  • ComparatorConstraintRules (CSLC)
  • EvidenceCompleteness
  • SafetyEnvelope
  • RegulatedConformance(X) (X identity plus edition and rule refs are recorded in DecisionLog)
  • Role/ChannelFit (roles are Kernel U.Role tokens, not alias strings)
  • EquivalencePreservation
  • OutflowAudit
  • SnapshotConsistency

Receiving-pattern truth examples (informative). A.21 names and aggregates the check; it does not decide the domain truth condition. EvidenceCompleteness returns to A.10, G.6, or B.3; Role/ChannelFit returns to A.2, A.15, or A.2.6; ReferencePlaneCrossing returns to E.18, F.9, F.17, and UNM; ComparatorConstraintRules returns to A.19, G.0, G.5, C.18, C.19, G.9, or G.11 where comparator, archive, parity, set-return, or refresh claims are live; SafetyEnvelope and RegulatedConformance(X) return to the safety or regulatory pattern that governs the envelope or rule.

Forbidden (hard boundary).

  • Modeling CV classes “as GateFit” (CV classes remain CV; GF remains GF).
  • Any “LEX gate checks” or lexical pseudo-checking (lexical views do not participate in decisions).

SquareLaw compatibility at crossings

For every GateCrossing, the SquareLaw constraint SHALL hold: gate_out ∘ transfer = transfer' ∘ gate_in.

Profile selection/inheritance does not weaken this requirement; inconsistency yields block|degrade within the active profile and is recorded in the DecisionLog. LaunchGate is a work-boundary GateCrossing case, so SquareLaw is mandatory there as well.

Lexical mediation (optional trace, non-decisional)

A gate MAY publish a LexicalResolutionRef / LexicalView for traceability of alias resolution, but:

  • it does not participate in aggregation, and
  • it is not a GateCheck input and cannot change GateDecision.

Archetypal Grounding

System vignette — “Regulated release gate”

Show 0 (green cue, no gate decision). A dashboard tile says “ready” because a source system returned green. No OperationalGate(profile), GateCheckRef set, GateDecision, or DecisionLogRef is named. The tile remains orientation or source-finding only; it is not gate passage and does not open A.21 decision reuse.

Tell. A flow reaches a LaunchGate just before a U.WorkEnactment that can finalize binding. The active profile is RegulatedX. The gate publishes a single GateDecision and a DecisionLog that explains why the release is admissible (or not), without encoding any execution method.

Show A (CV ✔, GF ✖). CV.Status=pass, activating GateFit. RegulatedConformance(X) is present but evidence references are incomplete (EvidenceCompleteness folds to degrade under Core/RegulatedX policy), so the join yields GateDecision=degrade. The DecisionLog records which GateCheckRef caused the fold and the declared publish reaction for degraded release.

Show B (CV ✖, GF n/a). CV aggregate is degrade. All GateFit checks return abstain by activation, and any GateFit-oriented explanation is inapplicable. The gate’s published decision is driven by CV; the DecisionLog shows CV status and the “inactive GF” boundary rather than a fabricated GF narrative.

Episteme vignette — “Cross-plane comparability gate”

Tell. A flow reaches a comparability-critical step (CSLC). The gate publishes BridgeId + UTS + CLPlane and edition pins for downstream consumers, and remains stable under the A.21 equivalence witness.

Show A (Core, clean crossing). The gate publishes EditionPins{CGSpec, ComparatorSet, TransportRegistryPhi}, ComparatorSetRef, CL/CLPlane, and a GateDecision=pass with a rationale that cites the relevant GateCheckRefs and editions.

Show B (SquareLaw mismatch). A crossing attempts to change plane pins without the commutative-square witness; the SquareLaw check yields block (or degrade under a profile with a less strict fold policy), and the DecisionLog records the mismatched pins as the reason.

Bias-Annotation

This pattern’s built-in biases are stated across the five Principle-Taxonomy lenses (Gov, Arch, Onto/Epist, Prag, Did).

  • Gov. Bias toward auditability and explicit responsibility (DecisionLog + profile-bound folds). Risk: gate-stewardship roles become de facto governors; mitigation: keep profiles explicit, inheritable, and pinned to PathSliceId for reviewable replay.
  • Arch. Bias toward a microkernel of checks (pluggable GateChecks + join aggregation). Risk: “check sprawl”; mitigation: scope discipline + forbidden LEX pseudo-checking + CC-based profile minima.
  • Onto/Epist. Bias toward a 4-value admissibility lattice and explicit “does not apply” boundaries. Risk: oversimplifying nuanced epistemic uncertainty; mitigation: preserve structured rationales and allow check-scoped unknown policies rather than inventing new global decision values.
  • Prag. Bias toward determinism and replayability (cache invalidation by pinned vectors). Risk: higher publication overhead; mitigation: PublishMode=Lite for faces (never for weakening checks).
  • Did. Bias toward explicit separation (CV vs GF) and “what is published” clarity. Risk: more concepts to learn; mitigation: archetypal grounding + stable minimal pins across faces.

Conformance Checklist

Conformance use. This checklist is evidence for the gate-decision publication guidance already stated in the Solution. It is not the first entry text for ordinary use and not a full audit regime by default; an item is applied only when its corresponding gate, check set, decision, crossing, launch, publication, or assurance move is live. Before applying any item, name the Solution move it tests; if no such reader move is live, treat the item as support-only or not applicable rather than expanding the applied assurance or conformance material.

Conformance groups. Ordinary gate use starts with the active gate, check set, CV aggregate, GateDecision, and DecisionLogRef. Crossing/launch items apply only when the gate is a GateCrossing or LaunchGate. Publication/assurance items apply only when MVPK faces, evidence carriers, decision stability, or replay are live. Extension/change items apply only when lexical tokens, profile variants, or neighboring policy/evidence loci are being changed or consumed.

Minimum unified conformance for A.21 (and any flow that claims GateFit discipline):

Core gate semantics

  • CC‑TGA‑06: all GateCrossings (CtxState changes, and work-boundary crossings via LaunchGate) are mediated by OperationalGate(profile) and have a DecisionLog.
  • CC‑TGA‑07: CV=>GF activation predicate holds (CV.Status!=pass => GF=abstain).
  • CC-TGA-21: decision stability witness is present on the DecisionLog record as an A.21 EquivalenceWitness or EquivalenceWitnessRef.
  • CC‑TGA‑21a: aggregation is the join on GateDecision values abstain <= pass <= degrade <= block; GateDecisionExplanation is optional and non-decisional.
  • CC‑TGA‑22: error|timeout folds are profile-bound; unknown folds per GateCheck policy.
  • Gate-looking display boundary: a dashboard state, green tile, readiness badge, conformance label, CV result, safety-envelope note, or release screen is not gate passage unless active OperationalGate(profile), effective GateCheckRef set, aggregate, GateDecision, DecisionLogRef, scope, and currentness/window are recoverable.

LaunchGate discipline (pre-run barrier)

  • CC‑TGA‑08: every U.WorkEnactment has exactly one LaunchGate with mandatory FreshnessUpToDate + DesignRunTagConsistency; pre‑run barrier: if ConstraintValidityStatus!=pass over the declared ingress predecessor set or ingress cut-set for the addressed PathSlice, then all LaunchGate GateFit checks are abstain and the overall GateDecision=block (logged).

  • Pre‑Run barrier is satisfied for any U.Work where FinalizeLaunchValues is possible.

Publication and evidence

  • CC‑TGA‑20: PublishMode=Lite changes face reduction only; required GateChecks remain intact.

  • CC‑TGA‑25: AssuranceLane carries GateProfile, GateCheckRef list, edition pins, GateDecision, and DecisionLogRef with the two-part evidence scheme (SCR/RSCR + VALATA).

Cross-boundary additions (when the gate is a crossing)

  • CC‑TGA‑11: crossings publish BridgeId + UTS + CLPlane/CL^plane, penalties appear in the R-channel only.
  • CC‑TGA‑23: SquareLaw holds on crossings; mismatch yields block|degrade per profile and is logged.

Lexical norms (E.10 discipline)

  • Tech names are ASCII and twin-labeled; required token classes are registered under LEX (including GateProfile, GateCheckKind, GateCheckRef, DecisionLog).
  • Any lexical alias view is trace-only and cannot change GateDecision.

Consequences

Benefits

  • Deterministic gating. Join-semilattice aggregation makes decisions order-independent and idempotent (modulo declared equivalence), enabling consistent audit and replay.
  • Clean CV/GF separation. Activation boundary keeps profile concerns out of mechanism validity.
  • Profile clarity. Fold policies (error|timeout|unknown) are explicit and profile-bound, making safety review result inspectable.
  • Publication hygiene. MVPK faces remain pins+refs (no new numeric claims), and DecisionLog captures rationale without procedural commitments.

Trade-offs

  • More decision records to publish. Decisions are not “just pass/fail”: they require rationales, pins, and logs.
  • Two-stage reasoning. Users need the rule “GF does not apply until CV.Status=pass holds”; mitigated by explicit inapplicability rules and optional narratives only when applicable.
  • Scope complexity. Multi-scope merge semantics can feel heavy; mitigated by union + worst-wins + preserved rationales.

Rationale

  • The microkernel framing preserves a single graph semantics: checks are nodes and publications, not an external pipeline; this keeps a second hidden process order outside the gate core.

  • The join lattice provides a minimal, monotone aggregation that supports:

    • early absorption at block without specifying execution strategy, and
    • deterministic publication semantics (commutative + associative + idempotent).
  • CV⇒GF activation is the mechanism that keeps orthogonality strict while still publishing a single gate decision publication: GF results do not replace CV failures.

  • Explicit folds for error|timeout|unknown make safety review result inspectable and profile-specific without inventing new decision values.

SoTA-Echoing

Source references (post-2015) that this pattern adopts/adapts/rejects, consistent with the TGA goal of assured lanes, open graph composition, and join-semantics.

  • Adopt. Join-semilattice aggregation as deterministic, profile-bound merge (distributed systems / CRDT literature, e.g., Kleppmann 2017; Kleppmann & Beresford 2017): A.21 uses the algebraic idea only so declared gate-check outcomes fold to the same GateDecision under the same active profile and equivalence witness. It does not import CRDT architecture or use CRDT as prestige terminology.

  • Adapt. Compositional reasoning with commuting diagrams (applied category theory, e.g., Fong & Spivak 2019): A.21 adapts the intuition by making SquareLaw a gate-audited invariant on crossings, while keeping publications human-first and pin-based.

  • Adapt. Supply-chain provenance / policy gating via attestations (software supply-chain security, e.g., in-toto 2019; SLSA v1.2 current specification for provenance and VSA attestation formats): A.21 adapts the attestation-shaped evidence discipline as MVPK pins plus DecisionLog, not DevOps workflow, tool-specific methods, or runtime scripts.

  • Reject. Narrative-as-authority. Any approach where human-readable explanations function as decision-bearing records is rejected; in A.21, narratives remain optional derivatives of structured rationales and are explicitly non-decisional.

Action result from the gate-publication and attestation practice basis: green tiles, readiness badges, release screens, conformance labels, safety-envelope notes, CV results, and gate-looking explanations do not become gate passage, release permission, safety acceptance, assurance, work occurrence, or work authorization by appearance. The local A.21 result is an active OperationalGate(profile), active GateProfile, effective GateCheckRef set, CV aggregate, GateDecision, DecisionLogRef, scope, and currentness/window, or else the item remains a cue, source pointer, CV result, evidence question, or neighboring-pattern exit. Reopen the gate result when the active profile, check set, CV aggregate, decision, rationale, scope, currentness/window, equivalence witness, or consuming neighboring relation changes.

Relations

  • E.TGA →coordinates→ A.21. GateFit-scoped GateChecks are aggregated by OperationalGate(profile); enumeration and publication shape of GateChecks live here.
  • A.20 →couples_to→ A.21 via CV=>GF. CV is evaluated inside transformations; while CV.Status!=pass, GF is abstain and GF explanations do not apply.
  • A.21 GateProfile binding. A.21 carries the current profile binding, inheritance boundary, and minimum mandatory check-set semantics. Fuller matrix support is not a separate current authority unless a current governing pattern explicitly admits it.
  • E.18 / G.11 →provide→ scope and refresh boundaries. subflow scope is bounded and restartable through PathSlice and refresh wiring where live; weakening check sets SHALL use a new PathSlice.
  • F.9 / F.17 / E.17 / E.18 →required_by→ any edition-citing face. Whenever gate faces cite editions, the compatibility reference (BridgeCard + UTS + CL/CLPlane) is required for downstream consumption.
  • A.21 / G.6 / G.11 →define→ equivalence for decision stability. Gate decisions are stable only under the declared equivalence witness; evidence-path or refresh implications use G.6 or G.11 where live.

A.21:End

Structure and Structural Views (STRUCT-CAL)

Type: Architectural pattern Status: Stable Normativity: Normative unless explicitly marked informative

Problem frame

Use this pattern when a practitioner needs to select structure as an EntityOfConcern: the organization, relation class, constraint, invariant, variation class, preserved arrangement, or lost arrangement that changes a next engineering or reasoning move.

The first A.22 question is positive: what is organized, over which bounded context and substrate, what relation or constraint matters, what is preserved, what is lost, and what use or stop condition follows. Diagrams, graphs, documents, source items, mathematical-lens outputs, project records, and architecture descriptions may help expose that structure; they do not replace the selected structure. The first useful move is small:

StructureQuestionCard@Project:
declared structure substrate:
bounded context:
candidate structure:
relation, operation, constraint, invariant, or variation class:
what is preserved:
what is lost, hidden, or excluded:
reliance relation, if being claimed: source-description, base-dependence, grounding, evidence, lens, simulation, extraction, or representation
admissible use:
non-admissible use:
governingPatternApplicationRefs, if another claim is being made:

StructureQuestionCard@Project is a project-side triage aid for this selected-structure move. It is not a new structure kind; evidence, gate, decision, work, release, publication, source-use, or description-use claims are governed by their FPF patterns when they are being made.

Ordinary minimum: name the bounded context, the candidate structure, one relation, constraint, invariant, or variation class that changes action, one non-admissible overread, and the FPF pattern application or stop. Fill preserved or lost structure, reliance-relation, and source-return fields only when extraction, coarsening, source-description, base-dependence, grounding, evidence, lens, simulation, representation, or action reliance is being claimed. All other fields are conditional and may be not used.

Stop at this card when it makes the next structure move clear. Use heavier records only when a named publication, reuse, extraction, coarsening, comparison, lens, architecture-description, or other claim is being made.

What goes wrong if A.22 is missed: architecture becomes a document, a module diagram, a TGA graph, a mathematical-lens output, or a project record; a source, lens output, or view becomes the structure; a coarsened or extracted representation becomes loss-free. Those collapses damage first-principles reasoning because the practitioner cannot see what is organized, what carries the claim, which reliance relation is being claimed, and where the use stops.

What A.22 buys in practice: a practitioner can name selected structure, state preserved and lost structure, name source or lens reliance when it is being claimed, return to source when the loss matters, and apply the FPF pattern that governs any non-structure claim being made.

Not this pattern when the question under repair is grounded architecture adequacy, architecture structural-view adequacy, or mathematical-lens use. Use [C.30](/generated/patterns/C.30), [C.30.ASV](/generated/patterns/C.30.ASV), or [C.29](/generated/patterns/C.29) respectively. For any other claim being made, use the governing FPF pattern and keep A.22 only to the selected-structure portion.

Thin precision-restoration pointer: if the issue under repair is still whether wording such as architecture, structure, diagram, module, model, view, functional architecture, or a source label such as layer, level, tier, stack, block, expert, cache, router, or gate names a structure, a structure description, an architecture description, a view, a carrier, or another governed claim or relation named by value, use [C.30.P](/generated/patterns/C.30.P) and [C.30.STRAT](/generated/patterns/C.30.STRAT) as triggered before applying A.22. Do not copy either trigger table here; A.22 resumes only after the selected-structure claim or structure-view portion is recoverable.

Problem

FPF needs a selected-structure EntityOfConcern that is useful before any one domain ontology, mathematical formalism, architecture notation, or publication form takes over. Working projects often notice that "the structure" is doing real work:

  • dependencies repeat across cases;
  • a method or work description hides an invariant relation;
  • a model compresses a trace by preserving one relation class and losing others;
  • a diagram shows an arrangement but is mistaken for the arrangement itself;
  • a mathematical lens exposes preserved structure but is then overread as ontology;
  • an architecture discussion needs selected structure over a holon before it can describe architecture.

How can FPF let a practitioner name structure as an EntityOfConcern while preserving the distinction between:

  • selected structure and the source, evidence path, lens output, simulation, generated representation, or declared substrate from which it was inferred or declared;
  • structure and a Description episteme or view of that structure;
  • structure and a publication face, diagram, table, graph, or carrier;
  • structure and mathematical-lens application;
  • structure and another FPF claim kind governed by its governing pattern;
  • structure in general and architecture-specific structure selected by C.30.

Forces

ForceTension
First-principles structure EntityOfConcern vs ontology inflationFPF needs a reusable selected-structure EntityOfConcern for relations, constraints, invariants, variation classes, preserved organization, and lost organization, but adding one such EntityOfConcern can accidentally invite many false root kinds.
Useful compression vs source returnStructure makes work easier by compressing cases, but a source-return condition is needed when compression, extraction, coarsening, source-description reuse, base-dependence reuse, grounding reuse, evidence reuse, lens reuse, simulation reuse, or representation reuse hides a distinction needed for action.
Description and view usability vs structure confusionDescriptions and views make structure inspectable, but a useful view can be mistaken for the structure itself.
Mathematical-lens application vs mathematical overreadC.29 lenses can expose structure, but lens output does not become the structure and does not license evidence, causal, assurance, or decision claims by itself.
Architecture dependency vs architecture takeoverArchitecture uses selected structure through C.30; A.22 does not import architecture as its parent or make every structure an architecture.
Plain engineering speech vs Tech recoveryWords such as structure, graph, architecture, module, function, interface, pattern, block, layer, level, tier, stack, expert, cache, router, and gate can remain in Plain prose, but FPF-governed use needs recoverable Tech fields and FPF pattern applications. Source-label recovery is governed by C.30.STRAT before A.22 accepts a selected-structure portion.

Solution

Select U.Structure as a dependent, non-agentive EntityOfConcern:

U.Structure is the organization of typed relations, constraints, invariants, variation classes, and admissible references to operation or dynamics descriptions over a declared substrate, or declared A.6.6 base declaration when base-dependence is being claimed, inside a bounded context and admissible-use frame.

The first useful A.22 move is about the selected structure itself: name the bounded context, selected structure, relation, constraint, invariant, variation class, operation or dynamics reference that matters, preserved or lost organization, and the source-return condition or governing-pattern application needed for work. Description records, views, publications, diagrams, and carriers are used only as aids that make that structure move inspectable, reusable, comparable, or safe to rely on; they do not share the center of the Solution.

U.Structure may fill EntityOfConcern for a structure description, view, or structure-claim relation. Generic description and publication-use guards belong in the boundary section below, not in the selected-structure definition.

EntityOfConcern bridge. In A.22, "EntityOfConcern" names the mode in which selected structure is treated: dependent, non-agentive, claim-bearing through descriptions or views when those description or view uses are being made, and not reducible to one physical part or one publication. It is not a second EntityOfConcern head beside EntityOfConcern. When a structure description or view is being used, DescriptionContext.EntityOfConcernRef names the selected structure, structure claim, or relation governed by the governing pattern for that use; publication faces, forms, units, carriers, and renderings only make the episteme or view available.

A.22 governs U.Structure as a dependent, non-agentive EntityOfConcern. It works first over selected-structure EntityOfConcern records and structure-claim reliance relations. Structural descriptions, structural views, extracted structural views, structural-aspect descriptions, structural-coarsening descriptions, and structure-general source-return conditions are subordinate record forms used only when they preserve the selected-structure move, expose loss, enable comparison, or state a reliance boundary. A.22 does not govern architecture descriptions directly; C.30 and its subpatterns govern architecture as a use of selected structure over a described holon.

Auxiliary description and publication-use boundary

This subsection is the A.22 auxiliary description and publication-use boundary. It protects the selected structure from description, publication, and source overread without turning A.22 into a general pattern about descriptions.

U.Structure is not the grounding holon, source, evidence path, lens output, simulation, generated representation, declared substrate itself, U.Holon by default, U.Work, evidence record, gate decision, project decision, architecture claim, or mathematical lens. It does not act, optimize, prove, warrant, authorize, promise, prescribe, decide, or release. When one of those publication-use or project-side claims is being made, the governing pattern is named for the evidence, assurance, causal, gate, decision, publication, work, base-declaration, source-description, lens, architecture-description, or mathematical-lens-use claim being made. A.22 keeps only the structure portion and the source-return condition that protects the structure use.

Descriptions and views of structure are Description epistemes and specification-use cases under the EntityOfConcern and Description-episteme boundary and specification-use and refinement discipline, not the structure itself. A publication, diagram, graph, table, dashboard, file, carrier, model card, or generated representation can make a structural description or view available, but it does not become the selected structure or supply evidence, assurance, gate, decision, work, release, or authority claim by appearance.

Selected Structure Object

U.Structure ::= {
  structureId,
  declaredStructureSubstrateRef:
    U.EntityRef | U.HolonRef | U.EpistemeRef | DeclaredSubstrateRef,
  boundedContextRef,
  relationSignatureRefs?,
  operationOrDynamicsDescriptionRefs?,
  constraintRefs?,
  invariantRefs?,
  symmetryRefs?,
  topologyOrGeometryRefs?,
  stateSpaceRefs?,
  causalOrPredictiveDescriptionRefs?,
  informationRegularityRefs?,
  coarseGrainingRefs?,
  generalStructureAspectKindRefs:
    functional | mereological | modular | flowTransduction |
    control | workMethod | roleEnactor | evidenceAssurance |
    semantic | informational | causalPredictive | dynamical |
    algebraic | topological | geometric | scaleCoarseGrained |
    otherDeclared,
  granularityOrScaleRef?,
  equivalenceOrIsomorphismCriterion?,
  variationClassRefs?,
  preservedUnder?,
  brokenBy?,
  admissibleUse,
  nonAdmissibleUse
}

The field list is a recovery aid, not a demand to fill every field. The ordinary record names only the fields that carry the next admissible move. When state, dynamics, causality, measurement, bridge, evidence, assurance, gate, work, decision, or mathematical-lens claims are being made, the record names the governing pattern instead of absorbing that claim kind into A.22.

A.22 generalStructureAspectKindRefs are general structure-aspect cues. C.30.ASV ArchitectureStructureKindRef values are architecture-local structure-kind classifiers for structures selected by ArchitectureOf@Context. A matching label does not imply identity. Use a declared mapping when an A.22 aspect is used as an architecture structure kind.

Structure claim reliance relation selection

A.22 does not mint a local support-headed or basis-headed relation record. When a structure claim relies on something beyond the selected structure itself, choose the reliance relation named by value kind and governing pattern:

Live reliance relation kindWhat is namedGoverning ontology to apply
Source-description relationsource episteme, source view, publication or carrier where relevant, described structure or structure claim, source pins or source-return condition, admissible and non-admissible useA.7, A.6.3, E.17, E.17.0, and local source-publication rules
Base-dependence or basednessdependent = structure claim or structural description, base, declared baseRelation, scope, declared Γ_time when temporal scope is claimed, witness refs when witness use is claimed, admissible and non-admissible useA.6.6 SWBD or Context-local SWBD specialization
EntityOfConcern or grounding-holon groundingselected EntityOfConcern, GroundingHolonSlot when grounding-holon grounding is being claimed, bounded context, viewpoint, reference plane, observation or witness condition if observation or witness use is being claimedC.2.1, A.6.4, A.6.3.RT, A.6.6 only if it is a base-dependence claim
Evidence or witness relianceevidence path, evidence role, claim ref, witness carrier, timespan and freshnessA.10, A.2.4, G.6
Mathematical-lens reliancelens candidate, lens card, or lens-use record; primary EntityOfConcern; relation record or claim record named by value when lens reliance is being claimed; preserved structure; lost structure; stop condition; MathLensUseOutputRef; C.29 lens-use result; or LensUseAdmissibilityValueC.29, C.26, F.9, named mathematical-lens pattern
Simulation, generated representation, model, or extracted tracesource or representation publication, extraction method, validation boundary, preserved structure, lost structure, source-return conditionsource-description and Description-context patterns plus C.29, A.10, or governing pattern when a claim of that kind is being made

If no reliance relation kind can be selected, keep the material as source-finding, recognition, ordinary help, quote-only wording, or reduced-use cue. Do not create a support-headed or basis-headed record to make the claim look governed.

U.Structure does not carry description, representation, extraction, mathematical-lens, simulation, support, or basis-headed state as an internal structure field. Those are source-description, base-dependence, evidence, lens, extraction, simulation, or publication relations about a structure. PublicationRef is not an admissible substitute for the source episteme, source view, evidence path, SWBD, or lens output.

Structural descriptions and views

Structural descriptions and views reuse existing episteme and view machinery. Architecture does not define a second ontology of descriptions, views, viewpoint bundles, multi-view descriptions, publications, carriers, or source-pin sets. Every record whose name ends in Description@Context here is a specialization of existing U.Episteme governed by C.2.1 and E.10.D2. Every record whose name ends in View@Context here is a specialization of existing U.View or U.EpistemicViewing governed by A.6.3 and E.17.0. DescriptionContext is imported, not locally redefined.

StructuralDescription@Context ::= {
  descriptionId,
  descriptionContext: DescriptionContext(EntityOfConcernRef, BoundedContextRef, ViewpointRef),
  structureRefs: FinSet(U.StructureRef),
  structureClaimRelianceRefs?: FinSet(U.ScopedWitnessedBaseDeclarationRef | EvidencePathRef | MathLensUseOutputRef | SourceReturnConditionRef | NamedClaimGoverningPatternRef),
  describingEpistemeRef,
  admissibleUse,
  nonAdmissibleUse
}

StructuralView@Context ::= {
  viewId,
  descriptionContext: DescriptionContext(EntityOfConcernRef, BoundedContextRef, ViewpointRef),
  structureRefs: FinSet(U.StructureRef),
  structuralAspectDescriptionRefs?,
  selectedRelationsOrOperations,
  hiddenOrLostStructure,
  admissibleUse,
  nonAdmissibleUse
}

descriptionContext.ViewpointRef is the viewpoint field. Do not duplicate it locally under another name unless the governing pattern supplies a more specific view record.

Extracted and transformed structural views

Use extracted or transformed structure records when a corpus, trace, model, lens, simulation, generated representation, coarsening pass, observer boundary, or budget boundary produces a view of structure that may hide distinctions.

ExtractedStructuralView@Context ::= {
  extractedViewId,
  descriptionContext: DescriptionContext(EntityOfConcernRef, BoundedContextRef, ViewpointRef),
  sourceCorpusOrTraceRefs,
  structureRefs: FinSet(U.StructureRef),
  extractionDescriptionRef,
  preservedStructure,
  lostStructure,
  validationBoundary,
  sourceReturnCondition,
  admissibleUse,
  nonAdmissibleUse
}

StructureExtractionDescription@Context ::= {
  extractionDescriptionId,
  descriptionContext: DescriptionContext(EntityOfConcernRef, BoundedContextRef, ViewpointRef),
  sourceInputKind,
  lensOrMethodRef,
  budgetOrObserverBoundary?,
  preservedStructureKinds,
  lostStructureKinds,
  validationBoundary,
  sourceReturnCondition,
  admissibleUse,
  nonAdmissibleUse
}

StructuralAspectDescription@Context ::= {
  aspectDescriptionId,
  descriptionContext: DescriptionContext(EntityOfConcernRef, BoundedContextRef, ViewpointRef),
  aspectKindRef,
  structureRefs: FinSet(U.StructureRef),
  structureClaimRelianceRefs?: FinSet(U.ScopedWitnessedBaseDeclarationRef | EvidencePathRef | MathLensUseOutputRef | SourceReturnConditionRef | NamedClaimGoverningPatternRef),
  admissibleUse,
  nonAdmissibleUse
}

StructuralCoarseningDescription@Context ::= {
  coarseningDescriptionId,
  descriptionContext: DescriptionContext(EntityOfConcernRef, BoundedContextRef, ViewpointRef),
  sourceStructureRefs: FinSet(U.StructureRef),
  resultStructureRefs: FinSet(U.StructureRef),
  preservedUnder,
  brokenBy,
  lostStructure,
  sourceReturnCondition,
  admissibleUse,
  nonAdmissibleUse
}

Source return

SourceReturnCondition is present when compression, extraction, coarsening, evidence reuse, mathematical-lens use, simulation, ML evaluation, bounded exception, many-to-many allocation, or decision reliance hides a distinction needed for action, assurance, causal use, legal review, regulatory review, comparison, or subsequent decision reopening.

Do not make source return mandatory for ordinary local recognition when no hidden distinction is being used for action. The condition is needed only when the repaired text still relies on the source-side distinction.

Relation to architecture

StructuralAspectDescription@Context describes one selected structural aspect under A.22. It is not an ArchitectureStructureKindRef by itself. ArchitectureStructuralView@Context is a C.30.ASV view over structures selected by ArchitectureOf@Context and typed by ArchitectureStructureKindRef.

A.22 is intentionally upstream of C.30. Architecture uses structure; structure does not import architecture as a parent.

C.30 uses A.22 by selecting architecture-relevant structures for one described holon through ArchitectureOf@Context. C.30.ASV then governs architecture structural views over those selected structures. A structure can be used by architecture, but a structure is not an architecture merely because an architecture description refers to it.

Architecture-related records that belong to C.30 or its subpatterns include ArchitectureOf@Context, ArchitectureDescription@Context, ArchitectureStructuralView@Context, ArchitectureStructureKindRef, ArchitectureStructureKindTriage@Project, FunctionalStructureView@Context, ArchitectureFlowStructureRelation@TGA, ControlStructureView@Context, and CrossScopeArchitectureResidualTriage@Context. A.22 may name them as FPF pattern applications. It does not define their architecture-specific conformance.

Boundary and repair table

Tempting collapseA.22 repair
The reliance relation is treated as the structure.Name declaredStructureSubstrateRef and, when source, base-dependence, grounding, evidence, lens, simulation, extraction, or representation reliance is being claimed, name the governing ontology named by value or FPF pattern application; keep structure as selected organization over the declared substrate and do not turn that reliance relation into structure.
The diagram, graph, table, dashboard, or carrier is the structure.Treat it as publication, description, view, carrier, source-description relation, base-dependence relation, grounding relation, evidence relation, lens relation, simulation relation, extraction relation, or representation relation only when its relation is explicit.
A TGA graph is the structure in every sense.Use E.18 for graph, path, crossing, and flow valuation; use A.22 only for the selected structure claim; use C.30.TGA-FLOW-REL when an architecture-flow description claim is being made.
A mathematical lens output is the structure.Use C.29 for lens-use result and admissibility, and cite MathLensUseOutputRef only through C.29 lens-use result, preserved structure, lost structure, and stop-condition discipline.
A structure proves evidence, assurance, safety, causality, or gate passage.Assign those claims to A.10, G.6, B.3, C.28, A.20, or A.21.
A structure is a decision or work record.Use C.11, A.20, A.21, A.15, or the project-side decision pattern that governs the claim being made.
Architecture is a root kind beside structure.Use C.30: architecture is selected structure for a described holon through ArchitectureOf@Context.
Function, module, interface, platform, layer, stack, block, expert, cache, router, or gate becomes a root kind by appearing in structure prose.Use C.30.STRAT for source-label recovery, then A.6.F, A.6.M module-relation repair when a module-interface claim is being made, A.6.0, A.6.5, A.6.B, A.6.C, A.6.8, E.18, C.30.ASV, and governing patterns as triggered.

Worked slices

Architecture kernel slice. A team says, "the architecture is the graph." A.22 does not accept that sentence as a root-kind claim. The repair is:

declaredStructureSubstrateRef: TransductionGraphRef under E.18
candidate structure: selected flow structure or selected transduction structure
structure-claim reliance relation: selected reliance relation named by value(
  sourceDescriptionOrPatternApplicationRef = SourceViewRef or E.18 graph, path, or crossing record,
  governingPatternRef = E.18, A.6.6, A.10, or C.29 when that reliance claim is being made,
  relationKind = source-description | base-dependence | evidence | lens, selected for this reliance,
  validationBoundary = path currentness boundary, slice currentness boundary, or crossing currentness boundary
)
next FPF pattern application: C.30.TGA-FLOW-REL when this selected structure is used in an architecture-flow description
non-admissible use: graph as whole architecture, work, evidence, gate, or decision

The useful move survives: the practitioner can use the graph as a governed reliance relation for selected flow structure without turning it into architecture ontology.

Extracted code structure slice. A code-agent relation graph or probe JSON reports imports, calls, registry wiring, and data-flow links. A.22 treats it as an extracted structural view only when the source, extraction method, preserved structure, lost structure, validation boundary, and source-return condition are named. The relation graph or probe output is not the codebase architecture itself and is not proof of internal agent belief, assurance, or release readiness.

ExtractedStructuralView@Context:
  sourceCorpusOrTraceRefs: repo snapshot, probe outputs, traces
  preservedStructure: selected typed relation families
  lostStructure: unexplored regions, dynamic calls, hidden generated code, ambiguous relation kinds
  validationBoundary: probe coverage and source edition
  sourceReturnCondition: when an architecture decision, assurance use, or repair depends on a relation not observed by the extraction

Archetypal Grounding

Tell-Show-Show rowGrounding
TellA practitioner sees an arrangement that matters but does not yet know whether it is a diagram, a model, a graph, an architecture claim, a source description, base-dependence relation, evidence relation, lens relation, or decision. A.22 asks first: what organization is being selected, over what declared substrate and with what reliance relation, under what context, and with what loss?
Show: U.SystemIn a plant, vehicle, software system, or neural-network model, the selected structure may be flow or transduction, control, module-interface structure, placement, information, scale, or declared logical structure. The structure record does not become the system and does not prove that the system is safe, maintainable, or ready.
Show: U.EpistemeA paper, model, generated relation graph, dashboard, architecture note, or mathematical-lens output can describe selected structure or serve as a source-description or A.6.6 base-dependence relation for a selected-structure claim. The episteme, view, or publication is not the structure itself; it carries a description, view, or reliance relation named by value with validation and source-return boundaries.

Bias-Annotation

Lenses tested: Arch, Onto, Epist, Prag, Did, Gov. Scope: universal within FPF structure claims.

Bias riskMitigation
Architecture biasDo not make architecture the parent of all structure. A.22 stays upstream; C.30 carries grounded architecture and selected-structure adequacy.
Mathematical-formalism biasA mathematical lens can expose preserved structure and lost structure, but C.29 remains the governing pattern for lens-use result, admissibility, and stop condition.
Diagram biasA useful diagram or generated relation graph is attractive enough to be mistaken for the structure. description, specification-use, and publication boundaries stay explicit.
Review-only biasChecks leave a repair move: name the structure, name the structure-claim reliance relation named by value, state a structural view, return to source, or apply the governing FPF pattern.
Didactic-thinning riskSemantic repair does not leave inert prose. The recognition text keeps the first useful move and the practical payoff visible before the formal records.

This checklist verifies the preceding guidance after the practitioner has chosen the selected move; it is not a required project control form and not a substitute for the card, note, view, relation, or repair move above.

Conformance Checklist

IDRequirementFailed-check repair
CC-A22-1 Selected structure EntityOfConcern.An FPF-governed structure claim names U.Structure or an existing FPF kind or relation named by value record; it does not mint an architecture-adjacent root kind.Replace the broad noun with U.Structure or assign the claim to the existing FPF kind or relation named by value record.
CC-A22-2 Non-agentive structure.Structure wording does not make the structure act, optimize, prove, decide, warrant, sense, plan, or adapt.Move agency, proof, decision, or work claim to the governing pattern and keep A.22 to selected organization.
CC-A22-3 Structure-claim reliance relation boundary.When source, base-dependence, grounding, evidence, lens, simulation, extraction, or representation reliance is claimed, the governing A.6.6 relation ontology, source-description ontology, evidence ontology, lens ontology, assurance ontology, causal ontology, gate ontology, decision ontology, or publication ontology is named.Add the governing pattern, relation kind where the relation is being claimed, validation boundary, admissible use, and non-admissible use, or mark the reliance phrase as carrying no admissible reliance.
CC-A22-4 Description and view separation.A structural description, structural view, extracted view, diagram, table, graph, dashboard, or publication face is not treated as the structure itself.Downgrade the artifact to description, view, source-description relation, A.6.6 base declaration, carrier, or publication and name the selected structure separately only if selected organization is being claimed.
CC-A22-5 DescriptionContext reuse.Description epistemes and specification-use cases reuse DescriptionContext, U.Episteme, U.View, A.6.3, and E.17 machinery; no second architecture-local description and view ontology is introduced.Replace local description and view fields with the imported DescriptionContext fields or assign the claim to the existing governing pattern.
CC-A22-6 Source return.SourceReturnCondition is present when hidden source-side distinctions are used for action, assurance, causal use, legal or regulatory review, comparison, or decision reopening.Add one source-return condition or narrow the record's admissible use so the hidden distinction is not relied on.
CC-A22-7 Non-structure claim kind.Evidence, assurance, gate, release, causal, dynamics, measurement, work, decision, publication, bridge, and mathematical-lens claims are assigned to their governing patterns.Name the governing FPF pattern and the claim kind being made; do not add fields to A.22 to absorb it.
CC-A22-8 Architecture pattern application.Architecture claims use C.30 and ArchitectureOf@Context; A.22 does not treat architecture as a root kind or define C.30-specific records.Apply C.30 or a C.30 subpattern and keep A.22 only as the selected-structure EntityOfConcern and structure-claim reliance relation.
CC-A22-9 Plain and Tech recovery.Plain structure phrases may remain, but if they carry ontological, evidence, causal, assurance, bridge, gate, work, decision, or admissibility claim, the relevant Tech fields and FPF pattern applications are recoverable.Add the missing Tech fields or demote the Plain phrase to ordinary recognition wording.
CC-A22-10 Useful action.The repair leaves a surviving admissible practitioner move: name the structure, name the structure-claim reliance relation named by value, state a structural view, return to source, or apply the FPF pattern that governs the claim kind being made.Restore that move, or classify the phrase as reduced-use cue, quote-only wording, blocked transfer, or incomplete rewrite.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Structure-as-documentA diagram, table, dashboard, relation graph, or prose section is called the structure.Recover publication, carrier, description, or view relation; name the structure separately only when selected organization is being claimed.
Reliance-interpretation-as-structureA source trace, benchmark, lens output, model, or simulation is treated as the structure.Name the governing A.6.6 relation ontology, source-description ontology, evidence ontology, or lens ontology; state relation kind where the relation is being claimed, validation boundary, and non-admissible use.
Loss-free extractionExtracted or coarsened structure is used without lost structure or source return.Add preservedStructure, lostStructure, validationBoundary, and sourceReturnCondition.
Architecture root-kind reboundStructure work reintroduces U.Architecture or treats architecture as parallel to structure.Use ArchitectureOf@Context and C.30; keep A.22 as the upstream selected-structure EntityOfConcern.
Lens ontology importA mathematical lens output becomes the imported ontology.Use C.29 for the lens, cite it through C.29 lens-use result, preserved structure, lost structure, and stop-condition discipline.
Sterile precision rewriteThe text removes overread but no longer tells the practitioner what to do.Restore the surviving action: structure card, structure-claim reliance relation, Description or view, source return, or FPF pattern application.

Consequences

BenefitCost or trade-off
FPF gains a reusable selected-structure EntityOfConcern without minting architecture, module, interface, platform, or graph as root kinds.A conforming use states context, declared substrate or reliance relation named by value, preserved and lost structure, and non-admissible use when the claim has FPF-governed use.
Structural views become usable without confusing the view, carrier, publication, source relation, grounding relation, and selected structure EntityOfConcern.Existing loose prose that says "the structure is the diagram" needs repair.
C.29 mathematical lenses and E.18 TGA graphs can supply governed reliance relations for structure claims without becoming structure ontology.FPF pattern applications are named by value when evidence, assurance, causal-use, gate, work, or decision claims are being made.
Architecture work can start from selected structure through C.30 instead of forcing architecture to be either a document or a module diagram.Architecture-specific conformance stays outside A.22, so practitioners may need one extra C.30 application when the architecture claim or durable architecture-description use is being made.

Rationale

FPF needs one general selected-structure EntityOfConcern because many useful project claims depend on organization before they depend on a specific architecture, mathematical, measurement, or publication pattern. The selected-structure entity has to be dependent, non-agentive, and claim-bearing through descriptions or views: it can be described, sourced, compared, coarsened, extracted, or used by architecture, but it does not act or certify.

The selected design keeps A.22 small enough for first use. A practitioner can write one StructureQuestionCard@Project and stop. Heavier DescriptionContext, A.6.6 base-dependence, extraction, lens, evidence, and source-return records are used only when the next use would otherwise hide loss, source dependence, or non-structure claim kind.

The reason to keep C.30 separate is architectural clarity. Architecture is selected structure for a described holon under context and concern; architecture descriptions are Description epistemes and specification-use cases or views over that claim, while publications only make those epistemes or views available. A.22 supplies the structure substrate, not the architecture ontology.

SoTA-Echoing

Practice or source lineFPF adoptionAction consequenceBoundary
ISO/IEC/IEEE 42010:2022 architecture-description practiceAdopt the separation of source-side entity-of-interest, concern, viewpoint, view, and correspondence as pressure for DescriptionContext separation, mapped here to EntityOfConcern and DescriptionContext terms.A.22 structural descriptions and views reuse DescriptionContext, viewpoint, view, and correspondence machinery rather than inventing a local display ontology.ISO 42010 does not make every structure an architecture and does not add evidence, assurance, gate, or decision authority.
OMG SysML v2 view practiceAdapt views-as-queries and model-view discipline as a source for treating views as selected renderings over model content.A structural view states selected, hidden, or lost structure when the selection changes action.A view is not the structure and not a proof of the described holon.
C.29 mathematical-lens disciplineAdopt preserved structure, lost structure, lens-use admissibility, and stop-condition discipline when a mathematical lens is used for a structure claim.Cite C.29 output through C.29 lens-use result, preserved structure, lost structure, stop condition, and source-return discipline.Lens output is not structure, evidence, assurance, causal-use relation, or decision.
arXiv:2603.00601 code-space architecture relation-graph work and related code-probing practiceAdapt partial-observability, typed-relation, uncertainty, and source-return pressure for extracted structural views.Use extracted structural-view records with validation boundaries and an observation value selected from observed, inferred, or unknown where needed, plus source-return conditions.Do not mint U.CodeSpace and do not treat probe output, probe JSON, or benchmark output as structure adequacy, assurance, release evidence, or assurance evidence.
Coarsening, compression, and RG-adjacent traditionsAdopt the need to say what structure is preserved and what is lost.Use StructuralCoarseningDescription@Context and SourceReturnCondition before relying on a coarsened structure for action.RG, epiplexity, structural information, and equivalence reasoning are governed by C.29, C.16, or another governing pattern named for the claim being made.
GonzoML neural-network architecture discussions as practitioner-language intakeAdapt block replacement, dataflow change, memory placement, cache placement, path-selection, pruning, distillation, and architecture-search wording as general architecture-operation recognition material.When such wording is used, keep block, cache, expert, router, gate, and similar words as C.30.STRAT source labels until changed structure kind, source relation, base-dependence relation, evidence path, lens output, preserved structure, lost structure, and FPF pattern applications are recovered.Neural-network labels, benchmark results, ablations, or pruning masks do not become structure ontology, architecture decisions, evidence sufficiency, gate passage, assurance, or architecture adequacy by themselves.

Relations

Builds on: C.2.1, A.6.P, A.7, A.6.2, A.6.3, A.14, C.16, C.29, E.10.D2, E.10, C.2.P, E.17.0, E.17.1, and F.18.

Coordinates with: C.30.P, C.30.STRAT, C.30, C.30.ASV, C.30.TGA-FLOW-REL, C.30.LCA, C.30.ILC, A.6.F, E.18, A.10, G.6, B.3, A.20, A.21, C.28, A.15, C.11, C.16, C.25, G.5, and governing patterns named for structure-information, equivalence, and synthesis claim kinds when those claim kinds are being made.

Does not replace: C.30.P or C.30.STRAT wording-use precision restoration, C.30 for grounded architecture adequacy and conditional architecture-description use, C.29 for mathematical-lens use, C.16 for measurement and characterization, C.28 for causal-use relation, B.3 for assurance, A.10 and G.6 for evidence, A.20 and A.21 for gates and release, A.15 for work, C.11 for decisions, or E.17 for publication.

A.22:End

Universal Algebra of Aggregation (Γ)

Problem Frame

FPF views reality as a nested holarchy: parts -> assemblies -> systems -> ecosystems; axioms -> lemmas -> theories -> paradigms (this is only example; the exact holarchy of holons is project-dependent). Each level is a U.Holon that becomes part of a wider holon only after an explicit act of construction has glued the parts together. That act is performed by a physical Transformer playing TransformerRole executing a method over an explicit Dependency Graph. Without a domain-neutral law of composition binding these moves, the logical relation between scales would break, violating the core rule Cross-Scale Consistency.

Problem

If each discipline (or project team) invents its own way of “adding things up”, four lethal pathologies appear:

  1. Compositional Chaos — identical parts aggregated by two tools yield different wholes; parallel work becomes impossible.
  2. Brittle Dashboards — system‑level KPIs lie because the roll‑up silently hides the weakest component.
  3. Invalid Extrapolation — proofs that hold locally break globally; safety cases collapse on integration day.
  4. Emergence as Magic — genuine synergy (“whole > sum parts”) is indistinguishable from a modelling error.

All four are witnessed in post‑2015 incidents, from micro‑service outages to meta‑analysis retractions.

Forces

ForceTension
Universality vs SpecificityOne algebra must work for pumps, proofs and policies ↔ each domain owns quirky edge‑cases.
Determinism vs EmergencePredictable, order‑free folds ↔ need to legitimise authentic novelty.
Safety vs SynergyConservative Weakest‑Link bound ↔ modelling genuine redundancy wins.
Simplicity vs FidelityFive rules managers can remember ↔ enough depth for formal proof.
Auditability vs OverheadMachine‑checkable Standard ↔ authors must show their invariants.

Solution — The Invariant Quintet Standard

FPF freezes one universal operator, Γ, and binds it to five non‑negotiable invariants. Compliance with the quintet is the ticket that lets any calculus, in any future discipline, plug into the holarchy.

The Universal Aggregation Operator

Γ : (D : DependencyGraph, T : U.TransformerRole) → U.Holon
  • D — a finite, acyclic graph of sibling holons at level k.
  • T — an external U.TransformerRole (not a node of D); see A.12. Result: a new holon at level k + 1 whose boundary encloses every node of D.

Because Γ is externalised through T, the provenance chain stays intact, satisfying the Transformer Principle;

The Five Grounding Invariants

CodeInvariantPlain‑English headlineWhy it matters
IDEMIdempotenceOne part alone stays itself.Anchors recursion; stops base‑case drift.
COMMLocal CommutativitySwap independent parts, nothing changes.Enables divide‑and‑conquer builds.
LOCLocalityWhich worker or rack runs the fold is irrelevant.Guarantees reproducible distributed runs.
WLNKWeakest‑Link BoundNo claim may exceed the frailest part.Keeps dashboards honest; caps hidden risk.
MONOMonotonicityImproving any part never hurts the whole.Justifies “fix the bottleneck” optimisation.

Mnemonic for managers: S‑O‑L‑I‑D → Same, Order‑free, Location‑free, Inferior‑cap, Don’t‑regress.

Archetypal Grounding

The Invariant Quintet is not an abstract mathematical construct; it is a formalization of common-sense physical and logical realities that manifest across all domains.

InvariantU.System — Pump Skid AssemblyU.Episteme — Scientific Meta-Analysis
IDEMAn assembly of a single pump is just that pump, with its original specifications.A review of a single study is just that study, with its original conclusions and evidence level.
COMM / LOCWelding two independent pump modules to the skid in a different order or in different assembly bays results in an identical final product.The conclusions of a meta-analysis are independent of the order in which two unrelated studies were added to the evidence pool.
WLNKThe maximum pressure rating of the entire pump skid is limited by the pressure rating of its weakest pump or connector.The overall reliability of a synthesized theory is capped by the reliability of its least-supported foundational claim.
MONOReplacing a standard motor with a more powerful, efficient one can only improve or maintain the skid's overall performance; it cannot make it worse.Adding a new, high-quality study to a meta-analysis can only strengthen or maintain the overall confidence in its conclusion, never weaken it (unless it introduces a conflict).

Why only five? (A didactic sidebar)

  • Post‑2015 physics shows that renormalisation flows stabilise if and only if idempotence, locality and monotone bounds hold (Goldenfeld & Ho 2018).
  • Distributed‑data research (Spark 3, Flink 1.19) proves COMM + LOC are prerequisites for deterministic sharding.
  • Safety cases in aviation and ISO 26262 rewrote their risk roll‑ups around Weakest‑Link after 2021 audit failures.

Thus the quintet is simultaneously empirically vetted, mathematically minimal, and cognitively teachable.

Emergence Without Cheating

Real redundancy can push a system above the WLNK ceiling (e.g., RAID 6 survives two disk deaths). FPF treats this not as a rule break but as a Meta-Holon Transition (MHT): the redundant set is promoted to a fresh holon at a new scale, and the quintet re-applies there. The algebra stays pure; emergence becomes explicit, auditable design space. Details live in Pattern B.2 Meta-Holon Transition (MHT): Recognizing Emergence and Re-identifying Wholes (next in cluster).

Domain‑Specific “Flavours” of Γ

The core signature of Γ never changes, but each discipline supplies a flavour that instantiates the quintet with domain‑appropriate mathematics and measurement units.

FlavourTypical domainDropped / relaxed invariantsAdded compensating rulesCanonical reference model (post‑2015)
Γ_sysPhysical & cyber‑physical systemsNoneISO 15926‑2024 Plant Data roll‑up; NASA 2023 Integrated Hazard Model
Γ_epistKnowledge graphs, meta‑analysisNoneProvenance weighting (PW‑1), Citation transparency (PW‑2)OntoCommons 2024 audit trail
Γ_timeTime‑series forecasting, digital twinsCOMM → partial; LOC waivedCoverage completeness (TS‑1), Temporal alignment (TS‑2)EU Battery Passport 2025 reliability stack
Γ_ctxOrder‑sensitive processes, quantum pipelines, social surveysCOMM & LOC waivedReproducibility hash (CTX‑1), Partial‑order soundness (CTX‑2), Observer log (CTX‑3)CERN HL‑LHC workflow 2024

Didactic hint for managers: choose the flavour whose examples look like your own dashboards; then verify your tooling honours its extra rules.

Walkthrough Examples

Γ_sys — Offshore Wind Farm (2025 build)

  1. Parts: 72 nacelles, 72 towers, 1 export cable set.
  2. Graph: acyclic; each nacelle depends on its own tower, all depend on cable.
  3. Fold: Any parallel assembly order is legal → COMM, LOC.
  4. WLNK check: weakest nacelle (load factor = 0.91) bounds farm output ≤ 0.91 × rated.
  5. Upgrade test: swapping one nacelle to 0.95 raises farm bound — satisfies MONO.

Result: farm holon inherits predictable capacity curve; financiers can quote risk‑adjusted yield without bespoke simulation.

Γ_epist — Living Systematic Review on mRNA Therapies (2024–2025)

  1. Parts: 38 peer‑reviewed trials, 12 preprints.
  2. Graph: dependency edges encode shared cohorts; no cycles.
  3. Fold: trials merged irrespective of ingestion order → COMM; distributed evaluators may differ, but provenance hashes equalise weighting → LOC.
  4. WLNK: overall certainty cannot exceed the lowest GRADE score among included trials.
  5. Emergence: discovery of a consistent age‑interaction effect violates WLNK; reviewers declare MHT, elevating the combined dataset to a new holon “Evidence v2” with age‑stratified potency as a novel attribute.

Result: regulators see a transparent promotion of evidence-support status rather than a hidden statistical artefact.

Γ_time — National Grid Frequency Forecast (2025‑2030)

COMM holds only across non‑overlapping windows; LOC is waived because regional sensors differ in latency. Additional TS‑1/TS‑2 rules ensure gaps are filled before aggregation. Engineers iterate locally yet obtain one coherent five‑year projection.

Conformance Checklist (for pattern adopters)

IDCheckHow to demonstrate (engineer‑manager view)Typical evidence carrier
CL‑1Declare flavour (Γ\_sys, Γ_epist, …)Front‑page spec linePattern header
CL‑2Show quintet proofTable mapping each invariant → test or theoremPDF appendix, automated notebook
CL‑3Graph acyclicityStatic analysis or domain ruleScreenshot of tool report / manual argument
CL‑4External TransformerName the role (Standardor, editorial board, orchestration node)Organogram, RACI sheet
CL‑5Emergence pathwayState MHT trigger criteriaFlowchart, decision table

A proposal that skips any line of the checklist fails pattern B.1 and must iterate before peer review.

Consequences

Benefit (managerial)Pay‑off pathTrade‑offMitigation
Clear risk ceiling at every roll‑up (WLNK)Faster go/no‑go gatesMay look pessimisticHighlight redundancy, then invoke MHT
Parallel engineering without merge hell (COMM + LOC)Shorter critical pathRequires origin hash disciplineProvide reference script templates
Continuous improvement strategies justified by MONOLean upgrade budgetsCannot model negative synergiesAttach incentive to detect MHT events
Audit trail readable by non‑expertsEasier certificationExtra documentation overheadAuto‑generate provenance footers

Rationale

The Invariant Quintet is the "renormalisation law" of FPF. It translates deep principles from physics, computer science, and engineering into a universal, algebraic Standard that governs composition in any domain.

Physics & Renormalisation: The invariants mirror the laws of renormalisation group (RG) flows. IDEM, COMM, and LOC ensure that the aggregation is a well-behaved coarse-graining operation, while WLNK acts as a conservative bound on energy and risk, preventing "free lunch" synergies from appearing by mere arithmetic.

  • Distributed Systems: The COMM and LOC invariants are the formal prerequisites for modern, large-scale distributed computing. Systems like Spark and Flink rely on the guarantee that data can be processed on independent workers in any order, and the final result will be deterministic.
  • Systems Engineering & Safety: The WLNK and MONO invariants are cornerstones of safety-critical design. Fault-tree analysis and reliability engineering are built on the WLNK principle that system reliability is bounded by the least reliable link. The MONO principle provides the formal justification for iterative improvement ("Kaizen"): it guarantees that a local fix will not cause a global regression.

By elevating these cross-disciplinary insights to the level of a mandatory, constitutional Standard, FPF ensures that all composition within the framework is predictable, auditable, and physically plausible. It transforms aggregation from an ad-hoc, domain-specific art into a universal, repeatable science.

Anti-Patterns & Conceptual Repairs

Anti-PatternSymptomConceptual Fix
Averaging RiskA dashboard shows a high overall reliability score for a system by averaging a high-reliability component with a low-reliability one.Enforce the WLNK invariant. The aggregate reliability must be min(R_parts), not avg(R_parts).
Order-Dependent BuildsThe same set of software patterns produces a different final build depending on the compilation order.Enforce COMM/LOC. Identify the hidden dependency between the patterns and either remove it or make it explicit, moving to Γ\_ctx if necessary.
Improvement ParadoxA team replaces a component with a better one, but a system-level KPI gets worse.Enforce MONO. This indicates a hidden, negative coupling. The model must be updated to make this coupling an explicit constraint or interaction.
Synergy by NarrativeA claim is made that the whole is greater than the sum of its parts, without a formal mechanism.This violates WLNK. If the synergy is real (e.g., due to redundancy or a new feedback loop), it must be modeled as a Meta-Holon Transition (Pattern B.2).

Relations

  • Builds on: Holonic Foundation, Transformer Principle, Open‑Ended Kernel.
  • Enables: Meta‑Holon Transition (B .2), Calculus of Trust (B .3), Holonic evolution patterns (Cluster C).
  • Refined by: Flavour sub‑patterns B .1.2 – B .1.4.
  • Exemplifies: Pillars Cross‑Scale Consistency, State Explicitness, Ontological Parsimony.

Working maxim: “Aggregation is never neutral; Γ makes its politics explicit and testable.”

B.1:End

Dependency Graph & Proofs

Problem frame

In FPF, every aggregation is a material act:

Γ : (D : DependencyGraph, T : U.TransformerRole) → H′ : U.Holon

D is the only admissible input shape for Γ. It must capture part–whole structure faithfully (A.1, A.14) while staying neutral to order (handled by Γ_ctx and Γ_method), time (Γ_time), and accounting (Γ_work). If D is sloppy—mixing kinds of relations or scopes—Γ becomes unpredictable and the Quintet invariants (IDEM, COMM, LOC, WLNK, MONO) fail in subtle ways.

This pattern normatively defines DependencyGraph, the mereological vocabulary allowed on its edges, and the guards that make Γ provable and comparable across domains.

Problem

Without a disciplined DependencyGraph, four pathologies recur:

  1. Relation drift: Edges blur composition with mapping (e.g., “represents”), or confuse collections with parts. Aggregations then mix algebraic regimes (sums where mins are required, etc.).
  2. Boundary blindness: Cross‑holon influences are drawn as parts, bypassing explicit U.Boundary and U.Interaction. This corrupts locality (LOC) and defeats reproducible folding.
  3. Temporal conflation: design‑time and run‑time holons appear in one graph; simulations then “prove” facts about a blueprint using live telemetry.
  4. Hidden cycles: Self‑dependence enters through aliasing (e.g., a team is a member of itself via “units of units”). Γ cannot topologically fold such graphs.

Forces

ForceTension
Universality vs. PrecisionOne schema for systems and epistemes ↔ different composition logics (physical vs. conceptual) must be kept distinct but compatible.
Parsimony vs. ExpressivenessKeep the vocabulary small (A.11) ↔ include the minimal extra relations that engineers actually use (A.14).
Locality vs. ConnectivityPreserve boundary‑local reasoning (LOC) ↔ still allow explicit external influences via interactions, not parthood.
Static clarity vs. Dynamic useGraphs must be easy to read and verify ↔ also feed Γ_ctx, Γ_time, Γ_method, Γ_work without duplications or mismatches.

Solution

The shape: a typed, scoped, acyclic graph

Definition.

DependencyGraph D = (V, E, scope, notes)
  • V (nodes): each v ∈ V is a U.Holon with:

    • holonKind ∈ {U.System, U.Episteme}
    • DesignRunTag ∈ {design, run} (A.4) — single, uniform per D
    • a declared U.Boundary (A.14)
    • optional characteristics (e.g., F–G–R, CL, Agency metrics) for use by downstream patterns (B.1.2/3; B.3; A.13)
  • E (edges): each e ∈ E is a mereological relation from the normative vocabulary V_rel (below).

  • scope: the uniform temporal scope of the entire graph (design or run).

  • acyclicity: D MUST be a DAG. Any cycle requires refactoring or elevation to a Meta‑Holon (B.2).

Strict distinction (A.15). DependencyGraph encodes part–whole only. Order goes to Γ_ctx/Γ_method. Time evolution goes to Γ_time. Resource spending goes to Γ_work. Cross‑boundary influence goes to U.Interaction (not parthood).

Normative edge vocabulary V_rel (A.14 compliant)

Only the following four mereological relations are allowed in E (A.14):

FamilyRelationShort intentWhere it belongs
StructuralComponentOfphysical/machined part in an assemblyΓ_sys
ConstituentOflogical/content part in a conceptual wholeΓ_epist
Quantity & PhasePortionOfquantitative fraction of a homogeneous stock or carrierΓ_sys / Γ_work
PhaseOftemporal phase/slice of the same carrierΓ_time / Γ_work

Not in V_rel (by design):

  • SerialStepOf, ParallelFactorOforder/concurrency edges of Γ_method/Γ_ctx; not parthood; keep them out of E (see § 4.1 A.15 and Part B.1.5).
  • MemberOfnon‑mereological collective membership; model in Γ_collective (B.1.7), not in E (see § 9).
  • RepresentationOf, MapsTo, Implements — these are mappings, not parthood; model them at the value level (A.15) or as U.Interaction between holons.
  • RoleBearerOf — links a U.System to a U.Role; not parthood (see A.12, A.15).
  • Any “is‑a” (subClassOf) taxonomic relation — orthogonal to parthood.

Minimal axioms & type guards per relation

RelationAxioms (informal)Guards / When to use
ComponentOfanti‑symmetric; transitive; acyclicPhysical assemblies; interfaces compose via BIC (B.1.2). Do not use for collections or pipelines.
ConstituentOfanti‑symmetric; transitive; acyclicConceptual or formal wholes (papers, proofs, specifications). Do not use for material parts.
MemberOf (outside V_rel)not transitive; anti‑symmetric (w.r.t. same collection); acyclicSets/teams/libraries; the whole is a collective holon. Not admissible in E; model via Γ_collective (B.1.7). Use PortionOf for homogeneous stocks.
PortionOfanti‑symmetric; additive; acyclicQuantitative partitions of a homogeneous carrier (mass, volume, bytes). Requires an extensive attribute.
PhaseOfanti‑symmetric; covers a timeline; acyclicTime‑slices of the same carrier identity. Use only with explicit carrier and non‑overlapping intervals.

Carrier identity for PhaseOf. The same carrier identity across phases must be explicit (e.g., this frame across heat/dwell/quench; this theory across revisions). If identity changes, you are modelling a Transformer creating a new holon (A.12) — not a phase.

Selection guide (didactic, normative in spirit)

Use this one‑page decision to pick the edge correctly:

  1. Is it a part–whole relation at all? If it is mapping, influence, or reference → not parthood. Use U.Interaction or value‑level links (A.15).

  2. Is it physical vs. conceptual composition? Physical assembly → ComponentOf. Conceptual/content inclusion → ConstituentOf.

  3. Is it a collection? If the “whole” is a collection/collective → MemberOf (outside E, route to Γ_collective (B.1.7)). Note: a team’s members are MemberOf (outside E); the team’s tools are likely ComponentOf.

  4. Is it order‑sensitive execution? If step order changes semantics -> apply A.15 (ordered relations) and aggregate with Γ_ctx / Γ_method. Do not encode order as parthood in this section.

  5. Is it a quantitative fraction of a homogeneous stock? If yes → PortionOf (requires an extensive attribute; use in Γ_sys / Γ_work).

  6. Is it the same carrier across time? If yes → PhaseOf (then aggregate with Γ_time / Γ_work).

Common anti‑patterns and the fix • Using MemberOf for material stocks → replace with PortionOf. • Drawing cross‑boundary “parts” → replace edge with U.Interaction plus ComponentOf inside each holon. • Using ConstituentOf for a module cage or bracket → that is ComponentOf. • Treating representation (file ↔ thing) as parthood → keep as value‑level mapping (A.15), not in D.

Γ_m (Compose‑CAL) — structural aggregators & trace shape

Purpose. Provide a minimal constructional generator for structural mereology that keeps the kernel small (C-5), aligns with A.14 (Portions/Phases/Components discipline), and feeds Working-Model layer publication in LOG without importing tooling or notations.

Operators (aggregators).

Γ_m.sum(parts : Set[U.Entity]) → W : U.Holon // for each p ∈ parts assert internal U.KernelPartOf(p, W)

Γ_m.set(elems : Multiset[U.Entity]) → C : U.Holon // for each e ∈ elems assert internal U.KernelPartOf(e, C) // outward MemberOf remains a non‑mereological signal per A.14 (does not build holarchies)

Γ_m.slice(ent : U.Entity, facet : U.Facet) → S : U.Holon // assert internal U.KernelPartOf(S, ent) and record facet label

Trace (conceptual, notation‑independent). Trace = ⟨ op ∈ {sum, set, slice}, inputs, output, notes ⟩ Notes capture boundary tags (A.14), scope (design|run), and any independence declarations used by the Quintet proofs (below).

Invariant footprint on Γ_m traces (inherits B.1 Quintet).

  • IDEM — singleton fold returns the part unchanged.
  • COMM/LOC — results are invariant under re‑order and local factorisation given an independence declaration (IND‑LOC).
  • WLNK — aggregate cannot exceed the weakest limiting attribute among parts; synergy escalates via B.2 Meta‑Holon Transition.
  • MONO — improving a part on a monotone characteristic cannot worsen the whole, ceteris paribus.

Exclusions and routing (A.15/A.14). No parallel or temporalSlice constructor is introduced here; sequence/parallelism live in Γ_ctx/Γ_method, and temporal parts in Γ_time. This preserves the firewall between structure, order and time mandated by A.15/A.14.

Internal proof relation. U.KernelPartOf names the constructional edges inside traces; it is not part of the public V_rel and appears only in the trace/proof narrative (definitional didactic status).

Scope and boundary rules (make graphs foldable)

  1. Single temporal scope: all nodes in D share design or run. No mixing (“chimera” graphs are invalid).
  2. Declared boundary: every holon in D has a U.Boundary; any cross‑holon influence must be an explicit U.Interaction, not parthood.
  3. Acyclicity: if a cycle is detected, either (a) refactor (e.g., split a collective from an assembly), or (b) escalate to Meta‑Holon Transition (B.2) if a new “whole” with novel properties is intended.
  4. Order & time routing: do not encode sequence or history with structural edges; route to Γ_ctx, Γ_method, and Γ_time explicitly.
  5. Resource routing: do not encode costs with structural edges; route to Γ_work (B.1.6) across declared boundaries.

What “Proofs” mean here (preview of Part 2)

Each Γ flavour (Γ_sys, Γ_epist, Γ_method, Γ_time, and Γ_work) must attach a small, reusable Proof Kit showing the Quintet on the given D:

  • IDEM: singleton fold = identity.
  • COMM/LOC: independence conditions + invariance under local reorder/factorisation.
  • WLNK: weakest‑link bound (e.g., critical input caps, weakest claim).
  • MONO: explicit monotone characteristics (what “cannot get worse” means here).

Didactic mini‑examples

  • System (assembly): a motor ComponentOf a chassis; wiring harness ComponentOf the motor; a crew MemberOf a team holon (the crew is not a component of the chassis).
  • Episteme (paper): a lemma ConstituentOf a proof; appendices ConstituentOf the paper; three datasets MemberOf a curated collection; version v2 PhaseOf the same model.

The Proof Kit (ready‑made templates for Γ on D)

This section provides small, reusable proof obligations you attach to a DependencyGraph D when invoking any Γ‑flavour. Each obligation is minimal—just enough to guarantee the Invariant Quintet for the stated scope and edge set.

Independence declaration (for COMM/LOC)

Obligation IND‑LOC. Provide a partition of D into subgraphs {Dᵢ} such that:

  1. Their node sets are disjoint (no shared holon instances).
  2. Their boundaries are disjoint (no shared ports) or any shared internal stock is lifted to the parent boundary in notes.
  3. No edge in E crosses partitions except via explicit U.Interaction (not parthood).

Claim: Under IND‑LOC, Γ’s fold result is invariant to local fold order within and across {Dᵢ}.

Obligation WLNK‑CUT. Enumerate a critical set C ⊆ V ∪ E (nodes/edges) such that failure (or insufficiency) of any element of C makes the aggregation invalid or unsafe in the chosen Γ‑flavour.

Claim: For the target property, the result for the whole is bounded by the minimum (or tightest cap) across C. Examples: • Γ_sys → tensile strength cutset along a load path; • Γ_epist → weakest supported premise in a proof spine; • Γ_work → availability caps for required inputs across the boundary.

Monotone coordinates (MONO)

Obligation MONO‑AX. Declare the monotone characteristics (attributes whose improvement cannot worsen the whole) for this call. Specify how “improvement” is recognized.

Claim: If only monotone characteristics change in the direction of improvement while all else is fixed, the aggregate’s target value cannot degrade.

Examples: • Γ_sys → increased component reliability, tighter tolerance; • Γ_epist → higher evidence-support class, higher formality; • Γ_method → reduced step duration, higher step-assurance class; • Γ_time → added non‑overlapping coverage; • Γ_work → higher yield η, reduced dissipation.

Idempotence witness (IDEM)

Obligation IDEM‑WIT. Provide the singleton case: a subgraph D₁ with one node and no admissible composition edges.

Claim: Γ(D₁) returns that node’s property unchanged.

Scope & boundary attestations

Obligation SCOPE‑1. Affirm DesignRunTag(D) ∈ {design, run} and that all nodes share it. Obligation BOUND‑1. List the U.Boundary for each top‑level holon in V and record any U.Interaction edges that are relevant but not part of E (to show cross‑boundary influences were not mis‑typed as parthood).

Flavour‑specific summary table

Γ‑flavourIndependence (IND‑LOC)WLNK‑CUT (what is “critical”)MONO‑AX (what cannot make worse)IDEM‑WITNotes
Γ_sysDisjoint subassemblies with disjoint interfaces (BIC respected)Structural cutset on load/flow paths↑ component reliability/capacity; tighter boundsSingle moduleUse BIC to keep interfaces explicit.
Γ_epistIndependent argument subgraphs; no premise reuse across partitionsWeakest premise/claim on entailment spine↑ formality; ↑ reliability of sources; ↑ congruenceSingle section/lemmaApply Φ(CL_min) penalty only where mappings/links are weak.
Γ_ctx and Γ_methodParallel branches truly independent (no hidden state)Slowest/least reliable step on the critical path↓ duration; ↑ step assurance; ↑ join soundnessSingle stepCOMM relaxed to partial orders (NC‑1..3).
Γ_timeNon‑overlapping time slices; same carrier identityMissing slice creates a gap (temporal WLNK)↑ coverage; ↑ timestamp precisionSingle slicePhases must cover the window without overlap.
Γ_workDisjoint boundary partitions; shared stocks lifted to parentAvailability caps for required inputs across boundary↑ yield; ↓ dissipation; ↑ availabilitySingle resource with no deltaKeep Boundary Ledger with basis and time window.

Attach the row(s) you use as the Proof Kit to the Γ call record.

Archetypal grounding (worked micro‑examples)

Each row is self‑contained and can be used as a template.

U.System (assembly & production)

AspectExample
GraphMotor ComponentOf Chassis; Harness ComponentOf Motor; (for method demo only, outside D) QC SerialStepOf Seal; all nodes scope=run; BIC declares ports for power, data.
IndependenceTwo subassemblies: {Chassis, Motor, Harness} and {Cabin} with disjoint interfaces.
WLNK‑CUTTensile path through front mount + harness connector; weakest tensile rating caps assembly load rating.
MONO‑AXImproving mount alloy or connector strain relief cannot reduce system load rating.
IDEM‑WITStandalone chassis as singleton: Γ_sys returns chassis unchanged.
RoutingSerialStepOf belongs to Γ_method; Γ_sys ignores order and composes structure; Γ_work separately composes energy/material costs through boundary ports.

U.Episteme (paper & dataset)

AspectExample
GraphLemma1 ConstituentOf ProofA; DatasetX MemberOf CorpusQ; ProofA ConstituentOf PaperP; scope=design.
IndependenceTwo argument branches that do not reuse premises: {Lemma1 → ProofA} and {Background → Discussion}.
WLNK‑CUTThe least supported premise in the entailment path to the main theorem.
MONO‑AXReplacing a weak premise with a stronger one or raising CL of a mapping cannot reduce overall credibility.
IDEM‑WITSingle lemma as singleton: Γ_epist returns it unchanged.
RoutingMemberOf for CorpusQ is collection structure; not used to average “truth”. Γ_epist aggregates via min/penalty and produces a SCR for sources.

Conformance Checklist (normative checklist)

IDRequirementPurpose
CC‑B1.1.1D SHALL be acyclic (DAG).Ensure foldability.
CC‑B1.1.2All nodes in D SHALL share a single DesignRunTag ∈ {design, run}.Ban DesignRunTag chimeras.
CC‑B1.1.3All edges in E SHALL belong to the normative V_rel (ComponentOf, ConstituentOf, PortionOf, PhaseOf only).Keep mereology crisp and finite.
CC‑B1.1.4Cross‑holon influences SHALL be modelled as U.Interaction, NOT parthood.Preserve locality (LOC).
CC‑B1.1.5Every top‑level holon SHALL declare a U.Boundary; if Γ_work will be used, a Boundary Ledger SHALL be produced.Make results comparable/auditable.
CC‑B1.1.6If COMM/LOC is claimed, an IND‑LOC independence declaration SHALL be attached.Make locality explicit.
CC‑B1.1.7A WLNK‑CUT set SHALL be stated for the chosen Γ‑flavour.Make caps explicit; avoid optimism.
CC‑B1.1.8MONO‑AX SHALL enumerate the monotone characteristics used by the Γ‑flavour.Avoid hidden regress.
CC‑B1.1.9A IDEM‑WIT singleton case SHALL be shown or referenced.Ground identity.
CC‑B1.1.10Order/time/resource SHALL NOT be encoded via structural edges; they must be routed to Γ_ctx/Γ_method, Γ_time, Γ_work respectively.Maintain A.15 Strict Distinction.
CC‑B1.1.11If a cycle or a locality violation persists, the modeller SHALL either refactor or declare a Meta‑Holon Transition (B.2).Make emergence explicit.
CC‑B1.1.12Any mapping edges (RepresentationOf, Implements, etc.) SHALL be kept outside E (value‑level), or recast as U.Interaction if cross‑boundary.Eliminate category errors.

Anti‑pattern diagnostics (before → after)

Anti‑patternSymptomReplace with
Collection as stockCell_i MemberOf Battery then summing “capacity” via MemberOfUse PortionOf for capacity partitions; use ComponentOf for physical pack assembly; keep MemberOf only for the set of cells as a collection holon.
External supplier as partPowerGrid ComponentOf PlantModel PowerGrid as an external holon with U.Interaction at the plant boundary; keep plant internals as ComponentOf.
Order encoded as structureStep2 ComponentOf Step1Use SerialStepOf/ParallelFactorOf and Γ_method.
History encoded as structurev2 ComponentOf v1Use PhaseOf for time slices of the same carrier, or a Transformer creating a new holon (A.12) if identity changes.
Mapping as parthoodDigitalTwin ConstituentOf TurbineKeep the twin as a separate holon; link by U.Interaction and value‑level mapping; do not use parthood.
DesignRunTag chimeraMix of CAD nodes and telemetry nodesSplit into two graphs (design vs run) and connect via a Transformer role if needed.

Consequences

Benefits

  • Predictable composition: Γ‑folds are reproducible and auditable across domains.
  • Cross‑scale clarity: Resource and time additivity are preserved by routing to Γ_work and Γ_time.
  • Safer modelling: WLNK cutsets surface true constraints; emergence is not “smuggled in”.
  • Didactic simplicity: A small, fixed edge vocabulary makes reviews and onboarding faster.

Trade‑offs / mitigations

  • Up‑front discipline: Declaring boundaries and independence requires effort. Mitigation: reuse the Proof Kit templates; keep small, local graphs and compose.
  • Refactoring legacy edges: Replacing “generic part‑of” with precise relations can be noisy. Mitigation: use the decision guide (4.4) and anti‑pattern table (9) as a script.

Rationale (informative)

This pattern operationalizes A.14 (Mereology Extension) and A.15 (Strict Distinction) for the universal algebra of B.1. +… By limiting E to four well‑formed mereological relations, we prevent the three recurrent category errors: mapping≠parthood, order/time≠structure, collection≠stock. The Proof Kit converts the Quintet from abstract slogans into concrete obligations that engineers can check in everyday models. Γ‑flavours then remain simple and domain‑appropriate, while proofs remain small and reusable.

Relations

  • Builds on: A.1 Holonic Foundation; A.14 Mereology Extension; A.15 Strict Distinction; A.12 Transformer Principle.
  • Constrained by: B.1 Universal Γ and the Invariant Quintet.
  • Used by: B.1.2 Γ_sys, B.1.3 Γ_epist, B.1.4 Γ_ctx/Γ_time, B.1.5 Γ_method, B.1.6 Γ_work.
  • Triggers: B.2 Meta‑Holon Transition (MHT): Recognizing Emergence and Re‑identifying Wholes when cycles or WLNK violations indicate a new emergent whole.
  • Feeds: B.3 Trust & Assurance Calculus (F–G–R with Congruence) via explicit declaration of monotone characteristics and provenance.

One‑page takeaway. Keep D a DAG, pick edges from four mereological relations, route order/time/cost to their Γ‑flavours, and attach the four Proof Kit obligations (IND‑LOC, WLNK‑CUT, MONO‑AX, IDEM‑WIT) with scope/boundary notes. Do this, and the Quintet holds with minimal fuss.

B.1.1:End

System‑specific Aggregation Γ_sys

► decided‑by: A.14 Advanced Mereology A.14 compliance — Treat PortionOf as Σ‑additive stocks; ComponentOf must respect boundary integration (BIC); PhaseOf is not aggregated here (handled by Γ_time); mapping/representations are not parthood.

Purpose

Γ\_sys is the default flavour of the universal aggregation operator for everything that engineers can touch, weigh or wire‑up: bridges, battery packs, data‑centre racks, container clusters. It translates the abstract Invariant Quintet into three physically meaningful fold rulesadditive, limiting, boolean—and a Boundary‑Inheritance Standard (BIC) that keeps external interfaces tidy. Together they guarantee that holons built with Γ\_sys obey conservation laws, expose a clean API surface and pass safety audits without manual patching.

Context

Kernel § 6 defines U.System and states that only a Calculus may own an aggregation operator. Sys‑CAL (Part C.1) exports Γ\_sys as its single builder; other CALs (KD‑CAL, Method‑CAL …) reuse the same quintet but swap in domain rules. Draft 20 Jul 25 already lists default fold policies (Σ, min, ∨/∧) and a cut‑stable axiom; this pattern turns those snippets into a teachable Standard for day‑to‑day system design.

Problem (seen on real projects)

Field failureAlgebraic root cause
“Phantom megawatts” — energy sums higher than fuel inputTemperatures averaged, masses summed; operator ignored conservation.
Interface Medusa — hundreds of dangling ports after integrationNo rule for boundary promotion vs encapsulation.
Safety inversion — upgraded actuator lowered SIL rating of the skidIntensive property (safety) aggregated by average, not min.
Audit hairball — inspector cannot trace which crane load went whereBoundary cuts not stable; provenance leaks.

All four break Pillars Cross‑Scale Consistency and State Explicitness.

Forces

ForcePullPush
Physical plausibilitySum masses, conserve energyAbstraction — keep rules domain‑agnostic
Interface clarityPresent one clean APIFidelity — expose every critical port
Safety conservatismTake worst‑case ratingPerformance — allow redundancy gains (via MHT later)
Parallel buildShard assembly, cache resultsBoundary realism — stress must still balance across cuts

Solution (conceptual core)

Operator signature
Γ\_sys : (D : DependencyGraph\[U.System\], T : U.TransformerRole (plays `AssemblerRole`)) → E\_eff : U.System
  • D – finite acyclic graph whose nodes share one temporal scope and obey the four DG rules (Pattern B .1.1).
  • T – physically real external system playing TransformerRole (e.g., crane, welding rig).
Three attribute classes
ClassFold ruleTypical examplesInvariants touched
ExtensiveΣ (sum)Mass, energy, costIDEM - COMM - LOC - MONO
Intensive / Riskmin (weakest‑link)Temperature limit, SIL, encryption bitsWLNK - MONO
Boolean / Capability∨ / ∧ (OR for vuln, AND for must‑hold)CVE exposure, “Has EmergencyStop”WLNK

Rule of thumb for managers: If it adds up in your spreadsheet → Σ; if it caps the system → min; if it is yes/no → logic gate. Defaults match kernel table “Additive flow / Capacity / Boolean capability” .

Boundary‑Inheritance Standard (BIC)

For every external interaction of every part, Γ\_sys forces a deliberate choice:

  1. Promote — port becomes part of the new system boundary.
  2. Forward — port remains on the child but is namespaced by the parent.
  3. Encapsulate — port becomes internal and disappears from public view.

BIC is the antidote to Interface Medusa: it prevents silent loss of obligations or explosion of unmanaged endpoints.

Cut‑Stable Boundary Axiom (reminder)

Given any declared boundary 𝔅, Γ\_sys(D,C) MUST leave every across‑𝔅 interaction either identical or transformed by a rule that still satisfies the Quintet.

Step‑by‑Step Aggregation Recipe

Audience: lead engineer planning a multi‑team build; QA manager preparing an audit; analyst running a quick what‑if. Goal: fold a ready Dependency Graph into one coherent system in five repeatable moves.

StepWhat you doWhy it matters
1 - Verify the graphRun Pattern B .1.1 checklist (acyclic, typed edges, same scope, boundary tags).Avoid paradoxes before they snowball.
2 - Label attributesFor every property in every node, mark it Extensive, Intensive, or Boolean. Defaults are in Sys‑CAL cheat‑sheet.The fold rule depends on this label.
3 - Decide the BICFor each external port, pick Promote / Forward / Encapsulate. Record choice in the interface table.Keeps APIs intentional and auditable.
4 - Execute Γ_sysExtensive → parallel Σ; Intensive → propagate min; Boolean → ∧/∨ logic.Implements the Invariant Quintet.
5 - Run Cut‑Stable testFor each declared boundary 𝔅, compare across‑𝔅 interactions before & after fold.Confirms that sharding or outsourced work didn’t shift loads or responsibilities.

If the min rule is exceeded by design (e.g., triple redundancy boosts SIL beyond any part), stop here and initiate Meta‑Holon Transition (Pattern B .2) to formalise emergence.

Worked Example — Battery‑Electric Bus Pack (2025 model year)

StepSnapshot
Graph16 modules → 4 strings → pack. Edges ComponentOf. All nodes scope=design.
Attribute labelExtensive: energy (kWh), cost; Intensive: cell voltage limit, fire rating (SIL 2); Boolean: “Has self‑heating”.
BIC decisionsMain DC output ‑ Promote; per‑string fuse access ‑ Forward; cell balancing ports ‑ Encapsulate.
FoldΣ energy = 628 kWh; min voltage limit = 4.25 V; ∧ self‑heating = true.
Cut‑StableAcross‑string current same pre/post fold. Pass.
OutcomePack spec delivered to vehicle OEM; audit shows WLNK bound 4.25 V, MONO intact; financial model reads energy Σ for range calc.

Conformance Checklist (author‑facing)

IDQuestionPass if…
CHK‑GC‑1All properties classified?No “unknown” label remains.
CHK‑GC‑2Any property violate its fold rule?None; else declare MHT.
CHK‑GC‑3BIC table complete?Every external port accounted for.
CHK‑GC‑4Cut‑Stable test green on all declared boundaries?Yes.
CHK‑GC‑5Provenance hash stamped?E_eff.meta.provenance populated.

Failing a line means the operator must refactor the graph or escalate to Meta‑Holon before reuse.

Consequences

Benefit for project leadershipSecondary effect
Plausible mass‑energy books — no “phantom capacity” during tender negotiations.Vendor bids align faster; fewer change orders.
Single-page interface sheet - the BIC doubles as hand-over Standard to the next supply-chain supplier.Interface churn caught early; legal exposure shrinks.
Safety‑first roll‑up — weakest‑link bound surfaces brittle parts immediately.QA budget aimed at right module; no gold‑plating.
Seamless parallel builds — COMM + LOC proven once, reused by every subStandardor.Integration rehearsals shortened by weeks.
  • Model‑Based Systems Engineering (MBSE 2023‑2025): Tools like Cameo Systems Modeler automated Σ/min logic via “Property Kind” stereotypes—Γ_sys formalises the same trick.
  • Safety audits: ISO 26262‑2 Ed 3 explicitly adopts “minimum of ASIL ratings” rule; our min fold embeds it by design.
  • Interface control: Aerospace ICDs (NASA‑7120.5E updates 2024) require a promotion/forward/encapsulate decision tree identical to BIC.
  • Cloud operations: Kubernetes 1.30 resource quotas implement additive CPU/memory and min PodDisruptionBudget—industrial proof that the schema scales.

Real‑world convergence across steel, silicon and software shows the rules are not theory nice‑to‑haves; they are what successful projects already do—Γ_sys just makes it explicit, automatic and auditable.

Relations

  • Builds on: Dependency Graph (B .1.1); Transformer Principle (A.3).
  • Enables: Meta‑Holon Transition (B .2); Calculus of Trust (B .3).
  • Refined by: Γepist (B .1.3) for knowledge epistemes or publications; Γtime / Γctx (B .1.4) for temporal or context‑sensitive domains.
  • Exemplifies: Pillars P‑8 Cross‑Scale Consistency, P‑9 State Explicitness.

Take‑away for engineering managers: “Classify, Standard, fold—then sleep easy knowing the numbers and the interfaces will still match tomorrow.”

B.1.2:End

Γ_epist - Knowledge‑Specific Aggregation

► decided‑by: A.14 Advanced Mereology A.14 compliance — Use ConstituentOf for semantic parts; PortionOf only for quantitative splits of texts/data with declared μ (token/byte, etc.); PhaseOf for versions/revisions of MethodDescription/documents; no ComponentOf here.

Plain‑English headline. Γ_epist composes epistemic holons (claims, models, datasets, arguments) into a single episteme while preserving provenance, applying conservative trust bounds (B.3 F/G/R), and penalizing poor conceptual fit via congruence levels (CL). It is not a physical sum; it is a semantic and evidential fold.

Problem frame

  • Holonic foundation. In the FPF, a U.Episteme is a holon whose identity is knowledge‑bearing (A.1). It can be a statement/claim, a model, a theory, a specification, a dataset with semantics, or a compiled scholarly artifact.
  • Strict Distinction (A.15). We separate: structure (what the episteme comprises), order (argument flow), time (versioning/phases), work (what was spent to produce/validate it), and values (objectives/criteria). Γ_epist stays in the structure/semantics lane and calls out to Γ_ctx/Γ_time/Γ_work when needed.
  • Mereology (A.14). For knowledge composition we primarily use ConstituentOf (logical/semantic parts), UsageOf/ReferenceTo (external reliance), and MemberOf for collections (anthologies, corpora). We do not use ComponentOf (physical) in Γ_epist. PhaseOf handles temporal versions of the same episteme; RoleBearerOf is irrelevant here because knowledge does not play a role—it is used by a holon‑in‑role (Transformer) at run‑time (A.12).
  • Assurance (B.3). Knowledge carries F, G, R (Formality, ClaimScope, Reliability). Integration edges carry CL (congruence level) that penalizes poor fit. Γ_epist must preserve provenance and apply conservative bounds: no “truth averaging,” no silent context hops. Obligations here are mode/assurance‑gated per C.2.1. # [M‑0]
  • Order/time flavours. Argument sequences may need Γ_ctx (non‑commutative ordering of premises to conclusion). Knowledge evolution uses Γ_time (versioning, deprecation, update). When composition produces new closure or supervision (e.g., explanatory theory emerges), we declare MHT (B.2).

Problem

Naive aggregation of knowledge holons causes recurring failures:

  1. Trust inflation by averaging. Averaging confidences of conflicting claims creates a falsely “reliable” whole; violates WLNK and B.3 conservatism.
  2. Provenance erasure. Merges that drop sources, methods, or links break A.10 Evidence Graph Referring and make results unauditable.
  3. Semantic drift. Folding across mismatched concepts without explicit mappings (and their CL) yields incoherent composites that look formal but mean nothing.
  4. Order blindness. Arguments with essential dependency order (premise ⇒ lemma ⇒ conclusion) are treated as sets; non‑commutativity is lost and results become non‑reproducible.
  5. Context chimeras. Combining items across bounded contexts (different vocabularies/units/policies) without a Context Reframe (B.2) silently corrupts claims and inflates R.
  6. Category errors. Importing Γ_sys rules (e.g., “sum truth,” “avg formality”) into knowledge composition produces physically sounding but epistemically nonsensical models.

Forces

ForceTension
Conservatism vs. SynthesisKeep reliability bounded by the weakest supported link ↔ allow genuine explanatory integration when it actually emerges.
Universality vs. Domain nuanceOne operator across math, science, engineering specs ↔ domain‑specific semantics and evidence patterns differ.
Provenance fidelity vs. Cognitive loadKeep the full trail of sources and methods ↔ avoid overwhelming authors with bookkeeping.
Order/time discipline vs. FlowRespect argument order and version time ↔ keep composition usable for day‑to‑day synthesis.
Parsimony vs. FitSmall rule set (A.11) ↔ explicit congruence penalties and context rebasing when needed.

Solution — Terms, operator family, invariant Standard, core rules

Terms (didactic recap)

  • U.Episteme — a knowledge holon. Internally read it as an EpistemeSlotGraph: EntityOfConcernSlot for what it is about, ClaimGraphSlot or theory/model structure for what it claims, GroundingHolonSlot where grounding is live, and SCR/RSCR carrier references for text, code, figures, or datasets.
  • Evidence/Provenance Graph — edges like evidences, derivesFrom, usesMethod, isMeasuredBy with anchors (A.10).
  • Mapping edge — a typed relation between conceptual vocabularies (e.g., ontology alignment, unit conversion) with a CL score (0…3/4 per A.15/B.3 convention).
  • SCR — a U.SCR that lists all symbol carriers included in the aggregate; never dropped.
  • Bounded context — a modelling Standard (vocabulary/units/policy). Crossing it requires Context Reframe (B.2) or explicit mappings with CL.

Didactic reminders. • Knowledge does not “act.” Transformers (A.12) use knowledge. • MemberOf creates collections; it is not a semantic argument link. Use ConstituentOf for logical/evidential composition. • PhaseOf is for versions of the same episteme; if identity, boundary, or context re‑anchor, declare MHT.

The operator family (companion flavours)

To keep design vs run clean (A.15), Γ_epist has two companion flavours that share the same algebra but serve different moments:

  1. Synthesis (design‑time) — fold epistemes into a draft aggregate
Γ_epist^synth : ( D_know : DependencyGraph< U.Episteme >,
                  T      : U.TransformerRole ) → U.Episteme
  • Domain. D_know uses ConstituentOf, UsageOf/ReferenceTo, evidences/derivesFrom, optional MemberOf for collections.
  • Result. A composite episteme whose Object/Concept/Symbol components are assembled; provenance and SCR are preserved; F/G/R/CL are provisionally computed for later assurance. Gating: at M‑mode only tuple placeholders are required; numeric scoring may be omitted ([M‑0/M‑1]). At F‑mode the tuple MUST be computable in‑Context ([F‑*,L1+]). # [M/F]
  1. Compile (run‑time) — produce the released artifact in a bounded context
Γ_epist^compile : ( E_synth : U.Episteme,
                    Ctx     : BoundedContext,
                    T       : U.TransformerRole ) → U.Episteme
  • Domain. A synthesized episteme and a target context (journal, standard, program spec).
  • Result. A context‑anchored episteme (e.g., published paper/spec) whose mappings to the context vocabulary are explicit and carry CL; assurance will reference this context baseline (B.3).

Relationship to Γ_ctx / Γ_time. If the knowledge fold explicitly depends on argument order (e.g., derivation), the internal fold uses Γ_ctx for the sequence. If a temporal storyline (updates, retractions) is important, use Γ_time to slice versions; Γ_epist then composes the current slice. If composition yields new explanatory closure beyond WLNK/CL, declare MHT (B.2).

Invariant Standard (how the Quintet applies; math by level)

  • IDEM (Idempotence). Folding a single episteme returns itself; no accidental “upgrade.”
  • COMM/LOC (Local commutativity / locality). For independent subgraphs (no logical/evidential dependency), fold order/location is irrelevant; when dependencies exist, Γ_ctx controls order explicitly.
  • WLNK (Weakest‑link bound). Aggregate Reliability (R) is bounded by the weakest supported link along any justification path, after considering the lowest CL on mappings used by that path.
  • MONO (Monotonicity). Strengthening a part (raising R with valid evidence or raising CL on a needed mapping) cannot lower aggregate R. Adding contradictory evidence is not an improvement; it triggers conflict handling (below), not MONO.
  1. Reliability fold. Along any support spine, R_raw = min_i R_i; apply congruence penalty Φ(CL_min) → R_eff = max(0, R_raw − Φ(CL_min)). No averaging; weakest‑link. Math by level:[M‑0/M‑1] allow ordinal comparisons only (no arithmetic on R); Φ may be stated qualitatively (“low/med/high”). – [M‑2/L1] require numeric Φ table (default in §4.4) and reproducibility tag on empirical edges. – [F‑*,L1/L2] require formal derivability of the fold rules from LOG‑CAL; constructive mode annotates proof.kind=constructive. # [M/F]

Core rules for epistemic aggregation (design‑time synthesis)

When computing Γ_epist^synth(D_know, T):

  1. Provenance preservation. The provenance/evidence graph is unioned with de‑duplication; every claim in the aggregate remains traceable to its sources and methods. No source, method, or dataset that supports a retained claim may be dropped.

  2. SCR construction. Build a U.SCR that lists all symbol carriers (texts, code, figures, datasets) that materially participate in the aggregate. Provenance nodes must be mappable to SCR entries.

  3. Object alignment. Determine a common Object via domain taxonomy (e.g., least common ancestor) or create a U.CompositeEntity with explicit mappings. Record CL for each mapping; do not silently merge homonyms.

  4. Concept integration with CL penalty. Compute provisional F/G/R of the aggregate:

    • F_eff = min(F_i) (formality is as strong as the least formal constituent actually used).
    • G_eff = function of coverage; typically monotone in included scope, capped by weakest definitional fit.
    • R_eff = min over justification paths of { R_i along the path } penalized by the lowest CL used by that path: R_eff := max(0, min_path( min_claimR(path) − Φ(CL_min(path)) )), where Φ is the normative penalty function defined below. If a mapping with CL < threshold is essential to a path, mark the claim provisional.
  5. Normative Penalty Function Φ (v1.0) The penalty function Φ quantifies the loss of reliability due to poor conceptual alignment between parts.

Congruence Level CL_min0123
Penalty Φ(CL_min)1.51.00.50.0

A domain profile MAY provide an alternative table but MUST preserve monotonic decrease (a lower CL cannot have a smaller penalty). The default values are derived from empirical fits in KD-CAL Bench 0.3.

  1. Conflict detection (no averaging). Detect contradictions (e.g., p and ¬p with overlapping scope). Do not average. Either (i) separate by context or scope (bounded contexts; Γ_time slices), (ii) mark provisional with explicit conflict edges, or (iii) if resolution yields new closure, consider MHT.

  2. Handling of Axiomatic vs. Postulative Epistemes In alignment with ADR-028, the computation of R_eff depends on the episteme's declared mode.

  • For an input episteme E_i with mode: axiomatic, empirical R is N/A; take R_i_eff = F_i. Tag: line=formal. # [F‑*]
  • For mode: postulative, use declared R_i with decay; Tag: line=empirical. # [M‑1/M‑2/F]
  • The aggregate E_eff MUST also declare a mode. If all inputs are axiomatic, the output is axiomatic. If any input is postulative, the output MUST be postulative.
  • Constructive note. Under F‑constructive, equivalence claims use isomorphism/equivalence in the chosen UF library; CL=2 means proof‑reconstructed alignment, not mere model‑theoretic appeal. # [F‑constructive]
  1. Order‑aware arguments (optional). If the argument requires premise ordering, embed a Γ_ctx fold inside Γ_epist; record the OrderSpec for reproducibility (NC‑1..3). Gating: OrderSpec is recommended at M‑1 and required at M‑2/F. # [M‑1→F]

  2. No costs here. Any compute/collection effort is Γ_work; attach references but do not mix costs into epistemic aggregation.

Core rules for compilation (run‑time context anchoring)

When computing Γ_epist^compile(E_synth, Ctx, T):

  1. Context bindings. # [M‑1+] Map all operative concepts/units/claims into Ctx; record mappings and their CL. If the rebase changes boundary/objective of the episteme (e.g., from descriptive compendium to explanatory theory with commitments), declare Context Reframe (MHT) per B.2.

  2. Assurance baseline (gated). Recalculate the assurance tuple (B.3) in Ctx: F and R may change with formalization and mapping penalties; G is re‑expressed in Ctx’s scope. Gating:

  • [M‑0] narrative justification only;
  • [M‑1] qualitative tuples allowed;
  • [M‑2/L1] numeric tuple required;
  • [F‑*/L2] tuple and proof obligations on weight/penalty model selection. # [M/F]
  1. Release SCR. Produce RSCR with carrier hashes; at L2 require independent re‑hash verification. # [M‑1/L2]

  2. Order/time hooks. If the compiled artifact includes an internal derivation, carry the OrderSpec; if it codifies a specific time slice of evolving knowledge, link back to the Γ_time slice used.

Archetypal grounding (worked, didactic)

Episteme — Meta‑analysis into a guidance statement

  • Inputs (U.Episteme): E₁ randomized trial (R=0.84, F=3, G=medium), E₂ observational study (R=0.55, F=2, G=wide), E₃ mechanistic model (R=0.60, F=3, G=narrow). Mappings: dosage units (mg ↔ IU), outcome definitions (pain scale variants), each with declared CL (e.g., unit mapping CL=3, outcome alignment CL=2).

  • Γ_epist^synth:

    • Provenance preservation: all study protocols, datasets, analysis scripts listed in the SCR.
    • Object alignment: “acute low‑back pain within 6 weeks” via taxonomy LCA; non‑aligned chronic cohorts excluded or mapped with low CL and flagged.
    • Concept integration: compute provisional R_eff along each justification path, penalized by **Φ(CL_min(path)); aggregate R_eff` = min over paths.
    • Conflict handling: E₂ contradicts E₁ in a subgroup; kept as provisional with explicit conflict edge and scope note (different baseline severity).
  • Γ_epist^compile (journal context): Map outcomes to journal’s required measure, recalc F/G/R with mapping penalties; produce release SCR (hashes, versions) and context baseline. Result: “Guidance Statement v1.0” with conservative R.

  • Why not averaging? Averaging would inflate R and hide low‑CL outcome mappings; Γ_epist enforces pathwise min + CL penalty.

Episteme — Safety case from heterogeneous evidence

  • Inputs: requirement spec (F=3, R=0.7), hazard analysis (F=2, R=0.6), test logs (F=1, R=0.8), formal proof of controller property (F=3, R=0.9).

  • Γ_epist^synth:

    • Provenance union; SCR includes requirements, proof carrier, test datasets.
    • Concept integration: controller proof applies only under assumptions A; test logs violate A in edge case → CL low for mapping “test scenario ≡ proof assumption.”
    • R_eff bounded by the weakest justification path after Φ(CL_min); claim on “system‑level safety” marked provisional until assumption alignment is demonstrated.
  • Γ_epist^compile (certification context): Context re‑base to regulatory vocabulary; if the re‑base changes objective/boundary (e.g., from internal assurance to public certification), consider MHT (Context Reframe) per B.2.

Contrast (didactic)

AspectΓ_epist (Knowledge)Γ_sys (Physical)
What is folded?Claims, models, datasets, argumentsComponents, materials, assemblies
ConservatismPathwise min of R + penalty Φ(CL)WLNK via weakest part (strength, rating)
FitMappings with declared CLInterfaces/BIC compatibility
Order/timeOptional Γ_ctx for argument order; Γ_time for versionsΓ_ctx for workflows; Γ_time for phases
Work/costExternal in Γ_work (compute, curation)External in Γ_work (energy, labour)

Proof obligations (normative)

At synthesis (Γ_epist^synth):

  1. PO‑SYN‑PROV. The provenance/evidence graph MUST be preserved (union with de‑duplication); every retained claim is traceable to sources/methods in the SCR.
  2. PO‑SYN‑OBJ. The Object MUST be identified (single subject via LCA or explicit U.CompositeEntity) with declared mappings and their CL.
  3. PO‑SYN‑CL. All mapping edges that bridge semantics/units MUST carry CL; the chosen penalty Φ MUST be monotone in CL (lower CL ⇒ higher penalty). Thresholds for marking provisional MUST be stated.
  4. PO‑SYN‑R. R_eff MUST be computed as min over justification paths of (claim reliabilities along the path minus Φ(CL_min(path))). No arithmetic mean is allowed for reliability.
  5. PO‑SYN‑CONFLICT. Contradictions MUST be either (i) separated by context/scope, (ii) marked as provisional with explicit conflict edges, or (iii) escalated to MHT if resolution yields new explanatory closure.
  6. PO‑SYN‑ORDER. If order matters, the OrderSpec MUST be recorded and Γ_ctx NC‑1..3 (determinism, context hash, partial‑order soundness) MUST hold.
  7. PO‑SYN‑NOWORK. Resource spending, yields, and dissipation MUST NOT be computed here; instead, attach references to the aligned Γ_work composition.

At compilation (Γ_epist^compile):

  1. PO‑COMP‑CTX. The target bounded context MUST be declared; all active concepts MUST be mapped with CL; context vocabulary/units recorded.
  2. PO‑COMP‑ASSUR. The assurance tuple (F/G/R) MUST be recomputed in the target context with the applied CL penalties.
  3. PO‑COMP‑REL. A release‑grade SCR (hashes, versions, dates) MUST be produced.
  4. PO‑COMP‑MHT. If the compilation re‑anchors boundary, objective, or identity (e.g., from compendium to explanatory theory), an MHT (Context Reframe) MUST be declared with a Promotion Record (B.2).
  5. PO‑COMP‑ORDER/TIME. If derivational order or a specific time slice is essential, the OrderSpec and the Γ_time slice MUST be referenced.

Conformance Checklist (normative)

IDRequirementPurpose
CC‑B1.3.1Inputs to Γ_epist MUST be U.Episteme holons; ComponentOf is forbidden; use ConstituentOf / UsageOf / ReferenceTo; MemberOf only for collections.Prevent category errors.
CC‑B1.3.2Provenance and SCR MUST be preserved in the aggregate; dropping sources or methods is non‑conformant.Enforce Evidence Graph Referring.
CC‑B1.3.3Aggregate R MUST follow the pathwise min rule with Φ(CL_min) penalties; no averaging of reliability.Guard conservatism (WLNK).
CC‑B1.3.4Contradictions MUST NOT be smoothed by arithmetic; handle by scope separation, provisional status, or MHT.Keep incoherence visible.
CC‑B1.3.5Every U.Episteme serving as an input to Γ_epist MUST declare its mode (axiomatic or postulative). An aggregate holon's mode MUST be postulative if any of its constituents is postulative.Prevent category errors in reliability calculation.
CC‑B1.3.6Crossing bounded contexts requires either explicit mappings with CL or an MHT (Context Reframe).Make context explicit.
CC‑B1.3.7If order matters, Γ_ctx NC‑1..3 MUST hold; if versions matter, the Γ_time slice MUST be identified.Preserve order/time integrity.
CC‑B1.3.8Design‑time synthesis and run‑time compilation MUST NOT be conflated; use the appropriate flavour.Maintain A.15 separation.

Anti‑patterns & repairs

Anti‑patternSymptomRepair
Truth‑averagingAveraging confidence of conflicting claimsApply pathwise min with CL penalties; separate scopes or mark provisional.
Provenance amnesiaSources/methods disappear in the aggregateRebuild SCR; re‑run Γ_epist with provenance union.
Homonym mergeDifferent concepts with same name silently mergedInsert mapping edges with CL; if CL too low, split by context or mark provisional.
Context hopMixed units/vocabularies without declarationDeclare bounded context and mappings; if purpose changes, use MHT.
Version soupMixed time slices without clarityUse Γ_time to slice; compose current slice only; link others explicitly.
Work stuffingCompute/curation cost blended into reliabilityMove costs to Γ_work; keep R based on evidence, not spend.
Orderless proofDerivation steps treated as a setAdd OrderSpec; compose with Γ_ctx inside Γ_epist.
Synergy by narrative“New theory” claimed without BOSC evidenceIf closure/supervision actually emerges, declare MHT; otherwise lower claims.

Consequences

Benefits

  • Auditability by construction. Every retained claim remains tied to its sources; SCR guarantees reconstructability.
  • Safe synthesis. R cannot be inflated; CL penalties make conceptual misfit explicit.
  • Context‑aware releases. Compiled epistemes or publications are aligned with a declared context; cross‑context reuse is principled.
  • Didactic clarity. Separates semantic folding (Γ_epist) from order (Γ_ctx), time (Γ_time), spend (Γ_work), and emergence (B.2).

Trade‑offs

  • Mapping overhead. Declaring mappings and CL costs time; it prevents silent incoherence.
  • Conservative stance. Results may look pessimistic; this is deliberate (WLNK). Use MHT only for genuine explanatory closure.

Rationale (informative)

  • Epistemic composition is not physical addition. Reliability must be bounded by the weakest justified path, not averaged; conceptual misalignment must reduce confidence, not be ignored.
  • Provenance is part of meaning. Dropping sources/methods changes what the episteme is; Γ_epist treats provenance and SCR as first‑class.
  • Context matters. Bounded contexts structure practice; formal Context Reframe (MHT) prevents quiet re‑interpretations of claims.
  • Parsimony with power. A small set of rules (provenance preservation, CL‑penalized pathwise min, order/time hooks, context discipline) is enough to model scientific and engineering knowledge without importing domain‑specific tool jargon.

Relations

  • Builds on: A.12 (Transformer Role—compilers/editors enact), A.14 (Mereology Extension—ConstituentOf/MemberOf/PhaseOf usage), A.15 (Strict Distinction).
  • Coordinates with: B.1.1 (Proof kit), B.1.4 (Γ_ctx/Γ_time inside knowledge folds), B.1.6 (Γ_work for compute/collection spend).
  • Triggers/Complements: B.2 (MHT) when explanatory closure or context re‑base creates a new whole (theory, standard).
  • Feeds: B.3 (Assurance) — F/G/R and CL baselines computed here become inputs to trust calculations.

One‑sentence takeaway. Γ_epist preserves provenance, penalizes poor conceptual fit, forbids reliability averaging, and makes context explicit—so that knowledge aggregates are conservative, auditable, and genuinely coherent.

B.1.3:End

Contextual & Temporal Aggregation (Γ\ctx & Γ\time)

Status: Stable

► decided‑by: A.14 Advanced Mereology A.14 compliance — Γ_ctx relies on SerialStepOf/ParallelFactorOf (order semantics); Γ_time composes PhaseOf slices of the same carrier with coverage/no‑overlap; PortionOf is orthogonal (quantities within steps), mappings are not parthood.

Plain‑English headline. Use Γ_ctx when the order of steps changes meaning. Use Γ_time when we are aggregating the same carrier across a timeline.

Problem frame

The universal algebra Γ (B.1) assumes local commutativity and locality for most structures. But many real‑world compositions are not order‑indifferent (recipes, proofs that unfold by steps, manufacturing routes), and many composites are nothing but a history (asset history, model revisions, experiment runs). For these cases FPF offers two universal flavours:

  • Γ_ctxprocedural composition (where SerialStepOf / ParallelFactorOf edges are present; see B.1.5 Γ_method for typing and joins; A.14 governs only mereological edges such as PortionOf/PhaseOf). Γ_timetemporal aggregation for phase composition of the same carrier (where PhaseOf edges from A.14 are present).

Both flavours inherit WLNK and MONO from the Quintet (B.1) and remain compatible with A.12 (Transformer Principle) and A.15 (Strict Distinction): they do order and time, not structure, mapping, or cost.

Problem

Forcing sequential or temporal phenomena through the default, order‑indifferent Γ leads to recurring failures:

  1. Semantic erasure: Treating SerialStepOf as if it were structural parthood flattens workflows; swapping steps silently changes meaning.
  2. Causal paradoxes: Aggregating time slices as if they were unordered parts lets effects precede causes, or hides missing epochs.
  3. Locality violations: Hidden shared state between “parallel” branches breaks reproducibility; independent branches were not actually independent.
  4. DesignRunTag conflation: Mixing design‑time plans and run‑time histories in one fold produces “chimeras” that neither simulate nor audit reality.

Forces

ForceTension
Order fidelity vs. SimplicityPreserve step order (non‑COMM) ↔ Keep reasoning lightweight and composable.
Temporal coverage vs. FlexibilityEnsure gap/overlap discipline across phases ↔ Allow rolling windows and partial histories.
Locality vs. ConcurrencyKeep branches deterministic and independent ↔ Exploit parallelism where it is safe.
Universality vs. FitOne pattern for systems and epistemes ↔ Different edge types (SerialStepOf, PhaseOf) and different carriers.

Solution — Part 1: What these flavours are, and when to use them

Two flavours at a glance (edge discipline)

FlavourYou use it when…Edge kinds in DTypical carrier
Γ_ctx (Contextual / order‑sensitive)The sequence of steps changes the outcome or meaning.SerialStepOf, ParallelFactorOf (no structural substitution)U.Method (procedures, work processes), also order‑bound argument chains in U.Episteme
Γ_time (Temporal / phase aggregation)You reconstruct a timeline of the same holon (phases/slices).PhaseOf of a single carrier (non‑overlapping)Any U.Holon with identity across time (systems or epistemes)

Strict Distinction (A.15) reminder. • Structural inclusion → Γ_sys (ComponentOf / ConstituentOf). • Order of actions → Γ_ctx (and its specialisation Γ_method). • History of the same carrier identity → Γ_time (PhaseOf). • Resource spending → Γ_work. • Mappings / representations → value‑level links or U.Interaction, not parthood.

Operator signatures (normative)

Γ_ctx — Contextual / Order‑Sensitive Aggregation

Γ\_ctx : (D_ctx : DependencyGraph, σ : OrderSpec, T : U.TransformerRole) → H′ : U.Holon
  • D_ctx: a DAG whose edges are only SerialStepOf / ParallelFactorOf.
  • σ (OrderSpec): an explicit partial order (or total order) compatible with D_ctx that disambiguates how branches compose and where joins occur.
  • T: the transformer that performs the material act of sequencing/combining steps (A.12).
  • Output H′: typically a U.Method holon, but may be any holon whose identity is defined by stepwise construction.

Γ_time — Temporal / Phase Aggregation

Γ\_time : (D_time : DependencyGraph, τ : TimeWindow, T : U.TransformerRole) → H′ : U.Holon
  • D_time: a DAG whose edges are only PhaseOf, all phases referring to the same carrier identity.
  • τ: the declared time window to be covered by the aggregation.
  • T: the transformer that composes the timeline (A.12).
  • Output H′: the holon reconstructed over τ (system history, theory revision history, dataset growth, etc.).

Adapted invariants (what replaces COMM/LOC)

Both flavours keep IDEM, WLNK, MONO from B.1. They replace COMM/LOC by discipline specific to order and time.

For Γ_ctx (NC‑invariants):

  • NC‑1 — Determinism under σ. Given the same D_ctx and σ, the fold yields the same result.
  • NC‑2 — Context identifier. The result SHALL record an unambiguous identifier of σ (e.g., a canonical text or digest) as part of the aggregation record.
  • NC‑3 — Partial‑Order Soundness. Any topological sort consistent with σ and with declared independence (below) yields the same result; independent branches may fold in parallel.

For Γ_time (T‑invariants):

  • T‑1 — Temporal Idempotence. A single phase/slice folds to itself.
  • T‑2 — Chronological Discipline. Phases must be composed in non‑decreasing time consistent with carrier identity; reversing adjacent slices is forbidden.
  • T‑3 — Coverage. The union of phase intervals equals the declared τ, with no overlaps and no unexplained gaps. Gaps/overlaps require explicit justification (e.g., measurement resolution or MHT).

Why we keep WLNK and MONO. Even with order/time, the whole cannot be safer or more reliable than the bottleneck step/phase (WLNK), and improving a step/phase on declared monotone characteristics cannot make the whole worse (MONO).

Guards that make the folds provable

For Γ_ctx

  1. Edge discipline: only SerialStepOf / ParallelFactorOf.
  2. OrderSpec σ: explicit partial order; joins must have well-typed inputs and outputs (see B.1.5 for join soundness).
  3. Independence declaration: if you claim parallel folds commute locally, declare which branches are independent (no hidden shared state or side‑effects).
  4. Scope: single DesignRunTag (design or run) for all nodes; do not mix plans with histories.
  5. Boundary note: if steps cross holon boundaries, record the relevant U.Interaction—do not recast it as parthood.

For Γ_time

  1. Same carrier: all phases are PhaseOf the same holon identity; identity change implies a Transformer producing a new holon.
  2. Non‑overlap / coverage: phase intervals are disjoint and cover τ; if not, specify how resolution limits or business rules justify the pattern.
  3. Scope: single DesignRunTag; design‑time hypothetical timelines and run‑time actual logs are kept separate.
  4. Boundary note: if Work across boundaries is reported for phases, route resource statements to Γ_work; Γ_time itself does not invent costs.

Selection checklist (didactic quick guide)

  • Does swapping two steps change meaning or safety?Γ_ctx.
  • Is this the same entity evolving over time?Γ_time.
  • Is it a physical assembly or conceptual inclusion?Γ_sys.
  • Is it a “who belongs to this collective” question?MemberOf + (future) Γ_collective.
  • Do you need durations, critical paths, and joins?Γ_method (specialisation of Γ_ctx).
  • Do you need resource spending across a boundary?Γ_work (orthogonal; can be used together with Γ_ctx/Γ_time).

Didactic contrasts (one‑liners)

  • Γ_sys vs Γ_ctx: Γ_sys composes what the whole is; Γ_ctx composes how it is done.
  • Γ_ctx vs Γ_method: Γ_method is Γ_ctx plus step‑specific rules (durations, joins, capability typing).
  • Γ_time vs Γ_ctx: Γ_time composes phases of the same carrier; Γ_ctx composes different steps that realise a procedure.
  • Γ_time vs Γ_work: Γ_time composes history; Γ_work accounts costs across a boundary for each phase.

Proof Kit (ready‑to‑reuse obligations for Γ\ctx / Γ\time)

This Proof Kit instantiates the generic obligations from B.1.1 §6 for the order/time flavours. Attach these items whenever you apply Γ_ctx or Γ_time to a DependencyGraph D.

Γ_ctx obligations

  • CTX‑IND (Independence & Joins). Declare which branches are independent (no hidden shared state, no side-effects that leak across branches). For every join, state a join-soundness condition (compatible input and output types plus preconditions and postconditions). Claim: Under CTX‑IND, parallel folds of independent branches commute locally; any topological sort consistent with σ yields the same result (NC‑3).

  • CTX‑ORD (OrderSpec). Provide the OrderSpec σ as a partial order (or total order) text, including where joins occur. Claim: Given D_ctx and σ, the fold is deterministic (NC‑1) and carries a stable context identifier (NC‑2).

  • CTX‑WLNK (Critical Path). Identify the critical path (or a cutset) whose weakest step caps the property of the whole: throughput, safety, assurance, etc. Claim: The whole is bounded by the weakest element along the critical path (WLNK).

  • CTX‑MONO (Monotone characteristics). List the characteristics that cannot degrade the whole when improved: e.g., ↓ step duration, ↓ error rate, ↑ step reliability, ↑ join soundness. Claim: Improving only monotone characteristics cannot make the aggregated process worse (MONO).

  • CTX‑IDEM (Singleton). Provide the one‑step singleton witness: Γ_ctx of a single SerialStepOf‑free node returns that step unchanged (IDEM).

  • CTX‑SCOPE/BOUND. Affirm a single DesignRunTag (design or run) and list any U.Interaction that crosses a holon boundary (do not recast it as parthood).

Γ_time obligations

  • TIME‑CARR (Carrier Identity). State explicitly the carrier holon whose history is being reconstructed. Claim: All PhaseOf arcs refer to the same carrier; if identity changes, model a Transformer producing a new holon (A.12), not another phase.

  • TIME‑COV (Coverage & Non‑overlap). Provide the target TimeWindow τ and the list of phases with intervals; justify any gaps or overlaps (resolution limits, business rules). Claim: Phases cover τ without overlap; otherwise the fold is not admissible (T‑3).

  • TIME‑ORD (Chronological Discipline). Assert that fold order is non‑decreasing in time; reversing adjacent slices is forbidden. Claim: Temporal idempotence holds on a single slice, and chronological composition preserves consistency (T‑1, T‑2).

  • TIME‑WLNK (Temporal Weakest‑Link). Identify time‑critical constraints: missing essential phases, minimal sampling resolution, minimal integrity of a crucial epoch. Claim: The property of the whole (over τ) is capped by the weakest phase/epoch.

  • TIME‑MONO (Monotone characteristics). List monotone improvements: ↑ coverage, ↑ timestamp precision, ↑ measurement accuracy, ↑ calibration quality. Claim: Such improvements cannot degrade the aggregate.

  • TIME‑SCOPE/BOUND. Keep design‑time hypothetical timelines and run‑time actual logs separate; route resource statements for phases to Γ_work (not Γ_time).

Archetypal grounding (worked micro‑examples)

Use these as templates; each fits on a page and references the obligations above.

Γ_ctx — U.System (manufacturing route)

  • Graph: Prep SerialStepOf Weld SerialStepOf Paint; QC ParallelFactorOf Paint with a join; scope=run.
  • CTX‑IND: QC is independent of Prep/Weld state; join requires “painted & inspected” flags aligned.
  • CTX‑ORD: σ is total: Prep → Weld → Paint; QC runs in parallel with Paint, joins at Finish.
  • CTX‑WLNK: Slowest/least reliable step on the critical path caps throughput and assurance.
  • CTX‑MONO: ↓ duration of Weld; ↑ join condition coverage → cannot reduce overall safety.
  • Routing: Costs/energy are handled per step with Γ_work; structure of subassemblies remains in Γ_sys.

Γ_ctx — U.Episteme (order‑bound argument)

  • Graph: PremiseA SerialStepOf LemmaB SerialStepOf Conclusion; Background ParallelFactorOf PremiseA.
  • CTX‑IND: Background does not alter LemmaB assumptions; join checks entailment preconditions.
  • CTX‑WLNK: Weakest premise on the entailment spine caps the argument’s reliability.
  • SCR: Γ_epist on the final Conclusion produces a SCR linking every source; Γ_ctx assures the order.

Γ_time — U.System (asset history)

  • Carrier: This turbine T‑17.
  • Phases: Install [t0,t1), Operate v1 [t1,t2), Overhaul [t2,t3), Operate v2 [t3,t4).
  • TIME‑COV: Intervals cover [t0,t4) with no overlap; a gap between t2 and t2+ε is justified as clock resolution.
  • TIME‑WLNK: The weakest reliability epoch caps lifetime MTTF claimed for [t0,t4).
  • Routing: Work/energy footprints per phase via Γ_work; structural upgrades (new rotor) are Transformers (A.12), not phases, if identity changes.

Γ_time — U.Episteme (paper revisions)

  • Carrier: This paper P.
  • Phases: Draft v1, Review v2, Camera‑ready v3.
  • TIME‑ORD/COV: Non‑overlapping versions covering the documented interval; v3 supersedes v2, not a parallel branch.
  • TIME‑WLNK: If v2 violated a key citation, overall reliability over [v1,v3] is capped by that epoch unless the violation is explicitly retracted and corrected in v3 (documented change).
  • Routing: Γ_epist aggregates the conceptual whole at each version; Γ_time composes the revision history.

Conformance Checklist (normative checklist)

IDRequirementPurpose
CC‑B1.4.1Γ_ctx input D_ctx SHALL use only SerialStepOf / ParallelFactorOf edges; Γ_time input D_time SHALL use only PhaseOf edges.Keep flavours matched to A.14 edges.
CC‑B1.4.2OrderSpec σ (for Γ_ctx) or TimeWindow τ (for Γ_time) SHALL be explicitly declared.Determinism and auditability (NC‑1/2, T‑2/3).
CC‑B1.4.3An independence declaration (Γ_ctx) or coverage declaration (Γ_time) SHALL be attached, with join‑soundness statements (Γ_ctx) and non‑overlap proof (Γ_time).Make replaced COMM/LOC discipline explicit.
CC‑B1.4.4WLNK cutset SHALL be identified (critical path for Γ_ctx; critical epoch for Γ_time).Conservative bounds.
CC‑B1.4.5MONO characteristics SHALL be listed and justified for the call.Prevent hidden regress.
CC‑B1.4.6All nodes SHALL share the same DesignRunTag (design or run) in a single fold.Ban DesignRunTag chimeras.
CC‑B1.4.7Structural inclusion, mappings, and resource spending SHALL NOT be encoded as order/time edges; route to Γ_sys and Γ_epist, value-level links, or Γ_work respectively.Enforce A.15 Strict Distinction.
CC‑B1.4.8If coverage breaks or identity changes, the modeller SHALL refactor the graph or declare a Meta‑Holon Transition (B.2).Make emergence explicit.

Anti‑patterns and their fixes

Anti‑patternSymptomFix
Structure‑as‑sequenceStepB ComponentOf StepA to force an orderUse SerialStepOf (Γ_ctx) and an explicit σ with a join condition if needed.
History‑as‑structurev2 ComponentOf v1Use PhaseOf; if identity actually changed, model a Transformer (A.12) producing a new holon.
Parallelism without independenceDeclaring ParallelFactorOf but sharing hidden stateEither declare the shared state as an interface and remove independence, or refactor so branches are truly independent.
Overlapping phasesTwo PhaseOf intervals for the same carrier overlapSplit the intervals or justify overlap as measurement resolution; otherwise fold is invalid.
DesignRunTag chimeraMixing run logs with design plan in one Γ_ctx/Γ_time foldSplit into two graphs by scope; relate through a Transformer or mapping at value level.
Cost in Γ_timeTrying to sum energy in Γ_timeRoute costs to Γ_work per phase; Γ_time composes history, not expenditure.

Consequences

Benefits

  • Semantic fidelity: Order and history are first‑class; no more flattening sequential logic or erasing temporal causality.
  • Auditable determinism: An explicit σ/τ and independence/coverage declarations make folds reproducible and reviewable.
  • Safe parallelism: Partial‑order soundness preserves determinism while exploiting concurrency where it is actually safe.
  • Clean separation of concerns: Structure (Γ_sys/Γ_epist), order (Γ_ctx/Γ_method), time (Γ_time), and cost (Γ_work) no longer interfere.

Trade‑offs / mitigations

  • Extra declarations: Independence, joins, and coverage require up‑front articulation. Mitigation: reuse the Proof Kit forms; adopt the decision checklist from Part 1 §4.5.
  • Limited parallelism: Where branches are not independent, concurrency must be curtailed. Mitigation: regroup steps; elevate shared state to explicit interfaces.

Rationale (informative)

This pattern implements A.15’s ordered relations (SerialStepOf, ParallelFactorOf) and leverages A.14’s PhaseOf for timeline; consistent with Strict Distinction: order and time are not structure, and costs are not history. The adapted invariants (NC‑1..3 and T‑1..3) give precise replacements for COMM/LOC where these do not hold, while retaining WLNK and MONO. The result is a small, stable interface that matches how engineers and researchers already argue about procedures and histories, without importing domain‑specific notations into the kernel.

Relations

C.27 temporal-claim relation.

  • C.27 may flag: an authored temporal claim that turns a temporal slice, phase name, aggregate membership, or temporal ordering into a rate-change adequacy claim.
  • This pattern keeps: contextual and temporal aggregation, declared temporal slices, and phase composition.
  • Non-admissible use: temporal slices, phase names, aggregate membership, or temporal ordering do not infer acceleration or create a dynamics law.
  • Exit: if only slice composition is live, stay in B.1.4; if rate-change adequacy changes admissible use, use C.27 for that claim and cite the governing FPF pattern for any law, work, causal, or benchmark question.
  • Builds on: B.1 (Universal Γ), B.1.1 (Dependency Graph & Proofs), A.12 (Transformer), A.14 (Mereology Extension), A.15 (Strict Distinction).
  • Specialises into: B.1.5 Γ_method (adds duration, capability typing, join soundness rules).
  • Works alongside: B.1.6 Γ_work (resource accounting per step/phase).
  • Triggers: B.2 Meta‑Holon Transition (MHT): Recognizing Emergence and Re‑identifying Wholes when re‑ordering or re‑phasing produces genuinely new properties.
  • Feeds: B.4 Canonical Evolution Loop (time‑aware cycles that carry explicit costs and order).

One‑page takeaway. If order changes meaning, use Γ_ctx with an explicit OrderSpec and independence/joins. If you are composing the same carrier across time, use Γ_time with a TimeWindow, coverage, and identity. Keep structure, mapping, and cost in their places, and the invariants will do the rest.

B.1.4:End

Γ_method — Order‑Sensitive Method Composition & Work Enactment

► decided‑by: A.14 Advanced Mereology A.14 compliance — Methods compose over SerialStepOf/ParallelFactorOf on MethodDescription/Method graphs (order, not parthood); stuff‑like inputs are modelled via PortionOf on resources and accounted in Γ_work; method/version history uses PhaseOf; mapping quality is handled via CL (B.3).

Plain‑English headline. Γ_method composes ordered step specifications into a single MethodDescription (design‑time) that describes a composite Method, and governs its run‑time enactment as Work (pre/post, capability typing, MIC honouring) while delegating resource accounting to Γ_work and order semantics to Γ_ctx.

Problem frame

  • Strict Distinction (A.15) separates what a holon is (structure), how steps are ordered (order), how it unfolds (time), what it spends (work/resources), and what it values (objectives).

  • Method, MethodDescription, and Work.

    • Method is the timeless semantic “way of doing” (a context‑scoped capability; A.3.1): it specifies admissible preconditions, effects, and bounds, independent of any particular run.
    • MethodDescription is a design‑time description of a Method (knowledge on a carrier). It may be an imperative step‑graph (this pattern’s focus) or another admissible description form (functional/logical/dynamics/solver, etc.; A.3.2:4.2).
    • Work is the dated run‑time occurrence that enacts a pinned MethodDescription under a U.RoleAssignment, records concrete slot fillings (parameters/carriers), and books the resource ledger (A.15.1). Calling the description a “process” is common in some domains, but in FPF we keep Method ≠ MethodDescription ≠ Work to avoid category errors.
  • A.15 (Role–Method–Work Alignment) supplies the typed ordered relations we need: SerialStepOf (strict precedence) and ParallelFactorOf (order‑concurrent branches with a join).

  • B.1.4 (Γ_ctx/Γ_time) already handles non‑commutativity (order matters) and temporal slicing; B.1.6 (Γ_work) handles resource spending and efficiency. Γ_method sits between them: it composes methods by order and capability and delegates resource accounting to Γ_work.

Problem

Without a dedicated, order‑aware method operator:

  1. DesignRunTag conflation. Authors mix MethodDescription (blueprint) and Work (execution), producing artifacts that have both planned and executed attributes.
  2. Order erasure. Sequences with crucial pre/post‑conditions get collapsed into sets; reordering breaks correctness while still “passing” naive aggregation.
  3. Capability mismatches. Step outputs do not match the next step’s required inputs, but this is hidden in untyped edges; composite methods become non‑executable.
  4. Work leakage. Costs and resource flows are inlined into method definitions; later models double‑count or violate conservation (Γ_work was created to prevent this).
  5. Synergy by arithmetic. Throughput or quality jumps caused by proper joins or coordination are misreported as simple sums or averages—violating WLNK and obscuring when a Meta‑Holon Transition (B.2) should be declared.

Forces

ForceTension
Order fidelity vs. simplicityKeep the true sequence (non‑commutative) ↔ Provide a small operator set.
Type safety vs. flexibilityEnforce capability typing and pre/post checks ↔ Allow modular reuse of steps across contexts.
Design vs. runCompose MethodDescription for planning ↔ Produce Work for execution without mixing them.
Parallelism vs. correctnessMaximise concurrency on independent branches ↔ Guarantee sound joins and reproducible outcomes.
Parsimony vs. separation of concernsKeep Γ small ↔ Keep work and assurance in their own lanes (Γ_work, B.3).

Solution

Terms (didactic recap)

  • U.MethodDescription — a design‑time description of a U.Method (A.3.2): typically an imperative step‑graph with SerialStepOf/ParallelFactorOf, step capability types, pre/post‑conditions, and required external interactions. (Other admissible description forms exist; B.1.5 focuses on the step‑graph case.)
  • U.Method — the timeless semantic “way of doing” (capability) described by ≥1 MethodDescription and enacted as U.Work (A.3.1, A.15.1).
  • U.Work — the run‑time, dated enactment occurrence: performedBy → U.RoleAssignment, isExecutionOf → U.MethodDescription (edition‑pinned), plus concrete slot fillings and resource ledger (A.15.1).
  • U.StepSpec / U.StepMethod — step‑level specialisations: each StepSpec describes a StepMethod; a composite MethodDescription relates them by order. (Run‑time step occurrences are Work parts, not “StepMethods”.)
  • Capability type — the state/action signature a step requires and produces (not to be confused with resources; those belong to Γ_work).
  • Method Interface Standard (MIC) — the order‑aware analogue of BIC: a short, declarative statement of what external interactions of the steps are Promoted / Forwarded / Encapsulated at the composite method boundary.

Separation reminder. Method composition ≠ resource spending. Keep resource budgets, yields, dissipation in Γ_work; Γ_method only checks and composes order and capability.

The operator family (two companion flavours)

To respect the DesignRunTag split, Γ_method is presented as two companion operators sharing the same intent but acting at different DesignRunTag positions (spec vs run).

  1. Planning (design‑time) — compose specifications

    Γ_method^plan : ( D_spec : OrderedDependencyGraph< U.StepSpec >,
                      σ       : OrderSpec,
                      MIC_in  : optional boundary hints )
                    → U.MethodDescription
    • Domain. D_spec contains step specifications linked by SerialStepOf / ParallelFactorOf (A.15).
    • Result. A single U.MethodDescription whose MIC is computed from step interfaces using the Promote / Forward / Encapsulate quartet (cf. BIC in B.1.2). The resulting MethodDescription SHALL declare the U.Method it describes (A.3.2); in the step‑graph case this is the semantic serial/parallel composition of the described StepMethods (A.3.1:9).
  2. Enactment (run‑time) — produce Work

    Γ_method^run  : ( M_spec : U.MethodDescription,
                      RA     : U.RoleAssignment,
                      Fill   : carrier & parameter slot fillings )
                    → U.Work
    • Domain. A previously composed MethodDescription, a performer designated via RoleAssignment (the holder bears the required role in context), and concrete slot fillings (carriers, parameters) consistent with the MethodDescription’s declared SlotKinds/ValueKinds (A.6.5).
    • Result. A U.Work record (the dated run) provided that capability checks and pre/post‑conditions hold and the MIC is honoured.

Relationship to Γ_ctx. Both flavours reuse Γ_ctx invariants for order (non‑commutative composition with NC‑1..3 reproducibility). Γ_method specialises the typing and boundary rules for methods and introduces MIC.

Core aggregation rules (design‑time composition)

When computing Γ_method^plan(D_spec, σ):

  1. Order preservation. Respect the OrderSpec σ; independent branches may be folded in any topological sort (Γ_ctx NC‑3). SerialStepOf enforces strict precedence; ParallelFactorOf allows concurrency with a join.

  2. Capability continuity (typed joins). Every join must be type-sound: the post-condition and output signature of each incoming branch must meet the next step's pre-conditions (logical entailment or declared adapter steps). Missing adapters are defects, not assumptions.

  3. MIC synthesis (boundary behaviour). For each external interaction of a step, decide Promote / Forward / Encapsulate into the composite MIC. This inherits the clarity of BIC (B.1.2) for methods.

    • Promote: becomes a direct composite interaction (e.g., top‑level “start/stop”).
    • Forward: remains step‑local but exposed under the composite boundary (namespaced).
    • Encapsulate: becomes internal; callers cannot rely on it.
  4. Assurance hooks (without computing assurance). Record where B.3 assurance will later hang: (i) the cutset steps that bound reliability/quality, (ii) the integration edges whose CL will penalise poor fit (mappings, fragile joins), and (iii) the envelope (G) intended for the method’s validity.

  5. No costs here. If a step lists resources/yields, do not aggregate them here. Instead, add a pointer to the corresponding Γ_work composition to be executed with the same order/joins at run‑time.

Core aggregation rules (run‑time enactment)

When executing Γ_method^run(M_spec, RA, Fill):

  1. Role–Method–Spec alignment (A.2 / A.3 / A.15). Confirm that RA.role is eligible to enact the U.Method described by M_spec (or a declared equivalent/refinement in the same context), and that the Work’s performedBy and executedWithin anchors can be satisfied (A.15.1). If this fails, you may still record an attempted run, but it is not a conformant “execution of M_spec”.

  2. Pre/post enforcement. Before each step, verify pre‑conditions against Fill and the evolving carrier state; after, check post‑conditions hold. Failing these means the run cannot be certified as a conformant U.Work execution of M_spec.

  3. Typed state flow. The state/action types produced by a step must make the next step well‑typed; if not, an adapter method (itself with a MethodDescription) must be present in the graph.

  4. Order determinism (Γ_ctx). Respect the OrderSpec σ declared in M_spec. Parallel branches may execute independently only if they share no state that would break NC‑1..3; otherwise they must synchronise at the declared join.

  5. MIC honouring. Interactions exposed by MIC are the only external commitments the composite method makes. Any additional ad‑hoc external interaction is a model violation (or requires updating the MIC and re‑planning).

  6. Γ_work hand‑off. Invoke Γ_work to compute spent resources, yields, dissipation along the same order/join structure. The resulting ledgers and work-result records annotate the Work but are not part of Γ_method’s aggregation.

Invariant intuition.

  • IDEM: a single step‑method composed alone yields the same method.
  • COMM/LOC: replaced by Γ_ctx NC‑1..3 (determinism given σ, context hash of σ, and partial‑order soundness).
  • WLNK: quality/throughput of the composite is bounded by the critical path steps (identified for later B.3 assurance).
  • MONO: strengthening a step (better pre/post, stronger type, improved adapter) cannot make the composite worse.

Didactic contrasts (to prevent common confusions)

  • Method vs Work. Method = the semantic “way of doing” (what transformations are admissible); Work = what happened this time, including resources spent / yields / dissipation when enacting it (Γ_work). Keep them distinct.

  • Method vs Structure. Method composes ordered steps; structure composes parts (Γ_sys). Do not use ComponentOf where SerialStepOf/ParallelFactorOf are intended.

  • Step vs part vs specialization. A “step” in SerialStepOf/ParallelFactorOf is a factor in an order algebra, not a mereological part and not a type‑specialisation. – Use ComponentOf/PartOf for structural wholes (A.14). – Use ≤ₘ refinement / equivalence / substitution for Method specialisation (A.3.1). – Use Kind‑CAL () for kind/subkind.

  • Method vs Phase. Method composition is order; PhaseOf (Γ_time) is temporal progression of the same carrier. If a phase boundary also introduces closure/supervision/context rebase, that is MHT (B.2), not mere phasing.

  • MethodDescription vs Work. Keep planning artefacts (MethodDescription) separate from run‑time occurrences (Work). Γ_method^plan produces MethodDescriptions; Γ_method^run produces Work that cites an edition‑pinned MethodDescription and records effective slot fillings and ledgers (A.15.1).

Archetypal grounding (worked, didactic)

System archetype — Assemble‑Paint‑Test as one Method

  • Design‑time (Γ_method^plan). D_spec contains StepSpecs: AssembleChassis, InstallPowertrain, PaintBody, RunFunctionalTest. Relations: AssembleChassis → InstallPowertrain (SerialStepOf), PaintBody ∥ RunFunctionalTest after a structural seal (ParallelFactorOf). Capability typing:

    • Output of InstallPowertrain meets input of RunFunctionalTest (functional harness attached).
    • PaintBody requires sealed surfaces from InstallPowertrain (pre‑condition). MIC outcome:
    • Promote: Start(), Abort(), CertificationReport.
    • Forward: RunFunctionalTest.Diagnostics (namespaced).
    • Encapsulate: PrimerMixingPort, internal seal checks.
  • Run‑time (Γ_method^run). The holder designated by the relevant U.RoleAssignment enacts the MethodDescription on concrete carriers, producing a U.Work record. Pre/post checks gate each step; parallel branches run after pre‑conditions met; a join waits for both to finish.

  • Assurance hooks (B.3). Cutset steps for WLNK: InstallPowertrain (torque tolerances) and RunFunctionalTest pass/fail; integration edges carry CL for harness mapping and paint/seal specification. Γ_work is invoked to compute energy/material spend and dissipation; Γ_method does not tally costs itself.

Episteme archetype — Evidence‑Synthesis‑Publish as one Method

  • Design‑time (Γ_method^plan). Steps: CollectDatasets, NormalizeSchemas, EstimateModel, CrossValidate, DraftManuscript. Ordering: CollectDatasets → NormalizeSchemas → EstimateModel → CrossValidate → DraftManuscript. Capability typing: NormalizeSchemas outputs a typed feature space that entails EstimateModel’s input; adapters specified for legacy datasets. MIC outcome:

    • Promote: Submit(), ReleaseArtifacts().
    • Forward: CrossValidate.Folds(k).
    • Encapsulate: ad‑hoc scrubbing utilities.
  • Run‑time (Γ_method^run). The same order executes as U.Work; Γ_work accounts for compute/storage spend. Assurance hooks: cutset at CrossValidate; integration CL for schema mappings; post‑condition for DraftManuscript includes provenance SCR.

Method Interface Standard (MIC) — template & examples

MIC template (normative content)

Method Interface Standard (MIC)
  name:                human-readable identifier
  version:             semantic label of this MIC
  orderSpecHash:       hash(OrderSpec σ + step signatures)
  externalInteractions:
    - id:              external op name
      mode:            {Promote | Forward | Encapsulate}
      signature:       state/action types (typed interface)
      preconditions:   predicates that must hold at call
      postconditions:  predicates guaranteed on return
      qosEnvelope:     optional envelope (throughput, latency, quality)
  invariants:
    - textual/logical invariants preserved by the method
  notes:
    - rationale for Promote/Forward/Encapsulate choices

MIC excerpts (didactic)

  • Manufacturing method MIC excerpt

    externalInteractions:
      - id: Start
        mode: Promote
        signature: Start(): Promise<BatchId>
        preconditions: LineReady & MaterialsAvailable
        postconditions: BatchId issued
      - id: PrimerMixingPort
        mode: Encapsulate
    invariants:
      - FunctionalTest.Pass implies TorqueTolerance ≤ δ
  • Evidence method MIC excerpt

    externalInteractions:
      - id: Submit
        mode: Promote
        signature: Submit(): Promise<SubmissionId>
        preconditions: ManuscriptReady & SCRComplete
        postconditions: DOI assigned on accept
      - id: CrossValidate.Folds
        mode: Forward
        signature: Folds(k: Int): Report
    invariants:
      - Report.metrics computed on held-out data only

Proof obligations (normative)

At planning time (Γ_method^plan):

  1. PO‑PLAN‑ORDER. Provide OrderSpec σ; produce orderSpecHash.
  2. PO‑PLAN‑TYPE. For every edge, show capability continuity: OutType(step_i) ⊢ InType(step_j) or provide a typed adapter StepSpec.
  3. PO‑PLAN‑MIC. For each step interaction, decide Promote/Forward/Encapsulate and justify in MIC.
  4. PO‑PLAN‑CL‑POINTS. Identify integration edges whose CL will matter for B.3; record intended sources of mapping evidence.
  5. PO‑PLAN‑NO‑WORK. Confirm that costs/resources are not aggregated here; point to the planned Γ_work composition (by reference).

At run time (Γ_method^run) producing U.Work:

  1. PO‑RUN‑PRE/POST. Demonstrate that pre‑conditions hold before each step; check post‑conditions after.
  2. PO‑RUN‑NC. Show compliance with Γ_ctx NC‑1..3 (determinism with σ, context hash, partial‑order soundness).
  3. PO‑RUN‑MIC‑HONOUR. Record that only MIC‑declared external interactions occurred.
  4. PO‑RUN‑WORK. Attach the Γ_work result (spent resources, yields, dissipation) aligned with the same order/join structure.
  5. PO‑RUN‑ASSURANCE. Provide the observed values for the cutset steps and the actual CL of integration mappings to feed B.3 assurance.

Conformance Checklist (normative)

IDRequirementPurpose
CC‑B1.5.1Γ_method SHALL be used in two flavours only: Γ_method^plan for specifications, Γ_method^run for Work enactments.Enforce DesignRunTag separation.
CC‑B1.5.2Planning inputs SHALL use SerialStepOf / ParallelFactorOf edges with a declared OrderSpec σ.Preserve order semantics.
CC‑B1.5.3All joins SHALL be type‑sound (capability continuity) or include explicit typed adapters.Prevent non‑executable composites.
CC‑B1.5.4A MIC SHALL be produced for Γ_method^plan and SHALL be honoured by Γ_method^run.Make external commitments explicit.
CC‑B1.5.5Resource spending/yields SHALL be computed via Γ_work and MUST NOT be inlined into Γ_method aggregation.Maintain separation of concerns.
CC‑B1.5.6Γ_ctx NC‑1..3 invariants SHALL hold for both flavours (determinism under σ, hash, partial‑order soundness).Guard non‑commutative correctness.
CC‑B1.5.7If joining branches produces apparent super‑additivity beyond WLNK not explainable within Γ_method, an MHT SHALL be considered and recorded per B.2.Prevent “synergy by arithmetic”.

Anti‑patterns & repairs

Anti‑patternSymptomRepair
Flattened set of stepsOrder lost; results become nondeterministicUse Γ_ctx to restore σ, then apply Γ_method^plan.
Cost‑in‑methodResources embedded in method definitionRemove costs; move to Work/Γ_work.
DesignRunTag ChimeraSpec contains runtime measures; enactment adds planning edgesSplit into MethodDescription (design) vs Work (run); rerun Γ_method per flavour.
DesignRunTag ChimeraSpec contains runtime measures; enactment adds planning edgesSplit into MethodDescription vs Method; rerun Γ_method per flavour.
Orderless SetSteps modelled as unordered; reordering breaks correctnessProvide OrderSpec σ and recompose with Γ_method/Γ_ctx.
Silent AdapterA join assumes implicit conversionAdd explicit typed adapter StepSpec/Method and re‑prove capability continuity.
Inline CostsMethod sums time/energyMove to Γ_work; link the work composition to the same order.
Boundary FogExternal calls occur ad‑hocDefine/Update MIC; Promote/Forward/Encapsulate explicitly.
Emergence by JoinThroughput leaps past WLNK with no storyEither (i) prove within Γ_method (cutset/CL/order) or (ii) declare MHT (B.2).

Consequences

Benefits

  • Didactic clarity. Readers see what is being composed (order & capability) vs what is spent (Γ_work) vs what is assured (B.3).
  • Deterministic execution semantics. Γ_ctx‑backed order with explicit joins yields reproducible composites.
  • Robust interfaces. MIC prevents accidental external dependencies and preserves modularity.
  • Cross‑scale fit. Same pattern works for physical, organizational, and epistemic methods.

Trade‑offs

  • More explicitness up‑front. Capability typing and MIC authorship require care; in return, later integration is safer.
  • Adapter discipline. Modellers must create adapters rather than assuming conversions—this avoids hidden brittleness.

Rationale (informative)

  • Order is semantic. Many failures stem from pretending that order does not matter; Γ_method makes non‑commutativity explicit (via Γ_ctx) while keeping the operator set small.
  • Strict Distinction. The split between Method (semantic), MethodDescription (spec), Work (occurrence), Γ_method (order/type checks), Γ_work (resource ledgers), and assurance implements A.15, preventing category errors (semantics vs execution vs claims).
  • Mereology alignment. Using SerialStepOf / ParallelFactorOf (A.14) keeps method composition orthogonal to structural composition (ComponentOf) and temporal phasing (PhaseOf).
  • Assurance readiness. Identifying cutsets and mapping CL points during planning makes B.3 application straightforward and auditable.
  • Interfaces matter. MIC prevents accidental coupling and makes integration points auditable.
  • Separation of concerns. Γ_method composes behaviour; Γ_work accounts resources; B.3 assesses quality—keeping algebraic reasoning sound.

Relations

  • Builds on: A.12 (Transformer Role), A.14 (Mereology Extension), A.15 (Strict Distinction); B.1.1 (Proof Kit), B.1.4 (Γ_ctx/Γ_time).
  • Coordinates with: B.1.6 (Γ_work) for resource accounting; B.3 (Assurance) for WLNK cutsets and CL penalties.
  • Triggers/Complements: B.2 (MHT) when new closure/supervision or context re‑base appears at method level.
  • Used by: Later domain patterns that define canonical methods in specific disciplines (without altering Γ_method).

One‑sentence takeaway. Γ_method composes ordered, typed steps into a reliable method, keeps interfaces explicit (MIC), leaves costs to Γ_work, and provides clean hooks for assurance and emergence.

B.1.5:End

Γ_work — Work as Spent Resource

Status: Stable

► decided‑by: A.14 Advanced Mereology A.14 compliance — Only Work carries resource deltas; quantitative splits/consumption use PortionOf against pre‑consumption stocks; run histories use PhaseOf on Work; MemberOf MUST NOT be used for resource mereology; SCR/RSCR stay outside (use EPV‑DAG anchors).

Problem frame

FPF distinguishes what is done from what it costs to do it.

  • Method, MethodDescription, and design-time process: A Method is the abstract way‑of‑doing inside a bounded context (A.15). A MethodDescription is a design‑time U.Episteme that describes a Method (SOP, algorithm, proof, simulator configuration, etc.). A Process is a view that represents a MethodDescription as an ordered/partially‑ordered composition (steps, branches, synchronization). In Cluster B, that ordering/coordination is handled by Γ_method (B.1.5). Not every MethodDescription admits a step decomposition; Γ_method applies only when a step/process view is chosen.

  • Work (run‑time; this pattern focuses on the resource facet): Work is the dated run‑time occurrence of enacting a MethodDescription by a performer under a U.RoleAssignment (A.15). In this pattern we treat Work under its spent‑resource facet: the typed delta we can account for across a declared boundary and time window. Γ_work defines how those deltas compose across parts and phases.

This separation makes models auditable and prevents category errors: Γ_method composes design‑time coordination (a process view); Γ_work composes run‑time Work ledgers (and never smuggles order semantics).

Problem

Without a dedicated algebra for spent resources, models drift into four errors:

  1. Process–Work conflation: Time‑ordered steps and resource spending are mixed, producing ambiguous or double‑counted totals.
  2. Conservation violations: Totals appear that exceed inputs or create “free” resource, contradicting physical and informational conservation.
  3. Boundary blindness: Spending is reported without specifying the boundary across which it is measured, making numbers non‑comparable.
  4. Category errors in mereology: Collection membership (MemberOf) is misused as if it were parthood for resource stocks, polluting Γ proofs (B.1).

Forces

ForceTension
Conservation vs. AbstractionTotals must obey material/energy/information conservation ↔ models must stay simple and readable.
Run‑time measurability vs. Design‑time planningWe need measurable deltas at run‑time ↔ we also need ex‑ante yields from MethodDescription to plan.
Heterogeneous units vs. Unified sumsResources come in different units (joules, kg, bits) ↔ we still need composite statements (vectors, typed sums).
Safety vs. SynergyWeakest‑link bounds must cap availability ↔ redundancy or substitution can improve feasibility but belongs to emergence (B.2).

Terminology guard‑rails (A.15 — Strict Distinction)

These rules are normative in this pattern; they exist to prevent the recurring confusion noted in prior drafts.

  • Method (U.Method) — design‑time, abstract way‑of‑doing inside a bounded context; not an execution; it may be described by multiple MethodDescriptions and may or may not admit any step decomposition.
  • MethodDescription (U.MethodDescription) — a design‑time U.Episteme that describes a Method (SOP/algorithm/proof/simulator/solver configuration, control law, or other viewpoint). A step/workflow graph is only one possible representation.
  • Process (view) — a chosen representation of a MethodDescription as an ordered/partially‑ordered structure (steps, branches, synchronization); composed by Γ_method.
  • Work (U.Work) — a run‑time occurrence: dated enactment of a MethodDescription by a performer under a U.RoleAssignment. In this pattern, Work is treated under its spent‑resource ledger facet; composed by Γ_work.
  • Transformer (T) — a U.System playing the executing and/or auditing role for Work’s accounting (A.12); transformer identity belongs in the Boundary Ledger.
  • Mereology for resources (A.14): use PortionOf for quantitative splits and PhaseOf for time‑slices; do not use MemberOf for resource stocks.

Solution — The Γ_work Operator

Intent. Provide a universal, conservative way to compose resource spending across parts and steps, without talking about control‑flow (that is Γ_method’s job).

Operator signature

Γ_work : (S : Set[U.Work], M_spec : U.MethodDescription?) → W_tot : U.Work
  • S — Work set. A finite set of U.Work instances to be rolled up (parts, phases, episodes, or boundary partitions). Each Work MUST carry (or reference) a Boundary Ledger (§5.3) and a typed resource ledger on an explicit basis. Where a stock is subdivided, the split uses PortionOf; where a run is time‑sliced, the slices use PhaseOf (A.14).

    If S contains overlaps (shared stocks, shared ports, or overlapping time windows), the fold MUST apply an explicit overlap / de‑duplication policy declared in the relevant U.BoundedContext (A.15.1:5.3); otherwise the result is undefined (double counting).

  • M_spec — optional. If present, it provides ex‑ante yield/efficiency (η) and declared equivalence maps for planning or basis normalization. It MUST NOT overwrite measured deltas; planned and measured Work MUST be reported separately (CC‑B1.6.8).

  • Result W_tot — U.Work. A composite Work whose resource ledger is the Γ_work fold of the input ledgers (plus any declared overheads/residuals). It is accompanied by a Boundary Ledger (see §5.3) and references its parts for auditability.

Do not confuse: Γ_work neither schedules nor orders steps; it composes resource deltas attached to Work. If you need order, use Γ_method at design‑time and Work’s run‑time relations (precedes, PhaseOf, overlaps) with Γ_time for temporal coverage.

What counts as “Work”

Work is defined with respect to a declared boundary of the holon being transformed or assembled:

  • Boundary‑relative delta (conservative form): For any resource type q measured on boundary B during a run,

    Work_B(q) = Inflow_B(q) − Outflow_B(q) − ΔStock_inside(q)

    where ΔStock_inside(q) is the change of internal stock over the run (positive when the stock grows).

  • Embodiment split: Work can be split into Dissipation (lost to environment) and Embodied (retained in produced holons as state). Both are part of the same Work vector; the split is a reporting choice, not a second algebra.

  • Heterogeneous vectors: Γ_work treats different resource types as a typed vector space (no implicit conversion). Equivalences (e.g., joules↔bits via a declared model) are allowed only if declared in M_spec or in a domain CAL; otherwise vectors remain multi‑dimensional.

Boundary Ledger (normative output metadata)

Every Γ_work result MUST include a Boundary Ledger:

  • (i) Boundary scope: which U.Boundary was used (source holon, ports).
  • (ii) Time window: start/stop or PhaseOf slice identifiers.
  • (iii) Basis: the ordered list of resource types and units.
  • (iv) Method context & lineage: reference(s) to the governing U.MethodDescription(s) (and, if known, U.Method), plus the Work lineage (which Work IDs were folded to produce W_tot).
  • (v) Accounting authority: identity of the system(s) that executed, metered, and/or audited the reported ledgers (often the performer/transformer per Work part, plus the aggregator for a roll‑up).

This ledger is what makes cross‑model Work totals comparable and auditable (A.10).

The invariant quintet instantiated (overview)

Γ_work preserves B.1 invariants; the detailed proofs and corner cases are in Part 2.

  • IDEM (idempotence): Folding a singleton zero‑delta Work (or adding a zero‑delta Work to any fold) does not change totals; the zero‑delta ledger is the identity element.
  • COMM / LOC (local commutativity / locality): For independent boundary/stock partitions, composed Work is additive and independent of local fold order.
  • WLNK (weakest‑link bound): Effective Work is capped by the scarcest critical input on the boundary (no Work can exceed available supply).
  • MONO (monotonicity): Increasing an available resource cannot decrease Work (for the same boundary and time window); decreasing dissipation or improving η cannot reduce feasibility.

How Γ\work relates to Methods (and to Γ\method)

  • Design‑time: M_spec (a U.MethodDescription) may declare an intended yield η and admissible equivalences between resource types (e.g., heat→mechanical). These are assumptions until validated by run‑time Work.
  • Run‑time: A U.Work instance (enacting a MethodDescription under a U.RoleAssignment) produces measured deltas across its declared boundary/time window. Γ_work composes those deltas; it does not speculate nor retroactively “fix” measurements.
  • Sequencing: If multiple MethodDescriptions are ordered/branched (process view), use Γ_method to define that coordination at design‑time. At run‑time, model the corresponding segments as Work parts and fold them with Γ_work (Work adds in serial and parallel), while time coverage is handled by Γ_time.

Didactic tip: Think of Γ_method as the coordination story, and Γ_work as the receipt of what it cost, both anchored to the same boundary and time window.

Fold rules (how Γ_work composes)

Boundary partition (across parts of a whole)

Let the system‑level boundary B be covered by a finite family of pairwise‑disjoint sub‑boundaries {Bᵢ} (ports, surfaces, interfaces) that together exhaust B. For any resource type q in the basis:

  • Partition additivity (normative):

    Work_B(q) = Σ_i Work_Bi(q)

    Preconditions: (i) Bi are disjoint except for measure‑zero interfaces, (ii) meters are aligned (same units, same time window), (iii) internal stock changes ΔStock_inside(q) are measured for the same closed region bounded by B. Why it matters: this is the cross‑scale rule that lets part‑level Work totals roll up to the whole without double counting.

Time slicing (serial runs / phases)

Let the run be split by a set of non‑overlapping intervals {τⱼ} that cover the window τ (use PhaseOf to tag the slices). Then:

Work_B(q, τ) = Σ_j Work_B(q, τ_j)

This is the temporal additivity of Work. It is the Γ_work analogue of Γ_time’s coverage rule: we never “smear” or reorder; we sum non‑overlapping slices.

Concurrent branches (parallel activity)

When two independent sub‑boundaries B₁, B₂ are active over overlapping time, total Work still adds:

Work_B(q) = Work_B1(q) + Work_B2(q)

Independence here means: no shared port, no shared stock variable, no hidden transfer between B₁ and B₂ that bypasses the declared meters. If a shared internal stock exists, it must be accounted in ΔStock_inside(q) for B to keep conservation exact.

Didactic contrast: Γ_method handles duration (Σ for serial, max for parallel). Γ_work handles resource (Σ in both serial and parallel), because resource spending composes additively across disjoint boundary parts and disjoint time slices.

Multi‑resource vectors and declared equivalences

Γ_work never implicitly converts units. If a planning model needs an exchange (e.g., heat→mechanical, memory→compute), it must be declared in M_spec (or a domain CAL) as an equivalence map E applied before folding, yielding a new typed basis E(basis). Absent such declaration, vectors remain multi‑dimensional and are added component‑wise.

Many runs require critical inputs (a subset Q* of the basis) to be present at or above a threshold. Let Avail_B(q*) be the measurable availability for q* ∈ Q* on boundary B during τ. Then feasibility is constrained by:

Work_B(q*) ≤ Avail_B(q*),  for all q* ∈ Q*

If any inequality is violated, the fold must fail or the modeller must declare a Meta‑Holon Transition (B.2) that introduces redundancy/substitution as a new structural capability (changing Q* or the equivalence map). This is WLNK in resource form.

Embodiment and dissipation (reporting scheme)

Every Work vector MAY be split into two projections, both defined on the same basis and the same boundary/time window:

  • Embodied_B(q) — the part of Work retained inside B as state change of produced holons (e.g., latent heat stored, material incorporated, committed data).
  • Dissipated_B(q) — the part of Work irreversibly exported beyond B (e.g., heat loss, scrap, discarded packets).

By norm:

Work_B(q) = Embodied_B(q) + Dissipated_B(q)

This split is informative, not a second algebra: Γ_work always folds the total Work; the split is attached in the Boundary Ledger for transparency.

Invariants — edge cases and proof sketches

IDEM (idempotence)

Let S = {W} be a singleton Work set. If the resource ledger carried by W satisfies Work_B(q)=0 for all basis components q (i.e., no net delta across the declared boundary over the window), then

Γ_work(S) = 0  (the zero vector)

Trivial by definition: no measured boundary‑relative delta implies zero spent‑resource Work.

COMM/LOC (local commutativity / locality)

Let S be partitioned into independent subsets {Sᵢ} whose boundary partitions {Bᵢ} are disjoint and cover B (6.1). Since each subset’s ledger is evaluated with its own meters and time slices (6.2), and vector addition is commutative/associative, any local fold order yields the same Σ_i Γ_work(Sᵢ). Hence Γ_work inherits commutativity/locality under independence. Note: If subsets share a stock variable (or an undeclared transfer), independence fails and the modeller must either (i) refactor boundaries / Work decomposition to restore independence, or (ii) model the shared stock explicitly in ΔStock_inside(q) for the parent B.

Let Q* be the critical input set with availability caps Avail_B(q*). Since the delta definition measures net consumption across B (inflow–outflow–Δstock), and no external creation is allowed, each Work_B(q*) cannot exceed Avail_B(q*). If the plan suggests more, you have either (a) a measurement error, (b) a missing equivalence declaration in M_spec, or (c) a true emergent synergy that must be modelled as MHT (new redundancy/substitution capability).

MONO (monotonicity)

Monotonicity is interpreted along three characteristics; in all cases “improvement” never makes the whole worse (i.e., never increases required Work nor decreases feasibility):

  • Availability monotonicity: Increasing Avail_B(q) for any non‑critical q leaves Work_B(q) unchanged (availability is not auto‑consumed); increasing it for a critical q cannot increase Work_B(q) and weakly increases feasibility.
  • Yield monotonicity (η): For a fixed output target, increasing declared or measured η weakly decreases the required Work_B(q) in the inputs, never increases it.
  • Loss monotonicity: Decreasing dissipation (better insulation, better compression) weakly decreases Dissipated_B(q); total Work cannot go up as a result.

Compatibility with Γ_method

Let a process be composed by Γ_method from steps {S_k}, each with its own boundary partition {B_k} and time slice {τ_k}. If independence holds between steps at the resource boundary level (no hidden cross‑leaks), the summed Work

Σ_k Work_Bk(q, τ_k)

is invariant to any topological sort consistent with Γ_method’s order (Γ_method may change when costs are incurred; Γ_work adds how much is spent).

Manager note. When reviewing a plan, inspect Γ_method (is the order/capability sound?). When reviewing results, inspect Γ_work (do the boundary‑relative deltas and units make sense?). Use PhaseOf to align both views over time.

Archetypal grounding (System / Episteme)

FacetU.System — Assembling a heat‑treated frameU.Episteme — Training and publishing a model
BoundaryThe enclosure boundary of the frame workstation; ports for electricity, gas, material in/out.The boundary of the knowledge publication unit: data ingress, model-publication egress, compute energy ingress.
Work definitionElectricity and fuel inflows minus outflows minus Δstock of materials and thermal content retained in the frame.Energy spent (compute) + data‑read deltas; Embodied work includes the stored parameters (as committed bytes) and archived SCRs.
Embodied vs DissipatedEmbodied: material incorporated, latent heat retained; Dissipated: heat loss, scrap.Embodied: parameter file written, proof carriers; Dissipated: energy to heat, discarded intermediate data.
Additivity across partsPorts on furnace, press, conveyor are Bᵢ; total frame‑level Work is Σ over Bᵢ.Data‑read over dataset shards are Bᵢ; total training Work adds per‑shard deltas.
Time slicingHeat → dwell → quench phases are PhaseOf; Work adds: Σ over phases.Epochs are PhaseOf; Work adds across epochs.
WLNKGas supply cap limits feasible heat cycles (critical input); if redundancy is added (dual supply), model it as MHT.Storage bandwidth caps data‑read; adding a cache hierarchy is MHT (new structural capability), not “free” efficiency.

Conformance Checklist (complete)

IDRequirementPurpose
CC‑B1.6.1Every Γ_work result SHALL include a Boundary Ledger: boundary, time window, basis, method context, transformer identity.Make Work statements comparable and auditable (A.10).
CC‑B1.6.2Resource vectors SHALL be typed; no implicit unit conversions. Any equivalence MUST be declared in M_spec (or a domain-specific mechanisms).Prevent silent inflation/deflation.
CC‑B1.6.3Resource stocks SHALL be structured with PortionOf and PhaseOf; MemberOf MUST NOT be used for resource mereology.Align with A.14 and prevent category errors.
CC‑B1.6.4For partitioned boundaries {Bᵢ} the fold MUST satisfy partition additivity and document the partition.Enable cross‑scale roll‑ups.
CC‑B1.6.5For time slicing {τⱼ} the fold MUST satisfy temporal additivity with non‑overlapping slices (Γ_time‑compatible).Keep history coherent.
CC‑B1.6.6Critical inputs Q* and their availability caps MUST be explicit; any violation SHALL cause the fold to fail or require an MHT declaration.Enforce WLNK conservatism.
CC‑B1.6.7If a shared internal stock exists between sub‑boundaries, it MUST be modelled in ΔStock_inside(q) at the parent boundary level.Preserve conservation and COMM/LOC preconditions.
CC‑B1.6.8When M_spec declares a yield η, the report SHALL separate planned (ex‑ante) and measured (ex‑post) Work.Keep planning distinct from accounting (A.15).
CC‑B1.6.9Γ_work SHALL provide proofs of the invariant quintet under the independence assumptions used, or explicitly state where MHT is required.Maintain B.1 guarantees.

Consequences

Benefits

  • Audit‑ready costing: A single definition of Work makes multi‑scale totals consistent and comparable.
  • Separation of concerns: Control‑flow (Γ_method) never contaminates cost accounting (Γ_work).
  • Cross‑scale reliability: Partition/time additivity gives predictable roll‑ups from parts and phases.
  • Safety by design: WLNK gates reveal feasibility limits early; emergence is explicit via MHT.

Trade‑offs / mitigations

  • Boundary modelling effort: Requires explicit ports and stock deltas. Mitigation: use A.14 templates for common boundary patterns.
  • Vector heterogeneity: Mixed units can be hard to read. Mitigation: keep vectors typed; add equivalence maps only when justified in M_spec.
  • Independence discipline: Shared stocks complicate additivity. Mitigation: elevate stock accounting to the parent boundary per CC‑B1.6.7.

Rationale (informative)

Γ_work is a conservative algebra of spent resources. It respects physical conservation (mass/energy), supports information‑centric resources without conflation, and keeps the design‑time (MethodDescription) separate from run‑time (Work) facts (A.15). Additivity over disjoint boundaries and non‑overlapping phases is the minimal set of rules that yields stable cross‑scale accounting while remaining faithful to the universal invariants of B.1. Emergent efficiency (redundancy, substitution) is not “free”: it is made structural via Meta‑Holon Transition (B.2), after which the same algebra applies at the new level.

Relations

C.27 temporal-claim relation.

  • C.27 may flag: an authored claim that planned effort, actual effort trace, resource burn, effort window, resistance, or cost changes a temporal outcome.
  • This pattern keeps: Gamma_work actual work/resource aggregation; Gamma_time declared temporal slices and phase composition remain separate.
  • Non-admissible use: work logs, resource aggregation, or phase names do not by themselves infer acceleration, transition law, causal proof, or benchmark result.
  • Exit: use C.27 only for the temporal-claim adequacy question; use work/resource patterns for actual work evidence and cite dynamics, causal/evaluation, or benchmark patterns when those other questions are live.
  • Builds on: A.12 Transformer Principle; A.14 Mereology Extension (PortionOf, PhaseOf); A.15 Strict Distinction (MethodDescription / Method / Work).
  • Coordinates with: B.1.5 Γ_method (order and concurrency), B.1.4 Γ_time (temporal coverage), B.1.2 Γ_sys (system assembly).
  • Triggers: B.2 Meta‑Holon Transition (MHT): Recognizing Emergence and Re‑identifying Wholes when feasibility constraints (WLNK) are beaten by structural redundancy/substitution.
  • Feeds: B.3 Trust & Assurance Calculus (F–G–R with Congruence) (cost‑aware confidence overlays) — informative only, without altering Γ_work’s conservation semantics.

Summary for practitioners. Use Γ_method to say what happens and in which order. Use Γ_work to say what it costs across a boundary. Keep boundaries, time windows, units, yields, and transformers explicit. When apparent “free gains” appear, declare the structural change (MHT) and apply the same algebra one level up.

B.1.6:End

Meta‑Holon Transition (MHT): Recognizing Emergence and Re‑identifying Wholes

Plain‑English headline. When composition yields a new, coherent whole—with its own boundary, objective, and capabilities that cannot be faithfully treated as “just parts folded together”—declare a Meta‑Holon Transition. Record the event that created the new holon and let the Γ‑invariants apply anew at the higher level.

Problem frame

  • Universal composition (B.1) provides Γ‑flavours for structure (Γ_sys, Γ_epist), order (Γ_ctx/Γ_method), and time (Γ_time). These flavours preserve WLNK and MONO and—except for order/time cases—assume local commutativity.
  • Mereology (A.14) distinguishes ComponentOf / ConstituentOf (structure), SerialStepOf / ParallelFactorOf (order), and PhaseOf (temporal parts of the same carrier).
  • Strict Distinction (A.15) separates structure, order, time, cost, and values; we must not disguise emergence as arithmetic “optimism” or as a type error.
  • In practice, some compositions produce qualitatively new behaviour (e.g., a closed feedback loop enabling regulation; an integrated argument that becomes explanatory rather than merely descriptive). FPF names this Meta‑Holon Transition (MHT) and treats it as a first‑class modelling move.

FPF’s stance on identity across time is ecumenical: both 4D extensional and 3D+1 endurantist readings are admissible as long as the modeller makes identity and event boundaries explicit:

  • In 4D, a holon is a world‑tube; events are boundaries between temporal parts; PhaseOf picks out segments; an MHT marks a new tube beginning (re‑identification).
  • In 3D+1, a holon endures; events are state transitions; PhaseOf are time‑indexed states; an MHT marks creation of a new enduring entity and its relations to predecessors.

FPF does not force a metaphysical choice; it requires clear declarations so Γ‑proofs and B.3‑assurance remain unambiguous.

Problem

Without an explicit MHT pattern, four pathologies recur:

  1. Invariant evasion: When redundancy or coordination lifts performance above the weakest‑link bound, authors “massage” arithmetic instead of acknowledging new structure/closure.
  2. Identity drift: A system changes boundary, objective, or supervisory structure, yet the model silently treats it as the “same holon,” corrupting histories (Γ_time) and claims (B.3).
  3. Context leakage: A composite crosses a bounded context (new vocabulary, units, policy), but the model keeps scoring in the old context, inflating R_eff by ignoring congruence penalties.
  4. Order/time confusion: Genuinely order‑dependent synergies (Γ_ctx/Γ_method) or phase consolidations (Γ_time) are misrepresented as simple structural sums (Γ_sys), losing causal and temporal meaning.

Forces

ForceTension
Parsimony vs. ExpressivityKeep the core algebra small (A.11) ↔ Admit real emergence when closure or supervision appears.
Continuity vs. Re‑identificationPreserve identity across phases where warranted ↔ Re‑identify when boundary/objective/capability qualitatively change.
Local vs. SystemicLocal improvements should stay inside MONO ↔ System‑level novelties must restart invariants at a new level.
DDD familiarity vs. Ontological clarityReuse intuitions from bounded contexts and events ↔ Keep them mapped to FPF’s holons, boundaries, and transformers without tool‑specific semantics.

Solution — Part 1: What an MHT is, when to declare it, and how it relates to Γ

Definition (normative)

A Meta‑Holon Transition (MHT) is a declared event in which a configuration of holons—previously related by Γ‑composition in some flavour—is promoted to a new holon H⁺ with a new or revised:

  • Boundary (external interface and enclosure, per A.14/B.1.2),
  • Objective / Evaluation basis (what H⁺ tries to maintain/achieve), and/or
  • Supervisory structure / Capability (closed feedback, decision loop, policy enactment).

After MHT, the Γ‑invariants apply afresh to H⁺ and its parts. Prior assurance (B.3) remains valid for pre‑MHT claims; post‑MHT claims are assessed for H⁺ under its own boundary, objective, and context.

Didactic guard‑rail. If a perceived “synergy” is fully explainable within the current Γ‑flavour—e.g., by raising congruence CL, improving parts (MONO), or fixing order (Γ_ctx)—do not declare MHT. MHT is reserved for new closure or new supervision that changes what counts as “the whole”.

Triggers for declaring MHT (BOSC‑A‑T‑X)

Declare MHT when one or more of the following observable triggers occur (measurements are recorded in the promotion record):

  • B — Boundary closure/opening. A coherent external boundary emerges (e.g., internal interfaces encapsulated; single regulated port) or its type changes (open ↔ closed/permeable) such that the system’s external commitments are different.
  • O — Objective emergence/reframe. A new objective is instituted (e.g., regulation target introduced) or a prior objective becomes subordinate to a supervisory objective.
  • S — Structural re‑organization for supervision. New coordination channels or a feedback loop close a circuit that did not exist at the previous level, producing regulation or self‑maintenance.
  • C — Capability super‑additivity (beyond WLNK). Measured capability (or assurance) exceeds the weakest‑link bound without being explainable by improved parts or higher CL under the current Γ semantics.
  • A — Agency threshold crossing (A.13). The holon begins to play AgentialRole with an agency grade sufficient to maintain objectives autonomously; this lifts the system into a supervisory regime.
  • T — Temporal consolidation. Across Γ_time phases, properties consolidate into a qualitatively new regime (e.g., commissioning → operational service) that re‑anchors identity or boundary.
  • X — Context rebase (bounded context). The holon’s operative vocabulary/units/policy shift to a new bounded context (in DDD sense), requiring a new Assurance context and CL baselines.

Rule of thumb. BOSC touches what the holon is; A/T/X touch how and where it lives (agency, time, context). Any two of these together almost always warrant MHT.

Identity stance: 4D vs. 3D+1 (FPF’s ecumenical Standard)

FPF permits both readings provided you make identity and event claims explicit:

  • 4D Standard:

    • Pre‑MHT configuration is a set of world‑tube segments linked by Γ.
    • The MHT event marks the start of a new tube H⁺; earlier segments remain as precursors.
    • PhaseOf refers to temporal parts; events are boundaries between parts (and between tubes at MHT).
  • 3D+1 Standard:

    • Pre‑MHT configuration is an enduring holon with time‑indexed states.
    • The MHT event is a creation event for a new enduring holon H⁺; a mapping relates H⁺ to predecessors.
    • PhaseOf refers to states; events are transitions; MHT is a re‑identification point.

Normative bridge: Regardless of stance, you must (i) state whether identity continues (PhaseOf) or a new identity is created, and (ii) record the Transformer that performs the MHT.

Event taxonomy for MHT (small, reusable set)

To avoid ad‑hoc naming, choose one event type (or a pair) and fill its parameters:

  1. Fusion — several holons become H⁺ with a new boundary/objective/supervision.
  2. Fission — one holon splits into several peers, each with a proper boundary/objective.
  3. Phase Promotion — a Γ_time phase boundary coincides with BOSC‑A‑T‑X conditions; identity is re‑anchored to H⁺.
  4. Role‑Lift — the holon starts playing AgentialRole at or above a declared grade threshold (A.13), enabling supervision.
  5. Context Reframe — the holon’s bounded context shifts (terminology/units/policy), establishing H⁺ in the new context; mappings to the prior context are recorded.

These are Transformer events (A.12). They do not imply toolchains or storage; they are conceptual commitments with audit fields.

How MHT relates to Γ‑flavours and bounded contexts

  • With Γ_sys and Γ_epist (structure):

    • If measured capability or assurance exceeds WLNK under current semantics, and the excess cannot be explained by part improvements or CL increases, do not bend arithmetic—declare MHT.
    • After MHT, the new holon H⁺ re‑establishes its own WLNK/CL baselines.
  • With Γ_ctx and Γ_method (order):

    • If introducing order/joins creates a closed supervisory loop that maintains an objective (e.g., sense → decide → actuate), declare Role‑Lift or Fusion MHT.
    • If order simply fixes a previously mis‑modelled sequence, that is not MHT; it is a normal correction under Γ_ctx.
  • With Γ_time (phases):

    • Use PhaseOf for normal state progressions where identity continues.
    • If a phase boundary coincides with BOSC‑A‑T‑X, Phase Promotion MHT creates H⁺; histories remain linked but assurances are not silently merged.
  • With bounded contexts (DDD intuition):

    • A bounded context is a modelling Standard (vocabulary/units/policy). Crossing it without re‑baselining CL causes trust inflation.
    • Use Context Reframe MHT to re‑anchor H⁺ in the new context and declare the mappings; B.3’s congruence penalty Φ(CL) now refers to the new baseline.

What MHT is not (didactic contrasts)

  • Not a shortcut around WLNK/Φ. If synergy is explainable by raising CL or improving parts, stay within Γ and B.3.
  • Not every KPI jump. If the jump is within the declared envelope and context, no MHT is needed.
  • Not a version bump. Version changes (PhaseOf) with the same identity are Γ_time, not MHT.
  • Not “agent = new type.” Agency is a role (A.13); MHT only when role enactment changes closure/supervision at the system level.

Promotion Record & proof obligations (normative)

To declare an MHT you MUST create a Promotion Record that makes identity, boundary, objective, supervision, and context shifts explicit. This record extends the general proof kit in B.1.1.

Promotion Record — minimal fields

MHT.PromotionRecord
  id:                unique identifier
  eventType:         one of {Fusion | Fission | PhasePromotion | Role‑Lift | ContextReframe}
  transformer:       U.TransformerRole (who/what enacted the transition)
  identityStance:    one of {4D | 3D+1}
  preConfig:
    nodes:           list of holons (ids, kinds) involved before MHT
    edges:           list of relations & their types (A.14), including CL on integration edges
    Γflavour:        active Γ-flavour(s) prior to MHT
    assurance:       Assurance tuples for relevant claims before MHT (B.3)
    boundedContext:  name or description (vocabulary/units/policy) before MHT
  triggers:
    BOSC:            {B? O? S? C?} with measurements and evidence carriers
    A?               Agency-CHR grade & context (A.13)
    T?               Γ\_time phase boundary details (coverage, carrier identity/continuation)
    X?               context mapping summary (old↔new)
  postHolon (H⁺):
    boundary:        explicit BIC or equivalent boundary statement (B.1.2)
    objective:       objective(s) and evaluation basis for H⁺
    supervision:     supervisory/feedback structure present in H⁺ (if any)
    Γflavour:        Γ-flavour(s) intended for H⁺
    assurance:       initial Assurance(H⁺, C | K, S) with F/G/R & CL baselines
    boundedContext:  new context; mapping to previous (with CL for mappings)
  identityMapping:
    4D:              continuity/cut specification (precursors→H⁺ tube start)
    3D+1:            predecessor(s) and creation event; any PhaseOf segments preserved
  notes:
    alternativesConsidered:   why not modelled as non‑MHT Γ improvement
    EvidenceGraphRef:          references to measurements, specs, interface Standards, tests
    orderTimeRefs:            OrderSpec/TimeWindow if Γ\_ctx/Γ\_time material

Proof obligations specific to MHT

  • MHT‑BOSC‑EVD. For each selected trigger (B/O/S/C/A/T/X), attach the evidence carriers that evidence it (e.g., boundary Standard for B, policy/regulation objective text for O, controller‑plant diagram for S, capability measurement vs WLNK bound for C, Agency‑CHR record for A, phase coverage & carrier identity for T, context mapping & unit schemes for X).

  • MHT‑NO‑EVADE. Show that the observed improvement cannot be explained by within‑Γ moves alone: improved parts (MONO), raised congruence CL, corrected order (Γ_ctx), or richer phase coverage (Γ_time). If any of those suffice, MHT is not justified.

  • MHT‑ASS‑REBAS. Provide before/after assurance tuples (B.3) for the same typed claim(s) or justify claim changes; do not fuse design-time and run-time scopes.

  • MHT‑IDENT. State identity stance (4D or 3D+1) and the identity mapping (continuation vs new identity). Mixing stances in the same record is forbidden.

  • MHT‑CTX‑MAP. For ContextReframe, list the concept/unit/terminology mappings and their CL levels; record the new CL baseline for future aggregations.

Archetypal cases (worked, didactic)

System — Closed‑loop regulation emerges from components (Fusion / Role‑Lift)

  • Pre‑config: Plant, sensor, actuator exist; analyses show performance capped by WLNK path through the slowest actuator; interfaces calibrated at CL2. No supervisory closure.

  • Trigger: S (supervisory structure closes a feedback loop) and B (boundary now exports a single regulated interface; internal ports encapsulated). Capability exceeds prior WLNK bound without any part upgrade.

  • MHT: Declare Fusion (or Role‑Lift if the controller plays AgentialRole). Create H⁺ = RegulatedSystem with BIC exposing the regulated port and supervisory objective (“maintain y≈r”).

  • After: Γ‑invariants re‑start for H⁺. B.3 assurance uses a new cutset; congruence on controller–plant mapping is part of CL_min.

  • Why not within‑Γ? The performance jump is not due to improved parts or raised CL on existing edges; it stems from new closure.

Episteme — From compendium to theory (Fusion / ContextReframe)

  • Pre‑config: Several high‑quality results integrated as a catalogue; mappings among constructs are at CL1 (loose analogies).

  • Trigger: O (a unifying explanatory objective: predict & explain class Q), C (explanatory success beyond min of parts), X (terminology reframed around new primitives with verified mapping at CL2/CL3).

  • MHT: Fusion + ContextReframe to H⁺ = Theory_T with an explanatory objective; mappings to the prior compendium are documented.

  • After: Assurance for “explains Q within δ” starts at H⁺ with its own F_eff (may rise if formalized), G_eff (supported domain), and R_eff penalized by the new mapping CL.

Temporal — Commissioning → Operations (PhasePromotion)

  • Pre‑config: PhaseOf slices (install, calibrate, trial). Identity of the same carrier is maintained.

  • Trigger: T (phase boundary) plus B (boundary type changes: open commissioning ports are encapsulated) and O (objective shifts from “achieve acceptance tests” to “deliver service SLA”).

  • MHT: PhasePromotion creates H⁺ = System‑in‑Operation. Past phases remain as documented temporal parts; design‑time assurance is not mixed with run‑time assurance.

Context — Prototype → Certified product (ContextReframe)

  • Pre‑config: Prototype in a lab context with ad‑hoc units and informal safety claims.

  • Trigger: X (bounded context shifts to regulated environment), F rises (formal safety case), CL for unit/requirement mappings vetted.

  • MHT: ContextReframe to H⁺ = CertifiedProduct; new BIC and regulatory vocabulary become the baseline; earlier lab claims are not silently “ported”.

Certification Interface Example (Informative)

Conceptual signature (notation‑neutral):

certify(role, context, window, snapshot, options) → StateAssertion

Sketch. snapshot contains coordinates over the Role’s RCS (A.19). options may reference named NormalizationMethod(s)/NormalizationMethodInstance(s) and overlays used in evaluation. The resulting StateAssertion states the target state (by name), the checklist applied (by name), the verdict, the window, and (if used) the declared Bridge or NormalizationMethodInstance employed for translation. Intent. This example aids implementers; normative constraints on comparability, normalization, and evidence live in A.19 and C.16, not here.

Conformance Checklist (normative)

IDRequirementPurpose
CC‑B2.1An MHT MUST have a Promotion Record with fields in §5.1 completed and identityStance chosen.Avoid ambiguous identity shifts.
CC‑B2.2MHT MAY be declared only when at least one BOSC‑A‑T‑X trigger is evidenced and MHT‑NO‑EVADE holds.Prevent “emergence by arithmetic”.
CC‑B2.3Post‑MHT holon H⁺ MUST provide BIC (boundary), an objective statement, and (if present) a supervisory description.Re‑anchor what the whole is.
CC‑B2.4Pre‑ and post‑assurance MUST be reported as separate tuples (B.3).No DesignRunTag chimeras or context chimeras.
CC‑B2.5ContextReframe MHT MUST include the mapping set and CL levels; R_eff thereafter uses the new CL baseline.Make context explicit; reset penalties coherently.
CC‑B2.6PhasePromotion MUST state whether identity continues (4D: new tube start; 3D+1: new enduring holon) and justify the choice.Keep temporal semantics clear.
CC‑B2.7Role‑Lift MUST reference Agency‑CHR but MUST NOT use agency to bypass WLNK or CL penalties.Preserve safety invariants.

Anti‑patterns & repairs

Anti‑patternSymptomRepair
Emergence by averagingPost‑composition KPI > WLNK, justified by means/weightsDeclare MHT only if BOSC/S is met; otherwise raise CL or improve parts within Γ.
Invisible context hopNew units/terms silently adoptedUse ContextReframe; record mappings and CL; re‑baseline assurance.
Every phase = MHTEach version treated as a new holonUse PhaseOf for ordinary state progressions; reserve MHT for BOSC‑A‑T‑X.
Agency as typeIntroduce U.Agent and claim new identityKeep agency as role (A.13); MHT only if supervision/closure changes the whole.
Boundary amnesiaInterfaces changed but not recordedUpdate BIC; if external commitments change materially, declare MHT.
Order magicReordering steps treated as emergenceIf order fixes correctness (Γ_ctx), no MHT; only closed loops/supervision qualify.

Consequences

Benefits

  • Clarity & auditability. Distinguishes improvement within a level from creation of a new whole.
  • Invariant integrity. WLNK and CL penalties are preserved; when a new whole appears, invariants restart cleanly.
  • Method‑agnostic synergy. Works with both 4D and 3D+1 readings; dovetails with DDD’s bounded contexts and event‑centric modelling.
  • Easier assurance management. Pre/post claims are comparable without being conflated; teams can plan targeted moves (raise CL, formalize, reframe context).

Trade‑offs

  • Extra documentation at the right time. Declaring MHT is deliberate; it requires a Promotion Record and evidence.
  • Identity bookkeeping. Teams must choose an identity stance and be consistent; this cost buys cross‑scale coherence.

Rationale (informative)

  • Systems & control: Closing feedback creates new closed‑loop properties not attributable to parts alone; treating this as an MHT avoids “synergy by arithmetic” and aligns with classical supervisory control and contemporary active‑inference views (A.13).
  • Mereology & identity: By remaining ecumenical (4D or 3D+1) but Standardual about identity declarations, FPF stays compatible with traditions akin to BORO (4D‑leaning) and CCO (endurantist uses), while keeping proofs unambiguous.
  • DDD/Event‑centric modelling: Popular practices (bounded contexts, event storming) pivot on events and context boundaries. MHT makes such events first‑class in FPF, turns context hops into explicit ContextReframe transitions, and ties them to assurance via CL baselines.
  • Assurance discipline: Re‑baselining F/G/R and CL at MHT points prevents cross‑context overconfidence and enables principled improvement plans.

Relations

  • Builds on: A.12 (Transformer), A.13 (AgentialRole & Agency‑CHR), A.14 (Mereology Extension), A.15 (Strict Distinction); B.1.x (Γ flavours), B.3 (Assurance).
  • Used by: B.4 (Evolution Loops: MHT as macro‑steps on the loop), KD‑CAL action patterns (when re‑framing models/theories).
  • Complements: B.1.4 (Γ_ctx/Γ_time) by distinguishing order/phase corrections from emergence; B.1.2/B.1.3 by restarting compositional invariants at the new level.

One‑sentence takeaway. Declare MHT when closure, supervision, or context re‑base creates a new whole; document the event, reset invariants, and keep pre/post assurance cleanly separated.

B.2:End

| B.2.1 | BOSC Triggers | Boundary • Objective • Supervisor • Complexity. |

Meta-System Transition (MST)

Problem Frame

The universal pattern for emergence, Meta-Holon Transition (MHT, Pattern B.2), describes how a collection of holons can become a new, coherent whole. This sub-pattern, MST (Sys), details the specific case where the constituent parts are physical or cyber-physical systems (U.System). This is the classic scenario of emergence in engineering and nature: a collection of robots forming a swarm, a group of servers becoming a self-healing cloud platform, or a set of components assembling into a functioning engine.

While the general principles of MHT apply, U.Systems have unique properties—such as physical boundaries, energy flows, and operational interfaces—that make their transitions distinct and require specific triggers and Standards.

Problem

When a collection of systems begins to coordinate, managers and engineers face a critical decision point. If they continue to treat the aggregate as just a "bag of parts," they fall victim to several pathologies:

  1. Reductive Blindness: They miss emergent, system-level hazards (like cascade failures or swarm oscillations) because their analysis remains focused on individual component reliability.
  2. Accountability Vacuum: There is no clear responsible role for the collective's behavior. When the swarm fails, who is responsible? The operator of drone A or drone B?
  3. Invalid Assurance Transfer: A safety case or performance guarantee that was valid for an individual system may be silently invalidated by its interactions within the collective, but this goes unnoticed.

Forces

ForceTension
Local Autonomy vs. Global CoherenceHow to allow individual systems to operate efficiently while ensuring their actions contribute to a stable and predictable collective goal.
Bottom-up Emergence vs. Top-down DesignIs the new meta-system an unplanned, emergent phenomenon to be managed, or a deliberately designed system-of-systems to be constructed?
Performance vs. PredictabilityTightly coupled coordination can unlock new capabilities, but it can also introduce complex, hard-to-predict failure modes.

Solution

An MST (Sys) is a formal promotion of an aggregate of U.Systems to a new, single U.System holon. This promotion is not a subjective decision; it is a mandatory modeling step triggered when the aggregate demonstrably satisfies the B-O-S-C criteria, adapted for systems.

The B-O-S-C Triggers for Systems

The four triggers from the parent MHT pattern are interpreted in the context of physical and cyber-physical systems:

TriggerSystem-Specific InterpretationManager's View: The "Go/No-Go" Question
B - Boundary ClosureThe aggregate now exposes a single, unified operational interface (e.g., a single API gateway, a master control port). Internal system-to-system interactions are encapsulated and hidden from the outside world."Can I now operate this entire collection through a single dashboard or Standard, without having to talk to each individual part?"
O - Objective EmergenceThe collective pursues a new, measurable operational objective that did not exist for any individual system (e.g., maintaining a formation, maximizing fleet-wide energy efficiency, minimizing global latency)."Is this group now working towards a shared goal that is fundamentally different from what each member was doing alone?"
S - Supervisor EmergenceA new control loop appears. The collective state is measured, and this information is used to actively regulate the behavior of the individual systems to achieve the new objective."Is there a mechanism—whether a central brain or a distributed consensus—that is actively steering the parts to work together?"
C - Complexity ThresholdThe number and intensity of interactions between systems cross a point where reasoning about them as a whole is simpler and more predictive than tracking every pairwise interaction."Have we reached the point where trying to manage every individual interaction is causing more problems than it solves?"

When all four conditions are met, the collection must be re-identified as a new U.System via the emergesAs relation.

Didactic Note for Managers: From "A Bunch of Drones" to "The Swarm"

An MST is the formal moment when you stop managing a collection of individual assets and start managing a new, single capability.

  • Before MST: You have ten individual drones. You manage ten maintenance schedules, ten flight plans, ten risk assessments. Your primary concern is the reliability of each drone.
  • After MST: You have one search-and-rescue swarm. You manage one mission objective (e.g., "cover this area"), one collective health metric, and one set of swarm-level risks (e.g., "risk of collective oscillation").

Declaring an MST is an act of architectural honesty. It forces you to update your management, assurance, and governance models to match the new reality that has emerged.

Archetypal Grounding

DomainConstituent U.SystemsEmergent Meta-System (U.System)Key Trigger Evidence (B-O-S-C)
Cloud ComputingA set of independent, containerized microservices.An autonomous cloud platform.B: A single API gateway and control plane now mediate all external traffic. O: A new system-wide SLO (Service Level Objective) for end-to-end latency is enforced. S: A Kubernetes-like orchestrator (the supervisor) actively schedules, scales, and heals the microservices based on global metrics. C: The number of services exceeds a threshold where manual pairwise management is no longer feasible.
RoboticsA group of individual, autonomous drones with local navigation rules.A search-and-rescue swarm.B: The swarm communicates with the operator via a single command channel. O: A new objective emerges: "collaboratively map and cover a designated area," which no single drone pursued. S: A distributed leader-election and formation-control algorithm acts as the supervisor. C: Swarm behavior becomes stable and predictable only above a certain number of drones (e.g., > 7).
Socio-TechnicalA group of engineers from Development, QA, and Operations working in separate silos.A cohesive DevOps team.B: The team now presents a single interface to the business: a unified backlog and a single "definition of done." O: A new collective objective appears: "reduce the cycle time from idea to deployment to less than 24 hours." S: The daily stand-up and CI/CD pipeline act as a supervisory feedback loop, regulating the work of all members. C: The complexity of coordinating the three functions separately became a bottleneck.

Conformance Checklist

  • CC-B2.2.1 (Trigger Mandate): An emergesAs relation for a set of U.Systems MUST be justified by a Promotion Record (Pattern B.2) that provides evidence for all four B-O-S-C triggers.
  • CC-B2.2.2 (System-Holon Mandate): Both the constituent parts and the resulting meta-system MUST be modeled as U.System holons, not as abstract U.Epistemes or U.Methods.
  • CC-B2.2.3 (Supervisor Mandate): The emergent meta-system MUST contain an identifiable supervisory component or mechanism that implements the feedback loop. The architecture of this loop is further detailed in Pattern B.2.5.
  • CC-B2.2.4 (Boundary Inheritance): The boundary of the new meta-system MUST be formally derived from the boundaries of its constituent systems, following a declared Boundary-Inheritance Standard (Pattern B.2.3, forthcoming).

Common Anti-Patterns and How to Avoid Them

Anti-PatternManager's View: What It Looks LikeHow FPF Prevents It (Conceptually)
The "Big Bag of Parts"A collection of systems is given a collective name (e.g., "The Platform"), but there is no unified interface, no shared objective, and no active coordination.CC-B2.2.1 requires evidence for all four B-O-S-C triggers. A simple collection without boundary closure or a supervisory loop does not qualify for MST. It remains an aggregate, not a meta-system.
The "Emergence by Fiat"A manager declares that a new, synergistic capability has emerged, but there is no underlying mechanism to sustain it. The "improvement" is a temporary artifact of heroic effort, not a stable property of the system.CC-B2.2.3 mandates the existence of an identifiable supervisor. If there is no feedback loop to maintain the new behavior, no MST has occurred.
The "Hidden God-Controller"A system appears to be a self-organizing swarm, but its behavior is actually dictated by a hidden, external, centralized controller that is not part of the model.The FPF's Transformer Principle (A.12) and Boundary rules (A.1) require that all external influences are made explicit. The controller must either be modeled as part of the meta-system (and thus inside its new boundary) or as an external Transformer.

Consequences

BenefitsTrade-offs / Mitigations
Makes Emergence Manageable: The pattern transforms emergence from a mysterious, unpredictable phenomenon into an explicit, auditable architectural event. This allows managers to assign responsibility, budget, and assurance targets to the new meta-system.Modeling Overhead: Formally documenting an MST and its new Standards requires deliberate modeling effort. Mitigation: This effort is an investment that pays off by preventing the much higher cost of managing the risks associated with un-recognized emergence.
Enables Scalable Assurance: By re-applying the FPF's assurance calculus at the new meta-level, the framework can provide meaningful safety and reliability guarantees for complex systems-of-systems.-
Provides a Language for Innovation: The pattern gives architects and strategists a formal language for designing and reasoning about adaptive, self-organizing, and resilient systems.-

Rationale

This pattern provides the concrete instantiation of the universal MHT principle for the domain of systems. It is grounded in decades of research in cybernetics (Ashby's law of requisite variety), complexity science, and modern systems-of-systems engineering. By demanding evidence of Boundary Closure, a Novel Objective, and a Supervisory Loop, the pattern provides a robust, falsifiable filter that separates true emergence from mere aggregation.

It ensures that when we claim a system has "emergent properties," we are not making a vague, philosophical statement, but a precise, testable, architectural one. This rigor is essential for building trustworthy and manageable complex systems.

Relations

  • Is a specialization of: B.2 Meta-Holon Transition (MHT).
  • Is complemented by: B.2.3 MET (KD) (for epistemic emergence).
  • Provides the context for: B.2.5 Supervisor–Subsystem Feedback Loop, which details the architecture of the supervisory mechanism.

B.2.2:End

Meta-Epistemic Transition (MET)

Type: Architectural (A) Status: Stable Normativity: Normative (unless explicitly marked informative)

Problem frame

A library is not a theory.

Γ_epist (B.1.3) can reliably aggregate and audit evidence, but aggregation alone does not create a supervising core. A MET names the point where a Transformer re‑identifies a portfolio as one higher‑order episteme with an explicit boundary, objective, and supervisory principles.

Teams often accumulate a large portfolio of reliable knowledge epistemes or publications—papers, models, datasets, design notes, incident reviews, forecasts—and assume that “more” automatically becomes “better understanding”. But at scale, portfolios fracture into incompatible vocabularies, duplicated assumptions, and local optimisations. Decision-makers then face a choice: keep managing a tangled collection, or deliberately synthesize it into a single, higher-order episteme.

FPF names that synthesis event a Meta‑Epistemic Transition (MET): the formal moment when a collection of U.Epistemes is promoted to a new U.Episteme holon that has its own boundary, objective, and supervisory principles.

Problem

Without a formal concept of a Meta‑Epistemic Transition, knowledge programs tend to fall into predictable failure modes:

  1. The “List of Facts” illusion. A collection of well‑validated epistemes is mistaken for a coherent theory. The “whole” is treated as the sum of parts, and the opportunity for a unifying insight is missed.
  2. Hidden incoherence. Contradictions between epistemes are ignored, averaged away, or left unresolved. The result is a fragile collage, not a durable framework.
  3. Flat explanatory power. The portfolio can describe phenomena, but cannot explain them through shared principles. There is no “supervisor” that tells the parts how to compose.

Forces

ForceTension
Synthesis vs. aggregationA true synthesis creates new meaning ↔ a mere aggregation is an index, review, or catalog.
Purity vs. integrationPreserve the integrity and local reliability of each episteme ↔ integrate across different assumptions, scopes, and vocabularies.
Creativity vs. rigorA unifying theory is an abductive leap ↔ it must remain auditable and bound to evidence (no “narrative by fiat”).

Solution

A Meta‑Epistemic Transition is modeled as a Meta‑Holon Transition (B.2) specialized to knowledge epistemes or publications (typically starting from a Γ_epist portfolio and ending in a new U.Episteme holon).

Definition (normative)

A MET is a declared MHT event in which a configuration of U.Epistemes (often managed as a Γ_epist portfolio) is promoted to a new, single U.Episteme holon via the emergesAs relation.

  • A MET is an act of creation, not passive drift. Therefore the emergesAs relation MUST be attributed to an explicit external Transformer (A.12) that performed the synthesis.
  • A MET declaration MUST be supported by a Promotion Record (B.2:5.1) containing explicit evidence for the B‑O‑S‑C triggers (B.2.1), interpreted for epistemes as below. The record still carries the parent schema fields (eventType, identityStance, and the explicit preConfig/postHolon deltas); do not “compress” MET into a narrative paragraph.
  • If the synthesis introduces new primitives/terms (i.e., it reframes the vocabulary rather than only summarising), the Promotion Record SHOULD treat the event as a ContextReframe (or, where the local taxonomy permits paired types, Fusion + ContextReframe) and MUST satisfy MHT‑CTX‑MAP: include the context mapping summary (triggers.X?) and record the new boundedContext plus its CL baseline in postHolon.boundedContext (B.2:5.1, B.2:5.2).
  • Post‑MET trust/assurance for the new meta‑episteme MUST be evaluated as a claim about a new holon, not silently inherited from the constituents: satisfy MHT‑ASS‑REBAS and apply congruence penalties when composing evidence across constituents (see B.2:5.2 and B.3).

The B-O-S-C triggers for epistemes

The four B‑O‑S‑C triggers are interpreted in the context of knowledge epistemes or publications.

C note. Across the MHT family, C appears in two adjacent readings: (i) Complexity threshold (manageability of a growing patchwork), and (ii) capability/explanatory excess beyond a WLNK bound (the core MHT narrative). This MET pattern uses the Complexity threshold reading by default; if you claim explanatory/predictive super‑additivity, record it explicitly as the triggers.BOSC.C evidence and tie it to the emergent objective (O) and supervisor (S) (do not treat it as a shortcut around assurance rebasing).

TriggerEpistemic-specific interpretationManager’s view: the “Go/No-Go” question
B — Boundary closureThe collection is presented under a single conceptual boundary: a name, a unified vocabulary, stable definitions, and a shared symbolic representation. It becomes citable as one meta-episteme.“Can we refer to this with a single name and reliably mean the same meta-episteme across the organisation?”
O — Objective emergenceA unifying explanatory or predictive objective emerges that none of the individual epistemes could satisfy alone. The whole answers a bigger question.“Does this synthesis let us explain or predict something that the parts could not?”
S — Supervisor emergenceA set of meta-principles, axioms, invariants, or core values is introduced that governs how constituent epistemes are interpreted and composed.“Is there now a ‘golden rule’ that tells us how the pieces fit together?”
C — Complexity thresholdThe web of parts, exceptions, and interrelations becomes more complex to manage than a unifying abstraction. The meta‑episteme is simpler than the patchwork.“Are we drowning in edge cases and local fixes, such that a single framework is now the simpler option?”

When a Transformer can provide evidence for all four triggers, it can formally declare a MET, creating a new U.Episteme via emergesAs.

In practice, many METs also involve X (context rebase) when vocabulary or definitions change. When that happens, the Promotion Record MUST carry triggers.X? and satisfy MHT‑CTX‑MAP (B.2:5.2).

Didactic note for managers (informative)

From a pile of bricks to a cathedral Before a MET, you have a pile of valuable bricks: reports, models, datasets. Each brick is useful, but they do not yet form a structure. After a MET, a Transformer has built a cathedral: a coherent framework with a name (Boundary), a purpose (Objective), and guiding architectural principles (Supervisor). A portfolio becomes capital only when it can be reused as one thing.

Common anti-patterns and how to avoid them (informative)

Anti-patternWhat it looks likeHow FPF prevents it
“Grand unifying narrative” fallacyA broad summary write-up is called a “new theory”, but it adds no new explanatory principle and no new predictive objective.The MET declaration requires evidence for O and S, not just summarisation. Without those triggers, the collection remains an aggregate.
“Forced marriage” of ideasConflicting epistemes are merged into an incoherent hybrid.A MET is not a mechanical merge. The Transformer must supply a supervisory principle that reconciles or contextualises the constituents, and the trust model (B.3) penalises incoherent integration via congruence penalties.
“Ivory tower theory”A beautiful synthesis is detached from evidence; it produces no testable constraints.The resulting U.Episteme is subject to the same assurance discipline as any other: explicit rebasing (MHT‑ASS‑REBAS) and congruence penalties apply; speculative synthesis remains low‑R_eff until supported.

Archetypal Grounding

System vignette (Tell–Show–Show)

Tell. A programme team has many operational dashboards, runbooks, and service metrics. Leaders call it “observability”, but each service still uses incompatible definitions and locally optimised alerts.

Show A (pre‑MET). Each team maintains its own “SLO”, “incident”, and “error budget” episteme; cross-team comparisons are mostly rhetorical, and improvements do not transfer reliably.

Show B (post‑MET). A Transformer (a standards group inside the organisation) publishes a single, named reliability doctrine with shared definitions, a unified objective (“predict and reduce user‑visible harm”), and a small set of invariants that govern interpretation (“measure what users experience”, “alerts must be actionable”). The doctrine is treated as one U.Episteme that supervises and constrains the constituent local practices.

Episteme vignette (cross-domain table)

DomainConstituent U.EpistemesEmergent meta-episteme (U.Episteme)Key trigger evidence (B‑O‑S‑C)
PhysicsLorentz transformations; equivalence principle; Mercury perihelion anomalies; Maxwell’s equations.General Relativity.B: A single name + coherent formalism. O: Gravity as spacetime geometry. S: Covariance + equivalence act as supervisory axioms. C: Patching classical mechanics became untenable.
Software developmentIterative development; user stories; daily coordination rituals; continuous integration; pair programming.Agile as a coherent body of practice.B: Shared “Agile” boundary and vocabulary. O: A unifying objective around adaptability and feedback. S: Manifesto values/principles supervise local practices. C: Waterfall coordination costs exceeded a threshold.
Business strategyMarket analysis; competitor intelligence; capability assessments; technology forecasts.A cohesive multi‑year corporate strategy.B: Single authoritative strategy publication. O: One overarching objective (e.g., leadership in a segment). S: Strategic pillars supervise execution plans. C: Disconnected departmental plans created unmanageable complexity.
Machine learning (post‑2015)Self‑supervised representation learning; attention mechanisms; large‑scale pretraining; prompt‑conditioning practices.The foundation‑model paradigm (general‑purpose pretrained models with downstream adaptation).B: A stable shared name and vocabulary. O: General-purpose representations enabling many tasks. S: Scaling laws and adaptation protocols supervise model development and use. C: Bespoke task-by-task pipelines became too complex to maintain.

Bias-Annotation

Lenses tested: Gov, Arch, Onto/Epist, Prag, Did. Scope: Universal for MET declarations over U.Episteme holons (knowledge synthesis events), not for all MHT types.

  • Gov. Bias toward explicit responsibility: a named Transformer is responsible for the synthesis claim. Mitigation: require a Promotion Record with evidence, so responsibility is auditable rather than merely social.
  • Arch. Bias toward structural comparability: MET is forced through the same BOSC trigger skeleton as other MHTs. Mitigation: the trigger interpretations are explicitly epistemic and do not pretend to be operational or physical.
  • Onto/Epist. Bias toward clarity about “what the new thing is”: the meta‑episteme is a first‑class U.Episteme holon with a supervisory core. Mitigation: avoid implying that synthesis increases truth; it only changes organisation and explanatory structure until evidence raises trust.
  • Prag. Bias toward actionability: the “Go/No‑Go” questions are framed for managers who need to allocate funding and responsibility. Mitigation: conformance criteria still force evidence binding and do not reduce MET to a narrative decision.
  • Did. Bias toward teachability: the “bricks→cathedral” metaphor may over‑romanticise synthesis. Mitigation: anti‑patterns explicitly warn against rhetoric without BOSC evidence.

Conformance Checklist

  • CC-B2.3.1 (Transformer mandate): A Meta‑Epistemic Transition MUST attribute the emergesAs relation to an explicit external Transformer (e.g., a research team, a standards body, a synthesis agent). Constituent epistemes do not self‑organise into a promoted holon.
  • CC-B2.3.2 (Trigger mandate): The Transformer MUST provide a Promotion Record (B.2) containing evidence for all four epistemic B‑O‑S‑C triggers.
  • CC-B2.3.3 (Episteme-holon mandate): Both the constituents and the resulting meta‑episteme MUST be modeled as U.Episteme holons.
  • CC-B2.3.4 (Supervisory principle mandate): The emergent meta‑episteme MUST contain one or more identifiable supervisory principles (axioms, invariants, core values) that govern how its constituents are interpreted and composed.
  • CC-B2.3.5 (Assurance re-baseline): Any trust/assurance statement about the post‑MET meta‑episteme MUST be evaluated as a claim about a new holon and MUST NOT be asserted by silent inheritance from constituent R values.
  • CC-B2.3.6 (Context reframe mapping): If the MET introduces new primitives/terms or changes definitions, the Promotion Record MUST satisfy MHT‑CTX‑MAP (B.2:5.2): list concept/unit/terminology mappings with CL levels and record the new boundedContext and its CL baseline.

Consequences

BenefitsTrade-offs / mitigations
Raises epistemic leverage. A coherent meta‑episteme makes future reasoning and reuse cheaper and safer than managing a patchwork.High cognitive effort. A MET is not routine. Mitigation: the trigger checklist is intentionally strict so the label is reserved for real synthesis.
Creates stable foundations. A well‑formed meta‑episteme can become a high‑R_eff platform for incremental work.Early fragility. New syntheses are initially more speculative. Mitigation: conservative assurance and explicit congruence penalties keep trust inflation in check.
Improves governance. Responsibility, maintenance, and change control become assignable to a single promotion record.Modeling overhead. Promotion Records take time. Mitigation: the cost is paid once, and prevents repeated “reinvent the framework” cycles.
Guides innovation. BOSC becomes a deliberate target for R&D teams (“what would count as a unifying supervisor?”).Risk of rhetoric. Synthesis can be oversold. Mitigation: anti‑patterns and conformance criteria explicitly block narrative‑only declarations.

Rationale

The most important leaps in human capability often come from re‑organising knowledge, not from adding more facts. MET is the architectural name for that re‑organisation.

By defining a Meta‑Epistemic Transition using observable triggers and an explicit Transformer, FPF gives a rigorous, non‑mystical account of paradigm‑level synthesis. It ensures that “unification” is not merely a rhetorical flourish, but a declared event with auditability and downstream governance consequences.

SoTA-Echoing

This section aligns MET with post‑2015 state‑of‑the‑art practice in evidence synthesis, knowledge representation, and science‑of‑science.

Claim (MET need)SoTA practicePrimary source (post‑2015)Alignment with METAdoption status
Synthesis must be auditable, not rhetorical.Structured evidence-synthesis reporting and traceability norms.PRISMA 2020 / PRISMA 2020 Statement (Page et al., 2021).MET’s Promotion Record mirrors the idea that a synthesis claim needs explicit evidence and structure, but goes beyond reporting by requiring BOSC triggers and a supervising core.Adopt/Adapt. Adopt traceability discipline; adapt by adding BOSC and explicit Transformer attribution.
A synthesis should be continuously maintainable, not “one‑off”.Living systematic reviews / living guidelines (continuous updating under evidence drift).Living systematic review methodology (e.g., Elliott et al., 2017; and later living-review guidance).MET’s governance consequence (“assign responsibility and maintenance”) matches the living-review premise: the synthesis is a managed asset, not a static report.Adapt. Same maintenance intent; MET is broader than health-science review protocols.
Knowledge should be representable as composable claim networks.Scholarly knowledge graphs capturing claims, evidence, and relations.Open Research Knowledge Graph (ORKG) work (e.g., Jaradeh et al., 2019 and follow-on primary publications).MET treats the resulting synthesis as a new U.Episteme holon that supervises constituents; claim‑graph representations are compatible as carriers, but MET adds explicit emergence criteria.Adopt/Adapt. Adopt claim-network representation; adapt by requiring BOSC evidence for promotion.
Paradigm-level shifts have measurable structural signatures.Science‑of‑science models of how fields reorganise and consolidate.“Science of science” synthesis (Fortunato et al., 2018).MET’s C trigger (“complexity threshold”) and B trigger (“boundary closure”) correspond to consolidation signatures, while MET insists on explicit responsibility via Transformer.Adapt. Use the descriptive lens as grounding, but keep the MET declaration normative and responsibility‑bound.

Relations

  • Is a specialization of: B.2 Meta-Holon Transition (MHT).
  • Builds on: B.2.1 BOSC Triggers and the B.2 Promotion Record.
  • Is complemented by: B.2.2 MST (Sys) (system emergence) and B.2.4 MFT (capability emergence).
  • Is performed by: An external Transformer (A.12) executing an abductive synthesis (see B.5.2 for abductive moves).
  • Produces: A new U.Episteme whose trust/assurance is governed by B.3 Trust & Assurance Calculus.

B.2.3:End

Meta-Functional Transition (MFT)

Problem Frame

The FPF framework provides distinct patterns for the emergence of new systems (MST for U.Systems) and the synthesis of new knowledge (MET for U.Epistemes). However, a third, equally critical form of emergence occurs in the operational domain: the evolution of capability. Holons, particularly Transformers executing AgentialRoles, do not just exist or represent knowledge; they act. These actions are guided by Methods, which represent their capabilities.

Initially, an organization or an autonomous system might possess a portfolio of simple, disconnected methods—individual skills or atomic operational procedures. For example, a software team has separate methods for writing code, running tests, and deploying release carriers. A manufacturing system has distinct methods for milling, drilling, and painting. These are executed as discrete tasks, often with manual hand-offs and coordination.

However, through learning, automation, and process refinement, a collection of these simple functions can crystallize into a single, cohesive, and often adaptive composite U.Method. This emergent capability is more than just a sequence of the original steps; it possesses its own internal logic, objectives, and regulatory mechanisms. FPF formally calls this event a Meta-Functional Transition (MFT). It is the birth of a new, integrated operational capability.

Problem

If we lack a formal concept to describe the emergence of integrated capabilities, our models of complex operations remain fundamentally incomplete. We can describe the parts and the raw materials, but not the "well-oiled machine" itself. This conceptual gap leads to several severe, practical problems:

  1. Capability Blindness: The model cannot distinguish between a "bucket of skills" and a true "integrated capability." A team that can perform tasks A, B, and C independently is modeled identically to a high-performance team that has mastered a new, synergistic workflow combining A, B, and C. The emergent value created by integration remains invisible and unmanageable.
  2. Siloed Optimization and Global Sub-optimization: Without a formal representation of the composite U.Method, improvement efforts inevitably focus on the individual steps. A team might spend weeks making Method_A 10% faster, while the real bottleneck lies in the manual, error-prone hand-off between Method_A and Method_B. The team is locally efficient but globally ineffective.
  3. Implicit Coordination and "Tribal Knowledge": The critical coordination logic that weaves simple methods into a complex, adaptive workflow remains unstated. It lives in the heads of a few key individuals or is buried in un-documented scripts. This "tribal knowledge" is impossible to audit, transfer to new team members, or reliably improve. When a key person leaves, the emergent capability dissolves.
  4. Inability to Govern Complex Workflows: Without a formal holon representing the entire workflow, it is impossible to assign a clear responsible role, define end-to-end performance objectives, or create an assurance case for the workflow's reliability as a whole.

Forces

ForceTension
Component Skills vs. Integrated CapabilityHow to represent the qualitative leap from a set of individual, executable functions to a single, coherent, and often adaptive composite U.Method that possesses properties not found in any of its parts.
Prescription vs. PerformanceThe MethodDescription (the "recipe") describes how a method should be performed, but the MFT is about the emergence of the actual, reliable capability to perform it at run-time, often in ways that are more adaptive than the static recipe.
Decomposition vs. SynergyHow to model a composite U.Method that is demonstrably more than the sum of its parts, possessing new regulatory and synergistic properties, without violating the conservative Weakest-Link principle where it still applies.
Explicit Design vs. Emergent OrderIs the new meta-method a result of a deliberate, top-down design effort, or did it emerge bottom-up from the interactions of agents adapting to their environment? The framework must be able to model both pathways.

Solution

An MFT is a formal promotion of a set of U.Methods into a new, composite U.Method. This new U.Method is often referred to descriptively as a "meta-method" because of its supervisory role, but it remains a U.Method in type, preserving ontological parsimony. The transition is a change in the operational reality of a Transformer or a collective of Transformers. It is declared when the performance of the methods satisfies the B-O-S-C triggers, adapted for function and capability.

The B-O-S-C Triggers for Methods/Functions

The four triggers from the parent MHT pattern are interpreted in the operational context of methods and functions:

TriggerFunctional InterpretationManager's View: The "Go/No-Go" Question for Declaring a New Capability
B - Boundary ClosureThe set of methods now exposes a single, unified functional interface. An external agent can invoke the entire workflow via a single, well-defined call (e.g., "initiate deployment"), without needing to know about or coordinate the individual internal steps."Can I now ask the team to 'run the deployment process' as a single, black-box service, or do I still have to personally manage the hand-offs between coding, testing, and release?"
O - Objective EmergenceA new, operational objective for the entire workflow emerges, which is not merely the sum of the objectives of the individual steps. This is often a holistic, end-to-end performance goal (e.g., "achieve a 99.9% success rate for the entire process")."Is the team now optimizing for the success of the entire workflow, even if it means one individual step has to run 'sub-optimally' (e.g., slower) for the good of the whole?"
S - Supervisor EmergenceA new coordination and control logic (the "supervisor") appears. This mechanism orchestrates the execution of the individual methods based on the state of the overall workflow. This "meta"-property is modeled via controls or supervises relations."Is there a concrete mechanism—whether it's a CI/CD orchestrator, a formal team protocol, or a project manager's explicit control board—that is now actively managing the flow and making decisions between the steps?"
C - Complexity ThresholdThe cognitive or coordination overhead of manually managing the individual methods becomes a significant bottleneck. The cost of not integrating outweighs the cost of creating and maintaining the new, integrated workflow."Have we reached the point where the time we spend in meetings coordinating the hand-offs is taking more time and energy than the actual work itself?"

When a Transformer's performance demonstrates sustained evidence for all four triggers, an MFT has occurred. The Transformer now possesses a new, emergent composite U.Method.

Didactic Note on "Meta-" vs. "Supra-": We use the prefix "Meta-" descriptively (as in a "meta-method") to signify the emergence of a new layer of control and reflection. A U.Method resulting from an MFT is not just a larger method; it is a method that manages and orchestrates other methods. This supervisory property is modeled through relations, not by creating a new U.MetaMethod type. This preserves ontological parsimony (Pillar C-5) by recognizing that the position in a control hierarchy is a relational property, not a change in fundamental type.

Didactic Note on Terminology: "Process," "Workflow," "Function" vs. FPF's Method and Work

The terms "process," "workflow," "function," and "work process" are notoriously overloaded. FPF resolves this ambiguity by mapping these common terms to its precise, distinct concepts, in alignment with Pattern A.15.

Your Domain's TermHow FPF Models ItThe Core Distinction
Workflow, Work Process, Function (as a sequence of steps)As a U.MethodThis is the run-time capability or "role-mask" for work, enacted by a Transformer. It describes how an action is performed.
The description of a workflow, a Standard Operating Procedure (SOP), an algorithmAs a U.MethodDescriptionThis is the design-time episteme that documents the Method. It is the recipe, not the cooking.
The actual execution of the workflow, an operation, a jobAs a U.WorkThis is the run-time occurrence—the event of the Method being performed, which consumes resources.

The Meta-Functional Transition (MFT) described in this pattern is about the emergence of a new, composite U.Method. It is a transition in the capability to act, not just in the documentation or in a single execution.

Archetypal Grounding

The emergence of a new, composite U.Method is a universal pattern of learning and organization. It can be observed in technical, biological, and social domains.

DomainConstituent U.MethodsEmergent Composite U.Method ("Meta-Method")Key Trigger Evidence (B-O-S-C)
Software EngineeringA set of discrete developer methods: WriteCode, RunUnitTests, CommitToCG‑SpecS, ManualDeploy.An automated Continuous Integration/Continuous Delivery (CI/CD) Pipeline.B: A single interface ("trigger pipeline") now executes the entire sequence. O: A new objective emerges: "maintain the main branch in a perpetually deployable state." S: The CI/CD orchestrator (e.g., GitHub Actions, Jenkins) acts as the supervisor, automatically sequencing steps and handling failures. C: The overhead of manual coordination became a bottleneck to frequent releases.
Cognitive Science (Learning)A novice driver's individual methods: CheckMirrors, PressClutch, ChangeGear, Steer.The expert driver's fluid, integrated Method of "Driving".B: The actions become a single, seamless behavior. O: A new, holistic objective appears: "navigate traffic smoothly and safely," replacing the focus on individual mechanical steps. S: The driver's cerebellum and basal ganglia form a "supervisor," coordinating the motor actions subconsciously. C: Conscious management of each step is too slow for real-world traffic.
Organizational DesignSeparate, siloed methods in a company: MarketingCampaign, SalesPitch, CustomerOnboarding.An Integrated "Go-to-Market" Method.B: A single cross-functional team is responsible for the entire customer journey from lead to active user. O: A new objective is set: "maximize customer lifetime value (LTV)." S: A shared set of KPIs and a weekly cross-functional sync meeting act as the supervisory loop. C: The "leaky bucket" problem, where customers were lost in the hand-offs between departments, became too costly.

Conformance Checklist

  • CC-B2.4.1 (MFT Declaration Mandate): The emergence of a composite U.Method with supervisory properties MUST be declared as an MFT and justified with a Promotion Record (Pattern B.2) that provides evidence for the B-O-S-C triggers.
  • CC-B2.4.2 (Method-Holon Mandate): Both the constituent functions and the resulting composite function MUST be modeled as U.Methods, documented by U.MethodDescriptions, and enacted as U.Work. They are not U.Systems.
  • CC-B2.4.3 (Supervisor Relation Mandate): The "meta" nature of the emergent U.Method MUST be modeled through explicit relations, such as controls or supervises, linking the Transformer enacting the composite Method to the execution of the constituent Methods. A new U.MetaMethod type SHALL NOT be created.
  • CC-B2.4.4 (Interface Standard): The emergent U.Method MUST have a formally documented interface Standard (Method Interface Standard or MIC, see Pattern B.1.5), which specifies how the external world interacts with it and how the internal methods are encapsulated.

Common Anti-Patterns and How to Avoid Them

Anti-PatternManager's View: What It Looks LikeHow FPF Prevents It (Conceptually)
The "Process on Paper" FallacyA team creates a beautiful, complex workflow diagram (MethodDescription) but continues to operate in the old, siloed way. The new capability exists only in documentation.An MFT is a transition in operational reality (U.Method enactment), not just in design-time artifacts (MethodDescription). CC-B2.4.1 requires evidence for the B-O-S-C triggers, which are based on observed behavior, not just documented intent.
The "Micromanaging Supervisor"A new "meta-process" is introduced, but it's just a manager manually coordinating the old, separate steps. There is no new, emergent logic or automation.CC-B2.4.3 requires the supervisory function to be modeled as an explicit mechanism with controls relations. If the "supervisor" is just a person doing the same old coordination, no new, persistent U.Method has emerged.
The "Capability by Fiat"A leader declares that a new, integrated capability now exists, but the underlying methods, tools, and objectives of the team have not actually changed. The "synergy" is aspirational.An MFT is an observable, bottom-up phenomenon. The B-O-S-C triggers provide a falsifiable checklist. If there is no new boundary, no new objective, and no new supervisory loop, no MFT has occurred, regardless of declarations.

Consequences

BenefitsTrade-offs / Mitigations
Makes Capability Tangible: The MFT provides a formal way to represent and manage integrated capabilities as first-class holons (U.Methods), making them visible, auditable, and optimizable.Modeling Effort: Identifying and documenting an MFT requires analytical effort. Mitigation: This effort is an investment in creating a more robust and scalable operational model, preventing the much higher long-term cost of managing "tribal knowledge."
Enables True Process Improvement: It shifts the focus of optimization from local, component-level efficiencies to the performance of the end-to-end value stream.-
Fosters Organizational Learning: The pattern provides a language for describing how teams and systems learn to work together more effectively, transforming implicit learning into an explicit, reusable asset.-
Improves Assurance and Governance: By formalizing the emergent "meta-method," it becomes possible to create an assurance case for the entire workflow and assign clear responsibility and accountability for its performance.-

Rationale

This pattern extends the FPF's theory of emergence into the crucial domain of action and capability. It recognizes that the most significant leaps in performance often come not from improving individual components, but from inventing new and better ways to coordinate them. The MFT is FPF's formal name for this act of organizational or operational creativity.

By defining the transition in terms of the observable B-O-S-C triggers and tying it to the rigorous Method/Work/MethodDescription distinction from Pattern A.15, the MFT provides a bridge between the abstract principles of cybernetics and the concrete realities of managing a project, a team, or an autonomous system. It ensures that when we talk about a "new way of working," we are referring to a precise, verifiable, and architecturally significant event.

Relations

  • Is a specialization of: B.2 Meta-Holon Transition (MHT).
  • Is complemented by: B.2.2 MST (Sys) and B.2.3 MET (KD).
  • Is the emergent result of: The execution of a MethodDescription created during a B.2.3 MET (KD).
  • Creates the context for: The application of B.2.5 Supervisor–Subsystem Feedback Loop, which describes the internal architecture of the new composite U.Method.
  • Relies on: The conceptual distinctions defined in A.15 Role–Method–Work Alignment.

B.2.4:End

Supervisor-Subholon Feedback Loop

Type: Architectural pattern Status: Stable Normativity: Normative for FPF use that claims a supervisor-subholon feedback-loop relation.

Problem frame

Use this pattern when a holon is described as being supervised, regulated, steered, corrected, constrained, or coordinated through a feedback loop between a supervisor role and one or more subordinate holons.

The first-minute working situation is familiar: a fleet controller supervises drones, a plant supervisor changes allowed operating modes, a policy role constrains teams, or a scientific community reviews and revises a theory. The useful first move is to recover the feedback-loop relation: who or what is the supervised holon, which Transformer or transformer-bearing system plays the supervisor role, what signal or publication channel carries state or observations, what influence or constraint returns, and what objective or constraint the loop is trying to maintain.

What goes wrong if B.2.5 is missed: the supervised holon, supervisor transformer, shared medium, returned influence, and loop-closure condition remain unnamed; then layer labels, diagrams, publication channels, or supervisor words start carrying claims that belong elsewhere.

What B.2.5 buys in practice: the practitioner can keep useful supervisor/subholon language while naming the acting role, medium, returned influence, and governing pattern for any stronger claim being made. Not this pattern when the issue under repair is only a control-structure view, reusable dynamics law, rate/timing claim, causal intervention claim, evidence or assurance claim, gate decision, or module-interface relation. Use C.30.LCA, A.3.3, C.27, C.28, A.10/G.6, B.3, A.20/A.21, or A.6.M as appropriate.

The primary EntityOfConcern is one supervisor-subholon feedback-loop relation. Stability, safety, evidence sufficiency, gate readiness, causal validity, or assurance claims remain neighboring claims under their governing patterns when those claims are being made.

Problem

Layered supervision is useful across engineered, biological, organizational, and epistemic cases, but it is easy to model incorrectly. The common error is to collapse three different structures into one drawing:

  1. Structural composition: part-whole or structural composition of a holon.
  2. Supervisory relation: a Transformer or transformer-bearing system playing a supervisor role over one or more subordinate holons.
  3. Interaction or publication network: observation, signal, command, constraint, report, review, or publication channels through which the loop is enacted, observed, constrained, or revised.

When these are confused, a functional or supervisory layer is treated as a physical part, a publication is treated as an acting agent, a diagram is treated as proof, or a controller label is treated as a gate or assurance result.

Forces

  • Supervisory-loop language is useful and recognizable in control theory, cyber-physical systems, organizations, and science.
  • Layered-control language often uses layer, level, stack, and hierarchy; those words need declared kind recovery.
  • U.Episteme cases are especially fragile: an episteme can be reviewed, revised, cited, published, or used by acting systems, but the episteme itself does not sense, judge, plan, decide, or act.
  • A supervisor-subholon loop can be a relation in an architecture description, but stability, safety, assurance, evidence, gate, causal, and timing claim kinds belong to governing patterns.
  • The pattern needs to remain small enough to identify the loop before opening heavier control or assurance apparatus.

Solution

Model a supervisor-subholon feedback loop as a relation among holons, roles, transformers, media, and returned influence. A conforming loop identifies:

SupervisorSubholonFeedbackLoop@Context ::= {
  supervisedHolonRefs      : FinSet(U.HolonRef),
  supervisorRoleRef        : U.RoleRef,
  supervisorTransformerRef : U.TransformerRef | TransformerBearingSystemRef,
  sharedMediumRefs         : FinSet(U.InteractionRef | PublicationChannelRef),
  observationOrReportRefs  : FinSet(ObservationRef | ReportRef | PublicationUnitRef),
  influenceOrConstraintRefs: FinSet(InfluenceSignalRef | ConstraintRef | ObjectiveRef),
  feedbackRelationRefs     : FinSet(QualifiedRelationRecordRef),
  objectiveOrConstraintRef?,
  loopClosureCondition,
  admissibleUse,
  nonAdmissibleUse,
  governingClaimPatternRefs?
}

Loop relation readout. The loop has an observation/report side and an influence/constraint side. A one-way command relation is not yet a closed supervisor-subholon feedback loop unless the return observation, report, or state relation is also declared.

Structural-composition boundary. A supervised holon may be part of a larger holon, but supervision is not the same relation as part-whole composition. A controller, committee, method, or review practice can supervise a subholon without being a physical component of that subholon.

Control-structure view boundary. When the loop appears in an architecture description as planner/controller/observer/plant/supervisor structure, use [C.30.LCA](/generated/patterns/C.30.LCA) to record the control-structure view. [B.2.5](/generated/patterns/B.2.5) supplies the supervisor-subholon relation; [C.30.LCA](/generated/patterns/C.30.LCA) records the broader control-structure view.

Proof boundary. A conforming [B.2.5](/generated/patterns/B.2.5) loop is a relation, not proof. Stability and reusable state-evolution claims use [A.3.3](/generated/patterns/A.3.3); rate and timing claims use [C.27](/generated/patterns/C.27); causal-use claims use [C.28](/generated/patterns/C.28); evidence claims use [A.10](/generated/patterns/A.10) or [G.6](/generated/patterns/G.6); assurance claims use [B.3](/generated/patterns/B.3); gate and constraint-validity claims use [A.20](/generated/patterns/A.20)/[A.21](/generated/patterns/A.21); mathematical-lens transfer uses [C.29](/generated/patterns/C.29).

Episteme case boundary. In an episteme case, the acting and revising work is performed by systems or practices bearing Transformer roles. The U.Episteme is the knowledge-bearing object being reviewed, revised, stabilized, cited, or published. It does not itself sense, judge, plan, or act.

Worked slice A - robotic swarm. A drone fleet has individual drones, a shared communication medium, and a fleet-scope controller or distributed consensus method. [B.2.5](/generated/patterns/B.2.5) records each drone as supervised holon, the controller or consensus system as supervisor transformer, telemetry as observation side, and waypoint or mode commands as influence side. Claims about exponential convergence, delay tolerance, or disturbance damping use [A.3.3](/generated/patterns/A.3.3), [C.27](/generated/patterns/C.27), and the evidence or assurance pattern governing the claim being made.

Worked slice B - scientific theory. A scientific theory is revised when labs publish findings and a research community reviews anomalies and accepted revisions. [B.2.5](/generated/patterns/B.2.5) records the theory or its constituent epistemes as supervised objects and the community/review practice as transformer-bearing supervisor. Journals, conferences, datasets, and review records are publication or interaction channels. The theory does not perform the sensing or judging; the acting systems and practices do.

Worked slice C - product supervisor loop. A product platform constrains component teams through published interface rules and release gates. [B.2.5](/generated/patterns/B.2.5) records the supervising platform policy role, component/subproduct holons, report channels, and constraint returns. Work authority uses [A.15](/generated/patterns/A.15); gate passage uses [A.21](/generated/patterns/A.21); interface commitments use [A.6.M](/generated/patterns/A.6.M).

Archetypal Grounding

ArchetypeWithout B.2.5With B.2.5
SystemA control diagram mixes physical parts, roles, and commands, then claims coordination is obvious.The supervised systems, supervisor transformer, shared medium, feedback relation, and returned influence are named.
EpistemeA theory or model is said to sense, judge, plan, or adapt.Acting systems and review practices play the transformer role; the episteme is reviewed, revised, cited, or published.

Bias-Annotation

  • Diagram closure bias. A loop drawn on a diagram is read as a closed feedback loop. Repair by naming both observation/report and influence/constraint sides.
  • Layer/level bias. Layered diagrams hide whether the label names control role, declared system level, aggregation scope, rate band, or publication grouping. Repair by recovering the declared kind.
  • Episteme-agent bias. Knowledge-bearing objects are described as acting agents. Repair by naming the acting Transformer, publication or revision practice, and source or reliance relation.
  • Proof-by-loop bias. A loop relation is read as stability, safety, or assurance proof. Repair by assigning the claim kind being made to the governing pattern.

This checklist verifies the preceding guidance after the practitioner has chosen the selected move; it is not a required project control form and not a substitute for the card, note, view, relation, or repair move above.

Conformance Checklist

IDCheckWhy it matters
CC-B2.5-1A conforming use names supervised holon refs and the supervisor role/transformer refs.Prevents ghost coordination.
CC-B2.5-2A conforming use names the shared medium or publication/interaction channel that carries observations, reports, signals, constraints, or influence.Makes the loop inspectable.
CC-B2.5-3A conforming use names both observation/report and influence/constraint sides or explicitly says the loop is not closed.Separates closed feedback loops from one-way commands.
CC-B2.5-4A conforming use keeps structural composition, supervisory relation, and interaction/publication network distinct.Prevents layer/part category errors.
CC-B2.5-5Stability, safety, timing, causal, evidence, assurance, gate, and mathematical-lens claims are assigned to their governing patterns.Prevents loop-as-proof overread.
CC-B2.5-6Episteme examples name the acting systems or practices that perform review, revision, publication, or use.Prevents episteme-agent overread.
CC-B2.5-7If a control-structure view is being claimed, the control-structure-view claim is governed by C.30.LCA.Keeps relation-level feedback claims and view-level architecture claims aligned.

Common Anti-Patterns and How to Avoid Them

Anti-patternSymptomRepair
Ghost coordinationSubholons coordinate, but no supervisor role, shared medium, or feedback relation is named.Name supervisor role, acting transformer, observation/report side, and influence/constraint side.
Functional layer as componentA planning or control layer is modeled as a physical part of the controlled holon.Separate structural composition from supervisory relation.
Perfect communicationThe loop assumes instant, complete, or lossless access to subholon state.Add interaction/publication medium limits and assign timing or information claims to C.27, A.3.3, or evidence claim.
Episteme actsA theory, model, paper, or dashboard senses, judges, plans, or adapts.Name the acting system, operator, review practice, or revision practice; keep the episteme as described or revised object.
Loop proves safetyThe loop is treated as evidence, assurance, gate, or safety proof.Keep the loop relation and apply the governing pattern for the claim kind being made.

Consequences

The gain is a precise loop relation that is usable for architecture, control, organizational, and epistemic examples without collapsing them. A practitioner can keep ordinary supervisor/subholon language while naming the acting role, medium, and returned influence.

The cost is that B.2.5 no longer lets a layered-control diagram establish stronger proof or project-reliance claims. That cost is intentional: the loop relation is useful because it tells the practitioner what to inspect next, not because it silently certifies stability, safety, evidence, or assurance.

Rationale

Supervisor-subholon feedback loops are a recurring architecture form. The form is most useful when it is separated from structural mereology and from proof. That separation preserves the engineering insight from layered control architecture while keeping FPF's EntityOfConcern and Description-episteme boundary and specification use and role/transformer distinctions intact.

The same separation also keeps the epistemic case precise. Scientific theories, documents, models, and other epistemes can participate in feedback loops as reviewed or revised objects and as publications, source objects, or reliance objects, but acting systems and practices play the transformer role. This lets the same pattern cover systems and epistemes without agentive overread.

SoTA-Echoing

SoTA/practice anchorWhat it informsFPF adoption stancePractitioner implication
Layered and multi-rate control architecture practice, with Matni/Ames/Doyle used here as lineage and practice lineage for layered multi-rate control rather than as current proof by itself.Supervisor, plant, controller, planner, observer, feedback, and rate separation are useful relation cues for supervisor-subholon loop recovery.Adopt and adapt: keep supervisor-subholon loop recognition, then assign stability, timing, safety, evidence, assurance, and gate claims to their governing patterns.A loop diagram starts the relation record; dynamics, timing, and safety claims still need their own pattern.
Cyber-physical systems and feedback-control practice.Shared medium limits, observation channels, actuation, delay, disturbance, and plant dynamics affect whether a loop is adequate.Adopt: require loop closure and medium visibility; assign reusable dynamics claims to A.3.3.If communication delay matters, it is not solved by the B.2.5 label.
Organizational policy and review practice.Supervisory relations can be enacted through policies, review boards, reports, and publication channels.Adapt: model the acting systems/practices and publication/source or reliance relations explicitly.A committee or review practice may supervise; a published note does not act by itself.
FPF architecture-description discipline under C.30 and C.30.LCA.A supervisor loop can be one relation inside a control-structure view.Reuse: B.2.5 supplies relation recovery; C.30.LCA supplies view recovery.Use the pattern that governs the claim kind being made, then add the related pattern only when a second claim being made is present.

Relations

  • Builds on B.2, A.1, A.2, A.3, A.7, A.12, and A.15.
  • Coordinates with C.30.LCA for control-structure view adequacy.
  • Applies A.3.3 for reusable dynamics or stability claims, C.27 for temporal/rate adequacy, C.28 for causal-use claims, A.10/G.6 for evidence claim, B.3 for assurance, A.20/A.21 for constraint validity and gate decisions, A.15 for work authority, and C.29 for mathematical-lens transfer.

Neighboring claim governance: use C.30.LCA for control-structure view adequacy, A.3.3 for dynamics claims, C.27 for temporal/rate adequacy, C.28 for causal-use claims, A.10 or G.6 for evidence claims, B.3 for assurance, A.20 or A.21 for gate and constraint-validity records, A.15 for work authority, A.6.M for module-interface relation repair, and C.29 for mathematical-lens use.

B.2.5:End

Trust & Assurance Calculus (F–G–R with Congruence)

Plain‑English headline. B.3 defines how assurance (trust) is computed and propagated for both physical systems and epistemes and their carriers, using a small typed assurance tuple (F–G–R: F/R characteristics plus G as scope object) and conservative aggregation rules that respect the Γ‑invariants and A.7 EntityOfConcern/Description strict distinction. It treats the E.14 Working‑Model layer as the publication-facing assertion layer for claims, with assurance attached downward (Mapping - Logical - Constructive - Empirical) per E.14.

Use this when. Use B.3 when a claim, label, dashboard, evidence bundle, model, report, or gate-decision or assurance-input package is being used to raise assurance, trust, readiness, compliance, safety, release confidence, F, G, R, or CL for a named claim. First output. One typed Assurance(H, C \| K, S) claim per named assurance claim C, or an explicit no-assurance-claim disposition when the encountered publication face, carrier, rendering, or cue is only a cue, evidence pointer, wording issue, gate decision, role assertion, status assertion, commitment, or work occurrence. Not this pattern when. Not when the item is only a cue, action invitation, boundary wording, evidence question, currentness question, gate decision, release decision, role assertion, status assertion, commitment, or work occurrence; use A.15, A.6, A.10, A.21, A.20, A.2.1, A.2.8, A.2.9, or A.15.1 as appropriate.

Assurance result selection. Use the lightest assurance result that can decide the live assurance use. A cue or source pointer gets no B.3 tuple. A local, non-release, non-compliance, non-safety, non-reused claim may be written as a compact bounded assurance claim statement that names claim, assurance use carried by the assurance tuple or relying context, evidence pointer, limit, and stop/reopen condition. Reserve a full typed Assurance(H, C \| K, S) claim for readiness, compliance, safety, release confidence, trust, F, G, R, CL, or reused assurance input.

Continuous assurance state. Treat an assurance claim as an engineering-process state that can decay, reopen, narrow, or be withdrawn, not as a one-time checklist result. For model, data, AI, documentation, release, or operational assurance, name the drift, monitoring, incident, evidence-refresh, version-change, policy/gate-change, or residual non-admissible-use condition that reopens the assurance claim.

Problem frame

Every non‑trivial result in FPF—a composed system is safe, a model is credible, a conclusion holds—is a claim that rests on composed evidence.

  • For U.System holons (Γ_sys), assurance is about capabilities and constraints under stated conditions.
  • For U.Episteme holons (Γ_epist), assurance is about the quality of evidence relation for a statement or model.

To make such claims comparable and auditable across domains, B.3 introduces a Trust & Assurance Calculus that:

  • uses a small typed assurance tuple (F–G–R: F/R characteristics plus G as scope object) governed by conservative propagation rules (this is not a state space),
  • accounts for integration quality via Congruence Level (CL) along the edges of a DependencyGraph (B.1.1, A.14),
  • and composes these values with Γ‑flavours while respecting the Invariant Quintet (IDEM, COMM/LOC or their replacements, WLNK, MONO).

B.3 is conceptual and normative: it defines which assurance components must be published and how they propagate. How you improve those components (e.g., formalize, replicate, reconcile, or admissibly widen/narrow scope) is the job of KD‑CAL actions (the knowledge‑dynamics patterns; references are descriptive, not required to read here).

Mechanism linkage. For law‑governed operation families (e.g., USM/UNM) authored as mechanisms, use A.6.1 — U.Mechanism to publish OperationAlgebra/LawSet/AdmissibilityConditions and the Transport clause (Bridge‑only, CL/CL^k/CL^plane). All such penalties reduce R/R_eff only; F/G remain invariant.

Working‑Model handshake (alignment with E.14 - B.3.5 - C.13). Assurance consumes two inputs declared in the Working‑Model assertion layer (CT2R‑LOG, B.3.5): the justification stance validationMode ∈ {postulate, inferential, axiomatic} and, where present, the grounding link tv:groundedBy. Structural claims that aspire to the strongest guarantees rely on Constructive grounding as a Γₘ (Compose‑CAL) narrative referenced via tv:groundedBy. No assurance record or publication defines Working‑Model wording or layout (downward‑only dependence, E.14).

Problem

Without a disciplined calculus, four chronic failures appear:

  1. Trust inflation: Averaging or summing heterogeneous “quality” tags yields aggregates that look better than their weakest parts, violating WLNK.
  2. Scale confusion: Mixing ordinal and ratio scales (e.g., averaging F ordinal scale values with numeric reliabilities) produces meaningless numbers.
  3. Congruence blindness: Integration quality (how well pieces fit) is invisible; brilliantly strong parts connected by weak mappings produce overconfident wholes.
  4. Scope drift: Design‑time formalism and run‑time evidence are composed into a single score; dashboards then claim “assurance” for a blueprint using live data, or vice versa.

Forces

ForceTension
Conservatism vs. SynthesisAvoid overclaiming (WLNK) ↔ allow real gains from better integration (raise CL) or true emergence (B.2).
Universality vs. Domain nuanceOne calculus for systems and epistemes ↔ physics and epistemology use different primitives; keep them comparable but not identical.
Simplicity vs. FidelityKeep the assurance tuple small and typed (A.11) ↔ capture enough structure to be informative and improvable by KD‑CAL actions.
Static clarity vs. Dynamic evolutionA score must be reproducible today ↔ tomorrow it should legitimately rise after formalization, replication, or reconciliation.

Solution — Part 1: The assurance tuple and the universal aggregation skeleton

B.3 defines what the assurance components are, how they live on nodes and edges of the dependency graph, and the shape of the aggregation that any Γ‑flavour must honor when producing an assurance result.

The F–G–R assurance components (typed; F/R CHR, G USM)

We standardize two node characteristics, one node scope object, and one edge characteristic:

  1. Formality (F)how constrained the reasoning is by explicit, proof‑grade structure.

    • Scale kind: ordinal (its scale values do not admit arithmetic).
    • Canonical scale values (example): F0 Informal prose - F1 Structured narrative - F2 Formalizable schema - F3 Proof‑grade formalism.
    • Monotone direction: higher is better (never lowers assurance when all else fixed).
  2. ClaimScope (G)the declared set of U.ContextSlice where the result applies.

    • Type: set‑valued USM scope object (A.2.6), not a CHR characteristic.
    • Well‑typed operations: membership and set algebra (, , , , SpanUnion, plus declared Bridge translation / widen / narrow / refit).
    • Scalar proxy (report‑only): if a profile needs a number for reporting, it MAY publish an explicitly declared CoverageMetric(G); such a proxy MUST NOT replace G in norms, gates, bridge semantics, or CL-bearing relation decisions.
  3. Reliability (R)how likely the claim/behavior holds under stated conditions.

    • Scale kind: ratio in [0,1] (or a conservative ordinal proxy when numeric modeling is unavailable).
    • Monotone direction: higher is better.
  4. Congruence Level (CL)edge property: how well two parts fit (semantic alignment, calibration, interface Standard).

    • Scale kind: ordinal with a monotone penalty function Φ(CL) where Φ decreases as CL increases.
    • Canonical scale values (example): CL0 tentative guess - CL1 plausible mapping - CL2 validated mapping - CL3 verified equivalence.
    • Interpretation: low CL reduces the credibility of the integration itself (not the parts), and therefore penalizes the aggregate R.

EntityOfConcern/Description strict distinction (A.7).

  • Assurance components live as value/scope claim components: F/R as characteristics, G as a scope object, while Γ‑flavours fold structure/order/time.
  • Do not smuggle assurance components into structural edges; keep F/R/CL explicit as CHR metadata and G explicit as a USM scope object.

Assurance shoulders (Working‑Model split). Mapping raises TA (typing, fit/CL). Logical and Constructive contribute to VA (intended relation semantics; Γₘ extensional identity for structure). Empirical Validation contributes to LA (evidence in a bounded context). These assurance inputs attach downward from the Working‑Model assertion layer (E.14).

Assurance as a typed claim

B.3 speaks about assurance of a specific typed claim C over a holon H under context K and scope S ∈ {design, run}:

Assurance(H, C | K, S) = ⟨F_eff, G_eff, R_eff, Notes⟩
  • C examples: meets load L, argument Q holds, model M predicts within δ.
  • K binds assumptions (environment, usage, priors).
  • Notes include the SCR (all sources, B.1.3), OrderSpec/TimeWindow where applicable (B.1.4), cutsets, and evidence citations (A.10).

This tuple gives readers an at‑a‑glance view (didactic primacy) while preserving the pieces needed for audit and improvement.

Validation modes (declaration, normative). Each published Working‑Model assertion SHALL declare validationMode ∈ {postulate, inferential, axiomatic} (E.14). — postulate → pragmatic working claim; Empirical Validation is required for audit. — inferential → reasoned consequence; Logical assurance carries the reasoning requirement. — axiomatic → constructive identity; structural edges MUST provide a Γₘ narrative and a tv:groundedBy pointer (C.13, B.3.5).

Design vs run (no chimeras). Assurance tuples for design‑time and run‑time SHALL be reported separately and not composed into a single score; see the Scope drift hazard in §2 and the obligations in B.3.3.

Authority-looking labels and dashboard tiles

A badge, label, score, dashboard tile, credential display, provenance mark, compliance-looking mark, model card, datasheet, data card, assurance document, attestation label, assurance-looking note, or generated confidence phrase does not enter assurance calculus or improve F, G, R, CL, readiness, safety, compliance, trust, release confidence, or assurance by display alone.

Adversarial misuse guard. Do not let dashboards with favorable labels, compliance-looking badges, old model cards, provenance labels, assurance-looking documents, or generated confidence phrases supply missing evidence, limitations, scope, decay, or argument for an assurance claim.

Valid B.3 dispositions for such an item are:

DispositionUse whenOutput
No assurance useThe item is only a cue, source pointer, evidence question, currentness question, gate decision, role assertion, status assertion, commitment, boundary wording, or work occurrence.Return to A.15, A.10, A.6, A.21, A.20, A.2.1, A.2.8, A.2.9, or A.15.1; no tuple is needed.
Compact bounded assurance claim statementThe claim is local, non-release, non-compliance, non-safety, not reused as assurance input, and does not affect people/team status.Record the claim, assurance use carried by the assurance tuple or relying context, evidence pointer, limit, and stop/reopen condition in the current work record.
Full assurance tupleThe item is being used to raise readiness, compliance, safety, release confidence, trust, F, G, R, or CL.One typed Assurance(H, C | K, S) claim per named assurance claim C, with argument/evidence/limitations/decay.
Rejected or narrowed assurance claimEvidence, scope, argument, currentness, or limitations do not carry the attempted assurance claim.State the assurance claim, work claim, or reliance claim that the current assurance tuple does not carry, then name the next legitimate formalization, evidence repair, scope narrowing, or claim narrowing move.

Build a B.3 assurance claim only when the next work move or reliance move depends on a typed assurance claim. The typed assurance claim must name:

FieldRequired content
Claim and assurance use carried by the tupleThe claim named by value C and the assurance use the tuple carries: readiness, release, audit, compliance, safety, model credibility, or another named assurance use.
Holon, context, and scopeH, K, and S plus audience or relying context when the label is human-facing.
Evaluation conditionWhat was evaluated, under which method, policy, test, review, measurement, or assurance case.
Evidence relation and carriersThe A.10 evidence path, carrier refs, source-maintenance role assignments, windows, verifier rule, relying-party rule, and proof results or status results that evidence the assurance tuple.
Argument and assurance rationaleThe argument pattern, assurance case, or reason why the evidence carriers evidence claim C under K and S, including assumptions, defeaters, and open challenges.
Limitations and rival explanationsScope limits, claims or uses not carried by the assurance tuple, stale display, spoofing, copied text, generated text, proxy-for-value substitution, provenance-only source relation, context shift, and known failure conditions.
Decay and reopen conditionValid-until, revocation, policy version, gate version, model version drift, monitoring change, incident signal, evidence refresh, and contest or redress path.

Assurance evidence minimization. A typed assurance result should cite the minimum A.10 evidence path needed for the named assurance claim and relying context. Use redacted, hashed, scoped, or role-mediated evidence refs when raw carriers would expose personal data, secrets, privileged logs, tenant identifiers, security-sensitive traces, incident details, or unnecessary identities; do not build a full assurance dossier when pointers preserve enough recoverability.

Role prompts for assurance use:

Role in the situationPrompt
Assurance reviewerWhich named Assurance(H, C | K, S) claim is actually being made or revised?
Auditor or reviewerWhich evidence path, argument, limitation, decay condition, reopen condition, and relying context must be recoverable?
Manager or release readerWhich desired decision or action is outside B.3 and must instead use A.15, A.21, A.10, or another exact source?
Model or data readerWhich documented admissible-use statement or external intended-use field, evaluation condition, version, window, limitation, drift, and incident condition bound the model or data documentation?
Evidence source-maintenance role assignmentWhat evidence carrier or scoped pointer must be exposed without turning documentation presence into an assurance claim?

Display guidance for assurance labels: a readiness, safety, compliance, trust, release-confidence, or assurance display should show the named assurance claim, assurance use carried by the assurance tuple or relying context, evaluation condition, evidence-path ref, scope, window, limitation, decay condition, reopen condition, and assurance, work, or reliance claims not carried by the assurance tuple. A label that only points to documentation should remain a source pointer, not an assurance result.

Incident-learning fields for assurance overread: visible label, documentation record, or carrier, attempted assurance claim, missing tuple or evidence-path field, assurance claim, work claim, or reliance claim not carried by the assurance tuple, limitation or decay condition that defeated the claim, next legitimate formalization, evidence repair, scope narrowing, or claim narrowing move, and upstream repair item for documentation, evidence refs, assurance label wording, monitoring, or reopen trigger.

Contestability and redress path: when the B.3 material-reliance threshold is live, the B.3 result should name the claim being contested, evidence path, limitation or decay condition, reviewer or decision forum, safe interim disposition, and what evidence or scope change would reopen the assurance claim.

If those fields are missing, the encountered publication face, carrier, rendering, or cue remains an orientation label, source pointer, evidence pointer, documentation record, carrier, or unsubstantiated confidence cue. Return to A.15 when the question is whether that lane may guide work or reliance, to A.10 when the question is evidence, currentness, or provenance, and to A.6 when the question is mixed policy, API, or schema wording.

Positive repaired path. When an assurance use is live and the required assurance fields are present, return the smallest typed assurance result that can guide work: the named claim, context, scope, evaluation condition, evidence path, argument, limitations, decay condition, and reopen condition. That result may improve or justify assurance only for the stated claim and scope; other action, gate, evidence, work-occurrence, or compliance uses still need their own exact sources.

Constructive assurance moves:

  • narrow G to the actually evidenced or admissible scope;
  • raise F by formalizing argument/method structure;
  • raise R by adding validation, replication, more probative, repeated, current, or more relevant evidence;
  • improve CL by repairing mappings, units, interfaces, or integration edges;
  • separate design assurance from run assurance;
  • add limitations, assumptions, defeaters, monitoring, drift, and reopen triggers;
  • reject or downgrade the assurance use when those moves are not available.

Negative controls:

Visible itemAdmissible source or assurance useNon-admissible use without a full tuple
Source-backed release dashboard tileIf the tile is a current view of A.21 GateDecision or DecisionLogRef plus an A.10 evidence path, it may carry gate-passage reliance outside B.3 for the named release and environment. B.3 is live only when the tile is also asked to raise readiness, safety, compliance, trust, or release-confidence assurance.Release approval by display, compliance proof, rollback success, work occurrence, or assurance increase without a typed assurance claim.
Credential, compliance, or provenance labelBounded source, holder, status, history, or documentation source relation when evidenced.Safety, truth, permission, gate passage, readiness, or assurance claim by label presence.
Model card, datasheet, data card, assurance document, or assurance-looking noteScoped documentation for a named claim, documented admissible-use statement or external intended-use field, evaluated condition, limitation, version, and window.Higher R, broader G, higher F, better CL, readiness, compliance, safety, or release confidence by document presence.
Generated confidence phraseSource-finding or explanation relation when grounded.Assurance increase, authority, approval, or evidence by wording alone.

Model cards, datasheets, data cards, assurance documents, and assurance-looking notes are external documentation records or source carriers unless they are mapped into existing FPF claims and publication faces. They do not add MVPK face kinds and do not bypass B.3 when the use under repair is an assurance claim.

Lint trigger. A model card, datasheet, or data card cited as readiness, safety, compliance, release confidence, or assurance proof requires documented intended-use match, evaluation condition, limitations, an A.10 evidence path, and one typed Assurance(H, C \| K, S) claim for the named assurance claim. Without those, return no assurance use or a rejected/downgraded assurance claim.

Positive repaired example: a model card plus documented admissible-use statement or external intended-use field, evaluation condition, version, window, limitations, an A.10 evidence path, and a typed Assurance(H, C \| K, S) claim may carry assurance for that named model claim in that evaluated context. The same documentation still does not carry another deployment context, gate passage, release work occurrence, or compliance proof unless those sources are separately present.

Minimum reliance safety assurance record

Use this B.3 section when the B.3 material-reliance threshold is live: reliance on a visible source may materially change behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people/team status, operational action, or controlled-object regulation. The first B.3 move is to decide whether assurance is live; if it is, write the minimum reliance safety assurance record for the named reliance use. Mere attention shift, learning, orientation, source-finding, or carrier wording correction is not enough.

RelianceSafetyCase is the local Tech label for this B.3 assurance-record role. The plain phrase is minimum reliance safety assurance record. The label is not a new FPF pattern, Core kind, safety authority, gate, policy source, approval, certificate, compliance method, or general safety-case ontology.

Assurance-record role: the trigger and non-trigger table is a B.3 recognition aid, the minimum assurance-record table is a minimum local record aid, and the worked reliance-threshold slices are regression/review slices. They are not a universal project checklist, sign-off sequence, untyped status vocabulary, or replacement for Assurance(H, C | K, S); use them only when the named material reliance trigger is live. This local section returns the attempted reliance to the B.3 assurance relation; it does not create an extra SEMIO authority or cross-pattern relation vocabulary.

Affordability card: orientation or source-finding stays outside B.3; bounded local reliance stays with the local evidence, explanation, CV, gate, or pattern-quality relation unless assurance is live; threshold reliance opens the minimum reliance safety assurance record only when the B.3 material-reliance threshold is live. Plain wording remains ordinary unless it changes admissible use, source relation, evidence, gate, assurance, work, decision, or neighboring-pattern exit.

Common wrong first reading: a safety-looking note, safety case, compliance-looking label, or dashboard warning is a certificate, approval, or gate. First honest entry: state one typed B.3 assurance claim with A.10 evidence path, assumptions, limitations, defeaters, residual uncertainty, monitoring or stop condition, contest/redress, admissible use, and unadmissible use.

First admissible B.3 move: name the reliance use, the assurance claim, the affected context or audience, the trigger that makes B.3 live, the A.10 evidence path, the argument, limitations, defeaters, contest/redress path, stop or monitoring condition, admissible use, and unadmissible use. If those pieces are absent, return the source to A.10, E.17.EFP, A.20, A.21, E.19, or the local relation rather than inventing assurance by label.

Trigger and non-trigger cases:

Encountered source useB.3 dispositionMinimum action
Ordinary source-backed report, citation, model card, datasheet, data card, or documentation record with no assurance use and no B.3 material-reliance thresholdNo B.3 assurance use.Stay in A.10 with claim, carrier, evidence path, window, admissible use, unadmissible use, and reopen trigger.
Generated explanation, generated summary, or didactic reconstruction used only for source-finding or learningNo B.3 assurance use.Stay in E.17.EFP unless operative claims are relied on through A.10 evidence paths or another source relation that evidences the operative claim.
Local conformance label, CV.Status, benchmark result, or score near a release conversation but not used to raise assuranceNo B.3 assurance use.Keep CV.Status in A.20, gate-decision publication in A.21, pattern-quality result in E.19, measurement or marker relation in C.16/A.10, and no assurance tuple unless an assurance claim is live.
Confidence, calibration, prediction interval, or abstention reason tied to one reversible local actCompact bounded assurance claim only when the act depends on assurance; otherwise no B.3 use.State act, context, window, calibration basis, stop condition, admissible use, and unsupported attempted use; open C.27 or G.11 when time, expiry, refresh, or monitoring changes the move.
Safety-looking note, compliance-looking label, public warning, dashboard state, generated operational explanation, or status display is intended or reasonably foreseeable to make the B.3 material-reliance threshold live: reliance materially changes behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people/team status, operational action, or controlled-object regulation.Minimum reliance safety assurance record is required.Build the B.3 assurance record with A.10 evidence path and any live A.20, A.21, E.19, C.27, G.11, B.2.5, or representation/retargeting dependency.

Minimum assurance record:

FieldRequired content
Reliance use and assurance claimThe behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people/team status, operational action, or controlled-object regulation that would materially change, and the assurance claim being made about that change.
Context, audience, and affected roleThe bounded context, environment, user group, team, public audience, relying role, affected role, tenant, release line, service, or work target.
Source carrier and evidence kindThe visible source, publication face, record, cue, marker, conformance label, dashboard, explanation rendering, score, warning, or status display, plus the evidence kind being used.
A.10 evidence pathClaim, carrier, producer or method trace, currentness/window, source-maintenance role assignment, evidence relation, rival explanation, admissible use, unadmissible use, and reopen trigger.
Argument and assurance basisWhy this evidence path makes the assurance claim admissible under the context; include assumptions, limitations, defeaters, residual uncertainty, and unacceptable-harm or risk-tolerance condition where live.
DependenciesAny live A.20 CV status, A.21 gate decision, E.19 pattern-quality result, C.27 temporal claim, G.11 refresh/decay relation, B.2.5 control relation, or representation/retargeting relation.
Monitoring, rollback, or stop conditionWhat observation, incident, drift, contest, expiry, changed profile, changed source, or failed check stops, narrows, reopens, or withdraws the reliance.
Contest and redressThe disputed claim or disposition, affected use or harm, accountable review role, admissible challenge evidence, possible disposition change, outcome record, and reopen trigger.
Public and private evidence boundaryPublic summary, reviewer-only evidence, affected-party contestable minimum, and any scoped, redacted, hashed, or role-mediated evidence ref needed to preserve recoverability without overexposure.

Positive repaired path: when the trigger is live and the assurance record is sufficient, return the smallest typed assurance result that can guide the reliance: named assurance claim, reliance use, context, evidence path, argument, limitations, dependencies, monitoring or stop condition, contest/redress path, admissible use, and unadmissible use. When the record is insufficient, narrow the reliance, degrade the assurance use, abstain, require evidence, reopen the source, or block the attempted assurance use; do not convert a polished source into safety acceptance.

A safety case is accepted only as a bounded assurance argument for the named reliance use. It remains contestable by defeaters, changed evidence, changed context, monitoring failure, residual-uncertainty breach, or admissible affected-party challenge. Stop when the named reliance use, unadmissible use, limitations, defeaters, contest/redress path, monitoring or rollback condition, and reopen condition are sufficient for this threshold trigger; do not expand the record into a general safety dossier.

Accountable review is insufficient by title alone. It counts here only when it can change the disposition, records the outcome, and leaves the admissible use, unadmissible use, and reopen condition inspectable.

Misuse guard: an incoming or attempted-reliance RelianceDisposition=safety-case-required must name the trigger that makes B.3 live. A source producer, dashboard-state publisher or maintainer, model producer, documentation producer, or status-label issuer cannot self-clear a threshold-bearing reliance by attaching the label. Where the B.3 material-reliance threshold is live, the assurance record must expose an accountable review role and a contest path capable of changing the disposition.

Affected-party contestable minimum: public/private evidence separation is valid only if the affected party can see enough of the claim, source class, disposition, affected use, accountable role, and allowed challenge evidence to challenge the result. Reviewer-only evidence may stay protected, but protected evidence cannot make redress non-contestable while the assurance use still claims contest or assurance relation. A blocked, abstained, degraded, or evidence-needed assurance use is not final if admissible challenge evidence, missing affected-party evidence, changed source, changed context, monitoring failure, or redress can materially change the disposition.

Worked reliance-threshold slices:

SliceB.3 moveBoundary
A public-service or access-status display changes who receives access, support, or review.Use the minimum reliance safety assurance record for the named status-changing reliance, with contest/redress and unadmissible use.The display is not approval, safety, fairness, compliance, or resource authority by itself.
An SRE dashboard changes incident behavior or resource allocation.Use B.3 only when the dashboard is asked to raise assurance or safety-bearing reliance; keep ordinary evidence/currentness in A.10.Use B.2.5 only for a live control relation and A.21 only for a live gate decision.
A public warning or synthetic-content label changes perceived meaning but there is no evidence that it changed the target behavior, release risk, safety claim, or control relation.Keep the label as A.10 evidence or source-finding/orientation cue; require audience/action effect evidence before B.3 reliance.Do not infer safety, compliance, behavior change, or control effect from label presence alone.
A manufacturing conformance label appears near release.Keep local CV or conformance evidence in A.20, A.21, C.16, or A.10; open B.3 only when assurance, safety, compliance, or release-confidence reliance is live.Conformance presence is not safety acceptance or release permission.
A software supply-chain attestation is cited as runtime safety.Use A.10 for origin/build/process claims and B.3 only for the named assurance claim with argument, limitations, defeaters, and stop condition.Build provenance is not runtime safety or operational permission.
A people or team status badge changes permissions, resources, or review priority.Require a assurance record that names affected role, relying role, evidence path, contest path, and disposition change condition.The badge issuer cannot self-clear the people/team-status-changing reliance by issuing the badge.
A standards-document clause is reused as approval.Use A.10 for evidence of the clause; open the exact approval, commitment, gate, or assurance relation only when live.A cited clause is not project approval, gate passage, or assurance by quotation.

Do not read the assurance record as a graded scale, standalone status, universal assurance checklist, release certificate, or new safety-case state family. B.3 consumes the assurance record only as typed assurance input for the named claim and reliance use.

Where the numbers live (and do not)

  • On nodes: each input holon contributes its local F, G, R according to its nature (system vs. episteme).
  • On edges: each integration step has a CL (congruence of the connection).
  • Not inside Γ: Γ consumes D and returns a composed holon; B.3 governs how F, G, R, CL propagate to the Assurance tuple for that composed holon. This keeps Γ algebra and assurance calculus separable and reviewable.
  • Not a state space: ⟨F,G,R⟩ is an assurance tuple, not a U.CharacteristicSpace; do not draw “trajectories” in ⟨F,G,R⟩. For episteme evolution, use ESG states and the assurance‑trace hooks (see below).

Universal aggregation skeleton (domain‑neutral)

Any Γ‑flavour that claims an Assurance result must adopt the following conservative skeleton:

  1. Formality:

    F_eff = min_i F_i

    Rationale: the least formal piece caps the formality of the whole (WLNK on F). Monotone: raising any F_i cannot reduce F_eff.

  2. ClaimScope (G):

    G_eff(path)  = intersection({G_i | i is essential on the dependency path})
    G_eff(claim) = SpanUnion({G_eff(path_j)}) only across independently supported paths
    • Along an essential dependency path, every required support must hold on the same slice, so the effective claim scope is the intersection of the required scopes. Empty intersection means the path does not support the claim on any slice.
    • Across independent support lines for the same claim, B.3 may publish a SpanUnion of the path scopes, but only when the independence assumption and evidence relation are explicit.
    • Constraint: any region not covered by the required support relation for its path is dropped. A raw union of node scopes is never the default law for G.
    • Monotone: adding an independently supported path may widen the published claim scope; adding a new essential dependency may narrow it.
  3. Reliability (penalized by integration):

    R_raw = min_i R_i                       // Weakest-link cap
    R_eff = max(0, R_raw − Φ(CL_min))       // Congruence penalty
    • CL_min is the lowest Congruence Level (CL) value on any edge in the proof spine / critical integration region for the claim C.
    • Φ is monotone decreasing and bounded (never makes negative values).
    • Monotone: increasing any R_i or any CL cannot lower R_eff.
  4. SCR and Notes:

    • The aggregate SHALL produce a SCR listing all contributing nodes and edges, with their F, G, R, CL, scopes, and evidence links (A.10).
    • The SCR SHALL additionally display the EntityOfConcernRef (entityOfConcernRef and groundingHolonRef) and the ReferencePlane for the claim, and present a separable TA/VA/LA table of evidence contributions with valid_until/decay marks and the Epistemic‑Debt per § B.3.4.
    • If order/time mattered for the claim, attach the OrderSpec or TimeWindow identifiers (B.1.4).

This skeleton is mandatory. Domain‑specific patterns may add refinements (e.g., separate epistemic “replicability” vs. “calibration”) as long as they do not violate WLNK or MONO and preserve scale kinds.

System vs. Episteme — same shape, different readings

  • For systems (Γ_sys):

    • F reads as engineering discipline (from ad‑hoc method to verified specification).
    • G reads as operational envelope coverage.
    • R reads as assured reliability under K (requirements, environment, test campaigns).
    • CL often arises at interfaces (Boundary‑Inheritance Standard; B.1.2): poorly controlled interfaces reduce R_eff.
  • For epistemes (Γ_epist):

    • F reads as logical/semantic formality (from prose to proof).
    • G reads as domain span (concepts, populations, conditions).
    • R reads as evidential relation quality (replication quality, measurement integrity).
    • CL measures semantic alignment of merged constructs (terminology mapping, ontology bridges, calibration).

Agentness is separate (A.13). Agency metrics (Agency‑CHR) do not enter the skeleton by default. They may act as a contextual overlay (e.g., to argue why a supervisory policy can maintain R across disturbances), but never to bypass WLNK or the CL penalty. Grade shifts should be modeled as MHT events when they create new capabilities.

Scale discipline (CHR guard‑rails)

To prevent silent misuse:

  • Ordinal scales (F, CL): never average or subtract; only min/max, thresholds, and monotone comparisons are valid operations.
  • Coverage scales (G): use union/intersection in a declared domain space; do not “average” sets. If a numeric proxy is used (e.g., coverage ratio), it must be derived from a set operation, not vice versa.
  • Ratio scales (R): may be combined with min, max, or explicitly justified conservative functions; do not add R’s from different contexts without normalization of K (assumptions).

What improves the tuple (action-pattern overview)

B.3 remains neutral about how improvement happens, but for didactic clarity:

  • Raise F: formalize narratives (specifications, machine‑checked models).
  • Raise G: enlarge evidence-covered span (new test regimes, new populations) with adequate evidence.
  • Raise R: replicate, calibrate, tighten measurement error, reduce bias.
  • Raise CL: reconcile vocabularies, align units, formalize mappings, verify interface Standards.

Each of these corresponds to recognizable Transformer roles and KD‑CAL moves (design‑time); their run‑time counterparts are covered by Γ_time (phase evidence) and Γ_work (cost of obtaining assurance).

Prohibition (normative) — F–G–R is not a CharacteristicSpace

Do not treat ⟨F,G,R⟩ as a U.CharacteristicSpace and do not define geometric trajectories over it. Use ESG for episteme state and the assurance‑trace hooks for trends in assurance tuples.

Assurance consequence for unsupported CausalityLadderRung climb

B.3 consumes CausalUseSupportVerdict from C.28 when an assurance claim depends on a C.28 causal-use verdict:

CausalUseSupportVerdict = supported | bounded | unsupported | abstain

CausalAssuranceTupleTrigger is narrower than local causal-use repair. A local [C.28](/generated/patterns/C.28) downgrade, redirection to a relation governing the asserted use, or abstain disposition does not require a new [B.3](/generated/patterns/B.3) assurance tuple by itself. Create or update a [B.3](/generated/patterns/B.3) tuple only when the causal-use claim is assurance-bearing, publication-bearing, release-bearing, or reused as an input to assurance, trust, certification, risk acceptance, or downstream selection. Exploratory causal wording, local causal wording repair, or a [C.28](/generated/patterns/C.28) cheap stop remains outside [B.3](/generated/patterns/B.3) until it changes assurance or publication use.

Unsupported CausalityLadderRung climb lowers, blocks, or abstains from R for the affected causal-use claim. If CounterfactualSamplingRealizabilityProfile.verdict = nonrealizable, [B.3](/generated/patterns/B.3) lowers or blocks R for claims that require direct counterfactual-comparison sampling evidence. If CounterfactualSamplingRealizabilityProfile.verdict = unknown, direct-realization claims are unsupported, but identified, bounded, or simulation-only admissible use may still be admissible when [C.28](/generated/patterns/C.28) declares the admissible use and unadmissible use.

Verdict consequences:

CausalUseSupportVerdictAssurance consequenceAdmissible assurance wording
supportedThe causal-use claim contributes to R only inside the named CausalUseSupportStatement, scope G, CausalEvidenceSupportBasis, and cited profile refs."Supported only for the declared causal use under the cited CausalEvidenceSupportBasis, profile refs, and scope."
boundedR is bounded to the declared admissible-use limit; assurance prose must name the bound, the CausalUseSupportStatement, and the CausalUseUnsupportedStatement, and must not imply unqualified causal-use admissibility outside them."Bounded causal support for the declared regime, population, policy, model, or window; unsupported outside that bound."
unsupportedThe causal-use claim cannot raise R; it becomes CausalUseUnsupportedStatement, is downgraded, removed, or blocks the assurance claim when the causal use is necessary."Causal use non-admissible for this assurance claim; use association/metric/simulation-only wording or block the causal assurance claim."
abstainNo causal-use conclusion contributes to R; the assurance tuple either proceeds only on named non-causal grounds or abstains from the affected causal claim."No causal-use conclusion is used; assurance proceeds only on named non-causal grounds or abstains from this causal claim."

What changes in practice: assurance prose cannot say "high confidence that the policy caused improvement" when the evidence path only evidences association or simulation-only counterfactual output; the unsupported causal step must degrade, abstain, or block the causal-use claim.

What this does not authorize: [B.3](/generated/patterns/B.3) does not determine the CausalityLadderRung, estimand, causal identification, evidence design, or realizability profile; it applies assurance consequences to the CausalUseSupportVerdict supplied by [C.28](/generated/patterns/C.28) and the evidence path supplied by [A.10](/generated/patterns/A.10).

B.3:5 Proof obligations (attach these when producing an Assurance tuple)

These obligations refine the generic Proof Kit from B.1.1 §6 for assurance outputs. Each Γ‑flavour that emits an Assurance(H, C | K, S) tuple MUST attach the applicable obligations below.

Common obligations (all Γ‑flavours)

  • ASS‑CLM (Typed claim & context). State the claim C (what is being assured), the context K (assumptions, environment), and the scope S ∈ {design, run}.

  • ASS‑SCA (Scale discipline). Declare the scale kind used for each characteristic (F ordinal, G coverage, R ratio) and confirm that all operations are admissible for that kind (no averaging of ordinals; G via set/coverage ops).

  • ASS‑WLNK (Weakest‑link evidence). Identify the cutset (node or edge set) that caps F/G/R for the claim (the proof spine for epistemes, the structural or assurance bottleneck for systems).

  • ASS‑CL (Congruence path). Identify the relevant integration path(s) and record CL_min used in the penalty Φ(CL_min).

  • ASS‑MAN (SCR). Produce a SCR listing all contributing nodes and edges with (F, G, R) and CL values, their DesignRunTag, and Evidence Graph Ref (A.10). If order or time affect the claim, include the OrderSpec or TimeWindow identifiers from B.1.4.

  • ASS‑MONO (Declared monotone characteristics). List the characteristics along which local improvement cannot reduce the aggregate (this is used by future evolution, B.4).

Γ_sys (systems) — additional obligations

  • CORE‑BIC (Interface congruence). Reference the Boundary‑Inheritance Standard (BIC) from B.1.2 and record any interface mismatches; these contribute to CL_min.

  • CORE‑ENV (Operating envelope). Specify the domain used for G (e.g., load–temperature region) and how coverage is computed (set union constrained by evidence relation).

Γ_epist (epistemes) — additional obligations

  • EPI‑SPN (Entailment spine). Identify the premise/lemma spine for the claim; R_raw = min R_i is taken along this spine, not over arbitrary satellites.

  • EPI‑MAP (Semantic mapping congruence). Point to the vocabulary/ontology mappings used; their verification status sets the CL values on the integration edges.

Γ\ctx and Γ\method (order‑sensitive) — additional obligations

  • CTX‑ORD (OrderSpec). Attach the partial or total order σ and any join‑soundness conditions (types, pre/post‑conditions). (See B.1.4 for NC‑1..3 invariants; B.1.5 adds duration/capability typing.)

Γ_time (temporal) — additional obligations

  • TIME‑COV (Coverage & identity). Show that PhaseOf intervals cover the declared window without overlap for the same carrier; justify any gap/overlap explicitly.

Note on Γ_work. Resource spending and efficiency live in Γ_work. Their measurement integrity can influence R for a claim (e.g., if a reliability figure depends on calibrated energy input), but costs themselves are not assurance; keep them in Γ_work and cite their measurement assurance as inputs here.

Archetypal grounding (worked examples)

System archetype — Battery pack safety claim

  • Claim C: Pack P meets discharge current L with thermal safety margin δ in environment K.

  • Context K: Ambient ≤ 35 °C; airflow ≥ X; duty cycle Y. Scope S = run.

  • Graph: Cells ComponentOf modules ComponentOf pack; BIC exposes main power and thermal interface.

  • Inputs:

    • F per node: module spec F2, cell test F1 → F_eff = F1.
    • G: operating envelope regions; union constrained by evidence relationed test regimes.
    • R: per‑module reliability from test data; cutset is hot‑spot path near weakest cell.
    • CL: interface congruence (sensor calibration CL2; thermal contact CL1).
  • Aggregation:

    • R_raw = min R_i along the thermal cutset.
    • R_eff = max(0, R_raw − Φ(CL_min=CL1)).
    • G_eff: union of evidence-covered (L,T) rectangles, dropping regions lacking validated thermal data.
    • F_eff = min(F_cell=F1, F_module=F2) = F1.
  • SCR: Evidence for calibration, test campaigns, BIC.

  • Improvement path: raise CL (better thermal interface verification), raise F (formal thermal model), add evidenced envelope → R_eff and G_eff increase monotonically.

Episteme archetype — Meta-analysis claim

  • Claim C: Intervention X reduces outcome O by Δ on population P.

  • Context K: Inclusion/exclusion criteria, measurement protocol; S = design.

  • Graph: Studies MemberOf evidence corpus; effect models ConstituentOf synthesis; mappings align different outcome scales.

  • Inputs:

    • F: two RCTs at F3, one observational at F2 -> F_eff = F2.
    • R: per-study replication/quality -> weakest R on the entailment spine caps R_raw.
    • CL: mapping of scales (CL1 vs CL3).
    • G: populations union, but unevidence-covered sub-populations are dropped.
  • Aggregation:

    • F_eff = F2 from the weakest study-design evidence relation in the synthesis.
    • R_eff = max(0, min(R_RCT1, R_RCT2, R_OBS) - Φ(CL_min=CL1)).
    • G_eff: union of evidence-covered sub-populations; out-of-scope groups excluded.
    • CL_min = CL1 for scale mappings; record the mapping witness and weakest-link study in the SCR.
  • SCR: Data provenance, scale mappings, bias assessment, and proof-term hash for the effect-model equivalence when it is used constructively.

  • Improvement path: upgrade mapping verification to CL2/CL3; increase F via registered analysis plan; replicate lagging study.

Order/Process archetype — Manufacturing route assurance

  • Claim C: Route R meets output defect rate ≤ ε.

  • Context K: Materials, equipment class; S = run.

  • Γ_ctx records: σ order; declared independent branches; join conditions at inspection.

  • Assurance:

    • R_raw = min R_step along the critical path (includes inspection effectiveness).
    • Penalty from poor join soundness CL_min.
    • Improvement via faster but verified inspection (↑R_step) or tighter join spec (↑CL).

Temporal archetype — Versioned model credibility

  • Claim C: Model M predicts within ±δ over τ.

  • Context K: Data regime and drift tolerance; S = run.

  • Γ_time records: PhaseOf slices v1, v2, v3 covering τ.

  • Assurance:

    • R_raw = min(R_v1, R_v2, R_v3);
    • penalty if v2–v3 interface had low calibration congruence;
    • improvement via re‑calibration (↑CL) or new validation campaign (↑R_v3).

Conformance Checklist (normative)

IDRequirementPurpose
CC-B3.1An assurance result SHALL be a typed claim Assurance(H, C &#124; K, S) with S ∈ {design, run}.Prevent scope drift and chimeras.
CC-B3.2F SHALL be treated as ordinal (min/thresholds only); G as a USM scope object (membership, intersection along essential paths, and SpanUnion only across independent support lines); R as ratio (min + conservative operations).Preserve scale integrity (CHR/USM).
CC-B3.3The Congruence Level CL SHALL live on edges; the penalty Φ(CL) SHALL be monotone decreasing and bounded (R_eff ≥ 0).Make integration quality first-class.
CC-B3.4R_eff SHALL be computed as R_eff = max(0, min_i R_i - Φ(CL_min)) for the relevant integration paths, unless a stricter domain-specific rule is justified.Enforce WLNK and penalize low-CL integrations.
CC-B3.5For G, essential dependency paths SHALL compose by intersection; SpanUnion is allowed only across explicitly independent support lines to the same claim and only over supported slices.Prevent over-generalization.
CC-B3.6An Assurance SCR SHALL be produced, listing node/edge values, Evidence Graph Ref, and any OrderSpec/TimeWindow identifiers, and SHALL also display the describe(EntityOfConcernRef->GroundingHolonRef) binding for the claim, the declared CHR:ReferencePlane ∈ {world|concept|episteme}, a separable TA/VA/LA evidence breakdown per CC-KD-08, decay/valid-until indicators on empirical bindings, and the Epistemic-Debt tally from B.3.4.Provide auditability through A.10 without collapsing evidence families.
CC-B3.7Agency-CHR values (A.13) SHALL NOT override WLNK or Φ(CL) penalties; if agency grade change alters capabilities, model it as a Meta-Holon Transition.Preserve safety; keep agency separate.
CC-B3.8Design-time and run-time assurance SHALL NOT be mixed in one tuple; compare them side by side if needed.Avoid design-time and run-time mixing.
CC-B3.9If an assurance claim depends on a C.28 causal-use verdict, it SHALL consume CausalUseSupportVerdict, CausalEvidenceSupportBasis, and relevant profile refs from C.28/A.10; unsupported CausalityLadderRung climb SHALL degrade, block, or abstain rather than raising R.Prevents assurance prose from certifying unsupported causal claims.
CC-B3.10A local C.28 downgrade, reroute, or abstain SHALL NOT be treated as a new assurance tuple trigger unless the claim is assurance-bearing, publication-bearing, release-bearing, or reused as an assurance input.Keeps cheap causal triage from becoming assurance ceremony.
CC-B3.11A conforming B.3 use SHALL NOT treat a label, badge, dashboard tile, credential display, provenance mark, compliance-looking mark, model card, datasheet, data card, assurance document, attestation label, or generated confidence phrase as raising F, G, R, CL, readiness, safety, compliance, trust, release confidence, or assurance unless a typed Assurance(H, C &#124; K, S) claim and A.10 evidence path name the claim, assurance use carried by the assurance tuple or relying context, scope, evaluation condition, evidence carriers, argument and assurance rationale, limitations, decay condition, reopen condition, and relying context.Blocks visible authority-looking labels from supplying false assurance relation.
CC-B3.12When reliance on a source may materially change behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people/team status, operational action, or controlled-object regulation, the B.3 result SHALL provide a minimum reliance safety assurance record or explicitly reject, narrow, degrade, abstain, or reopen the attempted assurance use. The local Tech label RelianceSafetyCase SHALL NOT be used as a certificate, approval, gate, policy source, Core kind, release permission, or general safety-case ontology.Keeps safety-bearing reliance relation concrete without turning every source-looking item into a dossier or a new authority system.

Anti‑patterns and repairs

Anti‑patternSymptomRepair
Averaging assuranceMean of R_i reported as system reliabilityUse min R_i on the cutset, then apply Φ(CL_min).
Ordinal arithmeticAveraging F or CL to produce “2.3”Use min/max or thresholds; never average ordinals.
Coverage as centroidReplacing G union with a single “typical point”Keep G as set/coverage; if a numeric proxy is needed, derive it from the set.
Ignoring congruenceNo penalty for low-CL mappings or interfacesAssign CL to integration edges and apply Φ(CL_min).
DesignRunTag chimera“One score” mixing blueprint and telemetrySplit into S=design and S=run tuples; compare explicitly.
Agency overrideClaiming higher assurance because a controller is “clever”Agency may justify how improvements are achieved; it cannot remove WLNK or Φ.
MemberOf as stockUsing MemberOf to sum reliabilitiesKeep MemberOf for collections; reliability comes from the relevant Γ composition (e.g., Γ_sys cutset).
False assurance relationBadge, dashboard color, credential display, compliance mark, provenance label, model card, datasheet, data card, assurance document, attestation label, or generated confidence phrase is used as an assurance claim.Keep it as orientation or source pointer unless a typed assurance claim and A.10 evidence path make the intended assurance use admissible.
Minimum reliance safety assurance record inflationOrdinary evidence, source-finding explanation, local CV, documentation, or reversible local calibration use is forced into a safety assurance record; or the assurance record is used as approval, release permission, gate passage, safety acceptance, or compliance proof.State the trigger that makes B.3 live. If the trigger is absent, return to A.10, E.17.EFP, A.20, A.21, E.19, or the local relation. If the trigger is live, write only the minimum assurance record and contest/redress path needed for the named reliance use.

Consequences

Benefits

  • Comparable, conservative, improvable. The tuple ⟨F, G, R⟩ with edge-scoped Congruence Level (CL) values gives a compact, auditable view that improves monotonically under targeted actions (formalize, replicate, reconcile).
  • Cross‑scale coherence. Works for assemblies and arguments, methods and histories, without leaking order/time/cost into structure.
  • Clear upgrade paths. It is obvious what to do to raise each component (raise F/G/R locally or raise CL on the glue).

Trade‑offs

  • More explicit metadata. You must state scale kinds, cutsets, and mapping congruence; this is intentional transparency.
  • Conservatism may feel pessimistic. True synergy appears only via MHT or after raising CL—never by arithmetic optimism.

Rationale (informative)

B.3 distills mature post‑2015 practice across several fields into a single, small calculus:

  • Assurance by weakest link reflects reliability engineering and safety cases in complex systems; composing assurance evidence by minima prevents over‑statement.
  • Formality and verifiability mirror advances in model‑based engineering and formal verification, where raising F turns subjective arguments into verifiable records.
  • Coverage as set/measure follows evidence synthesis and validation practice that treat applicability as a domain region, not a scalar to “average.”
  • Congruence on edges captures what meta‑analysis, interface control, and ontology alignment have repeatedly shown: integration quality is often the real bottleneck. Penalizing low‑CL is a principled way to prevent silent over‑confidence while rewarding verified reconciliation.
  • Assurance documentation, provenance, and release-status practice treats labels, model cards, datasheets, C2PA provenance marks, SLSA and in-toto attestations, credential displays, generated confidence phrases, and dashboards as scoped documentation or source pointers, not automatic assurance claims. B.3 adopts claim, argument, and evidence discipline and scoped assurance-documentation use, adapts model cards, datasheets, data cards, attestations, provenance marks, dashboards, and generated confidence phrases as possible documentation or evidence inputs for a named assurance claim, and rejects visible-label promotion into readiness, compliance, safety, trust, R, F, G, CL, or release confidence without a typed tuple and A.10 evidence path.

Action result from that safety-case and assurance-documentation practice basis: safety notes, compliance-looking labels, assurance documents, dashboards, provenance marks, model cards, datasheets, data cards, and generated confidence phrases do not become certificates, approvals, gates, safety acceptance, or assurance by appearance. The local B.3 result is one typed assurance claim or minimum reliance safety assurance record for the named reliance use, with A.10 evidence path, assumptions, limitations, defeaters, residual uncertainty, monitoring or stop condition, contest and redress path, admissible use, unadmissible use, and reopen when evidence, context, profile, monitoring, or admissible challenge evidence materially changes the disposition.

This arrangement preserves A.11 Parsimony (few characteristics), aligns with A.14/A.7/A.15 (clear separation of structure, order, time, cost, values), and leaves Context for domain‑specific refinements that do not break the invariants.

Relations

  • Builds on: B.1 (Universal Γ), B.1.1 (Proof Kit), B.1.2 (Γ_sys & BIC), B.1.3 (Γ_epist & SCR), B.1.4 (Γ_ctx/Γ_time), A.12 (Transformer), A.14 (Mereology), A.7 (EntityOfConcern/Description strict distinction) and A.15 (role/method/work alignment), C.13 (Compose‑CAL).
  • Coordinates with: E.14 (Human‑Centric Working‑Model) for publication-facing assertion discipline and B.3.5 (CT2R‑LOG) for Working‑Model relation aliasing and grounding (tv:*, validationMode).
  • Coordinates with: C.28 for causal-use support verdicts, CausalityLadderRung, identification profile refs and realizability profile refs, and supported causal use and unsupported causal use; A.10 for the evidence graph path carrying causal evidence-basis refs.
  • Coordinates with: A.15 for work disposition and reliance disposition, A.6 for mixed authority wording, A.21 for OperationalGate(profile), GateDecision, and DecisionLogRef, A.20 for ConstraintValidity status or witness, and A.15.1 for release or deployment work occurrence. B.3 only handles typed assurance use; labels and evidence pointers return to the neighboring source when assurance is not live.
  • Used by: KD‑CAL action patterns (to plan improvements), B.4 (Evolution loops that raise F/G/R or CL over time).
  • Triggers: B.2 (Meta‑Holon Transition (MHT): Recognizing Emergence and Re‑identifying Wholes) when genuine new capabilities emerge that change the applicable cutsets or envelopes.

One‑page takeaway. Report assurance as ⟨F, G, R⟩ for a typed claim under explicit context/scope, and penalize by the lowest edge-scoped Congruence Level (CL) value. Improve assurance by raising F, G, R, or CL—and keep order, time, and cost in their own lanes.

Assurance relation for quantum-like claims

Quantum-like wording does not raise the claim-assurance requirement by default. A local C.26 modeling note can remain lightweight when it only prevents a representational mistake and is not used for action, close audit, certify readiness, or claim empirical superiority.

Action path:

  1. Decide the claim-assurance requirement before building assurance machinery.
  2. If the QL note only prevents a local misreading, keep it as QL-lite with ordinary evidence.
  3. If the claim will be reused, state the governing FPF pattern, local stop condition, and evidence relation or evidence-path state.
  4. If the claim is used for release, readiness, audit, compliance, assurance, or threshold-bearing action, build the B.3 assurance claim over named evidence carriers and scope.
  5. If the claim says QL is better, faster, more accurate, or uniquely necessary, compare rival models, baseline, mechanism, scope, and loss.
  6. State decay conditions and reopen conditions so an old QL-evidenced assurance claim does not silently stay current after probes, carriers, or scope change.
Claim-use requirementB.3 expectationOutput
Local modeling noteNo assurance tuple beyond the ordinary pattern and evidence noteQL-lite note with local stop
Reusable example or pattern-facing noteName the governing FPF pattern, local stop condition, and evidence relation or evidence-path stateReusable example with source relation
Decision, release, audit, readiness, or compliance useProvide F-G-R and congruence relation, evidence carriers, confidence, rival explanations, and decay or reopen conditionsAssurance tuple and evidence path
Comparative superiority claimAdd rival-model comparison, baseline, mechanism, and scope limitsBounded superiority claim or apply the neighboring FPF pattern that governs the live comparison

Useful outputs:

  • no B.3 action when QL is only a local representational lens;
  • a compact bounded assurance claim statement when reuse is modest;
  • a full assurance tuple only when consequence severity demands it;
  • a rejected, narrowed, or withdrawn claim when evidence does not carry the claimed assurance use or relying context.

C.29 mathematical-lens use relation

If a mathematical lens is used as input to assurance, readiness, reliability, release confidence, safety, trust, or engineering justification, write the assurance relation in B.3 with the relevant evidence path and residual-use limits. A C.29 output may be cited only as a lens-use result; mathematical elegance, validation regime, or a declared structure-preserving mapping does not raise assurance by itself. Evidence paths remain A.10; measurement construction and comparability remain C.16.

B.3:End

B.3.3 — Assurance Subtypes & Levels

Problem Frame

A complex project may generate hundreds of assurance targets and evidence carriers: design specifications, simulation models, test suites, and operational logs. While the Trust & Assurance Calculus provides a framework for evaluating these assurance targets and their evidence, teams often face a critical challenge: how to aggregate this diverse evidence into a single, meaningful signal of an assurance target's maturity. Simply counting the number of tests or documents can lead to "paper compliance," where an assurance target appears well-supported but has critical, unexamined weaknesses in its formal structure or conceptual alignment.

Problem

How do we create an objective, auditable, and balanced Standard for what constitutes "trustworthiness" at each stage of an assurance target's development state cycle? FPF requires a mechanism that moves beyond simple evidence counting to a qualitative assessment of assurance. This mechanism must prevent common failure modes, such as over-investing in run-time validation (LA) at the expense of design-time verification (VA), or neglecting the critical work of ensuring concepts are correctly mapped and typed (TA).

Solution

FPF establishes a formal Standard that links three distinct Assurance Subtypes to three computable Assurance Levels. An assurance target's level is not assigned manually by an author; it is derived automatically by its anchored evidence. This creates a transparent and falsifiable system for tracking an assurance target's progression from a speculative idea to a robust, reliable holon.

Assurance Subtypes: The Three Pillars of Trust

These three subtypes categorize the kind of question an assurance activity answers, ensuring a balanced approach to building confidence.

SubtypeCodeCore QuestionLinks to Epistemic ScoreManager's View: What It Prevents
Typing AssuranceTA“Does the assurance target faithfully represent its intended concept?”CL (Congruence Level)Miscommunication & Integration Failures. TA ensures that when a requirement says "Sensor," the design model's "Sensor" component is the same conceptual thing. This activity directly improves the Congruence Level (CL) of the integration edges between assurance targets.
Verification AssuranceVA“Is the holon logically correct under its stated assumptions?”FV (Formal Verifiability)"It Works on Paper" Errors. VA catches design flaws, logical inconsistencies, and specification errors before a single line of code is written or a physical part is machined. It ensures the blueprint is sound.
Validation AssuranceLA“Does the holon work correctly in the real world?”EV (Empirical Validability)"Works in the Lab, Fails in the Field" Surprises. LA confirms that the holon performs as expected under real or simulated operational conditions, accounting for noise, unexpected inputs, and environmental factors.

Computed Assurance Levels: Evidence-support progression

An assurance target's level is computed based on the evidence it has accumulated. This creates a declared progression for increasing trust without treating assurance as a generic ladder.

LevelNameHow It Is Computed
Level 0UnsubstantiatedNo verifiedBy or validatedBy evidence is present. The assurance target is a claim or an idea.
Level 1SubstantiatedAt least one verifiedBy or validatedBy link to an evidence carrier exists, and the assurance target is supported by Typing Assurance (TA).
Level 2AxiomaticThe assurance target is verifiedBy either a proof or a Compose‑CAL (Γₘ) constructive narrative that the author has linked from the Working‑Model via tv:groundedBy (CT2R‑LOG). Its FormalVerifiabilityScore (FV) meets or exceeds a pre‑defined threshold. Additionally, if the holon is designated as safety‑critical, it MUST also be supported by Validation Assurance (LA). For non‑critical holons, LA is recommended (SHOULD).

Didactic Note for Managers: What 'Level 1' Really Means

Think of moving from Level 0 to Level 1 as the first step toward professional seriousness.

  • Level 0 is an idea on a whiteboard. It has potential, but no receipts.
  • Level 1 means you have at least one receipt. You have anchored the idea to something concrete: a passing test, a formal sketch, a simulation result. It's no longer just an opinion.

Crucially, Level 1 also demands Typing Assurance (TA). This sounds technical, but its business impact is simple: it means you've named your terms correctly and consistently. You've used the Role-Projection Bridge (Pattern B.5) to ensure that the "Sensor" in your requirements document is the same "Sensor" in your architectural diagram. This basic alignment work is what prevents costly integration failures and endless meetings where teams talk past each other. Good typing is the foundation of clear communication, and at Level 1, FPF makes it mandatory.

Conformance Checklist

To ensure the integrity of the assurance calculus, the following rules are normative. A Target of Assurance (ToA) is any working-model element designated as a root claim (e.g., a root system requirement, safety goal, or core hypothesis).

  • CC-B3.3.1 (L1 Anchor Mandate): A ToA SHALL NOT be considered to have reached AssuranceLevel:L1 unless it is linked to at least one evidence carrier via verifiedBy or validatedBy.
  • CC-B3.3.2 (L1 Typing Mandate): A ToA at AssuranceLevel:L1 or higher MUST be supported by Typing Assurance (TA). This includes, at a minimum, that its core concepts are mapped via the Role-Projection bridge (Pattern B.5) and it conforms to its declared schema.
  • CC-B3.3.3 (L2 V&V Mandate): A ToA at AssuranceLevel:L2 MUST satisfy all L1 criteria. In addition, it MUST be supported by Verification Assurance (VA) with FV ≥ threshold_FV. For holons designated as safety-critical (e.g., criticality ≥ SIL-2), the ToA MUST also be supported by Validation Assurance (LA) with EV > 0. For non-critical holons, LA SHOULD be present.
    • Exemption Note: Purely formal epistemes (e.g., mathematical axioms) may justify an exemption from the LA requirement, provided this is documented in the formal episteme's rationale.
  • CC-B3.3.4 (Concept-Bridge Completeness): For any mechanism used in a model at AssuranceLevel:L1 or higher, all of its mandatory U.Types MUST be mapped to domain concepts via the Role-Projection bridge (Pattern B.5).
  • CC-B3.3.5 (Scope Separation): Assurance claims MUST maintain a strict separation between design-time and run-time scopes (Pattern A.4). An assurance tuple for a MethodDescription (design-time) SHALL NOT be conflated with one for its corresponding Work/Trace (run-time). The Evidence Graph Ref (verifiedBy, validatedBy) must point to evidence carriers or records with the appropriate scope.
  • CC-B3.3.6 (CT2R‑LOG Handshake): If a ToA depends on structural claims, those claims SHALL be published as Working‑Model relations and, when used to justify L2, SHALL declare validationMode=axiomatic and provide Constructive grounding with tv:groundedBy → Γₘ.(sum|set|slice) (see B.3.5 and C.13).
  • CC-B3.3.7 (Downward‑Only Dependence): Assurance publications or records (Mapping, Logical, Constructive, and Evidence) SHALL NOT impose vocabulary or layout back onto the Working‑Model surface (E.14).

Common Anti-Patterns and How to Avoid Them

Anti-PatternManager's View: What It Looks LikeHow FPF Prevents It
The "Tested but Untyped" Mess"Our code has 100% test coverage, but we still have integration bugs and nobody understands what the code do."CC-B3.3.2 makes Typing Assurance (TA) mandatory for L1. You cannot claim your work is "Substantiated" without first ensuring your terms and concepts are clear and consistently mapped.
The "Perfect Blueprint, Flawed Reality""The design was formally proven to be perfect, but the physical product failed catastrophically in the field."CC-B3.3.3 mandates Validation Assurance (LA) for safety-critical systems at L2. A perfect blueprint (FV=4) is not enough; you must also provide empirical evidence (EV>0) that it works in the real world.
The "Paper Compliance" Shell Game"We have thousands of documents and links, so we must be at a high assurance level."The computed AssuranceLevel is not based on the quantity of evidence but on its type and quality (via FV/EV scores). You cannot reach L2 without strong formal verification (VA), no matter how much validation (LA) you do.

Consequences

BenefitsTrade-offs / Mitigations
Objective Gatekeeping: The rules provide a clear, objective, and falsifiable basis for an assurance target's assurance status, eliminating subjective judgment and "assurance theater."Risk of Over-stringency: The rules might feel too strict for rapid prototypes. Mitigation: The requirements for L1 are deliberately lightweight, demanding only one piece of evidence and basic typing, making the first evidence-support transition accessible.
Balanced Assurance: The Standard requires a mix of evidence types for higher levels, preventing teams from over-investing in one area (e.g., testing) while neglecting another (e.g., formal specification).Risk of Evidence Inflation: Teams might add trivial evidence just to meet the criteria. Mitigation: The quality of evidence is assessed via the epistemic scores (FV, EV, CL); merely linking to low-quality evidence will not significantly raise the scores needed for L2.
Clear Progress Tracking: The assurance-level progression provides a clear roadmap for maturing an assurance target from an idea to a fully assured component, making planning and progress monitoring transparent.Overhead for Complex Holons: A holon with many ToAs may require significant assurance work. Mitigation: The framework allows grouping, where a parent claim's evidence can satisfy the coverage requirements for its children if explicitly declared.

Rationale

This pattern transforms the assurance framework from a descriptive taxonomy into a prescriptive, actionable Standard. By binding the computed AssuranceLevel to mandatory, well-defined evidence coverage, it makes the notion of "trustworthiness" in FPF an objective and auditable property. The rules ensure that as an assurance target's formality and claimed reliability increase, the rigor and balance of its supporting evidence increase in lockstep, operationalizing the principle of "no blind trust." The separation of design-time and run-time evidence, mandated by CC-B3.3.5, further ensures that claims made about a blueprint are not confused with claims made about a running system, preserving the integrity of the whole design-time and run-time evidence history.

Relations

  • Builds on: B.3.1 Characteristic & Epistemic Spaces, A.10 Evidence Graph Referring, A.4 Temporal Duality.
  • Constrains: The computation and interpretation of AssuranceLevel for all holons.
  • Enables: Objective quality gates in the Canonical Evolution Loop (B.4) and reliable inputs for the Trust-Aware Mediation Calculus (D.4).

B.3.3:End

Evidence Decay & Epistemic Debt

Problem Frame

The FPF assurance model (Pattern B.3.3) provides a robust framework for building trust in holons by anchoring claims to a rich body of evidence. However, it implicitly treats this evidence as timeless. A proof verified today is assumed to hold forever; a validation test run last year is given the same weight as one run yesterday. This assumption is dangerously flawed in any dynamic environment.

Consider a bridge certified in 1980. The assurance case, resting on evidence about steel fatigue from that era, would be considered highly reliable at that time. Today, after decades of environmental change, new material science insights, and an entirely different traffic load, would we still trust that original certification without re-evaluation? The context has drifted, and the original evidence has lost its relevance. FPF requires a formal mechanism to account for this natural decay of trust.

Problem

Without a calculus for evidence aging, FPF models are vulnerable to three critical failure modes:

  1. Silent Risk Accumulation: Trust silently decays. A component's high AssuranceLevel can become an illusion, resting on foundational evidence that is no longer valid in the current operational context. When aggregated, this stale trust propagates upwards, creating a seemingly robust system-of-systems that is, in fact, incredibly brittle.
  2. Audit Illusion: An assurance target can pass an audit with flying colors, showing a complete set of anchors to high-quality evidence, yet be fundamentally untrustworthy because that evidence is obsolete. This leads to a false sense of security and undermines the very purpose of the assurance case.
  3. Maintenance Paralysis: Without a systematic way to flag stale evidence, re-validation efforts are often misdirected. Teams either engage in costly, unfocused re-testing of everything, or, more commonly, do nothing, allowing epistemic debt to accumulate until a failure forces a crisis.

Forces

ForceTension
Timeless Truth vs. Contextual RealityFormal proofs and logical derivations feel permanent and universal, yet the assumptions they make about the world are context-dependent and perishable.
Rigor vs. AgilityContinuously re-validating every piece of evidence is prohibitively expensive and would paralyze any agile workflow.
Transparency vs. Cognitive LoadWe need to make the "staleness" of evidence visible, but we must do so without overwhelming teams with a constant barrage of decay alerts.
Governance vs. FlexibilityThere must be a formal method for managing aging evidence, yet teams need the autonomy to make risk-informed decisions about when to accept, refresh, or deprecate it.

Solution

FPF introduces a formal freshness model and a governance loop that make evidence aging a first-class, manageable property of the assurance calculus.

The Principle of Perishable Evidence

The core of the solution is a new normative principle: Evidence is perishable. The relevance of any piece of evidence is a function of time and context. An AssuranceLevel is therefore not a permanent achievement but a state that must be actively maintained.

Mechanism 1: The Freshness Standard (valid_until)**

Every evidence carrier anchored in the Assurance Layer MUST carry a valid_until attribute.

  • valid_until: ISO-8601-date | null
  • This attribute acts as a "best before" date, explicitly stating the time horizon over which its creators consider it to be fully relevant without review.
  • A value of null signifies that the evidence is considered perpetual. This is reserved for evidence carriers such as mathematical axioms or fundamental physical laws whose validity is not expected to decay on engineering timescales.

Mechanism 2: The Epistemic Debt Metric (ED)

When the current time t surpasses an evidence carrier's valid_until date, that evidence carrier begins to accrue Epistemic Debt (ED).

  • Definition: Epistemic Debt is a quantitative measure of an evidence carrier's "staleness." It is a function of its age past its expiry date.
  • Purpose: ED is not a penalty but a signal. It makes the invisible risk of relying on old evidence visible and measurable.

Mechanism 3: The Governance Loop (Refresh / Deprecate / Waive)

Epistemic Debt is managed through a project-level epistemic_debt_budget. When the total accrued debt exceeds this budget, an alert is triggered, and the team MUST take one of three actions:

ActionWhat It MeansManager's View: The Practical Consequence
RefreshProduce new, up-to-date evidence and set a new valid_until date."We invest the resources to re-validate." This is the engineering fix: run the tests again, update the model, re-certify the component.
DeprecateAcknowledge that the evidence is no longer valid and formally downgrade the AssuranceLevel of the dependent assurance target (typically to L0 or L1)."We accept the risk by lowering the component's official status." The component is no longer considered fully assured and may be flagged for restricted use until it is refreshed.
WaiveA designated authority (e.g., a senior systems engineer or a safety officer) formally accepts the risk of using the stale evidence for a limited time."I am signing off on this risk, for now." This is a temporary, auditable override. It keeps the project moving but makes the risk acceptance explicit and assigns responsibility.

Didactic Note for Managers: Managing Your "Trust Budget"

Think of Epistemic Debt exactly like financial or technical debt. It’s not inherently evil, but it must be managed. The FPF dashboard now includes a "Trust Health" meter.

  • Green: Your evidence is fresh. Your assurance case is solid.
  • Amber: Epistemic Debt is accumulating. It's time to plan for re-validation work in the next sprint.
  • Red: Your debt has exceeded its budget. Your CI/CD pipeline might be issuing warnings, and you are now carrying un-budgeted risk. You must immediately decide: Pay it down (Refresh), write it off (Deprecate), or take out a short-term, high-visibility loan (Waive).

This loop transforms the vague problem of "keeping things up to date" into a concrete, resource-managed, and auditable engineering process.

Mechanism 4: The Epistemic Debt (ED) Calculation & Aggregation**

To make ED a useful leading indicator, it must be computed and aggregated consistently.

  • Calculation: For a single evidence carrier i, its debt at time t is a function of its age past expiry: ED_t(i) = k * max(0, t - valid_until_i)

    • The coefficient k is a configurable linear decay factor (default: 1.0 per day), allowing projects to tune the "interest rate" on their debt.
  • Aggregation: The total ED for an assurance target A is the sum of the debt from all its direct and transitive Evidence Graph Ref: ED_t(A) = Σ_i ED_t(evidence_i)

    • This rule ensures that debt propagates up the holarchy. If a foundational component's validation expires, the entire system that depends on it inherits that debt.
  • Impact on Assurance Level: When an assurance target's total ED_t(A) exceeds a defined threshold (typically > 0 unless waived), its computed AssuranceLevel is provisionally downgraded by one level. For example, an L2 assurance target with expired evidence is treated as L1 for governance and risk purposes until the debt is resolved. This makes the consequence of inaction immediate and visible on project dashboards.

Conformance Checklist

  • CC-ED.1 (Freshness Mandate): Every evidence carrier anchored via verifiedBy or validatedBy MUST include a valid_until attribute. A value of null (perpetual) MUST be justified in the evidence carrier's rationale.
  • CC-ED.2 (Debt Budget Mandate): Every project or U.System at AssuranceLevel:L1 or higher MUST declare an epistemic_debt_budget in its manifest.
  • CC-ED.3 (Aggregation Mandate): The total Epistemic Debt of a composite holon MUST be the sum of the debt of its constituent parts, consistent with the aggregation rule ED_t(S) = Σ_j ED_t(child_j).
  • CC-ED.4 (Downgrade Mandate): An assurance target with ED_t > epistemic_debt_budget SHALL have its effective AssuranceLevel provisionally downgraded until the debt is resolved via Refresh, Deprecate, or Waive.
  • CC-ED.5 (Waiver Auditability): Any Waive action MUST be recorded as a formal, auditable event, citing the responsible authority, the rationale, and a new, short-term expiry date for the waiver itself.

Common Anti-Patterns and How to Avoid Them

Anti-PatternManager's View: What It Looks LikeHow FPF Prevents It
The "Perpetual Evidence" Fallacy"We verified this component five years ago, so it's still L2. It's just a simple library, nothing has changed."CC-ED.1 forces a valid_until date. The context (compiler versions, new vulnerabilities, OS updates) has certainly changed. Setting valid_until: null requires explicit justification that the evidence carrier is truly timeless, like a mathematical theorem.
The "Invisible Debt" TrapA critical component test suite has been failing silently for months, but the system dashboard is still green.CC-ED.3 ensures that the debt from the failing component's expired evidence propagates up to the system level, turning the dashboard amber or red and forcing attention.
The "Risk Acceptance by Silence""We know those tests are stale, but we're too busy to fix them. Let's just ignore the warnings for now."CC-ED.5 makes risk acceptance an explicit, auditable action. A manager must formally Waive the debt, putting their name on the decision. This transforms passive neglect into active, accountable risk management.

Consequences

BenefitsTrade-offs / Mitigations
Freshness honesty: The framework provides a transparent, quantitative way to track the erosion of trust over time, preventing "assurance rot."Process Overhead: Teams must now manage valid_until dates and respond to debt alerts. Mitigation: Tooling can automate much of this, suggesting default expiry dates based on evidence-carrier kind and providing one-click actions for the governance loop.
Risk-Informed Maintenance: Epistemic Debt becomes a leading indicator for maintenance and re-validation planning, allowing teams to allocate resources proactively, not reactively.Risk of False Positives: Overly aggressive decay coefficients (k) could create excessive noise. Mitigation: The k value is configurable, and the Waive mechanism provides a safety valve for situations where a formal refresh is not yet warranted.
Enhanced Auditability: The entire state progression of evidence—from creation to expiry and resolution—is now a traceable, auditable part of the FPF model.-

Rationale

Knowledge frameworks that ignore time degrade silently. By embedding entropy accounting (epistemic debt) directly into the assurance calculus, FPF gains a self-regulating "immune system." This pattern operationalizes the common-sense insight that evidence is perishable, transforming maintenance from an ad-hoc, often-neglected chore into a budgeted, auditable, and risk-informed engineering activity. It complements the human-centric loop of ADR-014 and the pragmatic utility guardrail of ADR-015 by ensuring that what we trust today remains trustworthy tomorrow.

Relations

  • Builds on: B.3.3 Assurance Subtypes & Levels, A.10 Evidence Graph Referring.
  • Constrains: The temporal validity of AssuranceLevel for all holons.
  • Enables: Proactive maintenance planning within the Canonical Evolution Loop (B.4) and provides a dynamic risk input for ethical and strategic decision-making (Part D).

B.3.4:End

Working-Model Relations & Grounding (CT2R-LOG)

One‑line summary. CT2R‑LOG treats the everyday Working‑Model relationsut:ComponentOf, ut:MemberOf, ut:PortionOf, ut:AspectOf —as the publication surface for structure, while binding each published edge to a grounding trace and a declared tv:validationMode. Authors keep using a short list of relations; reviewers get reconstructible provenance.

Intent

Provide a single, human-facing family of Working-Model relations as the publication surface, with explicit hooks for (G) grounding and (R) reliability, without exposing constructor jargon or overloading day-to-day authors.

What you get (manager/engineer view). The same relations you already know (e.g., ComponentOf) remain the public interface.

What changes (auditor/ontologist view).

  • Each published edge carries two additional commitments:

    1. tv:groundedBy → points to a reconstructible trace (e.g., Γ_m.sum) whenever the edge is structural.
    2. validationMode ∈ {axiomatic, inferential, postulate} → declares how the author justifies the assertion.

This is the alias‑plus‑grounding split: Compose‑CAL builds the trace; CT2R‑LOG declares the alias pattern and links it; Lang‑CHR supplies the labels.

Problem frame & forces (why this pattern exists)

  • Two audiences, one dial. Project managers want one relation family and stable views; ontologists want generative completeness and extensional identity.
  • Parsimony constraint. The Kernel stays minimal; construction is outside the Kernel.
  • Unification inside FPF. We already unify external vocabularies; the same discipline is applied internally so every pattern that needs mereology rides on one generative basis and one alias façade.

Problem

Declared sub‑relations of ut:PartOf (e.g., ComponentOf, MemberOf) are easy to use but not self‑justifying: nothing in their declaration shows why a given edge should be trusted, or how to re‑derive it if challenged. Conversely, exposing constructor traces everywhere makes the graph unreadable to non‑specialists.

We need: a stable publication surface for relations and a mandatory, reconstructible grounding channel—plus a visible validation intent that downstream assurance can reason about.

Solution (thumbnail)

CT2R‑LOG introduces a two‑link discipline around each canonical edge:

  1. Alias link (concept‑level). Working‑Model relations (e.g., ut:ComponentOf) are alias patterns over a general constructional principle. Denote by tv:AliasOf.

  2. Grounding link (evidence‑level). Each edge instance carries tv:groundedBy:

    • MANDATORY for all structural edges (sub-properties of ut:StructPartOf): the target is a valid Γ_m trace from Compose-CAL (one of sum, set, slice). Set validationMode=axiomatic; postulate SHALL NOT be used for structural edges.
    • Optional for epistemic edges (e.g., ConstituentOf, RepresentationOf): if no Γ_m trace is appropriate, attach an evidence object whose admissibility is governed by the declared validationMode ∈ {inferential, postulate} (assurance rules).
  3. Validation flag (author intent). Every declared edge or aggregation rule carries tv:validationMode with one of:

    • postulate — pragmatic working claim backed by observations;
    • inferential — reasoned consequence (proof outline);
    • axiomatic — constructive grounding via a Γ_m.* composition.

F–G–R alignment. F (the published Fact): :PumpA ut:ComponentOf :Skid12. G (its Grounding): :e123 tv:groundedBy :trace_Γm_sum_456. R (declared Reliability mode): tv:validationMode=axiomatic → inputs B.3.3’s AssuranceLevel assessment.

Vocabulary & notation (normative)

  • Working-Model relations (front‑stage). ut:ComponentOf, ut:PortionOf, ut:AspectOf are publication-grade sub-properties of ut:StructPartOf (structural); ut:MemberOf is a sub-property of ut:EpiPartOf (epistemic).

  • Alias principle (lexical). tv:AliasOf links a relation type to its generative rule schema (e.g., “ComponentOf aliases the result of a Γ_m.sum with role=component”).

  • Grounding (per‑edge). tv:groundedBy on an edge instance MUST point to a Γₘ trace (sum|set|slice) for structural edges (set validationMode=axiomatic); for epistemic edges it MAY point to an evidence object or a logical proof per declared validationMode ∈ {inferential, postulate}.

  • Trace family. Γ_m.sum, Γ_m.set, Γ_m.slice are the only normative constructors for structural grounding; no temporal or workflow constructor is added here (time slices live in Sys‑CAL; parallelism via set).

  • Validation flag. tv:validationMode ∈ {postulate, inferential, axiomatic} is required on every declared edge or aggregation rule; for structural edges postulate is disallowed.

Running example (didactic)

Story. A refinery team publishes :PumpA ut:ComponentOf :Skid12.

  • Publication — Working-Model surface. They mint one edge with the Working-Model relation ComponentOf and declare the surface’s U.Formality (typically F≈F3, controlled narrative). Only the publication surface is visible to readers.

  • Constructive grounding (Γₘ). In the background, the edge node records tv:groundedBy :trace_Γₘ_sum_456. That trace is a Compose-CAL “sum” that lists the parts aggregated into the skid. Any auditor can replay the trace to prove extensional identity. (Grounding does not change the surface’s F; it sets validationMode=axiomatic and contributes to R in the VA lane.)

  • Assurance stance & R-lane. Because the edge is construction-backed, authors set tv:validationMode=axiomatic. B.3.3 reads the flag and assigns an AssuranceLevel in the appropriate R lane (scale defined in B.3.3). F, G, and R remain orthogonal: this move raises assurance without changing claim scope (G) or the surface’s formality (F).

  • Contrast (epistemic). When the same team asserts :MassFlowRepresentation RepresentationOf :FlowModel, they declare validationMode=postulate and attach a calibration dataset (Empirical Validation) instead of a Γₘ trace. The edge remains publishable, but reviewers record a lower-confidence stance, and B.3.4’s evidence ageing policy will decay its trust over time.

Result: one visible relation for engineers, two hidden anchors for assurance.

Author Standard (at a glance)

When you add or import a relation edge:

  1. Pick a Working‑Model relation (ComponentOf/MemberOf/…); avoid raw ut:PartOf unless you are drafting meta‑level axioms.

  2. Attach tv:groundedBy:

    • Structural? → must be a Γ_m trace ID.
    • Epistemic? → Γ_m trace or evidence object.
  3. Declare tv:validationMode (postulate / inferential / axiomatic).

What managers see: nothing new in the graph picture. What auditors get: a reliable trail from every published edge back to a principled constructor or an evidence pack.

Compatibility & cross‑references

  • B.3.2 (LOG‑use). CT2R‑LOG supplies the places to hang proofs/evidence that B.3.2 formalizes.
  • B.3.3 (Assurance levels). validationMode + presence/quality of tv:groundedBy are the inputs to compute AssuranceLevel (L0–L2).
  • B.3.4 (Evidence ageing). If an edge relies on postulated evidence, its confidence decays per that pattern until refreshed; axiomatic edges from Γ_m traces do not age, but their inputs (tokens) might.

Rule‑set — CT2R‑LOG (conceptual, human‑first)

Intent (one line). Make Working‑Model relations the canonical interface for authors, while providing a clean, optional bridge to formal assurance by way of aliasing and grounding semantics.

Vocabulary & Roles (what the words mean in this pattern)

  • Working‑Model relation. A human‑oriented statement an engineer would naturally write, using U.Type relations such as ut:ComponentOf, ut:PortionOf, ut:AspectOf, ut:MemberOf. This is the canonical publication surface for structure for readers and reviewers in Part B. (Didactic primacy governs this choice.)

  • Assurance Layer. Three complementary kinds of support an author MAY attach:

    • Constructive grounding: a generative narrative that reconstructs the relation via the three mereological aggregators (Γ_m.sum | Γ_m.set | Γ_m.slice) from Compose‑CAL. (No formal notation is required in this pattern—only a reconstructible story of construction.)
    • Logical grounding: a reasoned chain (think KD‑CAL style arguments) that shows why the relation follows from stated premises.
    • Mapping grounding: a type/lexical alignment that shows the domain label truly denotes the intended U.Type relation (Kind-CAL / Lang‑CHR stance). These three kinds of support are complementary, not exclusive.
  • Empirical Validation. How a published relation meets reality (observations, calibration scenarios). It lives beside, not inside, the relation. (See B.3 family.)

  • Grounding vocabulary (tv:).

    • tv:AliasOf — declares that a Working‑Model relation is the canonical projection of a more general pattern (its “principle of use”).
    • tv:groundedBy — points to the author’s grounding narrative (Constructive, Logical, or Mapping, as applicable). The tv: namespace is part of the Core conceptual lexicon; it is notation‑agnostic and tool‑agnostic.
  • tv:validationMode ∈ {postulate, inferential, axiomatic}. A declaration by the author of the confidence stance for a relation instance: postulate — a pragmatic working claim; inferential — a reasoned consequence; axiomatic — a constructively grounded identity (mereological extensionality is exhibited). (Modes align with the B.3 cluster’s trust model.)

Authoring note. This pattern defines meanings, not formats. The words above SHALL be used consistently and without reference to any specific notations or execution environments (Guard‑Rails: Notational Independence).

Normative rules (MUST/SHALL clauses for thinking‑and‑writing)

S‑1 (Working-Model first). Authors SHALL publish structural claims in the Working‑Model form (ut:*Of relations). This is the canonical interface for human readers and cross‑disciplinary teams. Formal reconstructions are optional and live in the Assurance Layer.

S‑2 (Alias declaration). If a Working‑Model relation follows a known general principle, the author SHOULD declare tv:AliasOf <Principle>, thereby making the intended use‑pattern explicit for reviewers and future readers. (This improves comparability without introducing extra formality.)

S‑3 (Grounding by mode). For every relation instance the author MUST set validationMode and follow the corresponding grounding stance:

  • S‑3.a postulate. The author MAY omit Γ_m grounding; the relation stands as a pragmatic working claim within a stated scope. The author SHOULD supply brief empirical cues (where the claim tends to hold) to ease later validation. (Empirical Validation is tracked in B.3.)

  • S‑3.b inferential. The author SHALL outline a reasoned chain (plain‑language steps) that makes the relation a consequence of previously admitted statements. No formal calculus is required in this pattern; the outline must be sufficient for a peer to follow. (Think KD‑CAL stance, conceptually.)

  • S‑3.c axiomatic. The author SHALL provide a constructive grounding narrative that reconstructs the relation as a Γ_m.sum | Γ_m.set | Γ_m.slice composition and SHALL link it with tv:groundedBy. The narrative MUST be reconstructible by a competent peer without introducing new primitives (parsimony). (Compose‑CAL’s three aggregators are the only constructive moves assumed here.)

  • S-3.d Structural constraint. For structural edges, tv:groundedBy → Γ_m.* is REQUIRED regardless of validationMode; the postulate mode MUST NOT be used for structural mereology.

S-4 (Relation-kind sense-making).

  • For structural subtypes of ut:StructPartOf (Component/Portion/Aspect), constructive grounding (tv:groundedBy → Γ_m.*) is REQUIRED in all modes; postulate MUST NOT be used for structural mereology (see S-3.d).

  • For epistemic/constitutive links (e.g., representation, usage), constructive grounding is OPTIONAL in all stances; authors prefer inferential or postulate with empirical cues.

S‑5 (Order and time are not mereology). Authors SHALL NOT encode execution order, parallelism, or temporal slicing as part‑whole. Such concerns belong to Γ_method and Γ_time families and SHOULD appear as method/time statements adjacent to, not inside, Working‑Model structure. (This prevents conceptual leakage between planes.)

S‑6 (Unidirectional dependence). CT2R‑LOG may consume Compose‑CAL and KD‑CAL conceptually; it SHALL NOT redefine them. Meaning flows downward only (Kernel → Extention → Context → Instance).

S‑7 (Register discipline). When naming principles in tv:AliasOf, authors SHOULD use Tech/Plain twin labels where available and obey minimal‑generality and rewrite rules (LEX‑BUNDLE), so that aliases are recognisable across context of meaning.

S‑8 (No tool talk). Core prose MUST NOT introduce CI/CD terms, file formats, APIs, or machine‑oriented notations in place of concepts. If examples are needed, they MAY be plain‑language narratives or domain vignettes. (This pattern is conceptual by Standard.)

Scope & Non‑Goals (to keep the plane clean)

  • In scope. Canonical publication of relations for humans; alias‑to‑principle clarity; conceptual grounding stories; author‑declared validationMode; separation of structure vs order/time.

  • Out of scope. Any machinery that executes checks; any binding to specific notations; any process/workflow mechanics; any discussion of file formats. (Those belong to tooling publications, pedagogy publications, and supporting records; they SHALL NOT be imported by the Conceptual Core.)

  • Edge placements. When a claim is chiefly about naming fit across Contexts, prefer Mapping grounding (Kind-CAL/Lang‑CHR stance). When it is chiefly about why it follows, prefer Logical grounding. When it is about what the whole is, from its parts, prefer Constructive grounding. (Authors MAY combine them.)

Author’s working moves (micro‑playbook, notation‑free)

M‑1. State the relation in Working‑Model form (e.g., “Impeller ComponentOf Pump”). M‑2. Pick validationMode:

  • If you’re sketching and exploring → choose postulate; add one‑sentence scope.
  • If you’re justifying from known statements → choose inferential; list the 2–4 steps in plain language.
  • If you require extensional identity → choose axiomatic; narrate the Γ_m.* reconstruction in a short paragraph.

M‑3. Add tv:AliasOf to the principle you intend readers to recognise (e.g., “Component = sum of parts”). M‑4. Keep order/time adjacent, not embedded: if you need “assembled in two parallel lines”, write that as a method/time statement next to the structure, not as a part‑of edge. M‑5. Stop when the reader can follow without guessing. This is the stopping rule for Quarter 2: clarity before formality. (Didactic primacy.)

Bias‑Annotation (auditable, human‑first)

The purpose of this section is to make typical cognitive slips visible and name the counter‑moves an author (or reviewer) should apply in thought—not with tools. These biases are generic; the remedies point to earlier FPF guard‑rails and neighbouring patterns.

Bias (name)Symptom in the modelCognitive counter‑move (conceptual only)Where to check
Formalism captureTreating a constructive trace as “the real thing” and the human relation (e.g., ComponentOf) as an optional label.Re‑assert canonical‑first: the Working‑Model relation is the canonical publication. A constructive trace is a grounding you may attach when assurance demands it. Choose a validationMode explicitly.CC‑CT2R‑1, CC‑CT2R‑2; B.3 skeleton for assurance conservatism.
Canonical inversionDemanding a constructive grounding for epistemic claims by default. (For structural claims, Constructive grounding is mandatory; epistemic remains progressive.)Keep progressive assurance: declare validationMode ∈ {postulate, inferential, axiomatic}; reserve axiomatic with Constructive grounding for structural; use Logical/Mapping/Empirical where appropriate. Express formality via F (C.2.3), not tiers.CC-CT2R-2; B.3.3 relation-kind discipline & validation modes.
Order/time leakageEncoding sequence or phase as part‑whole edges.Apply Strict Distinction: order/time belong to Γ_method and Γ_time, not to mereology or CT2R relations.B.3 “keep order/time in their own lanes”; cross‑ref Γ_ctx/Γ_time.
Notation lock‑inLetting a diagram or syntax define the meaning (“it’s true because the diagram says so”).Enforce Notational Independence: meaning is defined in prose/maths; renderings are illustrative only.Part E guard‑rail on notational independence.
Congruence blindnessComposing strong parts through weak mappings without acknowledging the fit penalty.Make edge‑fit first‑class: reason about Congruence Level (CL) on connections; penalise low fit conceptually.B.3 universal aggregation skeleton (Φ(CL)); anti‑patterns list.
Collection/composition swapUsing MemberOf to stand in for PartOf (or vice versa), then carrying over reliability as if it were a structural sum.Re‑separate MemberOf (collections) from part‑whole mereology; read A.14 notes in Γ_epist context.Γ_epist context / A.14 compliance.
DesignRunTag chimeraMixing design‑time and run‑time evidence into one “assurance” line.Split the scope of the claim: S ∈ {design, run}; compare side‑by‑side rather than merging.B.3 typed claim tuple & anti‑pattern “DesignRunTag chimera”.

Reviewer reminder. Bias audit is a reading aid. It never licenses tooling talk in Core; use the guard‑rails in Part E to keep semantics primacy and unidirectional dependence of layers.

Conformance Checklist (normative, author‑facing)

The following obligations regulate how to think and write CT2R content. They are notation‑agnostic and purely conceptual.

IDRequirementPurpose
CC‑CT2R‑1 (Canonical‑first).A relation published for readers SHALL be stated in Working‑Model terms (ut:*Of) as the canonical form; any constructive or logical basis is recorded as grounding (not as the definition).Preserve human‑first canon and didactic primacy.
CC‑CT2R‑2 (Mode declaration).For every declarative relation or rule, the author SHALL declare tv:validationMode ∈ {postulate, inferential, axiomatic} in prose (no silent defaults).Make assurance intent explicit and auditable by reading.
CC‑CT2R‑3 (Structural axiomatic grounding).If the relation is structural (a subtype of ut:StructPartOf) and the author chooses axiomatic, they SHALL provide a grounding narrative that can be reconstructed as one of the Γ_m aggregators (sum, set, slice).Tie high‑assurance claims to constructive identity without tool mandates.
CC‑CT2R‑4 (No order/time in parts).Authors SHALL NOT encode order (Serial/Parallel) or phase/time as part‑whole relations; handle them via Γ_method / Γ_time when relevant to the claim.Maintain the structure/order/time firewall.
CC‑CT2R‑5 (Collection vs part).Authors SHALL keep MemberOf (collections) distinct from PartOf (structure) and refrain from carrying reliability as if membership implied structural composition.Prevent category errors flagged in B.3 anti‑patterns.
CC‑CT2R‑6 (Fit is explicit).Where mappings or alignments matter, the author SHALL reason about fit explicitly (Congruence Level, conceptually) and acknowledge that weak fit reduces the effective reliability of any composed claim.Keep integration quality first‑class.
CC‑CT2R‑7 (Notational independence).Core meaning MUST NOT hinge on any specific diagram or syntax; illustrative renderings, if present, are labelled informative.Ensure longevity and cross‑discipline portability.
CC‑CT2R‑8 (Layer direction).Grounding flows downwards from Working‑Model to Assurance layers (Mapping/Logical/Constructive). Authors SHALL avoid back‑defining the canonical relation by its Mapping, Logical, Constructive, or Empirical grounding.Preserve unidirectional dependence of layers.
CC‑CT2R‑9 (Scope split).When assurance is discussed, authors SHALL state the typed claim and scope S ∈ {design, run} and keep them distinct in reasoning.Prevent DesignRunTag chimeras.

Consequences (benefits, trade‑offs, mitigations)

Benefits

  • Cognitive clarity for authors and readers. By making Working‑Model relations canonical and keeping formal bases as optional groundings, CT2R reduces the barrier to disciplined reasoning while preserving a path to higher assurance when necessary. This honours the B.3 family's “few characteristics, conservative aggregation” ethos and keeps order/time outside of structure.
  • Progressive assurance without tooling commitments. The postulate → inferential → axiomatic assurance-posture progression lets teams raise assurance deliberately, matching their context and risk, in line with B.3.3’s maturity logic.
  • Explicit fit management. Treating edge‑fit (CL) as a first‑class concern prevents silent over‑confidence: weak mappings visibly cap reliability of composed claims.
  • Cleaner separation of concerns. Distinguishing collections from compositions and keeping sequence/time in Γ_method and Γ_time prevents recurrent category errors and preserves Γ‑algebra reviewability.

Trade‑offs & mitigations

  • Extra prose discipline. Declaring validationMode and writing a short grounding narrative (when axiomatic) adds authoring effort. Mitigation: reuse local templates; keep narratives concise and Γ_m‑oriented by idea rather than notation.
  • Temptation to stay “forever postulate.” Teams may stop at Working‑Model relations. Mitigation: use B.3.3’s subtypes/levels as a planning aid to decide where axiomatic or inferential grounding is worth the cost.
  • Perceived conservatism. Acknowledging weak fit (CL) may lower effective reliability of otherwise strong parts. Mitigation: treat CL as a guide to improvement (reconcile terms, align units, verify interfaces) rather than a punishment.

One‑line takeaway for managers. CT2R lets you talk in natural, domain‑meaningful relations while preserving a clear, optional path to formal grounding and empirical checking—so confidence can grow deliberately without dragging your model into tooling or syntax.

Rationale (informative)

13.1 Why canonical‑first? CT2R‑LOG treats the human‑readable, task‑appropriate relation (e.g., ut:ComponentOf) as the canonical publication form because that is what engineers and managers actually use to reason, decide, and communicate. The formal layers exist to support that form—not to replace it. This is consistent with the authoring Standard in Part E (pattern template and style guide), which privileges clarity, purpose and didactics over premature formalism in the body text. Authors write for people first, then point to the kind of assurance they are invoking.

13.2 Why two tv: links—and why concept‑only? tv:AliasOf and tv:groundedBy name conceptual bridges between a Working‑Model relation and its assurance. They are not mandates for any particular notational scheme; they are mental handles that keep authors honest about what grounds their claims (constructive, logical, mapping) and when that grounding is expected to be present. This honours the Notational Independence guard‑rail in Part E: we adopt concepts and obligations, not file formats or tool Standards, in the normative text.

13.3 Why a triad of validationMode? The triad {postulate, inferential, axiomatic} expresses staged formality compatible with the FPF stance on staged assurance: start with what the team can responsibly claim now, then move to stricter justification where risk or context demands it. That gives reviewers a shared vocabulary for the declared assurance posture of a claim without changing the canonical relation itself.

13.4 Why keep order/time out of mereology? CT2R‑LOG aligns with A.14’s firewall: structure (parthood) is distinct from order and temporal coverage. The former is published as ut:StructPartOf sub‑relations; the latter live in Γ_method / Γ_time and must not be smuggled into part‑trees. This separation avoids classic modelling failures (temporal smearing, pseudo‑components for quantities) and keeps reasoning crisp across the Γ‑family.

13.5 Why point to Γ_m.sum | set | slice (Compose‑CAL) for constructive grounding? Three constructive moves—sum, set, slice—are sufficient to narrative‑rebuild all structural trees while preserving extensional identity. When an author selects the axiomatic stance, a brief grounding narrative can always be told in those terms, without expanding the kernel or inventing bespoke constructors. This satisfies parsimony (C‑5) and keeps formal power outside the kernel, in a calculus.

13.6 Why mental obligations rather than process mandates? Part E requires that patterns govern thinking and authoring; enforcement and automation, if any, are external concerns. CT2R‑LOG therefore states obligations as self‑contained cognitive checks: declare your mode; tell the constructive story only when you claim axiomatic strength; keep order/time in their places. This keeps the core specification evergreen and tool‑agnostic, as required.

Relations

Builds onA.14 Advanced Mereology — structural catalogue and the firewall that excludes roles/recipes and distinguishes Portion/Phase/Component/Constituent; CT2R‑LOG preserves these distinctions at publication time. • A.11 Ontological Parsimony (C‑5) — constructive grounding lives in a calculus; the kernel remains minimal. • B.1 Universal Γ — shared invariants and the placement of order/time in their respective Γ‑flavours. • Part E authoring rules — canonical pattern template and notational independence, which CT2R‑LOG explicitly follows.

Coordinates withCompose-CAL (Γ_m) — provides the constructive shoulder of the Assurance layer for structural relations; CT2R-LOG’s tv:groundedBy points conceptually to traces narratable as sum/set/slice. • KD‑CAL — provides the logical shoulder (inferential justification) when authors pick validationMode = inferential. • Kind-CAL / Lang‑CHR — provide the mapping shoulder (type alignment and language hygiene) supporting alias policies without altering Working-Model relations.

Constrained byNotational Independence (E.5.2) — CT2R‑LOG refuses to prescribe formats, keeping all obligations conceptual.

Specialises / feedsB.3.1B.3.4 — supplies the publication discipline (Working-Model relations, declared relation kind and validationMode; F per C.2.3 where relevant) that B.3’s trust calculus expects; interacts with ageing and assurance-level assessments without changing the relations themselves.

Non‑relations No introduction of order/time — CT2R‑LOG does not define SerialStepOf / ParallelFactorOf / temporal phases; those belong to Method‑CAL and Sys‑CAL (TemporalPart) respectively.

B.3.5:End

Canonical Evolution Loop

Problem Frame

The FPF is built on the Principle of Open-Ended Evolution (P-10). This is not merely a philosophical stance, but a pragmatic recognition that any useful holon—whether a physical system, a scientific theory, or a method—is in a perpetual state of becoming. A static model is a dead model. The framework, therefore, requires a universal, repeatable method that governs how holons adapt and improve over time. This process must bridge the abstract world of design-time blueprints with the concrete, messy reality of run-time operations, as mandated by the Temporal Duality principle (Pattern A.4).

Problem

Without a canonical, shared model for evolution, projects fall into predictable and costly failure modes:

  1. Design-Reality Divergence (The "Drift"): The run-time holon-in-operation (the "as-is") slowly drifts away from its design-time specification (the "as-intended"). Over time, the formal models become elegant fictions, assurance cases become irrelevant, and the team loses the ability to reason reliably about their own creation.
  2. Learning Stagnation (The "Ivory Tower"): Valuable insights are generated by observing a holon's performance in its context, but there is no formal method to feed this learning back into the design. "Lessons learned" are captured in static documents that are never acted upon.
  3. Chaotic Change (The "Whack-a-Mole"): "Improvements" are made in an ad-hoc, reactive manner. Each change is a patch, not a principled refinement. This introduces hidden dependencies and unintended consequences, often making the holon more fragile over time.

Forces

ForceTension
Stability vs. ChangeHow to evolve a holon continuously while maintaining its core identity and assurance guarantees.
Learning vs. OperatingHow to balance the need for a holon to be stable in its operational context with the need to gather data and learn from its performance.
Top-Down Intent vs. Bottom-Up RealityHow to reconcile strategic, top-down refinement goals with emergent, bottom-up feedback from operational reality.

Solution

FPF defines the Canonical Evolution Loop, a four-phase cycle that serves as the universal engine for all principled, open-ended evolution. This loop is a direct implementation of the Explore → Shape → Evidence → Operate state machine (Pattern B.5.1) and is powered by the Canonical Reasoning Cycle (Pattern B.5).

The loop creates a closed, auditable circuit between the two temporal scopes. Crucially, transitions between phases are performed by an external Transformer (Pattern A.12). A holon does not evolve itself; it is evolved by an external agent acting upon it.

A diagram showing a cycle: Operate (Run-time) → Observe (Run-time to Design-time bridge, performed by a Transformer) → Refine (Design-time) → Deploy (Design-time to Run-time bridge, performed by a Transformer) → Operate.

The Four Phases of the Loop:

PhaseCore ActivityRole of the External TransformerKey FPF Patterns Used
1. OperateThe holon exists in its run-time context, fulfilling its purpose.The Transformer observes the holon. It does not act on it, but gathers data about its performance or state. For a U.System, this could be a sensor. For a U.Episteme, this could be a researcher applying the theory and noting its predictions.A.4 Temporal Duality
2. ObserveThe Transformer compares the observed reality with an expected model, identifying an anomaly or an opportunity. This is the bridge from run-time back to design-time.The Transformer generates a new insight. Based on the observation, the Transformer (e.g., the research team, an automated analysis system) formulates a new hypothesis about how to improve the holon.B.5.2 Abductive Loop, A.10 Evidence Graph Referring
3. RefineThe design-time model of the holon is updated by the Transformer. A new hypothesis is shaped (Deduction) and tested against evidence (Induction).The Transformer modifies the blueprint. It alters the design-time episteme—the specification, the theory, the source code—to incorporate the new insight.B.5 Canonical Reasoning Cycle, B.3 Trust & Assurance Calculus
4. DeployThe Transformer instantiates the refined design-time model as a new run-time version of the holon. This is the bridge that carries improvements from the blueprint back into the real world.The Transformer builds and releases the new version. This could be a compiler building new software, a 3D printer creating a new physical part, or an editor publishing a revised version of a scientific paper.A.3 Transformer Constitution, A.4 Temporal Duality

Didactic Note: The "Learn and Adapt" engine

The Canonical Evolution Loop is a formal account of repeated adaptation. It keeps four durable questions explicit:

  1. Operate: "What is the holon doing in use or in the field?"
  2. Observe: "What anomaly, opportunity, or mismatch is now visible to a responsible Transformer?"
  3. Refine: "What design-time change would better fit what has been observed?"
  4. Deploy: "How is that refined design-time content instantiated back into run-time reality?"

The point is not managerial uplift. The point is to keep adaptation legible: every refinement has an observed basis, an external Transformer, and an auditable return from design-time into run-time.

Archetypal Grounding

The Canonical Evolution Loop is universal. It applies identically to the evolution of physical systems, bodies of knowledge, and operational methods. The following sub-patterns show how the loop becomes more explicit in neighbouring patterns.

  • B.4.1 - Observe -> Notice -> Stabilize -> Route (pre-abductive seam):

    • Context: A fleet of autonomous delivery drones (U.System) is in operation, and operators begin to notice that winter deliveries feel "off" before a clean anomaly statement exists.
    • Loop Example:
      1. Operate: The drones perform deliveries.
      2. Observe: A monitoring service (Transformer) and operators notice recurring cold-weather battery strain, but the evidence still has low articulation.
      3. Stabilize: The team publishes a U.PreArticulationCuePack that preserves the cue nucleus, the primary witness traces, and the current language-state position without pretending that a final anomaly or action record already exists.
      4. Route: The team publishes a RoutedCueSet that keeps multiple admissible continuations visible (for example, battery-chemistry investigation versus route-planning adjustment) so that endpoint governing patterns can take over without losing the early signal.
  • B.4.2 - Knowledge Instantiation (Theory Refinement Loop):

    • Context: A scientific theory of protein folding (U.Episteme) is being used to predict structures.
    • Loop Example:
      1. Operate: The theory exists and is applied by researchers.
      2. Observe: A research lab (Transformer) discovers a new class of proteins whose structure the theory fails to predict (an anomaly). They publish this finding.
      3. Refine: Another research team (Transformer) revises the original theory, adding a new term to its equations (design-time model) that accounts for the new protein class.
      4. Deploy: The team (Transformer) publishes the revised theory in a journal. The scientific community begins to use the new version. Note. The chart and any CG‑frame readings derived from this episteme MUST cite the updated MethodDescription (per A.19.CN CC‑A19.D1‑3) to keep comparability auditable.

    Adaptive-specialization note. Knowledge instantiation for one declared task family SHALL name the prior basis being refined from, the named work-measure threshold being pursued, the adaptation budget being spent, and the freshness or provenance basis for claiming the specialization is reusable. If the refinement is claimed as one specialization step, it SHALL also cite the declared TaskFamily or TaskSignature anchor that later C.22.1, G.5, and G.9 will consume. This keeps the refinement legible as contextual task-family specialization rather than vague general capability growth.

  • B.4.3 - Method Instantiation (Adaptive Method Loop):

    • Context: A field-maintenance organization uses a declared inspection-and-repair method (U.Method).
    • Loop Example:
      1. Operate: Teams execute the current method during each maintenance cycle.
      2. Observe: A review lead (Transformer) notes that the time from fault detection to safe restoration is repeatedly exceeding the allowed window (an anomaly).
      3. Refine: The method stewards (Transformer) revise the design-time method description by adding an earlier isolation step and a clearer classification checkpoint.
      4. Deploy: The revised method description is adopted for the next maintenance cycle. Note. Method evolution MUST be recorded as Γ_method composition over U.Method (design‑time) and separated from U.Work (run‑time), with DRR ids attached (per A.4/B.1.5).

    Adaptive-specialization note. Method instantiation for one declared task family SHALL name the narrower higher-fit specialist method or specialist portfolio being activated, the refinement budget being spent, the escalation or commit checkpoints, and the fallback when that method fails. If the method update is being used as evidence of specialization, the note SHALL keep the bearer of that specialization explicit: the holder, dyad, team, or scoped portfolio carries the claim; the method is only one selected vehicle. This keeps method evolution reviewable as bounded specialist acquisition rather than as hidden budget inflation.

Conformance Checklist

  • CC-B4.1 (Loop Integrity): Any evolutionary change to a holon MUST be documented as a full traversal of the four-phase loop. Ad-hoc changes that bypass a phase (e.g., deploying a refinement without a documented observation and evidence phase) are a process violation.
  • CC-B4.2 (Temporal Scope Mandate): The Refine phase MUST operate on design-time epistemes such as specifications, theories, source code, or method descriptions, while the Operate phase involves the run-time holon-in-operation. The Observe and Deploy phases are the only permissible bridges between these scopes.
  • CC-B4.3 (Transformer Mandate): The Observe, Refine, and Deploy transitions MUST be performed by an explicitly identified external Transformer (Pattern A.12). A holon cannot observe, refine, or deploy itself.
  • CC-B4.4 (Adaptive-specialization anchoring): When B.4.2 or B.4.3 carries a bounded-specialization claim, that claim MUST name the declared TaskFamily or TaskSignature, the work-measure threshold target, the adaptation budget, and the freshness or provenance basis for reuse.
  • CC-B4.5 (Adaptive-specialization boundary): B.4.2 and B.4.3 SHALL NOT silently re-govern selector or parity semantics. If transfer, retention, downstream exploitation efficiency, corridor entry, or downside cost are comparison-relevant, the pattern-local note MUST leave those fields recoverable by the downstream C.22.1, G.5, and G.9 governing patterns.

Common Anti-Patterns and How to Avoid Them

Anti-PatternObservable symptomHow FPF Prevents It (Conceptually)
The "Immaculate Conception"A new feature or design "just appears" in the specification, with no record of the problem it was meant to solve.CC-B4.1 and CC-B4.3 mandate that every refinement must start with an Observe phase, performed by a named Transformer. There is no change without a documented observation and an agent who made it.
The "Self-Healing Illusion"The model claims "the system automatically improves itself" without specifying the mechanism.CC-B4.3 forbids self-evolution. The model must explicitly show an external Transformer (which could be an automated control loop, but is still modeled as external to the holon being changed) that performs the Observe-Refine-Deploy cycle.
The "Run-time Edit"An engineer makes a "quick fix" directly on a live system without updating the official design documents.CC-B4.2 enforces that all refinements happen in design-time. A "hotfix" is conceptually an emergency, accelerated run through the entire loop: the fix is observed, designed, and then deployed.

Consequences

BenefitsTrade-offs / Mitigations
Creates a "Learning Architecture": The loop provides a formal, repeatable structure for continuous improvement and adaptation, making the organization's learning process explicit.Process Overhead: Documenting each phase of the loop can feel bureaucratic for small, rapid changes. Mitigation: The conceptual requirement for a DRR (Design Rationale Record) can be lightweight. The key is to capture the what and why of the change, not to create extensive paperwork.
Ensures Design-Reality Sync: The loop guarantees that design-time specifications and run-time realities are continuously reconciled, preventing divergence and maintaining a "living" assurance case.-
Makes Evolution Auditable: The evolution history of a holon, including every refinement and the rationale behind it, becomes a traceable, auditable record performed by named Transformers.-

Rationale

This pattern operationalizes the Open-Ended Evolution Principle (P-10) by providing its core engine. It is the FPF's formalization of proven iterative cycles like the Deming Cycle (Plan-Do-Check-Act) and the OODA Loop (Observe-Orient-Decide-Act), but it enriches them with the strong semantic distinctions of the FPF, such as design-time vs. run-time and the formal role of the external Transformer.

By making the Transformer's role explicit in every phase, the pattern avoids the common conceptual error of treating systems or theories as if they evolve on their own. Evolution is always an action performed by an agent on a holon. This rigorous, externalist stance is critical for clear causal reasoning and auditable accountability. By making this loop canonical, FPF ensures that all holons within its ecosystem are not just designed and built, but are designed to be evolved in a principled, traceable manner.

Relations

  • Implements: P-10 Open-Ended Evolution, A.4 Temporal Duality.
  • Orchestrates: B.5 Canonical Reasoning Cycle (provides the cognitive engine for the Observe and Refine phases) and B.3 Trust & Assurance Calculus (provides the metrics for the Evidence sub-phase).
  • Is detailed by: B.4.1 Observe -> Notice -> Stabilize -> Route for early cue routing, together with later B.4.x instantiation patterns for specific holon families.

Pre-abductive seam compatibility

For early language-state routing, Observe does not have to jump directly into anomaly or hypothesis forms. Observe may publish U.PreArticulationCuePack and a RoutedCueSet via B.4.1, after which later loops consume that routed cue publication directly or a downstream typed publication such as U.AbductivePrompt, as appropriate.

B.4:End

Observe -> Notice -> Stabilize -> Route

Type: Architectural (A) Status: Draft Normativity: Normative unless marked informative

Plain-name. Observe-to-route seam.

Problem frame

Observation rarely yields a ready anomaly, A.6.A invitation, or hypothesis in one step. Between low-articulation cue preservation and endpoint governance through governing patterns, the cluster needs one explicit route-bearing seam that can publish route plurality or route selection without pretending that the cue already belongs to a governing pattern.

That seam begins after U.PreArticulationCuePack. Cue preservation may exist before routing. B.4.1 begins only when route publication itself becomes worth making explicit.

Problem

Without a pre-abductive seam, early cue publications are either lost, prematurely forced into late forms such as AnomalyStatement, Characteristic, ActionOption, or requirement language, or they smuggle route selection into cue-pack prose with no explicit route-governing pattern.

Forces

ForceTension
Early capture vs endpoint disciplinePreserve low-articulation cues without collapsing route discipline.
Plural route set vs explicit selectionPermit multiple candidate routes while still requiring an explicit selection record when selection occurs.
Seam clarity vs new-type inflationAdd a real seam without creating an uncontrolled zoo of new publication kinds.
Form vs face precisionKeep route-bearing publication form distinct from the MVPK face on which it is rendered.

Solution

Insert a pre-abductive route-bearing seam inside the language-state cluster, between observation/cue preservation and endpoint governing-pattern entries:

Observe -> Notice -> Stabilize -> Route

The seam yields a RoutedCueSet, normally downstream of U.PreArticulationCuePack.

RoutedCueSet shape

A conforming routed cue set may publish:

  • sourceCuePackRef
  • candidateRouteSet
  • routeDecision?
  • selectedRoute?
  • routeRationale?
  • routeAuthorityState?
  • multiRoutePolicy?
  • publicationFaceRefs?
  • articulationThresholdStatus?
  • closureStatus?
  • scope?
  • GammaTime?

RoutedCueSet is not itself the late endpoint. articulationThresholdStatus and closureStatus report guard state only; their governance remains with C.2.4 and C.2.5, and route discrimination may additionally cite C.2.6 or C.2.7 when anchoring or representation-factor differences are load-bearing.

candidateRouteSet and routeDecision are the load-bearing core here. selectedRoute, routeRationale, and routeAuthorityState belong here when route selection is explicit. They do not belong in U.PreArticulationCuePack.

publicationFaceRefs names MVPK faces only when face typing matters for publication or review. Faces are renderings of the routed cue set or of later typed projection publications; they are not the route-bearing form itself.

A multi-route RoutedCueSet is still one governed member. A lineage fork appears only after distinct successor publications are issued.

Starter route family and conditional extension species

The candidate route set may contain, among others:

  • starter canonical routes:
    • EvaluativeRoute
    • ActionInvitationRoute
    • ProblemAbductionRoute
    • MethodWorkRoute
    • RequirementCommitmentRoute
  • conditional extension routes for bounded specialization or corridor discovery:
    • TaskFamilySpecializationRoute
    • AdaptationProbeRoute
    • NonHumanUtilityRoute
    • SubstrateDiversificationRoute
Specialization-sensitive extension route family

These four routes are not part of the starter canonical core. Use them only when the cue already carries explicit bounded-specialization pressure, corridor-entry pressure, or substrate-fit doubt that governing patterns must be able to recover by value.

Use TaskFamilySpecializationRoute when the cue points toward acquiring one narrower higher-fit specialist lane for one declared task family under budget, where that lane may later resolve into one specialist method, portfolio, or competence bundle. Use AdaptationProbeRoute when the honest next question is whether threshold-reaching specialization is actually attainable under the current budget. Use NonHumanUtilityRoute when the cue suggests a promising utility target outside the current human-default solution corridor but still tied to one declared task family or utility target. Use SubstrateDiversificationRoute when the cue says the current method substrate may be too narrow and a broader or different substrate should be tested before commitment.

Contexts may refine the route family locally, but they shall keep the distinction between early route publication and endpoint governance.

Projection discipline

Here projection names route-bounded partialization, not a rival governing pattern and not a face kind. The resulting publication must be a typed publication form rendered, when needed, on an existing MVPK face.

A routed cue set may therefore lead to:

  • U.AbductivePrompt under B.5.2.0,
  • a later typed endpoint-entry publication under A.6.P, A.6.A, or C.16.Q,
  • or another explicitly typed upstream projection publication.

If no typed downstream publication form can yet be named honestly, stay in RoutedCueSet rather than hiding a pseudo-form behind face language.

Archetypal Grounding

Tell. Observation alone is not yet routing. A route requires at least a stabilized cue plus a declared candidate route set.

Show (System). An operator alarm may route toward intervention, rollback, or anomaly investigation without yet becoming work or a requirement.

Show (Episteme). An inquiry cue about a model-vs-observation discrepancy may route toward anomaly framing, opportunity framing, or probe design before a hypothesis exists.

Bias-Annotation

The pattern favors preserving low-articulation cues and publishing route plurality explicitly. The counter-bias is explicit as well: routing must still state why one route is live and why one route was selected if selection occurred.

Conformance Checklist

  • CC-B.4.1-1 Observe output SHALL NOT be forced directly into AnomalyStatement when articulation threshold is not yet met.
  • CC-B.4.1-2 A routed cue set SHALL name its candidateRouteSet.
  • CC-B.4.1-3 When route selection occurs, routeDecision, selectedRoute, and routeRationale SHALL be explicit.
  • CC-B.4.1-4 publicationFaceRefs MAY be named, but route-bearing form and publication face SHALL NOT be collapsed.
  • CC-B.4.1-5 RoutedCueSet SHALL NOT silently masquerade as a late endpoint governing pattern.
  • CC-B.4.1-6 When a specialization-sensitive route is kept live, the route package SHALL name the declared task family or utility target, the current budget window if known, the missing discriminator still needed, and the downstream governing pattern that would become admissible if the discriminator is satisfied.

Common Anti-Patterns and How to Avoid Them

  • Anomaly inflation. Treat every early cue as already an anomaly statement.
  • Cue-pack route smuggling. Hide route decision or route rationale upstream in U.PreArticulationCuePack.
  • False single-route certainty. Pretend one route is obvious when multiple candidate routes are still live.
  • Projection capture. Treat a typed downstream projection publication or its MVPK face as if it already governed the endpoint family.

Consequences

The benefit is an admissible early seam for language-state trajectories and a cleaner bridge from cue preservation to later patterns. The trade-off is one more explicit publication form and one more explicit route declaration.

Rationale

B.4.1 provides the route-bearing seam between cue preservation and endpoint or abductive entry. It keeps route publication explicit without forcing cue packs to become route records.

SoTA-Echoing

This matches practice in incident triage, exploratory design, model probing, and embodied cue work, where routing follows stabilization rather than appearing fully formed at first observation.

Relations

  • Builds on: B.4, C.2.2a, A.16, A.16.1, C.2.LS.
  • Coordinates with: A.16.0, C.2.4, C.2.5, C.2.6, C.2.7, B.5.2.0, B.5.2, A.6.P, A.6.A, C.16.Q, A.15, F.9.1.
  • Constrains: pre-abductive route publication.

Worked Route Sets

Multi-route operator case

An operator alert note about a service disturbance may admissibly publish a route set containing:

  • ActionInvitationRoute,
  • ProblemAbductionRoute,
  • and RequirementCommitmentRoute.

At this stage the point is not to collapse the routes into one winner, but to keep the plurality explicit until a selected route is justified.

Inquiry case

A conceptual mismatch may route simultaneously toward:

  • explanatory inquiry,
  • probe design,
  • and later lexical repair.

This is admissible only if the route rationale makes the plurality explicit rather than hiding it under vague prose.

Invalid direct jump

It is invalid to treat a routed cue set as if it were already a hypothesis, a gate, or a work plan. It is a route-bearing publication form, not the endpoint governing pattern.

Specialization-route and nonhuman-utility split

A routed cue set for a new task family may admissibly keep ProblemAbductionRoute, TaskFamilySpecializationRoute, and NonHumanUtilityRoute live together. The point is to preserve the declared task family, utility target, current budget window, missing discriminator, and possible corridor-entry load without laundering those routes into a premature prompt, selector, or policy choice.

Keeping route plurality useful

A routed cue set stays useful only when route plurality, route grounds, and current authority remain explicit without turning the seam into one hidden endpoint.

Minimal route package

A robust route package should identify:

  • the originating cue pack,
  • the candidate route set,
  • the route decision state,
  • the selected route, if any,
  • the grounds for each live route,
  • the conditions that would change route ranking,
  • and any typed downstream publication already published.

This is enough to keep later handoff reviewable without collapsing the seam into an endpoint governing pattern.

For specialization-sensitive routes, the package should also make explicit the declared task family or utility target, the current budget window, the missing discriminator still needed, and the downstream governing pattern that would become admissible if that discriminator is satisfied.

Selected route is not endpoint governance

Even when one route is selected, the routed cue set remains a seam publication form until a governing pattern is entered explicitly.

Review prompt and threshold reminder

A reviewer should check whether the selected route is justified by the published cue pack and whether suppressed alternative routes were genuinely considered rather than silently erased. If the articulation threshold is not yet met, keep the publication early rather than laundering it into a late prompt, requirement, or work governing pattern.

Deferred selection and route splitting

Deferral is admissible when route plurality and missing discriminators are published. It is not admissible when one route is silently assumed while the publication still speaks as if the question were open.

One cue cluster may also split into several routed cue sets if different sub-cues support different destinations. The split should be published explicitly so that later readers do not assume that one route exhausted the whole original cue complex.

Migration and worked continuation boundaries

B.4.1 governs route publication, not abductive reasoning, lexical repair, deontic commitment, or work execution. Those belong to governing patterns once the next publication is explicit enough to carry them.

Migration from anomaly-first prose

Older anomaly-first language should be migrated into route publication when the publication does not yet meet anomaly-governance entry conditions.

Intervention vs inquiry split

An operator-facing disturbance may legitimately support both:

  • an immediate intervention-oriented route,
  • and a slower explanatory route.

B.4.1 preserves both without forcing one to swallow the other.

Requirement-route overreach

A route set that includes RequirementCommitmentRoute should not be read as if the requirement already exists. The route is only one admissible continuation unless a later requirement governing pattern is actually entered.

Leaving the seam

The routed cue set should leave this pattern only when one later publication is already explicit enough to own the next move, for example:

  • explicit evaluative family selection for C.16.Q,
  • explicit A.6.A family selection,
  • explicit prompt question for B.5.2.0,
  • explicit requirement or commitment head for requirement-facing governing patterns,
  • or explicit A.15 hook for method, work-plan, or work-occurrence use.

If those next-governing-pattern conditions cannot yet be stated honestly, the governed publication still belongs in the seam and should keep its route plurality visible.

Route Evidence and Discrimination Package

Evidence-per-route rule

Each live route in a routed cue set should cite the cue grounds that actually support it. If a route has no published grounds, it is not a live route; it is only a private guess.

Discriminator publication

When a route set remains plural, authors should name the discriminator they are waiting for: a missing anchor, contrast, measurement, witness, articulation threshold, closure condition, or other explicit facet transition. Doing so makes deferred selection informative instead of merely indecisive.

Multi-route state is not yet a lineage fork

One routed cue set may keep several candidate routes live without yet forking lineage. A fork occurs only when distinct successor publications are actually issued and acquire their own authority, losses, or handoff semantics.

Projection restraint

A typed downstream projection publication or prompt may be shown as one admissible continuation, but it shall not dominate the routed cue set so much that the other routes become unreadable. Projection is guidance, not covert governing-pattern replacement.

Review test for false single-route certainty

Ask: if the selected route were denied, would the publication still contain enough information to explain the other live routes and the discriminator that would separate them? If not, the route set is under-published and has collapsed too early into one favored continuation.

B.4.1:End

Canonical Reasoning Cycle

Problem Frame

While preceding patterns define the anatomy of trust (Assurance Levels in B.3) and the structure of holons (A.1, A.14), they do not specify the cognitive "engine" that drives the creation and evolution of knowledge within FPF. A framework for thinking must provide more than just a filing system for conclusions; it must offer a repeatable, rigorous method for arriving at them, especially when confronting novel, complex, or ill-defined problems.

Problem

Without a formal, shared reasoning cycle, teams and individuals fall into predictable cognitive traps that stall progress and hide risks:

  1. Analysis Paralysis: Teams get stuck endlessly debating existing assumptions, running deductions within a closed world of known facts without a mechanism to introduce genuinely new ideas.
  2. Blind Empiricism: Teams engage in unstructured, expensive trial-and-error, running tests and gathering data (induction) without a clear, falsifiable hypothesis to guide their efforts.
  3. Innovation Gap: In the face of a problem where existing knowledge is insufficient, there is no formal "permission" or process to generate a creative, plausible guess—the essential first step of any breakthrough.

These pathologies lead to wasted resources, circular debates, and a failure to solve the very problems that require first-principles thinking.

Forces

ForceTension
Rigor vs. InnovationHow can we encourage creative, "out-of-the-box" hypotheses while maintaining formal discipline and verifiability?
Certainty vs. ProgressHow can we act and learn systematically when faced with incomplete information and uncertainty?
Theory vs. PracticeHow do we ensure that abstract models and formal deductions are continuously anchored to real-world evidence and empirical validation?
Systematic FlowHow do we transform problem-solving from a chaotic, ad-hoc art into a repeatable, auditable, and teachable science?

Solution

FPF establishes the Abductive–Deductive–Inductive Loop as its canonical reasoning cycle. This cycle gives formal primacy to abduction (hypothesis generation) as the engine of innovation, while using deduction and induction as the rigorous mechanisms for testing and refining those hypotheses.

The loop consists of three distinct, sequential phases:

Abduction (Hypothesis Generation)

  • Core Question: "What is the most plausible new explanation or solution?"
  • Description: This is the creative, inventive leap. When faced with an anomaly, a design challenge, or an unanswered question, the first step is to propose a new U.Episteme—a new requirement, a new component, a new causal link—that might solve the problem. This act is not guaranteed to be correct; it is a conjecture. Within FPF, this new, untested hypothesis episteme typically begins its life at AssuranceLevel:L0 (Unsubstantiated). Abduction is the only phase that introduces genuinely novel ideas into the model. This formalizes the process described in the Abductive Loop (Pattern B.5.2).

Deduction (Consequence Derivation)

  • Core Question: "If this hypothesis is true, what logically follows?"
  • Description: This is the phase of rigorous analysis. Given the new hypothesis, we use the formal models and calculi of FPF to deduce its logical consequences. What are its testable predictions? Does it create internal contradictions with other parts of the model? How does it propagate through the system? This phase aligns with Verification Assurance (VA) and is concerned with raising the hypothesis episteme's FormalVerifiabilityScore (FV). Deduction turns a plausible idea into a set of precise, falsifiable claims.

Induction (Empirical Evaluation)

  • Core Question: "Do the predicted consequences match reality?"
  • Description: This is the phase of testing and learning from evidence. The predictions derived in the deductive phase are compared against real-world data from experiments, simulations, or observations. This phase aligns with Validation Assurance (LA) and is the primary mechanism for raising the hypothesis episteme's EmpiricalValidabilityScore (EV) and, consequently, its Reliability (R). A successful test corroborates the hypothesis (raising its AssuranceLevel), while a failed test (a refutation) provides critical new information that feeds back into the next abductive cycle.

Didactic Note for Managers: The "Propose → Analyze → Test" Cycle

The Abductive-Deductive-Inductive loop is not an abstract philosophical concept; it is the formal name for the problem-solving cycle that all successful R&D and engineering teams instinctively use.

PhaseSimple NameWhat Your Team DoesFPF's Contribution
AbductionProposeBrainstorms a new feature, architecture, or fix.Gives formal permission for this creative step and a place to record the new hypothesis episteme (L0).

| Deduction | Analyze | Thinks through the implications, runs simulations, checks for conflicts. | Provides the formal models (VA, FV) to make this analysis rigorous and repeatable. | | Induction | Test | Builds a prototype, runs A/B tests, gathers user feedback. | Provides the framework (LA, EV, R) to measure the results and build an auditable evidence base. |

By making this cycle explicit, FPF transforms problem-solving from a chaotic art into a repeatable, auditable science. It gives teams a shared map for navigating from an unknown problem to a validated solution.

Conformance Checklist

To ensure the reasoning cycle is applied consistently and rigorously, the following criteria are normative:

  • CC-B5.1 (Abductive Primacy): Any discipline that introduces a new, non-derivable claim or design element into a working model MUST document it as an abductive step. The resulting claim or design element SHALL initially be assigned AssuranceLevel:L0 as a hypothesis episteme or equivalent working-model element.
  • CC-B5.2 (Deductive Mandate): An abductively generated hypothesis SHALL NOT be subjected to inductive testing (Validation Assurance) until its key logical consequences have been derived and documented through a deductive process.
  • CC-B5.3 (Inductive Grounding): A claim SHALL NOT be promoted to AssuranceLevel:L1 or higher on the basis of a successful inductive test unless that test is explicitly linked to a prediction derived in the deductive phase.
  • CC-B5.4 (Cycle Closure): The outcome of an inductive test (whether corroboration or refutation) MUST be formally recorded as an evidence carrier (Pattern A.10), and that evidence carrier MUST be used as an input for the next iteration of the reasoning cycle.
  • CC-B5.5 (State Machine Alignment): The Abductive–Deductive–Inductive Loop is the cognitive engine that drives state transitions in the Explore → Shape → Evidence → Operate state machine (Pattern B.5.1). Abduction dominates the Explore phase; Deduction dominates the Shape phase; and Induction is the core of the Evidence phase.

Common Anti-Patterns and How to Avoid Them

Anti-PatternManager's View: What It Looks LikeHow FPF Prevents It
The "Solution in Search of a Problem"A team builds a technically impressive feature (deduction/induction) but cannot clearly state what user problem it solves.CC-B5.1 forces the process to start with an abductive hypothesis that is explicitly framed as a solution to a stated problem or anomaly.
The "Ready, Fire, Aim" ApproachA team jumps directly from an idea to expensive prototyping and testing, without a clear model of what they expect to happen.CC-B5.2 mandates a deductive analysis phase before inductive testing. This ensures that every test is designed to confirm or refute a specific, well-defined prediction.
The "Data Dredging" ExerciseA team gathers massive amounts of data and looks for correlations, hoping a solution will emerge.The cycle requires a hypothesis first. Data is gathered to test that hypothesis, not in the hope of stumbling upon one. This makes the process more focused and cost-effective.

Consequences

BenefitsTrade-offs / Mitigations
Encourages Innovation: By formally sanctioning abduction, the framework creates a safe and structured space for creative problem-solving and the introduction of novel ideas.Abduction is not algorithmic: The framework cannot tell you how to generate a good hypothesis. Mitigation: It provides the structure to capture and test hypotheses, and can be used in conjunction with creative methodologies (e.g., TRIZ, design thinking) that specialize in hypothesis generation.
Improves Problem-Solving Efficiency: The cycle provides a clear, repeatable workflow that prevents teams from getting stuck in analysis paralysis or wasting resources on unfocused testing. It ensures that effort is always directed toward falsifying or corroborating a clear claim.Requires Iterative Mindset: The cycle is inherently iterative. Teams must be prepared for hypotheses to be refuted and for the need to restart the cycle. Mitigation: FPF's architecture (e.g., cheap state transitions) is designed to make this iteration low-cost.
Creates a Transparent Rationale: The cycle produces a complete, auditable trail of how a solution was developed: which hypotheses were proposed, what their consequences were, and how they fared against empirical evidence. This "intellectual provenance" is invaluable for future maintenance, audits, and learning.-
Aligns with Scientific and Engineering Best Practices: The cycle is a formalization of the scientific method (conjecture and refutation) and modern engineering design cycles (e.g., Deming's PDCA loop).-

Rationale

FPF is designed to be an "operating system for thought," and this reasoning cycle is its central processing unit. By elevating abduction to a first-class citizen, FPF acknowledges a fundamental truth about complex problem-solving: progress does not come from simply rearranging known facts (deduction) or finding patterns in data (induction). It comes from the creative act of proposing a new way of seeing the world—a new hypothesis. Deduction and induction are the indispensable tools we use to discipline and validate this creativity.

This pattern provides the engine that drives a hypothesis episteme through the AssuranceLevels progression. An abductive leap creates an L0 hypothesis episteme. Deduction begins the process of providing Verification Assurance, building its FV score. Induction provides the Validation Assurance, building its EV and R scores. Without this cycle, the assurance framework would be a static scoring system; with it, it becomes a dynamic model of knowledge growth.

Relations

  • Integrates: B.5.1 Explore → Shape → Evidence → Operate, B.5.2 Abductive Loop.
  • Drives: The progression through B.3.3 Assurance Subtypes & Levels.
  • Enables: The refinement phase of the B.4 Canonical Evolution Loop.
  • Operationalizes: The core FPF mission of transforming ideas into reliable, evidence-backed holons.

B.5:End

Explore → Shape → Evidence → Operate

Problem Frame

Every successful innovation, from a new piece of software to a scientific theory, follows a recognizable development state cycle. It begins as a fuzzy idea, is gradually given a clear structure, is tested against reality, and finally, is put into operational use. Without a shared state-cycle model, teams often get stuck: developers might endlessly refine a structure without testing it, while analysts might gather evidence for an idea that has not yet been clearly defined.

Problem

How do we provide a simple, universal state machine that guides a U.Episteme or U.System from a raw concept to a reliable, operational holon? This pattern defines the four canonical states of this journey, providing a clear roadmap for teams and a stable framework for project management.

Solution

FPF defines a four-state development cycle model for any U.Episteme or U.System under development. That episteme or system transitions from one state to the next as it accumulates rigor and evidence. This state machine is driven by the Canonical Reasoning Cycle (Pattern B.5).

The Four Development States:

StateCore ActivityManager's View: What It MeansDriven by Phase of Reasoning CycleTypical AssuranceLevel
1. ExplorationGenerating possibilities. The focus is on brainstorming, questioning assumptions, and generating multiple, often competing, hypotheses."We are in the 'what if' phase. All ideas are on the table. We are looking for a plausible path forward."Abduction (Pattern B.5.2)L0
2. ShapingDefining a single, coherent form. The most promising hypothesis from the exploration phase is selected and given a rigorous, internally consistent structure."We've chosen our direction. Now we are building the blueprint, defining the architecture, and ensuring all the pieces fit together logically."DeductionL0L1 (if formalization counts as TA)
3. EvidenceTesting against reality. The shaped episteme or system is subjected to rigorous empirical or formal tests to validate its claims and measure its performance."The blueprint is done. Now we are at the proving ground. Does it actually work? We are running the tests and gathering the data."InductionL1L2
4. OperationDeploying and monitoring in a live environment. The validated episteme or system is put into production, where it performs its intended function and is monitored for ongoing reliability."It's live. The system is in service, delivering value, and we are monitoring its health and performance."Continuous Induction (Monitoring)L2 (maintained)

Didactic Note for Managers: Aligning States with Your Project Plan

This state machine is not an abstract theory; it maps directly to the familiar phases of any well-run project.

  • Exploration is your R&D or initial discovery sprint.
  • Shaping is your design and architecture phase.
  • Evidence is your QA, testing, and V&V phase.
  • Operation is the live deployment and maintenance phase.

By using these four states, you can instantly communicate to your team and stakeholders exactly where the episteme or system is in its state transition, what the current focus is, and what needs to happen to move to the next stage.

Conformance Checklist

  • CC-B5.1.1 (State Explicitness): Every state-bearing U.Episteme or U.System in a project MUST be tagged with its current state from the set {Exploration, Shaping, Evidence, Operation}.
  • CC-B5.1.2 (Sequential Progression): A state-bearing U.Episteme or U.System SHALL progress through the states in sequence. Skipping a state (e.g., moving directly from Exploration to Evidence without Shaping) is a process violation and must be explicitly justified in the evidence carrier's rationale.
  • CC-B5.1.3 (Reasoning Cycle Alignment): The transition between states MUST be triggered by the completion of the corresponding phase of the Canonical Reasoning Cycle (Pattern B.5). For example, the transition from Shaping to Evidence requires the completion of the deductive analysis.

Consequences

BenefitsTrade-offs / Mitigations
Clear Project Visibility: The state machine provides a simple, shared language for tracking the maturity of every state-bearing episteme or system in a project.Risk of Bureaucracy: If applied too rigidly, the state machine could feel like a waterfall process. Mitigation: The cycle is meant to be rapid and iterative. A single episteme or system might cycle through all four states within a single sprint. The goal is clarity, not ceremony.
Improved Focus: Each state has a clear primary activity, which helps teams focus their efforts and avoid common pitfalls like premature optimization or untested designs.-
Reduces "It's Done" Ambiguity: The states provide a precise definition of "done" for each phase. An episteme or system is not "done" with Shaping until its structure is coherent and its consequences are deduced.-

Rationale

This pattern operationalizes the Principle of State Explicitness (P-9). By giving every state-bearing episteme or system a clear, unambiguous state, FPF transforms the often-chaotic process of innovation into a structured, manageable, and auditable development cycle. This state machine provides the "scaffolding" upon which the more detailed cognitive work of the Canonical Reasoning Cycle is performed, ensuring that every idea is systematically guided from a speculative guess to a reliable operational reality.

Relations

  • Is driven by: B.5 Canonical Reasoning Cycle.
  • Organizes the progression of: B.3.3 Assurance Subtypes & Levels.
  • Provides the states for: B.4 Canonical Evolution Loop.

B.5.1:End

Abductive Loop

Type: Architectural (A) Status: Stable Normativity: Normative unless marked informative

Plain-name. Abductive loop.

Builds on. B.5 Canonical Reasoning Cycle, B.5.1 Exploration, B.5.2.0 U.AbductivePrompt, A.10, B.3.3.

Coordinates with. B.4.1 Observe-Notice-Stabilize-Route for pre-abductive routing, A.16 for admissible language-state moves, A.6.P for lexical repair before hypothesis publication, and C.16.Q / A.6.A when the initiating publication face or cue is evaluative or action-inviting rather than explanatory.

Problem frame

The Canonical Reasoning Cycle begins with abduction: the disciplined proposal of a candidate explanation, model, or conjecture that could account for a declared prompt. In practice this phase is often treated either as opaque inspiration or as unstructured ideation. Neither framing is bounded or auditable enough for FPF. The framework needs an entry discipline that is broad enough to admit real inquiry starts and narrow enough to keep the resulting hypothesis auditable.

Problem

Without an explicit abductive pattern:

  1. Inquiry stalls at surprise. A team encounters an anomaly, opportunity, or probe pressure but has no admissible next move for producing a candidate hypothesis.
  2. Origin is lost. Once a conjecture appears, the initiating prompt, rival candidates, and early plausibility grounds disappear from the record.
  3. Candidate space collapses too early. The first plausible-seeming explanation is treated as the explanation, even though alternatives were never exposed.
  4. Selection becomes opaque. A chosen conjecture moves downstream without a visible record of why it outranked alternatives.
  5. Untestable hypotheses survive too long. A candidate that cannot guide deduction, probe design, or evidence gathering is still treated as if it had earned progression.

Forces

ForceTension
Generativity vs disciplineThe loop must admit non-deductive candidate generation without making arbitrary guesses look admissible.
Breadth vs typed entryAbduction should begin from more than anomaly alone, but not from any untyped prose fragment.
Rival diversity vs decision pressureSeveral candidates should remain visible long enough to compare them, while still allowing one prime hypothesis to progress.
Speed vs traceabilityThe loop must be light enough for repeated use but explicit enough to preserve provenance and later review.
Plausibility vs evidenceA candidate may be worth pursuing before evidence is strong, but it still needs explicit plausibility grounds.

Solution - Structured abductive micro-cycle

B.5.2 defines abduction as a typed, iterative micro-cycle that begins from an admissible U.AbductivePrompt, expands a candidate set, filters that set by explicit plausibility criteria, and publishes one selected conjecture as a new U.Episteme with AssuranceLevel:L0.

Nature of abduction in FPF

In FPF, abduction is inference to a presently most plausible candidate explanation or solution under a declared prompt. It is neither arbitrary guessing nor hidden inspiration. The output is not yet an established result; it is a disciplined conjecture prepared for downstream deduction, testing, or refinement.

Four-step micro-cycle

StepCore activityRequired publication outcome
1. Frame the promptState the initiating U.AbductivePrompt precisely enough that the unexplained contrast, opportunity, or probe pressure is explicit.A prompt record with open question, scope notes, and provenance.
2. Generate candidate hypothesesProduce multiple candidate conjectures that could resolve the prompt.A visible candidate set, even if lightweight.
3. Apply plausibility filtersCompare candidates against explicit plausibility criteria.A short rationale that records why some candidates remain live and others are rejected.
4. Select and publish the prime hypothesisChoose one candidate for downstream work and instantiate it as a hypothesis-bearing episteme.A new U.Episteme at AssuranceLevel:L0, linked back to the prompt and selection rationale.

The loop is intentionally iterable. A selected prime hypothesis may later be replaced, narrowed, or reopened if deduction, probe work, or evidence reveals a better rival.

Entry discipline via U.AbductivePrompt

AnomalyStatement remains a canonical prompt species, but it is not the only one. B.5.2 also accepts the broader prompt species governed by B.5.2.0, such as ProblemCuePrompt, OpportunityCuePrompt, and ProbeCuePrompt. This broadens entry without dissolving type discipline.

Plausibility filters

The filtering step is local and context-sensitive, but the criteria used SHALL be explicit. Typical filters include:

  • Parsimony. Does the candidate introduce only the additional structure that the prompt requires?
  • Explanatory reach. How much of the prompt does the candidate actually account for?
  • Consistency with established constraints. Does the candidate avoid collision with already trusted pillars, mechanisms, or scope declarations?
  • Falsifiability / probeability. Does the candidate create a path for deduction, testing, contrast, or evidence acquisition?
  • Scope fit. Is the candidate framed for the declared prompt scope rather than for an inflated or shifted target?

No one filter is universally decisive. The pattern only requires that at least two filters be declared when a prime hypothesis is selected.

Archetypal Grounding

Tell. Abduction is not "a flash of insight." It is the governed passage from a typed prompt to a candidate conjecture through explicit rival generation and plausibility comparison.

Show (System). An operations team sees a recurring latency spike that existing method explanations do not cover. They publish an AnomalyStatement, generate rival causes, filter them by consistency with current telemetry and mechanism knowledge, and publish one prime conjecture as an L0 hypothesis for downstream checking.

Show (Episteme). A research group notices that two accepted results no longer fit together under one framing. It publishes a ProbeCuePrompt, enumerates several rival explanatory reframings, rejects the ones that fail scope fit or would not generate decisive probes, and advances one candidate explanation as the next working hypothesis.

Bias-Annotation

This pattern biases authors toward visible candidate plurality, explicit plausibility criteria, and persistent prompt provenance. That bias is intentional. B.5.2 would rather keep early conjectures slightly over-exposed than let their origin and selection grounds disappear.

Conformance Checklist

  • CC-B.5.2-1 Every abductive run SHALL begin from a declared U.AbductivePrompt; arbitrary prose fragments are not sufficient prompt-entry forms.
  • CC-B.5.2-2 A conforming abductive run SHALL record at least one rival candidate alongside any selected prime hypothesis, unless the author explicitly justifies why no rival candidate was available.
  • CC-B.5.2-3 Selection of a prime hypothesis SHALL cite at least two explicit plausibility filters.
  • CC-B.5.2-4 The selected prime hypothesis SHALL be published as a new U.Episteme with AssuranceLevel:L0.
  • CC-B.5.2-5 The prime hypothesis record SHALL preserve a link to the initiating prompt and to the filtering rationale that justified selection.
  • CC-B.5.2-6 A hypothesis that cannot support any downstream deduction, probe design, or evidence path SHALL NOT be presented as a conforming abductive result.

Common Anti-Patterns and How to Avoid Them

Anti-patternWhat it looks likeHow FPF prevents it
Authority candidateOne favored conjecture is advanced immediately, with no rival set and no explicit filtering.CC-B.5.2-2 and CC-B.5.2-3 require candidate plurality and visible plausibility grounds.
Untestable grand conjectureThe candidate sounds deep or comprehensive, but it creates no admissible next step for checking, probing, or deduction.CC-B.5.2-6 rejects prime hypotheses that cannot open a downstream path.
Prompt amnesiaA later reader can see the conjecture but not the initiating anomaly, opportunity, or probe pressure.CC-B.5.2-1 and CC-B.5.2-5 keep prompt provenance attached.
Symptom patchingThe selected candidate only redescribes a visible symptom and leaves the actual prompt unresolved.The explicit plausibility filter for explanatory reach forces the candidate to be compared against the whole prompt.

Consequences

BenefitTrade-off / Mitigation
Disciplined generativity. Abduction stays inventive without collapsing into formless conjecturing.Requires explicit prompt and filter publication; mitigation: the required record can remain lightweight.
Traceable hypothesis origin. Later review can reconstruct why a conjecture entered the reasoning cycle.Adds a small provenance-support load; mitigation: reuse prompt and candidate-set notes from adjacent patterns.
Cleaner downstream handoff. Deduction and evidence work begin from an AssuranceLevel:L0 U.Episteme publication with explicit scope and rationale.Some early conjectures will be rejected sooner; that is a feature, not a defect.
Admissible reopening. Rival candidates can be revisited when later work undermines the selected prime hypothesis.Demands editorial discipline so that abandoned rivals remain legible rather than silently vanishing.

Rationale

The Canonical Reasoning Cycle needs a disciplined beginning that is neither over-formalized nor mystical. B.5.2 supplies that beginning. It keeps hypothesis generation explicit, connects it to typed prompt publications, and prepares the output for later assurance work without pretending that early plausibility is already evidence.

SoTA-Echoing

Contemporary inquiry practice in science, engineering, design, and diagnosis treats candidate generation as iterative and contrast-driven rather than singular and opaque. The pattern aligns with that practice, but keeps the representation lightweight: explicit prompts, visible rival candidates, and local plausibility grounds instead of heavyweight ideation machinery.

Relations

  • Is the first reasoning phase within: B.5 Canonical Reasoning Cycle.
  • Typically operates during: B.5.1 Exploration.
  • Consumes: U.AbductivePrompt publications from B.5.2.0, often reached through B.4.1 and A.16.
  • Produces: hypothesis-bearing U.Episteme publications at AssuranceLevel:L0.
  • Feeds: downstream deduction, probe design, and evidence acquisition in the later reasoning cycle.

Prompt-entry broadening via U.AbductivePrompt

Older wording that makes AnomalyStatement the exclusive entry form is superseded. B.5.2 accepts U.AbductivePrompt, where AnomalyStatement remains one canonical species alongside cue-derived prompt species such as ProblemCuePrompt, OpportunityCuePrompt, and ProbeCuePrompt.

Prompt, Candidate, and Hypothesis Package Discipline

The abductive loop stays auditable only if the three main publication forms remain distinct: the prompt, the candidate set, and the selected prime hypothesis. Collapsing them into one paragraph is one of the main reasons later review cannot reconstruct what actually happened.

Prompt package

A conforming prompt package should make explicit:

  • the prompt species (AnomalyStatement, ProblemCuePrompt, OpportunityCuePrompt, or ProbeCuePrompt),
  • the open question that makes abduction necessary,
  • the declared scope under which the question is being posed,
  • the witnesses or provenance cues that made the prompt worth preserving,
  • and the reason the current model is insufficient.

If the initiating publication is still primarily evaluative, action-inviting, or lexically overloaded, it should first be repaired by the relevant A.6 family before it is treated as a stable abductive prompt. B.5.2 assumes typed entry, not raw lexical ambiguity.

Candidate-set note

A candidate-set note is the minimal record that preserves rival plurality. It need not be heavy, but it should make visible:

  • candidate identifiers or short names,
  • the differentiating claim each candidate adds,
  • the principal plausibility supports and liabilities of each candidate,
  • whether the candidate remains live, is deferred, or is rejected,
  • and what missing evidence or probe would best discriminate among the remaining rivals.

The important point is not bureaucratic completeness. The important point is to prevent retrospective rewriting in which the surviving candidate is made to look as if it had been the only serious option from the beginning.

Prime-hypothesis record

A selected prime hypothesis should preserve more than the hypothesis sentence itself. A conforming L0 hypothesis record should name:

  • the selected candidate,
  • the prompt it answers,
  • the filters under which it outranked rivals,
  • the scope within which it is being advanced,
  • the next admissible downstream move (deduction, probe design, targeted evidence acquisition, or explicit reopening criteria),
  • and any known fragilities already visible at selection time.

This is how B.5.2 stays connected to the rest of the reasoning cycle. The abductive loop does not merely emit an idea; it emits a conjecture with explicit handoff terms.

Admissible Transitions, Abort Paths, and Reopening

The abductive loop is iterative, but it is not formless. Several transition cases need explicit handling so that later stages know whether they are receiving a stable L0 conjecture, a deferred candidate, or a prompt that should be reopened rather than forced forward.

Relation to B.4.1 and A.16

B.4.1 and A.16 often supply the pre-abductive seam. They help preserve, stabilize, and route upstream publications before they are fit for explicit conjecture. B.5.2 begins only once the current publication is ready to function as an abductive prompt. This boundary matters because it prevents two opposite errors:

  • premature abduction, where a low-articulation cue is treated as if it had already earned hypothesis form;
  • delayed abduction, where a now-stable prompt is kept indefinitely in early cue form even though rival conjectures should already be compared.

Abort, defer, and split cases

Not every abductive run should end in a prime hypothesis. Three non-selection outcomes are admissible:

  1. Abort. The prompt dissolves because the initiating anomaly or opportunity was misread, duplicated, or already answered elsewhere.
  2. Defer. Several candidates remain live, but the discriminating evidence or probe is not yet available. The loop pauses without pretending a winner exists.
  3. Split. The original prompt turns out to contain several distinct questions. The run should fork into several narrower prompts rather than select one over-broad conjecture.

These outcomes are not failures. They are part of keeping abduction honest.

Reopening and rival reinstatement

A prime hypothesis may later lose support under deduction, probe results, or new evidence. When that happens, B.5.2 prefers explicit reopening to silent replacement.

A conforming reopening note should identify:

  • which prior prime hypothesis is being reopened,
  • whether a stored rival is being reinstated or a new candidate is entering,
  • what change in evidence, scope, or internal contradiction triggered the reopening,
  • and whether the original prompt itself has changed or only the candidate ranking has changed.

This allows the reasoning cycle to keep continuity without pretending that the earlier abductive choice had never been made.

Scope discipline during iteration

Abductive drift often comes from silent scope expansion. A conjecture first framed for one target slice quietly becomes a universal explanation. B.5.2 therefore expects scope discipline to remain explicit during iteration. If a candidate requires a broader or narrower scope than the prompt originally declared, that scope move should be stated rather than smuggled in under the rhetoric of a "better explanation."

Worked Examples

Service degradation diagnosis

A service team notices recurring latency spikes during one operating window. The prompt species is AnomalyStatement: why does latency spike in the evening batch window despite unchanged nominal load?

The candidate set includes:

  • queue saturation in one downstream dependency,
  • a time-window interaction with backup traffic,
  • and a recent mechanism regression in cache invalidation.

The prime hypothesis is not selected because it sounds most familiar. It is selected because it best fits the observed window, remains consistent with known mechanism declarations, and generates a concrete next probe: isolate backup traffic and compare the latency shape against prior windows. The resulting conjecture becomes an L0 hypothesis with one explicit evidence path.

Opportunity-driven materials inquiry

A research group sees an opportunity rather than a failure: a new fabrication method appears to create a micro-structure with useful thermal behavior. The prompt species is OpportunityCuePrompt rather than anomaly.

Candidate hypotheses include:

  • the effect is caused by surface geometry,
  • it is caused by composition gradients,
  • or it is an effect of one measurement regime.

The selected prime hypothesis is the geometry explanation because it explains more of the initial observations and yields a cleaner discriminating experiment. The loop shows why opportunity-driven abduction still needs rival tracking; without it, attractive novelty language would substitute for hypothesis discipline.

Probe-driven theory repair

A theory-maintenance group identifies a probe-worthy mismatch between two accepted claims. The prompt species is ProbeCuePrompt: what changed assumption would allow these two claims to coexist without contradiction?

The candidate set includes:

  • hidden scope restriction on the first claim,
  • mistaken invariance assumption in the second,
  • and a more general missing mediating construct.

The selected prime hypothesis is the mediating construct, but the scope-restriction candidate remains stored as a live rival because it could still outperform if later deductions fail. This example illustrates why B.5.2 tracks the rival set rather than only the currently favored conjecture.

Authoring and Review Guidance

For authors

Authors should treat the abductive loop as a selection discipline, not as a prose genre. The minimal questions are:

  • what is the prompt,
  • what rival candidates were seriously considered,
  • why is one candidate currently the best live conjecture,
  • and what downstream move could expose that selection as right or wrong?

If those answers cannot be given, the publication is probably not yet at B.5.2 and should return to prompt-shaping or lexical repair.

For reviewers

Reviewers should not ask only whether the chosen hypothesis looks plausible. They should also ask:

  • whether the prompt was typed in an admissible way,
  • whether at least one real rival was preserved,
  • whether the filters named at selection time actually discriminate among candidates,
  • whether the selected hypothesis has a credible downstream path,
  • and whether any scope inflation occurred during selection.

A polished hypothesis with no visible rivals is usually less trustworthy than a rougher hypothesis whose rival space is explicit.

For integrators and assurance leads

Integrators should remember that L0 is still early assurance. B.5.2 supplies disciplined conjectures, not corroborated claims. Its value is that it exposes where deduction, method design, and evidence acquisition should now concentrate. Assurance leads therefore should preserve the prompt link and the filter rationale rather than flattening the conjecture into a decontextualized work item.

Migration and Boundary Notes

Migration from anomaly monopoly

Older wording that says abduction begins only from anomaly should be rewritten into the broader but still typed claim: abduction begins from an admissible U.AbductivePrompt, of which anomaly is one canonical species.

Migration from inspiration rhetoric

Legacy prose that describes abduction as a flash, leap, or raw creative moment may remain as didactic metaphor, but it should not be used as the operational description of the pattern. The operational core is typed prompt -> rival set -> plausibility filtering -> prime hypothesis publication.

Boundary to deduction and evidence

B.5.2 ends when one conjecture is published as a prime L0 hypothesis or when the run is explicitly aborted, deferred, or split. Deduction, evidence acquisition, and later assurance do not belong to the abductive loop itself, even though the loop must prepare a clean handoff to them.

B.5.2:End

U.AbductivePrompt

Type: Definitional (D) Status: Draft Normativity: Normative unless marked informative

Plain-name. Abductive prompt.

Problem frame

B.5.2 needs an entry form that can accept lawful language-state trajectories after cue preservation and routing, without pretending that anomaly is the only admissible starting form.

Problem

If anomaly is the only admissible input, pre-anomaly opportunity cues and route-derived prompt forms are excluded or misrepresented. If anything can enter, abduction loses its typed starting discipline.

Forces

ForceTension
Breadth vs disciplineAdmit more than anomaly, but keep a bounded family of lawful prompt species.
Reuse vs type inflationIntroduce a clean entry form without exploding the number of heavy publication kinds.
Prompt vs hypothesisKeep the initiating prompt distinct from the later abductive outcome.

Solution

U.AbductivePrompt is a narrow supertype for the prompt forms that may admissibly seed B.5.2 after admissible cue preservation and governing-pattern selection under A.16, A.16.1, and B.4.1. A.16.0 is used only when the cue-to-prompt history itself has governance value as an explicit trajectory account. When rendered, a prompt uses ordinary MVPK faces; prompt status is a property of the publication form, not a rival face ontology.

Starter canonical species and conditional extension species

  • starter canonical species:
    • AnomalyStatement
    • ProblemCuePrompt
    • OpportunityCuePrompt
    • ProbeCuePrompt
  • conditional extension species:
    • TaskFamilySpecializationPrompt
    • AdaptationProbePrompt
    • NonHumanUtilityPrompt
    • SubstrateDiversificationPrompt
Specialization-sensitive prompt species

These extension species are admissible only when cue provenance or trajectory account already carries the bounded-specialization support requirement by value; they are not the starter canonical entry set for ordinary abduction.

TaskFamilySpecializationPrompt asks what narrower higher-fit specialist lane should be acquired for the declared task family, where that lane may later resolve into one specialist method, portfolio, or competence bundle. AdaptationProbePrompt asks which bounded probe would most cheaply reveal whether threshold-reaching specialization is actually attainable. NonHumanUtilityPrompt asks whether a low-human-overlap approach or corridor may still satisfy the declared utility target better than the current familiar repertoire. SubstrateDiversificationPrompt asks whether the current substrate is too narrow and a broader or different substrate should be tested before later commitment.

Core shape

A conforming abductive prompt may publish:

  • promptSpecies
  • motivatingCueRef?
  • openQuestion
  • contrastSet?
  • scope?
  • witnessRefs?
  • routeProvenance?
  • GammaTime?

A prompt is not yet a hypothesis. Prompt legality usually presupposes articulation high enough to publish a stable open question and closure low enough that rival answers remain live; those articulation and closure thresholds remain governed by C.2.4 and C.2.5, typically reached through cue or route provenance from A.16.1 and B.4.1. It is the initiating publication form that licenses entry into the abductive loop.

Boundary rule

U.AbductivePrompt is an entry form, not an excuse to let arbitrary prose count as abductive input. Only declared prompt species may enter B.5.2 through this form.

Archetypal Grounding

Tell. An anomaly is one prompt species, not the only one.

Show (System). A control cue may begin probe-design abduction even before it is framed as anomaly.

Show (Episteme). A promising mismatch can begin an opportunity-style abductive prompt rather than only a problem statement.

Bias-Annotation

The pattern broadens the entry form to abduction, but still keeps it typed and auditable.

Conformance Checklist

  • CC-B.5.2.0-1 Every U.AbductivePrompt SHALL declare its prompt species.
  • CC-B.5.2.0-2 A prompt SHALL NOT be confused with a finished hypothesis.
  • CC-B.5.2.0-3 Cue-derived prompts SHOULD preserve route provenance.
  • CC-B.5.2.0-4 Prompt publication SHALL include the open question that makes abduction appropriate.
  • CC-B.5.2.0-5 A publication that already fixes the answer or suppresses plausible rivals SHALL NOT remain in prompt status.
  • CC-B.5.2.0-6 When a specialization-sensitive prompt species is used, the prompt package SHALL make explicit the declared task family or utility target, the threshold or success condition being probed, the current budget window, and the route or cue provenance that made the prompt lawful.

Common Anti-Patterns and How to Avoid Them

  • Prompt equals hypothesis. Keep the prompt distinct from the abductive output.
  • Anything can begin abduction. No: only declared prompt species can.
  • Route amnesia. A cue-derived prompt loses the early route provenance that explains why it entered here.

Consequences

The benefit is cleaner, less brittle abduction-entry terms. The trade-off is one additional explicit prompt supertype and one more declared publication form.

Rationale

This keeps admissible cue preservation and trajectory publication able to dock into B.5.2 through a typed prompt form without anomaly inflation and without making A.16.0 mandatory.

SoTA-Echoing

The pattern reflects real abductive practice, where opportunities, probe prompts, and stabilized cues often begin the loop before a full anomaly formulation exists.

Relations

  • Builds on: C.2.2a, A.16, A.16.1, B.4.1, C.2.LS, C.2.4, C.2.5.
  • Coordinates with: A.16.0, A.16.2, C.2.6, C.2.7, B.5.2, A.6.P, C.16.Q, A.6.A, F.9.1.
  • Constrains: lawful prompt entry into abduction.

Worked Prompt Species

Anomaly statement as canonical prompt

An anomaly statement remains a canonical prompt species, especially when the contrast and failure condition are already explicit.

Opportunity-style prompt

A cue may admissibly become an opportunity prompt when the open question concerns a potentially valuable line of probe or intervention rather than a failure description.

Probe-style prompt

A routed cue may become a probe prompt when what matters is not yet explanation but the explicit need to test, contrast, instrument, or perturb.

Specialization-sensitive prompt set

A cue set may admissibly become a TaskFamilySpecializationPrompt, AdaptationProbePrompt, NonHumanUtilityPrompt, or SubstrateDiversificationPrompt when the question under repair is not yet a selector decision but a bounded entry into specialist acquisition, adaptation probing, nonhuman-utility discovery, or substrate widening. The point is to preserve the task family, budget window, rival candidate paths, and corridor-entry evidence requirement long enough for later comparison rather than smuggling a commitment into prompt form.

Prompt package discipline

A prompt becomes reusable in B.5.2 only when its initiating question is explicit enough to remain stable across later hypothesis work.

Minimal prompt package

A robust abductive prompt should make explicit:

  • the prompt species,
  • the open question,
  • the motivating cue or route provenance,
  • the contrast set, if one is already visible,
  • the scope in which the question is being asked,
  • and the witnesses or cue grounds that justify beginning abduction.

This package lets later conjectures be tested against the same question rather than against a later paraphrase.

For specialization-sensitive prompt species, the package should also make explicit the declared task family or utility target, the threshold or success condition being probed, the current budget window, the prior route provenance, and the rival prompt shapes still in play.

Prompts are questions, not claims

A prompt may cue one explanation, but it remains a question-bearing entry form. If the text already asserts the answer, it has moved past prompt status and should be treated under B.5.2 or another governing pattern that carries the asserted answer.

Prompt provenance remains load-bearing

Route provenance, cue provenance, and witness provenance are part of prompt legality, not optional history.

Review prompt against silent promotion

A reviewer should watch for the common mistake where authors silently upgrade a prompt into a hypothesis merely because the prose sounds explanatory. If the text already leans on one preferred answer as settled, either rewrite it back into a real question or explicitly apply the governing pattern that carries the asserted answer.

Species boundary reminders

Use anomaly species when the key form is an explicit failure, contradiction, or surprising departure from what the current model expected. Use opportunity species when the pressure comes from a promising line of development or advantageous contrast. Use probe species when what matters is the need to instrument, contrast, perturb, or ask a question that could discriminate among several future explanations.

Use TaskFamilySpecializationPrompt when the question under repair is which narrower higher-fit specialist lane should be acquired for one declared task family. Use AdaptationProbePrompt when the next honest move is a bounded probe that tests whether threshold-reaching specialization is attainable under the current budget. Use NonHumanUtilityPrompt when the prompt must keep a low-human-overlap approach or corridor admissible because it may satisfy the declared utility target better than the current familiar repertoire. Use SubstrateDiversificationPrompt when the current question is whether the present substrate is too narrow and a broader or different substrate should be tested before later commitment.

Cue-derived prompt entries should stay prompt-headed species rather than projection-headed aliases. The load-bearing question is the prompt kind itself, not one package-local naming trick.

Handoff, deferral, and invalid drift

A prompt should enter B.5.2 only when the question is explicit enough that rival hypotheses can now be compared against it. If the question is still underspecified, the lawful continuation is further stabilization or routing, not premature abduction.

A routed cue may be close to prompt form but still missing one decisive contrast or witness. In such cases the prompt may be deferred explicitly rather than forced into U.AbductivePrompt before its initiating question is stable.

A bare intuition, slogan, or rhetorical question with no prompt species and no cue provenance is not yet a lawful U.AbductivePrompt.

A common failure mode is drift from cue -> prompt -> hypothesis without anyone naming the boundary crossings. B.5.2.0 blocks that drift by keeping the prompt package distinct from both the earlier cue pack and the later prime hypothesis.

Scope, rival-set, and comparative-validity discipline

A prompt should declare the scope in which its question is being asked: the domain fragment, operational horizon, or inquiry-bounded scope cut that makes the question answerable. If scope remains unbounded, rival hypotheses will later become incomparable because they are answering different questions.

A prompt need not list full hypotheses yet, but it should make visible whether rival answer types are already imaginable. If no rival answer space is even latent, the publication may still be a cue or orientation note rather than a true abductive prompt.

A prompt may be narrowed to become more discriminating, but the narrowing must not silently smuggle in the answer it is supposedly asking about. Otherwise the prompt ceases to be an initiating question and becomes a disguised conclusion. If a prompt already excludes every serious rival except one preferred explanatory line, the publication may already be preloading a hypothesis. Review should then either rewrite the prompt back into a real question or explicitly apply the governing pattern that carries the asserted answer.

Prompts may be compared across contexts only when their species, scope, and provenance are explicit. A probe-shaped question and an opportunity-shaped question are not the same kind of abductive entry merely because both invite explanation.

One note may legitimately contain a bundle of closely related prompts. If so, the bundle members should be distinguishable and still support later rival comparison without confusion.

A reviewer can test prompt readiness with three questions:

  1. Is there a real open question? If the text already asserts the answer, it is no longer a prompt.
  2. Is the prompt species plausible? If the initiating pressure is opportunity-shaped or probe-shaped, forcing anomaly species is a category error.
  3. Could rival hypotheses now be compared against this prompt? If not, the prompt candidate probably needs more stabilization before entering B.5.2.

Add three follow-up checks:

  • Is the scope tight enough for later comparison?
  • Is there an imaginable rival-set, even if not yet fully written?
  • Is the narrowing still a question rather than a disguised answer?

B.5.2.0:End

Creative Abduction with NQD

Status. Normative binding to B.5.2 Abductive Loop that delegates candidate generation to Γ_nqd.generate (C.18 NQD-CAL) and exploration/exploitation policy to E/E-LOG (C.19); the kernel remains unchanged.

Non‑duplication & parsimony. “Introduces no new kernel primitives; reuses the CHR kit (A.17/A.18) to define measurable Characteristics. This pattern does not introduce new eligibility conditions. Application is permitted only when USM coverage holds for the target slice and the performer’s RSG state is enactable (eligibility), without prescribing any team workflow. Per A.11 Ontological Parsimony, only a context‑local CHR import and a Method are added; no changes to Γ/LOG. All generation is performed via Γ_nqd. (C.18)* and all exploration/exploitation control via E/E-LOG (C.19). Terminology discipline. Use NQD consistently (Novelty–Quality–Diversity). Treat S/I as secondary metrics unless explicitly promoted by policy (see §3, §5).

Problem Frame

  • Conceptual binding: B.5.2 Abductive Loop (this pattern specifies the how for Steps 2–3).
  • FPF pattern: a domain‑neutral Creativity‑CHR (C‑cluster) that declares the Characteristics used here (see §2). (No change to Γ/LOG.) This binding also references C.18 NQD-CAL (operators Γ_nqd.*) and C.19 E/E-LOG (EmitterPolicy).
  • Manager’s mental model (informative): “We add measurable characteristics for newness, spread, and fit, then use a generator that explores widely and returns a front over the declared Q components together with retained exploration/archive evidence when the policy asks for it, not a single winner and not one bundled {Q,N,D} default.”
  • Operational loops: compatible with B.4 Canonical Evolution Loop (ideas generated here flow into Run→Observe→Refine→Deploy) and with B.5 Canonical Reasoning Cycle (ADI), preserving abductive primacy.
  • Decision-subject note. Later choices are attributed to one declared DecisionSubject at explicit DecisionSubjectGranularity. Contexts publish measurement spaces and admissible policies as semantic frames; they do not enact choices.

Intent & Problem

Intent. Turn Step 2 (generate) and Step 3 (filter) of the Abductive Loop from ad‑hoc brainstorming into a disciplined, instrumented exploration that can (i) produce many distinct, plausible hypotheses and (ii) surface the few worth pursuingwithout bloating the kernel or forcing a specific creative method.

Problem. Unstructured ideation routinely fails on two fronts: it either produces too little variety (pet ideas win by seniority) or too little plausibility (grand theories with no testable predictions). B.5.2 names these failure modes; this pattern adds a minimal, measurable counter‑mechanism aligned to FPF’s assurance lanes and state machine.

The Creativity‑CHR (references only; no re‑definitions here)

This binding references the context‑local Creativity‑CHR (see C.17) and does not restate measurement templates. The primary coordinates are: • Novelty@context (C.17 §5.1), • ΔDiversity_P (marginal; C.17 §5.5), and • Q components (per A.18). Surprise and Illumination are secondary: Illumination is report‑only telemetry (published as IlluminationSummary over Diversity_P); both act as tie‑breakers unless explicitly promoted by policy (C.19). Use‑Value (alias: ValueGain) is informative for decision lenses (Decsn‑CAL) and MUST NOT enter NQD dominance by default (see C.17 §5.2).

All listed Characteristics are context‑local with explicit units/ranges and polarity↑. They are measurements, not eligibility conditions; eligibility conditions are supplied by USM/RSG. (Complies with A.18 measurement discipline; does not overload assurance semantics.)

Lexical discipline. The items above are Characteristics in the sense of A.17/A.18; avoid reserved names such as “validity” or “operation.” Normalization note. If a QualityVector has heterogeneous units, Contexts SHALL normalize or nondimensionalize each component before Pareto analysis (see CC‑B.5.2.1‑7). D vs I (normative). D = ΔDiversity_P (marginal gain) is measured for archive quality, tie-breaking, and policy-promoted dominance only. By default it is not in the primary DominanceSet. I is portfolio illumination (report/visual); it SHALL NOT be part of the primary dominance test and is usable only as an explicit tie-break per policy. Measurement invariants. Distances, grids, and transforms MUST be declared once per run, versioned, and referenced from provenance (§3, §5).

Solution — Binding to Γ_nqd.generate (C.18)

Method name (Plain/Unified Tech). NQD‑Generate — a U.Method that, given (i) a HypothesisSpace and (ii) a CharacteristicSpace with a CoverageGrid, returns a finite candidate package: a current front over the declared DominanceSet plus the retained archive/tie-break telemetry needed to keep diversity and novelty reviewable without making them default dominance dimensions.

Minimal signature.

  • Inputs (declared in MethodDescription): HypothesisSpace, CharacteristicSpace, Seeds?, Budget (time/compute), EmitterPolicy (E/E-LOG policy id), QualityMeasures (Q components), NoveltyMetric, CoverageGrid/Granularity, CellCapacity K? (default=1), EpsilonDominance ε? (default=0), TieBreakPolicy? (S/I), DedupThreshold?, Policy(TimeWindow), DeterminismSeed?

  • Outputs: CandidateSet = {h_i: (desc_i, Q_i, N_i, D_i:=ΔDiversity_P(h_i | Pool), S_i, I_i, UseValue_i?), genealogy_i?, provenance_i (including DHCMethodRef.edition and policyId from E/E-LOG)} where Q_i is a vector and provenance_i captures generator settings and evaluation sources. If Use‑Value is present, include the objective id / acceptanceSpec, counterfactual method (if predicted), and model edition per C.17. Note: N, D, S, and I are archive, tie-break, telemetry, or policy-promoted signals by default; only the declared DominanceSet enters the current front. Use-Value is decision-side/supporting unless the current Context explicitly declares it inside the active Q tuple / DominanceSet; when it is only recorded as a side measure, keep it outside dominance.

Strategy (notation‑neutral).

  1. Seeding. Initialize with seeds (known solutions, random draws, or prior L0 hypothesis epistemes).
  2. Iterated illumination. Propose variations, evaluate Q (per‑component); maintain up to K elites per cell (or descriptor bucket); compute N/D/S/I on the fly; deduplicate by DedupThreshold in CharacteristicSpace.
  3. Budget‑bounded loop. Iterate until budget or coverage‑convergence; return the (ε‑)Pareto front over the declared DominanceSet. When the Context consumes the ordinary default, that means the declared Q components under DefaultId.DominanceRegime, not one fresh local doctrine. Keep N, D=ΔDiversity_P, Surprise, and IlluminationSummary as archive/tie-break/telemetry signals unless one Context policy explicitly promotes one of them into dominance and records the policy id. Use-Value enters dominance only when the current Context explicitly declares it inside the active Q tuple; otherwise it may appear as one decision-side/supporting side note.
  4. Traceability. Emit a Design Rationale Record (DRR): grids/metrics versions, seed(s), policy and TimeWindow, which cells were filled, why items were dominated (list Characteristics), and how the final set was produced (including ε, K, and dedup). (Lightweight DRR is permitted per B.4 guidance.)
  5. Algorithmic freedom (informative). Implementations MAY use MAP‑Elites/illumination, novelty search with local competition, Bayesian/surrogate‑assisted search, or deterministic enumerations; ε‑dominance or knee‑point thinning MAY be used after recording the full front in provenance.

No kernel growth. This is a Method (C.4 Method‑CAL) plus a CHR import; no new Γ‑operator is added (per A.11).

Implementation & Binding into B.5.2 (two injection points)

Step 2 — Generate candidates. Precondition (USM+RSG). Generation is permitted only when the Claim/Work Scope covers the TargetSlice (USM) and the performer’s RoleAssignment is in an enactable RSG state (Green-Gate law).

When the pattern is imported, replace or supplement freeform brainstorming with NQD‑Generate; the output is a pool of L0 hypotheses annotated by {N, D, Q, S, I, V?} plus provenance/DRR refs. The abductive step remains abduction (a conjecture), now instrumented and diverse by construction.

Step 3 — Plausibility filters. Apply B.5.2’s plausibility criteria, now with explicit hooks:

  • Falsifiability → filter out ideas with no testable predictions in the Shaping/Evidence states (B.5 alignment).
  • Explanatory power → prioritize candidates whose Q‑improvements (and attached rationales) align with the framed anomaly.

The selected “prime hypothesis” proceeds exactly as in B.5.2: formalize it as a new U.Episteme at L0, then move to Deduction/Induction.

Primary dominance test: compute the (ε-)Pareto front over the declared DominanceSet. When the Context consumes the ordinary default, that means the declared Q components. By default, N (Novelty@context) and ΔDiversity_P act only as tie-breakers unless a policy explicitly promotes them into the dominance set; S (Surprise) and I (Illumination) are also tie-break/report-only by default; Use-Value remains non-dominant unless the active Q tuple explicitly includes it.

Ordinary fallback posture when no narrower local policy is specified

Do not mint one local dominance doctrine here. Consume the ordinary default DefaultId.DominanceRegime from G.Core/G.5 together with the active C.19 policy-side defaults; in ordinary Q-front use this means the declared Q components, with ConstraintFit=pass as eligibility gate. Tie‑breakers: Novelty@context, ΔDiversity_P, and Surprise; IlluminationSummary (telemetry summary over Diversity_P) remains report‑only unless a CAL policy promotes it. Archive: K=1, ε=0, deduplication in CharacteristicSpace. Policy family: one uncertainty-aware explore policy family with one declared regime key; UCB-class with moderate temperature and explore_share ≈ 0.3–0.5 is one didactic starter profile, not the semantic default family. Provenance (minimum): record DescriptorMapRef.edition, DistanceDefRef.edition, EmitterPolicyRef, TimeWindow, Seeds.

Scope‑of‑claim annotation (descriptive). Record the BoundedContext and TimeWindow that delimit where each N/Q/D measurement is intended to hold; this is for reasoning traceability only (no operational gates).”

Note — Status Surprise (scope and default role): By default in B.5.2.1, Surprise functions solely as a secondary tie‑break among candidates that are otherwise Pareto‑equivalent on the Context’s primary characteristics. A Context policy MAY elevate Surprise into the dominance set, allowing it to enter the CreativitySpace dominance alongside the primary characteristics. If no Context policy is specified, the default tie‑break role applies.

Creative-generation consistency with the declared dominance doctrine

  • When candidate generation speaks about fronts, use the declared DominanceSet for the front and keep archive retention separate when archive mode is active.
  • Do not write novelty or diversity terms into the front definition merely because they are important to archive quality or exploration value.
  • If one generator emits both a front-facing result and an archive-facing result, say which surface each result belongs to.
  • If one generator speaks about selected results, keep that language in the shortlist family rather than silently reusing front language.
  • Prefer wording like front over the declared DominanceSet, plus the corresponding ExplorationArchive when archive mode is active over wording that folds Q, novelty, and diversity into one default front by habit.
  • The local generation story should stay consistent with the declared Front, Archive, and Shortlist language so comparison stays intelligible and lawful.

Conformance Checklist (normative)

CC‑B.5.2.1‑1 (CHR discipline). If this pattern is applied in a Context, that Context SHALL declare the Creativity‑CHR Characteristics with A.18‑style templates (type, unit/range, polarity). No new kernel terms are introduced. CC‑B.5.2.1‑2 (Instrumented generation). Step 2 of B.5.2 SHALL either (a) invoke NQD‑Generate or (b) justify a Context‑specific generator of equivalent effect (diversity + quality + novelty with measurable Characteristics). CC‑B.5.2.1‑3 (Diversity coupling). When this pattern is applied, D MUST be ΔDiversity_P computed against the current candidate Pool using the C.17 definition of Diversity_P under the same Context, CharacteristicSpace, kernel, and TimeWindow. CC‑B.5.2.1‑Eligibility: Eligibility requires (i) ConstraintFit = pass for the candidate (Norm‑CAL must‑set), then (ii) USM coverage for the TargetSlice and (iii) an enactable RSG state for the performer; only then may calls to Γ_nqd.* occur. CC‑B.5.2.1‑4 (Non‑dominated candidate front). The CandidateSet MUST include the Pareto front over the declared DominanceSet. If the Context consumes the ordinary default, cite that consumed DefaultId.DominanceRegime rather than restating one local default doctrine. Any pruned candidate MUST carry a DRR note (“dominated by … on {Characteristics}”). N, D=ΔDiversity_P, Surprise, IlluminationSummary, and similar signals enter dominance only under an explicit recorded promotion policy; otherwise they remain archive, tie-break, or telemetry signals. CC‑B.5.2.1‑4a (Archive companion when retained exploration is in scope). If the active policy depends on retained exploration, stepping-stone retention, or open-ended search, the emitted candidate package MUST include the corresponding ExplorationArchive or cite one explicit policy id that says archive mode is disabled for that run. CC‑B5.2.1‑5 (Abductive primacy preserved). The pattern MUST NOT bypass the ADI ordering mandated by B.5: induction may not start before deduction; abductive L0 creation remains the start. CC‑B.5.2.1‑6 (Normalization for Pareto). When Q has multiple components with different units and scales, Contexts SHALL normalize or use declared utility‑free monotone transforms before dominance tests. **CC‑B.5.2.1‑7 (Use‑Value separation). ** If Use‑Value (C.17 §5.2) is recorded outside the active DominanceSet, it SHALL remain outside Assurance scores and MAY inform decision lenses (Decsn‑CAL). If the current Context explicitly places Use-Value inside the active Q tuple, record that declaration together with its objective id / acceptanceSpec. Do not alter R/G semantics based on side-measure Use‑Value. (see C.17 §5.2 for Use-Value and ValueGain definitions) CC‑B.5.2.1‑8 (Provenance). Each h_i in the CandidateSet MUST reference its provenance_i sufficient to reproduce scores given the same Policy(TimeWindow), score/metric versions, and DeterminismSeed?. CC‑B.5.2.1‑9 (Secondary metrics). I (illumination) and S (surprise) SHALL be used only for tie‑breaking/reporting unless explicitly promoted by policy; the primary dominance test uses the declared DominanceSet, which under the ordinary default means the context-declared Q components. CC‑B.5.2.1‑10 (Cell capacity & ε). If K>1 or ε>0 are used, the values MUST be declared and recorded in provenance; any thinning AFTER recording the front SHALL be documented in the DRR. CC‑B.5.2.1‑11 (Dominance set). If the Context consumes the ordinary default DefaultId.DominanceRegime, the active dominance set SHALL be the declared Q components and provenance SHALL cite that consumed default plus the active C.19 policy or lens id. N (Novelty@context) and ΔDiversity_P act as tie‑breakers unless explicitly promoted by policy (record the policy‑id in provenance).

Cognitive Load & Kernel Growth Budget

For engineers/managers (user cognitive load).

  • Added steps: selecting descriptor Characteristics & granularity; reading a Pareto table (non‑statisticians tip: scan the “front” row; ignore dominated rows).
  • Mitigations: provide a one‑screen “NQD Cards” template analogous to RSG cards; default grids and metrics per Context. (Keep ≤ 7 visible Characteristics—mirrors RSG human‑scale guidance.)
  • Reader quickstart (engineer‑manager): (1) Pick 2–3 Q characteristics aligned to the anomaly + a simple CharacteristicSpace (2–4 dimensions). (2) Accept defaults for NoveltyMetric, grid granularity, and K=1. (3) Run NQD‑Generate to a fixed budget; read the front row first. (4) Apply Step 3 filters; log decisions in the DRR.

For the framework (kernel growth).

  • Zero new primitives; only a CHR import and a Method. Passes A.11 minimal‑sufficiency.

Placement in the Reasoning Cycle (ADI)

This pattern only structures hypothesis exploration (Abduction) and does not define or imply any operational gates. It respects ADI ordering (Abduct → Deduct → Induct) and leaves deployment/readiness concerns to patterns outside this spec.

Context‑Level KPIs (optional, informative)

Contexts may monitor these—not as gates, but to improve practice:

  1. Generativity (Gv). Fraction of abductive cycles whose selected candidate reaches L1/L2 within policy windows (time‑to‑L1; time‑to‑evidence). (Maps onto state transitions driven by B.5.)
  2. Frontier‑Hit Rate (FHR). % of cycles where the chosen candidate lies on the Pareto front over the declared DominanceSet at selection time; track novelty/diversity contribution separately as archive, tie-break, or policy-promoted evidence.
  3. Coverage Gain (ΔI, report). Change in the illumination summary (coverage map/%filled cells) per cycle (how much of the descriptor space is now “lit”).
  4. Exploration Cost Ratio (ECR). Compute/time spent in NQD‑Generate divided by downstream Shape/Evidence cost saved (tracks whether the pattern pays for itself).
  5. Refutation Learning Yield (RLY). Among refuted candidates, % that added new coverage or raised SurpriseScore—turning “failures” into map‑building.

Worked micro‑example (abbreviated)

Framing = Step 1 in B.5.2 Context: A Context using FPF to evolve FPF itself (meta‑improvement). Anomaly: “Users perceive FPF as compliance‑heavy; we need first‑principles creativity surfaced.”

Step 2 (NQD‑Generate).

  • CharacteristicSpace: {creative‑characteristic count, explicit novelty metric present?, QD operator present?, didactic cards present?}. (Illustrative; Contexts SHALL define their own descriptors per §2.)

  • Q‑measures: {editor effort↓, time‑to‑L1↓, reader clarity↑}.

  • Output Pareto set (sketch):

    • h₁ = “Add Creativity‑CHR + NQD pattern (this pattern)” — high D, high N, medium Q.
    • h₂ = “Rename governance terms to arts vocabulary” — low N, low D, medium Q.
    • h₃ = “Add live ideation sandbox (ops tooling)” — medium N, medium D, high Q.

Step 3 (Filters).

  • Falsifiability: h₂ weak—no testable prediction → drop.
  • Scope (USM): h₁ scoped to Part B; TimeWindow = edition 2025‑Q4covers TargetSlice. h₃ crosses Contexts (tooling) → requires Bridge; the overhead is accounted for in R (not F/G). (This pattern does not create or alter Bridges.)
  • Select prime: h₁ → formalize as L0 episteme (this pattern), move to Shaping (define checklist), then Evidence (track KPIs).

Trade‑offs & mitigations

  • Cognitive effort. Interpreting Pareto sets and coverage maps adds thinking overhead. Mitigation: standard “NQD Card” + default grids; keep Characteristics small in number (≤ 7). Manager shortcut: pick 2–3 Q characteristics that reflect the anomaly, then run with defaults.
  • Locality. Novelty/diversity are context‑local; Cross‑context reuse requires re‑measurement or an explicit mapping. This pattern does not define Cross‑context operational controls.
  • Not a magic idea machine. Abduction remains human/agentic; the pattern structures search, it does not automate insight. B.5’s abductive primacy stands.
  • Metric gaming & collinearity. Avoid making N and S redundant by policy; when strong collinearity is detected, freeze one as informative only and record rationale in the DRR.
  • Extends: B.5.2 Abductive Loop (Step 2/3 operationalization).
  • Driven by / feeds: B.5 Canonical Reasoning Cycle (Abduction→Deduction→Induction), B.4 Evolution Loop (Observe/Refine).
  • Uses: A.17/A.18 for characteristic discipline and B.5 ADI ordering. May refer to Context‑specific MAP‑Elites/novelty‑search implementations in the MethodDescription. No operational gating is in scope here. C.17 (Use‑Value / ValueGain, normative definition).
  • Respects: A.11 (no kernel growth beyond CHR template import + Method).

B.5.2.1:End


Role-Projection Bridge

Problem Frame

The FPF is built upon a small set of universal, domain-agnostic concepts (U.Types) like U.System, U.Objective, and U.State. This universality is the source of its power, allowing it to be applied to any domain, from thermodynamics to software engineering. However, practitioners in these domains do not speak in terms of U.Types; they use their own rich, specialized vocabularies. A thermodynamicist talks about a "Thermodynamic System" and its "Macrostate," not a U.System and its U.State.

Problem

How can FPF bridge this gap between its universal core and the specific language of a domain without either polluting the kernel with domain-specific terms or forcing experts to abandon their familiar vocabulary? A simple alias mechanism (e.g., a dictionary mapping U.System to "Thermodynamic System") is insufficient because:

  1. It's brittle: It assumes a one-to-one mapping, which often breaks down. A single domain concept can play multiple universal roles in different contexts.
  2. It's semantically poor: It only captures naming, not the rich constraints and relationships that a domain-specific concept entails. We can't express that a "Thermodynamic System" is a special kind of U.System with specific properties related to temperature and pressure.
  3. It's not integrated: The mappings live outside the formal model, making them difficult to govern, version, and use in automated reasoning.

Forces

ForceTension
Universality vs. SpecificityHow to maintain a lean, universal kernel while accommodating the rich, specific terminologies of countless domains.
Flexibility vs. RigorHow to allow a single entity to be viewed through multiple lenses (e.g., as a physical system and an economic asset) without creating ambiguity.
Integration vs. IsolationHow to incorporate domain knowledge into the formal model without hard-coding it into the FPF kernel, thereby preserving the Open-Ended Kernel principle (P-4).

Solution

FPF solves this with the Role-Projection Pattern, a mechanism that creates a robust, semantically rich Concept-Bridge between the universal kernel and domain-specific vocabularies. This pattern is built on three core components:

The Role Concept

  • Description: FPF introduces a new universal type, U.Role. A Role is not a concrete thing but an abstract, context-dependent role that an entity can play. It represents the domain-specific interpretation of a universal concept.
  • Example: "Thermodynamic System" is not modeled as a new subtype of U.System. Instead, it is modeled as a Role that a U.System can play when it is being analyzed from a thermodynamic perspective.

The refinesType Relation**

  • Description: Every Role MUST declare which universal U.Type it refines or specializes. This is done via the refinesType relation.
  • Example: The ThermodynamicSystemRole would have the relation refinesType: U.System. This creates a formal, unbreakable link to the kernel. It guarantees that any entity playing this role still inherits all the fundamental properties and invariants of a U.System. This is a many-to-one relationship: many different roles (e.g., EconomicSystemRole, BiologicalSystemRole) can all refine the same U.System type.

The playsroleof Relation**

  • Description: This relation connects a concrete entity in a model to a Role. It is the assertion that "this specific thing is currently playing that specific role."
  • Example: In a model of a steam engine, we would assert that our specific engine instance plays_role_of: ThermodynamicSystemRole. This assertion signals to all tools and reviewers that this engine should be interpreted as a U.System and that the rules and constraints associated with the ThermodynamicSystemRole now apply to it.

Didactic Note for Managers: From "Alias" to "Job Description"

The Role-Projection pattern is the difference between giving someone an alias and giving them a job description.

  • An Alias (the old way): Simply says "Bob is also known as The Manager." It's just a name swap.
  • A Role (the FPF way): Says "Bob plays_role_of Manager." This is much richer. It implies that Bob has specific responsibilities, authorities, and performance expectations that come with the "Manager" role. He might also play other roles, like "Mentor" or "Team Lead."

Similarly, when we say a component plays_role_of "Sensor," we are not just renaming it. We are activating a rich set of expectations and rules that come with being a sensor (e.g., it must have an output port, it must have a defined accuracy, etc.). This makes our models smarter, safer, and more precise.

Archetypal Grounding

To illustrate the pattern in action, let's consider how we would bridge the domain of classical thermodynamics to the FPF kernel.

  1. Define the Roles: A domain expert creates a set of Roles, each refining a core U.Type:

    • A U.Role named ThermodynamicSystemRole with refinesType: U.System. It might have a description: "A region of the universe under study, separated by a boundary."
    • A U.Role named MacrostateRole with refinesType: U.State. Its description could specify that it is defined by variables (P, V, T, N).
    • A U.Role named ControlVolumeRole with refinesType: U.Boundary.
    • A U.Role named FreeEnergyObjectiveRole with refinesType: U.Objective.
  2. Apply the Roles in a Model: An engineer modeling a heat engine would then use these roles:

    • They create an instance of U.System representing the engine and assert: HeatEngine_Instance plays_role_of: ThermodynamicSystemRole.
    • They model the engine's state and assert: EngineState_Instance plays_role_of: MacrostateRole.
    • They define the system's goal and assert: EngineObjective_Instance plays_role_of: FreeEnergyObjectiveRole.

What this achieves:

  • The model is now semantically rich. Tools can now understand that HeatEngine_Instance is not just any system, but one that should be analyzed using the laws of thermodynamics.
  • The model is verifiable. A tool could now check if an entity playing the MacrostateRole actually has attributes for Pressure and Temperature, enforcing domain-specific consistency.
  • The model remains universally compatible. Because ThermodynamicSystemRole refines U.System, the heat engine can still be reasoned about as a generic system in a wider context (e.g., in a model of the entire power plant).

Conformance Checklist

  • CC-B5.3.1 (Role Grounding Mandate): Every U.Role MUST be linked to exactly one universal U.Type via the refinesType relation. Orphaned roles are forbidden.
  • CC-B5.3.2 (Explicit Role Assertion): A domain-specific concept SHALL NOT be treated as a subtype of a U.Type directly. Its relationship MUST be expressed using the plays_role_of relation to a U.Role.
  • CC-B5.3.3 (Multi-Role Flexibility): A single entity MAY play_role_of multiple Roles simultaneously, even from different domains.
  • CC-B5.3.4 (Semantic Integrity): A Role MAY introduce additional constraints or required attributes that are more specific than those of the U.Type it refines, but it SHALL NOT contradict them.

Common Anti-Patterns and How to Avoid Them

Anti-PatternManager's View: What It Looks LikeHow FPF Prevents It
The "Subtype Explosion"The list of system "types" in the project grows endlessly: ThermodynamicSystem, EconomicSystem, SoftwareSystem, etc. The ontology becomes bloated and unmanageable.CC-B5.3.2 forbids this. There is only one U.System. Different perspectives on it are modeled as Roles, which keeps the core ontology lean.
The "Magic Synonym"A developer simply renames U.System to "Thermodynamic System" in their diagrams, but there are no formal rules or constraints attached. The term is just an alias.The FPF pattern requires a formal Role with a refinesType link. This is a rich, structural connection, not just a cosmetic name change.
The "One-Hat Fallacy"The model forces an entity to be only one thing. An asset can be a "Physical Component" or a "Financial Asset," but not both, leading to duplicated models.CC-B5.3.3 explicitly allows an entity to play multiple roles. A single server in your data center can simultaneously play_role_of "PhysicalComponent" (for Sys-CAL) and "DepreciableAsset" (for a financial mechanisms).

Consequences

BenefitsTrade-offs / Mitigations
Semantic Richness and Precision: The pattern allows domain-specific constraints and rules to be formally integrated into the model, enabling much more powerful automated checking and reasoning.Increased Modeling Granularity: It introduces a layer of indirection (Entity → Role → U.Type) that modelers must learn. Mitigation: Tooling can automate much of this, suggesting relevant roles based on the context or domain.
Multi-Domain Integration: The pattern provides a clean and robust mechanism for a single model to incorporate concepts from multiple, diverse domains without conflict.-
Preserves a Lean Kernel: The FPF kernel remains small and universal, with all domain-specific complexity handled in a modular, plug-in fashion via Role libraries.-
Enhanced Traceability and Clarity: The roles an entity plays are explicit assertions. This makes the model's intent clear and auditable.-

Rationale

The Role-Projection pattern is the cornerstone of FPF's approach to universality with specificity. It is a direct implementation of the Open-Ended Kernel (P-4) and FPF Layering (P-5) principles. By separating the timeless, universal concepts (U.Types) from their context-dependent, domain-specific interpretations (Roles), FPF achieves a powerful balance.

This approach is inspired by contemporary practices in both ontology engineering (e.g., the use of role concepts in foundational ontologies like UFO) and software architecture (e.g., aspect-oriented programming and role-based modeling), but it integrates them into a single, coherent pattern. It provides a formal, scalable, and semantically rich solution to the perennial problem of bridging the universal and the particular.

Relations

  • Implements: ADR-003: Role-Projection Pattern and Concept-Bridge.
  • Enables: The practical application of all FPF patterns by providing the "glue" that connects them to the FPF kernel.
  • Used By: All other patterns in the reasoning cycle, as it provides the vocabulary for framing hypotheses and interpreting evidence in a domain-specific context.

B.5.3:End


Last Updated: 2026-06-08 — upstream FPF commit 093d30e8 (github.com/ailev/FPF)