Cluster A.V - Constitutional Principles of the Kernel
Preface node
heading:cluster-a-v-constitutional-principles-of-the-kernel:18540
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)
Status: Stable
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:
- Role vs Function (mask vs behaviour),
- MethodDescription vs Method vs Capability vs Work (description vs abstract way-of-doing vs system ability/envelope vs performed occurrence),
- Holon vs System vs Episteme (what can act and what cannot),
- EntityOfConcern vs Description episteme, View, and Publication (the item under concern vs epistemes and publication relation positions that make it available; specification is a gated use or refinement of a Description episteme, not a third peer member of this distinction).
It harmonizes A.2 and A.2.1 (role values and role-assignment relations), A.3.4 (transformation), A.10 (evidence-provenance and carrier/source-currentness relations), A.14 (Advanced Mereology), A.15 (Role-Method-Work Alignment), C.2.1 (U.EpistemeSlotRelation), 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; systems or acting holons enact behaviour through work-facing role assignments in a bounded context.
- Transformation (A.3.4) and role assignment (A.2/A.2.1). Every claimed change names the transformation or work occurrence, the affected entity, and any current
U.RoleAssignmentfor the acting system or holon; there is no “self-magic”. - Method/work backbone (A.3.1, A.3.2, A.15). We separate MethodDescription (description), Method (abstract way-of-doing), Capability (a system's ability or envelope to enact a Method under conditions), WorkPlan (intent window), and Work (run-time occurrence), with the acting side expressed through
U.RoleAssignmentwhen a work-facing role is current. - Evidence (A.10). Knowledge claims cite evidence-provenance and carrier/source-currentness relations; 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:
- 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.
- Agency misplacement. Epistemes (documents, models) are treated as doers; collectives as raw sets; or a “holon” is used where only a system makes sense.
- 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
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)}. 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 boundary — Describe_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 boundaries 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 boundary — EntityOfConcern 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, publication relation positions, records, and carriers remain orthogonal relation positions: 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-like wording, functional behaviour, capability, method, and work
- Role (role value). A context-bound work-facing role value assigned through
U.RoleAssignment(A.2, A.2.1, A.15). A role value is not behaviour; it names the assigned work-facing position under which an acting system or holon may enact behaviour. Example: CoolingCirculatorRole@Context in a thermal loop. - Function-like wording. A source phrase such as "function", "behaviour", "service", or "does X" may name a required transformation or effect (A.3.4), functional behaviour (A.6.F), a capability envelope, a method, performed work, a quality, or a structure. Recover the governed claim before choosing the FPF term.
- Under role assignment. A system or acting holon under a current
U.RoleAssignmentmay have a Capability to enact a Method under conditions and may perform Work that produces, maintains, prevents, or checks a transformation/effect. The role is not the behaviour, Method is not identical to transformation/effect, and Capability is not the Method.
Safe rewrite for earlier "Holonic Duality (Substance vs Function)": Holonic Duality (Substance vs Role). A U.System keeps its identity while changing assigned role values; each assigned role value may require a Method, a Capability envelope to enact that Method under conditions, and possible Work occurrences.
Normative guard: Use Role for the role value, U.RoleAssignment for the assignment relation, functional behaviour when A.6.F governs the behaviour claim, Method for the abstract way-of-doing, Capability for a system ability/envelope to enact a Method under conditions, Work for the performed occurrence, and Transformation or effect wording when A.3.4 governs the change claim. Do not call the role itself a function, and do not define Method as Capability or as the transformation/effect itself.
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 A.10 carrier/source-currentness refs 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.Workcreation. 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 or acting holon — the entity that can enact behaviour when it is the holder of a current work-facing
U.RoleAssignment. - Episteme — cannot act and does not hold work-facing roles; it is changed via carriers, publications, and work on those carriers by systems or acting holons. Reference, constraint-source, evidence, status, source, requirement, publication, and assurance uses are direct relation/use cases, not episteme roles.
- Holon — umbrella term; do not use it where the current claim requires a system as role-assignment holder. Write the exact holder and
U.RoleAssignment(holderRef, roleRef, boundedContextRef)when a work-facing role such asTransformerRole@Contextis current.
Normative guard: Work-facing roles, including TransformerRole@Context when used, are role values in U.RoleAssignment and have a system or acting holon as holder in a bounded context. Epistemes do not hold roles merely because they are used as references, evidence, constraints, sources, requirements, publications, or assurance inputs.
Episteme vs publication carrier and source-currentness record
- Episteme — the knowledge content (claim, model, requirement set).
- Publication carrier or source-currentness record — the physical or digital carrier for an episteme publication or stored representation (file, volume, dataset item), tracked through A.10 carrier/source-currentness relations when evidence, source, or reliance use is current.
- 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.
- RoleAssignment — a system or acting holon is the holder in a current
U.RoleAssignment.
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
EntityOfConcernvalue is and how it is described are distinct questions. Description is aU.Epistemeuse withDescriptionContext. 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 besideEntityOfConcernand 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
EntityOfConcernvalue, the Description episteme, the specification-use gate/refinement, or an evidence/source carrier by the same relation; physical and digital carriers stay in A.10 carrier/source-currentness relations when evidence, source, or reliance use is current. - 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 policy. Cross-context or cross-reference-plane reuse cites Bridge id + CL; Phi(CL) and Phi_plane penalties apply 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:
If the same or near-same relation needs mathematical or postulate-theory justification, A.7 stops at the strict-distinction boundary instead of pretending to prove it: use C.29 for the mathematical lens, E.18 and E.18.1 where transformation-flow, carry-through, and postulate-theory work supply the required justification, E.18 where a gate crossing is the live relation, or the relevant architecture pattern where the comparison is about structure, graph, flow, or architecture description.
Compact relation-position recovery aid
When one visible source object, such as a diagram, dashboard, card, model output, PublicationUnit, carrier, or generated artifact, can be read as several FPF values at once, use A.7 only to recover the current relation position. Name the current EntityOfConcern, Description episteme, view, publication face, publication form, PublicationUnit, carrier, rendering, mathematical-lens use, evidence relation, gate decision, work occurrence, authority-reference relation, source-currentness relation, or source-use claim, then apply the direct governing pattern for that position.
This aid is not a reusable object, local record, table, or master checklist. If the direct governed claim is already clear, do not add an A.7 recovery note; cite the direct pattern.
Typed describing morphism and specification-use boundary (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):
- Episteme-source preservation (DESC-1E). When the
EntityOfConcernvalueXis itself aU.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. - Non-episteme describing trace (DESC-1N). When
Xis 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 aboutXonly through a declared construction, reference, measurement, observation, model, postulate-theory, or witness trace, with admissibility conditions visible for the intended use. - Identity and meaning preservation (DESC-2). If
f : X -> Yis a meaning-preserving, bridge-admitted, or construction-preserving map for the selected EntityOfConcern values, thenDescribe_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. - Specification-use refinement case. 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. - Separation from Gamma.
Describe_EoC_DescEpand 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. - Ontology preservation. Describing any
EntityOfConcernvalue, such as a Calculus, Signature, Mechanism, Structure, Work occurrence, or Episteme, viaDescribe_EoC_DescEpdoes 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”.
Example 2 — Result‑only (promise the world state): “a hole of depth ≥ 1 m exists”.
Example 3 — Composite (promise both): “hairstyle for the evening, produced within 20 minutes, by cut+style (not a wig)”.
(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 or acting holon under a current U.RoleAssignment enacts Work on the asset; evidence binds through A.10 carrier/source-currentness and evidence-provenance relations.
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 A.10 carrier/source-currentness refs when evidence or source use is current).
- 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 and printed volume with A.10 carrier/source-currentness refs when the standard is used as source or evidence.
- Use relation: reference-use or constraint-source-use relation for the valve selection activity, named by its direct governing pattern.
- Role assignment for work:
U.RoleAssignment(holderRef=DesignTeamSelectionSystem, roleRef=TransformerRole@ValveSelectionContext, boundedContextRef=ValveSelectionContext)when the selection work needs a work-facing transformer role value. - 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 hold a current
U.RoleAssignmentfor a work-facing role value such asCoolingMaintenanceRole@Context. - Safe phrasing: “
U.RoleAssignment(holderRef=TeamT, roleRef=CoolingMaintenanceRole@Context, boundedContextRef=ContextT)is current for Work W…”
Conformance Checklist (normative)
Canonical rewrites (didactic library)
Anti‑patterns (with fixes)
-
Role‑as‑behaviour — calling the role “the function”. Fix: Name the role, Method, and Work explicitly.
-
Episteme‑as‑system — “the model routed traffic”. Fix: Name the system or acting holon, its
U.RoleAssignmentwhen a work-facing role is current, the Work that used the model, and the carriers touched. -
Triad everywhere — omitting Work entirely. Fix: Add the Work position: timestamps, outcomes, Γ_time coverage.
-
Operator blur — using one “process operator” for everything. Fix: Choose among Γ_method, Γ_time, Γ_work, Γ_sys.
-
Set‑as‑collective — a MemberOf set “decides”. Fix: Model a collective system with coordination Method.
-
Evidence without carrier references — citing ideas without carriers. Fix: Add A.10 carrier/source-currentness refs and tie claims to evidence or source relations.
-
Holon/system drift — “holon maintains temperature”. Fix: Say system; reserve “holon” for neutral mereology.
-
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.
-
Process‑word leakage — domain “process” used as FPF operator. Fix: Add parenthetical mapping at first use (Method and Work).
-
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.
-
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 theEntityOfConcernvalue, the Description episteme, specification-use gate/refinement, or the publication relation being presented.
Consequences
EntityOfConcern and publication-boundary consequences
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 refinement-typed specification toolchains (e.g., Liquid Haskell, Dafny's post-2017 refinements, Rust's
uomtype-level units) treat formalization as monotonic refinement with pinned units and scales. A.7 uses them only to motivate the specification-use boundary; 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 work-facing chain in context: acting system or holon,
U.RoleAssignment, MethodDescription, Method, Capability, WorkPlan, Work, and A.10 evidence-provenance or carrier/source-currentness relation where evidence is claimed. - Why name publication faces and forms in A.7? Strict Distinction already guards the
EntityOfConcernvalue 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 toEntityOfConcern, 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 and A.2.1 (role values and role-assignment relations), A.3.1/A.3.2/A.3.4 (Method, MethodDescription, Transformation), A.10 (evidence-provenance and carrier/source-currentness relations), A.14 (Advanced Mereology), A.15/A.15.1/A.15.2 (Role-Method-Work, Work, and WorkPlan 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-use discipline), C-cluster (selection and archives) by enforcing
EntityOfConcernand Description-episteme boundary, specification-use boundary, 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 (gate crossing 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
“
U.RoleAssignment(holderRef=⟨system-or-acting-holon⟩, roleRef=⟨Role@Context⟩, boundedContextRef=⟨Context⟩)is current for the work; the holder has Capability ⟨C⟩ to enact Method ⟨M⟩ (from MethodDescription ⟨S⟩), executed Work ⟨W⟩ on ⟨time⟩, and cites A.10 evidence-provenance or carrier/source-currentness refs ⟨ids⟩; resources are accounted through the governing work-cost relation.”
Five binary checks
- Bare acting-subject check: No bare “actor” token in normative core claims; canonical
U.RoleAssignmentphrasing is present when a work-facing role is current. - Clear quartet: MethodDescription, Method, Capability, and Work are all named (as applicable) and not conflated.
- Right Γ: Γ_method composes Method; Capability states a system ability/envelope under conditions; Γ_time covers occurrences; Γ_work accounts resources; Γ_sys covers system properties.
- Episteme handled: Epistemes do not act; carriers or source-currentness refs are listed when evidence or source use is current.
- 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 role values and assignment references (e.g.,
CoolingCirculatorRole@Context). - 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
Forces
Solution — The Three‑Domain Falsification Test
Normative Rule (C‑1) A
U.Typeenters 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):
-
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.
-
Role‑Projection Records For each domain, author a short
Role‑Projectiontuple:{domain, indigenous term, Role, exemplar}. Example:{physics, "Free Energy", extremum driver, closed gas system}. -
Congruence Check All three exemplars must satisfy the same abstract intent; superficial analogy is rejected.
-
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)
These juxtapositions give engineer‑managers an immediate sense of why each primitive is worth learning.
Conformance Checklist
Consequences
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
Known Uses
- Energy ↔ Budget ↔ Attention – Engineering teams reused
U.Resourceto 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
- Domain taxonomy stability – Should the five domain families be versioned as science evolves (e.g., quantum‑bio‑tech)?
- Automated congruence checks – Can category‑theoretic tooling semi‑automate the functional‑role equivalence test?
- 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
These pathologies derail safety cases and budget decisions across disciplines.
Forces
Solution — Invariant Quintet + Meta‑Holon Transition
Invariant Quintet
Any aggregation operator Γ that claims FPF conformance MUST preserve these five invariants :
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
Conformance Checklist
Consequences
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
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
- Order‑sensitive physics – Should quantum‑circuit folds live in a Extention Patterns with a relaxed invariant set?
- Synergistic redundancy – Can WLNK be reframed using an “effective minimum” when true redundancy lifts the floor?
- Didactic tooling – Which visual cues best alert non‑formal audiences to an approaching Meta‑Holon Transition?
- 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: Claim-Bound Evidence and Provenance Graph
Type: Kernel pattern Status: Stable Normativity: Normative
Problem frame
Use this pattern when a claim, metric, model result, dashboard tile, confidence badge, review note, credential, provenance label, quantum-like statement, causal-use statement, or generated explanation starts acting as evidence while the evidence carrier, evidence-producing work, method trace, time window, source-currentness relation, or rival explanation is still implicit.
Primary EntityOfConcern. The EntityOfConcern is the claim-bound evidence-provenance graph relation: the path in the evidence-provenance graph that links one named claim or effect to concrete carriers, evidence-producing or evidence-interpreting work occurrences, role assignment when current, method trace or work trace, time stance, and admissible evidence use.
First useful move. Write the smallest because-graph that can answer: which claim or effect, which carriers, which evidence-producing or evidence-interpreting work occurrence and role assignment when current, which method or work trace, which time window, which evidence relation, and which bounded use?
What goes wrong if missed. Claims become weightless, dashboards become authority, provenance becomes truth, credentials become permission, generated explanations become evidence, method descriptions get mixed with work traces, and part-whole structure is mistaken for evidence.
What this buys. One bounded evidence relation that can be replayed, contested, refreshed, narrowed, or used by a neighboring governing pattern without making evidence pretend to be approval, permission, gate passage, performed work, assurance, causal authority, or part-whole structure.
Ordinary use. For routine source-finding, orientation, bounded reversible probes, and low-stakes evidence use, keep the evidence relation small: claim, carrier, producer or source-maintenance role assignment, method trace or work trace when relevant, time window, bounded evidence use, unsupported attempted use, and reopen trigger.
Reliance-facing use. Expand the evidence relation only when consequence severity, reuse, contestability, cross-context movement, source-currentness risk, credential reliance, provenance reliance, gate use, release use, assurance use, work use, causal-use claim, or privacy boundary makes the extra field decide the current claim.
Not this pattern when. Not this pattern when the current claim is authorization, commitment, performed work, gate decision, assurance, causal identification, measurement construction, representation-scheme transition, explanation faithfulness, or source publication use itself. In those cases, use the neighboring governing pattern and let A.10 supply only the evidence-provenance graph relation it needs.
Use A.2.4 first when the immediate question is only whether an episteme is being used as evidence or status for a claim, before a full evidence-provenance graph relation is needed. A.2.4 keeps episteme evidence-use and status-use relation slots distinct from U.RoleAssignment; A.10 then owns the full claim-bound evidence-provenance graph relation when the carrier, producer, method trace, work trace, time window, and provenance relation must be replayable.
Here path means a path in the evidence-provenance graph, not a route for actions to follow.
Problem
Without a uniform evidence path, models drift into five failure modes:
- Weightless claims. Metrics or arguments appear in the model with no link to their symbol carriers (files, datasets, lab notebooks, figures).
- Collapsed scopes. Design-time method specs are silently mixed with run-time traces; results cannot be reproduced because "what was planned" and "what work occurred" are conflated.
- Self-justifying loops. A claim is used as evidence for itself, or the same work occurrence both produces the target claim and supplies its evidence without a separated evidence-producing or interpreting work occurrence, provenance relation, source-maintenance role assignment, or relying context.
- Source loss during aggregation. As
Γcombines parts, some sources fall out; subsequent audit cannot reconstruct why a compound claim was accepted. - Temporal ambiguity. Time-series are aggregated without interval coverage or dating source; gaps and 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
Solution — The Evidence Graph Referring Standard
The Standard is a small set of primitives applied uniformly, with practitioner-first clarity and formal connection points for proof obligations. Its primary EntityOfConcern is the evidence-provenance path for a claim or use: an evidence episteme or evidence record, target claim or target use, publication or carrier relation, provenance relation, evidence-producing or evidence-interpreting work occurrence, producer or source-maintenance role assignment when current, method trace when relevant, time stance, scope, polarity, relevance window, and assurance use. 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.
Evidence-provenance graph relation
A typed, acyclic evidence-provenance graph relation stays disjoint from mereology. Its nodes and references are typed by their current FPF kind: claim or target use, evidence episteme or evidence record, publication or carrier reference, provenance relation, evidence-producing or evidence-interpreting U.Work, U.RoleAssignment for producer, interpreter, verifier, or source-maintenance holder when that assignment is current, U.MethodDescription or method trace when the evidence depends on method, observation or evaluation record, and relevance window. Edge vocabulary is small and normative: evidences, derivedFrom, measuredBy, interpretedBy, usedCarrier, producedByWork, maintainedByRoleAssignment, happenedBefore (temporal), etc.
Practitioner view: it is the “because-graph”: every claim answers “because of these evidence items and carriers, produced or interpreted by this work under this assignment, using that method where relevant, within this time window.”
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 evidence-provenance graph relation, not in the mereology graph.
Carrier and source-currentness records
When an episteme composition, publication, compilation, dashboard, generated explanation, or assurance use substantively relies on source carriers, the evidence-provenance path SHALL keep a carrier/source-currentness record: carrier id or source reference, type, version or edition when relevant, date or relevance window, source conditions, provenance relation, and optional part-carrier relation for sub-carriers. When a bounded context needs publication-grade reuse, the record is adapted to that context with vocabulary, unit, identifier, and hash discipline while preserving carrier identity and carrier integrity. Why this matters: it prevents “lost sources” during composition and underwrites reproducibility without mandating any specific tool or preserving one older register name as the governing ontology.
Scope alignment across Role-Method-Work
- Design-time: MethodDescription is the design-time episteme describing U.Method; evidence relations reference what would constitute proof or test for that method.
- Run-time: dated U.Work occurrences belong 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.
Evidence-producing work and relying context
The work occurrence that produces, measures, interprets, verifies, publishes, or maintains evidence is modelled separately from the target claim or target use that relies on that evidence. If the same system participates on both sides, the evidence path must still name the distinct work occurrence, role assignment, carrier/provenance relation, relying context, and reopen condition. Reflexive monitoring is admissible only when those relations are explicit; it is not evidence by self-label.
Gamma-flavour evidence connection points
- Γ_sys (formerly Γ_core): physical properties are evidenced by measurement models, boundary conditions, calibration carriers, and dated observations.
- Episteme composition and publication use: every evidence-provenance node resolves to a carrier/source-currentness record or to an explicitly named evidence episteme, provenance relation, or source-maintenance relation.
- Γ_method: order-sensitive composition; at design-time a Method Instantiation Card (MIC) states Precedes, Choice, Join, and guards; at run-time traces record
happenedBeforeand point to theU.Methodthey enact and themethodDescriptionRefthey used. - Γ_time: temporal claims state interval coverage; Monotone Coverage with no unexplained gaps and no unexplained overlaps is required.
- Γ_work: resource spending and yield are evidenced by instrumented carriers (meters, logs) and their
methodRefplusmethodDescriptionRef; keep resource rosters separate from carrier/source-currentness records.
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 a reliance claim. The A.10 evidence path is claim-bound: it evidences one named claim or effect for one 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-provenance graph relation to source-sensitive cases where displays, credentials, copied text, generated text, dashboards, provenance labels, or attestations are being overread. If the work occurrence, gate decision, speech act, commitment, or evidence relation is already recorded in a project-side FPF source, recover and cite that source named by value directly instead of analyzing nearby wording first.
A10-lite is enough for source-finding, orientation, learning, and bounded reversible probes:
Minimum evidence path for routine reliance:
Expanded fields are collected only insofar as they decide the current 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 review-role names, sensitive model provenance, or sensitive data provenance. Redaction does not create source relation; it must preserve enough recoverability for the relying context.
Case repairs:
If the evidence path is incomplete, A.10 reports evidence-path state and source-currentness status, not work or reliance evidence relation for the attempted claim or effect. Possible 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 attempted P2W class or reliance claim, proceed only with a reversible local probe under an explicit work plan when a work change is being attempted, or block the unsupported work claim or reliance claim.
Broken-source repair assignment. If the relying actor cannot recover or verify the source relation, assign the repair to the accountable project-side responsibility assignment: issuer or performer, verifier assignment, status-source relation, evidence-producing work assignment or evidence-producing system, gate-decision source, role-assignment source, 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.
Repeated missing-source indicator. If the same visible carrier family repeatedly returns stale, contested, no-source, or no-currentness A.10 results, record a source-relation repair action: 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 relation or display needs repair; it is not a reason to make each acting user rebuild the evidence path manually.
Display guidance for evidence and currentness: an evidence or status display should show the claim or effect, evidence carrier, source-maintenance role assignment, reference or link named by value, time window, freshness, relying context, and unsupported work use, reliance use, 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 evidence-path field, evidence carrier named by value, 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 action for instrumentation, source refs, status, currentness, claim-bound source links, credential view, model documentation, data documentation, or provenance and attestation label.
Contestability and redress relation: 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, evidence carrier, source-maintenance role assignment, verifier or status source, freshness or revocation source, privacy-minimized evidence ref, safe interim disposition, and review or redress relation. A disputed display remains contested until the source-order or currentness question is resolved.
Positive repaired evidence-use statement. When the source relation is complete, write the smallest source-backed evidence-use statement: named claim or effect, evidence carrier and source-maintenance role assignment, method trace or work trace, time window, currentness, evidence relation, and the named work use or reliance use for which the evidence relation is bounded. The downstream use stays 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 work or reliance, 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 governingPatternRef or authoritySourceRef named by value 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 evidence use. 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 bounded evidence use and unsupported attempted use, then either stay inside A.10 or apply the governing pattern for the stronger claim being made. It is not a required project review step and does not ask the practitioner to inspect every source-looking carrier or display.
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 slices and 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 attempted evidence use, then stop when the bounded evidence relation, unsupported attempted use, and reopen condition are clear. This local section keeps the attempted use inside the 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 bounded evidence use, unsupported attempted use, window, and reopen condition; threshold reliance applies the minimum governing pattern only when the B.3 material-reliance threshold is met: behavior, safety, release, compliance, public or protocol behavior, access, resource allocation, people status, team status, operational action, or controlled-object regulation would materially change. Plain wording remains ordinary unless it changes bounded use, source relation, evidence, gate, assurance, work, decision, or neighboring governing-pattern claim.
Cheap stop: if a bounded claim, current carrier, evidence path, window, bounded evidence use, unsupported attempted use, and reopen trigger are present, and there is no assurance claim, gate relation, work relation, control-bearing relation, release relation, or met B.3 material-reliance threshold, 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 classification: 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 those relations are being claimed.
Plain move palette: RelianceDisposition=pass means proceed only inside the bounded evidence 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 evidence-use classification; RelianceDisposition=evidence-needed means ask for the named missing evidence at the named decision point; RelianceDisposition=safety-case-required means apply B.3 because the B.3 material-reliance threshold is met; RelianceDisposition=blocked-current-use means block the current attempted use until the evidence path or governing source relation changes.
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 and window when relevant, bounded evidence use, unsupported attempted 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 relevant 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 status, 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 represented situation or represented source condition, 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.
Minimum contest relation with possible redress: a contest relation exists only when the affected party or accountable review role 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 values is not enough to change the disposition.
Affected-party contestable minimum: even when raw evidence stays review-role-mediated, 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 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 relation.
Worked source-overread slices:
Causal evidence relation values in evidence paths
Evidence graph paths used for causal-use claims must carry the C.28-governed CausalEvidenceSupportBasis value without redefining causal estimands or causal-use authority. In this subsection, SupportBasis is a C.28 field-value name; it is not the loose FPF prose word "support".
The C.28 values that A.10 may carry in an evidence path are:
[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 causal-evidence values. Assumption-only and no-evidence-use cases are represented by causal assumptions, a [C.28](/generated/patterns/C.28) causal-use verdict, bounded use, unsupported attempted use, or abstain in [C.28](/generated/patterns/C.28)/[B.3](/generated/patterns/B.3), not by a second causal-evidence vocabulary.
No unsupported causal-use shift:
Evidence-path micro-examples:
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 value and the relevant [C.28](/generated/patterns/C.28) references when the claim changes 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 the [C.28](/generated/patterns/C.28) causal-evidence refs needed by [C.28](/generated/patterns/C.28) and [B.3](/generated/patterns/B.3).
Archetypal Grounding
Conformance Checklist
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
Rationale and SoTA alignment
- 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 evidence-provenance graph relation and carrier/source-currentness record 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 with no unexplained gaps and no unexplained 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, effective 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, 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-side role-assignment values 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 bounded work effect without source relation named by value.
Practical result from that cited practice: 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, bounded evidence use, unsupported attempted 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.3.4 Transformation; A.10 evidence-use and provenance relation discipline; A.14 Advanced Mereology; A.15 Role–Method–Work Alignment;
A.2andA.2.1for role values and role-assignment relations;C.2.1andE.17for episteme, publication, carrier, and view separation. - Constrains / used by: current composition, transformation, method, temporal, and work operators only when the governing pattern for that operator is named by value; B.1.1 (Dependency Graph & Proofs) where its current dependency-graph claims remain active.
- Enables: B.3 Trust Calculus (R inputs, CL inputs, auditability); B.4 Canonical Evolution Loop (clean DesignRunTag bridges).
- Coordinates with:
C.28when an evidence path is used for a causal-use relation; A.10 carries the evidence-provenance path, whileC.28governs the causal-use question,CausalEvidenceSupportBasisvalue, identification, realizability, bounded use, and unsupported attempted use. - Coordinates with:
A.2.4when old evidence-role or status-role wording around an episteme needs first-use evidence-use or status-use relation slots before the full A.10 evidence-provenance graph relation is written. - Coordinates with:
A.15for work or reliance disposition,A.6for mixed boundary wording,B.3for assurance,A.21forOperationalGate(profile),GateDecision, andDecisionLogRef,A.20forConstraintValiditystatus or witness,A.2.9for speech-act refs,A.2.8for commitments, andA.15.1for work occurrences.A.10supplies evidence paths for those sources; it does not create their gate decision, commitment, role effect, status effect, work-occurrence, assurance, bounded work effect, or bounded reliance effect.
Older source text interpretation and neighboring-pattern notes
Older source texts may use names such as manifest, release manifest, creator, observer, symbol register, SCR, RSCR, MIC, or evidence path without the current FPF distinctions. Treat those names as recovery prompts, not as live vocabulary to copy unchanged.
Use these recoveries:
- a source register used for evidence carriers becomes a carrier/source-currentness record;
- a release-context source register becomes a context-adapted carrier/source-currentness record when the bounded context, identifiers, and hashes matter for publication or release use;
- an internal
creatororobserverused as evidencer becomes evidence-producing work, evidence-interpreting work, source-maintenance role assignment, verifier assignment, or quote-only source wording according to the claim being made; - a method instantiation note is a method relation or work relation only when it states the
U.Method, the method-description source, ordering relation when relevant, and work-trace relation; - resource rosters in
Γ_workremain separate from evidence-carrier registers; cite meter, log, or observation carriers through the evidence-provenance graph.
When an older source text also claims approval, permission, gate passage, assurance, causal authority, measured comparability, representation shift, or publication-face effect, keep A.10 to the evidence-provenance graph relation and apply the neighboring governing pattern for that extra claim.
Evidence carriers for quantum-like statements
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?"
Evidence-relation checks:
- State the minimal state, probe, export, or viability claim being evidenced.
- Pin the concrete carriers: source, trace, dashboard export, report, observation, metric, work result, model output, interview, survey, or incident record.
- State the evidence-producing role and method: who or what produced the carrier, by which method, probe, measurement, or work act.
- State the time window, decay condition, and reopen condition.
- State what the carrier does not show, including the most relevant rival explanation that remains plausible.
- Choose the next pattern: stay in A.10 for carrier evidence relation, apply
B.3for assurance claims, applyC.16for measurement admissibility, applyF.9for bridge or export loss, or apply aC.26.*pattern for the remaining probe, state, or envelope question.
For probe-coupled, distributed-state, bridge-loss, measurement-frame, or viability-envelope statements, include at least:
Useful outputs:
- a local evidence note when the claim only guides discussion;
- an evidence-provenance record or context-adapted carrier/source-currentness 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. AC.29output may state only the C.29-local lens-use value 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 toB.3; measurement construction or comparability goes toC.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
Result: steep learning curves, fragile integrations, eroded trust in “first‑principles” promises.
Forces
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.
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
Conformance Checklist
Consequences
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
Illustrative Uses (2022 – 2025)
- Robotics CAL 2023 –
U.LiDARSensorrejected (Gate G‑1 passed via role composition), saving three schema migrations. - Green‑Finance CAL 2024 –
U.CarbonCreditadmitted provisionally, but Sunset Review (usage = 0) demoted it to sector pattern, avoiding kernel noise. - Neuro‑informatics 2025 –
U.ProvenanceChainaccepted; by Q3 its heavy reuse in three patterns lifted timer and marked it established.
Open Questions
- 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?
- Semantic similarity tooling — can embedding models automate Gate G‑2 overlap detection reliably across domains?
- 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), theMethodDescription(the recipe), theMethod(the capability), and theWork(the event). - A.2 and A.2.1 (
U.RoleAssignment): Provide the holder, role value, bounded-context, and current-window slots used to state the acting-side assignment.
The intent of this pattern is twofold:
- 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. - 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:
- 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.
- 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).
- 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
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 acting-side assignment: the acting side is a
U.RoleAssignmentwithholderRefnaming aU.Systemor admitted acting holon,roleRef=TransformerRole@Context, andboundedContextRefnaming the context. This is the causal/work side, not a compact holder-role shorthand. - The Target: The target is the
U.Holonbeing changed. This can be anotherU.Systemor the symbol carrier of aU.Episteme. - The Boundary: The agent and the target are always separated by a
U.Boundaryand interact through aU.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:
- Identify the Roles: Decompose the system's function into two distinct roles: the part that regulates and the part that is regulated.
- Model as Two Holons: Model these two parts as two distinct (though possibly tightly coupled)
U.Systemholons, even if they share the same physical casing. - Define the Internal Boundary: Model the interface between them as an internal
U.Boundarywith a definedU.Interaction(e.g., a data bus, a mechanical linkage). - Assign the Transformer Role: The regulating part becomes the
holderof theTransformerRole. The regulated part becomes theTarget.
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.
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.
Consequences
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-Evidencerule (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.Boundaryin 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 theU.SystemandU.Epistemeholons 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 theTransformerRolethat 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 theRegulator-Regulatedinteraction 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:
- Formally define agency not as an intrinsic type of holon, but as a contextual Role Assignment.
- Introduce a measurable, multi-dimensional spectrum of agency via a dedicated Characterization (
Agency-CHR), moving beyond a simple binary "agent/not-agent" switch. - 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:
- 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). - Type Inflation: Introducing a
U.Agentas a new base type alongsideU.SystemandU.Epistemewould 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. - 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).
- 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
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.AgentType: To be clear, there is noU.Agentbase type in the FPF Kernel. This avoids type inflation and preserves the dynamic nature of roles. - Epistemes Cannot Be Agents: As the
holdermust be aU.System, this definition constitutionally forbidsU.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 abstractU.Rolethat grants aU.Systemthe capacity for goal-directed action within a context. It is the "license to act."- Specialized Roles: More specific behavioral roles like
TransformerRoleandObserverRoleare considered specializations or sub-roles ofAgentialRole. They describe what kind of agential action is being performed at a given moment.- A system playing
TransformerRoleis an Agent that is currently modifying another holon. - A system playing
ObserverRoleis an Agent that is currently gathering information. This creates a clean hierarchy: aTransformeris always anAgent, but anAgentis not always aTransformer(it could be observing, planning, or idle).
- A system playing
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).
- Boundary Maintenance Capacity (BMC): The ability of the system to maintain its structural and functional integrity against perturbations. (How robust is it?)
- Predictive Horizon (PH): The temporal or causal depth of the agent's internal model. (How far ahead can it "see"?)
- 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?) - Policy Enactment Reliability (PER): The probability that the agent will successfully execute its chosen
U.Methodunder operational conditions. (How reliably does it do what it decides to do?) - Objective Complexity (OC): A measure of the complexity of the
U.Objectivethe 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.
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.
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.
Consequences
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-CHRprovides 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 Gradeprovides a quick communication tool, while the underlyingAgency-CHRprovides 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 onlyU.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 theAgency-CHRof a collective can trigger an MHT.B.3 Trust & Assurance Calculus: TheAgency-CHRprofile 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.).
- The
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:
-
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.
-
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:
-
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.
-
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.
-
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.
-
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
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:
- PortionOf — for measured parts of a whole (stuffs and other extensives).
- PhaseOf — for temporal parts of the same carrier.
- No Roles/Methods in mereology.
U.RoleandU.Methodare never parts (A.15). AU.MethodDescriptionis an Episteme and may be versioned/structured; that does not make the describedU.Methoda part. - MemberOf stays, but constructive aggregation and agency live elsewhere.
MemberOfremains 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 ythen0 < μ(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)andx ⊔ 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
PhaseOfon 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.
CT2R‑LOG & Compose‑CAL handshake (normative link)
- 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)
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)
Conformance Checklist & type guards (normative)
Global firewall and scope
PortionOf guards
PhaseOf guards
Anchoring & validation (normative)
Note. Property names and trace semantics are defined in the CT2R‑LOG / Compose‑CAL.
CT2R‑LOG handshake (Working‑Model → Assurance)
CT2R‑LOG handshake (Working‑Model → Assurance)
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).
Interplay with Γ‑flavours (how these relations behave under aggregation)
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
- 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.
- Does every PortionOf have a declared μ and unit?
- Do phases cover a lifetime without overlap for the same aspect?
- Are any roles/recipes appearing as parts? If yes, stop and refactor.
Patch map (where to touch in the working file)
-
Kernel - Holonic Mereology (§ A.1 → A.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).
-
A.15 (Role–Method–Work) Cross‑link firewall (CC‑A14‑0/0b) and reinforce that versioning uses PhaseOf only on MethodDescription/Work.
-
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.
-
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 enactment-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 applies, 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 admission of the claim.
Working enactment-alignment spine. Role, method, plan, and work confusion -> separate role, holder, bounded context, method description, intended U.WorkPlan, and actual U.Work -> choose proceed, plan, bounded probe, narrow, apply the direct governing pattern for any non-A.15 claim, 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 application moves.
- Name the role, holder, and context distinction under repair.
- Name the method or method description that is meant to govern the work.
- Name the intended
U.WorkPlanor actualU.Workoccurrence being claimed. - 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 or effect being made, or stop.
- If an encountered source candidate or display is being used by appearance for a work claim, reliance claim, or source-restoration claim, apply
A.15.4 Work-Relevant Source Restorationto that source-restoration claim; keepA.15only for theU.Role,U.Method,U.MethodDescription,U.WorkPlan, andU.Workseparation.
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 ready condition. If the required project-side FPF kind and reference named by value is present and its scope and window match the role, method, plan, or work move under repair, 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 missing-source admission 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. Use the fuller alignment frame when an encountered source candidate or display 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 that source candidate exposes 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.
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 role-method-work question under repair (A.6 or A.6.B), or work-relevant source restoration for an encountered source candidate or display (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 source cue 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 an encountered source candidate or display 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.
Use boundary. Use A.15 when the current project question needs role-method-work alignment. If the current claim is one single work occurrence, source-restoration note, wording repair, assurance claim, or source-side "process" label, use the governing pattern for that claim and keep only the A.15 separation that remains needed.
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 FPF object under repair 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. It applies the Strict Distinction Principle (A.7) to the passage from intended work to planned and actual U.Work, without making A.15 the whole strict-distinction ontology. It weaves together current governing relations into a single, coherent model:
- A.2 and A.2.1: Provide
U.Rolevalues andU.RoleAssignmentas the typed work-facing assignment relation with holder, role, bounded-context, window, and justification slots governed through A.6.5-style slot discipline. - A.15.2 and A.15.1: Separate
U.WorkPlanintent windows from datedU.Workoccurrences. - A.3.1 and A.3.2: Separate
U.MethodfromU.MethodDescription, so recipes, algorithms, procedures, and source-side "process" cues do not become performed work by word choice. - A.3.4: Provides
U.Transformationfor bounded change under conditions when the actual change, affected entity, pre/post state, mechanism, method, or work relation is current. - A.10, C.2.1, and E.17: Keep evidence, source, publication, and carrier relations outside the work-facing role assignment unless a system or acting holon is actually assigned a role for performed work.
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", "activity", and "schedule" are handled by E.10 and E.10.ARCH: recover the project concern first, then assign the source cue to U.Method, U.MethodDescription, U.WorkPlan, U.Work, or another direct governing pattern.
Terminology note. The words action and activity are not normative kernel names by themselves. When a generic "doing" cue appears, recover the FPF kind being claimed: U.Method, U.MethodDescription, U.Work, U.WorkPlan, or a neighboring governed value such as U.Transformation, U.Dynamics, evidence, gate, source, or publication use.
Problem
Without this formal framework, models suffer from a cascade of category errors:
- 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. - 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. - 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. - 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.
- 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. Repair generic doing or activity terms through
E.10andE.10.ARCHtoU.Method,U.MethodDescription(recipe),U.WorkPlan(schedule),U.Work(run), or another direct governing pattern.
Forces
Solution
Method and work governing-pattern cue.
When a source-side "process", "algorithm", "solver", "workflow", "procedure", or similar label points to changing, producing, selecting, deriving, controlling, or maintaining an EntityOfConcern, use E.10.ARCH:3.1 to recover the project concern first and then assign separately governed typed values. A.15 carries only the alignment among role, method, method-description, work-plan, and performed-work references. Formal substrate, mathematical-lens use, mechanism declaration or realization, evidence, gate, source, result, publication, and temporal claims are governed by their own patterns.
When methods are related to one another, A.15 keeps only the alignment use of that relation. The method-side object is MethodRelationStructure@BoundedContext under A.3.1, A.3.2, G.5, or a direct method-composition pattern when current. A method algebra, workflow graph, process calculus, matrix, category, embedding, or neural representation is a lens or method description over that structure, not a role relation, work plan, dated work occurrence, or assignment relation.
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 expected contribution or responsibility in a bounded context; it is not the holder, method, capability, work plan, or work occurrence.U.Method: The abstract way-of-doing inside a context (paradigm-agnostic; may be imperative, functional, logical, or hybrid).U.MethodDescription: AU.Epistemedescribing aU.Method; it may be expressed in an SOP, algorithm, proof, recipe, or other method-description publication.U.Capability: An attribute of aU.Systemthat represents its ability to enact the declaredU.Methodunder stated conditions. AMethodDescriptionmay describe that method; the capability is not the description and not the work occurrence.U.WorkPlan: AnU.Epistemedeclaring intendedU.Workoccurrences (windows, dependencies, intended performers as role kinds, budgets) - see A.15.2.
B) The Bridge Entity:
U.RoleAssignment: The typed work-facing assignment relation that links a holder system or acting holon, aU.Role, aU.BoundedContext, any current window, and justification or source references when they matter.
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 aU.Methodby aHolderacting under aU.RoleAssignment; capability checks are evaluated at run time against the holder, andmethodDescriptionRefnames the source episteme used to identify or constrain the method when that source is being used for the work claim. 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.Systemor 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). TheprimaryTargetdisambiguates enactment: what is being acted upon. Example: an approval iskind=Communicative,primaryTarget = Commitment(change=4711). A deployment iskind=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.
ChefRoleis 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 a holder assigned toChefRoleneeds the capability to follow the recipes in the cookbook before the relevant cooking work is admitted. - 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 precise, normative relations that form a traceable alignment chain. The following diagram illustrates the relation chain from bounded context and method description to dated work occurrence.
bindsCapability(Role, Capability): AU.BoundedContextasserts that a givenRolerequires a specificCapability. This is adesign-timerule.isDescribedBy(Method, MethodDescription): AU.Methodis formally described by one or moreMethodDescriptions. This links the abstract way-of-doing to the method-description episteme and to the publication used when that source is being used for the method claim.enactsMethod(Work, Method): A specificU.Workis a run-time enactment of aU.Methodunder aU.RoleAssignment. Capability checks are evaluated against the holder at run time; theMethodDescriptionremains the source episteme or method-description reference used to identify, constrain, or justify the method when that source is being used for the work claim.performedBy(Work, RoleAssignment): AU.Workis performed by the holder named through a specificU.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 relation whose holder, role, bounded-context, and current-window slots make the work-facing assignment explicit.
Bounded specialization scouting and CheckpointReturn
When one human-plus-AI pair faces a new task family or candidate solution family, 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 declares one outcome criterion first, enumerates heterogeneous candidate approaches that may satisfy that target, spends a bounded scouting budget or probing budget before any committed approach is chosen, and returns 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 carries:
- 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, apply the direct governing pattern for a non-A.15 claim, 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/provenance relation, 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 limits, and evidence/provenance relation 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-assignment currentness claim, 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 recovers the project-side FPF kind and reference named by value before the encountered source candidate or display can carry the work claim, reliance claim, or effect claim being made; 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 an E.18.1 P2W carry-through structure recoverable may help the team plan work or find the needed 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.
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 used to identify or constrain the method, 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 procedure 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 an E.18.1 P2W carry-through structure 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, andU.Workdistinct, and let onlyU.Workcarry 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 context-bound assignment and ability values, 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.RoleAssignmentandU.MethodDescriptionto datedU.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, andU.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, check the following predicates.
Common Anti-Patterns and How to Avoid Them
- Role-as-part. Do not place
U.RoleorU.Capabilityinside structuralpartOfdecomposition; keep role as contextual assignment value and capability as ability value under stated conditions. - Recipe-as-evidence. A
U.MethodDescriptionor SOP may identify or constrain a method; datedU.Workrecords carry the occurrence claim. - Plan-as-actual. Do not let schedules, calendars, or intended assignments stand in for actual execution; use
U.WorkPlanfor intent andU.Workfor 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 permit; model them as communicative
U.Workwhen 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, orU.Work. - Briefing-as-execution-cue. A lighter review note, rollout summary, or redacted operations note may orient work; use
A.15.4or 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, and keep the
E.18.1carry-through structure separate from those typed values. - Source candidate or display 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.4recovers the project-side kind and reference named by value needed for the work or reliance claim under repair.
Consequences
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 asU.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
processas a new FPF object; it maps the useful local use toU.Method,U.MethodDescription,U.WorkPlan, and datedU.Work. TheU.Workentity can be seen as an occurrence recognized by such a source tradition, but FPF adds the crucial context of theRole,Capability, enactedU.Method, andMethodDescriptionsource that make the occurrence inspectable. - Pragmatism and Practice: The framework is deeply pragmatic. The distinctions it makes (e.g., between a
MethodDescriptionandU.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 downstream resource accounting, decision, constraint, gate, evidence, assurance, ethics, and transformation patterns without letting any one of those neighboring claims collapse into A.15.
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 welding robot or peer-review assignee 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.
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 role, method, plan, and work portion 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 applies:
A.7 Strict Distinctionfor the role, method, method-description, plan, and work split. - Builds upon:
A.2forU.Role,A.2.1forU.RoleAssignment,A.2.2forU.Capability,A.2.5for role-state admission,A.2.7for role relation structure,A.6.5for slot-relation discipline used by assignment and relation declarations,A.3.1forU.Method,A.3.2forU.MethodDescription,A.3.3forU.Dynamics,A.3.4forU.Transformation,A.15.1forU.Work,A.15.2forU.WorkPlan, andA.15.3for slot-filling plan items. - Coordinates with:
A.15.4for work-relevant source restoration;E.10andE.10.ARCHfor source cue recovery around process, workflow, activity, schedule, algorithm, solver, and procedure wording;A.6,A.6.B, andA.6.Cfor mixed boundary, policy, API, schema, agreement-like, or promise wording;A.10for evidence, currentness, and provenance;B.3for assurance claims;A.21forOperationalGate(profile),GateDecision, andDecisionLogRef;A.20forConstraintValiditystatus or witness;C.28for causal-use admissibility;C.29for mathematical-lens use;E.18.1for P2W carry-through; andE.17.EFPfor generated-explanation faithfulness or source-finding. - Used by: patterns that need to keep systems or acting holons with role assignments, method descriptions, work plans, work occurrences, result records, and source-restoration claims distinct. A.15 is not a generic process ontology, workflow engine, evidence graph, gate pattern, or publication pattern.
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.
Application moves:
- Name the role, method, and work result before naming any distributed state.
- State which work traces, records, events, observations, reports, metrics,
U.Workoccurrences, orRoleEnactmentFactrecords make the coordination visible. - Ask whether role-method-work alignment alone explains the case. If yes, stay in A.15.
- 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.2low-recoverability distributed-state reading. - State the weakest evidence-bound state-reading claim, time window, rival explanations, and export loss.
- Carry evidence use through
A.10and assurance claims throughB.3when 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:
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.10evidence path orB.3assurance 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.29only for the fit of that mathematical diagnostic or method-selection reason. The next concrete object remains under the A.15 family:ChoiceResultor local choice record when a choice is made, selected method or method-family selection when the method-governance claim is being made,U.WorkPlanfor a plan, performedU.Workand work-result record for execution, and anA.15.4source-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 a P2W use under E.18.1 produces a WorkPlanning relation, 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 relation under repair. If the relation under repair 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 those claims are being made.
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 the role-assignment claim is being made, 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 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 remaining 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 current claim is a performed occurrence: a dated, resource-consuming occurrence enacted by a holder under U.RoleAssignment, inside a U.BoundedContext, with method, time window, parameter bindings, resources, affected referent, result, and evidence relations kept inspectable.
Use this when. Use this pattern when a plan, method description, schedule, log, telemetry stream, dashboard, approval-looking cue, publication face, result statement, or evidence-provenance relation is being treated as if it were performed work. U.Work is the occurrence; surrounding records may identify, constrain, evidence, schedule, publish, 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 current, executedWithin, time window, concrete parameter bindings, affected referent, resource ledger, pre-state and post-state references or a declared delta predicate, outcome, and the governing U.BoundedContext.
First-use checks.
- Name the candidate occurrence and the work-facing claim that depends on it.
- Recover the
U.RoleAssignment, enactedU.Method, method-description source, time window, system or subsystem accountable for the occurrence, affected referent, parameters, resources, outcome, and evidence relation when current. - Decide whether the encountered record, trace, or source candidate or display is performed
U.Work, only a plan (A.15.2), only a method (A.3.1), only a method description (A.3.2), only evidence for work (A.10), only a publication-use relation (E.17), only a declarative representation (C.2.P.DRor the direct representation pattern), or a work-relevant source-restoration case (A.15.4). - For composite, repeated, interrupted, or overlapping occurrences, declare the work-part relation and aggregation policy before using totals or identity claims.
- If the required occurrence references cannot be recovered, lower the claim to a source-gap note, work-evidence note, plan note, publication-use note, declarative-representation note, or source-restoration request; do not backdate work.
Ordinary use. For a simple occurrence, one compact work card with performer, method, time window, affected referent, resources, and outcome is enough.
Reliance-bearing use. Use the full record when cost, quality, audit, evidence, conformance, gate, release, result measurement, cross-context reuse, or aggregation claims depend on the work occurrence.
Stop condition. Stop once the occurrence is either recoverable as U.Work at the needed granularity or lowered to a neighboring relation that no longer claims performed work.
What goes wrong if missed. Teams count plans, method descriptions, approval-looking cues, dashboards, telemetry, or evidence records as if work already happened, then attach cost, responsibility, quality, or result claims to the wrong EntityOfConcern.
What this buys. One dated occurrence record that keeps performer, role assignment, enacted method, method-description source, time window, affected referent, resources, outcome, evidence relation, and repair boundary inspectable.
Not this pattern when. Not this pattern when the current claim is only a method (A.3.1), only a method description (A.3.2), only a plan or schedule (A.15.2), only a SlotFillingsPlanItem (A.15.3), only a visible source cue that needs source restoration before reliance (A.15.4), only evidence or assurance (A.10 or B.3), only publication-use behavior (E.17), or only a declarative representation overread as a work-control or method claim (C.2.P.DR or the direct representation pattern).
Problem Frame
After we have separated who is assigned (via U.RoleAssignment), what capability is being relied on (via U.Capability), and how in principle the work is done (via U.Method or U.MethodDescription), we still need a precise concept for what happened as performed work 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, naming the domain referent changed by the occurrence (asset, product, or dataset) - not merely the manipulation of records about that referent. Managers care about Work because cost, time, defects, and result evidence are booked on performed occurrences. Architects care because Work ties plans and method descriptions to accountable performed work.
Problem (what breaks without a clean notion of Work)
- Plan and run confusion. Schedules and diagrams get mistaken for performed work, so audits and KPIs attach to plans or representations instead of dated occurrences.
- Method-description and work conflation. A method description, code artifact, or SOP is reported as if it were performed work; conversely, logs are treated as recipes.
- Who and when leakage. People and calendars are baked into method descriptions; reuse and staffing agility collapse.
- Resource dishonesty. Energy, money, and tool wear are booked to methods or roles, not to performed work occurrences; costing and sustainability measures drift.
- 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)
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 current, methodDescriptionRef names the U.MethodDescription used to identify, constrain, or justify the enacted method.
When the current claim needs a formal state-change witness, represent the occurrence through a morphism Δ on a declared state-plane (StatePlaneRef), mapping pre-state plus inputs to post-state plus outputs for one or more affected referents. The work itself remains the dated occurrence; the morphism is the selected mathematical-lens expression for its delta claim.
Memory aid: Work = “how it went this time” (dated, resourced, accountable).
Core reference descriptors (conceptual descriptors; not a data schema)
When you describe a Work instance in a review, answer these prompts:
- Window — start and end timestamps and, where relevant, location or asset.
- Method-description source —
methodDescriptionRef -> U.MethodDescriptionwhen the description source is current; edition pinned when reliance depends on edition. - Performer —
performedBy → U.RoleAssignment(whose holder slot, role value, and bounded-context slot admit the performer). - Parameters — concrete values bound for this run (from the MethodDescription parameter declarations).
- Inputs and outputs — materials, information, or product states used or produced by the Work; service delivery is judged through the Outcome row.
- Resources — energy, materials, machine time, money (the only place we book them).
- Outcome — success and failure classes, quality measures, acceptance verdicts (map-then-compare per ComparatorSet under CG-Spec; pin editions).
- Links — predecessor, successor, and overlap relations to other Work, plus step or run nesting if part of a bigger operation.
- 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. - Effect (Δ) —
affected → {referent(s)}+ pre-state reference and post-state reference (or a declared Δ-predicate evaluated on evidence) on the declared state-plane (StatePlaneRef). - System —
executedWithin -> U.SystemorexecutedWithin -> U.SubSystem(the operational system or subsystem accountable for the occurrence; required for admitting the performed-work claim). - Evidence and telemetry references (when current) — if the run feeds G.11 refresh or QD and OEE archives, cite the telemetry, evidence, archive, and policy references declared by the governing comparison, archive, evidence, or refresh pattern; do not elevate telemetry into dominance without the governing comparison or archive policy.
Clear distinctions (the four‑slot grammar in action)
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.
Crossing visibility for work publications
When a work publication crosses design-time state, run-time 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 references 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 occurrence references (method-description source when current, 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 method-description source, 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
precedesorhappensBefore— strict partial order on Work windows.overlaps— intervals intersect but neither contains the other.containsorwithin— one Work's window contains another's.- Causal-use relation reference — if one work occurrence is claimed to explain, trigger, or cause another, keep the work-occurrence link separate from the causal-use claim governed by
C.28or another causal-use pattern named by value. 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 setSof 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 setSof 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 initiated after a failure in earlier Work; link the occurrences and put any causal attribution in the governing causal-use pattern.
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 occurrence with parts, the effect of the whole is the rules-declared composition of the effects of its parts plus any declared overheads and residuals. Composition aligns with the overlap rules used by Gamma_work, such as 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-10T0905_1142. - Method-description source:
Appendectomy_v5. - Performer:
U.RoleAssignmentwith holder slotOR_Team_A, role valueSurgicalTeamRole, bounded-context slotHospital_2025, and current-window slot covering the surgery interval. - 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. - Method-description source:
ETL_v12.bpmn. - Performer:
U.RoleAssignmentwith holder slotETL_Runtime, role valueTransformerRole, bounded-context slotDataOps_2025, and current-window slot covering the ETL run. - Parallel parts:
Extract_A‖Extract_B;Transformstarts when either completes (overlap). - Retry:
WarehouseWritefailed at 01:36; retried with batch size ↓ — new Work linked viaretryOf. - Γ_time: hull for SLA, union for cluster utilization.
- Γ_work: sum compute minutes; attribute storage input and output once at the parent.
Thermodynamic cycle (work through a state-plane trace)
- Run:
Carnot_Cycle_Run_2025-08-09T1300_1306. - Method-description source:
Carnot_Cycle_Specwith Dynamics model. - Performer:
U.RoleAssignmentwith holder slotLabRig_7, role valueTransformerRole, bounded-context slotThermoLab, and current-window slot covering the lab run. - Work identity: the occurrence is identified by the run interval plus occurrence references; the thermodynamic state-plane trace is a dynamics or geometry relation used to describe the change, not a work-control relation or ordered instruction sequence.
- Γ_time: straightforward interval; Γ_work: integrates energy exchange; no “steps” required.
Scope Declaration and Rationale
- Applicability: Use the same occurrence test for pragmatic costing, architectural accountability, teaching examples, and source or evidence questions; when the current claim is only about a description, publication, source, or evidence relation, apply the governing pattern for that claim.
- 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, directWork.performedBy = RoleAssignmentwording, and derivedRoleEnactmentFactwhen a named fact is needed, so that costing, quality, and audit rest on runs, not on plans or recipes.
Conformance Checklist (admission checks)
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).
A conforming U.Work claim names:
(a) enactsMethod -> U.Method (the method enacted),
(b) methodDescriptionRef -> U.MethodDescription when the source episteme or editioned method description is current,
(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).
A conforming U.Work claim carries 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 reference and judgement).
A U.Work claim is judged inside a declared U.BoundedContext (the judgement context).
- By default, the judgement context is the context of the referenced method-description source.
- If
performedByreferences aU.RoleAssignmentin a different context, cross-context acceptance needs an explicit bridge relation or policy. Otherwise the work claim is not admitted in that context.
CC-A15.1-4b (State-plane reference).
The work claim names the StatePlaneRef used for its delta judgement.
CC-A15.1-5 (RoleAssignment interval coverage).
The performedBy U.RoleAssignment timespan covers the work interval. If it does not, lower the claim to a non-admitted role-assignment relation for that context or re-judge it in a context that admits retroactive assignments.
CC-A15.1-6 (Parameter binding).
Parameters declared by the U.MethodDescription have concrete values bound at work creation or start and recorded with the work occurrence. Defaults in the method description do not by themselves admit the performed-work claim.
CC-A15.1-7 (Capability check).
Capability thresholds stated by the U.Method or U.MethodDescription are checked against the holder in performedBy for the performed-work interval or declared checkpoints. Violations are recorded on the work outcome.
CC-A15.1-8 (Acceptance criteria).
Success and failure classes and quality grades are determined by the acceptance criteria declared or referenced by the U.MethodDescription or comparator specification in the judgement context. The verdict is recorded on the work occurrence.
CC-A15.1-9 (Resource honesty).
Performed consumptions and costs (energy, materials, machine-time, money, tool wear) are booked to U.Work, not to U.Method, U.MethodDescription, U.Role, or U.Capability. Estimates belong in method descriptions or plans; performed values belong in work occurrences.
CC-A15.1-10 (Mereology declared). When a work occurrence has parts, the selected part relation is declared: temporal-part, episode-part, operational-part, or concurrent-part. Ambiguous mixtures lower aggregation and identity claims.
CC-A15.1-11 (Temporal coverage selection). For a roll-up, the judgement context declares which temporal coverage operator applies: union for utilization or convex hull for lead time. Silent mixing lowers the KPI or comparison claim.
CC-A15.1-12 (Resource aggregation). Aggregation of resource ledgers across work parts names an overlap policy, such as attributing shared machine-time to the parent only, before totals are used.
CC-A15.1-13 (Identity and retries).
A retry is a new U.Work occurrence linked via retryOf. Interruptions treated as the same run are represented as episodes (resumptionOf) under a context-declared episode policy.
CC-A15.1-14 (Concurrency and ordering).
Overlaps and precedences among work occurrences use interval relations (overlaps, precedes, contains, or within). Implicit "step order" claims are not admitted as performed-work evidence.
CC-A15.1-15 (Cross-context evidence). If a work occurrence is accepted in multiple contexts, either re-judge it in each context or provide bridge relations that map acceptance criteria, units, and role-assignment relations. Name identity alone does not carry cross-context acceptance.
CC-A15.1-16 (Method-description source changes during work). If the method-description version changes mid-run, split the work into episodes bound to respective method-description source editions, or record an explicit method-description override event in the judgement context. Silent substitution lowers the work claim.
CC-A15.1-17 (Distributed performers).
If multiple U.RoleAssignment values jointly perform the same top-level work occurrence, either designate a lead U.RoleAssignment with concurrent parts, or model the top-level occurrence as a parent work with child work occurrences per U.RoleAssignment.
CC-A15.1-18 (Logs are evidence, not work by themselves). Logs and telemetry evidence a work occurrence only after they are bound to method-description source when current, performer, time window, affected referent, and judgement context.
CC-A15.1-19 (Affected referent).
Each U.Work claim names at least one affected referent, such as asset, product, batch, dataset, or document, through affected -> {...}.
CC-A15.1-20 (State-change witness).
Each U.Work claim carries either explicit pre-state and post-state references on the declared state-plane or a delta predicate evaluable on evidence. A no-op run is flagged as such.
CC-A15.1-21 (Affected-referent declaration vs. record handling).
A run whose only effect is copying or reformatting records qualifies as U.Work only when the judgement context declares those records to be the product referent, such as data-product manufacture.
CC-A15.1-22 (Executed-within declaration).
Each U.Work claim names executedWithin -> U.System or executedWithin -> U.SubSystem; when that system differs from the asset of change, keep affected explicit.
CC-A15.1-23 (Compositionality of delta).
For composite work, the parent effect is the declared composition of child effects under the same overlap policy as Gamma_work.
CC-A15.1-24 (No new claims on publication views).
MVPK views for U.Work project the declared work-occurrence claim; they do not add properties or claims. Numeric or comparable content names unit, scale, reference-plane, and EditionId pins; work-publication views do not use "signature" for these publication pins.
CC-A15.1-25 (No Gamma leakage). Publication views reference Gamma operators and policies by id when showing aggregates. They do not encode aggregation semantics in prose or imply defaults. Gamma lives in Part B; views carry pinned references only.
CC-A15.1-26 (No input-output re-listing). Publication views do not restate method-description input and output lists; they publish presence pins and source references only under the publication-use pattern governing that view.
CC-A15.1-27 (Comparator ordering and return sets).
Across-run comparison presented on a U.Work publication view uses a declared ComparatorSet (map-then-compare), returns sets when order is partial, and lowers hidden scalarization or ordinal-mean claims.
CC-A15.1-28 (Comparator and transport pins).
Numeric or comparable acceptance or KPI claims on a U.Work publication view pin ComparatorSet.edition, comparator-spec edition, and, where conversions occur, TransportRegistry.edition with the selected transport policy ids. Bridge ids carry cross-context or cross-plane reuse; penalties affect the reliability relation only.
CC-A15.1-29 (Telemetry-reference pins, when applicable). If a work occurrence feeds G.11 or QD and OEE portfolios, the evidence relation cites the telemetry, archive, and policy references declared by the governing comparison, archive, evidence, or refresh pattern. Illumination remains report-only telemetry unless a governing comparison, archive, or selection pattern promotes that use.
Temporal & Aggregation Semantics (normative operators & invariants)
Temporal coverage Γ_time
-
Input: a finite set
Sof 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 ⊆ Tthen coverage(S) ⊆ coverage(T) (for union) or hull(S) ⊆ hull(T) (for hull)
- Idempotent:
-
Usage guidance:
- Use union for utilization and availability (how much clock time the asset was 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
Sof 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 follow the declared policy (e.g., count once at parent).
- Traceability: each aggregated figure is 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:
-
Method-description context check. Does
methodDescriptionRefrefer to a MethodDescription defined in the judgement context, or bridged to it, when that source is current?- If no, the Work is out‑of‑context; either change context or add a Bridge.
-
RoleAssignment interval and context check. Does
performedBycover the work interval in the same context, or is it bridged?- If no, the Work is unassigned for that context; remedy via a covering
U.RoleAssignmentor a policy exception.
- If no, the Work is unassigned for that context; remedy via a covering
-
Standard-Outcome Check. Do the Work inputs, outputs, and metrics satisfy the acceptance criteria from the method-description source or declared standard 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 performed run." Dumping telemetry without occurrence references (method-description source when current, performer, time window, affected referent, context) -> Not Work. Create a work-occurrence record and 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.WorkPlanor the relevant operations pattern. - Silent cross‑context acceptance. “Ops accepted it, so audit accepts it.” → Add a Bridge or re‑judge in audit context.
- Method-description edition drift in mid-run. Swapping SOP v5->v6 without recording -> split into episodes or record method-description override.
- Budget on the method. Charging costs to Method or Role -> Book only to Work; keep estimates in method descriptions or plans.
- 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
Γ_timepolicy per KPI. - Double‑count in overlaps. Summing child and parent resource ledgers → Declare and apply an overlap policy.
Existing work-log repair moves
- Backfill links. For existing logs, create work-occurrence records and attach
enactsMethod,methodDescriptionRefwhen current, andperformedBy. - Name the context. Pick the judgement context explicitly; add Bridges if multiple contexts accept.
- Record the episode policy. Decide when an interruption keeps identity or forces a new run.
- Choose Γ_time per KPI. Put "union" or "hull" in the KPI definition so disputes expose the coverage policy instead of hiding it.
- Set an overlap policy. Write one sentence on how shared costs are allocated; apply consistently.
- Pull plans out. Move calendars to
U.WorkPlan; let Work record performed values. - Parameter blocks. Make parameters explicit and bind them at start; root-cause analyses become easier.
Consequences
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 current, time window, affected referent, resources, outcome, and evidence-provenance relation. Historical occurrence modeling is used as lineage only when a current standard or current practice still needs the same distinction.
Relations
- Builds on: A.1 Holonic Foundation; A.1.1
U.BoundedContext; U.System; A.2U.Role; A.2.1U.RoleAssignment; A.2.2U.Capability; A.3.1U.Method; A.3.2U.MethodDescription. - Coordinates with: A.15 Role-Method-Work Alignment (the "four-slot grammar"); B.1 Gamma (aggregation) for resource and time operators;
E.10andE.10.ARCHfor source cues such as process, workflow, activity, schedule, algorithm, solver, and procedure;A.10,B.3,E.17, andA.15.4when evidence, assurance, publication-use, or source-restoration claims are being made. - Informs: reporting and KPI patterns; assurance and evidence patterns (Work as the reference occurrence for audits); scheduling patterns (
U.WorkPlan->U.Workdeltas).
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 (covering
U.RoleAssignment), Standard (acceptance criteria). - Roll‑ups:
Γ_time = union(utilization) orhull(lead time);Γ_workwith a declared overlap policy. - Episodes vs retries: same run split vs new run; write the policy.
- Resource honesty: performed values booked only to Work; estimates belong in method descriptions or plans.
P2W Performed-Work Use Relation
When E.18.1 reaches performed work, U.Work states 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 states launch values, performed values, substitutions, variance, telemetry, and result-related records; comparator, transport, PrincipleFrame, evidence, assurance, and gate claims are separate current 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 current, 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 acceptable 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 reference, pre-state reference, post-state reference, 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 current claim is intended work: horizon, planned window, 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, reservation, planning cue, or P2W preparation note is being treated as a method, method description, performed work, evidence, approval, gate result, publication cue, query-plan representation, or database query-optimizer representation. U.WorkPlan is an episteme for intended U.Work; it can coordinate action, but it does not make work happen.
First output. One plan record or PlanItem naming horizon, cadence, target U.Method, method-description source when current, 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.
First-use checks.
- Name the intended work occurrence or work family that needs planning.
- Recover target method, method-description source when current, planned window, role requirements, planned resources, dependencies, acceptance targets, baseline, and context.
- Decide whether the encountered record, cue, or plan element is a
U.WorkPlan, a method description, performedU.Work, aSlotFillingsPlanItem, evidence, gate claim, source-restoration case, publication-use cue, or declarative representation. - Declare
PlanItemdecomposition, dependency relation, and planned-baseline policy before using the plan for coordination or variance. - When work occurs, connect the
U.Workrecord back to thePlanItemand record variance rather than rewriting the plan as if it had happened.
Ordinary use. For simple coordination, a compact PlanItem with intended method, window, role requirement, resource budget, dependency, acceptance target, and baseline is enough.
Reliance-bearing use. Use the fuller WorkPlan record when cross-role coordination, budget reservation, delivery commitment, gate preparation, audit expectation, cross-context acceptance, release preparation, evidence-reference notes, source-currentness requests, or P2W carry-through depends on the plan.
Stop condition. Stop once the intended work is coordinated at the needed granularity or the encountered record, cue, or plan element is assigned to method, method description, performed work, evidence, gate, publication-use, declarative-representation, or source-restoration use without claiming to be a plan.
What goes wrong if missed. Teams treat calendars, tickets, reservations, or rollout notes as if work already happened, or treat a plan as method, evidence, gate result, approval, or publication authority.
What this buys. One intended-work record that keeps horizon, window, intended role requirements, constraints, budgets, dependencies, acceptance targets, baseline, and subsequent variance against performed U.Work inspectable.
Not this pattern when. Not this pattern when the current claim is a dated performed work occurrence (A.15.1), a SlotFillingsPlanItem (A.15.3), a visible source cue needing work-relevant restoration (A.15.4), a method (A.3.1), a method description (A.3.2), evidence or assurance (A.10 or B.3), a gate or constraint decision (A.20 or A.21), publication-use behavior (E.17), or a declarative representation overread as a work-control or method claim (C.2.P.DR).
Context (plain‑language motivation)
Operations happen in time. Even with perfect roles, abilities, and methods, nothing ships unless teams decide when and by whom concrete runs are intended to 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 performed work occurrence (that is
U.Work), or - the state laws (that is
U.Dynamics).
U.WorkPlan is that missing intended-work record.
Problem (what breaks without WorkPlan)
- “Workflow = schedule” conflation. Flowcharts or code are used as calendars; resource clashes and SLA misses follow.
- Plan and run blur. Gantt bars or Kanban tickets are reported as if the work already happened; audits and costing degrade.
- Specification and time leakage. People and calendars creep into MethodDescriptions; reuse and staffing agility collapse.
- No variance model. Without planned baselines, deviations in time, cost, and quality cannot be explained or improved.
- Structure entanglement. BoM and org charts get baked into “process” views; plans become brittle and unmaintainable.
Forces (what the definition balances)
Solution - U.WorkPlan as the time-bound intention for U.Work
Definition
U.WorkPlan is an U.Episteme that declares intended U.Work occurrences over a horizon, with planned windows, dependencies, intended performer requirements as U.Role values 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.
PlanItem values (what a WorkPlan is made of)
A U.WorkPlan contains PlanItem values (think: scheduled tasks or operations), each of which typically states:
- Target Method and specification — the Method to be enacted and the MethodDescription intended for enactment.
- Planned window — e.g., earliest start and latest finish, timebox, recurrence (cron-like), blackout periods.
- Role requirements — required
U.Rolevalues, not people; optional proposedU.RoleAssignments if pre-assignment is admitted in the context. - Capability thresholds — minimal abilities required of the performer, checked for the performed-work interval.
- Resource budgets and reservations — planned energy, materials, machine windows, money, and reservations on assets.
- Dependencies — precedence, overlap permissions, required gate references, and required approval references.
- Acceptance targets — quality windows and SLA targets to be judged when Work completes.
- Location and asset constraints — where the run is expected to take place.
- 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 for schedule, process, and workflow wording
Schedule-word guard. Schedule-like words do not determine the kind by themselves. Use
U.WorkPlanonly when intended work, horizon or window, role constraints, resource constraints, dependencies, acceptance target, and baseline are current; otherwise recover method, method description, work, evidence, gate, publication-use, or declarative-representation claims separately.
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
PlanItemvalues for coordination (phases, sprints, shifts), with precedence and resource reservations.
Common relations among PlanItem values:
Precedes_plorDependsOn_pl— start and finish constraints and gates.MayOverlap_plorMutuallyExclusive_pl— allowed overlaps versus exclusive windows.Refines_pl— a childPlanItemtightens windows and budgets of a parent.Alternative_pl— planned alternatives (e.g., backup rig, backup team).
Didactic rule: A PlanItem does not force an identical Work shape; its relation to performed Work is via fulfilment and variance (see §6).
How WorkPlan Meets Work (Fulfilment and Variance)
When reality happens, each U.Work may:
- Fulfil a
PlanItem— linkplannedAs → PlanItem. - Partially fulfil — multiple Work instances share one
PlanItem(e.g., split run), or one Work fulfils severalPlanItemvalues (e.g., consolidated batch). - Deviate - occur with method or method-description substitution, different window, different performer, or policy exception.
- Be unplanned — Work with no
PlanItem(emergency or ad hoc); record it as unplanned when that relation matters for variance, audit, or improvement.
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):
- Horizon & cadence (e.g., “W36 surgeries, daily ETL”).
PlanItemvalues with: target Method and MethodDescription, planned windows, dependencies.- Role requirements (
U.Rolevalues) and intended assignments (optional, context-admitted). - Capability thresholds and safety envelopes.
- Resource budgets and reservations on assets.
- Acceptance targets (SLA and quality windows).
- Bridges if plan spans multiple contexts (operations, audit, or regulatory).
- Baseline and version plus change notes (so variance is attributable).
- Policy pointers (episode policy, overlap policy for Work roll‑ups if needed for KPIs).
- Exception relation (how ad hoc or emergency work is related back to planning, if that relation is needed).
Archetypal grounding (parallel domains)
Hospital OR day plan (shift rota + cases)
- WorkPlan:
OR_DayPlan_2025‑08‑12. PlanItemvalues:Case_1_Appendectomy,Case_2_Hernia, with windows, context assignments, and surgeonU.Rolevalues; anesthetist intendedU.RoleAssignmentprovided.- Budgets: OR time blocks, consumables envelopes.
- Fulfilment: Each surgery Work links to its
PlanItem; variances computed (over-run time, substitutions).
Fab maintenance weekend (asset reservations)
- WorkPlan:
Fab_Maintenance_W36. PlanItemvalues:Tool_42 chamber clean,Tool_13 calibration; MutuallyExclusive_pl with production windows.- 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).
PlanItemvalues: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.
Scope Declaration and Rationale
- Applicability: Use the same intended-work test for coordination, budgeting, architecture planning, teaching examples, and source or evidence questions; when the current claim is performed work, evidence, assurance, publication-use, source restoration, or declarative representation, apply the governing pattern for that claim.
- 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
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.Workoccurrence when work happens. - Workflow-as-schedule. Do not treat a method description or flowchart as a plan; make a
U.WorkPlanonly when intended windows, constraints, role requirements, and baselines are current. - Assignment-by-plan. Do not treat an intended performer in the plan as a
U.RoleAssignmentsatisfying the governing role, holder, and bounded-context constraints for the work interval; validate assignment when the work occurrence is prepared or recorded. - 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.
- Evidence-note-as-claim. Do not treat evidence-reference notes, gate-preparation notes, or source-currentness requests as evidence, gate passage, assurance, or release permission.
Consequences
SoTA Alignment
Relations
- Builds on:
A.15Role-Method-Work Alignment,A.15.1U.Work,A.2.1U.RoleAssignment,U.Method, andU.MethodDescription. - Coordinates with:
A.15.3forSlotFillingsPlanItemvalues,A.15.4for work-relevant source restoration,A.10for evidence-provenance relations,B.3for assurance,A.20andA.21for gates and constraint decisions, andE.17for publication-use questions. - Used by: P2W carry-through when principle-to-work reasoning reaches WorkPlanning and keeps plan, performed work, evidence, gate, and result-measurement relations separate.
P2W WorkPlanning Use Relation
When E.18.1 reaches WorkPlanning, U.WorkPlan states intended work occurrences, planned windows, intended role requirements, planned constraints, resource budgets, acceptance targets, evidence-reference notes, source-currentness requests, and PlanItem values.
If the same P2W source material also makes a performed-work, launch-value, evidence, gate, result, measurement, publication-use, source-restoration, or refresh claim, write that meaning as a separate current 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 notes. 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 current.
Lowering, Repair, and Refresh Conditions
Lower a candidate U.WorkPlan claim when horizon, planned window, target method, method-description source when current, role requirement, planned constraint, resource budget, dependency, acceptance target, or baseline cannot be named at the granularity required by the next planning move. The acceptable lowered result is a planning cue, method-description note, source-gap note, source-restoration request, publication-use cue, declarative-representation note, or evidence-reference note, 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 performed work, evidence, assurance, gate passage, publication use, declarative representation, 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:
SlotFillingsPlanItemPlain-name: planned slot-fillings baseline item Short code:SFPIPattern type: Definitional WorkPlanning pattern Status: Stable Normativity: Normative unless explicitly marked informative Placement: Part A -> A.15 work family Builds on:A.15.2 U.WorkPlan,A.15.1 U.Work,A.6.5 U.RelationSlotDiscipline,E.10.D2,E.17,E.18.1, andE.20Used by: P2W work-planning slices, suite or kit planned baselines, Part G planned-baseline references, and performed-work variance records One-line purpose: name one planned baseline item that states which planned fillers are intended for which SlotKinds of one slot-bearing description before performed work occurs.
At a glance. Use SlotFillingsPlanItem when a U.WorkPlan needs more than a date, budget, or intended method: it needs a reproducible planned baseline saying which planned fillers are intended for one slot-bearing description's SlotKinds.
Use this when. Use this pattern when a P2W or work-planning slice needs planned references, policy pins, method-description refs, edition pins, evidence-reference pins, guard-preparation refs, or crossing-policy refs to stay fixed before performed U.Work.
First output. One SlotFillingsPlanItem naming exactly one target_slot_bearing_description_ref, one bounded_context_ref, the EntityOfConcern under planning, a time selector or time rule, authoritative planned-filling rows, and any guard-preparation, evidence-reference, edition, or crossing-policy refs needed before performed work.
Working use order.
- Confirm that the current claim is a planned baseline inside a
U.WorkPlan, not the slot-bearing description itself and not performed work. - Name the target slot-bearing description and use its SlotSpecs from the governing description pattern, with A.6.5 slot discipline.
- Name the EntityOfConcern under planning and the bounded context; add a grounding holon only when the current claim needs one.
- Write planned-filling rows from SlotKind to planned filler, with ByValue or concrete RefKind mode and edition pins when reproducibility depends on them.
- Keep projections, views, evidence-reference pins, guard-preparation refs, and crossing-policy refs as secondary references. They do not add rows, create evidence, pass a gate, or finalize launch values.
Ordinary use. For a minimal baseline, use context, time selector, target slot-bearing description, EntityOfConcern ref, and planned-filling rows.
Reliance-bearing use. Use the fuller record when reproducibility, launch-guard preparation, crossing expectations, suite or kit reuse, Part G universalization, publication-view projection, or P2W carry-through depends on the baseline.
Stop condition. Stop once the planned rows are explicit enough for the work-planning 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.
What goes wrong if missed. Teams hide planned choices in mechanism prose, suite descriptions, generated cards, "latest" references, local checklists, or execution logs. Later nobody can tell what was planned, what was performed, which edition changed, or which variance belongs to performed work.
What this buys. A small planned-baseline record that lets later performed work cite the intended slot fillings and record variance without rewriting the plan after the fact.
Not this pattern when. Not this pattern when the current claim is the slot-bearing description itself (A.6.5 plus the governing description pattern), a mechanism definition (A.6.1 or E.20), a performed work occurrence (A.15.1), an ordinary work plan without slot-filling rows (A.15.2), evidence or assurance (A.10 or B.3), a gate or constraint decision (A.20 or A.21), publication-use behavior (E.17), or a declarative representation overread as work control (C.2.P.DR).
Context
A.15.2 can already say that work is planned. Some plans also need to freeze a more specific relation: "for this planned work, this slot-bearing description will use these planned fillers in these SlotKinds under this bounded context and time rule."
That extra relation is not the target description, not the mechanism, not a publication view, and not the later performed work. It is a plan item inside work planning. SlotFillingsPlanItem gives that relation a stable place.
Typical situations:
- a CHR or CG-frame plan chooses comparator specs, normalization methods, indicator policies, or guard refs before work;
- a mechanism-suite plan chooses which suite description, method-description edition, or policy ref will be used later;
- a QD or archive plan fixes descriptor and distance-definition editions before selection work;
- a refresh or parity plan cites planned refs so later performed work can record variance rather than silently changing the plan.
Problem
Without an explicit SlotFillingsPlanItem, six failures recur:
- Plan and performed-work blur. Planned fillers get treated as launch values or run-time actuals.
- Slot drift. A SlotKind's meaning changes because the target description edition changed, but the plan still reads as if it meant the old description.
- Implicit latest. Source text says "use latest" or "current best" without a time selector or pinned edition.
- View becomes authority. A card, dashboard, or generated view becomes the de facto place where planned rows live.
- Mechanism prose hides planning. Suite or mechanism text quietly carries chosen fillers even though those choices vary by plan instance.
- Variance disappears. After work happens, the plan is edited to match the performed work, erasing the gap that audit or improvement needs.
Forces
Solution
Definition
SlotFillingsPlanItem is a kind of U.WorkPlan.PlanItem whose content is one planned slot-filling baseline for one slot-bearing description in one bounded context.
It is:
- produced inside work planning;
- tied to one target description episteme that supplies SlotSpecs;
- pinned enough to replay what was planned;
- cited later by performed
U.Workwhen variance, substitutions, launch values, telemetry, or result records are written.
It is not:
- the target slot-bearing description;
- a
MechanismDefinitionRef; - a gate decision, evidence item, assurance result, publication truth, or performed-work occurrence;
- a second slot ontology beside A.6.5.
Core fields
A conforming SlotFillingsPlanItem states these fields when the corresponding claim is current:
-
Plan identity
plan_item_idkind = SlotFillingsPlanItemwork_plan_ref- optional
plan_item_edition
-
Target slot-bearing description
target_slot_bearing_description_ref- The target is a Description episteme that declares SlotSpecs, such as a suite description, kit description, method-description family, or other description governed by its own pattern.
- Do not target
MechanismDefinitionRefdirectly. If a mechanism-level baseline is needed, introduce or cite a description that exposes the slots being planned. - When the target description's SlotSpecs are edition-sensitive, the target ref is edition-pinned.
-
EntityOfConcern and context
entity_of_concern_refbounded_context_ref- optional
grounding_holon_refwhen the EntityOfConcern is not itself a holon and the current comparison or reference-plane claim needs grounding; - optional
reference_plane_refonly when the governing measurement, CHR, or comparison pattern defines that field.
-
Time selector or time rule
time_selector_refortime_rule_ref- Use this when "current", "latest", reproducibility, comparability, launch preparation, or source-currentness matters.
- When time is required, use exactly one of the two forms; both-present and both-absent baselines are nonconforming.
-
Planning scope refs
- optional
cg_frame_ref,p2w_carry_through_ref,publication_scope_ref,suite_ref, orkit_refwhen those relations are current; - these refs locate the planned baseline, but they do not add planned rows by themselves.
- optional
-
Guard-preparation refs
- optional expected guard or policy refs, such as compare-guard or launch-guard preparation refs;
- these refs name what later work or gate checks should be prepared to use;
- the PlanItem records preparation, not the guard result.
-
Evidence-reference pins
- optional concrete pin refs naming where evidence is expected to be placed or cited later;
- a pin ref is not evidence and does not create evidence sufficiency.
-
Crossing-preparation refs
- optional refs for expected cross-context or cross-plane support, such as BridgeCard refs, policy-id refs, reference-plane refs, or already-published CrossingBundle baseline refs;
- these refs state expected crossing support only;
- they are not crossing witnesses, do not embed CL/Phi/Psi tables, and do not claim that a crossing occurred.
-
Authoritative planned-filling rows
planned_fillings[], each row with:row_id;slot_kind, taken from the target description's SlotSpecs;planned_filler, written ByValue or ByRef with a concrete RefKind;- optional
edition_pin; - optional
planning_note.
- If the target SlotSpec is single-valued, there is at most one row for that SlotKind.
- If both a row and its referenced filler carry edition pins, they agree or the baseline is nonconforming.
-
Derived projections
- optional cards, views, indices, or summaries;
- each projection is derivable from
planned_fillings; - any projection that adds rows, defaults, or semantics is a publication-use or view-use error under E.17.
- Variance policy
- how later performed
U.Workcites this baseline; - how substitutions, missing fillers, extra fillers, launch values, or edition changes are recorded in the performed-work or gate relation.
Compact record form
Relation to performed work
A SlotFillingsPlanItem is not a launch-value finalization witness and not a record that work occurred.
When a performed U.Work occurrence uses the baseline, the work record cites the PlanItem edition and records launch values, performed values, substitutions, missing planned fillers, extra fillers, telemetry, outcomes, and variance under A.15.1 or the governing gate, evidence, result, or archive pattern.
Do not backfill the plan to match what happened. If the plan changed before the work, create a new PlanItem edition or new PlanItem as appropriate. If the work differed from the plan, record variance in the performed-work relation.
Relation to suites, kits, and mechanism introduction
A suite, kit, or mechanism-introduction pattern may require a planned-baseline ref. That requirement does not make the suite or mechanism text the baseline.
Use:
- the suite or kit pattern for the meaning of the suite or kit;
- A.6.5 for SlotSpec discipline inside the target description;
- A.15.3 for the plan instance that chooses planned fillers;
- A.15.1 for performed work and variance;
A.20andA.21,A.10andB.3, orE.17when gate, evidence, assurance, or publication-use claims become current.
Variants
Specialized PlanItem kinds are allowed only when the target governing pattern needs extra planned fields.
Example:
The specialization may add fields needed by that suite, but it still inherits the WorkPlanning-only boundary: no performed-work actuals, no launch-value witnesses, no gate decisions, and no publication-view semantics.
Local boundaries
Archetypal Grounding
CHR suite planned baseline
Tell. A team plans characterization work over a CG-frame using a CHR mechanism suite. The suite description declares SlotKinds for normalization method, indicator policy, comparator spec, and selector policy.
Show without A.15.3. The plan says "use the latest CG-Spec and current best comparator." Later the comparator set changes. Later audit readers cannot tell whether the work used the intended comparator or a later one.
Show with A.15.3. The SlotFillingsPlanItem targets the CHR suite description edition, names the bounded context and time selector, and writes rows:
If the later work uses ComparatorSpecRef:CG42-v4, the work record states variance or crossing witness. The PlanItem remains the planned baseline.
Archive and QD selection
Tell. A project plans to return an archive rather than one winner. Descriptor definitions and distance functions are edition-sensitive.
Show without A.15.3. The published archive card lists descriptors and distances, but the original planned descriptor edition is gone. The card becomes a mutable publication face rather than a planned-baseline relation.
Show with A.15.3. The PlanItem rows pin descriptor description refs, distance-definition refs, and time rule. The published card is a projection of those rows. If the archive generation later changes descriptors, performed work and result records cite the baseline and state the variance.
Hardware acceptance fixture
Tell. A hardware team plans acceptance work for a fixture. The slot-bearing description is an acceptance-method description with slots for reference plane, measurement method, calibration source, and acceptance threshold.
Show with A.15.3. The planned baseline pins the reference-plane description, calibration source ref, and threshold edition. The performed acceptance work later records actual measurements and substitutions. The PlanItem does not become the measurement evidence.
Scope Declaration and Rationale
SlotFillingsPlanItem has a deliberate explicitness bias. It asks for target description, context, time, and planned rows because those are the smallest fields that keep planned slot filling separate from performed work and publication views.
The pattern does not try to make every work plan heavy. Ordinary plans stay in A.15.2. A.15.3 opens only when slot-filling choices themselves are the planned baseline that later work, gates, evidence, or publication projections will rely on.
The anti-bias guard is locality: if the current issue is mechanism meaning, evidence sufficiency, gate passage, source restoration, publication use, or performed work, use that governing pattern and bring only the returned planned-baseline relation back here.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
The pattern exists because planned slot fillings are neither generic plan text nor performed work. They are relation-bearing plan items: one target description supplies SlotKinds, the plan chooses fillers, and later work records what happened.
A.6.5 prevents a common type explosion. slot_kind, planned_filler, and RefKind fields are not new U-kinds. They are positions and fillers inside one relation-bearing PlanItem. E.17 prevents a second row source by keeping views and cards as projections. A.15.1 prevents plan backfilling by keeping performed-work actuals and variance outside the plan.
This split is especially useful in P2W and Part G work because many downstream records need the same planned baseline without copying suite semantics, mechanism definitions, gate decisions, evidence claims, or publication views into the plan.
SoTA-Echoing
Relations
- Builds upon:
A.15.2forU.WorkPlanand PlanItem discipline;A.15.1for performedU.Work;A.6.5for SlotKind, ValueKind, RefKind, and SlotSpec discipline;E.10.D2for EntityOfConcern vs Description episteme vs specification-use;E.17for publication-use and view-use projection;E.18.1for P2W carry-through;E.20for mechanism-introduction boundaries. - Coordinates with:
A.20andA.21for gates and constraint decisions;A.10,B.3, andG.6for evidence, assurance, and provenance;C.27.TAandG.11for currentness and refresh; Part G patterns when planned baselines are used by kits, packs, or refresh plans. - Does not replace: target description patterns, mechanism definitions, suite definitions, gate records, evidence relations, publication views, performed work, or source restoration.
P2W planned-baseline use relation
When E.18.1 reaches a planned-baseline question, SlotFillingsPlanItem records the planned relation between one slot-bearing description's SlotKinds and the fillers intended for a future work-planning move.
If the same source phrase also carries launch-value, performed-work, evidence, gate, result, measurement, publication-use, source-restoration, or refresh meaning, name that separate current relation before using the PlanItem 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 launch values, actual fillers, substitutions, variance, telemetry, and result-related records under A.15.1 and the current gate or evidence relation.
The work-planning record preserves what was intended. The performed-work record preserves what happened.
Lowering, repair, and refresh conditions
Lower a SlotFillingsPlanItem claim when the item cannot name exactly one target slot-bearing description, concrete SlotKinds from that description, EntityOfConcern, bounded context, time selector or time rule, authoritative planned-filling rows, concrete RefKinds for ByRef fillers, or required edition pins. The lowered result is 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 target description edition, exposed SlotKind set, planned filler, concrete RefKind, edition pin, context, time rule, evidence-reference pin, guard-preparation ref, crossing-policy ref, or expected gate relation. If performed U.Work already cited the PlanItem as a baseline, preserve the cited baseline and record variance or crossing witness in the work-governed relation.
Refresh before the PlanItem is used for performed-work preparation, 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 relation: the PlanItem, target slot-bearing description, concrete RefKind, cited source edition, performed-work variance record, or 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. Use A.15.4 when an encountered source candidate is about to guide work or reliance before the claim-carrying source has been recovered. The source candidate may be a dashboard tile, credential view, copied approval, generated explanation, provenance mark, schema wording, API wording, publication face, or composed source chain.
Use this when. Use this pattern when the acting user is ready to proceed because something looks approved, current, safe, evidenced, delegated, released, or ready, but the work claim or reliance claim still needs its governing project source named by value.
First output. One compact source-restoration note:
First move in practice. Name what the encountered source candidate may safely do now: orient the user, help find a source, allow a bounded reversible probe under U.WorkPlan, proceed inside a recovered relation, or block only the unsupported work or reliance claim.
What goes wrong if missed. A dashboard, credential view, copied approval, generated explanation, provenance mark, schema wording, API wording, publication, display, or cue starts acting as the work or reliance source relation. Work then proceeds or stops while the gate decision, evidence path, speech act, commitment, role assignment, status record, work occurrence, source episteme, or source publication that would carry the claim is missing, stale, revoked, or contradicted.
Primary EntityOfConcern in plain terms. One source-restoration relation for one work or reliance claim under repair, work-relevant P2W claim under repair, or P2W chain position under repair. The relation connects the encountered source candidate, the needed claim or effect, the source required for that claim, the next relation-governed move, and the blocked overread.
First restoration checks.
- Name the encountered source-candidate kind and publication position without treating its appearance as the source relation itself.
- Name the work or reliance claim under repair, work-relevant P2W claim under repair, or P2W chain position under repair.
- Name the claim or effect that would be carried: gate passage, release reliance, evidence relation, assurance claim, speech act, commitment, role-assignment relation, status currentness, work occurrence, source currentness, boundary claim, or another claim named by value.
- Recover the source required for that claim: the governing FPF pattern plus the reference named by value.
- Choose the lightest relation-governed disposition now: proceed inside the recovered relation, 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 it, or block only the unsupported claim or effect.
Not this pattern when. Stay in A.15 when the question under repair is only U.Role, U.Method, U.MethodDescription, U.WorkPlan, and U.Work separation. Stay in E.17 when the question under repair 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-passage claim, ConstraintValidity status, commitment, speech act, boundary claim, or work occurrence already governs the claim or effect directly.
What this buys. The acting engineer-manager can keep work moving without trusting appearances: use the source candidate for orientation or source-finding when that is all it can carry, proceed only inside the recovered relation when that relation exists, and turn repeated ambiguity into source-relation repair work rather than repeated manual reconstruction.
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 source that carries the claim is visible. The practical problem is to decide what an engineer-manager may do now without turning appearance into approval, gate passage, evidence, assurance, performed work, role-assignment currentness, status currentness, or release permission.
Plain recognition line. Let the visible cue point to a relation named by value, source episteme, source publication, evidence path, gate decision, role-assignment record, status record, work occurrence, or assurance claim. Do not let the cue become the relation that permits work or reliance.
Source wording discipline. In this pattern, source is not a generic kind. Governing source means the project-side value, named by FPF kind and reference, that carries the claim or effect under repair: source U.Episteme, source U.EpistemePublication, evidence path, gate decision, speech act, commitment, credential record, status record, role assignment, work-occurrence record, register entry, source relation, or another named project-side value. Source-finding cues, publication faces, publication carriers, renderings, dashboards, copied wording, and generated explanations remain source candidates unless they expose that governing source. If no governing source can be named, keep the encountered source candidate at cue-only orientation or source-finding use.
Cluster Boundary
A.15 remains the kernel for separating U.Role, holder and context, U.Method, U.MethodDescription, U.WorkPlan, and dated U.Work. A.15.4 starts only when an encountered source candidate begins to justify a work claim or reliance claim and the team needs to recover the source that carries that claim, effect, or relation. If the governing pattern and project-side reference 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:
encounteredSourceCandidate; work or reliance claim under repair; claim or effect needed; governing source needed; relation-governed move now; blocked overread; stop or reopen condition
The encountered source candidate 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 requested claim is currently carried by a project-side source named by value, not whether the source candidate is impressive, fluent, easy to inspect, or visually salient.
Conditional source-relation field set. Use the fuller fields below only when release, safety, compliance, role assignment, status, gate, assurance, contested source, external reliance, cross-context reuse, currentness, revocation, generated source relation, or copied source relation is being relied on for the claim under repair. These fields are local restoration aids, not a new record kind.
Start with the A.15.4 first restoration checks above when the encountered source candidate is about to guide a work move, reliance move, or work-relevant claim. If the issue under repair is only evidence, currentness, gate-passage claim, ConstraintValidity status, engineering justification, commitment, speech act, boundary wording, use-boundary wording, credential proof, source-status proof, explanation, comparison, or publication-carrier or front-end behavior, use the pattern governing that issue directly. Use A.15.4 only when source restoration is needed before role assignment, 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, performed-work evidence source, approval-claim source, approval-effect source, role-assignment-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 repair question remains: which work or reliance claim is being made, and which source is required for it?
Here "authority-looking case" is only a recognition phrase for the encountered situation. The governing source that permits, forbids, records, or carries the work-relevant claim may instead be a GateDecision, SpeechAct, U.Commitment, U.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 belongs to another governing pattern.
The central behaviour is: name the work or reliance claim under repair, work-relevant P2W claim under repair, or P2W chain position under repair; name the source that carries the needed claim or effect; keep the U.Episteme or U.EpistemePublication distinct from publication form, MVPK face, publication carrier, rendering, and source-finding cue; choose the minimum sufficient next move; and do not raise the claim beyond the recovered relation, source relation, or recovered 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 disposition. An encountered U.Episteme publication, publication form, MVPK face, publication carrier, rendering, or source-finding cue may guide work or reliance only to the claim or effect carried by the recovered source, actor or role assignment, work or reliance claim under repair, work-relevant P2W claim under repair, or P2W chain position under repair, affected work target, context, window, and source-recoverable claim or effect. The repaired outcome is the smallest relation-governed work or reliance statement plus the unsupported work claim or reliance claim still blocked.
Reliance dispositions by recovered source relation:
A small A.15.4 restoration note is enough for the first disposition:
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, publication carriers, renderings, PublicationUnit instances, and source-finding cues are separate kinds or relation positions 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, performed-work evidence remains evidence, and dated work occurrences remain A.15.1 or U.Work matters.
When the required source is incomplete, choose one relation-governed source-restoration disposition after naming the work or reliance claim under repair, work-relevant P2W claim under repair, or P2W chain position under repair and the source required for that claim or effect; pick the lightest move that preserves practical work and source recoverability:
- Use the encountered source candidate only for orientation or source-finding.
- Reopen the required source
U.Episteme, sourceU.EpistemePublication, register entry, or governing source, or refresh status or currentness. - Narrow actor and role assignment, requested operation or work class, affected work target, affected resource, affected claim, context, and effective window until the recovered source really covers the move.
- Run a bounded reversible probe under an explicit
U.WorkPlanwhen no external-impact reliance is being made. - Ask the role assignment accountable for the issuer, gate decision, evidence path, role-assignment record, status record, or boundary claim set to expose or repair the missing source.
- Repair the
U.WorkPlan,U.MethodDescription, dashboard label, source link, or boundary wording that made the overread plausible. - Proceed only inside the recovered scope and window.
- Block only the work claim or reliance claim that lacks source relation.
Repair assignment rule
Broken-source repair assignment. If the required governing source 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.
Source-candidate kind check. First name the kind of the encountered source candidate: actual U.Episteme, actual U.EpistemePublication, publication form, MVPK face, publication carrier, rendering, PublicationUnit, dashboard tile, credential view, generated wording, copied wording, or source-finding cue. If the source candidate exposes the governing source, use that exposed source directly. If only the display face, publication 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.
Governing-source lookup table
Governing sources 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, orA.6.Awhen those claims are being made. - issuing, approval, authorization, delegation, or revocation act: cite
A.2.9U.SpeechActorSpeechActRef, including act type, actor and role assignment if claimed, affected work target or claim, judgement context, window, publication-carrier reference, evidence reference when currentness matters, and instituted effects if claimed. BecauseU.SpeechAct <: U.Work, it can evidence only that communicative act. - deontic permission, obligation, prohibition, or recommendation-as-duty: cite
A.2.8U.Commitmentand the institutingSpeechActRefwhen provenance matters. If the word instead names claimed use boundary, gate passage, authorization act, role-assignment effect, status effect, credential status, cue, or advice, use the pattern that carries that kind named by value. - role-assignment or status reliance: cite
A.2.1,U.RoleAssignment, a status-changingU.SpeechAct, a governing context-state record, a credential proof or status result underA.10, or anA.21GateDecisionwhen the status is gate-governed. - boundary, policy, API, schema, "allowed", "authorized", "approved", "recommended", or "guaranteed" wording: split the statement through
A.6orA.6.B; useA.6.C,A.2.3,A.2.8, andA.2.9for agreement-like guarantee, SLA, or promise wording before work use or reliance use. - gate decision or gate passage: cite
A.21OperationalGate(profile),GateDecision,GateDecisionRationale,DecisionLogRef, gate profile, gate version, check set, scope, window, and replay or freshness pins. U.Flow.ConstraintValiditywitness: citeA.20ConstraintValiditystatus, witness,GateCheckRef.aspect = ConstraintValidity,PathIdorPathSliceIdwhen applicable, window, sentinel, and pins when those fields are needed for the claim.- release, deployment, repair, inspection, or rollback work occurrence: cite
A.15.1datedU.Workoccurrence and theA.10evidence or provenance relation when reliance on occurrence is needed. - evidence, provenance, authenticity, currentness, copied-source, or generated-source relation: apply
A.10and name the claim-bound evidence path, currentness path, and relation-governed or blocked use. - assurance, readiness, safety, compliance, trust, release confidence, or
R,F,G, orCLincrease: applyB.3and name the typed assurance claim plus its limitations and reopen condition. - generated explanation: use
E.17.EFPfor explanation faithfulness or source-finding relation, then requireA.10claim-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, claimed use boundary, gate passage, role-assignment or status change, credential status, evidence relation, assurance claim, or work occurrence.
Recovered source outputs for A.15.4 closure:
High-impact work or reliance - especially external-impact, irreversible, release-bearing, role-assignment-bearing, status-claim-bearing, gate-bearing, compliance-bearing, safety-bearing, delegated, contested, or assurance-bearing claim or effect - may guide work only for the actor and role assignment, work or reliance claim under repair, work-relevant P2W claim under repair, P2W chain position under repair, affected work target 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:
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. A claim that deployment happened still requires an A.15.1 work-occurrence source. If the gate source is missing or stale, treat the tile as orientation and source-finding until the team can name the release-work claim under repair, release-work position under repair, governing pattern for the claim or effect, and governing source for the gate decision, evidence path, and currentness path.
Approval memo green-tile case:
An approval memo may carry an approval claim when it exposes the A.2.9 SpeechActRef, actor and role assignment if claimed, affected release scope or work target, judgement context, time, window, publication-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 performed-work 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-tile case:
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 effective 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 governing source for the claim or effect.
Situation viewpoint prompts:
Search cues 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 retrieval cues only; decide the governing source and governing pattern or source relation from the work or reliance question under repair, not from the displayed word, publication-carrier name, or source name.
Work and reliance disposition table for authority-looking cases:
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, work or reliance claim under repair, work-relevant P2W claim under repair, or P2W chain position under repair, governing pattern and governing source for the claim or effect, actor and role assignment, affected work target or claim, context, window, missing or stale source U.Episteme, source U.EpistemePublication, register entry, or governing source; governing FPF relation or role assignment accountable for exposing or repairing that missing source, plausible overread, safe disposition used now, and upstream repair work for the source, dashboard, explanation, credential view, boundary wording, publication face, or publication carrier.
Contestability and redress relation: when an authority-looking case affects person or team status, access, assignment, responsibility, release blockage, compliance claim, or safety-impacting work, name the review relation or redress relation before the work claim or reliance claim hardens. The relation should name the disputed source or claim, the role assignment accountable for refreshing or correcting that source, the evidence relation or status-currentness relation to reopen, the safe interim disposition, and the time and window for review.
Lintable overread cues:
Stress cases for practice:
High-impact source-restoration slice
A lab manager sees a green tile for CRISPR-guide-G42 ready and a copied message saying the edit is approved. A.15.4 does not ask the manager to decide whether the tile is a good UI. It asks what work or reliance claim is about to be made.
Conformance Checklist
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 work or reliance claim under repair, work-relevant P2W claim under repair, or P2W chain position under repair, then recover the governing pattern and governing source for the requested claim or effect. If that source is missing, lower only the unsupported reliance.
Consequences
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 governing source is visible. The pattern protects work momentum and source recoverability together: it lets the practitioner use the encountered source candidate for orientation or bounded source-finding, while preventing the source candidate from becoming approval, evidence, assurance, gate passage, performed work, release permission, role-assignment 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-assignment, 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. Interpret 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.
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 governing source 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.4is a cluster member underA.15for work-relevant source restoration; it does not replace the A.15 role, method, plan, and work kernel. - Uses:
E.17,E.17:5.1b,E.17:5.1c, andE.17:5.1dfor source-relation, use-boundary, and neighboring-pattern publication-use vocabulary,E.17.EFPfor generated-explanation faithfulness and source-finding,A.16.0for source-transfer and publication discipline,A.6,A.6.B, andA.6.Cfor boundary, policy, API, and schema wording,A.10for evidence, currentness, provenance, and credential status,B.3for engineering justification claims,A.20forU.Flow.ConstraintValidity,A.21for gate decisions,A.2.1for role-assignment or context-state relations when they carry the source claim,A.2.8for commitments,A.2.9for speech acts, andA.15.1for datedU.Workoccurrences. - E.10.ARCH relation-selection rule: When
E.10encounters source-relation, authority, permission, approval, role, status, green-tile, generated-explanation, copied-review, credential, provenance, or dashboard wording that is about to guide work or reliance,E.10.ARCHselectsA.15.4only after excluding or assigning direct evidence (A.10), assurance (B.3), gate (A.21), constraint (A.20), boundary or use-boundary wording (A.6andA.6.B), role-assignment or context-state relation (A.2.1), speech act (A.2.9), commitment (A.2.8), work occurrence (A.15.1), and publication-face, publication-use, source-transfer, or explanation questions (E.17,A.16.0, andE.17.EFP).A.15.4records the work-relevant source-restoration relation named by value; it does not replace those governing patterns. - A.15 boundary relation: use
A.15directly 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.29only to state why the lens helps expose or bound an encountered source candidate such as generated wording, dashboard cue, copied phrase, publication form, MVPK face, publication carrier, rendering,PublicationUnit, or source-finding cue.A.15.4still governs the source candidate, source relation named by value, restoration or reopen condition, reliance relation, and whether that candidate can guide work under a recovered source relation. Method choice, plans, and performed work remain governed byA.15andA.15.1when those claims are being made; aC.29lens-use result does not turn a cue, rendering, or diagnostic phrase into source relation.
P2W Result-Related Source Boundary
When a P2W use under E.18.1 produces result wording, use this pattern only when an encountered source candidate such as 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 governing source 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-assignment enactability claim. If the governing pattern or relation is missing, use the encountered source candidate 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 work or reliance claim under repair, work-relevant P2W claim under repair, P2W chain position under repair, governing pattern, governing source, 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 governing source through the evidence, assurance, gate, constraint, speech-act, commitment, role-assignment, 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 source candidate to guide release, safety, compliance, delegated role-assignment or status, contested source, cross-context reuse, work-result reliance, external-impact reliance, or irreversible work. Stop the refresh at the smallest changed source-restoration value: encountered source candidate, source episteme, source publication, governing source, 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 Move 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
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.LanguageStateMoveTrajectory 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 language-state move family
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 namedU.EpistemePublicationform 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 language-state move: 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-1A.16MUST NOT redefineFor publish a second formality-only climb.CC-A.16-2A conforming move note MAY stand alone;A.16.0SHALL NOT be treated as mandatory wrapper syntax for every move.CC-A.16-3Every move kind SHALL name its preconditions and postconditions over explicit language-state facets, route state, or authority state.CC-A.16-4Publication form, governing pattern, and MVPK face SHALL NOT be collapsed into one unnamed target.CC-A.16-5Multi-route state inside one governed member SHALL NOT be confused with lineage fork across several successor members.CC-A.16-6respecifySHALL NOT be used to hide slot-explicit epistemic precision repair that belongs to later repair governing patterns.CC-A.16-7Retreat or retirement SHALL preserve, withdraw, or discard prior witnesses and authority explicitly.CC-A.16-8Published path structures SHOULD reuseE.18when a graph publication is needed.CC-A.16-9AuthorityStateandEndpointAdmissionProfilereuse SHALL NOT be treated as new governing patterns, new route-bearing forms, or substitutes for gate or work state.CC-A.16-10A 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, orA.15were 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
RoutedCueSetare not yet a lineage fork.
Consequences
The benefit is a clear governing pattern for language-state moves 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
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 language-state move 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 move 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.EpistemePublicationis still an early or seam publication form; - endpoint-pattern-publication-issued - a named endpoint pattern now governs the relevant
U.EpistemePublicationform 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.EpistemePublicationform 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:
- Are the source publication form and target publication form typed? If not, the move is too vague.
- Are governing pattern and face kept distinct from the form? If not, the move collapses layers.
- Is the authority effect explicit? If not, governing pattern boundaries will drift.
- Is route plurality being confused with lineage fork? If yes, the history is being misread.
- Are intermediate move publications suppressed in a way that changes the reading? If yes, the chain is over-compressed.
- Has
A.16started to impersonate a governing pattern or a trajectory wrapper? If yes, the relevant governing pattern orA.16.0threshold needs to be named explicitly.
This matrix keeps the integration layer narrow while still making its move semantics inspectable.
A.16:End
U.LanguageStateMoveTrajectory - 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 move 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:
- history is mistaken for generic one-pass process story rather than for governed move lineage over a declared language-state
U.CharacteristicSpace; - early seam publications are confused with
U.EpistemePublicationforms governed by endpoint patterns; - forks, merges, route retirement, supersession, and route-sensitive loss become implicit and unverifiable;
- every local move is either over-wrapped in ad hoc history prose or under-wrapped in a way that hides handoff and authority change;
- bridge and viewpoint docking inherit under-described upstream history.
Forces
Solution
U.LanguageStateMoveTrajectory 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.Epistemepublication 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.LanguageStateMoveTrajectory 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.LanguageStateMoveTrajectory 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.Pfor relation repair forms;A.6.Afor invitation forms;C.16.Qfor evaluative repair forms;B.5.2for later abductive work;A.15for method-facing or work-facing forms;C.25for 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 changes: 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.LanguageStateMoveTrajectory is not an E.18 path publication, and A.16.0 does not govern the semantics of language-state movement.
A.19plusC.2.2agovern the declared characteristic-space reading of positions;A.16governs move kinds and move guards;E.17/E.18govern publication-face discipline and graph publication of paths;- endpoint patterns govern endpoint-local
U.EpistemePublicationforms 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-1U.LanguageStateMoveTrajectorySHALL NOT be treated as mandatory wrapper syntax around everyA.16move.CC-A.16.0-2A language-state trajectory account SHALL identify the current governedU.Epistemepublication and SHALL NOT collapse grounds, publication forms, publication faces, carriers, and governed members into one unnamed moving thing.CC-A.16.0-3Position claims used in the trajectory SHALL be published as slot-explicit claims in the declared language-stateU.CharacteristicSpace, not as folk stage labels.CC-A.16.0-4Fork, merge, supersession, derivation, and retirement SHALL be made explicit whenever the account depends on them.CC-A.16.0-5Publication form and MVPK face SHALL NOT be collapsed, and untyped seam placeholders SHALL NOT substitute for typed publication forms.CC-A.16.0-6projectionSHALL be read as route-bounded partialization with visible loss notes and an admissible reopen path.CC-A.16.0-7Work-requiringformalizeoroperationalizesteps SHALL expose the relevant crossing or handoff rather than pretending thatU.Workoccurred inside the language layer.CC-A.16.0-8When graph publication of paths is needed, authors SHOULD reuseE.18rather than inventing a rival path calculus here.
Common Anti-Patterns and How to Avoid Them
- Meta-wrapper inflation. Treat
A.16.0as obligatory around every move. Repair by publishing a localA.16move 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, andnotice -> 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.Epistemepublication; - 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:
- Is the author really describing history over the declared language-state
U.CharacteristicSpace, or only narrating progress informally? - Is the current governed member distinct from the grounds, publication form, publication face, and carrier?
- Is this history heavy enough to justify
A.16.0, or would a localA.16move note have sufficed? - Are multi-route state and lineage fork being kept distinct?
- Are derivation, supersession, fork, merge, or retirement links visible where the reading depends on them?
- Is the current publication a seam publication or already a
U.EpistemePublicationform governed by a named endpoint pattern? - If
formalizeoroperationalizerequired 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
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:
cueNucleuspreservationRationale?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.1once route plurality or route selection deserves explicit publication;B.5.2.0after a cue-derived abductive prompt is formed;A.6.Ponly once articulation threshold and relation-like shape are met;A.16.2when 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-1A cue pack SHALL NOT be presented as a claim, characteristic, method, work occurrence, or route-decision record.CC-A.16.1-2A cue pack SHALL makecueNucleusexplicit.CC-A.16.1-3When preservation depends on privileged grounding,primaryWitnessReforprimaryAnchorSHALL be explicit.CC-A.16.1-4laneCandidatesandrouteCandidateHintsMAY be published early, butselectedRoute,routeRationale, and route authority state SHALL NOT be smuggled into the cue pack.CC-A.16.1-5If route-candidate hints are not yet nameable, publication is still admissible only whenpreservationRationaleand grounding make the preservation need explicit.CC-A.16.1-6Language-state, anchoring, and representation-factor details MAY be referenced, but their governing patterns remainC.2.LS,C.2.4,C.2.5,C.2.6, andC.2.7.CC-A.16.1-7A 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.PreArticulationCuePacka replacement forA.7carrier 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:
- What exactly is being preserved? If the nucleus is unclear, the pack is under-specified.
- 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.
- Which witness or anchor is primary? If none can be named where triage matters, the pack may be storage rather than preservation.
- 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
Solution
This pattern defines the retreat, reframing, and retirement side of the A.16 move family.
Move family
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 language-state move 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-1Retreat or retirement moves SHALL cite the trigger or counter-evidence that justifies them.CC-A.16.2-2A retreat or retirement move SHALL NOT silently preserve endpoint authority if the target form no longer supports it.CC-A.16.2-3Reopen / backoff / respecify / retire moves SHOULD preserve witnesses and trace links whenever still valid.CC-A.16.2-4The target articulation, closure, and route-authority state SHALL be explicit when the move substantively changes any of them.CC-A.16.2-5respecifySHALL 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.
respecifyis 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:
- Was the trigger explicit? If not, the retreat risks becoming retrospective narrative repair.
- 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.
- Did valid witnesses survive? If all earlier grounding disappeared without reason, the retreat probably became erasure.
- Was the move kind correctly named? Reopen, sketch-backoff, respecify, and retire solve different problems; confusing them obscures what actually changed.
- 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) orU.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.Epistemeroles: 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:
-
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”).
-
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?
-
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).
-
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.)
-
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.
-
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).
-
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.3U.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
SpaceRefonly 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
SpaceRefis 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. OutcomeMapRefis 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
OutcomeMapRefis 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:
-
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.
-
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.”
-
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).
-
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).
-
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.
-
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.
-
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).
-
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.Characteristicon 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.DHCMethodRefandU.Measurefollows 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, astateSpacein 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
First use: U.CharacteristicSpace as the EoC (normative primer)
Use A.19 when the current question is the space of characteristics itself: which characteristics are in scope, which scale is bound to each characteristic, what values are admissible, how coordinates are grouped, which optional order, topology, or metric overlays are declared, and where comparability, normalization, missingness, and evidence hooks belong.
First move: name the CharacteristicSpace, then write its basis as slot declarations. Each slot binds one U.Characteristic to one scale and value set under A.17 and A.18; optional overlays and comparability boundaries attach to the space only when declared. U.Dynamics.stateSpace points to a declared CharacteristicSpace; A.19 does not supply the dynamic law, time base, evaluation use, dashboard, score, or portfolio that consumes the space.
Core boundary: the CharacteristicSpace is the EoC here. Consumer patterns may refer to it through ...SpaceRef fields, use it for evaluation or CHR mechanisms, or publish views over it, but those consumer references, mechanism steps, publication forms, and source-set relations are not second space kinds.
Informative CHR pointer: when the question moves from the space to normalization, indicatorization, scoring, aggregation, comparison, or selection mechanisms, use the corresponding A.19.<MechId> pattern (A.19.UNM, A.19.UINDM, A.19.USCM, A.19.ULSAM, A.19.CPM, A.19.SelectorMechanism) and A.19.CHR. C.16 carries measurement and evidence backing; G.0 carries legality gates for numeric operations. A.19 may cite those patterns, but it does not govern their mechanism vocabulary.
Reader path for a CHR-enabled plan or audit, when orientation is needed:
- measurement vocabulary: use
A.17,A.18, andC.16for characteristic, scale, coordinate, unit, measure, and evidence backing; - characteristic-space object: use this pattern for the declared
CharacteristicSpace, basis slots, optional overlays, comparability boundaries, missingness, andU.Dynamics.stateSpacehook; - legality of numeric operations: use
G.0and the relevantA.19.<MechId>mechanism pattern; do not let A.19 become a second mechanism vocabulary; - suite and planning boundary: use
A.19.CHR,A.15.3, andE.18when a planned baseline, suite slot filling, or transformation-flow structure is current; - one mechanism at a time: read
A.19.UNM,A.19.UINDM,A.19.USCM,A.19.ULSAM,A.19.CPM, orA.19.SelectorMechanismonly for the mechanism claim being made; - specialization and reuse: use
E.20when a project-specific mechanism variant is introduced.
Fast review entries: for a plan, start from the A.19.CHR planned-baseline hook and A.15.3; for semantic drift, start from the canonical mechanism target and then use E.10 and F.18; for conformance, start from the A.19.CHR and relevant A.19.<MechId> checklists, then use E.19 for review protocol.
Intent & Scope (Normative)
Intent. Establish U.CharacteristicSpace as the A.19 ontic head: a declared space of characteristics, scales, value sets, value meanings, coordinate positions, coordinate groups, optional overlays, missingness semantics, comparability boundaries, normalization boundaries, and evidence hooks where those hooks are part of the space declaration. For dynamics, U.Dynamics.stateSpace points to such a space so a holon's state changes can be described as trajectories in declared coordinates. For epistemes, state remains governed by ESG; F-G-R are assurance coordinates, not an episteme state space.
The A.19 EoC is the characteristic space itself. It is not the filled evaluation, report, score table, dashboard, pattern-quality scale, DRR adequacy scale, FPF-level pillar scale, or improvement portfolio that uses the space.
Scope. Pattern A.19 defines:
-
the type
U.CharacteristicSpaceas 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 and 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: characteristic slots, scale bindings, value sets, value meanings, coordinate groups, optional order, topology, metric, or product overlays, comparability boundaries, normalization boundaries, missingness semantics, and the U.Dynamics.stateSpace typing hook. Do not use A.19 to declare consumer-side reference positions that merely point to a declared space, and do not use it to declare relation kinds between several such references.
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 consumer pattern needs search-side versus outcome-side positions over declared spaces, an explicit relation between those references, a source-set relation, or an interpretive view 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.
A.19.ECS constructs an evaluation CharacteristicSpace for an object kind under improvement. E.21, E.9.DA, E.2.DA, and other evaluation patterns consume or specialize declared spaces for their own evaluated objects. A.19 supplies the space ontology; those patterns supply object-specific evaluation use, stop conditions, and value interpretation for their users.
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 for value sets. In A.19, the set that supplies values to a slot is ValueSet(slot) or an underlying value set. Do not call that value set a publication form, symbol bearer, source, description, or persistence object.
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). In composition or projection work, teams 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” or “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 allow 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_iis aU.Characteristic(with an explicit arity, i.e. either an entity-Characteristic or a relation-Characteristic as defined in A.17), and -
Scale_iis 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 that can be used in technical notations or data structures. 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_iis 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 and 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 and 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 is done. -
A19-CS-6 (Slot meta completeness). Where applicable, each slot SHALL declare
admissible_domainand 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
CharacteristicSpacepublishes 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 preventsCharacteristicSpacefrom 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 or 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 enable particular reasoning such as dominance, continuity, or distance reasoning in models that require it. 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 requirement: the dynamic model can only produce states and trajectories of states that belong to 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 are located, 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 and 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, equality check, join, or comparability claim over a CharacteristicSpace that depends on representation choice (chart, unit, reference plane, normalization choice, or label) SHALL be evaluated on quotients by ≡_UNM or on explicitly Normalization‑fixed charts, not on raw labels.
Minimal obligations:
- 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. - 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).
- Join and 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
don 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 or KPI SHALL be isotone w.r.t. the declared product order.
Minimal obligations:
- Publish the metric (if used). If a distance overlay is used, the space MUST publish the distance function
d(including any weights and parameters) and its declared domain of applicability. - Bound expansion. Any acceptance predicate or KPI that relies on
dMUST be shown non-expansive (Lipschitz ≤ 1); otherwise an explicit expansion bound and compensating margin MUST be stated. - State error and commutation. If a metric is used together with NormalizationFix, the specification MUST state (a) the maximum tolerated measurement and calibration error and (b) whether
dcommutes 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:
-
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).
-
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.
-
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).
-
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) ofslot_ipairs. 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 belong to 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 enable 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 or 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 and admissibility obligations governed by A.19.UNM (including method-class token and validity window). If such normalization method instances or declarations are used for gating or assurance, their evidence and 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 are located 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 values, 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 or 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 mapping into 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 or 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 choice and its limitations must be explicit.
Mnemonic: “Never compare before both values are mapped into 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.
Neighboring State-Assertion Touch-Points
A.19 does not define StateAssertion, role-state certification, Green-Gate enactment, evidence records, assurance penalties, or operational data stubs. Those claims are governed by A.2.5, A.15, C.16, B.3, temporal patterns, and any certification-interface pattern that is current for the case.
A.19 contributes only the CharacteristicSpace side of such claims: the role or holon state predicate must name the CharacteristicSpace, slot basis, normalization instances, overlays, window, and bridge relation needed to make the coordinate claim inspectable. If a checklist or StateAssertion is translated across an embedding, A.19 requires that the space mapping and normalization references be declared; the validity of the assertion, the evidence window, and the permission to enact work remain neighboring claims.
Didactic state-assertion slice: a role-state claim such as "pump is Ready" is not itself a CharacteristicSpace. A.19 supplies the declared coordinates and mapping discipline: a snapshot or window over a role or holon characteristic space, slot basis, normalization instances, optional overlays, and bridge relation. A neighboring checklist, state-assertion, evidence, temporal, gate, assurance, or work pattern owns the predicate, evidence window, permission to act, and enacted work.
For example, a Ready checklist may require temperature below a declared threshold and pressure above a declared threshold for a declared window. A.19 requires those predicates to cite declared slots, scales, normalization instances, overlays, and window; it does not define the StateAssertion or the permission to proceed with work.
When a checklist or assertion is translated across an embedding, the space mapping must be explicit. Pulling a checklist into another space and pushing an assertion into a larger or different space require declared normalization and a proof, accepted bridge relation, or governing waiver. Otherwise the comparison or reuse remains incomparable for the current claim.
Operational examples and minimal data stubs, when needed, belong to the certification-interface pattern or the consumer pattern that uses the declared space. A.19 remains persistence-agnostic and identifier-scheme agnostic.
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 persistence 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.
Characteristic-Space Reference Chain
When a consumer pattern evaluates a checklist, StateAssertion, gate, assurance argument, or decision through a declared CharacteristicSpace, keep the space-related references distinct:
raw coordinates -> NormalizationMethodInstance -> quotient or NormalizationFix -> optional indicator choice -> optional order or distance overlay -> neighboring checklist, assertion, gate, assurance, or decision claim
The left side of this chain is A.19-facing: declared space, normalization reference, quotient or fixed chart, and declared overlay. The right side is governed by the consumer pattern. Co-implementation in software or records does not collapse the conceptual references.
Operator library (notation‑neutral)
Spaces: Sub (projection), Emb (embedding), Prod (product), Quot (quotient by declared equivalence), NormalizationFix (fix to a named chart or edition).
State-criteria transport: Pull (pull checklist via embedding and NormalizationMethodInstance), Push (push assertion along embedding with proof or waiver), Indicatorize (apply IndicatorChoicePolicy to select Indicators), Align_B (cross‑context alignment via Bridge with CL), Fold_Γ (admissible aggregation or accumulation per B.1, with WLNK and 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 persistence identifier scheme.)
Typed set views and optional neighboring transition-sensitive selection interpretation
TypedSetViewsname 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.
SelectionSlotstill returns one selected set result, andShortlistremains the public head when a selected set is emitted.- If one atlas-like interpretation 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,
SearchSpaceRefandOutcomeSpaceRefare role-specific refinements of the olderSpaceRefidiom. Do not let umbrellaSpaceRefwording hide which space-ref role the current typed-set-view interpretation depends on. - Use one
SpaceMetricRefonly when a comparison, neighborhood, spread, or crowding claim truly depends on one declared space metric or comparison rule. - Use one
TransitionRelationRefonly 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 ofTransitionRelationRef, 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 and operational segregation (normative). A.19 aligns with C.2.3 Unified Formality Characteristic (F). The legacy tier labels T0, T1, and 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 and slots as (Characteristic, Scale) pairs), state the comparability regime (coordinatewise or normalization-based), and express a state’s checklist in observable coordinates. No persistence formats, identifiers, or operational provenance are required. — F-Predicates (F ≥ F4 when predicate-like). As above, plus explicit slot and NormalizationMethod names and stated overlays (order or metric). When acceptance conditions are written as typed predicates over coordinates, declare F ≥ F4. Remains notation-neutral and persistence-agnostic. — Operational bindings (not part of F). When automatic checking or assurance is required, use A.19.CN, C.16, and B.3 for identifiers, validity windows, waivers, and logs. These raise R and 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 or unit from CS₂’s. The cited instances MUST satisfy the admissibility and declaration obligations governed by A.19.UNM (including monotonicity w.r.t. polarity, validity window, and method-class token). When the embedding is used for gating or assurance, C.16 and the governing gate or assurance pattern own the evidence-backed claim. (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 or 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.
Neighboring certification references
CC‑A19.6. When a neighboring StateAssertion, checklist, gate, assurance, or decision claim uses a CharacteristicSpace, A.19 requires only the space-facing references: the state or coordinate set, the associated checklist or criteria set, the observation window, and any NormalizationMethodInstance or Bridge used for cross-space mapping. The assertion, evidence, gate, assurance, and decision claims remain governed by their own patterns; A.19 does not mandate any identifier or persistence scheme.
CC‑A19.7. If a Green-Gate or enactment rule uses coordinates from a CharacteristicSpace, the gate pattern and role-method-work pattern govern permission to act; A.19 only requires that any translated state or coordinate claim cite declared Embeddings and Bridges rather than untracked inferences.
CC‑A19.8. Checklist definitions that use a CharacteristicSpace must use observable predicates over declared coordinates and context events. If temporal order or multi-step processes matter, use explicit method and work patterns or aggregation logic outside A.19 rather than hiding a workflow inside the state-space declaration. 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 or UNM declaration, space overlay, or state checklist is updated or calibrated differently in a new version, previous StateAssertions are not retroactively modified by A.19. The governing assertion or record pattern closes or versions those claims; A.19 requires only that the old and new space-facing referents remain inspectable.
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 or 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 or 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 and 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 or gating MUST be non-expansive (Lipschitz ≤ 1) under the declared distance overlay and commute with NormalizationFix; otherwise observation is required.
Neighboring certification use
CC‑A19.19. StateAssertions that use a CharacteristicSpace must name the current NormalizationMethod or UNM declaration and overlay definitions used; assertion validity, waiver speech acts, evidence kind, and gate validity are governed by the assertion, evidence, waiver, and gate patterns. A.19 imposes no requirement on identifiers or persistence formats.
CC‑A19.20. The space-facing references in a neighboring certification use - normalization declaration, quotient or fixed chart, overlay, and coordinate predicate - are logically distinct and must be reconstructable in the argument or review. The neighboring consumer pattern owns evaluation, assertion, gate, assurance, and decision semantics.
Operators (OP)
CC‑A19.21. Use of Align_B in a gate or assurance claim must declare the Bridge used; the assurance pattern owns CL propagation and penalties. Cross-context comparison without a Bridge remains inadmissible for A.19 space comparability. A.19 imposes no requirement to store an identifier.
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
≼_coordon the result. -
“Compare before common-space mapping.” ✗ 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 or UNM declaration 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 or rate-change claim that needs base characteristic, scale and unit, time base or sampling window, transformation or 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 interpretation governs the current claim, cite
baseCharacteristicRef, the relevant measure reference, sampling window, construction method such asDHCMethodRef, and the C.16 measurement or construction relation reference; C.27 does not define a parallel measurement system.
A.19.ECS object-under-improvement evaluation construction relation.
- A.19 defines
CharacteristicSpaceas an ontological structure: slots, characteristics, scales, value sets, overlays, and comparability boundaries. - A.19.ECS governs the construction of one object-under-improvement evaluation
CharacteristicSpacefor an object being improved. It is used beforeE.22andE.23when 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 insideF.18are 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
CharacteristicSpaceoverlay, stay inA.19and 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 carry a reusable explanation claim beyond local declaration, add the applicableC.29lens-use result for the stated lens use. Do not move the space declaration out ofA.19;C.29names only what the mathematical lens preserves, loses, makes visible, and cannot license.
Source Role and Currentness
A.19 is primarily internal-kernel doctrine, not an external SoTA-import pattern. Its authority for U.CharacteristicSpace comes from the accepted FPF chain: A.17 for U.Characteristic, A.18 for scale and value discipline, C.16 for measurement and coordinate evidence, A.19.UNM for normalization methods, C.29 when a mathematical lens is being used beyond local space declaration, and E.24 for ontic-head and slot-relation discipline.
Currentness is therefore inherited through that chain. Reopen A.19 when any governing pattern in that chain changes characteristic identity, scale semantics, value-set meaning, missingness semantics, normalization admissibility, comparability, bridge discipline, mathematical-lens boundary, or ontic slot discipline. Do not reopen A.19 merely because one consumer pattern adds a new score table, dashboard, evaluation report, certification interface, or portfolio view that uses a declared CharacteristicSpace.
Ontic Relations and Consumer Boundary
- Builds on:
E.24for ontic-head discipline,A.6.5for slot relation discipline,A.17andA.18for characteristic and scale discipline, andC.16for measurement and coordinate evidence. - Coordinates with:
A.19.ECSfor constructing evaluation characteristic spaces for object kinds under improvement;E.21,E.9.DA, andE.2.DAfor pattern, DRR, and FPF-level evaluation use;E.24.PUBwhen a score table, dashboard, report, or publication form is confused with the characteristic space itself. - Does not replace: CHR mechanism-governing patterns, consumer patterns that use a declared space, source-set relations, publication-form patterns, or mathematical-lens use under
C.29.
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:
- Scale set from air. An evaluation lists coordinates because they are familiar, not because they discriminate the evaluated object kind or use.
- 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.
- One-score collapse. Several independent characteristics are averaged into one score, hiding object-kind-fit defects and trade-offs.
- Unstated polarity. Readers cannot tell which direction is preferred or when a value has no preferred direction.
- No floor or exceptional meaning. Values are recorded, but nobody can say what is viable, exceptional, or still inadmissible for the declared use.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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
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
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.
- 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.
- 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.
- 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. - 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.
- 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.
- 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.
- 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.
- 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.
- Define floor, exceptional, status, and stop. State the viable-for-use floor, exceptional-for-use meaning, status values, and local stop or reopen condition.
- 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.
- Start
E.23only 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:
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, current ontic slot, relation position, use relation, or claim kind, 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, relation position, use relation, or claim kind is a changed evaluation decision, not a wording repair.
Discriminating-case test
An evaluation is not ready if it cannot distinguish these three outcomes:
- Admissible evaluated object. The object is of the evaluated object kind and can meet or exceed the floor under the declared use.
- Below-floor evaluated object. The object is of the evaluated object kind or a declared comparable family, but fails one or more floors.
- 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.21when the evaluation characteristic-space specification is itself an FPF pattern version;E.9.DAwhen the decision record selecting the scale set is theDRRdecision-adequacy object being evaluated;E.2.DAwhen the scale set changes FPF-level Pillar adequacy;F.18when the live problem is name choice for the scale-set heads;C.16,A.17,A.18, orA.19when 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
Common anti-patterns
Relations
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
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, orsupport 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, useC.16.Pbefore state-family repair. - If the state-like claim concerns source-expression, publication, carrier, or source-use wording, use
C.2.Pfirst; return toA.19.SPRonly 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, orF.18as selected byE.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
Posturekind; - replacing one broad word with another broad word such as
basis,support,state, orstatus; - treating every state-like word as a
CharacteristicSpaceposition; - 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
LensUseAdmissibilityValueordynClaimPosturewhen 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
Solution
Repair state-family wording by producing a StateFamilyPrecisionRepair or an equivalent local rewrite.
Minimum shape:
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
- Capture trigger and bounded text. Copy the encountered state-family word and the sentence, row, card, or field that uses it.
- 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. - Recover the state frame or governing pattern. Decide whether the frame is
A.19CharacteristicSpace,A.3.3dynamics, role-state assertion,C.2.2alanguage-state chart,A.10evidence path,B.3assurance,A.20constraint or adjudication state,A.21gate decision,E.17publication use,C.27temporal-claim state,C.29lens-use admissibility,E.9.DADRR-decision adequacy,E.21pattern quality, or a project-side administrative, review, dispatch, release or admission, or source-control record. - 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.
- 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.
- State admissible and non-admissible use. Say what the reader may do with this value and what adjacent claim remains blocked.
- State validity window or reopen condition. If currentness, readiness, release or admission, validation, assurance, or administrative state can decay, name what changes the value.
- 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.
- 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
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
Common anti-patterns
Relations
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
CharacteristicSpaceor to two distinct declaredCharacteristicSpacedeclarations; - 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
CharacteristicSpaceitself, with no source-set or source-to-outcome requirement; useA.19; - you are publishing selector or shipping metadata such as
SelectorOutcomeKind,SetResultFamily,HandoffKind, or public shortlist identity; useG.5orG.10; - you are building one interpretive view over an already-declared substrate; use
A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEWor a local specialization such asG.2; - you are deciding live pool policy, frontier retention, or next-move planning; use
C.19orC.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, orportfolio; SearchSpaceRefandOutcomeSpaceRefnever become explicit, orSpaceRefRelationKindnever becomes explicit, so one line silently hides whether search and outcome use one declared space twice or two different declared spaces;DescriptorMapReforDistanceDefRefgets mistaken for the space itself rather than one representation or metric qualifier;- publication metadata in
G.5orG.10starts 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.19spaces 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:
CharacteristicSpaceis the reusedA.19kind. This pattern does not mint a second space kind.SearchSpaceRefandOutcomeSpaceRefare role-named local fields whose slot content is typed by the existingCharacteristicSpaceRef/SpaceRefidiom. They are not new heads, not slot aliases inside the space, and notU.Roleclaims. In source-set/space-substrate or typed-set-view passages, read them as role-specific refinements of that olderSpaceRefidiom rather than collapsing the roles back into one umbrellaSpaceRef.SpaceRefRelationKindis a local relation-kind field over those two refs. In this slice,sameDeclaredSpaceAsanddistinctDeclaredSpaceFromare controlled token values for that field, not free prose.SourceToOutcomeRelationandDistortionPostureare 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, andDerivedViewKindare local fields in thisSourceSetSpaceSubstratedeclaration. Whether any value later becomes a broader stable head is outside this pattern.BasePaletteRef,OutcomeMapRef,SpaceMetricRef,TransitionRelationRef,BridgeDistortionNote,DescriptorMapRef, andDistanceDefRefare guarded neighboring refs or interpretive qualifiers reused here. This pattern may cite them, but it does not redefine them.carrierinsideSourceToOutcomeRelationnames 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 isU.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:
- Name the active source set.
- Point
SearchSpaceRefandOutcomeSpaceRefto declaredCharacteristicSpace. - Choose
sameDeclaredSpaceAsordistinctDeclaredSpaceFrom. - State the source-to-outcome relation in direction, mode, and carrier.
- 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.
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.19CharacteristicSpace; - one outcome-side reference to an
A.19CharacteristicSpace; - one explicit
SpaceRefRelationKindover 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:
- the declared source set remains explicit and recoverable;
SearchSpaceRefandOutcomeSpaceRefstay guarded refs to declaredA.19CharacteristicSpace, not new free-floating space kinds;- the text states whether those refs point to one declared space or to two distinct declared spaces;
- 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;
- distortion, uncertainty, and error are stated honestly rather than hidden in prose;
SourceSetCompositionandDerivedViewKindremain conditional fields rather than fabricated mandatory baggage;- qualifier refs such as
OutcomeMapRef,SpaceMetricRef,TransitionRelationRef, andBridgeDistortionNoteremain available but substrate-side only; - and neighboring declarations such as
A.19,C.18,G.5,G.10, andA.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEWcan dock to the substrate without redefining it?
A.19.SOURCE-SET-SPACE-SUBSTRATE:3 - Forces
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.19CharacteristicSpace; - the outcome-side reference to one declared
A.19CharacteristicSpace; - the explicit
SpaceRefRelationKindover 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.19space 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:
Interpret the fields as follows:
SourceSetFamilynames 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.SearchSpaceRefpoints to one declared[A.19](/generated/patterns/A.19)CharacteristicSpacein the search-side position.OutcomeSpaceRefpoints to one declared[A.19](/generated/patterns/A.19)CharacteristicSpacein the outcome-side position.SpaceRefRelationKindstates how those two refs relate. In ordinary use, the token is eithersameDeclaredSpaceAsordistinctDeclaredSpaceFrom.SourceToOutcomeRelationis one controlled declaration slot. State at least direction, mode, and carrier.DistortionPostureis one controlled declaration slot with one primary posture token plus optional clarifying note. In this slice, lawful posture tokens includetransparent-for-current-use,lossy-bridge,metric/model-dependent,transition-dependent,uncertainty-bearing,learned/adaptive, andunstable-under-refresh.SourceSetComposition,DerivedViewKind, and related...Kindvalues 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 withKind.
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.
SearchSpaceRefandOutcomeSpaceRefboth resolve to the same declaredCharacteristicSpace, andSpaceRefRelationKind = sameDeclaredSpaceAs. - Cross-space profile.
SearchSpaceRefandOutcomeSpaceRefresolve to two distinct declaredCharacteristicSpacedeclarations, andSpaceRefRelationKind = distinctDeclaredSpaceFrom. - Derived-source supplement.
If the visible source set is one derived tradition, front, or palette view, keep
DerivedViewKindandBasePaletteRefexplicit 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:
- Entry test. Confirm that the line really needs source-set plus search/outcome-space plus relation/posture discipline. If it only needs
CharacteristicSpacetyping, useA.19. If it only needs publication or policy, apply the governing pattern that carries that publication or policy question. - Recover the active source set. State
SourceSetFamily. If several same-family source sets or set results are simultaneously live, fillSourceSetRef?or cite the neighboring governing pattern that makes that identity unique. - Recover the space refs. Point
SearchSpaceRefandOutcomeSpaceRefto already-declaredCharacteristicSpace. - Choose the ref-to-ref relation kind. Declare
sameDeclaredSpaceAsonly when both refs truly resolve to one declared space. DeclaredistinctDeclaredSpaceFromonly when they truly resolve to two distinct declared spaces. Do not leave this to reader inference. - State the source-to-outcome relation. Give direction, mode, and carrier explicitly. If one named
OutcomeMapRefor another declared interpretive qualifier carries the relation, cite that qualifier explicitly. If not, state the carrier directly in prose. - 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.
- 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.
- 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
Cross-space form
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:
SourceSetFamilystill names the primary family the line is anchored on;SourceSetCompositionnames 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
OutcomeMapRefor named declared map ref really disciplines the source-to-outcome relation; - one metric really disciplines spread, neighborhood, or comparison claims;
- one
TransitionRelationRefreally 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:
DescriptorMapRefmay realize or qualify the search-side or outcome-side representation requirement, as the current line requires;DistanceDefRefmay realize or qualify the metric requirement over that representation on either side, as the current line requires;- but neither one replaces
SearchSpaceReforOutcomeSpaceRef; - and
CharacteristicSpaceremains a different kind fromDescriptorMap.
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.5publishes selector-facing outcome metadata;G.10ships 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.
Use this minimal worksheet when drafting or repairing one substrate line:
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-VIEWwhen 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.2when that interpretation becomes palette-first, tradition-facing atlas work. Keep the base palette and the cited substrate recoverable while doing it. - Use
A.6.Pwhen 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.18when 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.0when 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.
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.
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:
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.
A.19.SOURCE-SET-SPACE-SUBSTRATE:8 - Common Anti-Patterns and How to Avoid Them
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, andG.10stay 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
SpaceRefRelationKindsays 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
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-VIEWand 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, orBridgeDistortionNote, 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; useA.19; - you are publishing selector outcomes, shortlist identity, or shipping metadata; use
G.5orG.10; - you are setting live pool policy, retained-set policy, or enactment/planning posture; use
C.19orC.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, orE.17.1; - the line would change the EntityOfConcern rather than preserve it; use
A.6.4or 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-SUBSTRATEstarts reading as if it also governed interpretive views, atlas readings, or palette interpretation; - the word
viewappears as one fresh local theory, detached from existingU.EpistemicViewingandU.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, andBridgeDistortionNoteeither 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;
DeclaredSubstrateAtlasViewremains 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:
DeclaredSubstrateInterpretiveViewis 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.DeclaredSubstrateAtlasViewis the fuller specialization of that same family. It is not the common head and it is not automatically required.TypedSetViewsis one local plural field over already-declared set-view heads or ids. It is not a new generic set-result ontology.TraditionAtlasViewis one localG.2specialization ofDeclaredSubstrateAtlasView, not the family head for all interpretive-view use.OutcomeMapRef,SpaceMetricRef,TransitionRelationRef, andBridgeDistortionNoteare guarded neighboring refs or interpretive qualifiers reused here. This pattern may foreground them, but it does not mint them.inspection questionis one local declaration field naming the interpretive load the current reading helps with. It is not a replacement forU.Viewpoint.DerivedViewKindandBasePaletteRefstay 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:
- Cite the base substrate or the source-set entry point or set-result entry point that stays recoverable with it.
- State the inspection question in one sentence.
- Choose thin interpretation or atlas interpretation.
- Keep the active source set and any active set result recoverable.
- 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.
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:
- it is explicitly one domain-specific use-site of existing
U.EpistemicViewingandU.MultiViewDescribinglaw, not one fresh autonomous theory of views; - it keeps the already-declared substrate recoverable instead of replacing it;
- it allows both ordinary thinner interpretive views and one fuller atlas-form interpretive view;
- it keeps
OutcomeMapRef,SpaceMetricRef,TransitionRelationRef, andBridgeDistortionNoteoptional and substrate-side only; - it keeps derived palette or tradition views recoverable through
DerivedViewKindandBasePaletteRefwhen those are active; - it does not mint new set-result family heads, selector policy, publication policy, or shipping semantics;
- it lets
G.2keepTraditionAtlasViewas one local specialization rather than as the generic head of the whole family; - 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
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-SUBSTRATEline 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:
CharacteristicSpaceitself;- 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
DeclaredSubstrateInterpretiveViewor fullerDeclaredSubstrateAtlasView; - 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:
- 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; - one explicit inspection question;
- one recoverable active source-set basis, plus any active set result drawn from it when the reading uses one;
- any cited spaces, declared map refs, and qualifying uncertainty/distortion refs remain recoverable whenever the reading cites them;
- 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
DeclaredSubstrateInterpretiveViewwhen 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
DeclaredSubstrateAtlasViewwhen 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:
- 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.
- Name the active interpretive head. Use ordinary
DeclaredSubstrateInterpretiveViewunless the current reading genuinely needs the fuller atlas form. - 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.
- State the inspection question directly. Say what the view helps the reader see that the substrate alone leaves hard to inspect.
- 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.
- Recover derived-view and palette structure when it matters. If the view depends on one derived tradition or palette reading, state
DerivedViewKindandBasePaletteRef. - 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. - 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.
- 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;
TypedSetViewswhen 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, orBridgeDistortionNotethat materially disciplines the reading; DerivedViewKindandBasePaletteRefwhenever 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:
OutcomeMapRefwhen the current reading must show how one declared source or set result bears on one outcome-side declared space/ref;SpaceMetricRefwhen neighborhood, spread, reachability, or crowding claims are load-bearing in the current reading;TransitionRelationRefwhen the current reading depends on explicit transition or cross-scale state-change qualifier;BridgeDistortionNotewhen 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-VIEWhelps the reader inspect one already-declared substrate;G.5publishes selector outcomes and their source/publication metadata;G.10ships publication faces and pins;C.19governs live candidate-pool and frontier policy;C.24governs 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-VIEWstates the generic interpretive-view family and the generic fuller atlas formDeclaredSubstrateAtlasView;G.2keeps the palette-first, tradition-facing specializationTraditionAtlasView;TraditionAtlasViewis 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
TraditionorAtlasinto every case; - and the
G.2specialization 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.
Use this compact interpretive view declaration when drafting or repairing the line:
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.2when 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.18when 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.Pwhen one passage collapses view, surface, space, map, or palette into one umbrella word. Repair the layer split first, then continue. - Use
A.0when 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, orC.24when 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:
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.
A.19.DECLARED-SUBSTRATE-INTERPRETIVE-VIEW:8 - Common Anti-Patterns and How to Avoid Them
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.2or 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
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 workTraditionAtlasViewunderG.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/NormalizationFixmean?” → A.19.UNM.- “What is an Indicator /
IndicatorChoicePolicyand 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≡_UNMis 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.
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:
- Chartless numbers. Measures move between teams without units, reference states, or declared normalization → illusory comparability.
- Hidden normalization flips. Re‑parameterisations (e.g., normalising by batch size) silently alter meaning; trend lines lie.
- CN‑frame sprawl. Every initiative mints a new “dashboard dimension”; semantics diverge; assurance collapses.
- Un‑bridgeable reports. Cross‑team roll‑ups average incongruent CN‑frames, violating the weakest‑link (WLNK) discipline from Γ and B.3.
Forces
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:
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:
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)
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_v3normalization: affine rescale on gray‑level calibration → invariant = physical porositycomparability: normalization‑based (UNM) (calibration tables applied)aggregation: WLNK on quality (min‑bound), COMM on counts, time = per‑shift histograms- RSG hook:
WelderRole.Readyrequires 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_v4normalization: monotone time‑warp compensation for collector skew; invariant = percentile ordercomparability: normalization‑based (UNM) with declared normalizationaggregation: MONO on latency (max of mins), WLNK across services- RSG hook:
DeployerRole.Activegated 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_v5normalization: case‑mix adjustment (propensity score); invariant = adjusted ΔBPcomparability: normalization‑based (UNM) (post‑adjustment)aggregation: LOC on subcohorts; WLNK on safety outcomes- RSG hook:
EvidenceRole.Validatedadmission 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)
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:
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)
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)
Didactic quick cards (one‑liners teams reuse)
- Numbers travel with their Context. Always cite
Context@Edition. - If the normalization is not declared, the trend is fiction.
- WLNK beats wishful means. Use weakest‑link folds for safety.
- Admit → Assert → Act. (CN‑frame admission → RSG StateAssertion → Method step).
- Bridge or bust. Cross‑context = Bridge with CL and loss notes.
- Steward writes, Certifier admits. (SoD by design.)
- Charts are recipes. Name the
MethodDescriptionthat made the number. - Deprecate in the open. CN‑frame cards carry DRR & retirement plans.
- Keep characteristics few, meanings sharp. Prefer ≤ 7 characteristics per CN‑frame.
- No tooling names in Core. Semantics first; notation later.
- 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_basisinclude unit, scale, and polarity;chartreferences aMethodDescription. - SCR‑A19.4‑S02 (Normalization clarity).
normalizationcites 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
RoleAssignmentsforCN‑frameStewardRoleandCN‑frameCertifierRoleexist; 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
Γ_foldinvalidates 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
Γ_foldinstantiates Γ_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.
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 viaMechSuiteDescriptionRef, 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⟩;SlotIndexis a projection) - A.19
CN‑Spec(governance card) - G.0
CG‑Spec(legality gate for numeric operations) - E.18 / 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:
- the CHR core is reusable across all Part‑G patterns (not only G.5),
- legality is centralized via spec pins (
CN‑Spec,CG‑Spec) and Transport discipline, - P2W integration is made explicit by requiring a standard planned slot fillings plan item in
WorkPlanning, while keeping FinalizeLaunchValues exclusively inWorkEnactment.
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.2for canonical targets. - CHR suite boundary (membership + obligations + protocols):
A.19.CHR(mechanisms[]declares…IntensionRef;suite_protocolsdeclares 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.*:ExtensionsasGPatternExtensionblocks (PatternScopeId = G.x:Ext.<…>), with explicitGoverningPatternId. - 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 transformation-flow structures: project patterns (
P.*) for⊑/⊑⁺specializations;E.18for 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‑Specrefs (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”):
UNM— Unified Normalization MechanismUINDM— Unified Indicatorization MechanismUSCM— Unified Scoring MechanismULSAM— Unified Lawful Scale Aggregation MechanismCPM— Unified Comparison MechanismSelectorMechanism— universal set‑returning selection kernel
Show.
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
CharacteristicSpaceSlotCNSpecSlotCGSpecSlotContextSlot
-
Indicatorization
IndicatorChoicePolicySlotIndicatorSetSlotJustificationSlot
-
Scoring
InputProfileSlotScoreProfileSlot
-
Aggregation
MeasureSetSlotGammaFoldSlotGammaTimeRuleSlot(optional)AggregatedMeasureSlotContributorSetSlot(optional)
-
Comparison
LeftProfileSlotRightProfileSlotComparatorSpecSlotComparisonResultSlot
-
Selection
CandidateSetSlotCriteriaSlotTaskSignatureSlot(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.IntensionRef→A.19.UNMUINDM.IntensionRef→A.19.UINDMUSCM.IntensionRef→A.19.USCMULSAM.IntensionRef→A.19.ULSAMCPM.IntensionRef→A.19.CPMSelectorMechanism.IntensionRef→A.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.18U.Transfer; it requires only refs/pins/anchors whose realization is mediated by E.18 / gate surfaces.penalties_route_to_r_eff_only: CL/Φ/Ψ/Φ_plane penalties route toR/R_effonly;F/Gare invariant under penalty routing.crossing_visibility_required: any GateCrossing relevant to suite use publishes aCrossingBundle(E.18) and can be cited as an audit anchor (including LaunchGate andedition_keychanges of pinnededitions{…}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
degradeorabstain, not topass. - Gate decision separation: mechanisms and suite objects MUST NOT publish
GateDecisionnorDecisionLog.blockis gate‑only (OperationalGate(profile)). - Guard lexeme reservations:
USM.CompareGuard/USM.LaunchGuardare 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.
Suite spec pins
CHRMechanismSuiteDescription.suite_spec_pins MUST be refs‑only and MUST include:
-
Required spec refs:
{CNSpecRef, CGSpecRef}(as required pins, not copied content). -
Required planned baseline:
required_planned_baseline_ref := CHRMechanismSuiteSlotFillingsPlanItem(kind‑level requirement: “P2W path MUST publish a planned baseline plan item of this kind”). -
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).
Tell.
- The
fold_Γstep is optional (explicitly optional, not implicit insidescore/compare/select). suite_protocolsencodes a pipeline/Uses contour between mechanisms; it does not define a specialisation relation (⊑/⊑⁺). Specialisations live inA.6.1:4.2.1(and in projectP.*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).
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_refMUST be edition-addressable and MUST reference theCHRMechanismSuiteDescriptioninstance (kind:MechSuiteDescription) via aMechSuiteDescriptionRef@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). Ifexpected_usm_guard_pinsis present and non-empty, the PlanItem MUST also pin (or make unambiguously derivable)guard_owner_gate_refrequired for later aggregation ofGuardFailevents (A.15.3 guard-governing pattern rule). - MUST include planned fillings for (at least) the suite spec pins, expressed as
planned_fillingsrows keyed by the corresponding SlotKind tokens:CNSpecSlotfilled byByRef(CNSpecRef@edition(…))(edition‑pinned where required),CGSpecSlotfilled byByRef(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 correspondingexpected_crossing_bundle_refs(refs only) so crossing visibility has an explicit anchor.
Prohibitions
- MUST NOT contain
GateDecision/DecisionLog. - MUST NOT contain
FinalizeLaunchValueswitnesses or launch values. - MUST NOT embed CL/Φ/Φ_plane tables; only refs/pins.
Examples
Example — normalization-based comparability with explicit Uses chain
Show.
-
CHRMechanismSuiteDescriptionis referenced by a G‑pattern (e.g., method selection, parity selection, or lawful publish pipeline). -
WorkPlanning publishes
CHRMechanismSuiteSlotFillingsPlanItemwith:- pinned
CNSpecRef(ed=…),CGSpecRef(ed=…), - pinned
ComparatorSpecRef(ed=…)(fromCG‑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.
- pinned
The executed protocol (by E.18/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
SelectorMechanismspecialization (via G.* extension) returns an Archive retained set. -
WorkPlanning plan item additionally pins:
DescriptorMapRef@edition(…)andDistanceDefRef@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 patternP.*), 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/ComparatorSpecRefselections 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 fromG.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
GuardDecisionallows 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.18) and explicit P2W plan items (
SlotFillingsPlanItem). Mitigation: the suite fixes only the universal core; discipline-specific generators and extensions remain separate mechanisms connected byUses, 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:
- enforce tri‑state guard decisions (
pass|degrade|abstain), - enforce
unknown_never_coerces_to_pass, - enforce guard–gate separation (no
GateDecision/DecisionLogat mechanism/suite level;blockremains gate‑only), and - enforce guard lexeme reservations (
USM.CompareGuard/USM.LaunchGuardare 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:
- express any dependence as an explicit protocol step (no hidden invocation of UNM/UINDM/ULSAM inside score/compare/select), and
- 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
Consequences
Rationale
This pattern deliberately fixes the CHR core as a description object rather than a new “meta-mechanism” so that:
-
Level separation stays clean. The suite is a D-episteme that enumerates mechanisms and obligations; the mechanisms remain
U.Mechanism.Intensionnodes with their own SlotSpecs, laws, guards, transport and audit. This prevents a “god object” that re-implements A.6.1 inside a new container. -
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.
-
P2W integration becomes explicit without turning planning into execution. A planned-baseline
SlotFillingsPlanItemis 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. -
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.
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.Intensionand 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.18 / 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 viaUses. - Informs other kits and suites: any kit or suite that materially participates in selection should provide an analogous
…SlotFillingsPlanItemplanned 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 separateUsesproviders. - P2W integration is performed uniformly via
CHRMechanismSuiteSlotFillingsPlanItemplanned 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(perE.20). The canonical publication anchor forUNM.IntensionRefremainsA.19.UNM, whileA.6.1governs theU.Mechanism.Intensiontemplate. Boundary note: TheCN_Specsurface itself (incl.CN_Spec.normalizationandCN_Spec.comparability) remains governed byA.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., citeA.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 restateSlotIndex / 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):
- Which
UNM_id(if applicable) and whichNormalizationMethodInstanceId(and its validity window) was used? - Which
NormalizationInvariant[*]were declared (i.e., what is preserved)? - Where are the evidence pins and any transport / plane pins (Bridge/CL/ReferencePlane +
UNM.TransportRegistryΦ/Phiif 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.moderoute whether comparison iscoordinatewiseornormalization-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 (aU.Mechanisminstance of type UNM; routing/governance level).NormalizationMethodInstanceIdselects 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: setmode, and (when UNM participates in acceptance/comparison) setminimal_evidence. - In
CN_Spec.normalization: declareUNM_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 pinUNM.TransportRegistryΦ/Phiwhen 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:
-
Normalization drifts into hidden places. It gets embedded inside scoring, comparison, or selection, making legality and governance non-local.
-
Comparability becomes rhetorical. People say “we normalize” but cannot answer: Which method? Which invariants? Which validity window? Which evidence? Which transport/plane regime?
-
Cross-context and cross-plane slips become invisible. Teams “reuse” normalizations across contexts without explicit Bridge/CL/ReferencePlane discipline.
-
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
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.normalizationandCN_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:
- the invariants it preserves (
NormalizationInvariant[*]), - its closure rules (composition, and inverses where defined), and
- 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:UNMIntensionRef:UNM.IntensionRefName: Unified Normalization MechanismStatus: StableVersion:v1.0SuiteRole: 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≡_UNMover charts/views)BaseType: chart/U.CharacteristicSpacefamily in a CN‑frame (oneU.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‑fixedrepresentatives (viaNormalizationFixSpec)
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 bycompose; 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)
apply
- Preconditions:
UNM_Eligibility(…) ∈ {pass, degrade}(fail‑closed;abstain⇒ no NCV output). - Inputs:
NormalizationMethodInstanceSlot,CoordinateValueSlot,CharacteristicSpaceSlot,CNSpecSlot,ContextSlot - Outputs:
NCVSlot(+ availability ofUNMCongruenceSlotfor the same method instance)
compose
- Purpose: build a composed method (only when explicitly declared lawful).
- Inputs:
NormalizationMethodInstancePairSlot(roles = {inner, outer}),ContextSlot - Output:
NormalizationMethodInstanceSlot(new composedNormalizationMethodInstanceId), with an explicit validity window and evidence pins.
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
NCVas 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).
NormalizationMethoddefines 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
≡_UNMover 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).
≡_UNMis 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
abstainordegrade(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).
NCVdoes 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, intoR_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
NormalizationMethodInstanceIdis declared inCN_Spec.normalization.instances(or an equivalent declared surface), its method kind is included inCN_Spec.normalization.methods, and (if present) it satisfiesnormalization.admissible_reparameterizations; - (Target coordinate binding) the input
CV’sslot_idbelongs 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 declaredNormalizationInvariant[*](fromCN_Spec.normalization.invariantsand/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 usesNCVin gated decisions), the method instance’s evidence pins satisfyCN_Spec.comparability.minimal_evidence(structure typically gated byG.0; evidence semantics governed byC.16).
- (CN‑frame binding) the selected
- 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
NCVrather 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Φ(akaUNM.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^planeand are audited; penalties route toR_effonly.
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 anyNormalizationMethodDescriptionRef.edition - declared
NormalizationInvariant[*]andNormalizationFixSpec(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 / fixprovide the declared surface that UNM consumes. (If present)normalization.admissible_reparameterizationsconstrain which re‑parameterizations count as “admissible” under the declared invariants. (See CN-frame definition inA.19.CN;A.19.CNremains 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
NormalizationFixexplicitly. Do not silently treat an arbitrary representative as canonical.
P2W and transformation-flow integration note (normative-by-reference)
When UNM is used inside transformation-flow structures/graphs (e.g., E.18):
- 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.WorkPlanningand executed inU.WorkEnactment. - In transformation-flow terms, transport/plane reuse is surfaced as explicit calibration records and transport-policy records pinned to
TransportRegistry^Φ(editioned asUNM.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:
- choosing an admissible normalization method instance (with evidence and validity window),
- applying it to produce NCVs,
- exposing
≡_UNMand (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-basednormalization.invariants = {unit-alignment, polarity}- a method instance
M_unitScalewith validity windowVW_2026Q1and evidence pins.
- UNM applies
M_unitScaleto 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
xandyare different raw values (different units or reference planes). - Under a chosen normalization method instance,
x ≡_UNM yholds. - Comparability claims are made over
[x]_{≡_UNM}and[y]_{≡_UNM}(equivalence classes). - If reporting needs a single representative, a declared
NormalizationFixselects it; otherwise, do not pretend a representative is canonical.
Show (P2W and transformation flow). Missing/stale inputs:
- A selector (or comparator) requires comparability under
normalization-basedmode. - 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 aFreshnessRequestthat 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.modeand theCN_Spec.normalizationsurface; 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_effonly. - Quotient/fix discipline: if a representative is required,
NormalizationFixis 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
FreshnessRequestemissions (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Φ(aliasUNM.TransportRegistryPhi) is referenced as an edition pin key and audited;TransportRegistry^Φremains the transformation-flow term, not a new…Refkind.
Common Anti‑Patterns and How to Avoid Them
-
Hidden normalization inside scoring or selection Avoid by using
CN_Spec.comparability.modeand explicit UNM use. -
“NCV ⇒ indicator” shortcut Avoid by treating indicatorization as UINDM policy, not a byproduct of normalization.
-
“We normalized” without declaring invariants Avoid by naming
NormalizationInvariant[*]and exposing≡_UNM. -
Cross-context reuse without transport declaration Avoid by Bridge-only transport and auditing Bridge/CL/ReferencePlane pins.
-
Choosing a representative implicitly Avoid by either keeping quotient objects abstract or declaring
NormalizationFix. -
Using “map/mapping/Map” language as if it were harmless Avoid by using “normalization / re‑parameterization under invariants” and by keeping
Mapfor its specialized FPF meaning. -
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.
-
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.2claim 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(when UNM is used in transformation-flow structures/graphs; P2W freshness/work routing)B.3(congruence/quotient intuition, when referenced)
Used by
- CHR suite protocols (normalize stage), when
comparability.moderequires 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.IntensionforUINDM.IntensionRef(CHR suite stageindicatorize). Mechanism-intension semantics are governed byA.19.<MechId>.A.6.1governs the template ofU.Mechanism.Intension.Canonicalization hook (ID‑continuity‑safe): any other appearances of the UINDM intension (e.g., a legacy grounding stub in
A.6.1or suite prose inA.19.CHR) SHALL be reduced to a Tell + Cite stub pointing toA.19.UINDM:4.1, while preserving the original section headings and their publicPatternId:SectionPathIDs 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 inA.19.CHR:suite_protocols). - Inputs (conceptual): base
U.CharacteristicSpaceRef+CNSpecRef+IndicatorChoicePolicyRef+U.BoundedContextRef, with optionalCGSpecRef(+ optionalMinimalEvidenceRefoverride) when the chosen policy is evidence‑gated. - Output:
IndicatorSetSlot= a set ofU.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 inAudit. - Failure mode: tri‑state guard (
pass|degrade|abstain); unknown never coerces topass. - Quick rule of thumb: if
CN‑Spec.indicator_policyis absent →IndicatorizeEligibility = abstain(fail‑closed); if the selected policy is evidence‑gated →CGSpecRefMUST be available and the effective MinimalEvidence MUST be explicit (override orCG‑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
-
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. -
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.
-
Context locality vs cross‑context reuse. Indicatorization is slice‑bound; cross‑context indicatorization is permitted only when an explicit
Transportclause (Bridge+CL/ReferencePlane) is present—otherwise implicit crossings destroy semantic precision. -
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.
-
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.
-
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. -
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.Intensionshape governed byA.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 emitsAuditpins 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 inA.19.CHR:4.2). -
Tell. Policy‑bound indicatorization: select an indicator subset over an existing
U.CharacteristicSpaceunderCN‑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(withinCNSpecSlot.chart) for the active Context slice; it never enlarges the declared characteristic-space basis. - ResultKind?:
U.Set.
- SubjectKind:
-
SlotIndex (derived projection from
SlotSpecs/ guard SlotSpecs; usesA.19.CHR:4.2.1SlotKind 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 chosenIndicatorChoicePolicyis evidence‑gated),MinimalEvidenceSlot? : ⟨ValueKind = MinimalEvidence, refMode = MinimalEvidenceRef⟩(optional override; if evidence‑gated and omitted, the effective MinimalEvidence isCGSpecSlot.MinimalEvidence),IndicatorSetSlot : ⟨ValueKind = U.Set (of U.CharacteristicRef), refMode = ByValue⟩.
-
OperationAlgebra (suite stage =
indicatorize, perA.19.CHR:4.5; canonical stage‑op =Indicatorize):Indicatorize(CharacteristicSpaceSlot, CNSpecSlot, IndicatorChoicePolicySlot, ContextSlot, CGSpecSlot?, MinimalEvidenceSlot?) → IndicatorSetSlot.
-
LawSet (CHR‑lawful indicatorization):
- Selection‑only:
IndicatorizeMUST NOT alter units, scales, and polarities; it only selects a subset (no implicitUNM). - Declared-basis restriction: the resulting set MUST be a subset of the declared characteristic-space basis (as constrained by
CNSpecSlot.cs_basisandCNSpecSlot.chart). - No implicit NCV⇒indicator: measurability/NCV is not sufficient; indicators exist only via
IndicatorChoicePolicySlot(citesA.19.CNindicator_policy). - Edition‑determinism (with slice locality): for fixed editions of all ByRef inputs (
CharacteristicSpaceRef,CNSpecRef,IndicatorChoicePolicyRef, and—when evidence‑gated—CGSpecRefplus optionalMinimalEvidenceRef) and a fixed active Context slice, theIndicatorSetSlotresult is stable. - 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.
- Selection‑only:
-
AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality/evidence):
IndicatorizeEligibility(CharacteristicSpaceSlot, CNSpecSlot, IndicatorChoicePolicySlot, ContextSlot, CGSpecSlot?, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.passrequires: (i)CNSpecSlot.indicator_policyis present, (ii)IndicatorChoicePolicySlotis consistent with that policy reference (same…PolicyRef+ edition pins), and (iii)CharacteristicSpaceSlotmatches the declared characteristic-space basis implied byCNSpecSlot(within the active chart and Context slice).- If the chosen
IndicatorChoicePolicyis evidence‑gated: (i)CGSpecSlotMUST be present, (ii) defineEffectiveMinimalEvidence := (MinimalEvidenceSlot if present, else CGSpecSlot.MinimalEvidence), and (iii) insufficient/unknown evidence MUST yielddegradeorabstainper the effective failure‑behavior policy (never a silentpass). - If the chosen
IndicatorChoicePolicyis not evidence‑gated, absence ofMinimalEvidenceSlotMUST 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
Transportclause. - 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_effonly. -
Γ_timePolicy:
pointby default (no implicit “latest”). -
PlaneRegime: values live on the episteme
ReferencePlane(theIndicatorSetSlotis 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_effonly. -
Audit:
- MUST record:
CharacteristicSpaceRef.edition,CNSpecRef.edition,IndicatorChoicePolicyRef.edition. - When evidence‑gated, MUST record:
CGSpecRef.editionand effective MinimalEvidence (MinimalEvidenceRefwhen provided; otherwiseCGSpecSlot.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 whenTransportwas invoked.
- MUST record:
Interpretation notes (informative)
-
IndicatorSet is a set of references, not values.
IndicatorSetSlotcontainsU.CharacteristicReftokens; 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|_SwhereS = IndicatorSetSlotover the baseCS = 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 baseIndicatorizesignature, and model the justification as a justificationU.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
IndicatorChoicePolicyis evidence‑gated, in which caseCGSpecSlotandMinimalEvidenceSlotbecome 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_policyfor the “weekly executive dashboard” selects a subset:{DefectRate, IncidentRate, UnitCost, LeadTime, EnergyPerUnit, OnTimeDelivery}. - UINDM runs
Indicatorize(...)and outputsIndicatorSetSlot =those references. - One site lacks reliable incident reporting for the last week. The indicator policy is evidence‑gated;
IndicatorizeEligibilityreturnsdegrade(notpass), 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/degradeoutcomes early. Mitigation: coupledegradewith 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:
-
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.) -
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. -
Selection‑only behavior.
Indicatorizedoes not alter units, scales, and polarities, does not perform implicit normalization, and does not enlarge the declared characteristic-space basis. -
No NCV shortcut. “Measurable/NCV” is not treated as sufficient for indicatorhood; indicatorhood arises only via
IndicatorChoicePolicySlotconsistent withCN‑Spec.indicator_policy. -
Evidence gating is explicit. When the chosen
IndicatorChoicePolicyis evidence‑gated,CGSpecSlotis present and the effective MinimalEvidence is explicit and auditable (MinimalEvidenceSlotwhen provided; otherwiseCGSpecSlot.MinimalEvidence); insufficient/unknown evidence must yielddegrade/abstainper the effective failure‑behavior policy, never a silentpass. -
Cross‑context indicatorization is explicit. Any cross‑context use names the relevant Bridge/CL/ReferencePlane and routes penalties to
R_effonly (Bridge‑only transport + R‑only routing). (SeeCC‑UM.3/CC‑UM.4.) -
Gate/guard separation + lexeme discipline. UINDM uses
…EligibilityreturningGuardDecision ∈ {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. -
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
Auditrefs and pins. -
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 inheritedIndicatorizeop, 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
indicatorizestep (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/abstainoutcomes 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)
Notes per row (SoTA‑Echoing; not method mandates).
- 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.
- 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. - 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, specificallyindicator_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 theindicatorizestage).
-
Coordinates with
G.0(CG‑Spec / MinimalEvidence) when indicator choice is evidence‑gated.E.20(governing-pattern discipline) andF.18(alias docking) for Phase‑3 canonicalization and ID continuity. 1: https://arxiv.org/abs/1907.02893 "Invariant Risk Minimization" 2: https://dl.acm.org/doi/10.1145/3287560.3287596 "Model Cards for Model Reporting"
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.IntensionforUSCM.IntensionRef(CHR suite stagescore). Mechanism-intension semantics of characterisation mechanisms live in explicitly designated governing patterns (E.20).A.6.1governs the template ofU.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.1or suite prose inA.19.CHR) SHALL be reduced to a Tell + Cite stub pointing toA.19.USCM:4.1, while preserving the original section headings and their publicPatternId:SectionPathIDs 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 inA.19.CHR:4.5/suite_protocols; suite membership is a set inA.19.CHR:4.2). - Inputs, conceptual: an admitted measure profile (
InputProfileSlot) +CNSpecRef+CGSpecRef+ScoringMethodDescriptionRef+ activeU.BoundedContextRef, with optionalMinimalEvidenceRefoverride. - 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 inAudit. - Failure mode: tri‑state guard (
pass|degrade|abstain); unknown never coerces topass, and MUST NOT be coerced to0/false. - Quick rule of thumb: if
CGSpecSlot.SCPis missing →ScoreEligibility = abstain(fail‑closed); ifScoringMethodDescriptionSlotis missing →ScoreEligibility = abstain(no implicit scoring method); ifCN‑Spec.comparabilityrequires normalization‑based comparability → normalization MUST be explicit in choreography (Uses/pins), never hidden insideScore.
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/falseor 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
-
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.
-
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.
-
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.
-
Uncertainty vs decisiveness. Teams need decisions under uncertainty; the framework must prevent epistemic overconfidence. Tri‑state admissibility guards preserve correctness without forcing silent coercions.
-
Strict distinction across CHR steps. USCM must not absorb UNM, ULSAM, or CPM semantics “for convenience,” or the suite becomes opaque and non‑teachable.
-
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.
-
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 (
scoreis its own stage with a canonicalScoreoperation and a tri‑state eligibility predicate), - a stable SlotKind surface (via the suite lexicon),
- a legality‑first LawSet anchored in
CG‑Spec.SCPand 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.Intensionshape governed byA.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 emitsAuditpins 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 inA.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 withIntensionHeader/Imports, explicitly exposing the stable SlotKind surface (includingScoringMethodDescriptionSlot) 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.comparabilityand legality‑gated byCG‑Spec.SCP. - ResultKind?:
U.Set(ofU.Measure).
- SubjectKind:
-
SlotIndex (derived projection from
SlotSpecs/ guard SlotSpecs; usesA.19.CHR:4.2.1SlotKind 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 citeCGSpecSlot.MinimalEvidence),ScoreProfileSlot : ⟨ValueKind = U.Set (of U.Measure), refMode = ByValue⟩.
-
OperationAlgebra (suite stage =
score, perA.19.CHR:4.5; canonical stage‑op =Score):Score(InputProfileSlot, CNSpecSlot, CGSpecSlot, ScoringMethodDescriptionSlot, ContextSlot, MinimalEvidenceSlot?) → ScoreProfileSlot.
-
LawSet (minimum; legality‑first, no hidden scalarization):
- SCP+CSLC legality: any numeric transform used to produce
ScoreProfileSlotMUST be admissible underCGSpecSlot.SCPand CSLC‑lawful (citesG.0+A.18). - ScoringMethod is explicit (no hidden defaults):
ScoreMUST citeScoringMethodDescriptionSlot(edition‑pinned via P2W when reproducibility matters; seeA.19.CHR:4.7.2). If a score is issued, the scoring method 𝒢 (Coordinate→Score) MUST be disclosed as required byC.16(bounded codomain; monotonicity consistent with template polarity). USCM MUST NOT rely on an implicit “default scoring method”. - No implicit normalization:
ScoreMUST NOT silently perform UNM; ifCNSpecSlot.comparabilityrequires normalization‑based comparability, the normalization step MUST be explicit in choreography (Uses/pins), not hidden inScore. - Vector scores allowed; scalarization must be explicit: producing a single scalar score is allowed only if explicitly declared (e.g., by fixing
ScoreProfileSlotcardinality to 1 and citing the lawful transform); partial‑order semantics MUST NOT be silently reduced to a scalar “tie‑breaker”. - Unknown is not coerced: unknown / insufficient evidence MUST NOT be mapped to
0/false; use tri‑state guards and explicit failure behavior.
- SCP+CSLC legality: any numeric transform used to produce
-
AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality/evidence):
ScoreEligibility(InputProfileSlot, CNSpecSlot, CGSpecSlot, ScoringMethodDescriptionSlot, ContextSlot, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.passrequires: (i)CGSpecSlot.SCPis present, (ii)ScoringMethodDescriptionSlotis present (no implicit scoring method), (iii) evidence passesMinimalEvidenceSlot?orCGSpecSlot.MinimalEvidence, and (iv)CN‑Spec.comparabilityrouting is satisfied (incl. explicit UNM when needed).- If
MinimalEvidenceSlotis absent, the guard MUST evaluate evidence againstCGSpecSlot.MinimalEvidence(by explicit rule), and MUST NOT returnpasswhen evidence is missing/unknown. - If
ScoringMethodDescriptionSlotis missing or unpinned/ambiguous under the active planned baseline, the guard MUST returnabstain(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_effonly. -
Γ_timePolicy:
pointby default (no implicit “latest”). -
PlaneRegime: values live on episteme ReferencePlane; on plane crossings apply CL^plane policy; penalties →
R_effonly. -
Audit:
- MUST record:
CNSpecRef.edition,CGSpecRef.edition,ScoringMethodDescriptionRef.edition. - MUST record the effective evidence policy:
- if
MinimalEvidenceSlot?is present → recordMinimalEvidenceRefas effective; - otherwise → cite
CGSpecSlot.MinimalEvidenceas effective.
- if
- SHOULD record the realized
GuardDecisionforScoreEligibility, and (whendegrade/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 whenTransportwas 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).
- MUST record:
Interpretation notes — informative
-
A score profile is a set of measures.
ScoreProfileSlotis aU.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.
ScoreProfileSlotis aU.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 isCGSpecSlot.MinimalEvidence. Failures do not disappear; they must show up asdegrade/abstainand be traceable. -
Crossings are declarative and penalize
R_effonly. When scoring spans contexts or planes, USCM names Bridge+CL/ReferencePlane policies and routes penalties toR_effonly, 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
SCPadmits 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
RiskExposurein this context slice;ScoreEligibilityreturnsdegrade, and the audit records the effective MinimalEvidence policy and the editions ofCNSpecRefandCGSpecRef.
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/abstainoutcomes early. Mitigation: coupledegradewith 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:
-
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.*.) -
SlotKind discipline. SlotKind tokens match the CHR SlotKind lexicon for the roles used (
InputProfileSlot,CNSpecSlot,CGSpecSlot,ContextSlot,MinimalEvidenceSlot,ScoringMethodDescriptionSlot,ScoreProfileSlot). IfScoringMethodDescriptionSlot(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. -
SCP+CSLC legality is enforced. Any numeric transform used to produce score measures is admissible under
CGSpecSlot.SCPand CSLC‑lawful; illicit operations (especially “convenient arithmetic” over non‑lawful scales) are excluded. -
ScoringMethod is explicit and auditable.
ScorecitesScoringMethodDescriptionSlot(edition‑pinned when reproducibility matters). No implicit “default scoring method” is assumed. The disclosed method respects polarity/monotonicity discipline (cf.C.16). -
No implicit normalization.
Scoredoes not silently perform UNM. IfCN‑Spec.comparabilityrequires normalization‑based routing, the normalization step is explicit in choreography (Uses/pins) and auditable. -
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.
-
Unknown and evidence handling is explicit. Unknown / insufficient evidence is not coerced to
0/false. Eligibility usesGuardDecision ∈ {pass|degrade|abstain}and evaluates evidence against the effective policy (MinimalEvidenceSlotoverride orCGSpecSlot.MinimalEvidence). -
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
Auditrefs and pins. -
Transport and plane discipline. Cross‑context and cross‑plane use is declarative (Bridge+CL/ReferencePlane;
CL^planefor plane crossings) and routes penalties toR_effonly. Audit records crossings when invoked. -
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 inheritedScoreop, 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
Scorelegality‑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
ScoringMethodDescriptionSlotand 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.SCPand 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
Notes per row
- USCM does not “implement a particular scoring model”; it preserves a stable, legality‑gated surface on which such models can be wired.
- Calibration is treated as a lawful transform family that must live within SCP+CSLC; the kernel does not mandate a specific calibration method.
- 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.
- 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, specificallySCPandMinimalEvidence).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, specificallycomparabilityrouting and normalization‑based comparability expectations).
-
Used by
A.19.CHR(suite membership and suite protocols; USCM is thescorestage).- Downstream CHR stages that require score measures as inputs (e.g.,
CPM,SelectorMechanism). E.18when USCM instances are used as nodes in a selectedTransformationFlowStructure; the selectedScoringMethodDescriptionRef@edition(…)and other pins live in planned baselines (P2W), while executions surface effective refs/pins viaAudit.
-
Coordinates with
UNMwhenCN‑Spec.comparabilityrequires normalization‑based comparability (explicit choreography, no hidden UNM).ULSAMwhen folding/aggregation is needed as a distinct, explicit step.G.2andGPatternExtensionwiring modules for post‑2015 method families, without mutating the USCM kernel.E.20(governing-pattern discipline) andF.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 inA.19.CHR:suite_protocols;mechanisms[]membership is a set, not an order). - Input surface:
MeasureSetSlot+{CNSpecSlot, CGSpecSlot}+GammaFoldSlot+ContextSlot(+ optionalMinimalEvidenceSlot?override). - Output surface:
AggregatedMeasureSlot(+ optionalContributorSetSlot?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/MinimalEvidenceRefis 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 insidescore/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:
- is explicit (separate from scoring/comparison/selection),
- is scale-lawful and legality-gated (
CSLC+CG‑Spec.SCP), - is Γ‑fold-policy-bound (
CG‑Spec.Γ_foldor explicit override), - is evidence-gated with tri‑state guards (no
unknown → 0/falsecoercions), - is auditable (editions, effective fold, contributor surface),
- preserves kernel stability while allowing SoTA evolution via wiring,
- 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.Intensionshape governed byA.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 emitsAuditpins 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 inA.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 toCG‑Spec.Γ_foldandCG‑Spec.SCP. - ResultKind?:
U.Measure.
- SubjectKind:
-
SlotIndex (derived projection from
SlotSpecs/ guard SlotSpecs; usesA.19.CHR:4.2.1SlotKind 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 citeCGSpecSlot.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_Γ?, perA.19.CHR:4.5; canonical stage‑op =Fold_Γ):Fold_Γ(MeasureSetSlot, CNSpecSlot, CGSpecSlot, GammaFoldSlot, ContextSlot, MinimalEvidenceSlot?) → (AggregatedMeasureSlot, ContributorSetSlot?).
-
LawSet (minimum; explicit, scale‑lawful folding only):
- No hidden aggregation: any Γ‑fold MUST be explicit as
Fold_Γ(no folding hidden insideScore/Compare/Select). - 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. - Γ‑fold legality:
GammaFoldSlotMUST resolve to eitherCGSpecSlot.Γ_foldor an explicitly pinned override (CAL policy) — never an implicit “implementation default”. - Evidence‑gated folding: if evidence is insufficient/unknown, folding MUST follow tri‑state guard behavior and MUST NOT silently coerce.
- Contributor accountability (when produced): when
ContributorSetSlot?is produced, it MUST be a subset of the admitted portion ofMeasureSetSlot, andAggregatedMeasureSlotMUST be the result of applying the effective Γ‑fold to that contributor subset (no “hidden contributors”). - 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.
- No hidden aggregation: any Γ‑fold MUST be explicit as
-
AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality/evidence):
FoldEligibility_Γ(MeasureSetSlot, CNSpecSlot, CGSpecSlot, GammaFoldSlot, ContextSlot, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.passrequires: (i)CGSpecSlotprovides the legality surface (SCPandΓ_fold), (ii)GammaFoldSlotis admissible underCGSpecSlot.Γ_foldrouting (or explicit override), and (iii) the measure set is admitted (perCNSpecSlot.acceptance) and scale‑compatible for the intended fold.- Define
EffectiveMinimalEvidence := (MinimalEvidenceSlot if present, else CGSpecSlot.MinimalEvidence); the guard MUST evaluate evidence againstEffectiveMinimalEvidence. - If evidence is missing/unknown under
EffectiveMinimalEvidence, the guard MUST NOT returnpass(returndegradeorabstainper 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
CGSpecSlotprovides the legality surface (Γ_foldandSCP) (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_effonly. -
Γ_timePolicy:
pointby default; time‑fold requires explicit windowing policy (if an explicit operator is needed, introduceFoldTime_Γas an⊑⁺extension usingGammaTimeRuleSlotfrom the CHR SlotKind Lexicon). -
PlaneRegime: values live on episteme ReferencePlane; on plane crossings apply CL^plane policy; penalties →
R_effonly. -
Audit:
- MUST record:
CNSpecRef.edition,CGSpecRef.edition, and the effective Γ‑fold (ΓFoldRef). - If
GammaFoldSlotresolves via an explicit override, SHOULD record the override’spolicy-id(or its stable ref) alongsideΓFoldRef. - When
MinimalEvidenceSlot?is present, MUST recordMinimalEvidenceRef; otherwise MUST citeCGSpecSlot.MinimalEvidenceas 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
Transportwas invoked. - SHOULD record: the evaluated
GuardDecision(especially when notpass) and, when applicable, the effective evidence policy / failure behavior reference used to justifydegrade|abstain.
- MUST record:
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:
GammaFoldSlotMUST be resolvable toCGSpecSlot.Γ_foldrouting 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+SelectorMechanismoperate 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
Γ_timePolicyand allows time-fold only via explicit windowing policy. If a project needs an explicitFoldTime_Γoperator, introduce it as an⊑⁺extension consistent withA.6.1:4.2.1(no mutation of inherited ops; no SlotKind drift).- Use the suite lexicon token
GammaTimeRuleSlotfor the additional windowing rule input; do not overloadContextSlotorGammaFoldSlotto smuggle time semantics.
- Use the suite lexicon token
Archetypal grounding (didactic, informative)
Tell
- In CHR, ULSAM exists to keep the stage
fold_Γ?explicit: if a pipeline wants folding, it invokesULSAM.Fold_Γ; otherwise it skips the stage. Folding MUST NOT be smuggled intoUSCM.Score,CPM.Compare, orSelectorMechanism.Select. - In
U.Systemdecision 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.Epistemecontexts: 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.
- A CHR pipeline produces a set of admitted measures (post-
USCMor directly from characteristic measures):MeasureSetSlot = {m₁, m₂, …, m_k}. - The team wants a single “readiness” measure
m_readyto be used as an input to later comparison/selection. The temptation is to “just average” or “just do weighted sum”. - ULSAM forces three explicit questions before folding:
- Legality: Is the fold admissible under
CGSpecSlot.SCP(units/scale) andCGSpecSlot.Γ_fold(declared fold kinds)? - Evidence: Is the evidence posture sufficient under
MinimalEvidence? If not, do wedegradeorabstain? - Policy identity: What is the identity of the fold (which ΓFoldRef, which edition)?
- Legality: Is the fold admissible under
- Only then, the pipeline performs:
Fold_Γ(MeasureSetSlot, CNSpecSlot, CGSpecSlot, GammaFoldSlot, ContextSlot, MinimalEvidenceSlot?) → (AggregatedMeasureSlot, ContributorSetSlot?). The audit recordsΓFoldRefand (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_effonly. 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.Γ_foldand 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)
Common anti-patterns (didactic, informative)
Consequences (didactic, informative)
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 E.18 transformation-flow structures: ULSAM appears as a mechanism instance node whose
ΓFoldRef/MinimalEvidenceRefare 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.Intensionshape;U.MechAuthoring; CC‑UM discipline).A.6.5(slot discipline; SlotIndex as a projection).A.19.CHR(CHR suite boundary; stagefold_Γ?; CHR SlotKind Lexicon).G.0(CG‑Spec.Γ_fold,CG‑Spec.SCP,CG‑Spec.MinimalEvidence; legality gate).A.18(CSLC).B.3(Γ‑fold defaults forR_eff, including WLNK; trust skeleton).
Relates to (coordination, not governing-pattern assignment).
A.19.CN(CN‑Spec), viaCNSpecSlot.acceptancegating in admissibility.A.19.UINDM,A.19.USCM,A.19.CPM, andA.19.SelectorMechanismas 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.
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.IntensionforCPM.IntensionRef(CHR suite stagecompare). Mechanism-intension semantics are governed by explicitly designated governing patterns (E.20).A.6.1governs the template ofU.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 toA.19.CPM:4.1, while preserving the original section headings and their publicPatternId:SectionPathIDs 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 byCG‑Spec.ComparatorSet? -
Legality is declared: do we cite
CG‑Spec(andSCPwhen numeric ops exist) and treat violations asdegrade|abstain? -
Evidence is not faked: are missing/unknown inputs routed to
degrade|abstainunder the effective MinimalEvidence policy (never topass)? -
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 inA.19.CHR:4.5, not in themechanisms[]enumeration). -
Input (conceptual): left profile, right profile,
CN‑Spec,CG‑Spec, an explicitComparatorSpec, context slice; optional explicitMinimalEvidenceoverride. -
Output (conceptual):
ComparisonResultSlotas a set of relation/poset tokens (not a single scalar, and not an embedded selection decision). -
P2W seam: concrete
ComparatorSpecRef.editionand 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 inAudit. -
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.
- does not normalize (
-
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
ComparatorSpecand 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’sSelectorMechanism. 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.Intensionsense, perA.6.1/ slot disciplineA.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‑Specand legality is gated byCG‑Specrather 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
- Usability vs correctness: engineers want a “simple compare” function; correctness demands explicit legality, explicit comparator choice, and explicit handling of incomparability/unknown.
- Total order convenience vs partial order truth: total orders simplify downstream selection; partial orders are often the faithful representation (especially in multi‑criteria settings).
- Evolvability vs stability: comparator methods evolve (SoTA churn); kernel semantics and slot surfaces must remain stable and wiring‑friendly.
- Auditability vs speed-of-discussion: teams want fast decisions; FPF requires audit pins and explicit edition/policy references for reproducibility.
- 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”.
- Avoiding “second centers of gravity”: mechanism semantics must have a governing pattern; otherwise the suite,
A.6.1archetypes, 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, andCG‑Spec.SCPwhen 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;
SelectorMechanismconsumes them.
This pattern defines (governing-pattern, wiring‑friendly):
- a stable mechanism boundary for lawful comparison:
Compare(...) → ComparisonResultSlotplus a tri‑stateCompareEligibilityguard; - a stable SlotKind surface (by suite lexicon tokens) that downstream selection and Part‑G wiring can rely on without SlotKind drift;
- a legality/evidence responsibility split: legality is gated by
CG‑Spec(and CSLC), while admission/comparability routing is cited fromCN‑Spec; - a minimal audit-pin requirement: what pins/editions MUST be recorded to make a comparison replay‑grade;
- 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.Intensionshape (A.6.1). It does not publish/telemetry, does not publishGateDecisionnorDecisionLogsurfaces (gate‑only), and does not embed selection. It emitsAuditpins 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 inAudit.
- 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 +
-
IntensionHeader:
id = CPM,version = 1.0.0,status = stable. -
IntensionRef:
CPM.IntensionRef(canonical target for the suite member named inA.19.CHR:4.2). -
SignatureManifest (optional; importability): if a CPM publication is intended for reuse beyond the CHR suite, author SHOULD publish a
SignatureManifestthat records (i) the declaredComparestage‑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).
- SubjectKind:
-
SlotIndex (derived projection from
SlotSpecs/ guard SlotSpecs; usesA.19.CHR:4.2.1SlotKind 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 citeCGSpecSlot.MinimalEvidence),ComparisonResultSlot : ⟨ValueKind = U.Set (relation/poset tokens), refMode = ByValue⟩.
-
OperationAlgebra (suite stage =
compare, perA.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):
- ComparatorSet gate:
ComparatorSpecSlotMUST be an element ofCGSpecSlot.ComparatorSet(legality gate; citeG.0). - Set‑valued semantics:
ComparisonResultSlotis set‑valued (parity/poset tokens); partial orders remain partial — no silent totalization/scalarization. - CSLC+SCP legality: any numeric ops implied by the comparator MUST be admissible under
CGSpecSlot.SCPand CSLC‑lawful (citeG.0+A.18). - Unknown is not coerced: missing/unknown evidence MUST NOT be mapped to a comparison outcome; use tri‑state guards.
- No hidden thresholds/tie‑breakers: any thresholds, epsilons, priority orders, or tie‑break logic MUST live in the declared
ComparatorSpecSlot(or inCNSpecSlot.acceptanceas explicit acceptance clauses), edition‑pinned and auditable; CPM MUST NOT smuggle constants. - No implicit UNM: CPM MUST NOT perform normalization/alignment internally. If
CNSpecSlot.comparabilityroutes comparison through normalization‑based invariants,CompareEligibilityMUST treat “inputs are already normalized to the declared invariants” as a precondition forpass(otherwisedegrade|abstainper policy). Any UNM dependence MUST be explicit upstream and auditable.
- ComparatorSet gate:
-
AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality/evidence):
CompareEligibility(LeftProfileSlot, RightProfileSlot, CNSpecSlot, CGSpecSlot, ComparatorSpecSlot, ContextSlot, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.passrequires: (i)ComparatorSpecSlot ∈ CGSpecSlot.ComparatorSet, (ii) any comparator‑implied numeric ops are admissible underCGSpecSlot.SCPand CSLC‑lawful for the effective measure scales, (iii) both profiles are admitted/comparable underCNSpecSlot.comparabilityandCNSpecSlot.acceptancefor the givenContextSlot, and (iv) evidence satisfies the effective MinimalEvidence policy (explicit override viaMinimalEvidenceSlot?, otherwiseCGSpecSlot.MinimalEvidence).- If
CNSpecSlot.comparabilityis normalization‑based (compare‑on‑invariants),passadditionally requires that the inputs are already in the required invariants/normalization regime; CPM MUST NOT “make them comparable” by silent normalization. - If
MinimalEvidenceSlotis absent, the guard MUST evaluate evidence againstCGSpecSlot.MinimalEvidence(by explicit rule), and MUST NOT returnpasswhen 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 frommechanisms[].
- Intended to be used as the CHR stage
-
Transport: Bridge+CL/ReferencePlane only; penalties route to
R_effonly. -
Γ_timePolicy:
pointby default (no implicit “latest”). -
PlaneRegime: values live on episteme ReferencePlane; on plane crossings apply CL^plane policy; penalties →
R_effonly. -
Audit:
- MUST record:
CNSpecRef.edition,CGSpecRef.edition, and the effective comparator (ComparatorSpecRef). - When
MinimalEvidenceSlot?is present, MUST recordMinimalEvidenceRef; otherwise MUST citeCGSpecSlot.MinimalEvidenceas the effective evidence policy. - SHOULD record: the realized
GuardDecisionforCompareEligibility, and (whendegrade/abstain) any referenced failure‑behavior / downstream‑handling policy ids (e.g., a SoS‑LOG branch id) when such policies are in scope. - If
CNSpecSlot.comparabilityroutes 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
ComparisonResultSlotand any Bridge/CL/ReferencePlane ids whenTransportwas invoked.
- MUST record:
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
ComparatorSpecdefines 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.comparabilityroutes 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 declaredCG‑Specthat lists lawful comparators inComparatorSetand evidence rules inMinimalEvidence. -
The comparator chosen is explicit:
ComparatorSpecSlot = ParetoDominanceComparatorSpecRef@edition(declared inCG‑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
degradeorabstain(per evidence policy), and theComparisonResultSlotpreserves the partial nature of the relation.
-
The downstream
SelectorMechanismcan 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.
USCMproduces 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) inCG‑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
ComparatorSpecrecords 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_effonly), 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):
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 inUSCM; CPM returns relation tokens (set‑valued). If a numeric comparator is desired, it must be an explicitComparatorSpecand 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
ComparatorSpecReffromCG‑Spec.ComparatorSetand record it in Audit. -
Anti‑pattern: “GateDecision leakage.” Symptom: the
comparestep 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/ComparisonResultSlotacross 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_effonly; 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
- Set‑valued by design: partial orders are common in multi‑criteria settings; pretending they are total creates false certainty and brittle decisions.
- ComparatorSet gating: declaring what comparisons are legal (and under what scale/evidence rules) prevents “algorithm by convenience”.
- Tri‑state guards: explicit
pass|degrade|abstainpreserves epistemic honesty: unknown is not silently converted into an outcome. - Strict distinction: separating compare from score and select prevents hidden semantic coupling and improves evolvability (methods change via wiring; kernel stays stable).
- 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.
Relations
Builds on / cites (non‑exhaustive):
A.6.1(shape ofU.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(project transformation-flow structures 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, andSelectorMechanism.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.IntensionforSelectorMechanism.IntensionRef(CHR suite stageselect). Mechanism-intension semantics are governed by explicitly designated governing patterns (E.20:4.2).A.6.1governs the template ofU.Mechanism.Intensionand theU.MechAuthoringdiscipline; 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.1or suite prose inA.19.CHR) SHALL be reduced to a Tell + Cite stub pointing toA.19.SelectorMechanism:4.1, while preserving the original section headings and their publicPatternId:SectionPathIDs 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
UNSELMname token), dock them viaF.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.2packs and wiring modules; the kernel signature stays stable and teachable. - Suite stage:
select(ordering lives only inA.19.CHR:4.5/suite_protocols; suite membership is a set inA.19.CHR:4.2). - Inputs (conceptual):
CandidateSetSlot+ComparisonResultSlot(lawful relation/poset tokens, typically produced byCPM) +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 inAudit. - Transformation-flow use: when used as a node type in
E.18, 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 topass. - Mental model:
SelectEligibilitygates the step;Selectapplies 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
PortfolioModefields 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
degradeorabstain. - Boundary erosion: selection quietly performs comparison, scoring, aggregation, or publishing, making the CHR pipeline opaque and hard to reason about.
Forces
-
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.
-
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.
-
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.
-
Evidence discipline vs delivery pressure. Under uncertainty, teams default to coercion (unknown → pass). The kernel must enforce tri‑state eligibility and fail‑closed discipline.
-
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.
-
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.
-
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
GateDecisionor decision logs inside the mechanism boundary. -
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.Intensionshape governed byA.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 emitsAuditpins and a tri‑state guard only. -
Canonicality note: this is the canonical
U.Mechanism.IntensionforSelectorMechanism.IntensionRefand 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 inA.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.
- SubjectKind:
-
SlotIndex: derived projection from
SlotSpecs(and any guard‑only SlotSpecs) per slot discipline; usesA.19.CHR:4.2.1SlotKind 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 viaSelectEligibility), 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 replaceCNSpecSlot/CGSpecSlotgoverning 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 isCGSpecSlot.MinimalEvidence.SelectionSlot : ⟨ValueKind = U.Set (selected set), refMode = ByValue⟩.
-
OperationAlgebra suite stage =
select, perA.19.CHR:4.5; canonical stage op =SelectSelect(CandidateSetSlot, ComparisonResultSlot, CriteriaSlot, CNSpecSlot, CGSpecSlot, ContextSlot, TaskSignatureSlot?, MinimalEvidenceSlot?) → SelectionSlot.
-
LawSet (minimum): the selection kernel is set‑returning and policy‑bound
- Set‑returning by default: a conformant
SelectMUST 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). - No hidden thresholds/constants: a conformant publication MUST NOT smuggle thresholds, weights, dominance rules, or tie‑breakers. Selection‑level commitments MUST be explicit in
CriteriaSlotand/or in explicit policy routing exposed throughTaskSignatureSlot. Admissibility/acceptance thresholds are applied only viaSelectEligibilityusingCNSpecSlot.acceptanceand the effective evidence policy (MinimalEvidenceSlot?orCGSpecSlot.MinimalEvidence). - No hidden scalarization: a conformant publication MUST consume
ComparisonResultSlotas 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. - Evidence gating is explicit: when selection depends on evidence, it MUST cite either
MinimalEvidenceSlot(override) or the effective policyCGSpecSlot.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. - No competing defaults:
PortfolioMode/dominance defaults (when relevant) MUST be sourced from their declared governing patterns (typically viaTaskSignatureSlotrouting and/or the selector conformance/default rules inG.5), and MUST NOT be re‑declared inside the kernel.
- Set‑returning by default: a conformant
-
AdmissibilityConditions (tri‑state guard; fail‑closed on missing legality or evidence)
SelectEligibility(CandidateSetSlot, ComparisonResultSlot, CriteriaSlot, CNSpecSlot, CGSpecSlot, ContextSlot, TaskSignatureSlot?, MinimalEvidenceSlot?) → GuardDecision ∈ {pass|degrade|abstain}.passrequires at minimum: (i)ComparisonResultSlotis compatible withCandidateSetSlot(same candidate universe), (ii) all selection criteria and any tie‑breakers are explicit (viaCriteriaSlotand/orTaskSignatureSlot), (iii) admissibility/acceptance gates (CNSpecSlot.acceptance, evidence) do not fail, and (iv)CNSpecSlotandCGSpecSlotare coherent for the comparison tokens being consumed (no mixed CN-Spec/CG-Spec pairings).- If
MinimalEvidenceSlotis absent,SelectEligibilityMUST evaluate evidence againstCGSpecSlot.MinimalEvidenceby explicit rule, and missing/unknown evidence MUST NOT yieldpass. degradeis permitted only when an explicit, auditable failure behavior exists (policy‑bound), e.g., “exclude ineligible candidates” or “sandbox/probe‑only”;abstainis 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_effonly. -
Γ_timePolicy:
pointby 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_effonly. -
Audit:
- Must record:
CNSpecRef.edition,CGSpecRef.edition. - If
TaskSignatureSlot?is present, must recordTaskSignatureRef.edition. - If
MinimalEvidenceSlot?is present, must recordMinimalEvidenceRef; otherwise must citeCGSpecSlot.MinimalEvidenceas 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
CandidateSetSlotandComparisonResultSlotor a citable upstreamAuditanchor 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;
TaskSignatureRefwhen used). - SHOULD record: the realized routing‑relevant selector defaults (e.g.,
PortfolioMode/ dominance regime) when they are not fully determined by a referencedTaskSignatureRefor an explicit CAL policy surface; the point is auditability, not re‑declaring defaults. - SHOULD record: any Bridge/CL/ReferencePlane ids when
Transportwas invoked.
- Must record:
Boundary and layering rules
-
Selection consumes upstream CHR products, it does not invent them.
ComparisonResultSlotis an input: the kernel MUST NOT perform normalization (UNM), indicatorization (UINDM), scoring (USCM), folding (ULSAM), or comparison (CPM) insideSelect. If a scalar “overall score” is desired, it must be declared upstream as a lawful scoring and/or comparator choice, not invented inside selection. -
Threshold discipline (acceptance ≠ selection). Acceptance/admission thresholds are not selection criteria: they live in
AcceptanceClauses/TaskSignature/GateProfilerecords perA.19.CHR:4.3.5and are applied only viaSelectEligibility. 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. -
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 asG.10orPTM, not as hidden tails inside selection. -
Specializations are explicit and disciplined. Any refinement or extension of
SelectorMechanismmust followA.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.
-
P2W seam is preserved. Planned bindings for
TaskSignatureRef@edition,CGSpecRef@edition, evidence policy overrides, and other pins live in WorkPlanning (P2W). Execution visibility is viaAudit, 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} -
ComparisonResultSlotincludes tokens such as:OptionA ≼ OptionBon latency,OptionB ≼ OptionAon cost,OptionCincomparable with both on risk evidence (missing attestations).
-
CriteriaSlotcontains explicit clauses:- “return all non‑dominated candidates under ParetoOnly,”
- “candidates missing required evidence must not pass.”
-
MinimalEvidenceSlot?is absent, so evidence is evaluated againstCGSpecSlot.MinimalEvidence.
Outcome.
SelectEligibilityreturnsdegrade(orabstain, depending on the declared failure behavior) becauseOptionCfails evidence gating; selection excludesOptionCunder an explicit policy route rather than coercing unknowns.SelectionSlotreturns{OptionA, OptionB}as a selected set, rather than forcing a single winner.AuditrecordsCGSpecRef.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} -
ComparisonResultSlotis produced by lawful comparison on declared indicators and evidence gates. -
TaskSignatureSlotis present and is the single routing slot/ref for policy defaults:PortfolioModeand dominance regime,- budgeting/telemetry hooks (when used).
-
CriteriaSlotdeclares that diversity signals are telemetry unless explicitly promoted by policy.
Outcome.
SelectionSlotreturns a selected set; any archive‑style behavior is a specialization and policy choice, not a hidden kernel default.AuditrecordsTaskSignatureRef.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
TaskSignatureSlotwhen 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/abstainearly. 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
Common Anti-Patterns and How to Avoid Them — informative
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/abstainuntil 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:
- Technical integrity: it enforces legality and evidence discipline at the decision boundary without smuggling heuristics.
- 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)
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.2packs 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.5and 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 mutatingSelect. - 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.1andCC‑UM.*for the mechanism intension shape and specialisation-chain discipline.A.19.CHRfor suite membership, suite protocol closure, SlotKind lexicon, and threshold and default discipline.G.0forCG‑Speclegality and evidence surfaces.A.19.CNforCN‑Specgovernance card used as an explicit input.C.22forTaskSignatureas a policy-routing artifact when used.A.6.5for slot discipline (SlotIndex as projection; SlotKind invariance).A.15.3+A.19.CHR:4.7.2for the P2W planned baseline seam for edition/policy pin bindings (cited as seam, not duplicated in Intension).
-
Used by
A.19.CHRas the canonicalselectstage in CHR pipelines.G.5as the primary conformance and specialization context for selector-based method dispatch andPortfolioModepolicies.E.18when selector instances are used as transformation-flow structure nodes; planned pins live in P2W, effective pins surface viaAudit.
-
Coordinates with
CPMand other lawful comparison stages as producers ofComparisonResultSlot.ULSAMand other lawful aggregation stages that must remain explicit rather than hidden inside selection.E.20governing-pattern discipline andF.18alias docking for Phase‑3 canonicalization and ID continuity.
A.19.SelectorMechanism:End
U.Flow.ConstraintValidity — Eulerian
Type: Architectural (A) Status: Stable Normativity: Normative for flow valuations used by
E.18TransformationFlowStructureunder the Eulerian operational interpretation.
Tech-name. U.Flow.ConstraintValidity (U.Flow genus)
Plain-name. Flow constraint validity (Eulerian interpretation)
Intention
One‑liner Defines cross-cutting ConstraintValidity rules for flow valuations used by E.18 TransformationFlowStructure. Transformation-flow loci may refine CV class specializations for locus-specific semantics (species-binding only; genus rules remain unchanged). The CV core is locus-kind-agnostic and assumes an open-world catalogue of locus species; the enumeration of locus kinds in E.18 is a minimum locus baseline.
Operational interpretation. Eulerian interpretation: 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 GateProfile 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 practitioner move made available by the local CV result. Add publication lexemes, witnesses, DecisionLog detail, CrossingBundle, PQG, RSCR, or MIP-run material only when the CV claim being made 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. Use the neighboring pattern relation only when its own claim 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 interpreted 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 attempted stronger use without a governing relation and name the governing neighboring relation only if that relation is being claimed: A.21 for gate decision, B.3 for assurance, A.10 for evidence or currentness, A.15 for work, or the neighboring pattern governing that claim. 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 bounded CV use, source relation, evidence, gate, assurance, work, decision, or neighboring-pattern relation.
Common wrong interpretation. 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 belongs to its governing pattern only when that claim 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 the attempted stronger use without a governing relation and name and use the governing relation for that attempted claim rather than treating the label as release authority.
Same problem, different question under repair. For a transformation-flow-looking problem, use E.18 for graph value, flow valuation, or crossing relation, A.20 for internal step validity, A.21 for gate-decision publication, and E.20 for mechanism-meaning placement; do not apply the other three until their own claim is present.
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 available for the local CV use. Do not stop at a classification of vocabulary or publication faces.
Locus and relation separation. Keep the graph value and graph 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 or G.6), work plan or work occurrence (A.15), and mechanism-governing definition assignment (E.20) distinct. An MVPK face, DecisionLog, evidence value, 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 locus for the claim being made: 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, PathSlice, CV, gate, or mechanism-definition locus when the smaller locus is enough.
Ordinary success. For ordinary A.20 use, success is that the applicable CV class, CV.Status, and witness or refusal are placed for the step without implying gate passage, comparator-use claim, freshness, or launch readiness. A full conformance review is needed only when the consuming neighboring claim uses 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, E.18 Check locus 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 applicability. Always core for A.20: step, applicable CV class, CV.Status, and witness or refusal. Conditional fields: GateCheckRef(aspect=ConstraintValidity), MVPK face pins, bridge and UTS refs, comparator or set-return refs, refresh refs, and SquareLaw or retargeting witnesses; include them only when the corresponding publication, gate, bridge, comparator, refresh, or StructuralReinterpretation claim is being made.
Retrieval trap guard. When excerpted alone, A.20 must not be interpreted 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-use claim, 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-use claim, 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 applicability relation plus CV.Status for later neighboring claims, not only an assurance stop.
What goes wrong if missed. A practitioner may treat internal constraint satisfaction as gate passage, launch readiness, freshness, comparator-use claim, or decision reuse. That collapses CV into GateFit and hides the A.21 gate decision relation.
What this buys. A.20 lets a practitioner keep the step-local mechanism constraint and CV.Status local to the step and use A.21 only when gate fit or gate decision aggregation is really the question under repair.
Not this pattern when. If the question is GateProfile fit, gate decision, gate-decision reuse, gate explanation, or pass or fail gate publication, use A.21. If the question is graph crossing or flow valuation, use E.18. If the question is comparator use, set-return, archive, or refresh policy, use the current neighboring loci named in Relations.
Problem frame
In E.18, transformation-flow loci are graph-positioned loci for atomic U.Transformation values and transformation-adjacent governed slot fillers, and the graph uses a single edge kind (U.Transfer). A locus relation may be expressed as a morphism only when the mathematical lens is current; that lens is not the locus kind. 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 (declared domains and ranges, invariants, units coherence, and Lipschitz-bound or stability claims) are mistaken for
GateProfilefit; - 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, or comparators or depends on a declared GateProfile, then it is treated as GateFit at gates and the CV explanation does not apply.
Forces
- Separation of concerns. Internal mechanism laws are distinct from external
GateProfilefit. - Auditability. MVPK faces include pins and 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 and Plain registers, registered tokens.
Solution
Intent and scope
Method and mechanism slot guard. In A.20, mechanism names the law-governed operation structure for the step: signature, operation algebra, law set, applicability, guards, transport, audit, and realization relation. method appears only when a method-position claim is being made or when a bound-derivation technique or method description is being cited. A shared source label, project-side name, or recognizable change concern may require linked method and mechanism typed values, but CV records the step-local mechanism constraint, CV.Status, and witness or refusal; A.3.1 and A.3.2 govern the method claim or method-description claim.
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 GateProfile fit (publication follows MVPK without adding new numeric claims). Where CV refers to mechanism AdmissibilityConditions, 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 step signature and, when the step has mechanism-governed semantics, its mechanism-governing definition. The canonical CV classes are genus-scoped and non-exhaustive:
MechanismUnitsCoherence, LawSetInvariants, AdmissibilityConditionsSatisfaction, LipschitzBounds, TypeDomainRange, and—only for StructuralReinterpretation—ReinterpretationEquivalence (correspondence and reversibility witness).
Species binding (E.18 transformation-flow family). The above classes bind to the E.18 locus baseline {Transformation, Signature, Mechanism, WorkPlanning, Work, Check, StructuralReinterpretation} with OperationalGate = Check locus; 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 when the CV claim is present.
Out-of-scope (CV): declaring or translating ReferencePlane, Units, or ComparatorSet; CSLC comparability beyond internal step preservation; Freshness; Role and 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 being claimed.
Primary EntityOfConcern and CV classes
Genus. U.Flow leaves step-kinds abstract; CV and GateFit separation applies to any declared instantiation.
Species (E.18 transformation-flow family). E.18 loci bind to {Transformation, Signature, Mechanism, WorkPlanning, Work, Check, StructuralReinterpretation}; this set is a minimum locus baseline defined in E.18. The species space (e.g., UNM declaration and use, SelectionAndTuning, WorkPlanning, EvaluatingAndRefreshing, …) is open-world and non-exhaustive. OperationalGate is the Check locus. StructuralReinterpretation is projection-preserving (no mutation of ⟨L,P,E⃗,D⟩) and may retarget EntityOfConcernRef under CC-TFS-06-EX; see E.18 and A.6.4.
AdmissibilityConditionsSatisfaction — If the declared admissibility conditions hold on the step’s inputs and context, then the CV explanation applies; otherwise this explanation does not apply.
LipschitzBounds — If inputs vary within the stated domain (X) and perturbations or noise (≤ ε), then the step’s estimate remains within δ of the reference; otherwise this explanation does not apply.
MechanismUnitsCoherence and TypeDomainRange — If units, types, and 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 and witness lexicon (E.10 discipline). In CV scope, publications use Status and 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 interpreted through
KindBridge (CL^k)on UTS underF.9,F.17,E.17,E.18, andC.3.3when the retargeting or bridge claim is present. CV does not declare or translate planes, units, or comparators. - Retargeting witness binding. For an E.18
StructuralReinterpretationlocus, the CV classReinterpretationEquivalenceSHALL carryCV.WitnessRef := ReinterpWitnessover the addressedPathSliceId; the UTSSquareLaw-retargetingwitness is referenced from MVPK and UTS material and linked from the CV witness without duplication. ReinterpWitnessrecord 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 under the selected MVPK profile, without weakening checks):
- CtxState pins.
⟨L,P,E⃗,D⟩on ports and tokens; rawU.Transferpreserves them. - Path pins.
PathIdandPathSliceIdappear where slice-local refresh or reinterpretation witnesses are relevant; valuation semantics are carried byE.18plusA.20, withG.11when refresh wiring is present. - CV pins.
CV.Status ∈ {abstain, pass, degrade, block},CV.WitnessRef?(refs only). - Edition pins. If a face cites
CG-Spec,ComparatorSet, orUNM.TransportRegistryPhi, the face includes the compatibility reference (BridgeCard + UTS row, withCLandCL^plane) underF.9,F.17,E.17, andE.18for later use. A.20 references this requirement; it does not introduce or modify Bridge and UTS formats. - Face scope. Each face includes
PublicationScopeIdwith an MVPK profile value ofMin,Lite,SetReady, orMax— 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 work-occurrence 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 being claimed.
GateChecks (table) — CV only
Activation predicate (in E.18 transformation-flow structures). Until aggregated CV.Status=pass, all GateFit checks return abstain (CV=>GF).
Role and 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.
SWP matrix (declaration-locus discipline)
- Writes (faces).
CV.Status(and optionalCV.WitnessRef) only. - Referenced editions (ref-only). Any
CG‑Spec,ComparatorSet, orTransportRegistryΦeditions (when referenced); their declarations remain governed by the UNM declaration locus per CC-TFS‑24.
CtxState and GateCrossing
- Crossings only at
OperationalGate(profile)(plane, unit, or context) with a strict exception forStructuralReinterpretation: 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 and UTS material, and the retargeting is PathSlice‑local (PathSliceIdpinned). - 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. Interpret those terms throughA.6.4,C.2.1,C.2.P, and the relevant UTSKindBridge (CL^k)rows underF.9,F.17,E.17,E.18, andC.3.3when the retargeting or bridge claim is present. - Projection and EntityOfConcernRef retargeting normalization (CV use only). In that imported interpretation, projection is a change of published view coordinates only, and
EntityOfConcernRefis a Kind-channel change underCL^k. A “no unit or plane change” test SHALL verify thatReferencePlane(src)=ReferencePlane(tgt)andCL^planeis absent (or= ⊤), otherwise the step is a gated crossing. - Assurance operations on edges.
ConstrainTo,CalibrateTo,CiteEvidence, andAttributeToreside onU.Transferand do not alter⟨L,P,E⃗,D⟩; plane or unit changes occur only at gates; Φ andCL^planepenalties appear in R-lane. EntityOfConcernRef retargeting through the kind channel is recorded asKindBridge (CL^k)on UTS underF.9,F.17,E.17,E.18, andC.3.3; under CC-TFS-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.
Inconsistencies lead to degrade or block per applicable GateProfile (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:
- identifies
PathSliceIdandPublicationScopeId; - 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 and Get‑Put laws; - enumerates the commuting squares for the cut‑set edges considered (ids of transfers before and after the retargeting);
- declares properties (invertible?, idempotent?) and the definedness area;
- cites the UTS.RowId and links the DecisionLog entries that rely on this witness. Realizations via profunctor optics (post‑2017) are permitted; the optic laws, including lens laws when the selected optic is a lens, 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 and Get‑Put obligations over mechanism state (not faces);
— a list of commuting squares for the adjacent raw transfers (before and 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 and 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 and PathSlice (PathSlice-local refresh)
-
Flows are valuations over
U.Transfer, re-emitting slice-locally under explicit refresh rules or edition bumps carried throughE.18,A.20, andG.11when refresh wiring is present. CV contributes to the prepare and refresh conditions but does not expand scope beyond the addressedPathSliceId. -
Delimitation and planning (normative). A
PathSlicecloses on: (i) any pinned edition change, (ii) Γ‑window boundary relevant to the face, (iii)GateProfilechange along the addressedPathSlice, or (iv) an explicit sentinel rule. Concurrency: at most one active recompute per{PathSliceId}; parallel recomputes are permitted across distinctPathSliceIds. -
CV‑triggered refresh (minimum list). Re‑emit the addressed
PathSliceIdwhen any holds: (a)CV.Statuschanges across the lattice; (b)ReinterpWitnessis added, updated, or withdrawn; (c)AdmissibilityDecl.editionorLipschitzBoundRef.editionchanges; (d) updates arrive fromF.9,F.17,E.17, orE.18bridge and UTS loci, or fromA.19.SelectorMechanism,C.18,C.19,G.5, orG.11comparator and refresh loci; (e) error or timeout transitions toCV.Status=passfor a previouslyabstainordegradeCV 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 an error or timeout transition todegradeorblockunderGateProfilerules); (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,ΦandΨpolicy ids) underF.9,F.17,E.17, orE.18; (CVRefreshTrigger.ReferencedEditionChange) edition changes referenced by comparator or selection loci on the slice (A.19.SelectorMechanism,C.18,C.19,G.5, orG.11when the comparator or selection claim is present) (ComparatorSetRef.edition,DescriptorMapRef.edition,DistanceDefRef.edition, …); (CVRefreshTrigger.FreshnessTicketChange) FreshnessTicket or freshness or currentness relation changes that alter the slice window underA.21,B.3, orG.11when the freshness or currentness claim is present;(
CVRefreshTrigger.SentinelRule) sentinel rules explicitly attached to the PathSliceId. Scheduling is slice‑local; recompute does not fan‑out beyond the addressedPathSliceId.Id‑scheme:
PathSliceId := PathId × Γ_time selector × ReferencePlane × SentinelFingerprint × IterationCounter. Locking for replay: within a recompute, the effectiveE⃗is frozen; outputs carry a replay fingerprint resolvable viaDecisionLog.
ReturnShape and CSLC (comparability discipline)
When a comparable, set-valued, archive, or partially ordered return shape is declared for the step, CV checks that the step did not internally destroy that return shape; no hidden scalarization. If no declared return shape is being claimed, do not create 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 use, ranking, selection, archive semantics, and refresh remain with A.19.SelectorMechanism, C.18, C.19, G.5, G.11, or GateFit (A.21) when those claims are present. 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 or 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 declared scale policy, units, or invalid-operation notes;
(H4) cross‑plane or cross‑unit numeric combination without a Bridge+UTS row;
(H5) for StructuralReinterpretation, any change of return plane or units (violates “projection‑only”).
Failing (H1–H5) degrades or blocks per GateProfile (§4.4 and CC-TFS‑21a).
Γ‑windows and 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. UseA.21,B.3,C.27, orG.11when a 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_cvand the Γ selector it assumed; replay bindst_cvtoPathSliceId. - 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, and WLNK‑safe. Units and time scales SHALL be explicit. Overrides of the default weakest‑link fold SHALL cite CAL proofs of monotonicity and boundary behavior.
Unknown, timeout, and error policy
Each CV class yields one CV.Status value: abstain, pass, degrade, or block. Errors and 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 (GateProfile-bound, normative): Lean and Core ⇒ error or timeout maps to degrade, SafetyCritical and RegulatedX ⇒ error or timeout maps to block; unknown folds per GateCheck policy (safety‑default: degrade). (Consistent with CC-TFS‑22.)
Idempotency and 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 when an A.10 evidence path visibility or refresh-implication claim is present. 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 and 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, and 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 GateProfile fit still belong outside CV.
Show‑0 (CV.Status=pass, no gate relation).
A normalization step has declared units, domain and range, and invariant refs; the CV check returns CV.Status=pass with a CV.WitnessRef. No comparison, launch, crossing, freshness, or GateProfile-fit claim is present, so no GateDecision, GateFit narrative, or DecisionLog is created. The only A.20 result is: 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 and flags units coherent), (ii) LawSetInvariants (reproducible outputs under same E⃗), (iii) Admissibility (inputs well-typed), and (iv) optional Lipschitz or 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 and 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) when those claims are present. Edition-aware pins on faces carry DescriptorMapRef.edition only with Bridge+UTS.
Practice references. Algebraic effects and handlers separate signatures from handlers (Koka and Effekt, 2015+); reproducible pipelines isolate mechanism constraints from release or deployment criteria (Bazel and Nix); optics, profunctors, and open hypergraph categories motivate composition on open graphs without adding facts on faces; QD, MAP-Elites, CMA-ME, and 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 GateProfile-bound thresholds or role and channel fit — those sit in GateFit. This separation keeps GateFit criteria 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; a checklist row is applied only when its corresponding CV class, witness, publication face, or neighboring relation is present. Before applying any row, name the Solution move it tests; if no such Solution move is present, treat the row 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 and launch rows apply only when a CV-checked step is adjacent to a present gate, crossing, or launch boundary. Publication and assurance rows apply only when the CV result is carried on MVPK faces or consumed by replay or audit. Extension and change rows apply only when species binding, valuation, refresh, or neighboring selector and comparator loci are being changed or consumed.
Static lint (graph and faces)
- CC-TFS‑01: only
U.Transferedges; crossings appear only on gates. - CC-TFS‑05:
⟨L,P,E⃗,D⟩unchanged across raw transfers. - CC-TFS‑09: MVPK faces present; edition & Γ pins where expected; no new numeric claims on faces (E.17).
CV discipline
- Required CV classes here: {UnitsCoherence, LawSetInvariants, Admissibility, LipschitzBounds, TypeDomainRange}; plus
ReinterpretationEquivalencewhen the locus kind isStructuralReinterpretation. None declare or translate planes or comparators. - Open‑world species. Any locus species binds to one of the minimal kinds; adding a new locus kind is out of scope for A.20 and belongs in an
E.18locus-baseline update. - Aggregated CV.Status computed; errors or timeouts imply
CV.Status != pass. - Any wider use beyond the local step names the governing neighboring relation.
CV.Statusis not gate passage, release confidence, assurance, safety acceptance, work occurrence, or work authorization.
Gate coupling
- CC-TFS‑07: when
CV.Status != pass, all GateFit checks report abstain. - CC-TFS‑23: SquareLaw witnesses present on crossings adjacent to CV‑checked steps.
- Any edition citation on faces includes
Bridge+UTSthroughF.9,F.17,E.17, andE.18; comparator or set-return implications useA.19.SelectorMechanism,C.18,C.19,G.5, orG.11when those claims are present.
UNM declaration locus
- CC-TFS‑24:
CG‑Spec,ComparatorSet, andTransportRegistryΦdeclarations are governed by UNM; CV is ref‑only.
Valuation & refresh
- CC-TFS‑18 and CC-TFS‑19: Flow publishes valuation with
PublicationScopeIdandPathSliceId; Γ 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 present.
Didactic hygiene. Readers can see what is step-local mechanism constraint plus CV.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.18 transformation-flow structure coordinates A.20 and A.21 as orthogonal neighboring cores: CV inside transformations; GF at gates with join‑aggregation and DecisionLog. This mirrors effects and handlers (signature vs. handler), and reproducible build vs. release or deployment criteria separation.
SoTA-Echoing (post-2015)
A.20 result in local-constraint and reproducible-pipeline practice: 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-use claim, or refresh authority. The local A.20 result is step, CV class, CV.Status, witness or refusal, attempted stronger use without a governing relation, and the named governing neighboring relation when a gate, release, assurance, work, comparator, or refresh claim is present. Reopen the local result when the CV status, witness, governing definition, assumption, edition, window, PathSlice, or consuming neighboring relation changes.
Relations
- Governed by
E.18transformation-flow structure. Loci are graph-positioned positions for atomic transformations and adjacent governed values; onlyU.Transferedges; open-world species over a minimum locus baseline; CV=>GF activation; MVPK faces; SquareLaw on crossings; CC-TFS-06-EX forStructuralReinterpretation. - A.21 (GateProfilization). Sole point for GateFit checks and
GateProfile-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, and E.18 (Bridge+UTS loci). Boundary-publication requirement whenever faces cite editions.
- A.19.SelectorMechanism, C.18, C.19, G.5, and 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, and G.11. Gate decision stability, equivalence witness references, A.10 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, and Φ 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 or planes occur in CV.
- LawSetInvariants. Mechanism-declared invariants hold (e.g., mass or energy balance in a model, determinism under fixed editions).
- AdmissibilityConditionsSatisfaction. Inputs lie within the windows and guards declared by the mechanism's AdmissibilityConditions; failure yields
degradeorabstainper class policy. Minimum declaration (normative):AdmissibilityDecl := { domains: [{name, structureKind ∈ {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 or plane declaration or translation here; only references. Γ selectors SHALL be explicit. - LipschitzBounds for stability claims. 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 := { boundDerivation ∈ {spectral_norm, CROWN, IBP, rand_smoothing, other}, metric_space: {X: norm_id, Y: norm_id}, bound: value or interval, unitRef?: UnitRef, referencePlaneRef?: ReferencePlaneRef, effective_window: Γ_time(selector), edition: EditionId, certificateRef?: LipschitzCertificateId }. Referenced evidence or certificate value (normative):LipschitzCertificate := { metricId (with units and plane), bound L, boundDerivationId, boundDerivationRef (e.g., spectral estimate or certified robustness bound), validity region (inputs and state), proof sketch or reference }. The bound-derivation technique or its method description MUST be cited; unit reference and plane reference of the metric MUST be explicit; proofs and witness records are referenced; bounds are ref-only at CV; any acceptance action remains GateFit. If the technique itself is relied on as a reusableU.Method, useA.3.1andA.3.2; A.20 only records the CV-bound reference. - 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 and reversibility witness between source and retarget projections; preservation of
⟨L,P,E⃗,D⟩; no comparator, plane, or unit declaration or translation at CV. Witness (normative):ReinterpWitnessorReinterpretationEquivalenceWitness(see §4.7) with:(i)PathSliceId,PublicationScopeId,(ii)bidirectional mapping (iso or optic) with Put-Get and 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 usable only for idempotence and reversibility within the addressed slice. Any EntityOfConcernRef change SHALL haveKindBridge (CL^k)on UTS.
A.20:Appendix B — LEX discipline (summary)
Register token classes (Tech) include: TransformationFlowStructure, TransformationFlowMathDescription, OperationalGate, GateProfile, GateCheckKind, GateCheckRef, DecisionLog, FreshnessTicket, FinalizeLaunchValues, SubflowRef, FlowEmbed, SentinelId, PathSliceId, SliceRefresh, VALATA; discriminators use Base__P2W, Base__EvaluatingAndRefreshing; Tech names are ASCII; aliases for Gamma-time rules and plane lexemes, plus CLPlane and 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 and PathSliceId where slice-local refresh applies through E.18, A.20, and G.11 when refresh wiring is present.
A.20:End
A.21 — GateProfilization: OperationalGate(profile) (GateFit core)
Type: Architectural (A) Status: Stable Normativity: Normative for gate-decision publication by
OperationalGate(profile)underE.18TransformationFlowStructure, A.20 constraint-validity input, and the A.21 CV=>GF activation boundary.
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 GateProfile-bound folds for error|timeout|unknown, and publishes replay-grade traces through MVPK faces, DecisionLog, and EquivalenceWitnessRef.
Use this when. Use A.21 when the question under repair is whether a gate-decision relation publishes a GateProfile-bound GateDecision from declared GateChecks, folds, pins, and rationale.
First useful move. Name the OperationalGate(profile), the current declared GateProfile, the effective GateCheckRef set, the aggregated CV status, and the DecisionLogRef that carries the decision rationale.
Smallest sufficient gate-publication guidance. Use the lightest gate-publication guidance that preserves the next bounded practitioner move. Add crossing fields, launch fields, regulated fields, safety-critical fields, replay witnesses, CrossingBundle, PQG or RSCR, or MIP-run material only when the present 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, A.21 has no gate-decision relation to publish. Once the gate-decision relation is present, 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. Use A.21 only when a present gate-decision relation consumes check refs under a current declared 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 current OperationalGate(profile), GateProfile, effective GateCheckRef set, CV aggregate, GateDecision, DecisionLogRef, scope, currentness, and effective window. If those fields are not recoverable, keep the display as a cue, source pointer, CV result, or evidence question; the evidence claim is governed by A.10, the CV result by A.20, the assurance claim by B.3, the language-quality question by E.19, or the recovered neighboring claim by its own governing pattern. Safety-envelope and assurance claims do not belong to A.21 unless they are declared gate checks consumed under the current GateProfile; their evidence and assurance relations remain with A.10 and B.3. Plain wording remains ordinary unless it changes bounded use, source relation, evidence, gate, assurance, work, decision, or neighboring-pattern relation.
Common wrong interpretation. A green tile, readiness display, or release screen means GateDecision=pass exists. First honest entry: A.21 applies only when a current OperationalGate(profile) consumes declared checks and publishes a GateDecision with DecisionLogRef; otherwise the display remains a cue or source question.
Repaired anti-case: a release screen says all checks are green but no current 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 bounded current gate use until the A.21 gate-decision relation is recoverable.
Same problem, different question under repair. For a gate-bearing transformation-flow problem, use E.18 for transformation-flow structure, graph/path, valuation, or crossing claims, A.20 for internal step validity, A.21 for gate-decision publication, and E.20 for mechanism-meaning placement; do not use the other three until their own claim is present.
Semantic repair target. When A.21 blocks a misleading word, face, alias, or source label, the repair must restore the gate-decision claim: name the current gate-decision relation, current GateProfile, consumed GateCheckRef set, aggregate, GateDecision, and DecisionLogRef that remain available under A.21. Do not stop at a classification of vocabulary or publication faces.
EntityOfConcern and relation separation. Keep the graph value, path relation 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 and G.6), work plan or work occurrence (A.15), and mechanism-governing definition assignment (E.20) distinct. An MVPK face, DecisionLog, evidence value, MIP manifest, or work witness does not stand in for another pattern's project-side value unless that governing pattern consumes it for that relation.
Smallest affected locus. Localize the change to the smallest affected 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 current gate-decision relation, current GateProfile, 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, E.18 Check locus distinct from GateCheckKind, MIP manifest distinct from DecisionLog, ViewpointMap distinct from graph semantics, PathSlice distinct from a performed work occurrence, and GateProfile=Lite distinct from PublishMode=Lite.
Field applicability. Always core for A.21 once the gate-decision relation is present: GateId, GateProfile, effective GateCheckRef set, CV aggregate, GateDecision, and DecisionLogRef. Conditional fields are crossing pins, LaunchGate pre-run barrier fields, regulated or safety-critical evidence refs, equivalence witnesses, and replay or currentness fields; include a conditional field only when the corresponding crossing, launch, regulated, safety-critical, replay, or reuse claim is present.
Retrieval trap guard. When excerpted alone, A.21 DecisionLog fields must not be interpreted as requiring a full regulated log for every cue, guard, or low-risk gate. The DecisionLog content follows the current GateDecision, current GateProfile, and field-applicability 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 current GateProfile, 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-or-fail cue can be treated as gate passage without the A.21 decision relation.
What this buys. A.21 gives the practitioner one place to separate GateProfile 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 occurrence or work-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. Neighboring governing patterns carry the domain truth conditions of their checks.
Within that boundary, A.21:
- aggregates per-check outcomes into a single published
GateDecisionusing the join lattice, - states the CV⇒GF activation boundary: GateFit checks are inactive until
CV.Status=pass, - defines the minimal publication faces and
DecisionLogcontent required to make gate outcomes auditable and replayable, - applies SWP at the gate:
OperationalGate(profile)and itsGateChecks are ref-only with respect to editions, registries, and domain publications or records; A.21 publishes onlyGateDecisionandDecisionLogpins and references, and does 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 value family
OperationalGate(profile)— a gate/check locus in anE.18TransformationFlowStructurethat mediates any GateCrossing: any change inCtxState = ⟨L,P,E⃗,D⟩or entry to performedU.WorkthroughLaunchGate.GateProfile— the profile-bound constraint of the partial functionCtxState_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 includes them by value.GateCheckRef— the publication lexeme that binds a check to(aspect, kind, edition, scope).GateDecision,GateDecisionRationale, andGateDecisionExplanation— 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
GateCheckReffor checks that evaluate fit to the currentGateProfile: plane fit, crossing fit, freshness, evidence, role-channel fit, regulator conformance, and similar profile-fit claims. It is not aU.Type, graph node, record family, module, queue, or stage in the flow. - Ordering & activation. CV is evaluated before GateFit; while
CV.Status != pass, all GateFit checks returnabstain.
Failure cases (diagnostic lens)
- CV ✔, GF ✖: the transformation has passing internal CV, but the gate, profile, role, timing, or evidence fit is wrong.
- CV ✖, GF ?: fix the internal constraint-validity failure first; GF is inactive.
- CV ✔, GF ✔: the gate publishes a
GateDecisionfor the declared crossing; forLaunchGate, this is the gate decision for crossing into performedU.Work, not actual work occurrence.
Non-goals
- No procedural semantics (no scheduling, no API formats, no automation narratives).
- No “second hidden execution order” outside the transformation-flow structure: every check locus is an
OperationalGate(profile)in the sameE.18TransformationFlowStructure; its pluggable GateChecks are declared on that gate/check locus (no floating checks), and only the declared check set and reaction rules vary across gates. - No key, hash, or cache formats: A.21 constrains equivalence and invalidation conditions, but not key materialization.
- No lexical “pseudo-gating”: a lexical alias view is non-decisional and is not modeled as a GateCheckKind.
Problem
Without a unified GateFit core:
- Gate decisions become ad hoc, order-dependent, and hard to audit (especially with multiple independent checks).
- Gate logic enters CV: plane claims, comparator claims, freshness claims, or role-channel claims appear “inside steps”, collapsing the CV and GF separation.
- “Unknown”, “timeout”, or “error” behavior becomes implicit and inconsistent across cases, undermining reproducibility and safety.
- Publication faces drift into “extra semantics” (computed scalars or tool encodings) rather than pins and references, 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 asdegrade. - Human comprehension vs formal minimality. Optional narratives help practitioners understand a gate decision, but are not used as decisions.
- Reuse vs freshness. Decision reuse requires 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.CompareGuardandUSM.LaunchGuardare notGateCheckKinds; they may emitGuardFailevents which are aggregated by the gate referenced by the existing aggregation-assignment fieldGuardOwnerGateIdunder the currentGateProfile(degrade|block) and recorded inDecisionLog. Guard vocabulary is received throughA.2.6; gate aggregation remains here.OperationalGate(profile)is treated as a microkernel: checks are pluggableGateChecks; the gate core aggregates their outputs conceptually, without procedural semantics and without altering the transformation-flow structure.
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 (insufficient for publication).
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 uses the full GateCheckRef with aspect.
Decision terminology separation.
GateDecisionis the published lattice value.GateDecisionRationaleis the minimal structured rationale payload for that decision (check outcomes, folds, witness refs).GateDecisionExplanationis optional, human-readable, derived from the rationale; it does not carry decision status and is not used as one.
Register discipline. Tech labels are ASCII and twin-labeled where the plain form uses symbolic notation.
(Example: paired labels use CLPlane and “CL^plane”, CLKind and “CL^k”, UNM.TransportRegistryPhi and “UNM.TransportRegistryΦ”, GammaTimeRule and “Γ_timeRule”.)
CV⇒GF activation predicate (counterfactual boundary)
GateFit checks are defined as inactive unless CV.Status=pass:
- Let
CV.Statusbe the join-aggregate of allGateCheckRefwithaspect=ConstraintValidity. - For any
GateCheckRefwithaspect=GateFit: IfCV.Status ≠ pass, the GateFit check outcome isabstain. - While
CV.Status ≠ pass(or the currentGateProfilesuppresses narratives), any GateFit-orientedGateDecisionExplanationdoes not apply.
This keeps the boundary crisp: CV explains internal validity; GF explains fit to GateProfile 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 performed U.Work, 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 present, it is not reduced to one immediately preceding step.
- If
Prev.CV.Status ≠ pass, then (i) all GateFit-scoped LaunchGate checks returnabstainby activation, and (ii) the overall LaunchGate decision is forced toblock(pre‑run barrier). The rationale records the predecessor CV status and the forced-block rule inDecisionLog.
This is a publication-safety invariant: it constrains which GateDecision may be published for 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 current GateProfile.
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:
- the aggregated
GateDecision, and - its
GateDecisionRationalerecorded in theDecisionLog.
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=LiteGateProfile value. Treat this as an alias only, and do not confuse it withPublishMode=Lite(a publication-face reduction mode).
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 confusing
LiteandLean).GateProfile=Lite|Core|SafetyCritical|RegulatedXis the GateProfile value that determines the effective GateCheck set and fold policies.PublishMode=Liteis a publication-face reduction mode (AssuranceLane‑Lite or TechCard‑Lite) and is not interpreted as a reduced-obligationGateProfile.
- A
GateProfileis an attribute of a branch orPathSlice; the default isCore. - Local overrides may change the current
GateProfilefor the current GateCrossing and its subordinate scope but cannot reduce the already-effective set ofGateCheckKinds; the override adds checks only. Weakening uses a newPathSlicevia sentinel. PublishMode=Litechanges face reduction only and does not weaken the check set or aggregation rule.
Scope and merge semantics (lane|locus|subflow|profile)
- Each
GateCheckRefdeclares its scope;subflowscope is bounded by a sentinel bridge (restart or refresh boundary). - The effective check set is formed by union across all declared scopes; duplicates by
kindmerge by the same join rule (“worst wins”), and all rationales are preserved inDecisionLog.- For
RegulatedConformance(X), the identity of X and its rule and edition reference are part of the rationale record; multipleRegulatedConformance(X{…})may coexist in one gate.
- For
- A check outside its scope reports
abstain.
Publication repeatability, caching, and re-aggregation triggers
Repeatability (publication). Gate decisions must be replayable from declared pins and references: no implicit "latest" or "now". If a currentness selector is expressed through Γ_time or a Γ_timeRule, the DecisionLog records the selector, the resolved window, and the resolution rule used for the gate decision.
Caching constraint (publication). A gate decision is cacheable 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. The cached decision remains reusable while the declared freshness or evidence window remains current under the current GateProfile.
Re-aggregation triggers (non-exhaustive, normative). Re-aggregation is required if any of the following changes (slice-local; no method sequence implied):
- any component of
editions{...}changes (anyedition_key -> EditionIdbump), - any
GateCheckRef.editionchanges (including regulator X editions forRegulatedConformance(X)), - the declared
Γ_timeselector changes or resolves differently, - a relevant
FreshnessTicketexpires or changes, or TOCTOU window constraints change, - a sentinel-bounded
subflowrefresh adds an SCR or RSCR reference to theDecisionLogrationale-reference set, - any input breaks the declared
A.21equivalence witness.
Decision stability is under the A.21 equivalence relation; a witness is recorded on the DecisionLog (see §4.10). A.21 constrains equivalence and 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 and references (no new numeric claims; no input-output relisting).
Minimum pins (PlainView, TechCard, or AssuranceLane where applicable).
- View scope:
PublicationScopeIdwith MVPK profile (Min|Lite|SetReady|Max) - Identity:
GateId,BridgeId,PathId,PathSliceId - Temporal:
DesignRunTagFrom,DesignRunTagTo - Profile:
GateProfile(PublishModechanges only face reduction) - Checks: list of
GateCheckRef(aspect,kind,edition,scope) - CV: aggregated
ConstraintValidityStatusand optionalConstraintValidityWitnessRef(refs only) - Editions:
editions{...}vector andEditionPins{CGSpec, ComparatorSet, UNM.TransportRegistryPhi}- Gate-requirement on edition refs. Any face that cites
CGSpec,ComparatorSet, orUNM.TransportRegistryPhieditions also includesBridgeCardand UTS row throughF.9,F.17,E.17, andE.18; otherwise downstream consumption is non-conformant.
- Gate-requirement on edition refs. Any face that cites
- ReferencePlane and CL: source
ReferencePlanepins and targetReferencePlanepins;CLPlaneandCL^plane(for non-crossings the field value isCL^plane = none, but pins are still explicit); any Φ penalties are published as rule refs and appear in the R-channel only. - Freshness: declared
GammaTimeandΓ_timepin plus presence or absence ofFreshnessTicket(refs). - Evidence: SCR or RSCR references plus VALATA (
VA,LA,TA) presence on AssuranceLane. - Guards:
USM.CompareGuardandUSM.LaunchGuardapplicability pins (presence-only; GuardFail uses theA.2.6guard vocabulary and is aggregated here by the gate referenced by the existing aggregation-assignment fieldGuardOwnerGateId). - Decision: aggregated
GateDecisionandDecisionLogRef.
Lean face (PublishMode=Lite). It can fold to GateProfile, GateChecks, EditionPins, GateDecision, and DecisionLogRef, but:
- it keeps
GateProfileandDecisionLogRef, - it does not weaken GateChecks or the aggregation algebra, and
- if
EditionPinsare present, it still includesBridgeCardand UTS row throughF.9,F.17,E.17, andE.18and preserves the crossing boundaries (explicitReferencePlane,CLPlane, and Φ to R-channel only).
DecisionLog (minimum composition)
DecisionLog is an append-only record of reasons and references:
- gate identity,
PathSliceId, andPublicationScopeIdwhen the log is published via a face bundle; - each
GateCheckKind, itsGateCheckRef.edition, and its folded outcome (pass|degrade|block|abstain) including the appliederror|timeout|unknownfold; - rule references and evidence references (SCR or RSCR references plus VALATA bindings); SquareLaw mismatched pins appear only when the crossing check is present;
- policy-id dependencies used by checks, as
PolicyIdRefbundles per F.8:8.1;Φ(CL),Φ_plane, andΨ(CL^k)appear only when bridge or crossing is present, while gate-local policy ids appear only when consulted by the currentGateProfile; GuardFailevents only when guard events exist; if present, they are received fromUSM.Guardsand aggregated by the gate referenced by the existing aggregation-assignment fieldGuardOwnerGateIdwith the appliedGateProfilerule (degrade|block);EquivalenceWitnessorEquivalenceWitnessRefas anA.21publication record field, minimally:{ keys, E⃗, Γ_time(selector), PathSliceId?, ReturnShapeClass, ComparatorSetRef?, GateProfile }; useG.6orG.11where evidence-provenance visibility or refresh implications are present;- the declared publish reaction for
degrade|blockonly when that outcome has a declared publication consequence, including any local "degrade mode" notes when theGateProfilepermits them; - for
RegulatedConformance(X), only whenRegulatedConformance(X)is present: the identity of X and the rule references and edition references used.
GateFit check catalog boundary
Mandatory on LaunchGate. FreshnessUpToDate, DesignRunTagConsistency.
Declared GateFit check catalog (non-exhaustive, normative minima).
DesignRunTagConsistency(mandatory on LaunchGate; may appear elsewhere)FreshnessUpToDate(mandatory on LaunchGate; may appear elsewhere)ReferencePlaneCrossingComparatorConstraintRules (CSLC)EvidenceCompletenessSafetyEnvelopeRegulatedConformance(X)(X identity plus edition and rule refs are recorded inDecisionLog)RoleChannelFit(roles are KernelU.Roletokens; channel fit is a separate check component, not an alias string)EquivalencePreservationOutflowAuditSnapshotConsistency
Neighboring-governance truth examples (informative). A.21 names and aggregates the check; it does not decide the domain truth condition. EvidenceCompleteness is governed by A.10, G.6, or B.3; RoleChannelFit is governed by A.2, A.15, or A.2.6; ReferencePlaneCrossing is governed by E.18, F.9, F.17, and UNM; ComparatorConstraintRules is governed by 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 present; SafetyEnvelope and RegulatedConformance(X) are governed by 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 holds:
gate_out ∘ transfer = transfer' ∘ gate_in.
Profile selection or inheritance does not weaken this requirement; inconsistency yields block or degrade within the current GateProfile 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 publication can include a LexicalResolutionRef or LexicalView for traceability of alias resolution, but:
- it does not participate in aggregation, and
- it is not a
GateCheckinput and cannot changeGateDecision.
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 establish A.21 decision reuse.
Tell. A PathSlice includes a LaunchGate immediately before performed U.Work that can finalize binding. The current GateProfile is RegulatedX. The gate publishes a single GateDecision and a DecisionLog explaining the release-crossing decision, 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 or 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 not applicable). 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 PathSlice includes 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 and 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
The built-in biases of this pattern 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
PathSliceIdfor 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
GateDecisionlattice and explicit “does not apply” boundaries. Risk: oversimplifying nuanced epistemic uncertainty; mitigation: preserve structured rationales and check-scopedunknownpolicies 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; a checklist row is applied only when its corresponding gate, check set, decision, crossing, launch, publication, or assurance move is present. Before applying any row, name the Solution move it tests; if no such practitioner move is present, treat the row as orientation-only or not applicable rather than expanding the applied assurance or conformance material.
Conformance groups. Ordinary gate use starts with the current gate, check set, CV aggregate, GateDecision, and DecisionLogRef. Crossing and launch rows apply only when the gate is a GateCrossing or LaunchGate. Publication and assurance rows apply only when MVPK faces, evidence references, decision stability, or replay are present. Extension and change rows apply only when lexical tokens, profile variants, or neighboring policy or evidence loci are being changed or consumed.
Minimum unified conformance for A.21 and for any PathSlice or gate-bearing transformation-flow value where GateFit discipline is asserted:
Core gate semantics
- CC‑TFS‑06: all GateCrossings (CtxState changes, and work-boundary crossings via LaunchGate) are mediated by
OperationalGate(profile)and have aDecisionLog. - CC‑TFS‑07: CV=>GF activation predicate holds (
CV.Status!=pass => GF=abstain). - CC-TFS-21: decision stability witness is present on the
DecisionLogrecord as anA.21EquivalenceWitnessorEquivalenceWitnessRef. - CC‑TFS‑21a: aggregation is the join on
GateDecisionvaluesabstain <= pass <= degrade <= block;GateDecisionExplanationis optional and non-decisional. - CC‑TFS‑22:
error|timeoutfolds are profile-bound;unknownfolds 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 current
OperationalGate(profile), effectiveGateCheckRefset, aggregate,GateDecision,DecisionLogRef, scope, currentness, and effective window are recoverable.
LaunchGate discipline (pre-run barrier)
-
CC‑TFS‑08: every performed
U.Worklaunch boundary has one and only oneLaunchGatewith mandatoryFreshnessUpToDateandDesignRunTagConsistency; pre‑run barrier: ifConstraintValidityStatus!=passover the declared ingress predecessor set or ingress cut-set for the addressedPathSlice, then all LaunchGate GateFit checks areabstainand the overallGateDecision=block(logged). -
Pre‑Run barrier is satisfied for any
U.WorkwhereFinalizeLaunchValuesis possible.
Publication and evidence
-
CC‑TFS‑20:
PublishMode=Litechanges face reduction only; required GateChecks remain intact. -
CC‑TFS‑25: AssuranceLane carries
GateProfile,GateCheckReflist, edition pins,GateDecision, andDecisionLogRefwith the two-part evidence scheme (SCR or RSCR plus VALATA).
Cross-boundary additions (when the gate is a crossing)
- CC‑TFS‑11: crossings publish
BridgeId + UTS + CLPlaneandCL^plane; penalties appear in the R-channel only. - CC‑TFS‑23: SquareLaw holds on crossings; mismatch yields
block|degradeper 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 and 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 and references (no new numeric claims), and DecisionLog captures rationale without procedural commitments.
Trade-offs
- More decision records to publish. Decisions are not just binary pass-or-fail values: they require rationales, pins, and logs.
- Two-stage reasoning. Users need the rule “GF does not apply until
CV.Status=passholds”; 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 gate/check loci and decision publications, not an external execution sequence; this keeps a second hidden execution order outside the gate core from appearing.
-
The join lattice provides minimal, monotone aggregation with two useful properties:
- early absorption at
blockwithout specifying execution strategy, and - deterministic publication semantics (commutative, associative, and idempotent).
- early absorption at
-
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|unknownmake safety review result inspectable and profile-specific without inventing new decision values.
SoTA-Echoing
Source references (post-2015) that this pattern adopts, adapts, or rejects, consistent with the transformation-flow goal of assured lanes, open graph composition, and join-semantics.
-
Adopt. Join-semilattice aggregation as deterministic, profile-bound merge (distributed-systems and 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
GateDecisionunder the same currentGateProfileand 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 and 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 release procedure, 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.
Gate-publication result in attestation-shaped practice: 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 a current OperationalGate(profile), current GateProfile, effective GateCheckRef set, CV aggregate, GateDecision, DecisionLogRef, scope, currentness, and effective window, or else the display remains a cue, source pointer, CV result, or evidence question governed outside A.21. Reopen the gate result when the current GateProfile, check set, CV aggregate, decision, rationale, scope, currentness, effective window, equivalence witness, or consuming neighboring relation changes.
Relations
E.18transformation-flow structure →coordinates→ A.21. GateFit-scoped GateChecks are aggregated byOperationalGate(profile); GateCheck enumeration and publication shape are governed here.- A.20 →couples_to→ A.21 via CV=>GF. CV is evaluated inside transformations; while
CV.Status!=pass, GF isabstainand 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 project-local profile matrix material is not separately governing unless a current governing pattern includes it by value.
- E.18 and G.11 →provide→ scope and refresh boundaries.
subflowscope is bounded and restartable through PathSlice and refresh wiring where present; weakening check sets use a newPathSlice. - F.9, F.17, E.17, and E.18 →required_by→ any edition-citing face. Whenever gate faces cite editions, the compatibility reference (BridgeCard + UTS +
CLandCLPlane) is required for downstream consumption. - A.21, G.6, and G.11 →define→ equivalence for decision stability. Gate decisions are stable only under the declared equivalence witness; evidence-provenance or refresh implications use
G.6orG.11where present.
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 U.Structure as the 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 declared substrate, which relation, constraint, invariant, or variation matters, what is preserved, what is lost or hidden, and which admissible use or stop condition follows.
The first useful move is small:
StructureQuestionCard@Project is a project-side triage aid for this selected-structure move. It is not a new structure kind. Fill the reliance row only when extraction, coarsening, source-description, base-dependence, grounding, evidence, lens, simulation, representation, or action reliance is being claimed; otherwise leave it unused and keep the move on selected structure.
Stop at this card when it makes the next structure move clear. Open heavier records only when a named description, view, publication, extraction, coarsening, comparison, mathematical-lens, architecture-description, or other neighboring claim is being made.
What goes wrong if A.22 is missed: the practitioner reasons from the visible diagram, source, lens output, generated representation, project record, or architecture description instead of asking which organization is selected and what loss or reliance boundary matters for action.
What A.22 buys in practice: a practitioner can name selected structure, state preserved and lost structure, name source or lens reliance only when it is being claimed, add a SourceReturnCondition when 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: when the wording still may name a structure, a structure description, an architecture description, a view, a publication form, or another governed claim, use [C.30.P](/generated/patterns/C.30.P) or [C.30.STRAT](/generated/patterns/C.30.STRAT) first as triggered. Apply A.22 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 publication form;
- 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
Solution
Select U.Structure as the A.22 ontic head: a dependent, non-agentive EntityOfConcern used when selected organization changes a next engineering or reasoning move.
U.Structureis 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 A.22 ontic head is intentionally narrow. U.Structure is the selected organization under concern: typed relations, constraints, invariants, variation classes, operation or dynamics references, preserved organization, and lost organization over a declared substrate in a bounded context. The grounding object may be a U.Holon, U.System, U.Episteme, declared substrate, or another governed value named by the current use; the selected structure remains the structure of or over that object.
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, publication forms, and renderings are 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. 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 forms, publication units, and renderings only make the episteme or view available.
A.22 governs U.Structure as a dependent, non-agentive ontic head. 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.
Selected Structure Object
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.
Compact auxiliary boundary
Use description, publication, source, evidence, work, gate, decision, release, architecture-description, and mathematical-lens patterns when those claims are being made. A.22 keeps only the selected-structure portion and the source-return condition that protects that structure use. A publication, diagram, graph, table, dashboard, file, model card, generated representation, or lens output may make a structural description or view available; it does not become the selected structure or supply neighboring claim authority by appearance.
Structure claim reliance relation selection
A.22 does not mint a local generic reliance record. When a structure claim relies on something beyond the selected structure itself, choose the reliance relation named by value kind and governing pattern:
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 generic reliance record to make the claim look governed.
U.Structure does not carry description, representation, extraction, mathematical-lens, simulation, or generic reliance 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, publication forms, 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.
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.
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, ArchitectureTransformationFlowStructureRelation@Context, 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
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:
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.
Archetypal Grounding
Bias-Annotation
Lenses tested: Arch, Onto, Epist, Prag, Did, Gov. Scope: universal within FPF structure claims.
This checklist verifies the preceding guidance after the practitioner has chosen the selected move; it is not a required project control form and not a substitute for the card, note, view, relation, or repair move above.
Conformance Checklist
Common Anti-Patterns and How to Avoid Them
Consequences
Rationale
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
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, E.24, E.24.PUB, and F.18.
Coordinates with: C.30.P, C.30.STRAT, C.30, C.30.ASV, C.30.TFS-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
Last Updated: 2026-06-17 — upstream FPF commit 646b0b9b (github.com/ailev/FPF)